IsSingleCounterUpdate
def
A pair of integer displacements (w₁, w₂) is a single-counter update if at least one coordinate is zero, that is, w₁ = 0 or w₂ = 0.
Statement
def IsSingleCounterUpdate (w₁ w₂ : ℤ) : Prop
- Defined in
- scout/2610-23495-symmetric-two-counter-machines.md:1692
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Used by 4
- single_counter_step_preserves_one_coordIn any single step of a 2-counter machine with single-counter updates, at least one counter remains unchanged.
- two_counter_machine_is_single_counter_updateA 2-counter machine M with state type Q has single-counter updates if for every update transition from q to q' with displacements (w₁,…
- not_is_single_counter_update_diagonalThe simultaneous increment (1, 1) is not a single-counter update.
- is_single_counter_update_axis_xFor any integer displacement w, the vector (w, 0) is a single-counter update.
Read back from the Lean
The predicate IsSingleCounterUpdate takes two integers $w_1$ and $w_2$ and is defined as the proposition that $w_1 = 0$ or $w_2 = 0$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Predicate asserting that a 2-counter displacement vector has at most one non-zero coordinate. -/ def IsSingleCounterUpdate (w₁ w₂ : ℤ) : Prop := w₁ = 0 ∨ w₂ = 0