Skip to main content

Categorical formalism: processes, sheaves and interpretation

Revised mathematical foundation — 2026-10-03

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 CPTP\mathbf{CPTP} an object is a system H\mathcal H and an arrow is a linear completely positive trace-preserving map Λ:B(H)→B(K)\Lambda:\mathcal B(\mathcal H)\to\mathcal B(\mathcal K). Its state assignment is the functor

D:CPTP→Set,ρ⟼Λ(ρ).\mathcal D:\mathbf{CPTP}\to\mathbf{Set},\qquad \rho\longmapsto\Lambda(\rho).

Definition 1.1 [D]. The category DensityMat=∫D\mathbf{DensityMat}=\int\mathcal D has objects (H,ρ)(\mathcal H,\rho) and arrows Λ:(H,ρ)→(K,σ)\Lambda:(\mathcal H,\rho)\to(\mathcal K,\sigma) satisfying Λ(ρ)=σ\Lambda(\rho)=\sigma. The notation DensityMatN\mathbf{DensityMat}_N means its restriction to the fixed system CN\mathbb C^N.

Channels and composition​

Theorems 1.1–1.2 [T]. In finite dimension a channel has a Kraus representation

Λ(X)=∑aKaXKa†,∑aKa†Ka=I.\Lambda(X)=\sum_aK_aXK_a^\dagger,\qquad\sum_aK_a^\dagger K_a=I.

Composition is ordinary function composition; Kraus operators for ΨΛ\Psi\Lambda are BbKaB_bK_a. The identity has the single Kraus operator II. The endpoint condition is preserved since ΨΛ(ρ)=Ψ(σ)\Psi\Lambda(\rho)=\Psi(\sigma). 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 X↦Tr⁡(X)σX\mapsto\operatorname{Tr}(X)\sigma; hom-sets here are never empty. For N>1N>1, no object of DensityMatN\mathbf{DensityMat}_N is terminal: its endomorphisms include distinct identity and replacement channels. In the category with all system dimensions, (C,1)(\mathbb C,1) is terminal: the unique channel to it is trace. This terminal system supplies no preferred preparation on C7\mathbb C^7.

The system category and the category with varying dimensions are symmetric monoidal under ⊗\otimes. Tensoring two seven-dimensional systems produces dimension 4949, so DensityMat7\mathbf{DensityMat}_7 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 YY 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 Π1(Y)\Pi_1(Y) 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 [0,1][0,1], concatenated by halving the interval, are not strictly associative and do not have strict constant-path identities. Taking homotopy classes gives Π1(Y)\Pi_1(Y); 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 Π1(Y)\Pi_1(Y) is topological, not a physical reversal of a dissipative process.

The old assertion that these three definitions of Exp\mathbf{Exp} were equivalent is withdrawn [✗]. History is a supplied or constructed path object once YY and its path rules exist; a symbol π1(Exp2)\pi_1(\mathbf{Exp}_2) does not construct an unspecified bicategory or derive an arrow of time.

3. Object readout and degeneracies​

Choose a readout q:XN→Yq:X_N\to Y. Its interpretation as experiential content is [I/H]. Spectral decomposition alone gives the basis-independent data

ρ=∑λ∈Spec⁡(ρ)λ Pλ.\rho=\sum_{\lambda\in\operatorname{Spec}(\rho)}\lambda\,P_\lambda.

The spectral projections onto distinct eigenspaces are canonical. Individual eigenrays inside a degenerate eigenspace are not: replacing its basis by any unitary leaves ρ\rho unchanged. Hence an eigenray readout needs a gauge or must quotient by this ambiguity; sorted eigenvectors are not a globally continuous coordinate chart.

An EE axis in the native seven-dimensional space has rank-one projection PEP_E. Its unnormalised block PEΓPE=γEEPEP_E\Gamma P_E=\gamma_{EE}P_E is a scalar weight, and, when γEE>0\gamma_{EE}>0, the normalised block is always PEP_E. It is not a nontrivial CPn−1\mathbb{CP}^{n-1} quality space. Such a space requires an explicitly enlarged EE register of dimension n>1n>1, 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 qq supplies no automatic action on arrows. Here is a precise criterion.

Proposition 4.1 (descent of processes) [T]. Assume q:XN↠Yq:X_N\twoheadrightarrow Y is surjective. A process Λ\Lambda induces a unique set map fΛ:Y→Yf_\Lambda:Y\to Y satisfying qΛ=fΛqq\Lambda=f_\Lambda q iff

q(ρ)=q(σ)⟹q(Λρ)=q(Λσ).(DC)q(\rho)=q(\sigma)\quad\Longrightarrow\quad q(\Lambda\rho)=q(\Lambda\sigma).\tag{DC}

Proof. Necessity follows by applying fΛf_\Lambda. Under (DC), define fΛ(q(ρ))=q(Λρ)f_\Lambda(q(\rho))=q(\Lambda\rho); it is independent of the representative and is unique by surjectivity. If qq is a quotient map and qΛq\Lambda is continuous, the descended map is continuous. □\square

The channels satisfying (DC) form a monoid under composition. Define a category on points of YY with arrows the actual descended maps sending one endpoint to another. The assignment (ρ,Λ)↦(q(ρ),fΛ)(\rho,\Lambda)\mapsto(q(\rho),f_\Lambda) 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 γEE\gamma_{EE} fails (DC) for arbitrary channels: two states with the same EE weight and different AA weights acquire different EE weights after swapping EE and AA. Thus arbitrary channels have no well-defined restriction Λ∣E\Lambda|_E as an endomorphism of the readout space.

5. Functoriality and higher coherence​

Proposition 5.1 [T]. For the descended maps above, fid=idf_{\mathrm{id}}=\mathrm{id} and fΨΛ=fΨfΛf_{\Psi\Lambda}=f_\Psi f_\Lambda.

Proof. Both equations hold after composition with the surjection qq; uniqueness in Proposition 4.1 gives the result. □\square

This theorem applies to the declared descent category. It does not prove existence of a phenomenal functor for unrestricted quantum processes. Defining Y=XNY=X_N 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 qq lifts to a pseudofunctor.

6. Topos structure and metric enrichment​

6.1 Process categories and sheaf categories​

For N>1N>1 the missing terminal object already prevents DensityMatN\mathbf{DensityMat}_N from being a topos. No conclusion about an unspecified Exp\mathbf{Exp} 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 V=([0,∞],≥,+,0)\mathcal V = ([0,\infty], \geq, +, 0): the hom-object from aa to bb is the number d(a,b)d(a,b), composition is the triangle inequality d(a,b)+d(b,c)≥d(a,c)d(a,b) + d(b,c) \geq d(a,c), identities are 0≥d(a,a)0 \geq d(a,a) (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 Q=P(HE)≅CPn−1Q = \mathbb P(\mathcal H_E) \cong \mathbb{CP}^{n-1} (n=dim⁡HEn = \dim \mathcal H_E) with the Fubini–Study distance d([ψ],[φ])=arccos⁡∣⟨ψ∣φ⟩∣∈[0,π/2]d([\psi],[\varphi]) = \arccos |\langle \psi | \varphi \rangle| \in [0, \pi/2]. A V\mathcal V-presheaf on QQ is a function ϕ:Q→[0,∞]\phi: Q \to [0,\infty] with ϕ(a)≤d(a,b)+ϕ(b)\phi(a) \leq d(a,b) + \phi(b); presheaves form a V\mathcal V-category Q^\widehat Q with hom [ϕ,ψ]=sup⁡x(ψ(x)⊖ϕ(x))[\phi, \psi] = \sup_{x} (\psi(x) \ominus \phi(x)), where y⊖x=max⁡(y−x,0)y \ominus x = \max(y - x, 0) is the internal hom of V\mathcal V. The Yoneda map is y(a)=d(−,a)\mathbf y(a) = d(-, a).

Theorem (Enriched Yoneda for qualia) [T]
  1. Enriched Yoneda lemma. [y(a),ϕ]=ϕ(a)[\mathbf y(a), \phi] = \phi(a) for every presheaf ϕ\phi.
  2. Isometry. [y(a),y(b)]=d(a,b)[\mathbf y(a), \mathbf y(b)] = d(a,b); since dd is symmetric, also sup⁡x∣d(x,a)−d(x,b)∣=d(a,b)\sup_x |d(x,a) - d(x,b)| = d(a,b) — the Yoneda embedding is the Kuratowski isometric embedding of QQ into bounded functions.
  3. Enriched isomorphism is identity. a≅ba \cong b in the V\mathcal V-category QQ iff d(a,b)=0=d(b,a)d(a,b) = 0 = d(b,a) iff a=ba = b. For UHM's quality space the "up to enriched isomorphism" of the general lemma is "exactly".
  4. Finite-probe Yoneda. Let S⊂QS \subset Q be finite with covering radius δ\delta (every aa has some s∈Ss \in S with d(a,s)≤δd(a,s) \leq \delta). The profile yS(a)=(d(s,a))s∈S\mathbf y_S(a) = (d(s,a))_{s \in S} satisfies
d(a,b)−2δ  ≤  max⁡s∈S∣d(s,a)−d(s,b)∣  ≤  d(a,b).d(a,b) - 2\delta \;\leq\; \max_{s \in S} |d(s,a) - d(s,b)| \;\leq\; d(a,b).

Dissimilarities to finitely many probes fix a quality up to 2δ2\delta plus the measurement error of the profile. 5. How many probes. The Fubini–Study ball of radius rr in CPn−1\mathbb{CP}^{n-1} has normalised volume sin⁡2(n−1)r\sin^{2(n-1)} r. Hence a probe set with covering radius δ\delta has at least sin⁡−2(n−1)δ\sin^{-2(n-1)}\delta elements, and one with at most sin⁡−2(n−1)(δ/2)\sin^{-2(n-1)}(\delta/2) elements exists. For n=2n = 2 and δ=0.1\delta = 0.1: between 100 and 401 probes; for n=3n = 3 and δ=0.2\delta = 0.2: between 642 and 10 067. Read backwards: 93 probe colours (the set of Kawakita et al.) cannot give a covering radius below arcsin⁡(1/93)≈0.104\arcsin(1/\sqrt{93}) \approx 0.104 even on CP1\mathbb{CP}^1. 6. Cauchy completeness. QQ is compact, hence complete, hence Cauchy complete as a V\mathcal V-category (Lawvere 1973): every Cauchy presheaf is representable — a quality defined as the limit of a Cauchy sequence of relational profiles exists in QQ. 7. What the commitment excludes. A finite matrix of dissimilarities (dij)(d_{ij}) is realised by rays of CPn−1\mathbb{CP}^{n-1} iff for some phases θij=−θji\theta_{ij} = -\theta_{ji} the Hermitian matrix Gij=cos⁡(dij) eiθijG_{ij} = \cos(d_{ij})\, e^{i\theta_{ij}}, Gii=1G_{ii} = 1, is positive semidefinite of rank at most nn. In particular at most nn qualities can be pairwise at the maximal distance π/2\pi/2.

Proof. (1) Take x=ax = a: ϕ(a)⊖d(a,a)=ϕ(a)\phi(a) \ominus d(a,a) = \phi(a), so [y(a),ϕ]≥ϕ(a)[\mathbf y(a), \phi] \geq \phi(a); and for every xx, ϕ(x)≤d(x,a)+ϕ(a)\phi(x) \leq d(x,a) + \phi(a) gives ϕ(x)⊖d(x,a)≤ϕ(a)\phi(x) \ominus d(x,a) \leq \phi(a). (2) is (1) with ϕ=y(b)\phi = \mathbf y(b), plus symmetry of dd. (3) Isomorphism in a V\mathcal V-category means 0≥Q(a,b)0 \geq Q(a,b) and 0≥Q(b,a)0 \geq Q(b,a); dd separates points. (4) The upper bound is the triangle inequality. For the lower one pick ss with d(s,a)≤δd(s,a) \leq \delta; then d(s,b)≥d(a,b)−δd(s,b) \geq d(a,b) - \delta, so d(s,b)−d(s,a)≥d(a,b)−2δd(s,b) - d(s,a) \geq d(a,b) - 2\delta. (5) For Haar-random ψ\psi, ∣⟨ψ∣c⟩∣2|\langle \psi | c \rangle|^2 has the Beta(1,n−1)(1, n-1) law, so Pr⁡[d(ψ,c)≤r]=Pr⁡[∣⟨ψ∣c⟩∣2≥cos⁡2r]=(1−cos⁡2r)n−1\Pr[d(\psi, c) \leq r] = \Pr[|\langle \psi | c\rangle|^2 \geq \cos^2 r] = (1 - \cos^2 r)^{n-1}. NN balls of radius δ\delta cover only if Nsin⁡2(n−1)δ≥1N \sin^{2(n-1)}\delta \geq 1; a maximal δ\delta-separated set is a δ\delta-cover, and its balls of radius δ/2\delta/2 are disjoint. (6) Lawvere's theorem: for metric spaces Cauchy completion is metric completion. (7) The Gram matrix of unit vectors v1,…,vm∈Cnv_1, \dots, v_m \in \mathbb C^n is positive semidefinite of rank ≤n\leq n with ∣Gij∣=cos⁡dij|G_{ij}| = \cos d_{ij}, and every such matrix is a Gram matrix of vectors in Cn\mathbb C^n; mm pairwise-orthogonal unit vectors need m≤nm \leq n. □\square

Items 1, 2, 4 and 5 are checked in check_core_numbers.py (test_enriched_yoneda_embedding_of_fubini_study_rays_is_an_isometry: n=2,3,7n = 2, 3, 7; probe bound on CP1\mathbb{CP}^1; ball volumes on CP1\mathbb{CP}^1 and CP2\mathbb{CP}^2).

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 ff from perceived dissimilarity to dd, which is not fixed; with ff 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 Cons(S)\mathrm{Cons}(S) are independent (the eigenrays of Γ\Gamma do not depend on its spectrum, PP 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​

Canonical construction — revised 2026-10-03

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 ∞\infty-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 N<∞N<\infty and XN=D(CN)X_N=\mathcal D(\mathbb C^N). With squared Uhlmann fidelity

F(ρ,σ)=(Trρ σρ)2,dB(ρ,σ)=2(1−F(ρ,σ)),F(\rho,\sigma)=\left(\mathrm{Tr}\sqrt{\sqrt\rho\,\sigma\sqrt\rho}\right)^2, \qquad d_B(\rho,\sigma)=\sqrt{2(1-\sqrt{F(\rho,\sigma)})},

XNX_N 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 Λ\Lambda is Bures nonexpansive by fidelity monotonicity and therefore continuous. Watrous, The Theory of Quantum Information, chapter 3.

Definition 6.2 (revised) [D]. Let

CN=Open⁡B(XN),\mathcal C_N=\operatorname{Open}_B(X_N),

the poset category of Bures-open subsets, with a unique arrow V→UV\to U when V⊆UV\subseteq U. A family {Ui↪U}\{U_i\hookrightarrow U\} covers if ⋃iUi=U\bigcup_iU_i=U. The corresponding covering-sieve topology is JBJ_B. In the revised canonical primitive, JBJ_B 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]. (CN,JB)(\mathcal C_N,J_B) is a small Grothendieck site (within a fixed universe) and EN=Sh⁡∞(XN)=Sh⁡∞(CN,JB)\mathcal E_N=\operatorname{Sh}_\infty(X_N)=\operatorname{Sh}_\infty(\mathcal C_N,J_B) is an ∞\infty-topos.

Proof. Identity covers. Pullback of an inclusion is intersection: for V⊆UV\subseteq U, ⋃i(V∩Ui)=V\bigcup_i(V\cap U_i)=V. For covers Ui=⋃jVijU_i=\bigcup_jV_{ij}, one has U=⋃i,jVijU=\bigcup_{i,j}V_{ij}. 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 ∞\infty-topos. This is the usual topological-space construction; see Lurie, Higher Topos Theory, §6.2.2 and §7.1. □\square

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 Λ:XN→XM\Lambda:X_N\to X_M, inverse image of opens is the functor

Λ−1:Open⁡B(XM)→Open⁡B(XN).\Lambda^{-1}:\operatorname{Open}_B(X_M)\to\operatorname{Open}_B(X_N).

It preserves finite intersections and arbitrary unions, in particular covers. Thus the continuous map induces a geometric morphism

Λ:EN→EM,Λ∗⊣Λ∗.\Lambda:\mathcal E_N\to\mathcal E_M, \qquad\Lambda^*\dashv\Lambda_*.

Here Λ∗\Lambda^* is left exact and Λ∗F(U)=F(Λ−1U)\Lambda_*F(U)=F(\Lambda^{-1}U). 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 YY is supplied, its open-cover site Open⁡(Y)\operatorname{Open}(Y) defines Sh⁡∞(Y)\operatorname{Sh}_\infty(Y) by the same theorem [T at the specified space]. A continuous readout q:XN→Yq:X_N\to Y 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 qq is thereby derived.

Constructing a sheaf topos does not make a separately defined process category Exp\mathbf{Exp} 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

ΩN(U)=Open⁡(U),ΩN(U⊇V)(W)=W∩V.\Omega_N(U)=\operatorname{Open}(U),\qquad \Omega_N(U\supseteq V)(W)=W\cap V.

Its global sections are opens of XNX_N; it is not the constant object given by that one lattice. For a subsheaf A↪FA\hookrightarrow F and section s∈F(U)s\in F(U), χA(s)\chi_A(s) is the largest open V⊆UV\subseteq U on which s∣Vs|_V belongs to A(V)A(V). This classifies the subobject. In the ∞\infty-topos the same classifier is 00-truncated and classifies (−1)(-1)-truncated morphisms.

The former formula using a supremum of radii with BB(Γ′,r)∩S≠∅B_B(\Gamma',r)\cap S\ne\varnothing 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 [0,1][0,1]. 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 qq is bijective, the assignment Λ↦qΛq−1\Lambda\mapsto q\Lambda q^{-1} 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 Λ∗\Lambda^* 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 (Y,q,W)(Y,q,W), where qq is a model readout and WW 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 qq.

Nonzero γEE\gamma_{EE} 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 Sh⁡∞(XN)\operatorname{Sh}_\infty(X_N).

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 G:S→XNG:S\to X_N is not itself an assignment of neural layers to channels.

A well-typed operational test chooses Λf\Lambda_f for a layer ff and evaluates

ϵf=sup⁡s∈K∥G(f(s))−Λf(G(s))∥1.\epsilon_f=\sup_{s\in K}\|G(f(s))-\Lambda_f(G(s))\|_1.

For composable f,gf,g on suitable domains, contractivity gives

∥G(f(g(s)))−ΛfΛgG(s)∥1≤ϵf+ϵg.\|G(f(g(s)))-\Lambda_f\Lambda_gG(s)\|_1\leq\epsilon_f+\epsilon_g.

This is a state-prediction bound. Approximate functoriality on channels, e.g. a diamond-norm bound between Λfg\Lambda_{fg} and ΛfΛg\Lambda_f\Lambda_g, 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 f,gf,g be C2C^2 on the relevant neighbourhoods. Put x=x0+hx=x_0+h, ∥h∥≤r\|h\|\leq r, A=Dg(x0)A=Dg(x_0), B=Df(g(x0))B=Df(g(x_0)). If the Hessian norms on the relevant segments are bounded by Mg,MfM_g,M_f, then, for the composition of the corresponding affine tangent maps,

∥f(g(x))−f(g(x0))−BAh∥≤12∥B∥Mgr2+12Mf(∥A∥r+12Mgr2)2.\|f(g(x))-f(g(x_0))-BAh\| \leq \tfrac12\|B\|M_g r^2 +\tfrac12M_f(\|A\|r+\tfrac12M_gr^2)^2.

Proof. The integral Taylor remainder gives g(x)=g(x0)+Ah+rgg(x)=g(x_0)+Ah+r_g, with ∥rg∥≤Mgr2/2\|r_g\|\leq M_gr^2/2. Apply the same formula to ff with increment u=Ah+rgu=Ah+r_g. The difference is Brg+rfBr_g+r_f, bounded by the displayed expression. This proof uses no scalar intermediate-point formula for a vector-valued Hessian and no unjustified O(r3)O(r^3) remainder from merely C2C^2 regularity. □\square

Withdrawn [✗]: automatic CPTP linearization. The old formula X↦X+JfXJfTX\mapsto X+J_fXJ_f^T generally has trace Tr⁡X+Tr⁡(JfTJfX)\operatorname{Tr}X+\operatorname{Tr}(J_f^TJ_fX) 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 YY, the singular simplicial set Sing⁡(Y)\operatorname{Sing}(Y) is a Kan complex and hence models an ∞\infty-groupoid. Its nn-simplices are continuous maps Δn→Y\Delta^n\to Y 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 YY gives Sh⁡∞(Y)\operatorname{Sh}_\infty(Y) [T at supplied YY], as in §6.3. Postnikov truncations τ≤n\tau_{\leq n} 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 ∞\infty-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 0→1→⋯→m0\to1\to\cdots\to m. 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 ∞\infty-groupoid. Passing to groupoid completion removes the directed-process information.

A cyclic register ZN\mathbb Z_N 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 A=(HA,MA,VA)A=(\mathcal H_A,M_A,V_A), where MA:XA→XAM_A:X_A\to X_A is a declared self-model and VA⊆XAV_A\subseteq X_A is a declared viable region [D]. An arrow Λ:A→B\Lambda:A\to B is CPTP and satisfies

Λ(VA)⊆VB,ΛMA=MBΛ.\Lambda(V_A)\subseteq V_B,\qquad\Lambda M_A=M_B\Lambda.

Closure theorem 12.1 [T]​

Identities satisfy both conditions. If Λ:A→B\Lambda:A\to B and Ψ:B→C\Psi:B\to C satisfy them, then ΨΛ(VA)⊆VC\Psi\Lambda(V_A)\subseteq V_C and ΨΛMA=MCΨΛ\Psi\Lambda M_A=M_C\Psi\Lambda. 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 DensityMat\mathbf{DensityMat}. 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 FF on the underlying process category has actually been supplied, restricting it gives I=F∘U\mathcal I=F\circ U [T]. Existence of I\mathcal I is conditional on this input; it is not a new proof of the phenomenal bridge. Normalised EE conditioning does not commute with arbitrary channels, as §4 shows.

13. Derived and local cohomology​

The rank-rr locus of XNX_N is a smooth manifold of real dimension 2Nr−r2−12Nr-r^2-1: a rank-rr positive matrix is ZZ†ZZ^\dagger for a full-rank N×rN\times r complex matrix ZZ, modulo the free U(r)U(r) action, with one trace constraint. For N=7N=7, rank one has dimension 1212 and full rank dimension 4848. The selected point I7/7I_7/7 is not the whole full-rank stratum.

The full state space is convex and contractible via Ht(ρ)=(1−t)ρ+tIN/NH_t(\rho)=(1-t)\rho+tI_N/N. 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 ∞\infty-topos supplies​

The specified site supplies an ∞\infty-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 ∞\infty-topoi; their existence is not excluded by a universal property of this construction.

The terminal object 1E1_{\mathcal E} satisfies Map⁡(A,1E)≃∗\operatorname{Map}(A,1_{\mathcal E})\simeq *. 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 EN=Sh⁡∞(XN)\mathcal E_N=\operatorname{Sh}_\infty(X_N), Ω\Omega is the sheaf of opens described in §6.3.4. A characteristic morphism χS:G→Ω\chi_S:G\to\Omega is a logical predicate. A matrix state, a Hilbert-space projection and a GKSL operator have other types. An expression L=Ω∩ΓL=\Omega\cap\Gamma or χS\sqrt{\chi_S} does not bridge these types.

Withdrawn [✗]: the former universal identification of LL, internal logic, dissipator and self-model; Dec⁡(Ω)≅27\operatorname{Dec}(\Omega)\cong2^7; and the derivation of numerical operators or rates from this classifier alone. In fact XNX_N is connected, so its global decidable opens (clopen subsets) are only ∅\varnothing and XNX_N. 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 e1,…,eNe_1,\ldots,e_N [D]. The Boolean algebra of subsets of that finite frame has the representation

S⊆{1,…,N}⟼PS=∑i∈S∣ei⟩⟨ei∣.S\subseteq\{1,\ldots,N\}\quad\longmapsto\quad P_S=\sum_{i\in S}|e_i\rangle\langle e_i|.

These commuting projections obey PSPT=PS∩TP_SP_T=P_{S\cap T} and PSc=I−PSP_{S^c}=I-P_S. This is one classical measurement context; it is not the entire quantum projection lattice or the topological classifier Ω\Omega.

More generally, chosen positive effects EaE_a with ∑aEa=I\sum_aE_a=I give a POVM and the nonselective Lüders channel

Λ(X)=∑aEa XEa.\Lambda(X)=\sum_a\sqrt{E_a}\,X\sqrt{E_a}.

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 II. Hence the former T-115 claim of 7n7^n 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

LG:E/G⇄Sub⁡E(G):iG,LG⊣iG.L_G:\mathcal E_{/G}\rightleftarrows\operatorname{Sub}_{\mathcal E}(G):i_G,\qquad L_G\dashv i_G.

It takes the effective-image support of a map to GG. 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 (DΩ,R)(\mathcal D_\Omega,\mathcal R) adjunction has no stated categories or hom-set bijection and is withdrawn [✗]. No regeneration rate κ0\kappa_0, 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,

Tr⁡A[(ΛA⊗idB)(ρAB)]=Tr⁡AρAB.\operatorname{Tr}_A[(\Lambda_A\otimes\mathrm{id}_B)(\rho_{AB})]=\operatorname{Tr}_A\rho_{AB}.

Proof. Write the channel in Kraus form. Partial-trace cyclicity for operators on AA gives ∑aTr⁡A(ρAB(Ka†Ka⊗I))=Tr⁡AρAB\sum_a\operatorname{Tr}_A(\rho_{AB}(K_a^\dagger K_a\otimes I))=\operatorname{Tr}_A\rho_{AB}. The equality holds for every joint state, including entangled states. □\square

Numerical self-models on composites​

Frozen-parameter channels CλA⊗CλBC_{\lambda_A}\otimes C_{\lambda_B} are well-defined. A nonlinear state-dependent map MAM_A is not a linear channel and has no automatic extension MA⊗idBM_A\otimes\mathrm{id}_B 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 Sub⁡(G×H)≇Sub⁡(G)×Sub⁡(H)\operatorname{Sub}(G\times H)\not\cong\operatorname{Sub}(G)\times\operatorname{Sub}(H) 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 FF 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 j:Ω→Ωj:\Omega\to\Omega and its axioms, e.g. those of a Lawvere–Tierney topology. The numerical map M:XN→XNM:X_N\to X_N is not such an endomorphism. A collection of MM-invariant predicates can be defined after specifying an internal realization of MM, but is not automatically a subobject of Ω\Omega named Subclosed(Ω)\mathrm{Sub}_{\mathrm{closed}}(\Omega): that notation denotes a collection of subobjects unless additional internal representation is given.

Lawvere's fixed-point theorem requires a weakly point-surjective map e:A→YAe:A\to Y^A in a Cartesian closed category. Under that hypothesis each endomorphism of YY has a fixed point: apply the diagonal argument to h(a)=f(e(a)(a))h(a)=f(e(a)(a)). Cartesian closedness alone does not provide ee. Lawvere, 1969. If YY has a fixed-point-free endomorphism, the conclusion is that no such ee 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 ∞\infty-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 Π⊣Disc⊣Γ⊣coDisc\Pi\dashv\mathrm{Disc}\dashv\Gamma\dashv\mathrm{coDisc} 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 ∞\infty-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 Ln≅τ≤nSing⁡(Y)L_n\cong\tau_{\leq n}\operatorname{Sing}(Y) 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 Sh⁡∞(XN)\operatorname{Sh}_\infty(X_N) without a comparison theorem. Fano coordinate projections commute and admit the joint distribution pi=γiip_i=\gamma_{ii}; 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.

These anchors preserve existing links. The former assertions are replaced by the typed definitions, conditional results and withdrawals above.