Encyclopedia Masses Masses Mass Genesis T10 Amplitude Freedom Refutation Stable Closed Light Pattern

ARTICLE 3 claims 3 theorems

Masses Mass Genesis T10 Amplitude Freedom Refutation Stable Closed Light Pattern

A machine-checked theorem shows that stable light patterns can be freely rescaled, which breaks a proposed link between pattern shape and particle mass.

What the scaling theorem shows

A light pattern is a discrete record of recognition events arranged on a cycle of eight ticks. A stable closed light pattern is one that satisfies three conditions: it has localized support, meaning its activity dies out away from a central region; it carries a nonzero neutral load, a measure of meaning-based content; and its orbit under the eight-tick shift closes back on itself. The theorem stableClosedLightPattern_scalePattern states that if you take any such stable pattern and multiply every window amplitude by a nonzero constant c, the result is again a stable closed light pattern. In plain language: rescaling the amplitudes preserves stability.

The proof is short because each of the three stability conditions is blind to amplitude. Localized support depends only on which windows are active, not on their values, so copying the support preserves it. The neutral load condition survives because the site load scales by c², which stays positive for any nonzero c. The orbit closure condition holds for every pattern whatsoever, since the eight-tick shift has period eight. None of the three conditions constrains what the amplitudes actually are.

This amplitude blindness has a sharp consequence for mass. The framework defines rest mass as integrated meaning load, and it also has a separate mass law that predicts mass from topology alone. The theorem not_forall_stable_restMass_eq_predictedMass shows these two cannot agree for every stable pattern. Given any stable pattern, its double is also stable and has the same topology, hence the same predicted mass, but four times the load. At fixed topology, the load can be made equal to any positive real number. No function of the topology can predict it.

In Recognition Science, this refutes the identification of rest mass with the topology-labelled mass law on the current pattern surface. It does not refute mass genesis from meaning: the identity restMass = integratedMeaningLoad for stable patterns remains untouched. The constructive next step is to add an amplitude-fixing condition to admissibility, so that a realized particle's window is pinned to a specific value rather than left free.

THEOREM stableClosedLightPattern_scalePattern · IndisputableMonolith/Masses/MassGenesis/T10AmplitudeFreedomRefutation.lean
/-- **Admissibility is amplitude-blind.** A nonzero rescaling of any stable closed
pattern is again a stable closed pattern. -/
theorem stableClosedLightPattern_scalePattern {c : ℝ} (hc : c ≠ 0)
    {ψ : LightPattern (Fin 8)} (h : StableClosedLightPattern ψ) :
    StableClosedLightPattern (scalePattern c ψ) :=
  ⟨localizedSupport_scalePattern c h.1,
   nontrivialNeutralLoad_scalePattern hc h.2.1,
   closedRHatOrbit_of_any _⟩
THEOREM not_forall_stable_restMass_eq_predictedMass · IndisputableMonolith/Masses/MassGenesis/T10AmplitudeFreedomRefutation.lean
not_forall_stable_restMass_eq_predictedMass · IndisputableMonolith/Masses/MassGenesis/T10AmplitudeFreedomRefutation.lean:143
/-- The same statement in the headline variables: rest mass and predicted mass
cannot agree on every stable pattern. -/
theorem not_forall_stable_restMass_eq_predictedMass
    {ψ : LightPattern (Fin 8)} (h : StableClosedLightPattern ψ) :
    ¬ (∀ χ : LightPattern (Fin 8),
        StableClosedLightPattern χ → restMass χ = predictedMass χ) := by
  intro hall
  refine not_forall_stable_massLawLoadRealized h (fun χ hχ => ?_)
  have := hall χ hχ
  rwa [restMass_eq_integratedMeaningLoad_of_stable χ hχ] at this
THEOREM exists_sameTopology_stable_load_eq · IndisputableMonolith/Masses/MassGenesis/T10AmplitudeFreedomRefutation.lean
/-- At fixed topology, the integrated meaning load of a stable pattern can be made
equal to ANY positive real. This is the sharpest form of the obstruction: the load
carries no information that the topology constrains, so no function of the topology
can predict it. -/
theorem exists_sameTopology_stable_load_eq
    {ψ : LightPattern (Fin 8)} (h : StableClosedLightPattern ψ)
    {r : ℝ} (hr : 0 < r) :
    ∃ χ : LightPattern (Fin 8),
      SameTopology ψ χ ∧ StableClosedLightPattern χ ∧
        integratedMeaningLoad χ = r := by
  have hL : 0 < integratedMeaningLoad ψ :=
    integratedMeaningLoad_pos_of_nontrivial ψ h.2.1
  have hquot : 0 < r / integratedMeaningLoad ψ := div_pos hr hL
  have hLne : integratedMeaningLoad ψ ≠ 0 := ne_of_gt hL
  refine ⟨scalePattern (Real.sqrt (r / integratedMeaningLoad ψ)) ψ,
    (scalePattern_topology _ ψ).symm,
    stableClosedLightPattern_scalePattern (ne_of_gt (Real.sqrt_pos.mpr hquot)) h, ?_⟩
  rw [integratedMeaningLoad_scalePattern, Real.sq_sqrt (le_of_lt hquot)]
  field_simp

What this page does not claim

This does not refute mass genesis from meaning, since restMass = integratedMeaningLoad for stable patterns remains untouched. This does not claim that no amplitude-fixing condition can ever be added to admissibility. This does not claim that the mass law is false for all possible pattern surfaces, only for the present one where admissibility is amplitude-blind.

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

MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND