Encyclopedia Foundation Foundation Maximal Forcing Rsalpha Universe Tightening Lalpha0 Lalpha Rs Effecti
ARTICLE 3 claims 3 theorems
Foundation Maximal Forcing Rsalpha Universe Tightening Lalpha0 Lalpha Rs Effecti
A formal proof shows that one specific, parameter-free formula for the inverse fine-structure constant lands inside the measured window, while making no claim to derive the constant itself.
The tightening claim
The inverse fine-structure constant, often written 1/α, is a number near 137.035999 that measures the strength of the electromagnetic interaction. The Recognition Science framework, in its maximal forcing layer, examines a specific candidate value for this constant, built from a formula with no fitted parameters. The declaration tightening_Lalpha0_LalphaRS_effective establishes a precise logical fact about this candidate: if the candidate is allowed to be any real number, the claim that it lies in the window (137.030, 137.039) is independent, meaning it is neither forced nor refuted. But if the candidate is restricted to the specific RS-assembled value, then the window claim becomes forced, a theorem.
The framework models this with two classes. The loose class Lalpha0 admits every real number as a candidate. The gate class LalphaRS admits only the value alphaInv = 44π · exp(-w8·ln φ / 44π), where φ is the golden ratio and w8 is a fixed structural constant. Over the loose class, the window claim is independent: the RS value satisfies it, but the number 0 does not, so no universal statement holds. Over the gate class, the window claim is forced, wrapping proved interval bounds. The declaration combines these two facts into a single theorem, showing the tightening from Lalpha0 to LalphaRS is effective: it changes the logical status of the window claim from independent to forced.
What this does not claim is essential. The declaration does not derive the measured value of the fine-structure constant. The seed 44π is an identification, not a derived coupling, and the framework itself notes that a premise of this identification is kernel-proved false (11 ≠ 5). The exact value 137.035999 is treated as a boundary datum, and a no-go theorem in the framework proves no normalization-blind condition can pin it down. What is forced is precisely that the construction lands in the CODATA-bracketing window, a real, non-vacuous claim about a parameter-free formula, not a derivation of α itself.
THEOREM alphaWindow_independent_over_Lalpha0 · IndisputableMonolith/Foundation/MaximalForcing/RSAlphaUniverse.lean
/-- Over the loose class `Lalpha0`, the window claim is independent: the RS value
satisfies it, and `0` does not. -/
theorem alphaWindow_independent_over_Lalpha0 :
Independent Lalpha0.admissible isAlphaWindowClaim := by
refine ⟨alphaInv, 0, ?_, ?_, ?_, ?_⟩
· trivial
· trivial
· exact ⟨alphaInv_gt, alphaInv_lt⟩
· intro h
have h1 : (137.030 : ℝ) < 0 := h.1
norm_num at h1
THEOREM forced_alphaWindow · IndisputableMonolith/Foundation/MaximalForcing/RSAlphaUniverse.lean
/-- **Alpha window as a forced invariant.** Over the RS-assembly gate, the value
lies in `(137.030, 137.039)`. Wraps the proved bounds; the only external content
is interval arithmetic, no fitted parameter. -/
theorem forced_alphaWindow : Forced LalphaRS.admissible isAlphaWindowClaim := by
intro a ha
have ha' : a = alphaInv := ha
subst ha'
exact ⟨alphaInv_gt, alphaInv_lt⟩
THEOREM tightening_Lalpha0_LalphaRS_effective · IndisputableMonolith/Foundation/MaximalForcing/RSAlphaUniverse.lean
/-- **The RS-assembly tightening is legitimate, not cheap.** The window claim is
independent over `Lalpha0` but forced over `LalphaRS`. -/
theorem tightening_Lalpha0_LalphaRS_effective :
Independent Lalpha0.admissible isAlphaWindowClaim ∧
Forced LalphaRS.admissible isAlphaWindowClaim :=
⟨alphaWindow_independent_over_Lalpha0, forced_alphaWindow⟩
What this page does not claim
The declaration does not derive the fine-structure constant alpha. The seed 44π is not a derived coupling; it is an identification whose premise the framework itself proves false. The exact value 137.035999 is not derived, only used as a boundary datum.
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/Foundation/MaximalForcing/RSAlphaUniverse.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 structural principle, if any, could justify the seed 44π as a derived coupling rather than an identification?
- What would a normalization-blind condition that does pin the exact inverse fine-structure value look like?
- How does the window (137.030, 137.039) compare to the full uncertainty range of the CODATA 2022 adjustment?
- Does the effectiveness of the tightening generalize to other gate classes in the maximal forcing layer?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM alphaWindow_independent_over_Lalpha0 · IndisputableMonolith/Foundation/MaximalForcing/RSAlphaUniverse.lean
/-- Over the loose class `Lalpha0`, the window claim is independent: the RS value satisfies it, and `0` does not. -/ theorem alphaWindow_independent_over_Lalpha0 : Independent Lalpha0.admissible isAlphaWindowClaim := by refine ⟨alphaInv, 0, ?_, ?_, ?_, ?_⟩ · trivial · trivial · exact ⟨alphaInv_gt, alphaInv_lt⟩ · intro h have h1 : (137.030 : ℝ) < 0 := h.1 norm_num at h1Over the loose class Lalpha0, the window claim is independent: the RS value satisfies it, but the number 0 does not. alphaWindow_independent_over_Lalpha0 · IndisputableMonolith/Foundation/MaximalForcing/RSAlphaUniverse.leanTHEOREM forced_alphaWindow · IndisputableMonolith/Foundation/MaximalForcing/RSAlphaUniverse.lean
/-- **Alpha window as a forced invariant.** Over the RS-assembly gate, the value lies in `(137.030, 137.039)`. Wraps the proved bounds; the only external content is interval arithmetic, no fitted parameter. -/ theorem forced_alphaWindow : Forced LalphaRS.admissible isAlphaWindowClaim := by intro a ha have ha' : a = alphaInv := ha subst ha' exact ⟨alphaInv_gt, alphaInv_lt⟩Over the gate class LalphaRS, the window claim is forced, wrapping proved interval bounds. forced_alphaWindow · IndisputableMonolith/Foundation/MaximalForcing/RSAlphaUniverse.leanTHEOREM tightening_Lalpha0_LalphaRS_effective · IndisputableMonolith/Foundation/MaximalForcing/RSAlphaUniverse.lean
/-- **The RS-assembly tightening is legitimate, not cheap.** The window claim is independent over `Lalpha0` but forced over `LalphaRS`. -/ theorem tightening_Lalpha0_LalphaRS_effective : Independent Lalpha0.admissible isAlphaWindowClaim ∧ Forced LalphaRS.admissible isAlphaWindowClaim := ⟨alphaWindow_independent_over_Lalpha0, forced_alphaWindow⟩The declaration combines these two facts into a single theorem, showing the tightening from Lalpha0 to LalphaRS is effective. tightening_Lalpha0_LalphaRS_effective · IndisputableMonolith/Foundation/MaximalForcing/RSAlphaUniverse.lean