Encyclopedia Masses Masses Mass Genesis Admissibility Construction Bottom Up Canonical Admissibility
ARTICLE 3 claims 1 theorem 2 models
Masses Mass Genesis Admissibility Construction Bottom Up Canonical Admissibility
A machine-checked library defines precisely what evidence a light pattern must supply before the framework will call it a mass.
The admissibility evidence
A light pattern is, in this framework, a discrete record of recognition events distributed across a lattice. The declaration BottomUpCanonicalAdmissibilityEvidence is a checklist: it names the two pieces of evidence a pattern must provide before the framework's mass theorems apply to it. The first is stability, meaning the pattern persists under the framework's evolution rule. The second is a factorization claim, that the local density of meaning read directly from the pattern sums, over the pattern's support, to the mass value the framework's topology-based law predicts.
The factorization is the load-bearing part. The framework's mass law is built from sector, rung, and Z factors selected by Q3 topology and Rhat closure. The declaration says the actual neutral load present in the light pattern must equal that factorized expression when summed. This is not asserted as true; it is stated as a condition. The declaration is a structure, a named type that downstream theorems can require as an explicit hypothesis rather than silently assume.
What the declaration establishes is a bridge. Given the two pieces of evidence, the framework's library proves a chain: the pattern's rest mass equals its predicted mass, its integrated meaning load is conserved under evolution, its mass is positive, it is PhiRung quantized, and its inertial and gravitational masses both equal the rest mass. These are results in the machine-checked library, each with its proof anchored to the evidence structure.
What the declaration does not claim is that any actual physical pattern satisfies the evidence. The hard result, that every stable pattern arising from the underlying Q3/Rhat/CP6 dynamics carries this evidence, is kept as a named type, not an axiom. It remains a target. The declaration also does not assert any reverse-fitted mass value; no mass table and no normalization target enters the primitive site load law. The canonical law simply reads the neutral load already defined on the pattern.
In plain terms: the declaration says "if a pattern is stable and its neutral load sums to the predicted mass, then all the mass results follow." It leaves open whether any real pattern meets those conditions. That separation is the point. The framework can build its mass theory on explicit, checkable evidence, and mark clearly where the physics still has work to do.
MODEL BottomUpCanonicalAdmissibilityEvidence · IndisputableMonolith/Masses/MassGenesis/AdmissibilityConstruction.lean
/-- Tighter evidence form: the only remaining nontrivial datum is the canonical
support-sum factorization of the actual neutral load. -/
structure BottomUpCanonicalAdmissibilityEvidence (ψ : LightPattern Λ) where
stable : StableClosedLightPattern ψ
load_factorizes : CanonicalPrimitiveLoadFactorizes ψ
THEOREM full_chain_for_bottomUpEvidence · IndisputableMonolith/Masses/MassGenesis/AdmissibilityConstruction.lean
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
MODEL EveryPhysicalStablePatternHasBottomUpEvidence · IndisputableMonolith/Masses/MassGenesis/AdmissibilityConstruction.lean
/-- This is the next theorem to prove from Q3/Rhat/CP6 dynamics. It is kept as
a named type, not an axiom, so downstream files can depend on explicit evidence
instead of silently assuming the bridge. -/
def EveryPhysicalStablePatternHasBottomUpEvidence
(PhysicalStable : LightPattern Λ → Prop) : Type _ :=
∀ ψ : LightPattern Λ,
PhysicalStable ψ →
BottomUpAdmissibilityEvidence ψ
What this page does not claim
No physical light pattern is asserted to satisfy the evidence. No reverse-fitted mass value is asserted or implied. The hard result that all stable patterns carry the evidence is not proved, only named as a target type.
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:
- What dynamics from Q3, Rhat, and CP6 would prove that every stable light pattern carries the bottom-up evidence?
- How does the factorization claim relate to the existing Mass Genesis chain for the admissible carrier?
- What distinguishes the canonical evidence form from the more general bottom-up evidence form?
- How does the PhiRung quantization condition arise from the factorized mass law load?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
MODEL BottomUpCanonicalAdmissibilityEvidence · IndisputableMonolith/Masses/MassGenesis/AdmissibilityConstruction.lean
/-- Tighter evidence form: the only remaining nontrivial datum is the canonical support-sum factorization of the actual neutral load. -/ structure BottomUpCanonicalAdmissibilityEvidence (ψ : LightPattern Λ) where stable : StableClosedLightPattern ψ load_factorizes : CanonicalPrimitiveLoadFactorizes ψThe declaration is a structure naming two pieces of evidence: stability and a factorization claim that the local density of meaning sums to the factorized mass law load. BottomUpCanonicalAdmissibilityEvidence · IndisputableMonolith/Masses/MassGenesis/AdmissibilityConstruction.leanTHEOREM full_chain_for_bottomUpEvidence · IndisputableMonolith/Masses/MassGenesis/AdmissibilityConstruction.lean
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) hreadsGiven the evidence, the framework's library proves a chain: rest mass equals predicted mass, integrated meaning load is conserved, mass is positive, the pattern is PhiRung quantized, and inertial and gravitational masses equal rest mass. full_chain_for_bottomUpEvidence · IndisputableMonolith/Masses/MassGenesis/AdmissibilityConstruction.leanMODEL EveryPhysicalStablePatternHasBottomUpEvidence · IndisputableMonolith/Masses/MassGenesis/AdmissibilityConstruction.lean
/-- This is the next theorem to prove from Q3/Rhat/CP6 dynamics. It is kept as a named type, not an axiom, so downstream files can depend on explicit evidence instead of silently assuming the bridge. -/ def EveryPhysicalStablePatternHasBottomUpEvidence (PhysicalStable : LightPattern Λ → Prop) : Type _ := ∀ ψ : LightPattern Λ, PhysicalStable ψ → BottomUpAdmissibilityEvidence ψThe declaration does not assert that any actual physical pattern satisfies the evidence; the result that every stable pattern carries it is kept as a named type, not an axiom. EveryPhysicalStablePatternHasBottomUpEvidence · IndisputableMonolith/Masses/MassGenesis/AdmissibilityConstruction.lean