Constants Alpha Genesis Kappa Gamma Irreducibility Alpha Inv Irreducible Under C

A scoped non-identifiability result

The inverse fine-structure constant, 1/α, is a number measured with extraordinary precision: the 2022 CODATA value is 137.035999177(21). In the Recognition Science framework, a family of candidate values is defined by scaling a base constant: α⁻¹(κ) = κ · α⁻¹_base. The theorem alphaInv_irreducible_under_closure proves a precise statement about this family: for any positive target value t, there exists a positive scaling parameter κ such that the family member equals t and also satisfies a certain closure condition. In plainer terms, the closure condition, a set of three arithmetic facts about a cube's edges and cycles, holds at every scaling, so it cannot distinguish one value from another.

The proof is a short argument about injectivity. The scaling function is strictly increasing, so it never maps two different parameters to the same value. The closure predicate, by contrast, is constant: it ignores its parameter entirely. A predicate that is true everywhere cannot pin down a value from a family that sweeps through all positive numbers. The theorem shows this directly by comparing the parameters 1 and 2: both satisfy the closure, yet they yield different values, so no single target is forced.

This is a scoped result about a defined family, not a statement about physics. The declaration does not prove that 1/α is irreducible, primitive, or otherwise special. It does not prove the physical value of the fine-structure constant, which remains an open target. The theorem's own documentation states that interpreting the family as a physical inverse coupling requires an additional gauge-plus-matter model, and that the exact classification lives in a separate module. The closure condition itself is a definitional choice, not a derived law.

In Recognition Science, this result serves a clarifying role. It shows that a particular construction, one that might look like it determines the constant, in fact cannot. The framework's library proves this limitation cleanly, with no hidden axioms beyond the standard three: propositional extensionality, choice, and quotient soundness. The value of the theorem is negative: it rules out a naive derivation, and it points toward the missing ingredient, the matter-charge relation, as the place where a real determination would have to come from.

/-- The forced-closure facts hold for **every** normalization `κ_γ`. -/
theorem forcedClosure_holds (κ : ℝ) : ForcedClosure κ :=
  ⟨cube_cycle_rank_eq_5, physical_link_dof_eq_cycle_rank, seed_channel_count_ne_gauge_dof⟩

/-- The defined closure holds for every positive κ, while `alphaInvK` sweeps
every positive value. This is a theorem about the defined family, not global
irreducibility of the physical fine-structure constant. -/
theorem alphaInv_irreducible_under_closure :
    ∀ t : ℝ, 0 < t → ∃ κ : ℝ, 0 < κ ∧ ForcedClosure κ ∧ alphaInvK κ = t := by
  intro t ht
  have hne : Constants.alphaInv ≠ 0 := ne_of_gt alphaInv_pos
  refine ⟨t / Constants.alphaInv, div_pos ht alphaInv_pos, forcedClosure_holds _, ?_⟩
  unfold alphaInvK
  field_simp

/-- No satisfiable κ-independent predicate pins the injective observable
`alphaInvK`. A predicate may still identify the physical orbit invariant
`q²/κ`; that variable is outside this module. -/
theorem kappa_blind_closure_cannot_pin
    {P : ℝ → Prop} (hconst : ∀ κ κ', P κ ↔ P κ') (hsat : ∃ κ, P κ) :
    ¬ Pins P alphaInvK := by
  rintro ⟨t, ht⟩
  obtain ⟨κ0, hκ0⟩ := hsat
  have hP1 : P 1 := (hconst κ0 1).mp hκ0
  have hP2 : P 2 := (hconst κ0 2).mp hκ0
  have e1 : alphaInvK 1 = t := ht 1 (by norm_num) hP1
  have e2 : alphaInvK 2 = t := ht 2 (by norm_num) hP2
  have : (1 : ℝ) = 2 := alphaInvK_injective (by rw [e1, e2])
  norm_num at this

What this page does not claim

The theorem does not prove the physical value of the fine-structure constant. The theorem does not establish that alphaInvK is the physical inverse coupling. The closure predicate is a definition, not a derived law.

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/Constants/AlphaGenesis/KappaGammaIrreducibility.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: