Encyclopedia Masses Masses Generation Torsion Bridge Generation Slot Count Eq Loop Count
ARTICLE 3 claims 3 theorems
Masses Generation Torsion Bridge Generation Slot Count Eq Loop Count
A machine-checked theorem ties the number of particle generations to the number of independent loops in a cube, and the proof is pure geometry.
The slot-loop identity
In particle physics, the three generations of matter (electron, muon, tau, and their neutrino partners) are a stubborn fact: no one has derived why there are exactly three. The Recognition Science framework offers a geometric answer. Its machine-checked library of formal theorems proves that the number of generation slots equals the number of independent loops in a three-dimensional cube. The declaration generationSlotCount_eq_loopCount states this identity: generationSlotCount = WindingCharges.independent_loop_count 3.
The proof is a chain of equalities. The framework defines generationSlotCount as the number of face pairs of a cube, which is 3. Separately, it proves that the number of independent loops in a cube is also 3. The theorem then unifies these two counts. This is not numerology; it is a formal derivation from the cube's combinatorics. The cube has 6 faces, which form 3 opposite pairs, and it has 3 independent cycles around its axes. The identity shows these are the same number.
In Recognition Science, this identity is part of a larger story. The framework models fermion generations as torsion values, which are geometric coupling strengths assigned to each generation. The ground generation gets 0, the second gets the number of passive edges (11), and the third gets that plus the number of faces (17). The slot-loop identity connects this torsion schedule to the topology of the cube: each generation corresponds to a new independent loop. The framework proves that the minimal loop excitation is unique, meaning there is exactly one way to assign loop counts to generations.
This is a structural result, not a physical measurement. The framework does not claim that the cube is the physical space we inhabit. It claims that within its model, the number of generations is forced by the geometry of a three-dimensional cube. The identity itself is a theorem about combinatorial objects, not about experimental data. The physical premise, that fermion generations couple to cube features, remains an explicit structural assumption in the framework, not a consequence of its cost functional alone.
THEOREM generationSlotCount_eq_loopCount · IndisputableMonolith/Masses/GenerationTorsionBridge.lean
/-- The generation slot count equals the number of independent Q₃ loops. -/
theorem generationSlotCount_eq_loopCount :
generationSlotCount = WindingCharges.independent_loop_count 3 := by
unfold generationSlotCount
simpa [D] using WindingCharges.loops_eq_face_pairs_D3.symm
THEOREM generationSlotCount_eq_three · IndisputableMonolith/Masses/GenerationTorsionBridge.lean
/-- The cube contributes exactly three generation slots. -/
theorem generationSlotCount_eq_three : generationSlotCount = 3 := by
simpa [generationSlotCount, D] using ParticleGenerations.face_pairs_at_D3
THEOREM minimalLoopExcitation_unique · IndisputableMonolith/Masses/GenerationTorsionBridge.lean
/-- Minimal one-new-loop-per-generation-step excitation is unique. -/
theorem minimalLoopExcitation_unique (ℓ : Generation → ℕ)
(h : MinimalLoopExcitation ℓ) :
ℓ = canonicalLoopExcitation := by
funext g
cases g with
| first =>
exact h.ground_level
| second =>
calc
ℓ .second = ℓ .first + 1 := h.second_adds_one
_ = 0 + 1 := by rw [h.ground_level]
_ = canonicalLoopExcitation .second := by simp [canonicalLoopExcitation]
| third =>
calc
ℓ .third = ℓ .second + 1 := h.third_adds_one
_ = (ℓ .first + 1) + 1 := by rw [h.second_adds_one]
_ = (0 + 1) + 1 := by rw [h.ground_level]
_ = canonicalLoopExcitation .third := by simp [canonicalLoopExcitation]
What this page does not claim
The identity does not claim that the cube is physical space. It does not derive the number of generations from the cost functional alone. It does not predict any measured particle property.
Verify this page
Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:
$ lake env lean IndisputableMonolith/Masses/GenerationTorsionBridge.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)
A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.
Derived articles
This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red:
- What physical principle, if any, selects the cube as the geometric source of generation structure?
- How does the torsion schedule {0, 11, 17} relate to measured fermion mass ratios?
- Does the slot-loop identity generalize to dimensions other than three?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM generationSlotCount_eq_loopCount · IndisputableMonolith/Masses/GenerationTorsionBridge.lean
/-- The generation slot count equals the number of independent Q₃ loops. -/ theorem generationSlotCount_eq_loopCount : generationSlotCount = WindingCharges.independent_loop_count 3 := by unfold generationSlotCount simpa [D] using WindingCharges.loops_eq_face_pairs_D3.symmThe declaration generationSlotCount_eq_loopCount states this identity: generationSlotCount = WindingCharges.independent_loop_count 3. generationSlotCount_eq_loopCount · IndisputableMonolith/Masses/GenerationTorsionBridge.leanTHEOREM generationSlotCount_eq_three · IndisputableMonolith/Masses/GenerationTorsionBridge.lean
/-- The cube contributes exactly three generation slots. -/ theorem generationSlotCount_eq_three : generationSlotCount = 3 := by simpa [generationSlotCount, D] using ParticleGenerations.face_pairs_at_D3The framework defines generationSlotCount as the number of face pairs of a cube, which is 3. generationSlotCount_eq_three · IndisputableMonolith/Masses/GenerationTorsionBridge.leanTHEOREM minimalLoopExcitation_unique · IndisputableMonolith/Masses/GenerationTorsionBridge.lean
/-- Minimal one-new-loop-per-generation-step excitation is unique. -/ theorem minimalLoopExcitation_unique (ℓ : Generation → ℕ) (h : MinimalLoopExcitation ℓ) : ℓ = canonicalLoopExcitation := by funext g cases g with | first => exact h.ground_level | second => calc ℓ .second = ℓ .first + 1 := h.second_adds_one _ = 0 + 1 := by rw [h.ground_level] _ = canonicalLoopExcitation .second := by simp [canonicalLoopExcitation] | third => calc ℓ .third = ℓ .second + 1 := h.third_adds_one _ = (ℓ .first + 1) + 1 := by rw [h.second_adds_one] _ = (0 + 1) + 1 := by rw [h.ground_level] _ = canonicalLoopExcitation .third := by simp [canonicalLoopExcitation]The framework proves that the minimal loop excitation is unique, meaning there is exactly one way to assign loop counts to generations. minimalLoopExcitation_unique · IndisputableMonolith/Masses/GenerationTorsionBridge.lean