IndisputableMonolith.Foundation.PrimitiveRecognitionCalculus.GenerableReal
Defines the generable reals: the subfield of R generated by a countable family of named constants together with the rationals under field operations. Supplies countability, rational/constant membership, properness, and an operational-carrier packaging. Downstream Delta-native analysis and objecthood registry modules import this carrier. Development is definitional plus elementary field-generation facts.
claimLet $\kappa$ be a countable family of named real constants. The generable field $\mathrm{Gen}(\kappa)\subseteq\mathbb{R}$ is the subfield generated by $\kappa\cup\mathbb{Q}$: every element is obtained from finitely many constants and rationals by finitely many additions, multiplications, and inversions.
background
In Primitive Recognition Calculus, operational reals are not arbitrary continuum points. They must be constructible from a sparse set of named constants by field operations. This module isolates that constructible carrier relative to a parameter family $\kappa$.
The generable field is the smallest subfield of $\mathbb{R}$ containing every constant in $\kappa$. Since every subfield of $\mathbb{R}$ contains $\mathbb{Q}$, rationals are automatic members, and each element is a rational expression in finitely many named generators. Sibling facts record countability of the carrier, membership of rationals and constants, properness (strictly smaller than $\mathbb{R}$ for typical $\kappa$), and a comparison that display length can exceed pure generation.
Upstream imports supply minimal field infrastructure (PRCMinimalField) and the real-valued $\Delta$ layer (DeltaReal) against which generability is judged.
proof idea
Primarily a definition module. The core object is the subfield generated by the named constants. Countability is the standard countable-union argument over finite rational expressions in finitely many generators. Rational and constant membership are immediate from subfield axioms. Properness and the display-versus-generation comparison are elementary cardinality or length contrasts. An operational-carrier lemma packages these facts for importers. No deep analytic machinery.
why it matters in Recognition Science
DeltaNativeAnalysis and DeltaNativeStrongClosure import this carrier to separate operationally generable quantities from continuum-generic reals in $\Delta$-analysis. ObjecthoodRegistry uses the same carrier to decide which objects can be named inside the recognition calculus.
In the Recognition Science foundation, restricting to generable reals keeps the ontology countable and tied to forced named constants (phi-ladder, J-cost data from the T0–T8 chain) rather than an uncountable sea of nameless reals. That supports the claim that physical display cannot outrun finite generation from the named constants.
scope and limits
- Does not form algebraic or transcendental closures beyond the field generated by $\kappa$.
- Does not prove uniqueness or canonicity of the constant family $\kappa$; it is a parameter.
- Does not address metric completion or topological closure inside $\mathbb{R}$.
- Does not derive the RS constants; those come from the forcing chain elsewhere.
- Does not decide which specific physical displays exceed generation; only supplies the comparison lemma.