One of the boldest ideas in modern physics is that space itself is a kind of error-correcting code. In this picture the interior of a region of spacetime is like a message, and the surface surrounding it is an encoded copy that stores the message redundantly, so that losing part of the surface need not lose the interior. A celebrated formula from holography then says something unexpected: the amount of entanglement carried by a boundary region equals the area of a surface reaching into the interior. This paper gives a complete, elementary proof that this area law is not an extra assumption bolted on by hand, but an unavoidable consequence of the code structure itself. The geometry is simply bookkeeping for redundancy. The derivation reduces a statement about gravity to plain facts about entanglement and about the algebra of operations one can perform on the encoded information. It establishes four things, each from scratch. First, in the simplest case it recovers the area law directly: the entanglement of a boundary region is a fixed geometric term plus the entanglement of whatever the interior itself carries. Second, it proves a symmetry that had previously been handled case by case, namely that a pure joint state assigns the same entanglement to a region and to its complement, and it proves this in full generality using a single clean identity about matrices. Third, it extends the area law to the realistic situation in which the code splits into separate sectors, each carrying its own independent area, so that the geometric term is not a single number but a genuine operator averaged over the sectors. Fourth, it proves the structural fact the whole picture rests on: the algebra of logical operations always decomposes cleanly into independent blocks, which is exactly the sector structure the area law needs. That last step comes down to one small analytic fact, that a matrix which is symmetric in the appropriate sense and also nilpotent must be zero, and the paper proves it directly. A companion result closes the reconstruction side of the story, showing that the operations recoverable from a boundary region are precisely those left untouched by the coarse-graining onto sectors, and that the coarse-grained state already reproduces every such measurement. Every step is elementary and self-contained, and the entire logical core has a companion version reconstructed inside a machine proof assistant, checked line by line with no gaps and resting only on the standard axioms of mathematics. The upshot is that a piece of geometry, an area, can be read off from nothing more than how redundantly a code stores its information. None of the underlying mathematics is new; it traces back to established results on holographic codes, to the entropy formula itself, and to the century-old classification of matrix algebras. What is new is the assembly: a short, honest, self-contained line of reasoning that turns a claim about spacetime into a handful of reusable facts about entropy and matrices, with every link exposed and checkable. Where the picture still reaches past what has been proved, in particular the finer tensor structure hidden inside each sector, the paper marks the boundary plainly instead of hiding it.
One of the boldest ideas in modern physics is that space itself is a kind of error-correcting code. In this picture the interior of a region of spacetime is like a message, and the surface surrounding it is an encoded copy that stores the message redundantly, so that losing part of the surface need not lose the interior. A celebrated formula from holography then says something unexpected: the amount of entanglement carried by a boundary region equals the area of a surface reaching into the interior. This paper gives a complete, elementary proof that this area law is not an extra assumption bolted on by hand, but an unavoidable consequence of the code structure itself. The geometry is simply bookkeeping for redundancy. The derivation reduces a statement about gravity to plain facts about entanglement and about the algebra of operations one can perform on the encoded information. It establishes four things, each from scratch. First, in the simplest case it recovers the area law directly: the entanglement of a boundary region is a fixed geometric term plus the entanglement of whatever the interior itself carries. Second, it proves a symmetry that had previously been handled case by case, namely that a pure joint state assigns the same entanglement to a region and to its complement, and it proves this in full generality using a single clean identity about matrices. Third, it extends the area law to the realistic situation in which the code splits into separate sectors, each carrying its own independent area, so that the geometric term is not a single number but a genuine operator averaged over the sectors. Fourth, it proves the structural fact the whole picture rests on: the algebra of logical operations always decomposes cleanly into independent blocks, which is exactly the sector structure the area law needs. That last step comes down to one small analytic fact, that a matrix which is symmetric in the appropriate sense and also nilpotent must be zero, and the paper proves it directly. A companion result closes the reconstruction side of the story, showing that the operations recoverable from a boundary region are precisely those left untouched by the coarse-graining onto sectors, and that the coarse-grained state already reproduces every such measurement. Every step is elementary and self-contained, and the entire logical core has a companion version reconstructed inside a machine proof assistant, checked line by line with no gaps and resting only on the standard axioms of mathematics. The upshot is that a piece of geometry, an area, can be read off from nothing more than how redundantly a code stores its information. None of the underlying mathematics is new; it traces back to established results on holographic codes, to the entropy formula itself, and to the century-old classification of matrix algebras. What is new is the assembly: a short, honest, self-contained line of reasoning that turns a claim about spacetime into a handful of reusable facts about entropy and matrices, with every link exposed and checkable. Where the picture still reaches past what has been proved, in particular the finer tensor structure hidden inside each sector, the paper marks the boundary plainly instead of hiding it.
The holographic bound writes a region's entanglement entropy as an area, S=A/4DA². Read as a length, DA is the area carried per bit of entanglement, bounded below by the Planck length. This note argues that DA is not a rewriting of the entropy but a different object with two powers the entropy as a number does not have: it is commensurable across domains, and it is geometric. On the first, the filling fraction f=DA²/L² places a quantum critical chain, a black hole, and a single-bit Landauer erasure on one DA axis, where the three entropies — entanglement, Bekenstein–Hawking, classical — are not directly comparable. On the second, the scaling of the entanglement length builds an emergent geometry: for a one-dimensional critical system DA forces, through Ryu–Takayanagi, an emergent AdS of constant negative curvature, while a gapped system gives a flat interior. We verify the geometric content numerically through the entanglement c-function, which is flat to 10⁻⁴–10⁻⁶ for critical chains (scale invariance, constant curvature) and decays to zero for a gapped chain (flat interior). The running rate β equals the central charge as an identity of the Calabrese–Cardy formula, not a fit; free-fermion calculations show β→c/6 as the finite-size correction vanishes from L=64 to L=4096. A second condition, the log-fit quality R², is mandatory: a volume-law state forges a spurious β that only R² exposes. The diagnostic becomes a geometry classifier with four classes — critical (hyperbolic, β>0), gapped (flat, β→0), glassy, and thermal — each carrying a clean representative, the glassy class realized by a genuine interacting disorder model (many-body localization in the random-field Heisenberg chain, which sweeps from a volume-law ergodic interior to an area-law localized interior). We state the honest boundaries: the central-charge reading does not extend to higher dimensions, to dynamics, or to topological order, and the cross-domain DA axis is an organizing coordinate, not a claim that the three systems are one physics. The contribution is a unifying compression–geometry perspective in which DA, as a holographic length, is the axis — not a new force, and not a renaming of the entropy.
Holographic quantum error-correcting codes — toy models of how spacetime might emerge from quantum information — let one reconstruct interior information from part of a boundary, provided the region is large enough. This paper asks a sharper question: which interior information is not merely reconstructable but objective — redundantly broadcast so that many separate boundary observers agree on it without disturbing it? Working in an explicit, exactly solvable holographic code, the paper shows that these two notions genuinely differ, and that objectivity is the stronger one. A generic interior state can be reconstructed only above a size threshold and never from a single small region. But a broadcast conserved charge leaves a record in every boundary fragment, so every observer reads it at once — an exactly objective, shared classical label. The geometric "minimal surface" that governs entanglement is shown to be blind to this objective charge. Most strikingly, the redundancy patterns of many objective charges reconstruct the interior geometry itself — geometry as the redundancy graph of objective data. The paper also derives the broadcast structure from symmetry rather than assuming it, recasts the distinction as a no-cloning statement, and marks an honest limit: only broadcast (long-range) charges are objective, not any buried interior charge. All results are proved or numerically exact. In short: in these models, what is objective is stronger than what is knowable — and the objective may be what weaves space together.
This paper is the seventh in a sequence developing an interpretive framework that redescribes physical reality as a causally consistent history of information updates rather than as a collection of objects independently existing within spacetime. Two prior results set up its question. The third paper (Uchida, 2026c) characterized public finality—recoverability of a committed fact by many mutually independent accessors, non-disturbingly and repeatably—as a broadcast redundancy: an effectively classical pointer value proliferated across many disjoint environmental fragments, approximately in the form of spectrum broadcast structure. The fourth paper (Uchida, 2026d) read the evaporating black hole as the regime in which a committed interior record crosses, at the Page time, from hidden to recoverable encoding, reconstructible from the radiation through entanglement-wedge reconstruction; and the parent framework (Uchida, 2026a, §10) had flagged holographic quantum error correction as a place its language of protected, redundantly encoded, locally recoverable records might find content. The present paper makes that content precise as a structure theory of recoverable records, kept separate from any claim of new physics or any suggestion that the framework derives the underlying results. The central claim is conditional and structural. The framework does not claim that every recoverable piece of information is a code, that the universe is literally a quantum error-correcting code, or that AdS/CFT describes our universe. It claims that when information qualifies as an erasure-recoverable record because an encoding preserves a logical degree of freedom—or a logical operator algebra—against a specified family of physical erasures, then that recoverability is formalized as an exact or approximate quantum error-correcting structure, in which each correctable erasure leaves an authorized complementary region supporting a recovery map. That formalization is itself an established mathematical classification; the paper's interpretive contribution is to read the series' recoverable record through it, and to set it against a second, distinct architecture. Broadcast redundancy makes the same effectively classical value legible from many disjoint fragments; erasure-correcting redundancy protects noncommuting logical quantum information by keeping each correctable erased region ignorant of—approximately private with respect to—the protected logical content, while suitable remaining regions recover it. The formal engine of this distinction is the duality between correctability and privacy (the information–disturbance tradeoff), not the no-cloning theorem; no-cloning, with the access structure of quantum secret sharing, survives as the reason independently usable recovery regions for arbitrary unknown logical quantum information must overlap. Three commitments keep the reading honest. First, it separates three senses of "record"—protected logical quantum information, a committed classical record, and a publicly final record—and insists that recovery or decoding restores access to logical quantum information but does not, by itself, commit a classical value; commitment additionally requires measurement, pointer imprinting, decoherence, and stabilization (Uchida, 2026f), and public finality a still later broadcast. Second, holographic quantum error correction is offered as the sharpest worked model of the distinction, with exactly solvable tensor-network toy codes (exact within the model) kept distinct from realistic semiclassical holographic reconstruction beyond those limits (generally treated as approximate), and both from the further question of state-dependence. Third, code-recoverability does not by itself imply public finality: protected quantum information can be recoverable from authorized regions while remaining non-public. The framework relabels code structure as the architecture of recoverability and derives none of it, making no independent empirical prediction. Its disciplined thesis is that codes protect recovery; broadcasts create publicity—different architectures that a single physical history may nonetheless realize in sequence.
In this Dissertation, different aspects of holographic entanglement entropy are explored. In quantum information theory, entanglement is a useful resource needed to perform quantum operations. Entanglement entropy quantifies this resource and even if computable in quantum field theories, it is quite hard to calculate explicitly. However, in the context of gauge/gravity duality, (holographic) entanglement entropy was proposed by Ryu and Takayanagi (RT) to be captured by the area of a minimal surface in Anti DeSitter (AdS) space, which is extremely simple to compute. We begin by using the holographic dictionary to derive the RT formula. This is done by first considering smooth bulk geometries which are dual to n copies of the boundary geometry glued in a particular way. The action of these geometries computes the Renyi entropies S_n for any integer n. We give a prescription to analytically continue the action to non-integer n and argue that, as n goes to 1,S_1, the entanglement entropy, is given by the area of a minimal surface, reproducing the RT conjecture. That is, we reduced the RT proposal to the equality between bulk and boundary partition functions, a standard entry in the dictionary. We then generalize the previous formalism to account for corrections due to bulk quantum fields (1/N corrections in the boundary). This allows us to derive a new formula: boundary entanglement entropy is given by the area of the minimal surface plus bulk entanglement entropy. This extends RT beyond the planar limit and we present several predictions of the proposal. Our exploration of holographic entanglement entropy continues by considering different states: by comparing the quantum corrected entropy for nearby states we obtain the modular hamiltonian operator in bulk perturbation theory. From this expression of the modular hamiltonian, we derive that relative entropy is bulk relative entropy and that the modular flow is the bulk modular flow.
It was recently shown by Harlow that any quantum error correcting code, satisfying the same complementary recovery properties as AdS/CFT, will obey a version of the Ryu-Takayanagi formula. In his most general result, Harlow allowed the bulk algebras to have nontrivial center, which was necessary for the "area operator" in this Ryu-Takayanagi formula to be nontrivial. However, the boundary Hilbert space was still assumed to factorise into Hilbert spaces associated with complementary boundary regions. We extend this work to include more general boundary theories, such as gauge theories, where the subalgebras associated with boundary regions may also have nontrivial center. We show the equivalence of a set of four conditions for a bulk algebra to be reconstructable from a boundary algebra, and then show that complementary recovery implies that the algebraic boundary entropy obeys a Ryu-Takayanagi formula. In contrast, we show that the distillable boundary entropy does not obey any such formula. If an additional "log dim R" term is added to the algebraic entropy, it will still obey a Ryu-Takayanagi formula, with a different area operator. However, since the "log dim R" term is a sum over local boundary contributions, we argue that it can only be related to the regularisation of the area at the bulk cut-off.
In the context of quantum theories of spacetime, one overarching question is how quantum information in the bulk spacetime is encoded holographically in boundary degrees of freedom.It is particularly interesting to understand the correspondence between bulk subregions and boundary subregions in order to address the emergence of locality in the bulk quantum spacetime.For the AdS/CFT correspondence, it is known that this bulk information is encoded redundantly on the boundary in the form of an error-correcting code.Having access only to a subregion of the boundary is as if part of the holographic code has been damaged by noise and rendered inaccessible.In quantum-information science, the problem of recovering information from a damaged code is addressed by the theory of universal recovery channels.We apply and extend this theory to address the problem of relating bulk and boundary subregions in AdS/CFT, focusing on a conjecture known as entanglement wedge reconstruction.Existing work relies on the exact equivalence between bulk and boundary relative entropies, but these are only approximately equal in bulk effective field theory, and in similar situations it is known that predictions from exact entropic equalities can be qualitatively incorrect.We show that the framework of universal recovery channels provides a robust demonstration of the entanglement wedge reconstruction conjecture as well as new physical insights.Most notably, we find that a bulk operator acting in a given boundary region's entanglement wedge can be expressed as the response of the boundary region's modular Hamiltonian to a perturbation of the bulk state in the direction of the bulk operator.This formula can be interpreted as a noncommutative version of Bayes's rule that attempts to undo the noise induced by restricting to only a portion of the boundary.To reach these conclusions, we extend the theory of universal recovery channels to finite-dimensional operator algebras and demonstrate that recovery channels approximately preserve the multiplicative structure of the operator algebra.