alpha_elementary_cell_step
def
One source elementary split or conjugation, with a zero-based cell index.
Statement
def alpha_elementary_cell_step (a b : List ℕ) (i : ℕ) : Prop
- Defined in
- Run-length helpers for OP-392, arXiv:2610.24758, Conjecture 1; lexical sequences and elementary operations from arXiv:0810.5205, Definitions 1.1, Section 2, Theorem 3.1 and Corollary 3.3. No new research advance is claimed for these supporting statements.
- Verified
- 24 Oct 2026
- Axioms
- none listed
- Used by 8
- alpha_elementary_cell_step_binary_xorAn elementary operation changes exactly the boundary bit immediately before the untouched suffix.
- alpha_elementary_cell_step_sumElementary splitting and conjugation preserve the degree.
- alpha_lexical_first_negative_step_existsA lexical sequence with at least two cells has an elementary lexical successor at its first negative cell.
- alpha_lexical_even_split_prime_obstructionAt degree parameter 13 there are two ordered lexical sequences of degree 12 with lexical meet (3,1). Splitting the later sequence at its…
- alpha_prime_elementary_meet_nondvdFor a lexical elementary negative-cell step of prime degree, the meet degree cannot divide the ambient prime degree.
- alpha_elementary_lexical_meetProposed helper discharging the lexical common-prefix hypothesis in the published adjacency criterion for a valid negative-cell elementary…
- alpha_elementary_cell_step_length_parityOne elementary operation reverses the parity of the number of cells (source Lemma 2.3).
- alpha_lexical_example_elevenKernel-checked encoding of the length-eleven example in arXiv:0810.5205, Example 3.2, including its one-bit completed words and the…
Lean source view module on GitHub
def alpha_elementary_cell_step (a b : List ℕ) (i : ℕ) : Prop := i < a.length ∧ ((1 < a.getD i 0 ∧ b = a.take i ++ [a.getD i 0 - 1, 1] ++ a.drop (i + 1)) ∨ (0 < i ∧ a.getD i 0 = 1 ∧ b = a.take (i - 1) ++ [a.getD (i - 1) 0 + 1] ++ a.drop (i + 1)))