Encyclopedia Masses Masses Baseline Derivation Generation Ordering General
ARTICLE 3 claims 3 theorems
Masses Baseline Derivation Generation Ordering General
The ordering of particle generations follows from the geometry of a cube, not from free parameters.
Generation ordering
In the Recognition Science framework, particle generations are not arbitrary labels. They are ordered by a structural rule derived from the combinatorics of a three-dimensional cube. The theorem generation_ordering_general states that for any dimension d at least 2, the count of passive field edges is strictly positive, and that this count is strictly less than the count of passive field edges plus cube faces. In plain terms: there is always at least one generation, and the first generation is always smaller than the second.
At the physical dimension d = 3, this rule yields the specific ordering 0 < 11 < 17. The number 11 counts the passive field edges of the cube, and 17 counts those edges plus the cube's six faces. These numbers become the offsets that separate the three particle generations on the framework's mass ladder. The theorem proves the inequality holds in general, for every dimension from 2 upward, not just for the physical case.
The derivation principle is that every integer in this framework traces to a single input: the dimension D = 3. The cube-geometric functions (vertices, edges, faces, passive edges, wallpaper groups) are standard combinatorics applied at D = 3. The generation ordering is therefore not an assumption or a fitted parameter; it is a derived consequence of the cube's geometry.
What the theorem does not claim is equally important. It does not state that these numbers correspond to measured particle masses. The scaling law for masses is proved separately, and the comparison against measured PDG values is an empirical check, not a theorem. The ordering theorem establishes only the relative order of the generation offsets, not their absolute physical meaning. It also does not claim that the dimension d = 3 is forced; that is a separate result about spatial dimensions.
The practical consequence is that the generation structure of matter is not an input to the theory but an output. The same combinatorial rule that orders generations also produces the lepton and quark baselines (2 and 4) and the octave offset (-8). A reader can now see that the generation ordering is not a coincidence of fitted numbers but a structural consequence of the cube geometry that the framework takes as its starting point.
THEOREM generation_ordering_general · IndisputableMonolith/Masses/BaselineDerivation.lean
/-- The ordering generalizes: for any D ≥ 2, 0 < E_pass(D) < W(D). -/
theorem generation_ordering_general (d : ℕ) (hd : 2 ≤ d) :
0 < passive_field_edges d ∧
passive_field_edges d < passive_field_edges d + cube_faces d := by
constructor
· unfold passive_field_edges cube_edges active_edges_per_tick
have : d * 2 ^ (d - 1) ≥ 2 := by
have hd1 : 1 ≤ d - 1 + 1 := by omega
calc d * 2 ^ (d - 1) ≥ 2 * 2 ^ (2 - 1) := by
apply Nat.mul_le_mul hd (Nat.pow_le_pow_right (by norm_num) (by omega))
_ = 4 := by norm_num
_ ≥ 2 := by norm_num
omega
· unfold cube_faces
omega
THEOREM generation_ordering · IndisputableMonolith/Masses/BaselineDerivation.lean
/-- **B-14 DERIVED**: Generation torsion is strictly ordered. -/
theorem generation_ordering :
(0 : ℕ) < passive_field_edges D ∧
passive_field_edges D < wallpaper_groups := by
constructor
· -- 0 < 11
native_decide
· -- 11 < 17
native_decide
THEOREM generation_ordering_general · IndisputableMonolith/Masses/BaselineDerivation.lean
/-- The ordering generalizes: for any D ≥ 2, 0 < E_pass(D) < W(D). -/
theorem generation_ordering_general (d : ℕ) (hd : 2 ≤ d) :
0 < passive_field_edges d ∧
passive_field_edges d < passive_field_edges d + cube_faces d := by
constructor
· unfold passive_field_edges cube_edges active_edges_per_tick
have : d * 2 ^ (d - 1) ≥ 2 := by
have hd1 : 1 ≤ d - 1 + 1 := by omega
calc d * 2 ^ (d - 1) ≥ 2 * 2 ^ (2 - 1) := by
apply Nat.mul_le_mul hd (Nat.pow_le_pow_right (by norm_num) (by omega))
_ = 4 := by norm_num
_ ≥ 2 := by norm_num
omega
· unfold cube_faces
omega
What this page does not claim
The theorem does not state that the numbers 11 and 17 correspond to measured particle masses. The theorem does not claim that three spatial dimensions are forced; that is a separate result. The theorem does not establish absolute physical meaning for the generation offsets.
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/BaselineDerivation.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:
- How does the generation ordering connect to the measured masses of the three particle generations?
- What physical mechanism selects the dimension D = 3 as the one realized in nature?
- How do the lepton and quark baselines relate to the generation offsets in the full mass ladder?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM generation_ordering_general · IndisputableMonolith/Masses/BaselineDerivation.lean
/-- The ordering generalizes: for any D ≥ 2, 0 < E_pass(D) < W(D). -/ theorem generation_ordering_general (d : ℕ) (hd : 2 ≤ d) : 0 < passive_field_edges d ∧ passive_field_edges d < passive_field_edges d + cube_faces d := by constructor · unfold passive_field_edges cube_edges active_edges_per_tick have : d * 2 ^ (d - 1) ≥ 2 := by have hd1 : 1 ≤ d - 1 + 1 := by omega calc d * 2 ^ (d - 1) ≥ 2 * 2 ^ (2 - 1) := by apply Nat.mul_le_mul hd (Nat.pow_le_pow_right (by norm_num) (by omega)) _ = 4 := by norm_num _ ≥ 2 := by norm_num omega · unfold cube_faces omegaThe theorem generation_ordering_general states that for any dimension d at least 2, the count of passive field edges is strictly positive, and that this count is strictly less than the count of passive field edges plus cube faces. generation_ordering_general · IndisputableMonolith/Masses/BaselineDerivation.leanTHEOREM generation_ordering · IndisputableMonolith/Masses/BaselineDerivation.lean
/-- **B-14 DERIVED**: Generation torsion is strictly ordered. -/ theorem generation_ordering : (0 : ℕ) < passive_field_edges D ∧ passive_field_edges D < wallpaper_groups := by constructor · -- 0 < 11 native_decide · -- 11 < 17 native_decideAt the physical dimension d = 3, this rule yields the specific ordering 0 < 11 < 17. generation_ordering · IndisputableMonolith/Masses/BaselineDerivation.leanTHEOREM generation_ordering_general · IndisputableMonolith/Masses/BaselineDerivation.lean
/-- The ordering generalizes: for any D ≥ 2, 0 < E_pass(D) < W(D). -/ theorem generation_ordering_general (d : ℕ) (hd : 2 ≤ d) : 0 < passive_field_edges d ∧ passive_field_edges d < passive_field_edges d + cube_faces d := by constructor · unfold passive_field_edges cube_edges active_edges_per_tick have : d * 2 ^ (d - 1) ≥ 2 := by have hd1 : 1 ≤ d - 1 + 1 := by omega calc d * 2 ^ (d - 1) ≥ 2 * 2 ^ (2 - 1) := by apply Nat.mul_le_mul hd (Nat.pow_le_pow_right (by norm_num) (by omega)) _ = 4 := by norm_num _ ≥ 2 := by norm_num omega · unfold cube_faces omegaThe generation ordering is therefore not an assumption or a fitted parameter; it is a derived consequence of the cube's geometry. generation_ordering_general · IndisputableMonolith/Masses/BaselineDerivation.lean