Typed mathematical kernel
This page fixes the mathematical interface of UHM after the foundational revision of 2026-10-03. A theorem concerns its stated objects and assumptions; an interpretation does not change their types. The numerical state model is retained, while the formerly asserted identification of categorical logic, channels, attractors and experience is replaced by explicit bridges.
States and processes
Fix finite-dimensional complex Hilbert spaces with chosen semantic frames. Write
Its trace-one affine hull has real dimension . Full-rank states form its relative interior; rank-deficient states are not an open smooth manifold of that dimension.
The process category has objects , , and linear CPTP maps as arrows. Its pointed version has objects and arrows with . Composition and the tensor product are inherited from channels. The tensor unit is terminal: the only trace-preserving map to it is discarding, .
Terminality theorem [T]. No state with is terminal in the pointed process category. Both the identity and the replacement channel are distinct endomorphisms fixing . In particular is a state, not the terminal object.
The sector is a selected state model [P], not a tensor-closed category: two seven-dimensional systems have joint state in . A literal partial trace requires a specified tensor factorization. A named basis vector does not define a nontrivial tensor factor.
Executable representations closed under observations
The state model admits a constructive representation theorem once the required observations and actions are specified. Fix Hermitian observables and linear CPTP channels on . Let be the Heisenberg adjoint for the trace pairing. Define
Observable closure theorem [T]. This sequence reaches the least common -invariant real subspace containing the declared observations and , after at most strict extensions. For a basis of , the representation
has linear updates . Two states have the same representation exactly when every declared observation has the same expectation after every finite word of the declared channels, including the empty word.
Proof. Each adjoint preserves Hermitian operators. The nested subspaces lie in , of real dimension ; equality at one step implies invariance and termination. Any invariant space containing contains every step, proving leastness. Write and use trace duality to obtain the update formula. The union of the stages is the span of all finite adjoint words applied to the observations and . Equality of their expectations is therefore exactly equality of the coordinates. The identity coordinate is fixed to one on . ∎
This supplies an explicit instance of the action-preserving representation required for executable transfer in Autogeny and SYNARC. Preserving a present observation alone is insufficient: the qubit states and have equal diagonal populations, but applying the same Hadamard channel makes their first populations one and zero. Embedding this block in gives the same counterexample in the selected UHM carrier.
The exact algorithm uses finite linear algebra for exactly represented channel coefficients; floating-point rank decisions require separate error bounds. The admissible coordinate space is , not all of . Minimality concerns this invariant space of observables, not a smallest quantum subsystem or a claim that its matrices are CPTP maps on a smaller algebra. Nonlinear self-models require closure under pullback of functions and are not covered by the finite linear theorem. For seven-dimensional factors, the ambient bound is ; actual closure size, construction and execution cost must be measured. General observation theory is established mathematics; this theorem makes its precise constructive bridge to the UHM state model explicit.
A genuine Bures site
Equip with the chordal Bures distance
Use the site : arrows are inclusions of open sets and a family covers iff . This gives the canonical realization
Site theorem [T]. Identities cover, pullback is intersection, and unions of covering families cover. Indeed and whenever . Thus the open-cover topology satisfies the Grothendieck axioms. Universe conventions make this a small site.
A CPTP map is Bures-continuous (in fact contractive), so inverse images of opens define a geometric morphism . This is the correct bridge between the process category and sheaf semantics. It does not identify channels with inclusions of opens or with every morphism of a sheaf topos.
Former channel-cover argument withdrawn [✗]. The condition that images of small balls cover a target ball is not proved to be stable as a sieve by CPTP contractivity. Contractivity bounds images, not inverse lifts. The old proof additionally used pullbacks in the process category without establishing their existence. One can generate a Grothendieck topology from arbitrary specified sieves, but generation alone does not prove its subcanonicity, metric interpretation or equivalence to the open site. None of those equivalences is assumed here.
The Bures and Euclidean topologies coincide on finite-dimensional ; a metric tensor is extra structure beyond its topology. Bures is distinguished within the family of monotone quantum metrics, not the only possible distinguishability metric. Its Riemannian tensor is used on full-rank strata; metric continuity extends to the boundary.
Logic and a support mirror
In any -topos , fix an object . The correct universal construction is
It sends to its effective-epimorphism/monomorphism image, equivalently its -truncation in the slice. A map over for a subobject exists exactly when the image lies in , and its space is contractible when it exists. This proves the adjunction; its restriction to subobjects is the identity. See the full typed self-model construction.
This support mirror is logical. A numerical self-model is a different object requiring a definition and, for empirical use, an observation model. No CPTP property, anchor, regeneration rate, Bures optimization, spectral projector or phenomenal content follows merely from the support adjunction.
The classifier classifies subobjects. For sheaves on a space, its sections over are opens of . It is not a seven-element algebra of projections. On connected , clopen sets are only ; predicates overlap, so they cannot be seven disjoint Boolean atoms. A chosen orthogonal frame gives a seven-outcome projective instrument [D], independently of . Reading it as articulation or internal logic is a bridge [I].
Numerical self-models and dynamics
A quantum channel is linear on the operator algebra and hence affine on states. The assertion “ for every ” is only state preservation. If parameters depend on , even a family of CPTP maps need not give an affine map .
For example a fixed-anchor model
has a CPTP realization for each frozen input-dependent coefficient, but the complete state map is generally nonlinear. Intrinsic anchors such as are also nonlinear. Joint-system extensions must be specified; applying a nonlinear map to an unspecified ensemble is not a definition.
The evolution model is
Given locally Lipschitz , with , and a fixed GKSL generator for the linear part, it has unique solutions remaining in [T]. At a boundary vector , the commutator and anticommutator contribute zero, and the remaining quadratic forms are . Trace is preserved. The finite-dimensional tangent-cone criterion gives invariance; compactness gives global continuation. This theorem proves well-posedness, not physical selection of .
Neither a unique stationary state nor a gap of the linear generator proves uniqueness or contraction of the nonlinear flow. On the trace-one tangent space the Jacobian of a hyperbolic sink has no zero eigenvalue. The zero trace mode of a linear operator on all matrices cannot be substituted for a state-dependent self-model.
If every trajectory in a forward-invariant domain converges to a fixed point in that domain, its limit map is idempotent there [T]. An open basin may exclude its boundary limits: either require that all limits lie in the domain, or extend the map by the identity on those fixed points before composing it with itself. Existence, continuity, linearity and complete positivity of this limit are separate questions. An idempotent set map alone does not define a categorical reflector.
Thresholds and operational meaning
Write , , , and . Then
These are exact [T]. The following are model choices [D]/[I]: call structural majority “viability”; call “reflexive access”; call coherent majority “integration”. They imply the numerical cuts [T]. Their interpretation as biological survival or experience remains [H]/[I]. A posterior probability requires a likelihood and priors; does not become one by being named reflection.
For , the capability gate is
Here requires its stated experiential realization or a separately declared proxy. The first two conjuncts give . The interval alone is not the whole gate. The product is necessary for the two scalar access conditions but is not sufficient for their conjunction. Identifying with consciousness is an empirical/ontological bridge, not a theorem about matrices.
Phases alone do not determine this gate. See Gap identifiability. Reconstruction from data likewise requires informational completeness or a demonstrated identifiable statistical model, not only symmetry of the codomain.
Representation bridge (RI) [H]. A conditional comparison of encoders can assume that both are bijective and that their comparison is a CPTP isomorphism preserving a specified octonionic three-form. The resulting symmetry classification is then a theorem with those inputs. Observed data, dynamics and codomain symmetry do not imply (RI); it is much stronger than covariance. General reconstruction uses observation-law fibres instead. See the corrected uniqueness theorem.
Dimension and physics bridges
Seven functional names do not prove seven linearly independent coordinates. The strongest established lower bound here is conditional on the perfect-diagnosability premise ; a separate exact representation theorem bounds faithful representations of by dimension seven. Each conclusion retains its premise. See minimality.
Tensor extensions require a named lift and readout. A section–retraction is not Morita equivalence and does not make lift-dependent reduced entropies functions of automatically.
The matter-action bridge (Mod)/(Cl₀), spacetime bridge (P), anchor principle (MaxΦ), chosen rates and phenomenal identification remain explicit inputs. Mathematical group coincidences and encodings do not derive physical dynamics without them; the premise register records these dependencies.
Topology, terminality and time
The terminal object exists in every topos. Its global sections are the terminal space, not . It does not supply a relaxation channel or an arrow of time. A category with a terminal object has contractible nerve, but terminality of its sheaf category does not imply terminality of the indexing category.
is convex and contractible. Removing degeneracy sets may produce nontrivial topology; its homotopy and that of an explicitly specified experiential object must be calculated. The availability of higher mapping spaces does not force them to be nontrivial or identify a Postnikov stage with consciousness. A Postnikov tower has inverse limit, with convergence requiring Postnikov completeness of the object/topos.
A physical frequency must be invariant under . Thus cannot supply it. Use a specified nonzero Bohr-frequency scale or a calibrated [P]. A clock factor and Page–Wootters constraint are additional data; periodic ticks do not by themselves give an aperiodic time line or thermodynamic arrow.
Sources and verification
- Domenico D’Alessandro, On Quantum State Observability and Measurement: indistinguishability under controlled quantum dynamics.
- Tommaso Grigoletto, Yukuan Tao, Francesco Ticozzi and Lorenza Viola, Exact Model Reduction for Continuous-Time Open Quantum Dynamics: linear observable reductions and the separate conditions for reduced quantum dynamics.
- Jacob Lurie, Higher Topos Theory, §§5.5.6, 6.2: truncations, sheaf topoi and geometric morphisms.
- Dénes Petz and Csaba Sudár, Geometries of Quantum States: monotone metrics and the distinguished minimal metric.
- John Watrous, The Theory of Quantum Information: channels, discrimination, measurements and reconstruction.
- R. W. Hamming, Error Detecting and Error Correcting Codes: coding assumptions underlying the dimension bound.
- Yui Kuramochi, GKSL derivation from Kraus representations: finite-dimensional linear semigroups; no extension to arbitrary nonlinear maps is presumed.
website/scripts/check_mathematical_kernel.py checks counterexamples to the withdrawn implications and the explicit replacement identities. Numerical checks supplement the proofs; they do not certify every theorem or any phenomenal interpretation.