1 Introduction
1.1 The modular program and its governing perspective
This is Part VI, the synthesis, of a modular seven-part program organized by a single perspective:
Physics is the study of realizations of condensed mathematical structures.
The program is deliberately modular, not unified. Each Part isolates one interface between condensed mathematics (in the sense of Clausen–Scholze ) and physics, states precisely what it establishes, and composes with its predecessors only through explicitly declared hand-offs. The five preceding Parts remove, one at a time, a piece of presupposed geometric background, and then — in Part V — begin to put geometry back as a derived object:
Part I replaced the smooth manifold by the condensed set as the kinematic substrate, exhibiting the fully faithful embedding of compactly generated spaces into condensed sets (Scholze, Prop. 1.7 ), so that manifolds are faithfully embedded, not discarded, and the extra room is where Planck-scale structure may live.
Part II attached observables to condensed test objects, obtaining a (co)sheaf of observable algebras on the pro-étale site — a condensed refinement of the Haag–Kastler net and of Costello–Gwilliam factorization algebras — before any geometry is posited.
Part III proposed information as the primitive object: entanglement as a compatibility (cocycle) condition in condensed cohomology, with the surface-code theorem and the HaPPY code as its established (non-condensed) precedents.
Part IV demoted the manifold on which a field lives, replacing by a condensed-module-valued object landing in solid or liquid modules, and audited exactly which ingredients of a free field still secretly invoke .
Part V recovered geometry as a realization functor, organizing Gelfand duality, Tannakian reconstruction, Connes’ spectral reconstruction, Tomita–Takesaki/Bisognano–Wichmann, and the cobordism hypothesis into one schema, and isolating the single sharpest gap: every established metric reconstruction is Riemannian, whereas spacetime is Lorentzian.
1.2 What a synthesis paper is, and is not
The task of Part VI is to recompose these five interfaces into one object and to ask what, if anything, the composite says about quantum gravity. It is essential to state at the outset what this paper does and does not claim.
This paper does not claim to solve quantum gravity, to derive the Einstein field equations, to construct a Lorentzian emergent spacetime, or to prove that gravity is entanglement. It presents a research program: a precise pipeline whose ingredients (condensed mathematics, AQFT, TQFT, HoTT, derived algebraic geometry, higher category theory, the Ryu–Takayanagi formula within AdS/CFT) are established mathematics or established-within-their-setting physics, but whose headline physical interpretation — that gravity emerges from gluing condensed informational structures — is speculative. We will prove exactly two things and label everything else. Any reader who takes away more than the two boxed [EST] theorems (1 and 4) has taken away more than we have shown.
The discipline we impose is the collaboration’s status calculus : every claim is tagged [EST] (established, citable, proved), [HEU] (a physically-motivated heuristic dictionary entry, not itself a theorem), or [SPEC] (a speculative ontological/physical hypothesis of this program), and statuses compose monotonically, worst-case wins. 2 makes this a small but genuine theorem, which is then the load-bearing device that keeps the rest of the paper honest.
1.3 The assembled pipeline
The object this paper assembles is the following diagram, in which each node is a category (or -category) and each arrow is a construction supplied by one of Parts I–V. We write the per-arrow status beneath each arrow; the composite status is their join.
The dashed arrow is drawn dashed on purpose: it is not atomic. Measurement does not hand back a spacetime; it hands back structured relational data, and the passage to geometry factors through a chain of intermediate pregeometric layers. We record this de-compression once, here, as the ladder [eq:ladder], and dissect it rung by rung in 3.5:
1.4 Contributions
The status calculus as a theorem ([EST]). We formalize as a bounded totally ordered idempotent commutative monoid and prove the weakest-link theorem (1): composite status is the join of link statuses; composition is associative, commutative, idempotent, monotone, with identity EST and absorbing element SPEC. The accompanying Haskell realizes this as a verified combinator.
A finite closure theorem for the whole pipeline ([EST]). We instantiate [eq:pipeline] on finite data — a finite weighted graph as a discrete condensed object — and prove (4) that the composite is a well-defined functor which (a) satisfies Čech descent for the observable sheaf, (b) has derived invariant , , and (c) outputs an emergent distance equal to the finite Connes spectral distance of Part V. This is the finite, rigorous “closure theorem” the program’s dossier calls for, and it is code-backed.
A de-compressed terminal ladder ([HEU]/[SPEC], per rung). We refuse to let the terminal arrow “observables emergent geometry” stand as atomic. We replace it ([eq:ladder], 3.5) by an explicit pregeometric ladder , label each rung [EST]/[HEU]/[SPEC] honestly, and attach each geometric rung to an established reconstruction theorem — Bisognano–Wichmann (modular flow boost/causal geometry), Malament (causal order fixes topology and the conformal metric), causal sets (order counting Lorentzian geometry in the continuum limit), and Connes (metric from an algebra). This localizes the program’s blocking work in the relationalcausaltopologymetricdynamics segment and makes “measurements glue, therefore geometry” an explicitly non-proof.
Five established anchors, positioned precisely ([EST]). We locate AQFT, TQFT, HoTT, derived algebraic geometry, and higher category theory each as an established structure the framework specializes or uses (4), stating in each case what is borrowed and what is not.
Three speculative goals, dissected ([SPEC]). For each of (A) classical spacetime as a limit, (B) locality as a derived compatibility condition, (C) gravity from gluing of informational structures, we give a boxed hypothesis, separate the [EST]/[HEU]/[SPEC] layers, and state explicitly what a proof would require and what currently blocks it (6).
A weakest-link status census ([SPEC] headline). A single table (8.2) records the status of every claim and makes the composite [SPEC] status of the program’s headline unavoidable to the reader.
1.5 A note on originality and prior art
As recorded in the program’s knowledge base, dedicated literature search found no existing work combining condensed mathematics (Clausen–Scholze) with quantum gravity, holography, or AQFT beyond the ordinary functional-analytic/operator-algebraic literature that predates condensed mathematics. This absence is a feature to be flagged, not a gap to conceal: Parts IV–VII stake out genuinely unoccupied territory, and every place the condensed machinery is asked to do physical work beyond what is proved is marked [SPEC]. We cite only the real, independently verified literature (condensed mathematics, Tannakian duality, AQFT/TQFT, operator algebras, the RT formula) and the three internal prior-work libraries of this collaboration , and we take pains to distinguish this program from the related-but-distinct cohesive-HoTT and topos-quantum-theory programs.
1.6 Outline
Section 2 formalizes and proves the status calculus. Section 3 assembles the pipeline stage by stage, recapping each Part’s contribution and marking every arrow. Section 4 positions the five established anchors. Section 5 proves the finite closure theorem. Section 6 dissects the three speculative goals. Sections 7–9 give results, discussion (including the status census), limitations, hand-off to Part VII, and conclusion. Section 10 documents the accompanying verified Haskell.
2 The status calculus, made a theorem
Before assembling anything we make precise the device that keeps the assembly honest. The idea is folklore in the collaboration and has a Lean stub for its core monotonicity lemma; here we give a self-contained statement and proof, and (in 10) a verified executable realization.
2.1 The warrant order
Definition 1 (Warrant set and order). Let be the three-element warrant set, totally ordered by read “more established more speculative”. We assign numerical ranks , , , so that .
The intended reading: is the strongest (least speculative, most established) warrant and the weakest; “the weakest link” of a chain is the one with the largest warrant in the order.
Definition 2 (Status composition). Define by the join with respect to the total order of 1 (equivalently, the element of larger rank). We call status composition.
2.2 The weakest-link theorem
Theorem 1 (Weakest-link theorem). The triple is a commutative monoid that is moreover idempotent and bounded, and is monotone in each argument. Explicitly, for all :
(associativity) ;
(commutativity) ;
(identity) ; EST is a two-sided identity;
(absorption) ; SPEC is absorbing;
(idempotence) ;
(monotonicity) ;
(worst-case characterization) for any finite family , and in particular iff every , while iff some .
Proof. All statements are properties of the binary maximum on a totally ordered set, transported through the rank isomorphism . Since is an order isomorphism, . The maximum on a totally ordered set is associative and commutative (both sides of (i), (ii) equal the largest rank among the arguments), has the least element as identity ((iii): since ) and the greatest element as absorbing element ((iv): since ), and is idempotent ((v): ). Monotonicity (vi) is the standard fact that . For (vii), induction on using associativity reduces the iterated to the -ary maximum; iff all , and iff some . Reading ranks back through gives the stated warrant identities. ◻
Remark 1 (Why a semilattice, not a group). has no inverses: once a chain of reasoning contains a [SPEC] link, no amount of established mathematics downstream can remove it, because is absorbing (iv). This is exactly the epistemic content we want. A synthesis paper is under constant temptation to let a long train of rigorous lemmas “pay off” the speculative debt of one physical hypothesis; the monoid structure forbids this arithmetically. Equivalently, is a bounded join-semilattice, and status assignment is a monoid homomorphism from the free monoid of pipeline composites to .
Definition 3 (Status of a pipeline). A pipeline is a finite composable chain of arrows , each arrow carrying a status . Its composite status is
Corollary 1 (The pipeline [eq:pipeline] is [SPEC]). With the per-arrow labels of [eq:pipeline], and with its terminal arrow de-compressed into the ladder [eq:ladder], the composite status of the full assembled pipeline is
Proof. Immediate from 1(vii): the join of the labels is their maximum, . Unlike in the coarse reading, the maximum is no longer attained at a single “final arrow” but across the entire lower segment of the ladder [eq:ladder] — the relationalcausaltopology metricdynamics rungs — each of which is [SPEC] for a separately stated reason (3.5). The absorption law (1(iv)) makes a single [SPEC] rung sufficient; there are four. ◻
This corollary is the paper in miniature. Everything after it is either (a) verifying that the first two arrows really are [EST] (3, 5), (b) locating the borrowed [EST] anchors (4), or (c) being precise and honest about why the last arrow is [SPEC] and what would be required to improve it (6).
3 Assembling the pipeline
We now walk the pipeline [eq:pipeline] node by node, recalling each Part’s deliverable and recording precisely what is established at that stage and what is deferred. Throughout, “condensed” means a sheaf on the pro-étale site of a point — equivalently a sheaf on profinite (or extremally disconnected) sets with finite jointly-surjective covers .
3.1 Stage 1 — condensed objects (Part I)
Definition 4 (Condensed set). A condensed set is a sheaf on the pro-étale site of a point: , , and for a surjection of profinite sets, is an equalizer. Condensed abelian groups are the internal abelian group objects; they form a Grothendieck abelian category .
Proposition 1 (Part I hand-off; Scholze Prop. 1.7). The functor , , is faithful, and fully faithful on compactly generated spaces. [EST] In particular any smooth manifold is faithfully embedded as a condensed set with no loss of information; the point of Part I is that is strictly larger and better behaved (it is closed under limits and colimits and is abelian, unlike topological abelian groups).
This is the [EST] content of the first node. The physical hypothesis of Part I — that Planck-scale spacetime is better modeled by a condensed object than a manifold — is [SPEC] and is not used as a premise here; only the embedding is.
3.2 Stage 2 — the derived category (Parts III, IV)
The arrow sends a condensed set to (the derived image of) the free condensed abelian group , landing in the derived -category of condensed abelian groups. This is where the homological content lives.
Proposition 2 (The derived stage is established). is a Grothendieck abelian category, so its derived category is a stable -category with a natural -structure; the solid subcategory and, over , the liquid subcategory are full stable subcategories closed under limits, colimits, and extensions, and carry a symmetric monoidal derived tensor product and internal hom . [EST]
This is precisely the machinery Part IV needed to replace “complete topological vector spaces of fields” (which do not form an abelian category) by solid/liquid modules (which do), and that Part III needed to define condensed cohomology of a sheaf of observable data. The arrow is [EST] as mathematics. What is not established is that the resulting condensed cohomology is the right home for a physical entanglement invariant; that is the [SPEC] proposal of Part III, and it enters the pipeline only downstream.
3.3 Stage 3 — quantum states (Part III)
A state is produced by a representation of the derived/observable data on a (condensed) Hilbert-type module. In the finite closure model of 5 a state is a positive normalized weight; in the intended infinite setting it is a normalized positive linear functional on a condensed operator algebra (a GNS-type datum), with the von Neumann-algebraic and Tomita–Takesaki structure of available. We mark this arrow [HEU]: the existence of states on condensed algebras is unproblematic, but the claim that physical quantum states of a gravitating system are faithfully captured by this datum, prior to any geometry, is a heuristic of the program, not a theorem.
3.4 Stage 4 — observables (Part II)
Part II attaches to each condensed test object an algebra (or module) of observables , and requires descent: compatible local observations glue. The correct categorical form is the sheaf/cosheaf fork discussed there — kinematic data restricts (a sheaf; limit-gluing), dynamical/operator data composes (a cosheaf/factorization algebra; colimit-gluing) — and both are condensed refinements of established structures (Haag–Kastler nets ; Costello–Gwilliam factorization algebras ). The pairing of a state against yields expectation values. We mark this arrow [HEU] for the same reason as Stage 3: the descent mathematics is [EST] (4 proves a finite case), but the claim that fundamental observables are condensed-sheaf-valued prior to geometry is a heuristic.
Remark 2 (Retaining automorphisms: the gauge principle). A recurring load-bearing fact across the program is that gluing must retain automorphisms, not merely coarse values: for a quotient stack , . In the condensed observable sheaf this says an observable assigned to a condensed “point” (an extremally disconnected profinite set) must remember its gauge automorphisms. The pipeline is therefore properly valued in groupoids/stacks, and the descent of Stage 4 is stack descent, not set-level gluing. This does not change the composite status but it is the correct level of generality and we flag it.
3.5 Stage 5 — the terminal ladder: from measurement to geometry
The coarse arrow of [eq:pipeline] is the one place the program is most tempted to overclaim, precisely because in the diagram it looks atomic: “observables, then geometry.” It is not atomic, and treating it as a single arrow is the error this revision corrects. Measurement does not produce spacetime. A measurement produces, at most, structured relational data: which effects occur with which probabilities in which contexts, which observables commute, how the modular flow of a state acts, and what the entanglement and relative-entropy data are. Spacetime — a set with a causal order, a topology, a conformal class, a Lorentzian metric, and Einstein dynamics — must be reconstructed from that relational data through the chain of intermediate pregeometric layers displayed in [eq:ladder], and each link is a separate, theorem-shaped obligation. We restate the program’s central gap as the arrow chain The condensed contribution is concentrated on the left: assembling continuum-like objects from finite/profinite probes, and extracting the compatibility/cohomology/modular data that feeds reconstruction. The reconstruction itself — the right of the chain — is licensed, rung by rung, only by the established theorems cited below; where no such theorem exists, the rung is [SPEC], and “measurements glue, therefore geometry” is explicitly not a proof. We now walk the ladder. For each rung we name the mechanism, the established anchor that makes it theorem-shaped (never a slogan), the honest status, and what a proof of the background-free, condensed version would require.
3.5.0.1 Rung 1 — observables to measurement pairings ([HEU]).
The observable (co)sheaf of Stage 4 is paired with states, effects, and instruments in the sense of operational quantum theory and generalized probabilistic theories (GPT): a state and an effect produce a probability , an instrument records post-measurement update. The pairing itself is an [EST] bilinear evaluation. What is [HEU] is that these operational primitives are complete and prior to geometry. What a proof would require: an operational reconstruction/tomography theorem in the condensed setting, showing the pairings determine the state/effect spaces without presupposed spacetime labels on the outcomes.
3.5.0.2 Rung 2 — pairings to compatibility / descent data ([HEU]).
From the pairings one reads which measurements are jointly performable (the quantum marginal problem) and whether local observational data glue (descent). The [EST] substrate here is genuine: the finite descent obstruction (4, 1) is a real cohomological invariant, and the marginal problem is a rigorously posed compatibility question. What is [HEU] is that this compatibility data is the physically correct pregeometric input. What a proof would require: a theorem that the condensed descent obstruction computes joint-measurability / marginal-compatibility in the infinite (non-finite-graph) setting.
3.5.0.3 Rung 3 — compatibility to relational structure ([HEU]).
From the compatibility data one extracts the relational invariants: correlations; the commutation/noncommutation lattice; context inclusion and Kochen–Specker contextuality; the modular flow of a faithful normal state ; and entanglement / relative-entropy data. Each is a canonically defined algebraic invariant — the modular automorphism group is uniquely determined by on a von Neumann algebra (Tomita–Takesaki ), and Araki’s relative entropy is well-defined — so the extraction has a large [EST] substrate. What is [HEU] is that the totality of this relational data is the right pregeometric primitive. What a proof would require: a condensed “relational structure” functor with a theorem that it is well-defined and faithful on the relevant class of states. We stress that this relational data manifests its physical richness only in the infinite-dimensional, Type III von Neumann setting, where the modular flow is non-trivial and genuinely thermal/temporal (the very regime of Bisognano–Wichmann and the thermal-time hypothesis); on the finite closures of 5 the algebra is Type I and the modular flow is inner and geometrically inert. This is one precise reason the passage to the infinite/continuum limit is physically necessary for the pregeometric data to yield relativistic causal structure, and hence why the finite closure theorem realizes only the algebrametric leg (Rung 6) and not Rungs 4–5.
3.5.0.4 Rung 4 — relational to causal / order structure ([SPEC]; [EST] anchor: Bisognano–Wichmann).
This is the first genuinely pregeometric-to-geometric rung, and it has a sharp established anchor. The Bisognano–Wichmann theorem states that, for a Wightman/AQFT vacuum, the Tomita–Takesaki modular flow of the algebra of a Rindler wedge is the geometric one-parameter group of Lorentz boosts preserving that wedge, and the modular conjugation implements the /wedge reflection. Thus modular flow determines a piece of causal geometry — a boost, hence a wedge, hence a causal order — and this is a theorem, [EST] in its setting; the Connes–Rovelli thermal-time hypothesis extends it into a [HEU] program for reading a canonical time off a state. What is [SPEC] is recovering a full causal order from relational/modular data without presupposing the vacuum and its background wedge structure. What a proof would require: a modular-covariance / Bisognano–Wichmann analogue in the condensed, background-free setting, deriving a causal order from modular data alone.
3.5.0.5 Rung 5 — causal order to topology ([SPEC]; [EST] anchor: Malament).
Given a causal order, topology is nearly forced. Malament’s theorem : for a distinguishing spacetime (e.g. globally hyperbolic), the chronological/causal order determines the manifold topology, the smooth structure, and the conformal class of the metric — everything but a conformal (volume) factor. So “order topology” is a theorem, [EST] in the direction of determination. In the discrete/reconstructive direction, causal-set theory takes a locally finite partial order and reconstructs a Lorentzian geometry in the continuum limit — [EST] in controlled cases (faithful sprinklings) and a genuine discrete-to-continuum precedent. What is [SPEC] is that the causal order our pipeline extracts (from condensed relational data) is of the type these theorems require, and that its continuum limit exists. What a proof would require: a theorem that the extracted is (asymptotically) a distinguishing causal order / faithfully embeddable causal set, so that Malament or causal-set reconstruction applies.
3.5.0.6 Rung 6 — topology to metric ([SPEC]; [EST] anchors: Malament conformal class, causal-set volume, Connes spectral distance).
By Malament the metric splits into a conformal class (fixed by the causal order, [EST]) and a volume/scale factor. The scale is supplied, in causal-set theory, by counting: spacetime volume number of elements (order number geometry), [EST] in controlled cases . Independently, the Riemannian “algebra metric” leg is realized by Connes’ spectral distance (3; Part V), which is [EST] but Riemannian. Assembling a conformal class, a volume, and a spectral distance into a single Lorentzian metric is Part V’s frontier L (Riemannian Lorentzian) and is [SPEC]. What a proof would require: a Lorentzian spectral-triple / conformal-plus-volume reconstruction theorem, of which none currently exists.
3.5.0.7 Rung 7 — metric to dynamics / Einstein limit ([SPEC]; [EST] templates: spectral action, Jacobson, Regge).
Finally, dynamics: that the reconstructed geometry obeys (a limit of) the Einstein equations. The nearest established templates are the Chamseddine–Connes spectral action , from which an Einstein–Hilbert term falls out asymptotically; Jacobson’s thermodynamic derivation of the Einstein equation as an equation of state from the Clausius relation and horizon entropy ; and the Regge / large-spin limit. These are templates for how Einstein dynamics can emerge from an algebraic / spectral / thermodynamic principle, not instances of this pipeline’s claim, which is [SPEC]. What a proof would require: a derivation that extremizing or varying the condensed gluing data reproduces an Einstein-equation limit.
Remark 3 (Where the blocking work now lives). The de-compression localizes the difficulty. Rungs 1–3 (measurement relational) are [HEU] with a large [EST] substrate, and are exactly where the condensed contribution is real: assembling continuum-like relational data from finite/profinite probes and extracting its compatibility/cohomology/modular content. Rungs 4–7 (relational causal topology metric dynamics) are each [SPEC], but each is now attached to a specific established reconstruction theorem — Bisognano–Wichmann, Malament, causal sets, Connes, the spectral action — that says precisely what a background-free, condensed analogue would have to prove. The gap is no longer a single magic arrow “observables spacetime”; it is four honestly-labeled reconstruction problems, each with a named [EST] precedent and a stated obligation. In particular the two independent Part V frontiers survive intact and are now placed: the absence of a condensed Tannakian reconstruction (frontier C) obstructs Rungs 3–4, and Riemannian Lorentzian (frontier L) obstructs Rung 6. By 1 the composite remains [SPEC].
4 The framework as a specialization of established anchors
A synthesis is only as credible as its relationship to known mathematics. We position five established areas, each as an anchor the framework specializes or uses — never as evidence for the speculative goals. In each case we state the anchor precisely, say what the pipeline borrows, and name what the pipeline does not get for free.
4.1 Algebraic quantum field theory
Definition 5 (Haag–Kastler net; locally covariant QFT). A Haag–Kastler net assigns to each bounded region a unital -algebra with isotony () and Einstein causality ( for spacelike-separated regions). A locally covariant QFT is a functor from globally hyperbolic spacetimes and causal isometric embeddings to -algebras satisfying isotony and causality functorially. [EST]
What the pipeline uses. Stage 4 (observables, Part II) is a condensed refinement of the net: becomes for a condensed test object, and isotony/causality become sheaf/cosheaf descent and a microcausality compatibility condition. Local covariance — background independence at the level of which spacetime one works over — is the established precedent for building observables before fixing geometry. What it does not get. AQFT presumes a globally hyperbolic Lorentzian background per object; the condensed refinement aspires to drop even that, which no theorem yet licenses. So AQFT anchors Stage 4 as [EST] and bounds exactly how much of the geometry-free ambition is already underwritten (none of the Lorentzian part).
4.2 Topological quantum field theory and the cobordism hypothesis
Theorem 2 (Cobordism hypothesis; Baez–Dolan, Lurie ). Fully extended TQFTs valued in a symmetric monoidal -category with duals are classified by fully dualizable objects, via . [EST] (cited, not reproduced)
What the pipeline uses. The cobordism hypothesis is the first fully rigorous instance of “physics as a functor”: a field theory is a monoidal functor, rigidly reconstructible from minimal data. Our pipeline [eq:pipeline] is, structurally, a chain of functors, and Part V’s realization functor is modeled on “ determined by ”. What it does not get. TQFT is topological — no metric, no local dynamics. It licenses the functorial form of the pipeline but says nothing about recovering a metric, let alone the Einstein dynamics; using it as an anchor is a statement about shape, not content.
4.3 Homotopy type theory and univalence
Principle 1 (Univalence as the Equivalence axiom ). Voevodsky’s univalence axiom makes equivalent structures internally indistinguishable, discharging the program’s Equivalence axiom: a realization functor cannot depend on more than the equivalence class of its input. The distinction between the groupoid quotient (a -type, retaining stabilizers) and the set quotient (a -type) is the type-theoretic form of 2. [EST] as mathematics.
What the pipeline uses. HoTT supplies the internal justification that our constructions are invariant under equivalence and that gauge/automorphism data must be retained (the vs. distinction). What it does not get, and a non-identification. Condensed mathematics is an external, analytic theory (sheaves on profinite sets); cohesive HoTT is an internal, synthetic theory (modal type theory). They aim near the same target but are technically distinct, and we do not conflate them (8.3).
4.4 Derived algebraic geometry
Proposition 3 (Derived and spectral geometry ). Stable -categories and their -structures (Lurie), derived/spectral schemes locally modeled on -rings, and PTVV shifted symplectic structures (the derived critical locus of a function carries a canonical -shifted symplectic structure, recovering the BV antibracket) are established . [EST]
What the pipeline uses. Stage 2 lives in a stable -category; the passage to condensed derived algebraic geometry (animated condensed rings, ) is the natural home for combining Parts III–V. Derived critical loci are the established template for the classical field theory Part IV re-expresses. What it does not get. A worked-out “condensed derived algebraic geometry for Lorentzian physics” does not exist in the literature; DAG anchors the homological stage and no more.
4.5 Higher category theory and -topoi
What the pipeline uses. The condensed -topos of condensed anima is the ambient -category in which every stage lives, and -topos descent is the correct form of the gluing that Stage 4 requires. The recent constructions of the condensed homotopy type of a scheme and shape theory for condensed anima indicate the machinery is being actively developed. What it does not get. These are arithmetic/geometric developments; their application to physical (Lorentzian, dynamical) settings is exactly the program’s [SPEC] frontier.
| Anchor | What the pipeline borrows ([EST]) | What it does not get |
|---|---|---|
| AQFT | observables-before-geometry; isotony/causality; local covariance | Lorentzian background is still presumed per object |
| TQFT | the functorial form “physics is a functor”; rigidity from a point | no metric, no local dynamics |
| HoTT | equivalence-invariance; retain automorphisms () | internal external; not cohesive HoTT |
| DAG | stable -cat. homological stage; -shifted symplectic | no condensed-derived Lorentzian geometry exists |
| -topoi | the ambient category; descent/gluing | physical application is the [SPEC] frontier |
5 A finite closure theorem for the pipeline
We now discharge the promise that the first arrows of [eq:pipeline] are genuinely [EST] by instantiating the entire pipeline on finite data and proving a closure theorem: the composite is a well-defined, descent-satisfying functor whose emergent distance is the finite Connes spectral distance of Part V. This is the “closure theorem” the program’s dossier calls for, at the finite level where every step is a genuine theorem. The physical interpretation of the output remains [SPEC]; the mathematics of the composite is [EST].
5.1 The finite condensed object
Definition 6 (Discrete condensed set of a finite set). Every finite set is a condensed set via the discrete embedding of 1; on profinite this is locally constant -valued functions. Finite sets thus sit inside as the discrete objects, and any finite diagram of finite sets is a finite diagram of condensed sets. [EST]
Definition 7 (Finite weighted graph as pipeline input). Let be a finite connected-or-not graph: a finite vertex set , a finite edge set , and a weight . We regard the vertex set as the discrete condensed object , and the edge set as a distinguished finite cover datum: the nerve has -simplices and -simplices . Write for the category of finite weighted graphs and weight-nonincreasing simplicial maps.
5.2 The derived invariant
The Stage-2 arrow applied to the nerve produces its simplicial chain complex; dually, the constant-sheaf Čech complex of the cover computes cohomology. For a graph (a -dimensional simplicial complex) this is elementary and complete. Strictly, the explicit two-term complex written below is the simplicial cochain complex of ; it computes Čech cohomology precisely because it coincides with the Čech complex of the open cover of by the open stars of the vertices, whose nerve is itself. We use “Čech” and “simplicial” interchangeably in this finite setting, with this identification understood.
Proposition 4 (Čech cohomology of the graph nerve). Let be an abelian group and the constant sheaf on . The Čech complex is with (fixing an orientation on each edge). Then where is the set of connected components and the first Betti (cyclomatic) number. [EST]
Proof. consists of functions constant on each connected component, so . The complex has Euler characteristic (for a field, or ranks for on the free parts), and , whence . The identification is the standard computation of the first cohomology of a graph, i.e. of the cycle space of . The coefficient group enters only trivially: a graph is a -dimensional CW complex with free, torsion-free integral (co)homology , so the universal coefficient theorem gives for every abelian group , with no restriction to fields; the Euler-characteristic count above is simply the quickest route to . ◻
Thus the derived invariant of the finite pipeline reads off the topology of : counts components (the “superselection sectors” of the toy) and counts independent loops (the “obstruction to global gluing of locally constant observables”). This is the finite, rigorous shadow of Part III’s “information as cohomology”.
5.3 Descent for the observable sheaf
Definition 8 (Finite observable sheaf). For the finite site of (subsets, with covers = finite jointly-surjective families), let be the -valued functions on , with restriction the usual restriction of functions. This is the finite shadow of Part II’s condensed observable sheaf.
Lemma 1 (Finite descent). is a sheaf on the finite site of : for every cover of , the sequence is an equalizer. [EST]
Proof. A family with agreeing on overlaps, , defines a well-defined function by for any with (such exists since covers ; the value is independent of the choice by the overlap condition). Then , and is the unique such function since a function is determined by its values. Hence the map is a bijection, i.e. the sequence is an equalizer. ◻
1 is deliberately elementary; its role is to make Part II’s descent claim a proved statement at the finite level, so that Stage 4’s [EST] mathematical substrate is not merely asserted. The passage to genuinely condensed test objects (extremally disconnected profinite sets, where local constancy is nontrivial) is where the real work of Part II lies; the finite case is its skeleton.
5.4 State, observable, and emergent distance
From here on we specialize the coefficient group to (or ), so that the observable algebra is a commutative -algebra, is a genuine (finite-dimensional) Hilbert space, and the spectral triple and the norms and suprema of 3 are strictly well-defined. The cohomology computation of 4 is unaffected by this specialization (it holds for every ).
Definition 9 (State and emergent distance). A state on is the datum of the positive edge weights , read as a length metric on the nerve. The Stage-5 arrow assigns to the path metric with if lie in different components. This is the emergent geometry .
Theorem 3 (Path metric finite Connes spectral distance). Let be the finite spectral triple of the weighted graph of Part V, with acting diagonally on and off-diagonal with respect to this grading: maps (and by self-adjointness) via the weighted incidence operator with entries . Consequently, for the commutator is again off-diagonal with edge entries , which is what isolates the weighted edge differences below. Then for all , [EST] (Part V, via finite Kantorovich–Rubinstein duality.)
Proof sketch. The commutator norm equals , so the constraint is exactly for every edge, i.e. is -Lipschitz for the path metric. The supremum of over -Lipschitz is by the Kantorovich–Rubinstein duality (the discrete Monge–Kantorovich theorem): the extremal is . This is the finite instance proved in full in Part V , whose code we reuse. ◻
5.5 The closure theorem
Theorem 4 (Finite pipeline closure). The assignment is a well-defined functor to (extended) metric spaces, and it satisfies the following, all [EST]:
(descent) the Stage-4 observable presheaf is a sheaf on the finite site of (1);
(derived invariant) the Stage-2 invariant is , (4); in particular the number of superselection sectors and independent gluing obstructions of the toy are computed by the derived stage;
(emergent metric) the Stage-5 output equals the finite Connes spectral distance, (3);
(functoriality/monotonicity) a weight-nonincreasing simplicial map induces a distance-nonincreasing map and a map on .
Consequently the finite pipeline is a genuine composite of established constructions, and its composite mathematical status is [EST]. Its composite physical status — the reading of as an emergent spacetime — is [SPEC], by 1.
Proof. Well-definedness and functoriality: Stage 1 is the fully faithful discrete embedding (6); Stage 2 is the constant-sheaf Čech functor, natural in simplicial maps; Stages 3–4 record the positive weight and pair it against ; Stage 5 is the path-metric functor, which is functorial on weight-nonincreasing maps because such a map cannot lengthen a shortest path (each edge image has weight its preimage, so ). Claims (a), (b), (c) are 1, 4, 3 respectively. Claim (d) is the functoriality just established for the metric together with functoriality of Čech cohomology. Each ingredient is a theorem, so by 1(vii) the composite mathematical status is . The physical reading of the output attaches the [SPEC] label of the Stage-5 physical arrow (3.5), and . ◻
Remark 4 (What the closure theorem does and does not vindicate). 4 shows the pipeline is not vaporware: on finite data it is a completely rigorous chain of functors, computed by the accompanying code. It vindicates the form of [eq:pipeline] and the [EST] status of its first two arrows. Located on the terminal ladder [eq:ladder], it realizes only the algebrametric leg (Rung 6, the Riemannian Connes distance) on an input whose causal order is trivial: it does not touch Rungs 4–5 (relational causal topology, where the Bisognano–Wichmann and Malament analogues would be needed) or Rung 7 (dynamics). It does not vindicate any physical claim: the input is a finite graph, not a quantum-gravitational state; the output is a finite Riemannian metric space, not a Lorentzian spacetime; the derived invariant is graph topology, not physical entanglement. The theorem is the honest maximal EST payload of a synthesis whose headline remains [SPEC].
6 The three speculative goals, dissected
We now confront the program’s three headline aspirations. For each we give a boxed [SPEC] hypothesis, separate the [EST]/[HEU]/[SPEC] layers, and state what a proof would require and what currently blocks it. This section contains no theorems about physics; its purpose is to make the speculation precise and its cost explicit.
6.1 Goal A — classical spacetime as a limiting case
There is a filtered/completion procedure on condensed-representation data such that, in an appropriate regime, the emergent geometry of [eq:pipeline] — assembled through the reconstruction ladder [eq:ladder] — converges to a smooth Lorentzian manifold satisfying (to leading order) the Einstein field equations.
[EST] layer. Semiclassical/limit constructions do recover geometry in specific established settings: the large-spin (Regge) limit of spin-network/spin-foam amplitudes; Connes’ spectral reconstruction recovering a Riemannian spin manifold from a spectral triple ; the thermodynamic/GNS limit of operator algebras. These are theorems in their own settings.
[HEU] layer. That the condensed pipeline admits an analogous limit — a filtered colimit of finite condensed objects (like 4’s graphs) whose emergent path metrics converge, in a Gromov–Hausdorff-type sense, to a smooth metric — is a plausible heuristic supported by the finite closure theorem (finite metric spaces do converge to manifolds in known examples).
[SPEC] layer. That such a limit yields a Lorentzian manifold obeying Einstein’s equations is speculative and inherits the RiemannianLorentzian gap.
How it factors through the ladder [eq:ladder]. Goal A is exactly the demand that Rungs 5–7 (causal topology metric dynamics) admit a continuum limit: a cofiltered system of finite causal orders whose Malament topologies and causal-set volumes converge to a smooth Lorentzian metric obeying an Einstein limit. It is not a single-step claim, and its cost is distributed across those rungs.
What a proof would require. (i) A precise limiting system: a cofiltered diagram of condensed objects and a topology in which emergent distances converge; (ii) a convergence theorem to a smooth (pseudo-)metric (Rung 6); (iii) a Lorentzian upgrade recovering signature and causal structure (Rungs 4–6, Part V frontier L), for which not even a Riemannian condensed reconstruction theorem (frontier C) yet exists; (iv) an Einstein-limit derivation (Rung 7). Composite status of Goal A: [SPEC].
6.2 Goal B — locality as a derived compatibility condition
Microcausality/locality is equivalent to the vanishing of a compatibility (cocycle) class in condensed cohomology: local observable data glue to a global observable iff a derived obstruction vanishes, and this cohomological condition reproduces Einstein causality in the appropriate limit.
[EST] layer. Einstein causality for spacelike separation is an axiom of AQFT , and functorial local covariance is established. The vanishing of a Čech obstruction class as the exact condition for local-to-global gluing is a theorem (4, 1): in the finite toy, locally constant observables glue globally iff the relevant class in vanishes.
[HEU] layer. Reading microcausality itself — a Lorentzian, causal statement — as such a derived compatibility condition is a heuristic dictionary entry: it is structurally natural (both are “compatibility of local data”) but not a theorem.
[SPEC] layer. That all of relativistic locality, including causal order, is captured by a condensed-cohomological vanishing condition without a background metric is speculative.
How it factors through the ladder [eq:ladder]. Goal B lives at the seam between Rungs 2–3 (compatibility/descent relational, its [EST]/[HEU] substrate) and Rung 4 (relational causal/order, its [SPEC] content). The vanishing of is a genuine compatibility statement at Rungs 2–3; upgrading it to microcausality, a causal statement, is precisely the Rung 4 step (relational causal), where Bisognano–Wichmann is the only anchor and supplies it only in the vacuum. The goal must not be read as skipping from Rung 2 straight to a causal conclusion.
What a proof would require. (i) A condensed-cohomological definition of a “causal compatibility class” attached to a pair of condensed regions; (ii) a theorem that its vanishing is equivalent to spacelike commutativity in the AQFT limit; (iii) a background-free formulation in which causal order is itself derived, not presumed — i.e. a discharge of Rung 4. Step (iii) is blocked by the absence of any condensed Lorentzian/causal structure. Composite status of Goal B: [SPEC] (with an unusually large [EST] substrate — the gluing mathematics of Rungs 2–3 — which must not be mistaken for the causal claim of Rung 4).
6.3 Goal C — gravity from the gluing of informational structures
Gravity is not a fundamental metric field but the large-scale manifestation of how condensed informational structures glue: the emergent metric is determined by entanglement/compatibility data (a condensed-cohomological refinement of the Ryu–Takayanagi relation and of EREPR), and Einstein dynamics is the statement that this gluing is consistent.
[EST] layer. Within AdS/CFT and its toy models the mathematics is genuine: the Ryu–Takayanagi formula holds in its stated setting, as does its quantum (Faulkner–Lewkowycz–Maldacena) bulk-entropy correction and the quantum-extremal-surface refinement ; the HaPPY code and entanglement-wedge reconstruction are rigorous toy-model theorems realizing “bulk operator equivalence class of boundary representatives”; the surface-code logical-operator theorem is a rigorous instance of “cohomology protects information”. The finite gluing obstruction of 4 is a real invariant.
[HEU] layer. Van Raamsdonk’s “entanglement builds spacetime” and the EREPR correspondence are established as organizing heuristics, not as general theorems.
[SPEC] layer. That gravity in general — beyond AdS/CFT, in Lorentzian signature, with Einstein dynamics — emerges from the gluing of condensed informational structures is the central speculative hypothesis of the entire program. Per §7.4 of the program’s knowledge base, this is doubly speculative: it composes Part III’s [SPEC] “entanglement as condensed-sheaf compatibility” with Part VI’s [SPEC] “gravity from gluing”, and by 1 it gains no credibility from being stated in two Parts.
How it factors through the ladder [eq:ladder]. Goal C is the demand that the entire lower ladder close: the gluing/compatibility data (Rungs 2–3) must feed a causal reconstruction (Rung 4), a Malament topology (Rung 5), a conformal-plus-volume Lorentzian metric (Rung 6), and an Einstein-limit dynamics (Rung 7). The slogan “measurements glue, therefore geometry” is precisely the error of collapsing Rungs 4–7 into nothing; stated honestly, Goal C is the conjunction of the four [SPEC] reconstruction obligations of 3, and by absorption (1(iv)) it is [SPEC] as soon as any one of them is.
What a proof would require. (i) The condensed-cohomological definition of entanglement compatibility that Part III proposes but does not prove is the right invariant (Rungs 2–3); (ii) a causal / topological / conformal reconstruction discharging Rungs 4–6 (with Bisognano–Wichmann, Malament, and causal sets as the only anchors, none yet condensed or Lorentzian); (iii) a derivation that extremizing/varying the gluing data reproduces an Einstein-equation limit (Rung 7, the target of Part VII, with the Chamseddine–Connes spectral action , Jacobson’s equation of state , and the Regge limit as the nearest established templates for “how an Einstein–Hilbert term can fall out of an algebraic/spectral/thermodynamic principle” — templates, not instances of this claim); (iv) generality beyond holographic duality. Composite status of Goal C: [SPEC].
The genuine, defensible content of Goal C today is: there exist rigorous toy models (HaPPY, surface codes, RT within AdS/CFT) in which geometric/informational data are interchangeable, and there exists a well-behaved condensed homological framework in which a gluing-obstruction invariant is definable; whether these combine into a general, Lorentzian, dynamical theory of gravity is open and, at present, [SPEC].
7 Results
We summarize the paper’s deliverables, tagged by status.
Weakest-link theorem ([EST]). 1: is a bounded idempotent commutative monoid; composite status is the join of link statuses; SPEC is absorbing. 1: the assembled pipeline is [SPEC].
Assembled pipeline ([HEU] as a physical skeleton; [EST] as a diagram of functors). [eq:pipeline] and 1: an explicit functorial pipeline , each stage sourced to a Part, each arrow labeled.
De-compressed terminal ladder ([HEU]/[SPEC] per rung). [eq:ladder] and 3.5: the terminal arrow is replaced by the seven-rung pregeometric ladder , each rung labeled and anchored to an established reconstruction theorem (Bisognano–Wichmann, Malament, causal sets, Connes), with the blocking work localized in Rungs 4–7 (3).
Five established anchors positioned ([EST]). 4 and 1: AQFT, TQFT, HoTT, DAG, -topoi, each with a precise “borrows / does not get” ledger.
Finite closure theorem ([EST]). 4: the finite pipeline is a descent-satisfying functor with derived invariant and emergent distance , all code-backed.
Three speculative goals dissected ([SPEC]). 6: each of A (classical spacetime as a limit), B (locality as derived compatibility), C (gravity from gluing) is boxed, layered into [EST]/[HEU]/[SPEC], and equipped with a “what a proof would require” list.
A weakest-link status census ([SPEC] headline). 8.2: the composite status of the program’s headline is, honestly, [SPEC].
8 Discussion
8.1 What has and has not been shown
We have proved ([EST]): the weakest-link theorem (1) and the finite closure theorem (4), including its descent lemma (1), its cohomology computation (4), and its spectral-distance identity (3). We have organized ([EST]) five established anchors as structures the framework specializes. We have not shown, and explicitly do not claim: any recovery of a Lorentzian spacetime; any derivation of the Einstein equations; any condensed reconstruction theorem; or that gravity is entanglement. The gap between the [EST] results and the [SPEC] goals is no longer a single “final arrow”: it is the lower segment of the ladder [eq:ladder] — the relationalcausaltopologymetric dynamics rungs of 3.5 — together with the three frontiers of 6. The de-compression does not shrink the gap; it localizes it, and attaches each piece to a named established reconstruction theorem stating what a discharge would require.
8.2 The weakest-link status census
| Claim | Status |
|---|---|
| Claim | Status |
| Weakest-link theorem: idempotent monoid, SPEC absorbing (1) | [EST] |
| Faithful embedding (1) | [EST] |
| stable; solid/liquid subcategories (2) | [EST] |
| Finite descent for (1) | [EST] |
| Čech cohomology , (4) | [EST] |
| Path metric finite Connes spectral distance (3) | [EST] |
| Finite pipeline closure functor (4) | [EST] |
| AQFT / TQFT / HoTT / DAG / -topos anchors (4) | [EST] |
| Ladder anchors: Bisognano–Wichmann (modular flow boost, vacuum) | [EST] |
| Ladder anchors: Malament (causal order fixes topology conformal metric) | [EST] |
| Ladder anchors: causal sets (order counting Lorentzian, controlled cases) | [EST] |
| The assembled pipeline is the correct skeleton for quantum gravity | [HEU] |
| Rungs 1–3: measurement pairings compatibility relational (3.5) | [HEU] |
| Microcausality reads as a derived compatibility condition (Goal B; Rung 2–3) | [HEU] |
| Rung 4: relational causal order, background-free (beyond BW vacuum) | [SPEC] |
| Rung 5: causal order topology for the extracted order (beyond Malament) | [SPEC] |
| Rung 6: topology Lorentzian metric (conformal [EST]; signature frontier L) | [SPEC] |
| Rung 7: metric Einstein-limit dynamics (spectral action / Jacobson templates) | [SPEC] |
| Classical Lorentzian spacetime as a limit of the pipeline (Goal A; Rungs 5–7) | [SPEC] |
| Locality/causal order fully captured background-free (Goal B; Rung 4) | [SPEC] |
| Gravity from gluing of condensed informational structures (Goal C; Rungs 4–7) | [SPEC] |
| Composite: the program’s headline quantum-gravity claim | [SPEC] |
The last row is forced by 1(vii): the join of the column is SPEC, attained across the [SPEC] rungs of the terminal ladder (Rungs 4–7) rather than at any single “magic arrow”. No quantity of [EST] rows — including the newly itemized ladder anchors, which are genuinely established reconstruction theorems — can change it, because each of those anchors licenses only its own classical, background-endowed setting and not the condensed, background-free rung the pipeline needs. That is the intended and correct outcome: the de-compression makes the blocking work explicit and localized without upgrading a single intermediate step.
8.3 Relations and non-identifications
We reiterate the non-identifications the synthesis must respect :
Condensed mathematics (external/analytic, sheaves on profinite sets) is not cohesive HoTT (internal/synthetic modal type theory) , nor topos quantum theory (presheaves on a context category of commutative subalgebras for quantum logic) . All three use sheaf/topos technology to different ends; the pipeline’s realization arrow is external/analytic.
Connes’ Riemannian, static spectral reconstruction is not a Lorentzian, dynamical reconstruction (open); the synthesis carries this caveat forward from Part V without upgrade.
The ladder’s geometric anchors are theorems about geometry already given: Malament presupposes a distinguishing spacetime, Bisognano–Wichmann presupposes a Wightman vacuum on Minkowski space, and causal-set reconstruction presupposes a faithful sprinkling. They are not background-free, condensed reconstructions; the ladder cites them as [EST] precedents that state what Rungs 4–6 would have to prove, never as licenses that those rungs are already discharged.
The RT formula / EREPR “entanglement builds geometry” is native to AdS/CFT and is not an established general mechanism; Goal C must not present it as one.
Classical Tannakian reconstruction (proved) is not a condensed Tannakian reconstruction (conjectural); Part V’s frontier C is inherited here unchanged.
8.4 Limitations
The limitations are structural. (i) Every computable/proved result is finite-dimensional or finite-graph; the passage to genuinely infinite condensed objects, where solidity/liquidity and resolvent-compactness do real work, is untouched by our theorems. (ii) The Lorentzian frontier is untouched by any established result we cite; our contribution there is limited to stating the gap and placing it on Rung 6 of the ladder. (iii) The pipeline is a diagram of functors whose physical interpretation is [SPEC] along the lower ladder segment (Rungs 4–7); the finite closure theorem vindicates the form, and only the Riemannian algebrametric leg (Rung 6), not the physics. (iv) The composite headline claim inherits [SPEC] status from its weakest link and must not borrow credibility from the genuinely rigorous finite/homological mathematics that surrounds it — the entire point of 2 is to make this borrowing arithmetically impossible.
8.5 Outlook: hand-off to Part VII
Part VII is the capstone: it presents the boxed hierarchy A correction this Part carries into the capstone: the last arrow there, Measurement Emergent Spacetime, must not be read as a single [SPEC] step. It is the reconstruction ladder [eq:ladder], Measurement relational causal topology metric dynamics, whose upper rungs are [HEU] and whose lower rungs (Rungs 4–7) are [SPEC], each with a named [EST] anchor. Part VI hands Part VII four things: the weakest-link theorem as the formal device that keeps the hierarchy honest; the finite closure theorem as the maximal EST payload realized end-to-end; the de-compressed ladder that localizes the blocking work; and the dissected goals A/B/C as the concrete open problems. The most valuable next steps are not physical but mathematical, and the ladder pinpoints them: (a) prove or refute a Riemannian condensed reconstruction theorem (Part V frontier C), which gates Rungs 3–4 and Rung 6; and (b) prove or refute a condensed, background-free Bisognano–Wichmann / Malament analogue deriving a causal order from modular data (Rungs 4–5), which gates Goals A, B, and C without yet requiring the Lorentzian frontier.
9 Conclusion
This synthesis assembled five modular interfaces — condensed kinematics (Part I), condensed observables (Part II), condensed cohomology of information (Part III), condensed fields (Part IV), and geometry as a realization functor (Part V) — into one explicit pipeline, and asked whether gravity can be understood as the gluing of informational structures rather than as a fundamental metric — while insisting that the terminal step “Observables Emergent Geometry” is not atomic but the pregeometric reconstruction ladder [eq:ladder]. Our two established deliverables are a theorem and a theorem: the weakest-link theorem, which makes “a chain is only as established as its weakest link” a proved property of a bounded idempotent monoid; and a finite closure theorem, which realizes the entire pipeline on finite data as a descent-satisfying functor whose derived invariant is graph cohomology and whose emergent distance is the finite Connes spectral distance. Everything else — the recovery of classical spacetime, locality as a derived compatibility condition, gravity from gluing — is [SPEC], boxed, layered, and equipped with an explicit “what a proof would require”.
The value of the synthesis is not that it solves quantum gravity; it does not. Its value is that it converts a suggestive vocabulary into a definite diagram with definite status labels, and — crucially — refuses the compression of “observables, then spacetime” into a single arrow. It isolates the exact terminal segment (the reconstruction ladder [eq:ladder]: relational causal topology metric dynamics) at which established mathematics ends and this program’s physics begins, attaches each of its rungs to a named established reconstruction theorem (Bisognano–Wichmann, Malament, causal sets, Connes), and — through the status calculus — makes it arithmetically impossible to launder the speculation into rigor. “Measurements glue, therefore geometry” is, and is here shown to be, not a proof but a program with four localized, theorem-shaped obligations. The program’s headline is honestly [SPEC]; its ingredients are honestly [EST]; and the discipline that keeps those two facts from being confused is itself the paper’s first theorem.
10 The accompanying code
The repository directory src/part6-condensed-quantum-gravity/ contains a self-contained Haskell package (compiling under -Wall) realizing the finite, decidable content of this Part:
Status.hs— the warrant type , status composition , the pipeline-status combinator of 3, and exhaustive verification of the monoid laws of 1 (associativity, commutativity, identity, absorption, idempotence, monotonicity) by checking all cases.Pipeline.hs— a finite weighted graph as a discrete condensed object; the Čech differential and the ranks , of 4; the observable sheaf and a descent (gluing) check for 1; and the intermediate rungs of the terminal ladder [eq:ladder] exposed explicitly —relationalStructure(adjacency obstruction ),causalLayers(a breadth-first causal order, the finite analogue of Malament’s “order fixes topology”), andopenStars(the topology as the open-star cover whose nerve recovers the graph) — so the toy walks relational causal topology metric rather than jumping observables distance; the path metric (Floyd–Warshall) is the emergent distance of 9.Spectral.hs— the finite Connes spectral distance as the associated -Lipschitz linear program, and a check verifying 3 on explicit graphs.Main.hs— drives all demonstrations, including a de-compressed pass over the ladder rungs (relational causal topology metric); prints the composed pipeline status (), the derived invariant of a sample graph, the descent check, and the agreement ; it thereby executes 4 end-to-end on a concrete example.
The code is a finite shadow of the paper’s established content (1, 4); it does not, and cannot, address the Lorentzian/dynamical frontiers, which are infinite-dimensional and Lorentzian respectively and remain [SPEC].
99
M. Long and The YonedaAI Collaboration, From Manifolds to Condensed Spaces, Part I of Toward a Condensed Representation Theory of Physics, YonedaAI Research Collective, 2026.
M. Long and The YonedaAI Collaboration, Observables as Condensed Sheaves, Part II of Toward a Condensed Representation Theory of Physics, YonedaAI Research Collective, 2026.
M. Long and The YonedaAI Collaboration, Information as the Primitive Object: Condensed Cohomology and Quantum Information, Part III of Toward a Condensed Representation Theory of Physics, YonedaAI Research Collective, 2026.
M. Long and The YonedaAI Collaboration, Fields Without Background Manifolds, Part IV of Toward a Condensed Representation Theory of Physics, YonedaAI Research Collective, 2026.
M. Long and The YonedaAI Collaboration, Geometry as a Realization Functor, Part V of Toward a Condensed Representation Theory of Physics, YonedaAI Research Collective, 2026.
M. Long and The YonedaAI Collaboration, Toward a Condensed Representation Theory of Physics, Part VII (capstone) of the same series, YonedaAI Research Collective, 2026 (forthcoming).
P. Scholze, Lectures on Condensed Mathematics, Bonn lecture notes, 2019; stable version arXiv:2605.03658, 2026.
D. Clausen and P. Scholze, Analytic Stacks, lecture course, 2023 (CNRS/IHÉS); and Lectures on Analytic Geometry (Bonn, 2019–2020). See also P. Scholze, “Six-functor formalisms,” arXiv:2510.26269, 2025.
B. Bhatt and P. Scholze, “The pro-étale topology for schemes,” Astérisque 369 (2015), 99–201; arXiv:1309.1198.
Recent condensed-homotopy-theory developments: “Shape theory for condensed anima,” arXiv:2605.07843; “The condensed homotopy type of a scheme,” arXiv:2510.07443.
J. Lurie, Higher Topos Theory, Annals of Mathematics Studies 170, Princeton, 2009; and “On the classification of topological field theories,” Current Developments in Mathematics 2008, International Press, 2009, 129–280; arXiv:0905.0465.
M. Atiyah, “Topological quantum field theories,” Publ. Math. IHÉS 68 (1988), 175–186.
B. Toën and G. Vezzosi, “Homotopical algebraic geometry II: geometric stacks and applications,” Mem. Amer. Math. Soc. 193 (2008).
T. Pantev, B. Toën, M. Vaquié, and G. Vezzosi, “Shifted symplectic structures,” Publ. Math. IHÉS 117 (2013), 271–328; arXiv:1111.3209.
R. Haag, Local Quantum Physics: Fields, Particles, Algebras, 2nd ed., Springer, 1996.
R. Brunetti, K. Fredenhagen, and R. Verch, “The generally covariant locality principle,” Commun. Math. Phys. 237 (2003), 31–68; arXiv:math-ph/0112041.
K. Costello and O. Gwilliam, Factorization Algebras in Quantum Field Theory, Vols. 1–2, Cambridge University Press, 2016/2021.
O. Gwilliam and K. Rejzner, “Relating nets and factorization algebras of observables: free field theories,” Commun. Math. Phys. 373 (2020), 107–174; arXiv:1711.04645.
M. Takesaki, Theory of Operator Algebras I–III, Encyclopaedia of Mathematical Sciences, Springer, 2002–2003.
A. Connes, “On the spectral characterization of manifolds,” J. Noncommut. Geom. 7 (2013), 1–82; arXiv:0810.2088.
A. H. Chamseddine and A. Connes, “The spectral action principle,” Commun. Math. Phys. 186 (1997), 731–750; arXiv:hep-th/9606001.
D. B. Malament, “The class of continuous timelike curves determines the topology of spacetime,” J. Math. Phys. 18 (1977), 1399–1404.
L. Bombelli, J. Lee, D. Meyer, and R. D. Sorkin, “Space-time as a causal set,” Phys. Rev. Lett. 59 (1987), 521–524.
J. J. Bisognano and E. H. Wichmann, “On the duality condition for a Hermitian scalar field,” J. Math. Phys. 16 (1975), 985–1007; and “On the duality condition for quantum fields,” J. Math. Phys. 17 (1976), 303–321.
A. Connes and C. Rovelli, “Von Neumann algebra automorphisms and time-thermodynamics relation in generally covariant quantum theories,” Class. Quantum Grav. 11 (1994), 2899–2917; arXiv:gr-qc/9406019.
T. Jacobson, “Thermodynamics of spacetime: The Einstein equation of state,” Phys. Rev. Lett. 75 (1995), 1260–1263; arXiv:gr-qc/9504004.
S. Ryu and T. Takayanagi, “Holographic derivation of entanglement entropy from AdS/CFT,” Phys. Rev. Lett. 96 (2006), 181602; arXiv:hep-th/0603001.
T. Faulkner, A. Lewkowycz, and J. Maldacena, “Quantum corrections to holographic entanglement entropy,” JHEP 11 (2013), 074; arXiv:1307.2892; and N. Engelhardt and A. C. Wall, “Quantum extremal surfaces: holographic entanglement entropy beyond the classical regime,” JHEP 01 (2015), 073; arXiv:1408.3203.
M. Van Raamsdonk, “Building up spacetime with quantum entanglement,” Gen. Rel. Grav. 42 (2010), 2323–2329; arXiv:1005.3035.
J. Maldacena and L. Susskind, “Cool horizons for entangled black holes,” Fortsch. Phys. 61 (2013), 781–811; arXiv:1306.0533.
F. Pastawski, B. Yoshida, D. Harlow, and J. Preskill, “Holographic quantum error-correcting codes,” JHEP 06 (2015), 149; arXiv:1503.06237.
A. Almheiri, X. Dong, and D. Harlow, “Bulk locality and quantum error correction in AdS/CFT,” JHEP 04 (2015), 163; arXiv:1411.7041.
The Univalent Foundations Program, Homotopy Type Theory: Univalent Foundations of Mathematics, Institute for Advanced Study, 2013.
U. Schreiber, “Differential cohomology in a cohesive -topos,” arXiv:1310.7930, 2013.
C. J. Isham and A. Döring, “Topos theory and ‘neo-realist’ quantum theory,” arXiv:0712.4003, 2007.
The YonedaAI Collaboration, math-phy-library: 6-module representation-stack / sheaf / HoTT / TQFT ladder (internal prior work), 2026 (representation entries, prestacks/stacks, the theorem family; surface-code theorem).
The YonedaAI Collaboration, mathematics-physical-representation: 5-rung motivic/coalgebraic realization ladder (internal prior work), 2026.
The YonedaAI Collaboration, math-qg-representation-library: 12-topic representation-theoretic dossier on quantum gravity (internal prior work), 2026 (Connes reconstruction; Bisognano–Wichmann; RT/HaPPY; weakest-link composition discipline).