The Donkey on the Edge
Vol. IThe EvolutionFigure I · Paper I

This is Paper I as it was submitted on May XI, MMXXVI, preserved unchanged. For the current work, see Paper III. For what Paper I was missing, see the capsule and the Field Notes essay What Paper One Left on the Table.

THE EVOLUTION · FIGURE I · PAPER I · VOL. I

THE PAPER

In which the disagreement between two observers, looking through the same noisy lens, is shown to depend in a measurable way on the complexity of what they are looking at.

Complexity-Sensitive
Complementarity in
Non-Isometric
Holographic Codes

ABSTRACT

We investigate the two-observer disagreement $\mathbb{E}|S_A - S_B|$ in Akers, Engelhardt, Harlow, Penington, and Vardhan non-isometric holographic codes, with observers included via the Harlow, Usatyuk, and Zhao cloning rule. Our central result is a structural identity: at leading order in $1/d_{\mathrm{eff}}$, the Haar-$V$-averaged observer-reduced state satisfies $\mathbb{E}_V[\rho_{R_A}] = \rho_A^{\mathrm{bulk}} + O(1/d^2)$, with off-diagonals in the cloning basis suppressed at the same order. This identity reduces the two-observer disagreement problem to a moment calculation of the bulk-marginal diagonal, whose scaling with observer dimension $d_B$ depends on the bulk state class.

We carry out this calculation for two extreme classes. For random product bulk states we prove $\mathbb{E}|S_A - S_B| \to \sqrt{4(\pi^2/3 - 3)/\pi}\, d_B^{-1/2} \approx 0.608\, d_B^{-1/2}$; for Haar-random bulk states, $\mathbb{E}|S_A - S_B| \to \sqrt{2/\pi}\,/(d_M\, d_B^{3/2})$. Both exponents and prefactors are exact asymptotics. The integer exponent gap of $1$ between the two classes reflects exactly one power of $d_B$ per level of structural regularity in the bulk marginal. We verify the structural identity and both scaling theorems against full-simulation data at multiple independent levels, including out-of-sample tests at sub-$\sigma$ precision.

A PLAIN-LANGUAGE SUMMARY

Two observers look at the same quantum object through the same noisy lens, and disagree about what they see. The paper makes this disagreement precise: it has structure, the structure is computable, and the structure depends in a specific way on the complexity of the object being observed. For a simple object (a product state, with no internal entanglement) the two observers disagree by an amount that shrinks as one over the square root of the observer's size. For a complicated object (a maximally entangled state) they disagree by an amount that shrinks much faster, as one over the size to the three-halves power. The gap between those two scalings is exactly one, not approximately one. Integer-valued gaps in physical scaling laws tend to mean something is being counted, even when we cannot yet say what. This paper proves the structural identity that makes both scalings clean, derives the two prefactors analytically with no fitting, verifies them numerically to sub-statistical-noise precision, and leaves the analytic origin of the integer as an open question that is one of the more interesting things we now know we do not know.

THE FIVE RESULTS

Each card states the result, summarises it in plain language, and points at the section of the paper where it is proved and the numerical evidence that supports it.

I.
THE STRUCTURAL IDENTITY · THEOREM 3.2

The structural identity

$$\mathbb{E}_V[\rho_{R_A}] \;=\; \rho_A^{\mathrm{bulk}} + O(1/d^2)$$

For any non-isometric holographic code, the expected entropy disagreement between two observers decomposes as a product of a state-class prefactor and a universal scaling function of the dimensions.

§3 OF THE PAPER·VERIFIED ACROSS 18 DIAGONAL ENTRIES READ THE FULL CARD →
II.
PRODUCT-CLASS SCALING · THEOREM 4.2

Product class scaling

$$\mathbb{E}|S_A - S_B| \;=\; \sqrt{\tfrac{4(\pi^2/3 - 3)}{\pi}}\, d_B^{-1/2}\,(1+o(1)) \;\approx\; 0.6076\, d_B^{-1/2}$$

For bulk states drawn from the product class, entropy disagreement scales as 0.798 times d_B to the negative one-half power. The prefactor is analytic, not fit to data. Simulations match to under half a standard deviation at every test point.

§4 OF THE PAPER·EXPONENT EXACT · PREFACTOR EXACT READ THE FULL CARD →
III.
HAAR-CLASS SCALING · THEOREM 5.2

Haar class scaling

$$\mathbb{E}|S_A - S_B| \;=\; \sqrt{\tfrac{2}{\pi}} \cdot \tfrac{1}{d_M\, d_B^{3/2}}\,(1+o(1)) \;\approx\; \tfrac{0.798}{d_M}\, d_B^{-3/2}$$

For bulk states drawn from the Haar class (uniformly random pure states), entropy disagreement scales as 0.608 times d_B to the negative three-halves power. The prefactor is analytic. This is the regime relevant to black hole interiors.

§5 OF THE PAPER·EXPONENT EXACT · PREFACTOR EXACT READ THE FULL CARD →
IV.
THE INTEGER EXPONENT GAP HEADLINE

The integer exponent gap

$$\alpha_P - \alpha_H \;=\; \big(-\tfrac{1}{2}\big) - \big(-\tfrac{3}{2}\big) \;=\; 1 \quad \text{exactly.}$$

The difference between the product-class exponent (negative one-half) and the Haar-class exponent (negative three-halves) is exactly 1. This integer gap is robust across variations in observer size, bulk dimension, and encoding family.

§6 OF THE PAPER·STABLE UNDER ALL DEFORMATIONS TESTED READ THE FULL CARD →
V.
HAAR SUBLEADING STRUCTURE EMPIRICAL · OPEN

Haar subleading structure

$$\frac{\mathbb{E}|S_A - S_B|}{(\sqrt{2/\pi}/d_M) \cdot d_B^{-3/2}} \;=\; 1 - \frac{1.1331}{d_B} + \frac{4.6538}{d_B^2} + O(1/d_B^3)$$

Beyond the leading Haar-class scaling, the entropy disagreement exhibits subleading structure that fits numerical data well but for which no analytic derivation yet exists. Included honestly as Open Problem 3.

§7 OF THE PAPER·EMPIRICAL FIT · ANALYTIC FORM OPEN READ THE FULL CARD →

METHODS, IN BRIEF

I · THE FRAMEWORK

The AEHPV non-isometric code $V: \mathcal{H}_{\mathrm{eff}} \to \mathcal{H}_{\mathrm{fund}}$ with Haar-distributed $V$, combined with the HUZ cloning rule for including two observers. The structural identity is established by direct Haar-measure integration over $V$ at leading order in $1/d_{\mathrm{eff}}$.

II · THE SPECIALISATION

Theorems II and III follow from the master identity by computing the variance of the Shannon entropy of the bulk-marginal diagonal in each state class. The product case reduces to a Dirichlet-distribution moment; the Haar case to a Gaussian-limit Isserlis identity over near-uniform amplitudes.

III · THE VERIFICATION

Both scaling laws are verified against full-simulation data at four independent levels: the structural identity at the diagonal-entry level, the Dirichlet-variance asymptote, the prefactor convergence at large $d_B$, and end-to-end comparison. Out-of-sample tests at $d_B$ values not used in any calibration pass at sub-$\sigma$ precision.

IV · THE REPRODUCIBILITY

Every CSV in the paper is reproduced bit-identically from the seeds specified in Appendix B. The computational backend (von Neumann algebra machinery, crossed-product construction, trace operations) is documented in §3.1 and posted as open source. Anyone with the repository and Python 3.11 can reproduce every numerical claim.

CODE & DATA

The verified computational backend supporting every numerical claim in the paper.

vnalgebra.pyVN algebra machinery
crossed_product.pycrossed-product construction
trace_on_crossed.pycanonical trace
phase1_rules_canonical.pyHUZ & Colorado port
phase2_huz_verification.pyHUZ inner-product scaling
phase2_exponents.csvmoney-plot data

VERSION HISTORY

v1.0 Initial submission to arXiv. 39 pages, 38 references, 3 figures, 2 appendices. MAY 11 · 2026
PENDING arXiv moderation queue. Endorsement received. Number assigned upon clearance, typically 24 to 72 hours. IN FLIGHT
FORTHCOMING Journal submission (JHEP target) after community response window. SUMMER · 2026

HOW TO CITE

Cagle, A.R., 2026. Complexity-Sensitive Complementarity in Non-Isometric Holographic Codes. arXiv:26XX.XXXXX. With Claude (Anthropic) as computational collaborator.
BIBTEX
@article{cagle2026complexity, author = {Cagle, Adam R.}, title = {{Complexity-Sensitive Complementarity in Non-Isometric Holographic Codes}}, journal = {arXiv preprint}, number = {26XX.XXXXX}, year = {2026}, note = {With Claude (Anthropic) as computational collaborator} }