Masses Mass Genesis Load Normalization Stable Topology Forced Load Density Rest

The load density bridge

In the Recognition Science framework, a ledger (a discrete record of recognition events) assigns to each occupied site a number called its load. The central question of mass genesis is how these site loads add up to a particle's rest mass. One early normalization, called CP6, sets every occupied site to a load of exactly 1. A theorem in the framework's machine-checked library of formal theorems proves that under this rule, the integrated load equals the number of occupied sites, the support cardinality. That is a clean result, but it does not yet match the mass spectrum: the cardinality is not generally the same as the topology-selected predicted mass.

The declaration stable_topologyForcedLoadDensity_restMass_eq_predictedMass addresses the gap. It states a conditional bridge: if a stable closed light pattern carries a topology-forced load density, then its rest mass equals its predicted mass. A topology-forced load density is a structure that assigns a nonnegative number to each occupied site, matches the site's actual load, and whose sum over the support equals the predicted mass. The theorem's proof is short: it rewrites the integrated load as the sum of site loads, uses the density's equality to substitute, and then applies the density's sum condition. The result is that the two notions, the measured rest mass and the topology-derived predicted mass, coincide.

The theorem does not claim that such a density exists for any pattern. It is a sufficient condition, not an existence proof. The framework's own documentation marks the next step as open: deriving a topology-forced load density from deeper constraints, such as Q3/Rhat, rather than assuming it as an external calibration. The declaration is a landing surface, a precise target that a future proof must hit. It shows what must be true for the mass law to hold, not that it is true.

theorem stable_topologyForcedLoadDensity_restMass_eq_predictedMass
    (ψ : LightPattern Λ)
    (hstable : StableClosedLightPattern ψ)
    (ρ : TopologyForcedLoadDensity ψ) :
    restMass ψ = predictedMass ψ :=
  restMass_eq_predictedMass_of_load_realized ψ hstable
    (topologyForcedLoadDensity_realizes ψ ρ)

theorem integratedMeaningLoad_eq_supportCard_of_neutralUnitLoad
    (ψ : LightPattern Λ) (hunit : NeutralUnitLoadOnSupport ψ) :
    integratedMeaningLoad ψ = (ψ.support.card : ℝ) := by
  rw [integratedMeaningLoad_eq_support_sum ψ]
  calc
    ψ.support.sum (fun x => siteMeaningLoad ψ x)
        = ψ.support.sum (fun _x => (1 : ℝ)) := by
          apply Finset.sum_congr rfl
          intro x hx
          exact hunit x hx
    _ = (ψ.support.card : ℝ) := by
          simp

What this page does not claim

The theorem does not prove that a topology-forced load density exists for any pattern. The theorem does not claim that the CP6 unit normalization produces the mass spectrum. The theorem does not assert that the load density is the final physics of every pattern.

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