When does a state-dependent proto-area define a bulk geometry?
Abstract
A holographic code assigns a state-dependent entropy remainder to every boundary region, but such remainders need not be the extremal lengths of any one bulk metric. We study this common-source question for the proto-area of a calibrated recovery, the entropy of a boundary region minus that of the matter recovered from it. At zeroth order the reference values must match the lengths of one reference geometry in a fixed renormalization scheme, and this matching also determines the entropy-to-length factor. On a graph with a fixed minimum-cut chamber the data derivatives must lie in the image of the cut-incidence matrix, whose left null vectors are witnesses. On the hyperbolic disk the first variation of renormalized length is the rank-two geodesic X-ray transform, with closed range in an adapted data space, and the geodesic displacement, fixed by a forced Jacobi equation, enters at second order. The resulting normal Hessian gives a gauge-invariant criterion, necessary and sufficient, for a regular pair of response coefficients to come from one metric two-jet. For the constant-curvature family generated by a boundary reparametrization the Hessian has a nonzero rank-four mode, so the image of the length map is curved. For a fixed recovery the proto-area Hessian is minus the Bogoliubov-Kubo-Mori information lost in recovery, which the Petz map decomposes orthogonally at a product reference, and which, on a finite-dimensional space of logical directions with positive minimum retained fraction, is at most a sharp multiple of the retained information. Geometric realization requires this loss to reproduce the normal length Hessian on every interval. Two codes show that exact regional area operators can fail to sew into one graph geometry, and that a matched reference with vanishing first response can fail at second order. All criteria refer to one recovery branch and one extremal-surface branch.
Related
- Quantum geometry of connected state manifolds: When diabolic points act as bridges between eigenstate manifolds
- Defining the Crick-Franklin-Watson genes of any robot (equals a finite state machine) and defining the Shannon genetic code attached to each gene. We also define the Krohn-Rhodes complexity of any regular maximal prefix code
- When Polynomial Multiplication Counts Geometry: Schubert Polynomials and Monk's Rule
- When Geometry Shapes Information in Pursuit-Evasion Games
- When models choose metrics: Hidden geometry in computational biology
BibTeX
@misc{li2026when,
title = {{When does a state-dependent proto-area define a bulk geometry?}},
author = {Ruiliang Li},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2606.22598},
eprint = {2606.22598},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.22598},
}
RIS
TY - UNPB
TI - When does a state-dependent proto-area define a bulk geometry?
AU - Ruiliang Li
PY - 2026
DA - 2026/10/12
PB - arXiv
DO - 10.48550/arxiv.2606.22598
UR - https://arxiv.org/abs/2606.22598
AB - A holographic code assigns a state-dependent entropy remainder to every boundary region, but such remainders need not be the extremal lengths of any one bulk metric. We study this common-source question for the proto-area of a calibrated recovery, the entropy of a boundary region minus that of the matter recovered from it. At zeroth order the reference values must match the lengths of one reference geometry in a fixed renormalization scheme, and this matching also determines the entropy-to-length factor. On a graph with a fixed minimum-cut chamber the data derivatives must lie in the image of the cut-incidence matrix, whose left null vectors are witnesses. On the hyperbolic disk the first variation of renormalized length is the rank-two geodesic X-ray transform, with closed range in an adapted data space, and the geodesic displacement, fixed by a forced Jacobi equation, enters at second order. The resulting normal Hessian gives a gauge-invariant criterion, necessary and sufficient, for a regular pair of response coefficients to come from one metric two-jet. For the constant-curvature family generated by a boundary reparametrization the Hessian has a nonzero rank-four mode, so the image of the length map is curved. For a fixed recovery the proto-area Hessian is minus the Bogoliubov-Kubo-Mori information lost in recovery, which the Petz map decomposes orthogonally at a product reference, and which, on a finite-dimensional space of logical directions with positive minimum retained fraction, is at most a sharp multiple of the retained information. Geometric realization requires this loss to reproduce the normal length Hessian on every interval. Two codes show that exact regional area operators can fail to sew into one graph geometry, and that a matched reference with vanishing first response can fail at second order. All criteria refer to one recovery branch and one extremal-surface branch.
ER -