Masses Generation Torsion Bridge Generation Torsion Has Cube Filtration

The cube filtration

In particle physics, the three generations of charged fermions (electron, muon, tau and their heavier cousins) are a stubborn fact: three copies of the same menu of particles, differing only in mass. Recognition Science offers a geometric source for that number. The framework's machine-checked library of formal theorems proves that a specific torsion schedule, a set of integers labeling the generations, is the unique solution to a structural predicate built from the combinatorics of a three-dimensional cube.

The proof, carried by the declaration generationTorsion_has_cube_filtration, establishes that the canonical schedule (0, 11, 17) satisfies a property called CubeGenerationFiltration. That property bundles three facts: the number of generation slots is three, that count equals the number of independent loops in a three-dimensional winding configuration, and the torsion values accumulate by adding the passive field edges (11) and then the cube faces (6) to reach 17. The theorem is not a numerical coincidence; it is a forced consequence of the predicate's definition. The library also proves that any assignment satisfying the predicate must equal the canonical schedule, so the structure admits no alternatives.

The derivation chain is explicit. The ground generation gets torsion 0, meaning no geometric coupling. The second generation gets 11, which is the number of passive field edges in a cube (12 edges minus one active edge per tick). The third gets 17, which is the passive edges plus the six faces. This last value, 17, numerically coincides with the count of crystallographic wallpaper groups (Fedorov, 1891), but the proof treats that as a secondary curiosity. The primary route is the cube arithmetic alone: edges plus faces.

What the declaration does not claim is just as important. The predicate encodes a physical assignment rule: it states that generations couple to cube features in a ground, passive-edge, and face-plus-edge mode. That rule is a structural premise about how fermion generations attach to geometry, not a consequence of the framework's cost functional. Until that coupling is derived from the recognition cost law, the gap is upgraded from hardcoded numerals to an explicit structural premise with a uniqueness proof. The theorem proves uniqueness given the premise; it does not prove the premise itself.

The consequence for the framework is that the number three and the torsion values 0, 11, 17 are no longer arbitrary inputs. They are the unique output of a stated geometric rule. The open question is whether that rule itself can be forced from deeper principles, a target the framework names explicitly rather than claiming to have reached.

/-- At D=3, any cube-admissible schedule equals the canonical `generationTorsion`. -/
theorem cubeAdmissible_forces_canonical (τ : Generation → ℤ)
    (h : CubeAdmissibleTorsion D τ) :
    τ = generationTorsion := by
  rw [← cubeGeoTorsion_eq_generationTorsion]
  funext g
  cases g with
  | first => exact h.ground_is_zero
  | second => exact h.edge_mode
  | third =>
    simp only [cubeGeometricTorsion, W_endo]
    exact h.face_edge_mode

/-- Any torsion schedule with the cube-generation filtration is canonical. -/
theorem cubeFiltration_forces_canonical (τ : Generation → ℤ)
    (h : CubeGenerationFiltration τ) :
    τ = generationTorsion :=
  incremental_forces_canonical τ h.torsion_steps

/-- The canonical schedule has the full cube-generation filtration package. -/
theorem generationTorsion_has_cube_filtration :
    CubeGenerationFiltration generationTorsion where
  slot_count := generationSlotCount_eq_three
  loop_facepair_unification := generationSlotCount_eq_loopCount
  torsion_steps := generationTorsion_incremental

@[simp] lemma cubeGeoTorsion_first : cubeGeometricTorsion .first = 0 := rfl

/-- The second-generation torsion is the passive edge count of Q₃. -/
theorem second_gen_is_passive_edges :
    cubeGeometricTorsion .second = ↑(cube_edges D - active_edges_per_tick) := by
  simp [cubeGeometricTorsion, passive_field_edges]

/-- The third-generation torsion is E_passive + F (endogenous wallpaper route). -/
theorem third_gen_is_Epass_plus_F :
    cubeGeometricTorsion .third = ↑(passive_field_edges D + cube_faces D) := by
  simp [cubeGeometricTorsion, W_endo]

/-- Any cube-admissible schedule at dimension d equals the geometric schedule at d. -/
theorem cubeAdmissible_unique (d : ℕ) (τ : Generation → ℤ)
    (h : CubeAdmissibleTorsion d τ) :
    τ = fun g => match g with
      | .first  => 0
      | .second => (passive_field_edges d : ℤ)
      | .third  => (passive_field_edges d + cube_faces d : ℤ) := by
  funext g
  cases g with
  | first => exact h.ground_is_zero
  | second => exact h.edge_mode
  | third => exact h.face_edge_mode

What this page does not claim

The physical assignment rule for how generations couple to cube features is derived from the cost functional. The numerical coincidence with the wallpaper group count is the primary source of the integer 17. The theorem establishes that three generations exist in nature, only that the schedule is unique given the geometric premise.

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: