Encyclopedia Foundation Foundation Primitive Recognition Calculus Frscarrier Alpha Inv Is Term
ARTICLE 2 claims 2 theorems
Foundation Primitive Recognition Calculus Frscarrier Alpha Inv Is Term
A machine-checked theorem confirms that the inverse fine-structure constant is a valid symbol in a finite language of numbers, not a claim about its value.
The inverse alpha term
The inverse fine-structure constant, written α⁻¹, is a number from physics that measures the strength of the electromagnetic force; its measured value is about 137.036. In the Recognition Science framework, a central question is which numbers can appear in the framework's own computations. The framework works with a finite set of symbols, including the golden ratio, π, e, and α⁻¹, combined by addition, multiplication, and division. The declaration alphaInv_is_term establishes that α⁻¹ is a legitimate term in this syntax: it evaluates to the framework's internal value for that constant, and that value is a member of the countable field the framework uses for all its calculations.
This is a soundness result, not a numerical derivation. It proves that the symbol α⁻¹ can be used without breaking the framework's rules, just as a dictionary confirms a word is spelled correctly without defining its meaning. The theorem is one of several similar declarations for the other constants, and together they show the carrier syntax is closed: any finite expression built from these symbols stays inside the framework's countable number system. The set of all such values is countable, a proper subset of the real numbers, and every one has a representation as a protocol in the framework's real-number interface.
What the declaration does not claim is more important than what it does. It does not say that α⁻¹ has any particular numerical value, nor does it derive the fine-structure constant from first principles. The framework's expression for α⁻¹ lands within about 5.6 parts per million of the measured value with nothing fitted, but that agreement is an identification, not a theorem. The exact derivation of α remains an open target. The declaration only certifies that the symbol is usable, like a passport stamp that lets a traveler board a plane without saying where the plane will land.
THEOREM alphaInv_is_term · eval_mem · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/FRSCarrier.lean
theorem alphaInv_is_term : eval FRSExpr.alphaInv = MinimalField.alphaInv := rfl
/-- **Soundness.** Every carrier term evaluates into the countable field `rsField`.
The finite-description syntax never escapes the carrier. -/
theorem eval_mem (ex : FRSExpr) : eval ex ∈ MinimalField.rsField := by
induction ex with
| rat q => exact SubfieldClass.ratCast_mem MinimalField.rsField q
| phi => simpa [eval] using MinimalField.rsField_mem_phi
| pi => simpa [eval] using MinimalField.rsField_mem_pi
| e => simpa [eval] using MinimalField.rsField_mem_e
| alphaInv => simpa [eval] using MinimalField.rsField_mem_alphaInv
| neg a ih => simpa [eval] using neg_mem ih
| add a b iha ihb => simpa [eval] using add_mem iha ihb
| mul a b iha ihb => simpa [eval] using mul_mem iha ihb
| inv a ih => simpa [eval] using inv_mem ih
THEOREM carrierValues_countable · carrierValues_proper · has_protocol_display · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/FRSCarrier.lean
/-- The carrier value set is countable: only countably many finite terms exist. -/
theorem carrierValues_countable : carrierValues.Countable :=
(MinimalField.rsField_countable).mono carrierValues_subset
/-- The carrier values are a proper subset of ℝ. -/
theorem carrierValues_proper : carrierValues ≠ Set.univ := by
intro h
exact Cardinal.not_countable_real (h ▸ carrierValues_countable)
/-- **Protocol display.** Every carrier term value is the value of a Delta-real
protocol, so the finite-description carrier renders into the `ℝδ` interface. -/
theorem has_protocol_display (ex : FRSExpr) :
∃ x : DeltaReal.Protocol, x.value = eval ex :=
DeltaReal.Protocol.value_surjective (eval ex)
What this page does not claim
The declaration does not assign a numerical value to α⁻¹. The declaration does not derive the fine-structure constant from first principles. The agreement of the framework's expression with the measured value is not a theorem.
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/PrimitiveRecognitionCalculus/FRSCarrier.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 is the exact derivation of the fine-structure constant from the framework's first principles?
- How does the countable carrier field relate to the uncountable continuum of real numbers used in standard physics?
- What other constants might be added to the carrier syntax without breaking its soundness?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM alphaInv_is_term · eval_mem · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/FRSCarrier.lean
theorem alphaInv_is_term : eval FRSExpr.alphaInv = MinimalField.alphaInv := rfl/-- **Soundness.** Every carrier term evaluates into the countable field `rsField`. The finite-description syntax never escapes the carrier. -/ theorem eval_mem (ex : FRSExpr) : eval ex ∈ MinimalField.rsField := by induction ex with | rat q => exact SubfieldClass.ratCast_mem MinimalField.rsField q | phi => simpa [eval] using MinimalField.rsField_mem_phi | pi => simpa [eval] using MinimalField.rsField_mem_pi | e => simpa [eval] using MinimalField.rsField_mem_e | alphaInv => simpa [eval] using MinimalField.rsField_mem_alphaInv | neg a ih => simpa [eval] using neg_mem ih | add a b iha ihb => simpa [eval] using add_mem iha ihb | mul a b iha ihb => simpa [eval] using mul_mem iha ihb | inv a ih => simpa [eval] using inv_mem ihThe declaration alphaInv_is_term establishes that α⁻¹ is a legitimate term in this syntax: it evaluates to the framework's internal value for that constant, and that value is a member of the countable field the framework uses for all its calculations. alphaInv_is_term · eval_mem · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/FRSCarrier.leanTHEOREM carrierValues_countable · carrierValues_proper · has_protocol_display · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/FRSCarrier.lean
/-- The carrier value set is countable: only countably many finite terms exist. -/ theorem carrierValues_countable : carrierValues.Countable := (MinimalField.rsField_countable).mono carrierValues_subset/-- The carrier values are a proper subset of ℝ. -/ theorem carrierValues_proper : carrierValues ≠ Set.univ := by intro h exact Cardinal.not_countable_real (h ▸ carrierValues_countable)/-- **Protocol display.** Every carrier term value is the value of a Delta-real protocol, so the finite-description carrier renders into the `ℝδ` interface. -/ theorem has_protocol_display (ex : FRSExpr) : ∃ x : DeltaReal.Protocol, x.value = eval ex := DeltaReal.Protocol.value_surjective (eval ex)The set of all such values is countable, a proper subset of the real numbers, and every one has a representation as a protocol in the framework's real-number interface. carrierValues_countable · carrierValues_proper · has_protocol_display · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/FRSCarrier.lean