generationTorsion_has_cube_filtration
plain-language theorem explainer
The canonical charged-generation torsion schedule carries the full cube-generation filtration: three slots, identified with the three independent Q₃ loops (face-pairs), with torsion accumulating by an edge step then a face step. Mass and excitation-ordering arguments cite it to transfer filtration structure from the geometric schedule onto CW and RCL-forced torsion. The proof is a three-field structure instance, each field discharged by a named equality or incremental lemma.
Claim. The canonical generation torsion map $\tau:\mathrm{Generation}\to\mathbb{Z}$ satisfies the cube-generation filtration package: the generation slot count equals $3$; that count equals the number of independent loops (equivalently face-pairs) of the $3$-cube $Q_3$; and $\tau$ is incremental cube torsion (an edge increment followed by a face increment).
background
The Generation Torsion Bridge module is the geometric source of truth for charged-generation torsion ${0,11,17}$. It derives the schedule from $D=3$ cube combinatorics alone: generation 1 (ground) has $\tau=0$; generation 2 (edge-dressed) has $\tau=E_{\mathrm{passive}}(D)=\mathrm{cube_edges}(D)-1=11$; generation 3 (face+edge-dressed) has $\tau=W_{\mathrm{endo}}(D)=E_{\mathrm{passive}}+F=17$. No raw numerals appear in the geometric definition; agreement with the Anchor and RecogSpec schedules is proved pointwise.
CubeGenerationFiltration packages the strongest structural claim currently on the theorem surface: exactly three generation slots; those slots coincide with the three independent $Q_3$ loops / face-pairs; torsion accumulates by an edge increment followed by a face increment. What remains open is deriving that filtration from the cost functional alone; the coupling rule (ground / passive-edge / face+edge) is still a structural premise, not an RCL consequence.
The eight-tick octave and $D=3$ (forcing chain T7–T8) fix the cube geometry that supplies the three slots and the edge/face census used here.
proof idea
Term-mode structure instance for CubeGenerationFiltration on the canonical schedule. Three fields, three lemmas:
slot_countis filled bygenerationSlotCount_eq_three(exactly three generation slots).loop_facepair_unificationis filled bygenerationSlotCount_eq_loopCount(slot count equals the independent-loop count of $Q_3$).torsion_stepsis filled bygenerationTorsion_incremental(the schedule is incremental cube torsion: edge step, then face step).
No further rewriting or case analysis; the proof is pure field discharge.
why it matters
This is the certificate that the geometric (canonical) torsion schedule already carries the full filtration package. Downstream, cwTorsion_has_filtration rewrites CW cumulative torsion to the canonical schedule and applies this theorem, so the CW filtration inherits the same three-slot / loop / incremental structure. Separately, rcl_forced_implies_filtration uses uniqueness of RCL-forced torsion plus this result: any RCL-forced schedule equals the canonical one, hence satisfies the filtration.
In the framework, the integers ${0,11,17}$ are the charged-generation torsion rungs on the $\varphi$-ladder mass formula. The module upgrades the gap from hardcoded numerals to an explicit structural premise with uniqueness; the remaining open step is deriving the ground/edge/face coupling from the Recognition Composition Law rather than positing it. The $D=3$ cube arithmetic (T8) and the three independent loops are the geometric backbone.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.