I subject the Ryu-Takayanagi (RT) prescription for holographic entanglement entropy to the same hypothesis-led audit previously applied to entanglement equilibrium, mutual information reconstruction, and random tensor networks. The prescription is decomposed into six falsifiable hypotheses T1 to T6. The main findings are: On the exactly solvable AdS3/CFT2 Poincare disk we verify the geodesic-length formula, its logarithmic coefficient (Brown-Henneaux matching), and characterize the mutual-information phase transition quantitatively. The transition sits at cross ratio xc = 1/2 + O(exp(-2rho)), exactly at alpha_c = pi/2 for all rho in the antipodal-symmetric family, with randomized-asymmetric deviations vanishing exponentially with cutoff depth rho, showing that the universal CFT2 location is the asymptotic limit of the bulk criterion, not an identity at finite cutoff. The homology constraint, often presented as an output of the holographic setup, is shown to be an input: it must be imposed by hand on the graph, and the phase transition it produces is first-order-sharp at the RT level while any discretization smears it. The continuum limit of discretized RT surfaces fails to be Riemannian: polar-lattice min-cuts converge, under delta-refinement, to a Finsler (taxicab-normal) metric with a systematic, delta-independent offset of +4.5% at 60 degrees, +13% at 30 degrees, +18% at 15 degrees, and -0.1% at 90 degrees. Mutual information, a difference of areas, amplifies these offsets asymmetrically: the connected-phase signal is underreported by up to 24% at delta = 0.1, while the transition window fabricates spurious mutual information of +0.39 at delta = 0.2. I conclude that RT is exact as a formula, input-carrying as a prescription, and metric-blind under discretization, with the error concentrated precisely at the shallow geodesics where the prescription is most often probed. All numbers are generated by two deterministic Python programs with no Monte Carlo required.
I subject the Ryu-Takayanagi (RT) prescription for holographic entanglement entropy to the same hypothesis-led audit previously applied to entanglement equilibrium, mutual information reconstruction, and random tensor networks. The prescription is decomposed into six falsifiable hypotheses T1 to T6. The main findings are: On the exactly solvable AdS3/CFT2 Poincare disk we verify the geodesic-length formula, its logarithmic coefficient (Brown-Henneaux matching), and characterize the mutual-information phase transition quantitatively. The transition sits at cross ratio xc = 1/2 + O(exp(-2rho)), exactly at alpha_c = pi/2 for all rho in the antipodal-symmetric family, with randomized-asymmetric deviations vanishing exponentially with cutoff depth rho, showing that the universal CFT2 location is the asymptotic limit of the bulk criterion, not an identity at finite cutoff. The homology constraint, often presented as an output of the holographic setup, is shown to be an input: it must be imposed by hand on the graph, and the phase transition it produces is first-order-sharp at the RT level while any discretization smears it. The continuum limit of discretized RT surfaces fails to be Riemannian: polar-lattice min-cuts converge, under delta-refinement, to a Finsler (taxicab-normal) metric with a systematic, delta-independent offset of +4.5% at 60 degrees, +13% at 30 degrees, +18% at 15 degrees, and -0.1% at 90 degrees. Mutual information, a difference of areas, amplifies these offsets asymmetrically: the connected-phase signal is underreported by up to 24% at delta = 0.1, while the transition window fabricates spurious mutual information of +0.39 at delta = 0.2. I conclude that RT is exact as a formula, input-carrying as a prescription, and metric-blind under discretization, with the error concentrated precisely at the shallow geodesics where the prescription is most often probed. All numbers are generated by two deterministic Python programs with no Monte Carlo required.
We derive the Ryu–Takayanagi (RT) formula for holographic entanglement entropy from a resource-allocation principle. We model bulk reconstruction as a budget-constrained distributed optimization problem: spacelike-separated boundary observers must decide which bulk operators to reconstruct under a shared budget, without communicating their local inputs. We prove three results. (1) Any local (non-communicating) protocol for this game achieves expected utility at most 1/2, while a centralized protocol achieves 2/3; the gap Δ = 1/6 is tight. (2) The information cost of closing this gap is O(1) bits per degree of freedom, with residual loss decaying as 4−k in the number of communicated bits k. (3) In holographic tensor networks (HaPPY codes and random tensor networks), the allocation decisions across distinct bonds on the minimal surface are independent, so the total information cost sums linearly: S(A) = |γA| log2 χ, reproducing the RT formula. The derivation is non-circular: the RT formula emerges as the output, not an input. We identify the bipartite inefficiency ratio η(2) = 1/4 and discuss its possible connection to the Bekenstein–Hawking prefactor. We also characterize the entanglement wedge phase transition as a discrete reallocation event in the bond-level optimization landscape.Extended proofs available at doi:10.5281/zenodo.19213268.
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.
The random-tensor-network route to holographic geometry reads a spacetime out of a graph whose edges carry bond dimensions: entanglement entropies are minimal cuts at leading order, the cut weights are the geometric areas, and the boundary theory inherits subregion duality and error correction. This paper is an audit of that route, in the spirit of the companion audits of entanglement equilibrium and of mutual-information metric reconstruction: every assumption beyond established mathematics is isolated as one of six explicit hypotheses T1 to T6 and each is proved, checked numerically, or recorded as input. The audit yields: (i) on trees the random-tensor entropy is exactly Page, the quantum correction to the geometric area law is bond-dimension independent and the geometric limit does not remove it, verified by Monte Carlo to 10^-4; (ii) the continuum limit of the min-cut law is a property of the region-graph alignment, not of the geometry, showing that the quasi-uniform families that carried previous audits do not support the random-tensor continuum limit at all; (iii) with uniform bond dimensions the boundary entropy scaling is geometry-blind, meaning the celebrated holographic profiles must be put into the bond-dimension function by hand and geometry is strictly an input of the model; (iv) single-boundary-site mutual information is a finite-size effect and vanishes with system size, showing that the random-tensor route's geometry lives in region-level cut homology in sharp contrast to single-site mutual information routes. The ledger records the status of every hypothesis.
Abstract Recent results suggest that new corrections to holographic entanglement entropy should arise near phase transitions of the associated Ryu-Takayanagi (RT) surface. We study such corrections by decomposing the bulk state into fixed-area states and conjecturing that a certain ‘diagonal approximation’ will hold. In terms of the bulk Newton constant G, this yields a correction of order O(G−1/2) near such transitions, which is in particular larger than generic corrections from the entanglement of bulk quantum fields. However, the correction becomes exponentially suppressed away from the transition. The net effect is to make the entanglement a smooth function of all parameters, turning the RT ‘phase transition’ into a crossover already at this level of analysis. We illustrate this effect with explicit calculations (again assuming our diagonal approximation) for boundary regions given by a pair of disconnected intervals on the boundary of the AdS3 vacuum and for a single interval on the boundary of the BTZ black hole. In a natural large-volume limit where our diagonal approximation clearly holds, this second example verifies that our results agree with general predictions made by Murthy and Srednicki in the context of chaotic many-body systems. As a further check on our conjectured diagonal approximation, we show that it also reproduces the O(G−1/2) correction found Penington et al. for an analogous quantum RT transition. Our explicit computations also illustrate the cutoff-dependence of fluctuations in RT-areas.
We study the error-correcting properties of pure-state holographic geometries, in which mixed boundary subregions are replaced, via the surface/state correspondence, by the Ryu--Takayanagi (RT) geodesic bounding their entanglement wedges. In AdS3/CFT2 we derive a cross-ratio threshold relation η′/η=eΔH/2 for the connected/disconnected transition of the entanglement wedge when two holes are punched in such a geometry. The quantity ΔH is sourced entirely by geodesics ending on RT boundaries. It shifts the standard two-interval threshold η=1/2, and we classify when its sign is fixed by the pattern of hole endpoints. Turning to code properties, we show that the recursive hole-punching underlying uberholography cannot start within an RT-boundary, while an untouched asymptotic boundary can still fractalize, and we find numerically that in the configurations we study it does so with the universal fractal dimension α≈0.786. The resulting upper bounds on price and distance are nevertheless procedure dependent. In the configurations we study, punching holes on the asymptotic boundary while retaining the RT-boundary yields strictly tighter bounds than first tracing out the RT-boundary and then fractalizing.