Masses Mass Genesis Admissibility Construction Full Chain For Bottom Up Evidence

The bottom-up mass chain

In physics, mass can be defined in three independent ways: how much a body resists acceleration (inertial mass), how strongly it responds to gravity (gravitational mass), and the energy locked in its rest frame (rest mass). The Recognition Science framework, which models physical reality as a discrete record of recognition events, has a machine-checked library of formal theorems. One theorem in that library, called full_chain_for_bottomUpEvidence, establishes a precise bridge between these three notions for a class of stable patterns.

The theorem starts with a light pattern, a mathematical object representing a stable configuration of the framework's fundamental ledger. It assumes three pieces of evidence: the pattern is stable under evolution, each site in the pattern carries a local density read directly from the neutral load, and the sum of those local densities equals a factorized mass-law expression. Given these, the theorem proves six conclusions in one stroke: the total load is conserved over time, the rest mass is positive, the pattern is quantized on the golden-ratio rung, rest mass equals predicted mass, and both inertial and gravitational mass equal rest mass.

The force of the theorem is conditional. It does not assert that such evidence exists for any physical pattern; that remains an open target. Rather, it shows that if the evidence can be constructed, then the full mass chain closes: the three mass notions coincide, and the pattern is admissible for the Mass Genesis theorem. The library keeps the hard factorization claim as a named type, not an axiom, so downstream files must supply explicit evidence rather than silently assume the bridge.

What this changes is the shape of the remaining work. A researcher no longer needs to prove the mass equivalence from scratch; they only need to build the bottom-up evidence for a given pattern. The theorem has already converted that evidence into the full chain of mass identities. The open question is whether stable physical patterns actually satisfy the load-factorization condition, a step the framework has not yet derived from its deeper dynamics.

theorem restMass_eq_predictedMass_of_bottomUpEvidence
    (ψ : LightPattern Λ)
    (E : BottomUpAdmissibilityEvidence ψ) :
    restMass ψ = predictedMass ψ :=
  restMass_eq_predictedMass_of_massAdmissible
    (massAdmissible_of_bottomUpEvidence ψ E)

theorem full_chain_for_bottomUpEvidence
    (readout : PatternMassReadout Λ)
    (ψ : LightPattern Λ)
    (E : BottomUpAdmissibilityEvidence ψ)
    (hreads : ReadsStablePatternLoad readout ψ) :
    (∀ k : ℕ,
      integratedMeaningLoad (evolvePattern k ψ) = integratedMeaningLoad ψ) ∧
    0 < restMass ψ ∧
    PhiRungQuantized ψ ∧
    restMass ψ = predictedMass ψ ∧
    readout.inertialMass ψ = restMass ψ ∧
    readout.gravitationalMass ψ = restMass ψ :=
  admissiblePatternMassConclusion readout ψ
    (massAdmissible_of_bottomUpEvidence ψ E) hreads

theorem full_chain_for_bottomUpEvidence
    (readout : PatternMassReadout Λ)
    (ψ : LightPattern Λ)
    (E : BottomUpAdmissibilityEvidence ψ)
    (hreads : ReadsStablePatternLoad readout ψ) :
    (∀ k : ℕ,
      integratedMeaningLoad (evolvePattern k ψ) = integratedMeaningLoad ψ) ∧
    0 < restMass ψ ∧
    PhiRungQuantized ψ ∧
    restMass ψ = predictedMass ψ ∧
    readout.inertialMass ψ = restMass ψ ∧
    readout.gravitationalMass ψ = restMass ψ :=
  admissiblePatternMassConclusion readout ψ
    (massAdmissible_of_bottomUpEvidence ψ E) hreads

theorem full_chain_for_bottomUpEvidence
    (readout : PatternMassReadout Λ)
    (ψ : LightPattern Λ)
    (E : BottomUpAdmissibilityEvidence ψ)
    (hreads : ReadsStablePatternLoad readout ψ) :
    (∀ k : ℕ,
      integratedMeaningLoad (evolvePattern k ψ) = integratedMeaningLoad ψ) ∧
    0 < restMass ψ ∧
    PhiRungQuantized ψ ∧
    restMass ψ = predictedMass ψ ∧
    readout.inertialMass ψ = restMass ψ ∧
    readout.gravitationalMass ψ = restMass ψ :=
  admissiblePatternMassConclusion readout ψ
    (massAdmissible_of_bottomUpEvidence ψ E) hreads

theorem full_chain_for_bottomUpEvidence
    (readout : PatternMassReadout Λ)
    (ψ : LightPattern Λ)
    (E : BottomUpAdmissibilityEvidence ψ)
    (hreads : ReadsStablePatternLoad readout ψ) :
    (∀ k : ℕ,
      integratedMeaningLoad (evolvePattern k ψ) = integratedMeaningLoad ψ) ∧
    0 < restMass ψ ∧
    PhiRungQuantized ψ ∧
    restMass ψ = predictedMass ψ ∧
    readout.inertialMass ψ = restMass ψ ∧
    readout.gravitationalMass ψ = restMass ψ :=
  admissiblePatternMassConclusion readout ψ
    (massAdmissible_of_bottomUpEvidence ψ E) hreads

What this page does not claim

The theorem does not assert that any physical pattern actually has the required bottom-up evidence. The theorem does not derive the load-factorization condition from the framework's deeper dynamics; that remains open. The theorem does not assign numerical values to any particle masses.

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/AdmissibilityConstruction.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: