Masses Mass Genesis Load Normalization Topology Forced Load Density Realizes

The load density bridge

In the Recognition Science framework, a recognition event is a discrete record of a pattern matching its template, and the framework's ledger is the complete set of such records. Each occupied site in a pattern carries a numerical load, a measure of how much recognition activity that site contributes. The framework's mass law states that a pattern's rest mass is determined by its topology, specifically by a value called its predicted mass. The open problem is to show that the actual loads at each site sum to this predicted value, rather than to some other number.

The declaration topologyForcedLoadDensity_realizes is a theorem in the framework's machine-checked library of formal theorems. It establishes a sufficient condition for closing that gap. If a pattern admits a density function on its support sites, where the density is nonnegative, equals the actual site load at each occupied site, and its sum over the support equals the predicted mass, then the pattern's integrated load equals its predicted mass. By a prior theorem, this equality of integrated load to predicted mass is exactly what the mass law requires for the rest mass to match the prediction. The theorem is a bridge: it connects a local condition on individual sites to the global mass value.

The theorem itself is a formal implication, not a construction. It does not assert that any such density exists for any particular pattern. It only states that if such a density does exist, then the mass law is realized. The framework's documentation explicitly labels this as a sufficient target, not the final physics of every pattern. The theorem is useful because it specifies precisely what amplitude information is missing from a simpler normalization: the unit normalization assigns load 1 to every occupied site, which makes the integrated load equal to the support cardinality, but the predicted mass is generally not equal to that cardinality. The density condition names the exact missing piece.

In Recognition Science, this theorem is a stepping stone, not a destination. The framework's goal is to derive the density from deeper constraints, not to assume it as an external calibration. The theorem proves that the bridge works; it does not prove that the bridge is built. The distinction is central to the framework's method: it separates what is forced by its axioms from what remains an open target for future derivation.

theorem topologyForcedLoadDensity_realizes
    (ψ : LightPattern Λ) (ρ : TopologyForcedLoadDensity ψ) :
    MassLawLoadRealized ψ := by
  unfold MassLawLoadRealized
  rw [integratedMeaningLoad_eq_support_sum ψ]
  calc
    ψ.support.sum (fun x => siteMeaningLoad ψ x)
        = ψ.support.sum ρ.density := by
          apply Finset.sum_congr rfl
          intro x hx
          exact (ρ.equals_site_load x hx).symm
    _ = predictedMass ψ := ρ.sums_to_predicted

theorem topologyForcedLoadDensity_realizes
    (ψ : LightPattern Λ) (ρ : TopologyForcedLoadDensity ψ) :
    MassLawLoadRealized ψ := by
  unfold MassLawLoadRealized
  rw [integratedMeaningLoad_eq_support_sum ψ]
  calc
    ψ.support.sum (fun x => siteMeaningLoad ψ x)
        = ψ.support.sum ρ.density := by
          apply Finset.sum_congr rfl
          intro x hx
          exact (ρ.equals_site_load x hx).symm
    _ = predictedMass ψ := ρ.sums_to_predicted

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 any pattern actually possesses such a density. The theorem does not establish that the predicted mass equals the support cardinality. The theorem does not assert that the density condition is necessary, only sufficient.

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: