AFTD Auto-Formalizing Theoretical Domains

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

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)))
See it in the graphDiscuss this resultChallenge it