Encyclopedia Masses Masses Mass Genesis T10 Anchor Load Transport Composition Commit Settlement Wind
ARTICLE 4 claims 4 theorems
Masses Mass Genesis T10 Anchor Load Transport Composition Commit Settlement Wind
A single formal theorem rules out an entire family of explanations for how particle mass arises, by showing that ordinary rational arithmetic can never carry the required load.
The rational window
The declaration commitSettlementWindow_gaussianRational concerns a specific mathematical object: a settlement window, a discrete record of eight positions that a recognition event writes into a ledger. The theorem states that each of the eight basic settlement windows has coordinates that are Gaussian rationals, meaning every real and imaginary part is a fraction of two whole numbers. This is a structural fact about the alphabet of postings the framework uses, not a claim about any particular physical measurement.
The substance of the result is what this rationality implies. Because each basic window is Gaussian rational, any finite combination of them with rational weights is also Gaussian rational. The framework's library proves this in compositePosting_gaussianRational, and from that follows the key exclusion: the neutralized load of any such combination is a rational number. The load is the squared amplitude of the window after a neutralization step, a quantity the mass law requires to reach a specific value. That required value, for every charged fermion row, is irrational. The theorem required_load_ne_gaussianRational_load therefore proves that no rational superposition of the eight settlement postings can ever produce the load the mass law demands.
This closes a whole family of candidate explanations at once. One might hope that stacking N unit postings coherently, giving load proportional to N squared, or incoherently, giving load proportional to N, could reach the target. Both fail, and so does every mixture between them, because any such window has rational ticks and therefore rational load. The obstruction is structural, not a matter of unlucky numbers. The only thing that survives it is a rule that introduces irrationality of its own, and the module names that rule as an algebraic target: a per-rung multiplicative factor of the golden ratio, with the count in the exponent. Whether the ledger actually supplies such a transport operation is explicitly left open.
What the declaration does not claim is just as important as what it proves. It does not exhibit any physical window undergoing the proposed transport; the operation rungTransport is introduced as a definition, not derived from the ledger. The scalar chosen, the square root of the golden ratio, was selected precisely so that the load would scale by the golden ratio, so the transport algebra is a property of that choice and not evidence for it. The equality that expresses the required load as a transported load is a rearrangement of the closed form, not an independent result. The transport count itself is read off the topology as an input, not derived as a number of physical operations. The theorem establishes the shape any successful mechanism must have, and nothing more.
THEOREM commitSettlementWindow_gaussianRational · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.lean
/-- A settlement posting takes values in `{0, 1, -1}`, so it is rationally valued. -/
theorem commitSettlementWindow_gaussianRational (p : Fin 8) :
GaussianRationalWindow (commitSettlementWindow p) := by
intro t
by_cases h1 : t = p
· exact ⟨1, 0, by rw [h1, commitSettlementWindow_at_commit]; norm_num,
by rw [h1, commitSettlementWindow_at_commit]; norm_num⟩
by_cases h2 : t = p + 1
· exact ⟨-1, 0, by rw [h2, commitSettlementWindow_at_clear]; norm_num,
by rw [h2, commitSettlementWindow_at_clear]; norm_num⟩
· have hz := commitSettlementWindow_adjacentPairSupport p t h1 h2
exact ⟨0, 0, by rw [hz]; norm_num, by rw [hz]; norm_num⟩
THEOREM compositePosting_gaussianRational · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.lean
theorem compositePosting_gaussianRational (n : Fin 8 → ℚ) :
GaussianRationalWindow (compositePosting n) :=
gaussianRational_ratCombination n commitSettlementWindow
commitSettlementWindow_gaussianRational
THEOREM required_load_ne_gaussianRational_load · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.lean
/-- **No rationally valued window carries the required anchor load.** -/
theorem required_load_ne_gaussianRational_load
(s : Anchor.Sector) (r Z : ℤ) (hZ : 0 ≤ Z)
(hp : Int.fib (Anchor.r0 s + r - 13)
+ Z * Int.fib (Anchor.r0 s + r - 14) ≠ 0)
{w : PhotonWindow} (hw : GaussianRationalWindow w) :
MassLaw.predict_mass s r Z / 8 ≠ normSq8 (neutralize w) := by
obtain ⟨c, hc⟩ := gaussianRational_load_rat hw
rw [hc]
exact required_load_ne_rat s r Z hZ hp c
THEOREM rungTransport_load · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.lean
/-- Transport multiplies the neutralized load by `φ`. -/
theorem rungTransport_load (w : PhotonWindow) :
normSq8 (neutralize (rungTransport w))
= Constants.phi * normSq8 (neutralize w) := by
have hsq : Real.sqrt Constants.phi ^ 2 = Constants.phi :=
Real.sq_sqrt Constants.phi_pos.le
have hshape : rungTransport w
= fun t => ((Real.sqrt Constants.phi : ℝ) : ℂ) * w t := rfl
rw [hshape, normSq8_neutralize_smul, hsq]
What this page does not claim
The declaration does not prove that any physical window undergoes the proposed rung transport operation. The declaration does not derive the transport count from the topology; the count is accepted as an input. The declaration does not establish that the golden-ratio transport law is realized, only that any successful mechanism must have that shape.
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/MassGenesis/T10AnchorLoadTransportComposition.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:
- Does the ledger supply an operation that multiplies a posting's amplitude by the square root of the golden ratio?
- What physical mechanism could realize the per-rung transport that the algebraic target describes?
- How is the transport count r0 + rung - 14 derived from the topology rather than assumed as an input?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM commitSettlementWindow_gaussianRational · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.lean
/-- A settlement posting takes values in `{0, 1, -1}`, so it is rationally valued. -/ theorem commitSettlementWindow_gaussianRational (p : Fin 8) : GaussianRationalWindow (commitSettlementWindow p) := by intro t by_cases h1 : t = p · exact ⟨1, 0, by rw [h1, commitSettlementWindow_at_commit]; norm_num, by rw [h1, commitSettlementWindow_at_commit]; norm_num⟩ by_cases h2 : t = p + 1 · exact ⟨-1, 0, by rw [h2, commitSettlementWindow_at_clear]; norm_num, by rw [h2, commitSettlementWindow_at_clear]; norm_num⟩ · have hz := commitSettlementWindow_adjacentPairSupport p t h1 h2 exact ⟨0, 0, by rw [hz]; norm_num, by rw [hz]; norm_num⟩each of the eight basic settlement windows has coordinates that are Gaussian rationals, meaning every real and imaginary part is a fraction of two whole numbers commitSettlementWindow_gaussianRational · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.leanTHEOREM compositePosting_gaussianRational · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.lean
theorem compositePosting_gaussianRational (n : Fin 8 → ℚ) : GaussianRationalWindow (compositePosting n) := gaussianRational_ratCombination n commitSettlementWindow commitSettlementWindow_gaussianRationalany finite combination of them with rational weights is also Gaussian rational compositePosting_gaussianRational · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.leanTHEOREM required_load_ne_gaussianRational_load · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.lean
/-- **No rationally valued window carries the required anchor load.** -/ theorem required_load_ne_gaussianRational_load (s : Anchor.Sector) (r Z : ℤ) (hZ : 0 ≤ Z) (hp : Int.fib (Anchor.r0 s + r - 13) + Z * Int.fib (Anchor.r0 s + r - 14) ≠ 0) {w : PhotonWindow} (hw : GaussianRationalWindow w) : MassLaw.predict_mass s r Z / 8 ≠ normSq8 (neutralize w) := by obtain ⟨c, hc⟩ := gaussianRational_load_rat hw rw [hc] exact required_load_ne_rat s r Z hZ hp cno rational superposition of the eight settlement postings can ever produce the load the mass law demands required_load_ne_gaussianRational_load · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.leanTHEOREM rungTransport_load · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.lean
/-- Transport multiplies the neutralized load by `φ`. -/ theorem rungTransport_load (w : PhotonWindow) : normSq8 (neutralize (rungTransport w)) = Constants.phi * normSq8 (neutralize w) := by have hsq : Real.sqrt Constants.phi ^ 2 = Constants.phi := Real.sq_sqrt Constants.phi_pos.le have hshape : rungTransport w = fun t => ((Real.sqrt Constants.phi : ℝ) : ℂ) * w t := rfl rw [hshape, normSq8_neutralize_smul, hsq]the only thing that survives it is a rule that introduces irrationality of its own, and the module names that rule as an algebraic target: a per-rung multiplicative factor of the golden ratio rungTransport_load · IndisputableMonolith/Masses/MassGenesis/T10AnchorLoadTransportComposition.lean