Categorical formalism: processes, sheaves and interpretation
The process category, the site of open subsets, the numerical state and the phenomenal interpretation have different types. This page proves constructions after their data have been specified. A sheaf topos does not by itself select seven dimensions, a Hamiltonian, a state encoder or a phenomenal bridge. The canonical notation is fixed in the mathematical kernel.
Statuses: [D] definition or chosen model; [T] theorem with stated hypotheses; [C] conditional identification; [H] hypothesis; [I] interpretation; [Pr] research programme; [✗] withdrawn claim.
1. State-preserving process category
Fix finite-dimensional Hilbert spaces, using a small skeleton. In the system category an object is a system and an arrow is a linear completely positive trace-preserving map . Its state assignment is the functor
Definition 1.1 [D]. The category has objects and arrows satisfying . The notation means its restriction to the fixed system .
Channels and composition
Theorems 1.1–1.2 [T]. In finite dimension a channel has a Kraus representation
Composition is ordinary function composition; Kraus operators for are . The identity has the single Kraus operator . The endpoint condition is preserved since . These facts prove all category axioms, including strict associativity. Watrous, chapter 2.
Terminal object and tensor product
For every pair of states there is a replacement channel ; hom-sets here are never empty. For , no object of is terminal: its endomorphisms include distinct identity and replacement channels. In the category with all system dimensions, is terminal: the unique channel to it is trace. This terminal system supplies no preferred preparation on .
The system category and the category with varying dimensions are symmetric monoidal under . Tensoring two seven-dimensional systems produces dimension , so is not closed under this tensor product. This tensor is not a Cartesian product. A stationary numerical state is neither a terminal system nor a terminal object of the fixed-dimension process category.
2. Defining an experiential category
A topological space of candidate qualities or experiential configurations is additional data [D/I]. One can construct several valid categories from it, but they are different:
- The fundamental groupoid has points as objects and endpoint-preserving homotopy classes of paths as arrows. Every arrow is invertible.
- The Moore-path category has paths with a specified nonnegative duration. Concatenation adds durations and is strictly associative, with the duration-zero constant path as identity.
- A category of directed physical histories requires a chosen direction, allowable paths and equivalence relation compatible with composition.
Morphisms and history
Ordinary parametrised paths on , concatenated by halving the interval, are not strictly associative and do not have strict constant-path identities. Taking homotopy classes gives ; using Moore paths gives a strict category. Neither construction is equivalent, without extra hypotheses, to componentwise continuous maps or to CPTP processes. A path inverse in is topological, not a physical reversal of a dissipative process.
The old assertion that these three definitions of were equivalent is withdrawn [✗]. History is a supplied or constructed path object once and its path rules exist; a symbol does not construct an unspecified bicategory or derive an arrow of time.
3. Object readout and degeneracies
Choose a readout . Its interpretation as experiential content is [I/H]. Spectral decomposition alone gives the basis-independent data
The spectral projections onto distinct eigenspaces are canonical. Individual eigenrays inside a degenerate eigenspace are not: replacing its basis by any unitary leaves unchanged. Hence an eigenray readout needs a gauge or must quotient by this ambiguity; sorted eigenvectors are not a globally continuous coordinate chart.
An axis in the native seven-dimensional space has rank-one projection . Its unnormalised block is a scalar weight, and, when , the normalised block is always . It is not a nontrivial quality space. Such a space requires an explicitly enlarged register of dimension , or a different readout. Compressing to a block is CP and trace-nonincreasing; normalising it is generally nonlinear and undefined at zero weight. Partial trace requires a chosen tensor decomposition and differs from conditioning on an axis.
4. When a readout defines process arrows
A state map supplies no automatic action on arrows. Here is a precise criterion.
Proposition 4.1 (descent of processes) [T]. Assume is surjective. A process induces a unique set map satisfying iff
Proof. Necessity follows by applying . Under (DC), define ; it is independent of the representative and is unique by surjectivity. If is a quotient map and is continuous, the descended map is continuous.
The channels satisfying (DC) form a monoid under composition. Define a category on points of with arrows the actual descended maps sending one endpoint to another. The assignment is then a functor on the corresponding restricted process category. Descent for all channels is an additional assertion, not a consequence of a norm bound.
For example, reading only fails (DC) for arbitrary channels: two states with the same weight and different weights acquire different weights after swapping and . Thus arbitrary channels have no well-defined restriction as an endomorphism of the readout space.
5. Functoriality and higher coherence
Proposition 5.1 [T]. For the descended maps above, and .
Proof. Both equations hold after composition with the surjection ; uniqueness in Proposition 4.1 gives the result.
This theorem applies to the declared descent category. It does not prove existence of a phenomenal functor for unrestricted quantum processes. Defining and copying the process category produces an isomorphic labelled category, but that formal relabelling does not prove a phenomenal interpretation.
The former 2-categorical completion
The former Theorem 5.3/T-192 that repaired functoriality by unspecified natural transformations is withdrawn [✗]. A CP map between matrix algebras is a linear map, generally not a -homomorphism or a functor between the algebras viewed as categories. One can always regard an ordinary process category as a locally discrete 2-category, with identity 2-cells only. A richer bicategory requires specified hom-categories, horizontal/vertical composition, associators and unitors, together with the pentagon and triangle identities. Naming these structures does not construct them or prove that lifts to a pseudofunctor.
6. Topos structure and metric enrichment
6.1 Process categories and sheaf categories
For the missing terminal object already prevents from being a topos. No conclusion about an unspecified follows from that observation. An open-cover sheaf category on a specified space is a separate construction, established in §6.3.
6.2 Metric data
A distance between state outputs at one test state is only a pseudometric on channels: distinct channels can agree on that state. Trace distance between all outputs gives a channel metric after taking a supremum; compositional enrichment needs a stated base and composition inequality. The following quality-space result is independent of those channel choices.
6.2.1 The quality space as a Lawvere metric space: enriched Yoneda
The enrichment of item 2 can be taken one level down, on the qualities themselves. Lawvere (1973) observed that a metric space is a category enriched over : the hom-object from to is the number , composition is the triangle inequality , identities are (F. W. Lawvere, "Metric spaces, generalized logic, and closed categories", Rend. Sem. Mat. Fis. Milano 43: 135–166, 1973; reprinted in Repr. Theory Appl. Categ. 1, 2002). Tsuchiya, Phillips & Saigo (Conscious. Cogn. 101: 103319, 2022, doi:10.1016/j.concog.2022.103319) brought enriched categories to qualia: graded dissimilarity as the hom-object and the enriched Yoneda lemma, by which a quale is characterised by its dissimilarities to all other qualia "up to an (enriched) isomorphism". The theorem below is that construction for UHM's own quality space, and what the specific choice of space adds to it.
Let () with the Fubini–Study distance . A -presheaf on is a function with ; presheaves form a -category with hom , where is the internal hom of . The Yoneda map is .
- Enriched Yoneda lemma. for every presheaf .
- Isometry. ; since is symmetric, also — the Yoneda embedding is the Kuratowski isometric embedding of into bounded functions.
- Enriched isomorphism is identity. in the -category iff iff . For UHM's quality space the "up to enriched isomorphism" of the general lemma is "exactly".
- Finite-probe Yoneda. Let be finite with covering radius (every has some with ). The profile satisfies
Dissimilarities to finitely many probes fix a quality up to plus the measurement error of the profile. 5. How many probes. The Fubini–Study ball of radius in has normalised volume . Hence a probe set with covering radius has at least elements, and one with at most elements exists. For and : between 100 and 401 probes; for and : between 642 and 10 067. Read backwards: 93 probe colours (the set of Kawakita et al.) cannot give a covering radius below even on . 6. Cauchy completeness. is compact, hence complete, hence Cauchy complete as a -category (Lawvere 1973): every Cauchy presheaf is representable — a quality defined as the limit of a Cauchy sequence of relational profiles exists in . 7. What the commitment excludes. A finite matrix of dissimilarities is realised by rays of iff for some phases the Hermitian matrix , , is positive semidefinite of rank at most . In particular at most qualities can be pairwise at the maximal distance .
Proof. (1) Take : , so ; and for every , gives . (2) is (1) with , plus symmetry of . (3) Isomorphism in a -category means and ; separates points. (4) The upper bound is the triangle inequality. For the lower one pick with ; then , so . (5) For Haar-random , has the Beta law, so . balls of radius cover only if ; a maximal -separated set is a -cover, and its balls of radius are disjoint. (6) Lawvere's theorem: for metric spaces Cauchy completion is metric completion. (7) The Gram matrix of unit vectors is positive semidefinite of rank with , and every such matrix is a Gram matrix of vectors in ; pairwise-orthogonal unit vectors need .
Items 1, 2, 4 and 5 are checked in check_core_numbers.py (test_enriched_yoneda_embedding_of_fubini_study_rays_is_an_isometry: ; probe bound on ; ball volumes on and ).
What this adds to Tsuchiya–Phillips–Saigo — and what it does not. Their enriched Yoneda lemma holds for any quality space that experiments may find; it identifies a quale up to enriched isomorphism. UHM commits in advance to one space, and the commitment buys three things: identification is exact (item 3); it is quantitative for finitely many probes, with an explicit design count (items 4–5); and it is refutable — item 7 names dissimilarity matrices that no ray configuration realises. The refutation needs a calibration from perceived dissimilarity to , which is not fixed; with only assumed monotone, the test is ordinal and weaker. Two further links: an enriched equivalence between two separated metric spaces is an isometric bijection, so the Gromov–Wasserstein alignment used by Kawakita et al. (a distance that vanishes exactly on isomorphic metric measure spaces — F. Mémoli, Found. Comput. Math. 11: 417–487, 2011) is a relaxed test of enriched equivalence between two subjects' quality spaces; and none of this touches whether a system is conscious — the quality geometry and the predicate are independent (the eigenrays of do not depend on its spectrum, does not depend on the eigenrays; measurement protocol). The identification of experiences with rays remains [I].
6.3 The state-space site and continuous channel maps
The process category of states and CPTP arrows is separate from the site of open subsets of the state space. The site below constructs an -topos rigorously. CPTP contractivity ensures continuity of process maps; it does not give categorical pullbacks of channels or a covering topology on their process category.
6.3.1 Bures open-cover site
Fix and . With squared Uhlmann fidelity
is a compact metric space whose topology agrees with the usual finite-dimensional state-space topology. The metric is defined also at rank-deficient states; its smooth Riemannian description requires the full-rank stratum. A linear CPTP channel is Bures nonexpansive by fidelity monotonicity and therefore continuous. Watrous, The Theory of Quantum Information, chapter 3.
Definition 6.2 (revised) [D]. Let
the poset category of Bures-open subsets, with a unique arrow when . A family covers if . The corresponding covering-sieve topology is . In the revised canonical primitive, refers to this open-cover topology, not the former family of CPTP arrows with prescribed local images.
Theorem 6.1 (open-cover site; revised T-76) [T]. is a small Grothendieck site (within a fixed universe) and is an -topos.
Proof. Identity covers. Pullback of an inclusion is intersection: for , . For covers , one has . These prove identity, base-change stability and transitivity. The opens form a set, hence the site is small. The sheafification theorem identifies sheaves of spaces on this site as a left-exact localization of presheaves of spaces, giving an -topos. This is the usual topological-space construction; see Lurie, Higher Topos Theory, §6.2.2 and §7.1.
A countable basis of balls, with centers in a countable dense set and positive rational radii, presents the same sheaf category with the induced covers. The objects of this basis site are open balls, not the dense points viewed as states. Restricting a CPTP process category to countably many density matrices does not establish an equivalent sheaf topos.
Withdrawn [✗]: the former process-category site proof. CPTP contractivity does not imply that categorical pullbacks of channels exist, or that inverse images of balls are contained in bounded-radius balls. A constant reset has the whole state space as inverse image of any neighborhood of its output. The old local-image covering proof used both implications without justification. Its asserted equivalence to a dense-point skeleton also lacked a comparison theorem with a dense subsite. The construction above replaces that proof; it does not validate it retroactively.
6.3.2 Channels induce geometric morphisms
For a CPTP map , inverse image of opens is the functor
It preserves finite intersections and arbitrary unions, in particular covers. Thus the continuous map induces a geometric morphism
Here is left exact and . These are functors between sheaf topoi, not an automatic internal state morphism of one topos. Additional internalization/realization data are needed for that identification. A noninvertible channel can induce a geometric morphism without becoming an isomorphism or a reversible physical process.
6.3.3 Experiential space and its site
If a specific topological experiential space is supplied, its open-cover site defines by the same theorem [T at the specified space]. A continuous readout induces a geometric morphism using inverse images of opens. Continuity alone does not imply that direct images of open covers cover open neighborhoods, since a continuous map need not be open or surjective. The former Theorem 6.2 asserting forward preservation of covers from a Lipschitz bound is withdrawn [✗]. Neither the topology nor the physical/phenomenal validity of is thereby derived.
Constructing a sheaf topos does not make a separately defined process category itself a topos. If one instead wants sheaves on that process category, a Grothendieck topology must be specified and verified there; the open-space construction does not silently provide it. Giraud conditions are a characterization of a topos, not extra obligations after a verified small site has already been supplied.
6.3.4 Subobject classifier and realization
In the open-space topos the subobject classifier is the sheaf
Its global sections are opens of ; it is not the constant object given by that one lattice. For a subsheaf and section , is the largest open on which belongs to . This classifies the subobject. In the -topos the same classifier is -truncated and classifies -truncated morphisms.
The former formula using a supremum of radii with does not define this characteristic morphism. For a sufficiently large ball the intersection can occur even outside the subset, and truth values here are opens, not real numbers in . Taking a square root of such a truth value does not produce a Kraus or Lindblad operator. A numerical filter realization must be explicitly specified, as in typed mathematical kernel and formalization of φ.
7. Faithfulness, alternatives and limits
A functor is faithful when each map on hom-sets is injective; injectivity of its object map is a different property. A descended process functor can identify distinct channels. If is bijective, the assignment is faithful, since equality after conjugation implies equality on all states, which linearly span Hermitian matrices. This is a conditional theorem about a specified encoder. It does not follow from uniqueness of a forward flow, contraction or covariance.
The former unconditional faithfulness claim based on T-42a/T-123 is withdrawn [✗]. See the corrected representation theorem: reversible CPTP comparison, coverage of the state space, and preservation of the specified octonionic form are explicit bridge assumptions. A constant map into a stationary state can intertwine dynamics without being injective.
The Hilbert–Schmidt adjoint of a CPTP channel is CP and unital, but is generally not trace-preserving and need not reverse the distinguished endpoint state. Thus it does not define a dagger on this state-preserving category. Work with all CP maps between systems if a dagger structure is needed, and impose trace preservation separately. Tensor products of systems supply monoidal composition; they do not prove a tensor product of phenomenologies.
8. Phenomenal completeness
A phenomenal bridge can be formulated as specified data , where is a model readout and interprets it as experience. Coverage of a class of experiences, injectivity up to a declared equivalence, and compatibility with interventions are separate hypotheses [H]. They require operational criteria for comparing experiences and validating .
Nonzero proves nonzero numerical weight; it does not prove phenomenality. A formal consciousness predicate is a definition within a model; its empirical and phenomenal validity is an additional claim. Neither a universal phenomenal bridge nor its uniqueness follows from constructing .
9. AI encoding and controlled approximation
Nonlinearity of a neural layer does not violate the axioms of its own category: composition of nonlinear functions is associative. What needs justification is a chosen representation by linear CPTP arrows. A state encoder is not itself an assignment of neural layers to channels.
A well-typed operational test chooses for a layer and evaluates
For composable on suitable domains, contractivity gives
This is a state-prediction bound. Approximate functoriality on channels, e.g. a diamond-norm bound between and , is stronger and requires probes spanning the operator space (including an ancilla for direct diamond-norm certification). It is not implied by one observed trajectory.
Corrected Taylor theorem 9.1 [T]
Let be on the relevant neighbourhoods. Put , , , . If the Hessian norms on the relevant segments are bounded by , then, for the composition of the corresponding affine tangent maps,
Proof. The integral Taylor remainder gives , with . Apply the same formula to with increment . The difference is , bounded by the displayed expression. This proof uses no scalar intermediate-point formula for a vector-valued Hessian and no unjustified remainder from merely regularity.
Withdrawn [✗]: automatic CPTP linearization. The old formula generally has trace and is not trace-preserving. A fitted channel must separately satisfy positivity of its Choi matrix and the partial-trace condition. Ordinary input-state Jacobians or NTK linearization prove neither condition. The encoding and channel-fitting problem remains [Pr]; see the measurement protocol.
10. Singular complexes and emergent time
T-91, mathematical part [T]. For a specified topological space , the singular simplicial set is a Kan complex and hence models an -groupoid. Its -simplices are continuous maps with the usual face and degeneracy maps. This is a homotopy model of a space, not a reconstruction of dissipative process arrows. Lurie, Higher Topos Theory, §1.2.5.
Sheaves and truncations
The open-cover site of gives [T at supplied ], as in §6.3. Postnikov truncations exist there. Identifying a phenomenological level with such a truncation requires a specified object and a proved comparison; cognitive depth is not automatically a homotopy degree. A contractible quality space has trivial higher homotopy even if the model contains many numerical qualities or long histories.
Clock registers and Page–Wootters or Feynman–Kitaev constraints are separately supplied dynamical data. A loop in an -groupoid is invertible; it does not establish a causal, aperiodic clock or physical information loss.
11. Discrete histories
A sequence of states with chosen transition channels defines a diagram on the ordered category . Its nerve need not be Kan: the nerve of an ordinary category is Kan iff that category is a groupoid. Channel irreversibility therefore cannot be encoded merely by declaring this nerve an -groupoid. Passing to groupoid completion removes the directed-process information.
A cyclic register and an ordered depth register are different constructions. Taking a dense limit of equally spaced readings on a circle yields a circle, not an unbounded time line. The interpretation of a constraint register as the system's physical time requires the additional clock-and-constraint model; see emergent time.
12. Structured holon processes
Let a structured model be , where is a declared self-model and is a declared viable region [D]. An arrow is CPTP and satisfies
Closure theorem 12.1 [T]
Identities satisfy both conditions. If and satisfy them, then and . Thus the structured objects and arrows form a category. Its forgetful functor to systems is faithful. Including a distinguished viable state gives a faithful forgetful functor to . If several structures occur on the same state, this is not an object-injective inclusion until a structure assignment is fixed.
Interiority assignment
If a functor on the underlying process category has actually been supplied, restricting it gives [T]. Existence of is conditional on this input; it is not a new proof of the phenomenal bridge. Normalised conditioning does not commute with arbitrary channels, as §4 shows.
13. Derived and local cohomology
The rank- locus of is a smooth manifold of real dimension : a rank- positive matrix is for a full-rank complex matrix , modulo the free action, with one trace constraint. For , rank one has dimension and full rank dimension . The selected point is not the whole full-rank stratum.
The full state space is convex and contractible via . Ordinary constant-coefficient cohomology in positive degrees therefore vanishes. Local cohomology or cohomology with nonconstant/constructible coefficients may differ, but requires a specified sheaf, support condition and stratification. Nontriviality of such groups does not imply nonzero physical vacuum energy, and their vanishing does not cancel a degree-zero energy density.
Intersection complexes and decomposition theorems require their respective geometric and sheaf-theoretic hypotheses; an arbitrary Bures space or a numerical rank stratification does not automatically meet them. The claimed universal physical IC identification is [Pr], not a consequence of the construction of a derived category.
14. What the -topos supplies
The specified site supplies an -topos with limits, colimits, internal mapping objects, a subobject classifier and truncations. These are mathematical constructions [T]. Choosing it as an ontological primitive is [I/D]. Other sites also supply -topoi; their existence is not excluded by a universal property of this construction.
The terminal object satisfies . This says that maps to it form a contractible space; it does not identify a maximally mixed numerical state or supply multiple physically different choices. At a hyperbolic attracting equilibrium on the trace-one tangent space the Jacobian has no zero mode. Neither this terminal-object statement nor a Hessian kernel by itself proves free will.
15. Logical structure and numerical realization
15.1 Types and the former L-unification
In , is the sheaf of opens described in §6.3.4. A characteristic morphism is a logical predicate. A matrix state, a Hilbert-space projection and a GKSL operator have other types. An expression or does not bridge these types.
Withdrawn [✗]: the former universal identification of , internal logic, dissipator and self-model; ; and the derivation of numerical operators or rates from this classifier alone. In fact is connected, so its global decidable opens (clopen subsets) are only and . Internally there can be more local decidable propositions, but no seven-atom basis follows.
15.2 A valid finite-frame construction
Choose an orthonormal basis [D]. The Boolean algebra of subsets of that finite frame has the representation
These commuting projections obey and . This is one classical measurement context; it is not the entire quantum projection lattice or the topological classifier .
More generally, chosen positive effects with give a POVM and the nonselective Lüders channel
The channel is CPTP by the Kraus condition. Numerical realization of a logical predicate as an effect requires a separately defined map and checks that it preserves the intended structure. The site alone supplies no such map.
For the chosen seven Fano coordinate line projectors, all products reduce to intersections. There are at most fifteen distinct nonempty words as operators: seven line projections, seven point projections and zero; the empty word additionally gives . Hence the former T-115 claim of distinct generic-state compositions is false, including off-diagonal states. A stochastic or grammar-based history can still have many distinct labels; those labels are not distinct projector products.
15.3 Adjunctions and rates
The canonical logical self-support reflector is
It takes the effective-image support of a map to . The hom-space proof and unit are given in formalization of φ. Its induced idempotent monad is logical support, not a dissipative state map or a numerical prediction model.
The former adjunction has no stated categories or hom-set bijection and is withdrawn [✗]. No regeneration rate , bootstrap scale or Hamiltonian follows from it. Rates require specified dynamics, units and couplings. Units/counits of a categorical adjunction cannot be identified with channel probabilities or amplitudes without a declared realization theorem.
Nonassociativity and process composition
Octonion multiplication can be nonassociative. Composition of functions, channels, and endofunctors remains associative. A bicategory permits a coherent associator between composites, with the pentagon identity; it does not license arbitrary failure of associativity. Octonionic structure must enter explicitly as algebraic data on an object or in a specified enriched construction, not by treating ordinary composition as octonion multiplication.
Local channels and no-signalling
Local marginal theorem [T]
For a linear CPTP local channel,
Proof. Write the channel in Kraus form. Partial-trace cyclicity for operators on gives . The equality holds for every joint state, including entangled states.
Numerical self-models on composites
Frozen-parameter channels are well-defined. A nonlinear state-dependent map is not a linear channel and has no automatic extension on entangled inputs. An extension can be prescribed by using local marginals to select channel parameters; the marginal theorem then holds pointwise for that prescription. Other prescriptions need a separate no-signalling proof. Also in general (a diagonal subset already disproves it in sets). Logical support reflection does not imply tensor factorization of numerical self-models.
Phenomenal interpretation and Yoneda
Yoneda embeds a specified category fully faithfully into its presheaves. It says that objects of that category are determined, up to isomorphism, by their represented hom-functors. It does not construct an empirical category of experience, identify it with density matrices or prove that a proposed bridge is faithful. The precise metric result for a chosen ray-quality space is enriched Yoneda; its phenomenal interpretation remains [I].
16. Self-reference with explicit hypotheses
To define a closure operation on propositions one needs a typed endomorphism and its axioms, e.g. those of a Lawvere–Tierney topology. The numerical map is not such an endomorphism. A collection of -invariant predicates can be defined after specifying an internal realization of , but is not automatically a subobject of named : that notation denotes a collection of subobjects unless additional internal representation is given.
Lawvere's fixed-point theorem requires a weakly point-surjective map in a Cartesian closed category. Under that hypothesis each endomorphism of has a fixed point: apply the diagonal argument to . Cartesian closedness alone does not provide . Lawvere, 1969. If has a fixed-point-free endomorphism, the conclusion is that no such exists. This does not entail phenomenal externality, a strictly smaller internal theory, physical vacuum energy, or incompleteness of an unspecified proof calculus.
Scope of categorical closure
Closure of declared constructions
Finite-dimensional states/channels, the open-cover site, its sheaf -topos and the slice support reflector form a rigorous mathematical kernel after their inputs are fixed. Further chosen structures include dimension, frame, octonionic form, Hamiltonian/rates, numerical self-model, encoder, clock constraint and phenomenal bridge. Their being expressible in one internal language is not a derivation of their values or existence. The former zero-axiom or all-phenomena closure claim is withdrawn [✗].
Relation to cohesive-topos programmes
A Grothendieck topology is not cohesion. Cohesion needs an adjoint quadruple and its further axioms; differential cohesion adds infinitesimal structure. A state space may be modelled as an object of a separately supplied cohesive ambient topos without proving that its open-cover sheaf topos has that structure. See Schreiber's primary construction. Interpretation of homotopy type theory in an -topos likewise does not derive quantum, phenomenal or dynamical bridge data.
Homotopy truncations and the L hierarchy
The mathematical truncation functors are [T]. The former universal theorem is withdrawn [✗]: the functional criteria defining cognitive levels supply no comparison equivalences with these homotopy types. A proposed comparison must define both sides and prove it for a specified model. See the interiority hierarchy for its own criteria and status.
Precedents and related programmes
Topos quantum theory
The context-topos programmes use commutative observable algebras as the base, not opens of a density-matrix space. Isham–Butterfield's primary paper relates Kochen–Specker obstruction to absence of global sections; Heunen–Landsman–Spitters' Bohrification builds a commutative algebra internally. Their specific theorems do not transfer to without a comparison theorem. Fano coordinate projections commute and admit the joint distribution ; they cannot give Kochen–Specker contextuality by themselves.
Categorical quantum mechanics
Abramsky–Coecke describe composition of quantum protocols categorically. Coecke–Pavlović–Vicary characterize an orthogonal basis by a commutative dagger-Frobenius structure. These give tools for a chosen frame and process calculus; they do not derive a universal UHM encoder or a phenomenal bridge. The distinction between systems and states, and between CP and CPTP arrows, must be retained when importing this structure.
Cohesive physics
Schreiber develops differential cohomology under explicit cohesive hypotheses. The proposed pairing of that programme with UHM is [I/C] until those hypotheses and the physical bridge are supplied. No seven-dimensional choice follows from the general sheaf or cohesive construction.
Related: typed kernel, self-model typing, representation and tomography, measurement protocol, premise ledger.
Legacy section links
These anchors preserve existing links. The former assertions are replaced by the typed definitions, conditional results and withdrawals above.