Encyclopedia Foundation Foundation Primitive Recognition Calculus Prcminimal Field Rs Field Mass Ladder
ARTICLE 4 claims 4 theorems
Foundation Primitive Recognition Calculus Prcminimal Field Rs Field Mass Ladder
Every constant the Recognition Science framework names lives in a single countable field of real numbers, a proper subset of the continuum that carries the whole mass ladder.
The countable home of the constants
In mathematics, a field is a number system where addition, subtraction, multiplication, and division (except by zero) always work. The real numbers form a field, but so do much smaller systems, like the rational numbers. Recognition Science, a framework that derives physical structure from a forced cost of recognition, works in one particular small field: the smallest field of real numbers that contains its named constants, the golden ratio φ, π, Euler's number e, and a specific value it calls α⁻¹.
This field, built by closing those four numbers under the field operations, is countable. A countable set can be listed in an infinite sequence, like the integers or the rationals. The real numbers as a whole cannot be so listed; they are uncountable. The framework's field is therefore a proper subset of the continuum, strictly smaller than the full real line. The theorem rsField_proper states this directly: the field is not the whole set of reals.
The mass ladder is the framework's scheme for particle masses, a sequence of values built from a yardstick multiplied by powers of φ. The declaration rsField_mass_ladder proves that if the yardstick itself lies in this countable field, then every rung of the ladder, for any integer exponent, also lies in the field. Combined with the theorem that every integer power of φ is in the field, this means the entire φ-power scaffold, the working machinery of the mass law, lives inside the countable field, not spread across the uncountable continuum.
The framework's library, a machine-checked collection of formal theorems, also shows the field contains the integer outputs of its forcing chain: the number 8, the eight-tick cycle output, and 3, the spatial dimension output. It further proves that adjoining any countable family of new constants keeps the field countable. No matter how many constants the framework names, the construction never requires the full real line.
In Recognition Science, this is not a slogan about a few isolated values. The whole scaffold, every rung of the mass ladder and every integer output of the forcing chain, is countable-field content. The framework models its physics as living in this small, well-behaved number system, a deliberate choice that keeps its constants within a countable structure rather than invoking the full continuum.
THEOREM rsField_proper · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.lean
/-- The RS constant field is a *proper* subset of ℝ: it is countable, while the
continuum is not. The continuum is therefore not the home of RS physics. -/
theorem rsField_proper : (rsField : Set ℝ) ≠ Set.univ := by
intro h
have huniv : (Set.univ : Set ℝ).Countable := h ▸ rsField_countable
exact Cardinal.not_countable_real huniv
THEOREM rsField_mass_ladder · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.lean
/-- The mass-ladder values `yardstick · φⁿ` lie in the field whenever the
yardstick does. With the yardstick itself a constant in the field, every rung of
the RS mass spectrum is a countable-field element. -/
theorem rsField_mass_ladder {y : ℝ} (hy : y ∈ rsField) (n : ℤ) :
y * Real.goldenRatio ^ n ∈ rsField :=
mul_mem hy (rsField_phi_zpow n)
THEOREM rsField_phi_zpow · rs_scaffold_below_continuum · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.lean
/-- Every integer power of φ lies in the field: the entire φ-ladder, the scaffold
of the RS mass law, is countable-field content, not continuum content. -/
theorem rsField_phi_zpow (n : ℤ) : Real.goldenRatio ^ n ∈ rsField :=
zpow_mem rsField_mem_phi n
/-- **Item 1, sharpened.** The countable RS field carries the working machinery:
the φ-ladder for every integer exponent, the chain's integer outputs (eight-tick
and dimension), and any countable extension of the constant set, all while staying
a proper countable subset of ℝ. -/
theorem rs_scaffold_below_continuum :
(∀ n : ℤ, Real.goldenRatio ^ n ∈ rsField)
∧ (8 : ℝ) ∈ rsField
∧ (3 : ℝ) ∈ rsField
∧ (rsField : Set ℝ).Countable
∧ (rsField : Set ℝ) ≠ Set.univ :=
⟨rsField_phi_zpow, rsField_eight_tick, rsField_dimension,
rsField_countable, rsField_proper⟩
THEOREM rsField_extend_stays_countable · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.lean
/-- Adjoining any further countable family of constants keeps the field
countable. The construction never requires the continuum no matter how many
constants RS eventually names. -/
theorem rsField_extend_stays_countable {s : Set ℝ} (hs : s.Countable) :
(Subfield.closure (rsConstants ∪ s) : Set ℝ).Countable :=
subfield_closure_countable_of_countable (rsConstants_countable.union hs)
What this page does not claim
The declaration does not prove any specific particle mass or the value of the yardstick. The declaration does not claim the field contains all real numbers or all physically relevant quantities. The declaration does not establish that the mass ladder matches measured particle masses.
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/PRCMinimalField.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 yardstick value that anchors the mass ladder?
- How does the framework derive the specific value of α⁻¹ from its forcing chain?
- What physical predictions follow from the mass ladder being countable-field content?
- How does the framework's countable field relate to the uncountable spaces used in conventional quantum field theory?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM rsField_proper · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.lean
/-- The RS constant field is a *proper* subset of ℝ: it is countable, while the continuum is not. The continuum is therefore not the home of RS physics. -/ theorem rsField_proper : (rsField : Set ℝ) ≠ Set.univ := by intro h have huniv : (Set.univ : Set ℝ).Countable := h ▸ rsField_countable exact Cardinal.not_countable_real hunivThe field is therefore a proper subset of the continuum, strictly smaller than the full real line. rsField_proper · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.leanTHEOREM rsField_mass_ladder · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.lean
/-- The mass-ladder values `yardstick · φⁿ` lie in the field whenever the yardstick does. With the yardstick itself a constant in the field, every rung of the RS mass spectrum is a countable-field element. -/ theorem rsField_mass_ladder {y : ℝ} (hy : y ∈ rsField) (n : ℤ) : y * Real.goldenRatio ^ n ∈ rsField := mul_mem hy (rsField_phi_zpow n)The declaration rsField_mass_ladder proves that if the yardstick itself lies in this countable field, then every rung of the ladder, for any integer exponent, also lies in the field. rsField_mass_ladder · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.leanTHEOREM rsField_phi_zpow · rs_scaffold_below_continuum · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.lean
/-- Every integer power of φ lies in the field: the entire φ-ladder, the scaffold of the RS mass law, is countable-field content, not continuum content. -/ theorem rsField_phi_zpow (n : ℤ) : Real.goldenRatio ^ n ∈ rsField := zpow_mem rsField_mem_phi n/-- **Item 1, sharpened.** The countable RS field carries the working machinery: the φ-ladder for every integer exponent, the chain's integer outputs (eight-tick and dimension), and any countable extension of the constant set, all while staying a proper countable subset of ℝ. -/ theorem rs_scaffold_below_continuum : (∀ n : ℤ, Real.goldenRatio ^ n ∈ rsField) ∧ (8 : ℝ) ∈ rsField ∧ (3 : ℝ) ∈ rsField ∧ (rsField : Set ℝ).Countable ∧ (rsField : Set ℝ) ≠ Set.univ := ⟨rsField_phi_zpow, rsField_eight_tick, rsField_dimension, rsField_countable, rsField_proper⟩Combined with the theorem that every integer power of φ is in the field, this means the entire φ-power scaffold, the working machinery of the mass law, lives inside the countable field, not spread across the uncountable continuum. rsField_phi_zpow · rs_scaffold_below_continuum · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.leanTHEOREM rsField_extend_stays_countable · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.lean
/-- Adjoining any further countable family of constants keeps the field countable. The construction never requires the continuum no matter how many constants RS eventually names. -/ theorem rsField_extend_stays_countable {s : Set ℝ} (hs : s.Countable) : (Subfield.closure (rsConstants ∪ s) : Set ℝ).Countable := subfield_closure_countable_of_countable (rsConstants_countable.union hs)It further proves that adjoining any countable family of new constants keeps the field countable. rsField_extend_stays_countable · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/PRCMinimalField.lean