Realization Calculus: twin edition

Download original file

This is the original TeX manuscript source. Use the paper’s PDF for typeset equations.

1 \chapter{Boundaries as part of the calculus}
2 \label{ch:calculus}
3 \chapterintro{The constructions identify specific obligations for realization: compatibility, admissibility, generation, and effective evaluation. A failure at one level need not be a failure at another.}
4 
5 \section{The ambient object and its admissible realizations}
6 The chain
7 \[
8 D\subseteq G_A\subseteq P
9 \]
10 contains three different mathematical roles. The direct sum provides the finite-support corrections. The product supplies every compatible prime-coordinate tuple. The intermediate group is the intended admissible realization, determined by a rational line in the quotient.
11 
12 This arrangement gives a concrete model for a central question of Komorebi Space. Once the compatible ambient object exists, what additional data identifies the realization under study? Here the answer is exact: a rational subspace of $P/D$, or in the paired family its selector class. Existence of the ambient product does not eliminate that choice.
13 
14 The construction does not assert that every Komorebi Space model is a prime-coordinate product. It isolates a theorem-level phenomenon that any broad realization language must be able to express: the space of compatible observations can be larger than the intended source image.
15 
16 \section{Three certificates and one global obstruction}
17 The finite-seed argument supplies a projection certificate. An omitted prime coordinate vanishes on every admissible endomorphism orbit but not on the target group. This is a structural failure of generation under the fixed operator action.
18 
19 The root algorithm supplies a coordinate certificate of impossibility or a finite correction witnessing success. It is a fully local algebraic realization problem. The successful and unsuccessful branches are both explicit.
20 
21 The nonsplitting result supplies an extension obstruction. A rational quotient exists, but no homomorphic section realizes it inside the reduced product. In cocycle coordinates, the obstruction is the impossibility of removing the defect by a $D$-valued correction.
22 
23 The grammar theorem is different. It excludes every finite description in a fixed language by an infinite diagonal comparison. It need not supply a terminating rejection procedure for individual candidate descriptions. Conflating this global semantic obstruction with the finite root certificates would overstate its algorithmic content.
24 
25 \section{A realization profile rather than a single score}
26 One scalar cannot capture all the boundaries exhibited here. The following profile retains the distinctions:
27 \[
28 \bigl(\text{seed rank},\ \text{grammar complexity},\
29 \text{least presentation degree},\ \text{observation type}\bigr).
30 \]
31 For every $G_A$, the seed rank is $\aleph_0$ and the observation type is the same. The least presentation degree varies with $A$. Grammar complexity depends on which selectors the chosen semantic language can name.
32 
33 The profile is not proposed as a complete classification invariant for arbitrary mathematical objects. It is a disciplined way to avoid substituting one question for another. A theory may have exact coordinates without a finite generator, a finite formula without computable equality, or an effectively presented inverse-limit completion without a computable copy of the intended dense realization.
34 
35 \section{What a machine-facing contract should retain}
36 A reusable construction record should specify its input type, its permitted parameters, its output object, and the sense in which the output is determined. It should also state whether it returns a concrete representation, an abstract isomorphism type, or an existence proof. When completion is used, the intended image and the completed ambient object should be separate fields.
37 
38 For the present family, a compact exact record is:
39 \begin{center}
40 \begin{tabularx}{\textwidth}{@{}p{0.22\textwidth}X@{}}
41 \toprule
42 Field&Content\\\midrule
43 Ambient system&$D\subseteq P$ and the quotient $q:P\to P/D$.\\
44 Parameter&The selector $A$, with its declared oracle or finite semantic description.\\
45 Admissible image&$q^{-1}(\Q q(u_A))$.\\
46 Concrete names&Reduced rationals paired with normalized finite-support vectors.\\
47 Operation&The finite cocycle law \eqref{eq:grouplaw}.\\
48 Positive certificate&A root and its exact multiplication check.\\
49 Negative certificate&A prime coordinate obstructing the required root.\\
50 Global invariants&Selector modulo finite changes and least presentation degree.\\
51 Observation boundary&Unmarked finite quotients forget the admissible source image.\\\bottomrule
52 \end{tabularx}
53 \end{center}
54 Such a record does not solve arbitrary group-theoretic problems. It makes the semantics of this construction inspectable and prevents a machine from promoting a finite observation theorem into a source reconstruction theorem.
55 
56 \section{Further questions with exact starting points}
57 The general correspondence of Chapter~\ref{ch:purity} extends the ambient construction to higher-dimensional rational subspaces $W\le P/D$. Its finite quotient theorem is already complete. What remains is to classify those subspaces under the diagonal multipliers that induce group homomorphisms. The paired rank-one family has an exact answer, but the book does not claim that its binary signature classifies higher rank.
58 
59 A second question concerns effective selection. For $G_A$, the normal-form operation and the paired root tests give a matching upper and lower bound. For a more general countable $W$, one must specify how its rational dependencies are presented and how lifts are computed. A list of candidate spanning vectors is not enough if their dependence relations are unavailable.
60 
61 A third question concerns enriched observations. A coherent marked point restores the selector in the declared rank-one family. A useful general theorem would characterize which additional marks or admissibility predicates suffice for reconstruction in larger classes. Such a result must state whether its reconstruction is semantic, effective, or functorial.
62 
63 Finally, the formal companion keeps the arithmetic kernel, quotient lemmas, tail signature, and computability reduction as distinct proof obligations. Appendix~\ref{app:formal} explains the resulting interfaces. The oracle theorem has its own effective semantics, with native oracle programs, computable equality, and terminating searches in addition to the algebraic proofs.
64 
65 \section{Conclusion}
66 The principal boundary is now concrete. There is a fixed ambient completion, presented by a computable inverse system, and a family of countable, residually finite groups densely realized inside it. Their finite-quotient systems are canonically identified, and restriction to $D$ naturally identifies their homomorphism sets into every finite target. Yet the groups have distinct algebraic types and require arbitrarily different computational information.
67 
68 Realization is therefore not exhausted by compatibility. It includes the selection of admissible objects, the transport of their meaning, and an account of the information needed to evaluate them. The groups in this book turn that distinction into explicit constructions, exact classifications, and reproducible finite certificates.

Back to source controls

Back to Realization Calculus: twin edition