Masses Mass Genesis Load Normalization Load Normalization Surface Cert

The load normalization surface

In the Recognition Science framework, a ledger (a discrete record of events) assigns to each occupied site a numerical load (a measure of meaning or weight). The certificate LoadNormalizationSurfaceCert is a formal object in the framework's machine-checked library of theorems. It packages three proved facts about when the total load over all occupied sites equals a topology-derived value called the predicted mass. Think of it as a checklist: if any one of three sufficient conditions holds, then the integrated load matches the mass prediction.

The first condition is unit normalization: if every occupied site carries load exactly 1, then the total load is simply the number of occupied sites. The second is a support-averaged law: if each site carries the equal share of the predicted mass, the total load equals that mass. The third is a general density: if there exists a nonnegative site-load function that sums to the predicted mass, the total load again matches. Each of these is proved as a theorem, and the certificate bundles them together.

What the certificate does not do is derive the load density from first principles. It states sufficient conditions, not necessary ones. The framework's own documentation says the next true target is to force such a density from topology constraints, not to assume it as an external calibration. So the certificate is a landing surface: it marks where the normalization theorem must land, but the flight itself remains open.

def loadNormalizationSurfaceCert : LoadNormalizationSurfaceCert where
  cp6_unit_load_is_cardinality :=
    integratedMeaningLoad_eq_supportCard_of_neutralUnitLoad
  support_average_suffices :=
    supportAveragedMassLawLoad_realizes
  topology_density_suffices :=
    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

theorem supportAveragedMassLawLoad_realizes
    (ψ : LightPattern Λ)
    (hsupp : ψ.support.Nonempty)
    (havg : SupportAveragedMassLawLoad ψ) :
    MassLawLoadRealized ψ := by
  unfold MassLawLoadRealized
  rw [integratedMeaningLoad_eq_support_sum ψ]
  have hcard_ne : (ψ.support.card : ℝ) ≠ 0 := by
    exact_mod_cast Finset.card_ne_zero.mpr hsupp
  calc
    ψ.support.sum (fun x => siteMeaningLoad ψ x)
        = ψ.support.sum
            (fun _x => predictedMass ψ / (ψ.support.card : ℝ)) := by
          apply Finset.sum_congr rfl
          intro x hx
          exact havg x hx
    _ = (ψ.support.card : ℝ) *
          (predictedMass ψ / (ψ.support.card : ℝ)) := by
          simp
    _ = predictedMass ψ := by
          field_simp [hcard_ne]

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

What this page does not claim

The certificate does not derive the load density from topology. The sufficient conditions are not necessary conditions. The certificate does not assert that any real pattern satisfies the conditions.

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: