pith. machine review for the scientific record. sign in

Explain the Lean theorem `match_rsbridge_rung_charged_leptons` in module `IndisputableMonolith.Masses.RungConstructor.Proofs`. Write for an educated reader who knows science and programming but may not know Lean. Cover: (1) what the declaration says in plain English, (2) why it matters in Recognition Science, (3) how to read the formal statement, (4) visible dependencies or certificates in the supplied source, and (5) what this declaration does not prove. Cite only declarations present in the supplied Recognition source.

Big AI job. Grok 4.3 reads the canon and writes a Lean-grounded derivation; usually 20 seconds to 2 minutes. The page will refresh to your answer when it’s ready.
confidence: high in recognition cached

The theorem match_rsbridge_rung_charged_leptons states that the rung values produced by the new compute_rung constructor for the three charged leptons exactly match the legacy mapping in RSBridge.rung.

(1) In plain English: it asserts that the electron rung is 2, the muon rung is 13, and the tau rung is 19 under both the new constructor and the old RSBridge table, with the three equalities holding simultaneously.

(2) In Recognition Science this matters because the rung constructor is the mechanism that assigns the discrete ladder positions used to derive particle masses via the scaling yardstick * phi^(rung - 8 + gap(Z)). Matching the legacy values for leptons guarantees that the new, more structured constructor (defined in the imported Motif module) reproduces the previously tabulated lepton masses without introducing discrepancies.

(3) The formal statement is a conjunction of three equalities:

compute_rung (.fermion .e) = RSBridge.rung .e ∧
compute_rung (.fermion .mu) = RSBridge.rung .mu ∧
compute_rung (.fermion .tau) = RSBridge.rung .tau

proved by the triple ⟨rfl, rfl, rfl⟩. In Lean, rfl means each equality is true by definitional reduction (the two sides unfold to the same numeral).

(4) Visible dependencies in the supplied source: the theorem lives in IndisputableMonolith.Masses.RungConstructor.Proofs and relies on compute_rung (from the imported Motif module) and RSBridge.rung (from the imported RSBridge.Anchor). It is one of a family of matching theorems; the master version match_rsbridge_rung generalizes it to any Fermion by case analysis. Related individual proofs such as match_lepton_e, match_lepton_mu and match_lepton_tau supply the concrete numerals. Later SDGT variants (e.g. sdgt_agrees_leptons) confirm that the lepton rungs remain unchanged under the sector-dependent generation torsion.

(5) The declaration does not prove the physical origin of the rung numbers, the mass formula itself, the value of the yardstick, the gap function, or any link to the forcing chain or constants derived from phi. It is purely a consistency certificate between two computational representations of the same lepton table.

outside recognition

Aspects Recognition does not yet address:

  • The definition of compute_rung (lives in the imported Motif module, not expanded here)
  • The physical mass scaling formula and yardstick
  • Any derivation of the rung values from the J-cost functional equation or Universal Forcing chain
  • Empirical PDG mass comparisons or falsifiers

recognition modules consulted

The Recognition library is at github.com/jonwashburn/shape-of-logic. The model is restricted to the supplied Lean source and instructed not to invent theorem names. Treat output as a starting point, not a verified proof.