Zero total connects circular arcs to actual Good intervals
Abstract
Zero total connects circular arcs to actual Good intervals
Theorem 1.1 (One of two circular runs survives any rooting).
Proof. Machine-checked in Lean as D5/S3/Combinatorics/Sequenceability/ZeroTotalCircleGood.rotated_two_runs (✓ std3). ∎
Source. Repository-derived.
Commentary.
This existing list lemma is exposed for direct reuse by PrivatePairBooleanDescent. For arbitrary lists u,v,w, if u followed by v is a rotation of w, then u or v is a contiguous interval of w. It needs no group structure or decidable equality; empty runs are allowed. The original proof is unchanged.
Theorem 1.2 (Zero total connects circular arcs to actual Good intervals).
Proof. Machine-checked in Lean as D5/S3/Combinatorics/Sequenceability/ZeroTotalCircleGood.good_iff_no_zero_arc (✓ std3). ∎
Source. Repository-derived.
Commentary.
G ranges over additive commutative groups with decidable equality. Sum is coefficient-one original group addition. Good exempts exactly the full word, while Arc is an actual oriented circular run.
Good means that every nonempty proper contiguous interval of an actual original-group word has nonzero sum; only the full word is exempt. At total sum zero, the complement of every proper zero arc is another proper zero arc.
For any rooting of a circle split into two nonempty runs, at least one whole run remains a linear interval. Consequently a zero circular arc makes every rooting bad. Conversely a bad proper interval supplies its actual finite label set and its circular arc. This proves the exact bridge without weakening the interval convention.
References
- Truth anchor:
D5/S3/Combinatorics/Sequenceability/ZeroTotalCircleGood.good_iff_no_zero_arc - Truth anchor:
D5/S3/Combinatorics/Sequenceability/ZeroTotalCircleGood.rotated_two_runs - Dependency: D5/S3/Combinatorics/CircularWords/CircularOrderCount
- Dependency: D5/S3/Combinatorics/Sequenceability/PairedZeroSubsetSpectrum