alpha_signed_cell
def
A cell of a positive sequence, with alternating signs and zero padding.
Statement
def alpha_signed_cell (a : List ℕ) (i : ℕ) : ℤ- 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 9
- alpha_lexical_ltThe source alternating lexicographic order on positive integer sequences.
- alpha_lexical_lt_iff_inverse_prefixOn equal-length positive encodings, lexical order is exactly inverse Gray-rank order.
- alpha_lexical_meet_is_lexicalThe source common-prefix meet of two nonempty positive lexical sequences is lexical, even if their sums differ.
- 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_odd_completion_iff_rotation_max_of_primeThe proposed encoding bridge between positive lexical sequences and nonconstant odd-parity maximum-rank necklace representatives at odd…
- alpha_elementary_lexical_meetProposed helper discharging the lexical common-prefix hypothesis in the published adjacency criterion for a valid negative-cell elementary…
- alpha_lexical_lt_irreflThe alternating lexical order is irreflexive.
- 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…
- alpha_lexical_lt_cons_samePrepending the same head to both sequences reverses the alternating lexical order on their tails.
Lean source view module on GitHub
def alpha_signed_cell (a : List ℕ) (i : ℕ) : ℤ := if i % 2 = 0 then (a.getD i 0 : ℤ) else -(a.getD i 0 : ℤ)