Many Boundary Representatives, One Bulk Operator: Tensor Networks, Operator-Algebra Quantum Error Correction, and the Holographic-Emergence Regime of a Reconstruction Program

1 Introduction

1.1 The reconstruction thesis, and this paper’s regime

The wider project this paper belongs to organizes itself around one sentence. Quantum gravity is not primarily the quantization of material objects in spacetime; it is the reconstruction of spacetime, matter, causality, and measurement from invariant representation structures. Read that way, a bulk spacetime is not a substrate one begins with and then quantizes. It is an output: the semiclassical shadow that a deeper representation—a spin network, an asymptotically safe renormalization-group trajectory, a celestial correlator, or, here, a tensor-network holographic code—must reproduce in an appropriate limit.

Among the twelve regimes of the program, the holographic-emergence regime is the one where the reconstruction thesis reaches its measurement clause most directly. In the classical-geometry regime one reconstructs a metric; in the spin-network regime one reconstructs spatial geometry from $SU(2)$ representation labels. Here the object reconstructed is not merely geometry but the very act of observing a bulk operator. A bulk observable is only ever accessed through a boundary measurement, and there is no canonical boundary measurement: there is a redundant family of them, one per boundary region whose entanglement wedge contains the bulk point. The invariant is the equivalence class, not any single representative. This is what the slogan “many boundary representatives, one logical bulk content” names, and quantum error correction is the mathematics that makes it exact.

The connection is due to Almheiri, Dong, and Harlow , who observed that the redundancy of the AdS/CFT map—a bulk operator deep in the interior has many inequivalent-looking boundary descriptions, and the boundary region needed to reconstruct it depends on where it sits—is exactly the redundancy of a quantum error-correcting code, in which a logical qubit is encoded nonlocally into physical qubits so that it survives erasure of a subset of them. Pastawski, Yoshida, Harlow, and Preskill then gave the phenomenon a solvable toy model: the HaPPY code, a tensor network of perfect tensors tiling the hyperbolic plane, which is an exact isometry, reproduces the Ryu–Takayanagi entropy formula in a discrete min-cut form, and has the negative tripartite information characteristic of holographic states. Harlow recast the whole package in the language of operator-algebra quantum error correction, proving that entanglement-wedge reconstruction, the Jafferis–Lewkowycz–Maldacena–Suh relative-entropy equality , and the Ryu–Takayanagi formula with an area operator are three faces of one code-theoretic structure.

1.2 What this paper does, and what it does not claim

This paper is a self-contained, epistemically honest account of the holographic emergence regime, written to sit inside the program’s modular library. It does three things.

First, it fixes the finite-dimensional mathematics precisely enough to prove the elementary statements in full and to state the deep ones without inflation. The elementary statements—that an isometric encoding whose complement is Knill–Laflamme correctable reconstructs its logical algebra on a region, that a perfect tensor gives operator pushing and one-sided recovery, that a tree tensor network computes a min-cut entropy—are genuinely standard mathematics, $\mathsf{S}$. The deep statements—that this is the correct dictionary for a general quantum-gravity bulk beyond the toy regime—are heuristic, $\mathsf{H}$, and we label them so.

Second, it works a concrete example: a single holographic pentagon (the $[[5,1,3]]$ perfect-tensor code) and a small patch, with the bulk logical operator pushed explicitly to boundary representatives, complementary recovery exhibited on two disjoint boundary regions, and a discrete Ryu–Takayanagi cut computed on a toy graph. Every claim in the example is checkable by hand, and the accompanying Haskell code checks it mechanically.

Third, it composes the regime with its neighbors under the program’s weakest-link status calculus, without ever asserting a monolithic unification. The sharpest such composition is with the BV–BRST gauge-redundancy regime: the toric/surface code’s identification of logical operators with $\mathop{\mathrm{H}}_1(\Sigma;\mathbb{Z}_2)$ classes is the one place in the whole library where “gauge redundancy equals logical redundancy” is a proved, status-$\mathsf{S}$ fact rather than a slogan, and we present it as the concrete testbed for the roadmap’s open problem 5.

We are explicit throughout about the gap between the toy models and real AdS/CFT, and about the entirely separate character of celestial/flat-space holography, which this regime must not be silently merged with.

1.3 The seed dictionary

Every paper in the program opens with the same translation table, the shared semantic contract between its regimes. [tab:dictionary] reproduces the four rows most relevant to this paper, each with its epistemic status. The two rows in the middle carry this paper’s own dictionary entries; the composite status of the regime is set by the weaker of them.

1.4 Notation and standing conventions

All Hilbert spaces are finite-dimensional over $\mathbb{C}$ unless stated otherwise; this is the honest home of the exact statements. We write $\mathcal{B}(\mathcal{H})$ for the bounded operators on $\mathcal{H}$ (all operators, in finite dimension), $\mathbbm{1}$ for the identity, $\operatorname{Tr}$ for the trace, and $A'$ for the commutant of a subalgebra $A\subseteq\mathcal{B}(\mathcal{H})$. A code is an isometry $V:\mathcal{H}_{\mathrm{code}}\to\mathcal{H}_{\mathrm{phys}}$, $V^{\dagger}V=\mathbbm{1}_{\mathcal{H}_{\mathrm{code}}}$, with code projector $P=VV^{\dagger}$ and code subspace $\mathcal{H}_C=\operatorname{im}V=P\mathcal{H}_{\mathrm{phys}}$. We call $\mathcal{H}_{\mathrm{code}}\cong\mathcal{H}_{\mathrm{bulk}}$ the bulk (logical) space and $\mathcal{H}_{\mathrm{phys}}\cong\mathcal{H}_{\mathrm{bdy}}$ the boundary (physical) space. A bipartition of the physical system into subsystems $A$ and its complement $A^c$ induces a factorization $\mathcal{H}_{\mathrm{phys}}\cong\mathcal{H}_A\otimes\mathcal{H}_{A^c}$ when $A$ is a set of physical qubits, and, more generally, a pair of commuting von Neumann subalgebras $(\mathcal{M}_A,\mathcal{M}_{A^c})$. The $n$-qubit Pauli group is $\mathsf{P}_n$; a stabilizer group $S\subseteq\mathsf{P}_n$ is abelian with $-\mathbbm{1}\notin S$. Section-level cross-references use 1-style labels. Epistemic tags [S], [H], [P] (and composites [S/H], [H/P]) annotate every labeled result.

2 The representation-stack core and the status calculus

Before the physics we recall the two structural devices the program reuses in every regime: the representation stack (which says physical content is a groupoid, not a set) and the S/H/P status calculus (which bounds how regimes compose). Both specialize cleanly to holographic codes.

2.1 The representation stack

A representation entry is a tuple $E=(M,P,\tau,\sigma)$: a mathematical object $M$, a physical target $P$, a translation datum $\tau$, and an epistemic status $\sigma\in\{\mathsf{S},\mathsf{H},\mathsf{P}\}$. A representation prestack is a pseudofunctor $\mathrm{Real}:\mathbf{Dom}^{\mathrm{op}}\to\mathbf{Gpd}$ into groupoids; it is a representation stack for a Grothendieck topology on $\mathbf{Dom}$ when compatible local entries glue to global entries uniquely up to coherent isomorphism. The content of “stack, not prestack” is that gluing is by equivalence, not equality, so automorphism data—gauge redundancy, stabilizers, code redundancy—is retained rather than erased. The single structural fact threading all twelve regimes of the program is:

Physical content is a groupoid (a stack), not a coarse quotient set: the automorphisms $\mathrm{Aut}_{[X/G]}(x)\cong\mathrm{Stab}_G(x)$ are part of the data.

In the holographic-code regime this fact appears as follows. The physical content of “a bulk operator” is not a single boundary operator (a point of a quotient set) but the groupoid whose objects are the boundary representatives $O_A$ and whose morphisms are the code’s logical-equivalence relations $O_A\sim O_{A'}$ whenever both regions’ wedges contain the bulk point. The redundancy—the many representatives—is exactly the automorphism data the stack retains. We make this precise in [sec:oaqec,sec:wedge].

2.2 The S/H/P status calculus

There are three ordered warrants $\mathsf{S}<\mathsf{H}<\mathsf{P}$: $\mathsf{S}$ is a standard mathematical or mathematical-physics correspondence, $\mathsf{H}$ a strong heuristic physical representation, and $\mathsf{P}$ a speculative ontological extension. A status is a nonempty set of warrants, displayed by its range ($\mathsf{S}/\mathsf{H}$, $\mathsf{H}/\mathsf{P}$), whose governing datum is its worst (largest) component.

This is the formal engine of 7. It is proved as a Lean4 stub in the program’s formalization layer and checked as an executable property in the Haskell code accompanying this paper (9). We stress its discipline: composing two $\mathsf{S}/\mathsf{H}$ regimes does not automatically yield $\mathsf{S}/\mathsf{H}$; one composes the specific claims used in the bridge, and the bridge may be weaker than either endpoint.

3 Codes, isometries, and correctability

We now build the regime’s mathematics from the ground up. Everything in this section is finite-dimensional and status-$\mathsf{S}$; it is the solid floor on which the heuristic bulk interpretation later stands.

3.1 Isometric encodings

The isometry condition $V^{\dagger}V=\mathbbm{1}$ says the encoding loses no logical information: distinct logical states map to distinguishable (orthonormal, if the inputs were) physical states. The complementary condition $VV^{\dagger}=P\ne\mathbbm{1}$ (unless $\dim\mathcal{H}_{\mathrm{code}}= \dim\mathcal{H}_{\mathrm{phys}}$) says the physical space is larger, and the extra room is what redundancy lives in. A bulk operator $\hat O$ has boundary representative $V\hat O V^{\dagger}$; the reconstruction problem is whether this global boundary operator is equal, on the code subspace, to an operator supported on a proper region.

The phrase “may differ arbitrarily off it” is the crux. Two boundary representatives $O_A$ and $O_{A'}$ of the same bulk operator on different regions need not be equal as physical operators; they are equal only after multiplication by $P$. This is precisely the equivalence relation of 2.1: the bulk operator is the class, the representatives are its objects.

3.2 The Knill–Laflamme conditions

The correctability of a code against a set of errors is governed by a single algebraic condition.

The physical reading of [eq:kl] is that no error in the set leaves any detectable, logical-state-dependent imprint on the code subspace: $P E_a^{\dagger}E_b P$ is a state-independent constant times $P$. In the holographic setting the errors of interest are all operators supported on the complementary region $A^c$; if those are correctable, the erasure of $A^c$ can be undone, which is the same as saying the logical information is reconstructable from $A$.

7 is the finite-dimensional skeleton of entanglement-wedge reconstruction. What upgrades it from “correctable complement” to “the wedge is exactly the reconstructible region” is the more refined operator-algebra statement of [sec:oaqec,sec:wedge]; the point of stating the skeleton first is that this part is entirely standard, provable in two paragraphs, and status-$\mathsf{S}$.

3.3 Stabilizer codes as a source of examples

Perfect tensors, the building blocks of the HaPPY code, are most easily produced as stabilizer states, so we recall the stabilizer formalism.

3.4 Perfect tensors and absolutely maximally entangled states

The operational content of 12 is the “operator pushing” rule that makes the HaPPY code computable: a bulk operator is dragged across perfect tensors one at a time, each time being replaced by an operator on the tensor’s other legs, until it lands on the boundary. We use exactly this in the worked example of 6.

4 Operator-algebra quantum error correction

Entanglement-wedge reconstruction is not a subsystem statement (“qubit $A$ carries the logical qubit”) but a subalgebra statement (“the algebra of the wedge is represented in the algebra of $A$”). The right language is operator-algebra quantum error correction, OAQEC, due to Bény–Kempf–Kribs and, in the holographic form, Harlow .

4.1 Correctable subalgebras

The block label $\alpha$ in [eq:comprec] is the eigenvalue of the area operator, an element of the center $\mathcal{Z}=\mathcal{A}_a\cap\mathcal{A}_{a^c}$. This is the exact finite-dimensional shadow of the statement that the Ryu–Takayanagi surface’s area is a superselected, classical quantity: it commutes with all wedge operators on both sides.

4.2 The reconstruction theorem

We now state the central theorem of the regime. We separate its parts by status.

4.3 Approximate recovery and the Petz map

Real holography is not an exact code. Relative entropies are only approximately preserved, and the clean equivalences of 16 become approximate. The tool that survives is a universal recovery channel.

The upshot is that “many boundary representatives, one bulk operator” is robust: one does not need the idealized exact code to have a well-defined reconstruction, a controlled approximate one suffices, and the control is quantitative.

5 Entanglement wedges and the Ryu–Takayanagi functional

We now connect the algebraic picture to geometry: which region is the “wedge,” and why the center element deserves to be called an area.

5.1 The Ryu–Takayanagi and HRT surfaces

The formula [eq:rt] is the Ryu–Takayanagi proposal , in the quantum-corrected Faulkner–Lewkowycz–Maldacena form for the bulk term and the covariant HRT form for time dependence. It is $\mathsf{H}$: derived in AdS/CFT under semiclassical assumptions, not proved as pure mathematics. Its importance here is structural. The additive split—area (a geometric, state-independent number, at leading order) plus bulk entropy (a genuinely quantum, state-dependent term)—is exactly the split [eq:jlms] of 16 between the center element $\hat{\mathcal A}_A$ and the bulk modular data. The holographic code makes this split exact and finite-dimensional.

5.2 Discrete Ryu–Takayanagi from a tensor network

On a tensor network the area term becomes a combinatorial minimal cut, and this part is provable.

22 is the honest, status-$\mathsf{S}$ core of the RT formula: on a tensor network the “area” is literally a minimal number of cut legs, and the entropy equals it for perfect-tensor networks. The map from this to the continuum $\mathrm{Area}(\gamma_A)/4G_N$ is the $\mathsf{H}$ dictionary; the discrete statement is a theorem.

5.3 The HaPPY code

6 Worked example: a holographic pentagon and a toy graph

We now compute, by hand, the three phenomena of the regime on the smallest nontrivial systems: operator pushing on one perfect tensor, complementary recovery on two disjoint boundary regions, and a discrete min-cut entropy on a toy graph. Everything here is finite-dimensional and status-$\mathsf{S}$; the accompanying Haskell program checks all of it mechanically.

6.1 Operator pushing across one pentagon

Take the $[[5,1,3]]$ code of 13 as a six-leg perfect tensor: one bulk leg $b$ and five boundary legs $1,2,3,4,5$. Its logical Pauli operators are $$\begin{equation} \bar X = X_1X_2X_3X_4X_5,\qquad \bar Z = Z_1Z_2Z_3Z_4Z_5, \end{equation}$$ and the stabilizer group is generated by the cyclic shifts of $g_1=X_1Z_2Z_3X_4I_5$, namely $g_2=I_1X_2Z_3Z_4X_5$, $g_3=X_1I_2X_3Z_4Z_5$, and $g_4=Z_1X_2I_3X_4Z_5$. The logical operators [eq:logical] are weight-five, but they are equivalent modulo the stabilizer to lower-weight operators supported on any three consecutive legs. Multiplying $\bar Z$ by the single stabilizer $g_3=X_1I_2X_3Z_4Z_5$ cancels the $Z$’s on legs $4$ and $5$ and leaves a weight-three representative on $\{1,2,3\}$: $$\begin{equation} \bar Z \;\sim\; \bar Z\cdot g_3 \;=\; Y_1\,Z_2\,Y_3\,I_4\,I_5 \quad(\text{up to a global phase}), \end{equation}$$ a Pauli of weight three supported on $\{1,2,3\}$. We work throughout in the Pauli group modulo its global phase, so the equality [eq:pushed] is understood up to a unit scalar; concretely $Z_1X_1=iY_1$ and $Z_3X_3=iY_3$, giving an overall factor $i^2=-1$ that acts trivially on physical states and is irrelevant to reconstruction on the code subspace. This is verified by the accompanying code, which computes the symplectic (phase-free) product by Pauli multiplication. The point is structural. The single bulk operator $\bar Z$ has many boundary representatives—one supported on $\{1,2,3\}$, and, because the code is cyclic, one on each cyclic window $\{2,3,4\}$, $\{3,4,5\}$, and so on—and they are all equal on the code subspace because they differ by stabilizers, which act as the identity there. This is 4’s equivalence relation made completely explicit: the bulk operator is the class $[\bar Z]$, the weight-three operators are its representatives, and the stabilizer group is the groupoid of morphisms between them.

6.2 Complementary recovery on two regions

Split the five boundary legs into $A=\{1,2,3\}$ and $A^c=\{4,5\}$. Because the code has distance three, erasing the two legs $A^c$ is correctable (9): the logical qubit is reconstructable on $A$. By [eq:pushed] the logical $\bar Z$, and similarly $\bar X$, have representatives supported entirely on $A$, so both logical Paulis—hence the whole logical algebra—live on $A$. The wedge of $A$ is the bulk leg $b$; the wedge of $A^c$ is empty (two legs are below the distance threshold, they reconstruct nothing).

Now enlarge to $A=\{1,2,3\}$, $A^c=\{4,5\}$ in a two-pentagon network so that both regions are above threshold for different bulk legs $b$ and $b'$. Then $b$ is reconstructable on $A$ and $b'$ on $A^c$, and—this is the content of complementary recovery, 15—the two reconstructions are consistent precisely because the operators of $b$ (represented on $A$) commute with those of $b'$ (represented on $A^c$), the two boundary algebras being in commutant position. Neither reconstruction “knows about” the other; their compatibility is a consequence of the code’s redundancy, not of any relation imposed between the two recovery maps. The center of the joint algebra—the area operator—is here the trivial (one-block) center, reflecting a fixed geometry; in a superposition of network geometries it would be nontrivial, and its eigenvalue would label which cut is minimal.

6.3 A discrete Ryu–Takayanagi cut on a toy graph

Consider a small tree tensor network: a central perfect tensor with three legs, each connected to a further perfect tensor carrying two boundary legs, for six boundary legs total, grouped into three boundary regions $A$, $B$, $C$ of two legs each. Bond dimension $\chi=2$.

For the region $A$ (two adjacent boundary legs off one branch), the cuts separating $A$ from the rest are: (i) the two boundary edges of $A$ itself, $|\gamma|=2$; (ii) the single internal edge connecting $A$’s branch tensor to the center, $|\gamma|=1$. The minimal cut is (ii), $|\gamma_A|=1$, so by 22, $$\begin{equation} S(A) \;=\; \log 2 \cdot |\gamma_A| \;=\; \log 2 . \end{equation}$$ By symmetry $S(B)=S(C)=\log 2$. For the union $S(AB)$ the minimal cut is the single edge leading to $C$’s branch, again $|\gamma_{AB}|=1$, so $S(AB)=\log 2=S(C)$, consistent with purity of the global state. The tripartite information is $$\begin{equation} I_3(A:B:C) = S_A+S_B+S_C - S_{AB}-S_{BC}-S_{AC}+S_{ABC} = 3\log2 - 3\log2 + 0 = 0 \end{equation}$$ for this tree; a genuinely hyperbolic (loopy) HaPPY network gives strictly negative $I_3$, the diagnostic of 24(d). The tree already exhibits the essential min-cut phenomenon: the entropy of a boundary region is set not by the number of its own legs but by the cheapest bulk cut homologous to it—the discrete Ryu–Takayanagi surface.

7 Relation to other regimes and the status calculus

The program is modular: regimes compose by the weakest-link calculus of 2.2, never by monolithic unification. We record three honest compositions and one explicit non-identification.

7.1 Gauge redundancy versus logical redundancy (BV–BRST bridge)

The sharpest composition is with the BV–BRST gauge-redundancy regime. In BV–BRST one resolves a gauge symmetry by a Koszul–Tate/Chevalley–Eilenberg complex whose ghost-for-ghost tower encodes the isotropy (stabilizer) data of the gauge action; physical observables are the degree-zero cohomology. In the holographic-code regime one resolves a logical subspace by a stabilizer group whose elements act as the identity on the code subspace; physical (logical) operators are the normalizer modulo the stabilizer. The structural analogy is clean: gauge redundancy (stabilizer group $S$) and logical redundancy (the many boundary representatives of one bulk operator) are both quotients by a redundancy group.

The analogy becomes an identity in exactly one case, and there it is status-$\mathsf{S}$.

7.2 Local observables (factorization-algebra bridge)

The theme “many representatives, one observable content” appears in three structurally different regimes: QEC redundancy (here), representation-basis change (celestial holography), and cosheaf gluing (factorization algebras). In the factorization-algebra regime a local observable is a section of a cosheaf, and the same global observable has many local presentations glued by the cosheaf’s structure maps. The bridge to holographic codes is that the wedge algebras $\mathcal{A}_a$, $\mathcal{A}_{a^c}$ of 4 are exactly the algebras a factorization structure would assign to the bulk regions $\mathcal{E}(A)$, $\mathcal{E}(A^c)$, and complementary recovery is the statement that these two local assignments generate the global algebra with the area operator as their overlap (center). The composite status is $\mathrm{compose}(\mathsf{S}/\mathsf{H}_{\text{fact}},\mathsf{H}_{\text{wedge}}) =\mathsf{H}$; we use the calculus here only to bound the joint claim from above, not to merge the two regimes into one. The recent algebraic-QFT program on modular flow, Connes cocycles, and generalized entropy is where the finite-dimensional center of 16 is replaced by the crossed-product / type-II structure of a genuine continuum wedge algebra; that is the technically correct home of the area operator, and it is an active $\mathsf{H}$-status research frontier.

7.3 Emergent Lorentzian geometry (classical-limit bridge)

The min-cut area of 22 must reduce, in a large-code/continuum limit, to the smooth $\mathrm{Area}(\gamma_A)/4G_N$ of a Lorentzian bulk metric—the classical-geometry regime’s output. This is the holographic-QEC leg of the program’s emergent-metric roadmap. The bridge claim is $\mathsf{H}$: the continuum limit of a tensor network to a smooth AdS geometry is controlled only in toy models (MERA-type networks , random-tensor networks), and a general theorem that a holographic code’s min-cut metric converges to an Einstein Lorentzian metric does not exist. $\mathrm{compose}(\mathsf{S}/\mathsf{H}_{\text{geom}},\mathsf{H}_{\text{wedge}}) =\mathsf{H}$; the discrete side (min-cut) is $\mathsf{S}$, the continuum reduction is $\mathsf{H}$, and Van Raamsdonk’s “entanglement builds geometry” picture is the heuristic that motivates it.

7.4 An explicit non-identification

The program forbids silently merging this regime with celestial/flat-space holography. The two are complementary but structurally different realizations of “holography”: the present regime encodes bulk data redundantly into boundary data via entanglement wedges and RT surfaces in an AdS (negatively curved) bulk; celestial holography repackages a flat-space S-matrix as correlators of a conformal theory on the celestial sphere, organized by BMS asymptotic symmetries and soft theorems. The invariants differ (entanglement wedges/RT area versus BMS Ward identities), the asymptotics differ (AdS versus asymptotically flat), and no established construction identifies them. We present them side by side and decline to compose them into a single dictionary; the status calculus is not even invoked, because there is no bridging claim to bound.

7.5 Summary of compositions

8 Limitations and open problems

We state plainly what this regime does and does not establish.

8.0.0.1 Finite dimension versus type III.

The exact statements of [sec:codes,sec:oaqec] are finite-dimensional. The boundary algebra of a continuum conformal field theory associated to a subregion is a type-III$_1$ von Neumann factor, which has no trace, no minimal projections, and no density matrices; the clean center/area-operator decomposition [eq:comprec] does not literally apply. The correct continuum statement uses the crossed-product constructions and generalized-entropy arguments of the recent algebraic-holography program, where the area operator emerges as the generator of a boundary modular flow rather than as a naive central element. Our finite-dimensional theorems are the right pedagogy and the right toy models; they are not the continuum theorem.

8.0.0.2 Approximate, not exact, codes.

Real holography is an approximate code: relative entropies agree only up to $1/N$-suppressed corrections, and the exact equivalences of 16 become approximate. 19 shows reconstruction survives with controlled error, but the idealized exact isometry of the HaPPY code is a simplification. The negative tripartite information and the discrete RT formula are exact statements about the toy model, not about a physical CFT.

8.0.0.3 Open problem 5: which gauge redundancies are logical.

The roadmap’s open problem for this regime is to prove which gauge redundancies of a gauge theory behave like logical-code gauge degrees of freedom and which do not. 25 settles the surface-code case ($\mathsf{S}$); the general classification is open. A promising route is to characterize, for a lattice gauge theory, when the Gauss-law constraint algebra admits a complementary-recovery packaging—this would connect the BV–BRST constraint cohomology directly to the OAQEC correctable-subalgebra structure.

8.0.0.4 No general continuum-limit theorem.

No theorem guarantees that a holographic code’s min-cut geometry converges, in a large-bond-dimension/refinement limit, to a smooth Lorentzian Einstein metric. Random-tensor-network and MERA results are suggestive but special. This is the weakest link in the “entanglement builds geometry” story and the reason the classical-limit bridge of 7.3 is $\mathsf{H}$.

8.0.0.5 Black-hole information.

The code picture reframes the information paradox—information is redundantly, nonlocally encoded, and infalling information moves into a larger recovery region rather than being destroyed—but the code regime as used here does not resolve it. The island/replica-wormhole developments that compute a unitary Page curve are a separate, more dynamical input; we cite the reframing and do not claim the resolution.

8.0.0.6 Composite status.

The composite status of the regime is $\mathsf{H}$, set by the entanglement-wedge-reconstruction entry ([tab:dictionary]), not by the toy-model mathematics, which is $\mathsf{S}/\mathsf{H}$. This is the honest label: the codes are real mathematics, the claim that they are the bulk dictionary of quantum gravity is a heuristic.

9 The accompanying code

The Haskell package in src/tensor-networks-qec/ makes the finite-dimensional claims executable. It provides: a small Pauli/stabilizer module that represents the $[[5,1,3]]$ code and checks that the logical operators [eq:logical] commute with the stabilizer generators and anticommute with each other; an operator-pushing routine that produces a weight-three boundary representative of $\bar Z$ and verifies it is stabilizer-equivalent to the weight-five form [eq:pushed]; a tree tensor-network min-cut computation reproducing [eq:toyS] and [eq:toyI3]; and a faithful port of the S/H/P status calculus with checkable properties (monotonicity, $\mathsf{S}$-unit, associativity of 2, and the composite-status computation yielding $\mathsf{H}$ for this regime). The properties are checked by a dependency-free harness and print PASS/FAIL; this is the executable, status-$\mathsf{S}$ face of the paper.

10 Discussion

The holographic-emergence regime is the program’s clearest instance of reconstructing measurement, not merely geometry, from an invariant representation structure. The invariant is spare: an isometric code and its complementary-recovery structure. From it, “a bulk operator” acquires a precise meaning as an equivalence class of boundary operators, “the area of a surface” acquires a precise meaning as a central element / minimal cut, and “the bulk lives inside the boundary” acquires a precise meaning as an isometric embedding with redundancy. None of this quantizes a material object on a background; all of it reconstructs the objects—operator, area, locality—from the code.

The discipline of the S/H/P calculus is what keeps the account honest. It is tempting, given how cleanly the toy models work, to promote the whole picture to a theorem about quantum gravity. The calculus forbids it: the wedge-reconstruction dictionary is $\mathsf{H}$, and every chain through it is capped at $\mathsf{H}$. What is $\mathsf{S}$ is real and worth having—the Knill–Laflamme conditions, the perfect-tensor recovery, the discrete RT min-cut, the surface-code homology—and it is the floor on which the heuristic bulk interpretation stands. The one place the gauge/QEC identification is genuinely $\mathsf{S}$, the surface code, is the natural starting point for the regime’s open problem, and it connects this regime directly to the BV–BRST gauge-redundancy regime without any inflation.

11 Conclusion

We have given a self-contained account of the holographic-emergence regime as one modular layer of a reconstruction program. Its invariant is “many boundary representatives, one bulk operator,” realized by an isometric quantum error-correcting code with complementary recovery. We proved the elementary, status-$\mathsf{S}$ facts in full—Knill–Laflamme correctability of a region’s complement gives reconstruction on the region; perfect tensors give operator pushing and one-sided recovery; stabilizer codes supply computable perfect tensors; tensor networks compute a discrete Ryu–Takayanagi min-cut—and stated the deeper theorems of Almheiri–Dong–Harlow, Harlow, and Jafferis–Lewkowycz–Maldacena–Suh with the $\mathsf{H}$ labels their bulk-dictionary content requires. We worked a holographic pentagon and a toy graph explicitly, and we composed the regime honestly with BV–BRST gauge redundancy (where the surface-code $\mathop{\mathrm{H}}_1(\Sigma;\mathbb{Z}_2)$ identity is the one genuinely $\mathsf{S}$ bridge), factorization-algebra locality, and emergent Lorentzian geometry, while declining to merge it with celestial holography. The composite status of the regime is $\mathsf{H}$; the toy-model mathematics underneath it is $\mathsf{S}/\mathsf{H}$; and the distance between those two labels is precisely the distance between what is proved and what is conjectured in holographic quantum gravity.

11.0.0.1 Acknowledgments.

This paper is part of a modular library of reconstruction regimes developed by the YonedaAI Research Collective. The author thanks the collaboration’s internal review process. The epistemic-status discipline throughout follows the program’s shared S/H/P calculus.