Harlow TASI 2017: Entanglement Wedge Reconstruction, Quantum RT and JLMS are EquivalentResearch Paper
Motivation
In the AdS/CFT correspondence a quantum theory of gravity in an asymptotically anti-de Sitter spacetime is equivalent to a conformal field theory on its boundary. A central question is how local bulk physics is encoded in the boundary theory, and in particular which bulk region is described by a given boundary subregion R. Harlow's TASI 2017 lectures (arXiv:1802.01040) review the answer that emerged from quantum error correction: the boundary Hilbert space is a code, bulk effective field theory lives in a code subspace, and the boundary subregion R can reconstruct every bulk operator in its entanglement wedge. The lectures state as their main technical target the theorem that this entanglement wedge reconstruction, the quantum Ryu–Takayanagi (RT) formula with a central area operator, and the JLMS formula (equality of boundary and bulk relative entropies) are mathematically equivalent. All of these statements are finite-dimensional linear algebra, which makes them formalizable now.
Timeline. Almheiri, Dong and Harlow proposed the quantum-error-correction interpretation of AdS/CFT in 2014 (arXiv:1411.7041). Jafferis, Lewkowycz, Maldacena and Suh derived the JLMS relation in 2015 (arXiv:1512.06431), and Dong, Harlow and Wall established the implications between JLMS and reconstruction for factors in 2016 (arXiv:1601.05416). Harlow proved the general three-way equivalence for arbitrary finite-dimensional von Neumann algebras in 2016 (arXiv:1607.03901, Comm. Math. Phys. 2017). The TASI lectures (2017, published 2018) present this theorem as Theorem 5.2.
Setting
All Hilbert spaces are finite-dimensional. The boundary space factorizes as H=HR⊗HR. A code subspaceHcode⊆H is described by an isometry V whose columns ∣i~⟩ are an orthonormal basis of Hcode. An operator OR on HRrepresents a logical operator O~ if OR∣ψ~⟩=O~∣ψ~⟩ and OR†∣ψ~⟩=O~†∣ψ~⟩ for every code state.
A von Neumann algebraM on Hcode is a set of operators closed under sums, products and adjoints and containing all multiples of the identity; M′ is its commutant and ZM=M∩M′ its center. Every such M is block diagonal, Hcode=⨁αHrα⊗Hrα with M=⨁αL(Hrα)⊗Irα. For a state ρ~ with diagonal blocks pαρ~rαrα, the algebraic entropy is S(ρ~,M)=−∑αpαlogpα+∑αpαS(ρ~rα), and the algebraic relative entropyS(ρ~∣σ~,M) is defined analogously (eqs. (5.16), (5.18)).
For Hcode⊆HR⊗HR and a von Neumann algebra M on Hcode, the following are equivalent:
(1) every O~∈M is represented on R and every O~′∈M′ on R;(2) ∃LR∈ZM:S(ρ~R)=Tr(ρ~LR)+S(ρ~,M),S(ρ~R)=Tr(ρ~LR)+S(ρ~,M′)∀ρ~;(3) S(ρ~R∣σ~R)=S(ρ~∣σ~,M),S(ρ~R∣σ~R)=S(ρ~∣σ~,M′)∀ρ~,σ~.
Milestones
Theorem 4.1: four equivalent characterizations of a correctable erasure of R (operator reconstruction on R; PXRP=λP; decoupling of a reference system from R; the explicit encoding ∣i~⟩=UR(∣i⟩R1∣χ⟩R2R)).
Eq. (4.25): the quantum Singleton bound m≥2n+k for codes whose accessibility depends only on the number of qudits.
Theorem 5.1: every von Neumann algebra on a finite-dimensional Hilbert space is a block-diagonal direct sum of factors, with the matching descriptions of M′ and ZM.
Significance
Theorem 5.2 turns three separately motivated features of holography into a single mathematical statement. Since the RT formula is independently derived from the gravitational path integral, the theorem implies subregion duality in the entanglement wedge; it also shows that a non-trivial area operator requires an algebra with non-trivial center. Theorem 4.1 is the subsystem-code special case, and Theorem 5.1 is the structure result that gives the algebraic entropies their meaning.
The results are proved in the literature (Harlow 2017 for Theorem 5.2; Theorems 4.1 and 5.1 are standard), but the lectures state Theorem 5.2 without proof, and none of these statements has a machine-checked proof that this mission is aware of. The mission produces formal statements and, eventually, formal proofs of the finite-dimensional structure theory of operator-algebra quantum error correction.
Difficulty
The three conditions live at different levels: (1) is a statement about operators, (2) about von Neumann entropies of single states, and (3) about relative entropies of pairs of states. Passing between them requires control of the full block structure of M relative to the bipartition RR, not only of a single factor, and the classical term ∑αpαlog(pα/qα) of (5.18) couples different blocks, so the general case does not reduce to the factor case treated earlier in the literature. Relative entropies can be infinite (when supports are not nested), so the equalities in (3) are equalities of extended reals and every argument must remain valid at +∞.
Formalization scope
Hilbert spaces are coordinate spaces Cι for finite index types, operators are complex matrices, tensor products are Kronecker products, and Hcode is the image of an isometry V (an operator OR acts on code states as OR⊗IR applied to V). States are density matrices (positive semidefinite, trace one). Von Neumann entropy and relative entropy are defined from eigen-decompositions; relative entropy takes values in the extended reals. A von Neumann algebra is a ∗-subalgebra of matrices; the algebraic entropies are computed in a block decomposition U of M, which every statement takes as an arbitrary decomposition realizing M (the value does not depend on the choice). The RT identity is stated as an equality of complex numbers. Theorem 4.1 assumes a nonzero code subspace; the Singleton bound assumes d≥2 and k≥1; both conditions are implicit in the lectures and are needed for the statements to be true.
A trivializing reading is excluded: the hypotheses of every statement are satisfiable, and the goal is a full equivalence of three non-trivial conditions rather than any single implication.
Useful reusable infrastructure: partial traces and their interaction with Kronecker products, entropies of block-diagonal states, relative entropy (Klein's inequality and its equality case), and the structure theory of finite-dimensional ∗-algebras of matrices. Contributions of proofs of the individual implications (1)⇒(2), (2)⇒(3), (3)⇒(1) as sketches are welcome.
D. Harlow, The Ryu–Takayanagi Formula from Quantum Error Correction, Comm. Math. Phys. 354 (2017) 865–912. https://arxiv.org/abs/1607.03901
A. Almheiri, X. Dong, D. Harlow, Bulk Locality and Quantum Error Correction in AdS/CFT, JHEP 04 (2015) 163. https://arxiv.org/abs/1411.7041
D. Jafferis, A. Lewkowycz, J. Maldacena, S. J. Suh, Relative entropy equals bulk relative entropy, JHEP 06 (2016) 004. https://arxiv.org/abs/1512.06431
X. Dong, D. Harlow, A. C. Wall, Reconstruction of Bulk Operators within the Entanglement Wedge in Gauge-Gravity Duality, Phys. Rev. Lett. 117 (2016) 021601. https://arxiv.org/abs/1601.05416
Oreshkov–Costa–Brukner 2012: Quantum Correlations with No Causal OrderResearch Paper
Motivation
In ordinary quantum mechanics, and in quantum field theory on a fixed spacetime, events happen in a definite causal order: an operation either precedes another, follows it, or the two are spacelike separated. Attempts to combine quantum theory with general relativity call this assumption into question. In general relativity the causal structure is dynamical, and a quantum theory of gravity may allow it to be indefinite. Oreshkov, Costa and Brukner (Nat. Commun. 3, 1092 (2012), arXiv:1105.4464) turned this question into a precise mathematical one. They assume that quantum mechanics holds locally in each laboratory and make no assumption about any global causal order. Within that framework they ask which correlations between two laboratories are possible. They find correlations that no definite causal order can produce: these correlations violate a causal inequality, which every causally ordered scenario satisfies.
Timeline.
2005: Hardy proposes probabilistic theories with dynamic causal structure as a framework for quantum gravity (arXiv:gr-qc/0509120).
2009: Chiribella, D'Ariano and Perinotti introduce quantum combs, which describe quantum networks with a fixed causal order (Phys. Rev. A 80, 022339). Chiribella, D'Ariano, Perinotti and Valiron introduce the quantum switch, a superposition of gate orders (arXiv:0912.0195, Phys. Rev. A 88, 022318 (2013)).
2012: Oreshkov, Costa and Brukner define process matrices and the causal inequality psucc≤3/4. They exhibit a four-qubit process matrix reaching psucc=(2+2)/4, and show that classical processes are always causally separable.
2015–2016: Araújo et al. introduce witnesses of causal nonseparability (arXiv:1506.03776). Branciard et al. classify the simplest causal inequalities and their quantum violations (arXiv:1508.01704). Oreshkov and Giarmatzi extend causal separability to more parties (arXiv:1506.05449). Procopio et al. realize the quantum switch with photons (arXiv:1412.4006).
Setting
Alice's laboratory has an input systemA1 and an output systemA2, and Bob's has B1 and B2. All four are finite-dimensional, with dimensions dA1,dA2,dB1,dB2, and operators on A1A2B1B2 are complex matrices indexed by (a1×a2)×(b1×b2).
A local operation of Alice is described by its Choi–Jamiołkowski (CJ) matrixMA1A2. The operation is a completely positive trace-preserving (CPTP) map exactly when
MA1A2≥0,TrA2MA1A2=1A1.
A process matrix is a matrix WA1A2B1B2 satisfying
W≥0,Tr[W(MA1A2⊗MB1B2)]=1 for all CJ matrices of CPTP maps
(Eqs. (4)–(5) of the source). The probability of a pair of local outcomes is P=Tr[W(MA1A2⊗MB1B2)] (Eq. (3)).
The task (Eq. (1)). Alice, Bob and a second bit for Bob receive independent uniform bits a, b and b′. Alice uses an instrument {MA(x∣a)}x to produce a guess x, and Bob uses {MB(y∣b,b′)}y to produce a guess y. If b′=0 Bob must communicate b to Alice, and if b′=1 Alice must communicate a to Bob:
psucc=21[P(x=b∣b′=0)+P(y=a∣b′=1)].
Causal separability (Eq. (6)). A process matrix of the form 1A2⊗WA1B1B2 allows no signalling from Alice to Bob, written A⪯B. One of the form 1B2⊗WA1A2B1 allows none from Bob to Alice. W is causally separable if W=qWB⪯A+(1−q)WA⪯B for some 0≤q≤1.
Formalization targets
Goal: violation of the causal inequality
∃W,{MA(x∣a)},{MB(y∣b,b′)} on four qubits:W is a process matrix and psucc>43.
The goal states only that a violation exists, with no hard-coded value. The specific value (2+2)/4 is a milestone.
Milestones (in source order)
Eq. (2): every causally separable W satisfies psucc≤3/4, for every choice of local instruments and in every finite dimension.
Eq. (7): the four-qubit matrix
W=41[1+21(σzA2σzB1+σzA1σxB1σzB2)]
is a process matrix.
3. Eq. (8): with the instruments of Eqs. (20)–(23), this W gives psucc=(2+2)/4, for every state ρB2 that Bob may prepare.
4. p. 5: the matrix of Eq. (7) is not causally separable.
5. Appendix F: every process matrix that is diagonal in a product basis (a classical process) is causally separable.
6. Appendix C, Fig. 3: for Hermitian W, the normalization condition (5) holds if and only if TrW=dA2dB2 and W has no Hilbert–Schmidt component of type A2, B2, A1A2, B1B2, A2B2, A1A2B2, A2B1B2 or A1A2B1B2.
7. Appendix E, Eq. (26):P(y∣a,b,b′=1)=21[1+(−1)y+a/2], and P(x=b∣b′=0)=(2+2)/4.
Significance
The result. Milestones 1 and 3 together show that quantum mechanics, applied locally in each laboratory, does not by itself imply a definite causal order. The causal inequality is a device-independent test of causal order, analogous to a Bell inequality for local realism. Milestone 5 shows that indefinite causal order disappears in the classical limit, and the source reads this as a hint that spacetime causal structure may emerge in a quantum-to-classical transition. The process-matrix framework has since become standard for indefinite causal order. Milestone 6 is the characterization that later work on witnesses and causal inequalities relies on.
Formalizing it. All seven milestones and the goal are proved in the source; none are open mathematics. This mission produces machine-checked versions in a common vocabulary: process matrices, CJ instruments, causal separability and Hilbert–Schmidt type analysis. That vocabulary can be reused for later results such as witnesses of causal nonseparability, multipartite causal separability and the quantum switch.
Status honesty. The formal statements are about matrices. Whether causal-inequality violations can occur in nature is not settled. Laboratory realizations of the quantum switch certify causal nonseparability with witnesses, not with a causal-inequality violation, and the source leaves open whether (2+2)/4 is the largest possible violation.
Difficulty
The violation itself (milestones 2, 3 and 7) is finite linear algebra on 16×16 matrices, but the irrational entries 1/2 rule out a purely computational check. Positivity of W is the nontrivial part of milestone 2. The two Pauli strings in W anticommute, which fixes its spectrum, but this has to be turned into a positive-semidefiniteness proof.
Milestone 1 needs more than inspecting the definitions. The bound has to be shown for each no-signalling form separately and then carried through convex mixtures, with instruments of arbitrary dimension.
Milestone 4 is a non-existence statement over all decompositions. A direct search is hopeless; it follows from milestones 1 and 3.
Milestone 5 (Appendix F) is the deepest: it builds the two positive parts of the decomposition by an eigenvalue-shifting procedure.
Milestone 6 needs orthogonality computations with arbitrary Hilbert–Schmidt bases on four tensor factors.
Formalization scope
Representation. Finite index types, complex matrices, and Mathlib's Kronecker product ⊗ₖ with tensor order (A1×A2)×(B1×B2). Local operations are represented directly by their CJ matrices, so the transpose in the source's CJ convention never enters the statements. Bits are Bool (false ↦ 0). Probabilities are real parts of traces, which are real whenever all inputs are positive semidefinite.
Definitions. These live in OCB2012_defs: partial trace ptrace₂, IsCPTP_CJ, IsProcessMatrix, prob, IsAliceInstrument, IsBobInstrument, pSucc, the no-signalling forms, IsCausallySeparable, the Pauli matrices, W7, the instruments ξ and η, the structure HSBasis and the predicate AllowedType. Density matrices come from the published PeresTerno.IsDensityMatrix.
Hilbert–Schmidt bases. Milestone 6 quantifies over every basis satisfying the source's conditions: σ0=1, Hermitian, traceless, and Trσμσν=dδμν. Hermiticity matches the source's use of real coefficients.
Not trivial. Instruments range only over positive semidefinite CJ matrices whose outcome sum is CPTP. The goal, milestones 2–4 and milestone 7 are stated on qubits, so no hypothesis can be vacuous.
Out of scope. The source's derivation of Eq. (2) in Appendix A uses events in a partially ordered causal structure and a free-choice assumption, and it has no faithful matrix-level counterpart. Milestone 1 is the process-matrix form of the bound, which the source applies on p. 4. The closed-timelike-curve model of Appendix D is not formalized.
Contributions welcome. Reusable lemmas on partial traces of Kronecker products, positive semidefiniteness of Pauli-string combinations, and expansions in Hilbert–Schmidt bases.
L. Hardy, Probability theories with dynamic causal structure: a new framework for quantum gravity (2005). arXiv:gr-qc/0509120
G. Chiribella, G. M. D'Ariano, P. Perinotti, Theoretical framework for quantum networks, Phys. Rev. A 80, 022339 (2009). arXiv:0904.4483
G. Chiribella, G. M. D'Ariano, P. Perinotti, B. Valiron, Quantum computations without definite causal structure, Phys. Rev. A 88, 022318 (2013). arXiv:0912.0195
M. Araújo, C. Branciard, F. Costa, A. Feix, C. Giarmatzi, Č. Brukner, Witnessing causal nonseparability, New J. Phys. 17, 102001 (2015). arXiv:1506.03776
C. Branciard, M. Araújo, A. Feix, F. Costa, Č. Brukner, The simplest causal inequalities and their violation, New J. Phys. 18, 013008 (2016). arXiv:1508.01704
O. Oreshkov, C. Giarmatzi, Causal and causally separable processes, New J. Phys. 18, 093020 (2016). arXiv:1506.05449
L. M. Procopio et al., Experimental superposition of orders of quantum gates, Nat. Commun. 6, 7913 (2015). arXiv:1412.4006
Wheeler–DeWitt Equation: Superspace, Semiclassical Limit and Lattice Constraint AlgebraResearch Paper
Motivation
The Wheeler–DeWitt equation is the quantum version of the Hamiltonian constraint of general relativity. In the canonical formulation, a spacetime is described by the evolution of the metric hab of a spatial slice, and Einstein's equations include a constraint: the Hamiltonian density vanishes at every point of space. Quantizing this constraint, as DeWitt did (Phys. Rev. 160, 1967), gives a second-order functional differential equation for a wavefunctional Ψ[h] with no external time parameter.
Three structural facts make the equation distinctive:
its kinetic term is built from an indefinite metric on the space of metrics, the DeWitt supermetric, so the equation is hyperbolic;
the timelike direction of that supermetric is the local volume, which serves as an intrinsic time;
in the limit ℏ→0, a WKB ansatz turns the equation into the Einstein–Hamilton–Jacobi equation, recovering classical general relativity.
A fourth issue is not settled: consistency. In the continuum, the Poisson bracket of two Hamiltonian constraints is a combination of the momentum constraints, so imposing all constraints is consistent (Dirac's first-class condition). Any regularization of the quantum equation, a lattice for instance, must reproduce this. Generic lattice discretizations do not: the constraints become second class (Bander 1987; Dittrich 2008; Bahr–Dittrich 2009). Whether, and with which anomaly, the Hamiltonian-constraint commutators close as the lattice is refined was singled out as an open question by Loll (Living Rev. Rel. 1998, §2.12).
The first three facts are the standard entry points of quantum geometrodynamics, as reviewed by Kiefer (arXiv 0812.0295): Section 2 for the constraints and their quantization, eqs. (3)–(8), and Section 3 for the Hamilton–Jacobi equation, eq. (10), and the semiclassical approximation, eq. (11).
Setting
A spatial metric at a point is a symmetric positive-definite 3×3 matrix h=(hab). Write h=deth. The DeWitt supermetric is
Gabcd(h)=2hhachbd+hadhbc−habhcd.
It is a quadratic form G(p,p)=Gabcdpabpcd on symmetric momenta. Its inverse Gabcd=21h(hachbd+hadhbc−2habhcd) acts on velocities.
Space is represented by a finite set X of sites; this is a lattice regularization. A configuration assigns to each site x a matrix h(x). All nine entries are coordinates, so configuration space is R9∣X∣, and physical configurations are those that are symmetric and positive definite at every site. A wavefunction is a function Ψ from configurations to C. The functional derivative δ/δhab(x) is the partial derivative ∂ab(x) with respect to the coordinate hab(x), with the cell volume normalized to one.
The Wheeler–DeWitt operator at site x, with gravitational coupling κ, cosmological constant Λ, and a supplied potential R(h,x) playing the role of the spatial scalar curvature, is
Write Vz(h)=−2κh(z)(R(h,z)−2Λ) for the potential at site z. On the classical phase space of pairs (h,p), with pab(z) conjugate to hab(z), the lattice constraints are
Hz(h,p)=2κGabcd(h(z))pab(z)pcd(z)+Vz(h),
with the canonical Poisson bracket. They are first class if each bracket {Hx,Hy} vanishes wherever all constraints vanish.
The supermetric stands to the left of both derivatives (Kiefer, eq. (7), vacuum case; the coupling is κ=8πG, so 2κ=16πG as in Kiefer's eq. (10)). The kinetic term involves only derivatives at the same site, as in the continuum; it is ultralocal. The potential may couple neighbouring sites.
Formalization targets
Milestones: geometry of the supermetric
Signature.G(p,p)>0 for every nonzero symmetric p with tr(hp)=0, and G(h−1,h−1)<0.
Inverse.GabcdGcdefpef=pab for symmetric p.
Intrinsic time. With h=sh^, deth^=1 and τ=32/3s3/4, the velocity form of the supermetric is −dτ2+323τ2tr((h^−1dh^)2).
The ℏ-independent part is the Einstein–Hamilton–Jacobi functional of Kiefer's eq. (10), Hamiltonian part, with S the eikonal of the WKB form (11) (amplitude C=1). This is the weakest statement exhibiting the classical limit, and it holds for every potential.
If every Vz depends only on h(z), then {Hx,Hy}=0 identically.
Goal: lattice constraints are second class
If the symmetric part of ∂Vy/∂hab(x) is nonzero at a physical h, for some x=y, then there is a point of the constraint surface over h at which {Hx,Hy}=0.
Every finite-difference curvature couples neighbouring sites, so the goal applies to every such discretization. It is the weakest statement that the discretized constraint algebra is inconsistent, and it holds uniformly in the discretization.
Stronger targets
The limit form ℏ→0, as a Tendsto statement.
The same results with the Laplace–Beltrami ordering of the kinetic term on the six-dimensional fibre of symmetric matrices, and an explicit formula for the difference between the two orderings.
A potential realized as the scalar curvature of a smooth metric field on a coordinate patch, computed from Christoffel symbols, with its scaling law R[sh]=R[h]/s for constant s>0.
The momentum constraints (Kiefer, eq. (8)).
Open as far as the drafter could determine. Fix a cubic lattice of spacing ε and a standard finite-difference scalar curvature. Determine the limit ε→0 of the suitably rescaled commutator [Hx,Hy], and decide whether it reproduces the continuum Dirac algebra {H(x),H(y)}=(habHb(x)+habHb(y))∂aδ(x,y) or leaves an anomaly. Give the anomaly explicitly if there is one. This is the metric-variable analogue of the question Loll raised.
Significance
The signature theorem is the mathematical content behind two physical facts: the hyperbolic character of the Wheeler–DeWitt equation, and the instability of the conformal mode (the "conformal factor problem" of Euclidean quantum gravity). DeWitt's cone form identifies the local volume as an intrinsic clock. On this rests the reading of the equation as a wave equation in superspace, with τ as time. The conformal-sector reduction shows explicitly how the timelike direction appears in the operator, with the sign opposite to the traceless modes. The WKB identity is the precise sense in which the quantum constraint contains classical general relativity: its leading order is the Hamilton–Jacobi form of the Einstein constraint (Peres 1962; Kiefer, eq. (10)), and its next order is the one used in derivations of the Schrödinger equation from quantum gravity.
All of these are classical computations. The drafter knows of no machine-checked version. A formalization fixes conventions that the literature handles loosely:
the normalization of Gabcd;
the treatment of symmetric versus independent metric components;
the ordering of operators.
It does so with genuine derivatives in place of formal symbols.
The constraint-algebra part turns a phenomenon described qualitatively in the literature into a theorem with exact hypotheses. Lattice constraints are second class as soon as curvature couples sites, and the quantum commutator is given in closed form. It also isolates precisely what a consistent discretization would have to cancel. The continuum-limit target addresses an open question in canonical quantum gravity.
Difficulty
The supermetric statements are finite-dimensional, but none is a single computation. The signature requires a positivity argument for tr((h1/2ph1/2)2) on an h-traceless subspace. The cone form requires separating the trace part of a velocity in a non-orthonormal frame.
The analytic targets require second derivatives of compositions through the determinant and the matrix inverse. The derivative of det at h in the direction of a single entry is deth(h−1)ba, and the derivative of h−1 produces terms like h−1Eabh−1; a sign or index slip changes the constant 7. Treating the nine entries as independent coordinates, rather than the six symmetric ones, changes the numerical coefficients; the conventions below fix this.
For the constraint algebra, the quantum commutator involves up to fourth derivatives of Ψ, which cancel only by the symmetry of mixed partials. The classical goal needs a point on the constraint surface where the bracket is nonzero. Each constraint fixes the value of an indefinite quadratic form in the momenta, and the bracket is linear in them, so the proof must use the Lorentzian signature to show that the bracket is not constant on that quadric.
A naive formalization that replaces ∂ab by an abstract linear map reduces every target to ring arithmetic, and is ruled out by the definitions.
Formalization scope
Definitions (module Def_WheelerDeWittSuperspace):
metric components as Fin 3 → Fin 3 → ℝ, so that configuration space X → Fin 3 → Fin 3 → ℝ with X a Fintype is a normed space;
matrices via Matrix.of;
∂ab(x) as fderiv ℝ Ψ h applied to the coordinate direction of hab(x);
h as Real.sqrt of the determinant;
the operator with the supermetric on the left.
Conventions:
all nine metric entries are independent coordinates, and statements that need symmetry assume it at the evaluation point (Matrix.PosDef includes symmetry);
lattice cell volume equal to 1;
vacuum (no matter term).
Not formalized; the potential is an interface: the potential R is supplied data on configurations and sites, and every target holds for all such R. The continuum limit of the lattice, a Hilbert-space domain for H, regularization of coincident derivatives in the continuum, and existence of solutions are outside the mission and must not be inferred from it.
Trivial cases to rule out:
the WKB milestone must hold for every C2 phase S, not only for Ψ=0 or constant S;
the goal must exhibit a point on the full constraint surface, with every Hz vanishing, not merely a point where the bracket is nonzero;
the dependence hypothesis is on the symmetric part, because antisymmetric metric directions are invisible to G.
Phase-space convention: the bracket is the canonical one on all nine components per site. The symmetric reduction changes off-diagonal normalizations but not the first-class property.
Welcome contributions: the stronger targets, a matter field with its energy density, and minisuperspace reductions (e.g. homogeneous isotropic metrics h=a2δ) derived from the operator here rather than postulated.
R. Loll, Discrete approaches to quantum gravity in four dimensions, Living Rev. Relativ. 1 (1998), 13, Section 2.12. https://arxiv.org/abs/gr-qc/9805049
R. Loll, On the diffeomorphism-commutators of lattice quantum gravity, Class. Quantum Grav. 15 (1998), 799–809. https://arxiv.org/abs/gr-qc/9708025
P. Renteln, Some results of SU(2) spinorial lattice gravity, Class. Quantum Grav. 7 (1990), 493–502.
A holographic proof of the strong subadditivity of entanglement entropy: Holographic Entropy Satisfies S(A)+S(B)≥S(A∪B)+S(A∩B) and S(A)+S(B)≥S(A∖B)+S(B∖A)Research Paper
Motivation
For a quantum system split into parts, the entanglement entropyS(A) of a region A is the von Neumann entropy of the reduced density matrix of A. Every such entropy obeys strong subadditivity (Lieb–Ruskai, 1973): for regions A and B,
S(A)+S(B)≥S(A∪B)+S(A∩B),S(A)+S(B)≥S(A∖B)+S(B∖A).
It is the basic structural inequality of quantum information theory, and any proposed formula for entanglement entropy must satisfy it.
In 2006 Ryu and Takayanagi proposed a geometric formula for the entanglement entropy of a quantum field theory that has a gravity dual in one more dimension: the entropy of a region A on the boundary is the area of the minimal bulk hypersurface ending on ∂A, divided by 4GN. Whether this formula obeys strong subadditivity was a consistency test of the proposal. Hirata and Takayanagi checked it in a range of examples; Headrick and Takayanagi (arXiv:0704.3719, 2007) gave a general argument by cutting and regluing minimal surfaces. This mission formalizes that argument's statement, at the generality the argument supports.
Timeline:
1973 — Lieb and Ruskai prove strong subadditivity of the von Neumann entropy.
2006 — Ryu and Takayanagi propose the holographic formula (hep-th/0603001); Fursaev derives it in the static case and adds the homology requirement.
2007 — Headrick and Takayanagi prove strong subadditivity for the static formula with the homology rule.
Setting
Fix a constant-time slice of a static bulk spacetime, cut off at a finite value of the holographic coordinate. In the formalization this is a topological space X, with a subset Γ⊆X, the conformal boundary (the cutoff surface) on which the field theory lives. A boundary region is a set A⊆Γ. The area of a hypersurface is given by a measure μ on X for which every open set is measurable; for a Riemannian slice it is a constant multiple of the (d−1)-dimensional Hausdorff measure.
A bulk region is a member of a class R of subsets of X. The surface ∂r of a region r is its topological frontier in X. Fursaev's homology rule requires the bulk hypersurface m for A to bound, together with A, a bulk region: ∂r=A∪m. In the formalization this is r∩Γ=A, and the surface charged is ∂r.
With G>0 Newton's constant, the holographic entanglement entropy is
S(A)=4G1inf{μ(∂r):r∈R,r∩Γ=A}∈[0,∞],
the Lean definition HolographicSSA.holographicEntropy Γ μ G 𝓡 A.
Formalization targets
Goal: both inequalities of (3.1)
For every X, Γ, μ, G>0, R and all A,B⊆X:
R closed under ∪,∩⟹S(A)+S(B)≥S(A∪B)+S(A∩B),R closed under ∖⟹S(A)+S(B)≥S(A∖B)+S(B∖A).
The two inequalities are also milestones on their own.
Milestones (in proof order)
Footnote 3, inclusion. For all r,s⊆X: ∂(r∪s)∪∂(r∩s)⊆∂r∪∂s and ∂(r∪s)∩∂(r∩s)⊆∂r∩∂s.
Footnote 3, area inequality.μ(∂(r∪s))+μ(∂(r∩s))≤μ(∂r)+μ(∂s).
The rearranged regions are competitors (p.6, with (3.2)–(3.3)). If r∩Γ=A, s∩Γ=B and r∪s∈R, then 4GS(A∪B)≤μ(∂(r∪s)); likewise for r∩s and A∩B.
(3.1), first inequality.
(3.1), second inequality.
Significance
The theorem says that the Ryu–Takayanagi prescription, with the homology rule, satisfies the defining inequality of entanglement entropy for every static bulk geometry, not only in computed examples. It was one of the early pieces of evidence that the formula is an entropy, and the cut-and-reglue technique it introduced is the template for later holographic entropy inequalities, such as the monogamy of mutual information (Hayden, Headrick, Maloney, 2011).
The result is proved in the paper, in a few lines and in the generic case. It has not been formalized. A formal version fixes what "region", "surface" and "area" have to mean for the argument to go through, separates the generic-case equality (3.4) from the inequality that actually holds, and supplies the second inequality, which the paper leaves as an exercise. The definition of the holographic entropy is reusable for other holographic inequalities stated in the same setting.
Difficulty
The informal proof says the surfaces of rA∪rB and rA∩rB are "simply rearrangements" of mA and mB, so their total area is the same. That equality is false without a genericity condition the paper does not define: two unit squares in the plane that touch along a side have perimeters 6+1<4+4. What holds is an inequality, and it needs more than the printed inclusion ∂(r∪s)∪∂(r∩s)⊆∂r∪∂s: a point counted on both new surfaces must lie on both old ones. The second inequality is not proved in the paper at all. Finally, the minima in (2.1) need not be attained, and entropies can be infinite, so the argument has to be run with infima in [0,∞] rather than with chosen minimal surfaces.
Formalization scope
Conventions committed to in Lean:
X is any topological space with [MeasurableSpace X] [OpensMeasurableSpace X]; Γ is any subset. No metric, Riemannian structure, compactness or finiteness of μ is assumed.
The surface of a region is frontier r in X (not the part off Γ). The homology rule is the equality r ∩ Γ = A.
The entropy is ENNReal.ofReal (1 / (4 * G)) * ⨅ r ∈ 𝓡, ⨅ (_ : r ∩ Γ = A), μ (frontier r) in ℝ≥0∞, with 0 < G; it is ∞ when no admissible region is homologous to A.
The closure hypotheses on R are separate: ∪ and ∩ for the first inequality, ∖ for the second.
A and B are arbitrary subsets of X; outside Γ the entropy is ∞.
Trivializing encodings are ruled out: charging only frontier r \ Γ, or relaxing the homology rule to an inclusion, makes S≡0, and a vanishing constant does the same; the definition uses the full frontier, the equality and 0<G. Signed functionals, such as the Gauss–Bonnet corrected area (2.2), are not covered.
Infrastructure needed: frontier and closure algebra, additivity of measures on closed sets, and infimum manipulation in ℝ≥0∞, all in Mathlib. Proofs of the milestones, and alternative arguments for the second inequality, are welcome.
Selected references
M. Headrick, T. Takayanagi, A holographic proof of the strong subadditivity of entanglement entropy, arXiv:0704.3719v1, 2007; Phys. Rev. D 76, 106013 (2007). https://arxiv.org/abs/0704.3719
S. Ryu, T. Takayanagi, Holographic derivation of entanglement entropy from AdS/CFT, Phys. Rev. Lett. 96, 181602 (2006). https://arxiv.org/abs/hep-th/0603001
E. H. Lieb, M. B. Ruskai, Proof of the strong subadditivity of quantum-mechanical entropy, J. Math. Phys. 14, 1938 (1973). https://doi.org/10.1063/1.1666274
P. Hayden, M. Headrick, A. Maloney, Holographic mutual information is monogamous, Phys. Rev. D 87, 046003 (2013). https://arxiv.org/abs/1107.2940
Non-renormalizability of gravity from black-hole entropy (Shomer 2007)Research Paper
Motivation
Why is general relativity not a renormalizable quantum field theory? The textbook answer is perturbative: Newton's constant has negative mass dimension, so the gravitational coupling is irrelevant and loop divergences cannot be absorbed into finitely many counterterms. That argument can in principle be evaded (Weinberg's asymptotic safety). Shomer's note (arXiv:0709.3555), following Banks and Aharony–Banks, gives a non-perturbative, thermodynamic argument instead: the very-high-energy spectrum of any renormalizable d-dimensional QFT is that of a d-dimensional conformal field theory (CFT), whereas the high-energy spectrum of gravity is dominated by black holes, whose Bekenstein–Hawking entropy grows with energy in a way no CFT can match.
Setting
CFT side (Sec. IV, Eqs. 29–30). For a d-dimensional CFT on Rtime×Sd−1 (sphere radius R) at temperature T, dimensional analysis and extensivity give S=a(RT)d−1 and E=bRd−1Td with constants a,b>0. Eliminating T gives the entropy as a function of energy, SCFT(E)=a(R(E/(bRd−1))1/d)d−1∼E(d−1)/d.
Flat gravity (Sec. V.1, Eqs. 31–32). The d-dimensional Schwarzschild metric has f(r)=1−ωd−2GNM/rd−3 with ωn=16π/(nVol(Sn)). The horizon rH is the zero of f, and the Bekenstein–Hawking entropy is S=A/(4GN) with A=Vol(Sd−2)rHd−2, giving S∼M(d−2)/(d−3).
AdS gravity (Sec. V.2, Eqs. 33–34). With f(r)=1−ωd−2GNM/rd−3+r2/RAdS2 the horizon is the largest zero of f and S∼M(d−2)/(d−1) — the CFT law of one dimension lower (a shadow of AdS/CFT).
Formalization targets
Goal — black-hole entropy is not CFT entropy (flat space, Sec. V.1)
For every spacetime dimension d≥4, every GN>0 and every CFT datum a,b,R>0,
SBH(E)is notΘ(SCFT(E))as E→∞.
Here Θ means bounded above and below by positive multiples of each other for all large E; this is how the paper's "∼" is read.
Milestones
Eq. (29) (the elimination of T), Eq. (30), Eq. (32) exactly, footnote 26 (exponent comparison), Eq. (34) asymptotically, the AdS mismatch with a d-dimensional CFT, and the AdS match with a (d−1)-dimensional CFT.
Significance
The goal is the precise mathematical content of the paper's one-line argument: once the black-hole entropy formula and the CFT scaling law are fixed, their large-energy growth exponents (d−2)/(d−3)>1>(d−1)/d are incompatible. The physics inputs (that a renormalizable QFT flows to a CFT in the UV, that black holes dominate the gravitational density of states, the Bekenstein–Hawking formula) are modelling assumptions, encoded as definitions; the mission formalizes the asymptotic analysis that turns them into a contradiction, not the physics itself.
Difficulty
Mathematically elementary but fiddly: the horizon radius is defined implicitly as the largest positive zero of f, so one must solve f(rH)=0 (exactly in flat space, asymptotically in AdS, where rHd−3(1+rH2/RAdS2)=ωd−2GNM), handle real powers, and compare asymptotic classes with distinct exponents.
Formalization scope
All statements live in namespace GravityNonRenorm and import one definition file. The unit-sphere volume is the closed form Vol(Sn)=2π(n+1)/2/Γ((n+1)/2). Horizon radii are sSup of the set of positive zeros of f (junk value 0 when that set is empty, e.g. for M≤0); all claims are asymptotic as E→∞ or assume M>0, so the junk value is never used. Dimensions are natural numbers; d≥4 for flat-space statements, d≥3 for AdS, d≥2 for CFT statements.
Selected references
A. Shomer, A pedagogical explanation for the non-renormalizability of gravity, arXiv:0709.3555 (2007). https://arxiv.org/abs/0709.3555
O. Aharony and T. Banks, Note on the quantum mechanics of M theory, JHEP 9903:016 (1999), arXiv:hep-th/9812237.
Almheiri–Dong–Harlow 2015: Bulk Locality and Quantum Error Correction in AdS/CFTResearch Paper
Motivation
The AdS/CFT correspondence relates a theory of quantum gravity in anti-de Sitter space (the bulk) to a quantum field theory without gravity on its boundary (the CFT). A central question is how a local field operator ϕ(x) deep in the bulk is represented by boundary operators. Almheiri, Dong and Harlow (JHEP 04 (2015) 163) pointed out a puzzle.
The bulk operator can be reconstructed on several different boundary regions. For example, it can be reconstructed on A∪B, on B∪C or on A∪C, but not on any single one of them.
These reconstructions cannot all be the same CFT operator: an operator commuting with all local operators on a time slice must be trivial.
Their resolution is that the bulk effective theory is a quantum error-correcting code. Bulk operators are logical operators acting on a code subspace of the CFT Hilbert space. Different boundary representations agree only on that subspace, as one logical operator of an erasure-correcting code can be implemented on different subsets of qubits.
The mathematical backbone of that resolution is a finite-dimensional criterion for when a logical operator can be implemented on a given subsystem. This mission formalizes it (Appendix B of the paper), with the examples and corollaries of Section 3.
Timeline.
1996–1997: Schumacher and Nielsen characterize correctability by vanishing correlations with a reference system, condition (3.14) (arXiv:quant-ph/9604022). Grassl, Beth and Pellizzari give the matrix-element form (3.19) (arXiv:quant-ph/9610042).
1999: Cleve, Gottesman and Lo introduce the three-qutrit code as a quantum secret-sharing scheme (arXiv:quant-ph/9901025).
2006: Ryu and Takayanagi propose the holographic entanglement-entropy formula (arXiv:hep-th/0603001).
2007: Bény, Kempf and Kribs develop operator-algebra quantum error correction (arXiv:quant-ph/0608071, arXiv:0705.1574), of which the theorem here is a special case.
2014–2015: Almheiri, Dong and Harlow recast bulk reconstruction as quantum error correction; Pastawski, Yoshida, Harlow and Preskill build holographic tensor-network codes (arXiv:1503.06237).
2016: Dong, Harlow and Wall establish reconstruction in the entanglement wedge (arXiv:1601.05416). Harlow derives the Ryu–Takayanagi formula from operator-algebra error correction (arXiv:1607.03901).
Setting
The physical Hilbert space is a tensor product H=HE⊗HEˉ of finite-dimensional spaces. E is the part that may be erased (lost), and Eˉ is the part that remains. A code subspace is a subspace HC⊆H.
An operator Oacts within the code subspace if both O and O† map HC into itself. Such an operator has a representation on Eˉ if there is an operator OEˉ acting only on Eˉ, that is of the form 1E⊗Y, with
OEˉ∣ψ~⟩=O∣ψ~⟩,OEˉ†∣ψ~⟩=O†∣ψ~⟩for all ∣ψ~⟩∈HC.
Representations on E are defined in the same way, with operators X⊗1Eˉ.
The three-qutrit code (Section 3.1) encodes one qutrit into three via
∣~⟩=31∑a∈Z3∣a,a+i,a+2i⟩,
that is, ∣0~⟩=(∣000⟩+∣111⟩+∣222⟩)/3 and so on (Eq. (3.3)).
Formalization targets
Goal: the basic theorem of operator-algebra quantum error correction (Section 3.5, proof in Appendix B)
For an operator O acting within HC,
Ohas a representation on Eˉ⟺⟨ψ~′∣[O,XE⊗1Eˉ]∣ψ~⟩=0for all XE on E and all ∣ψ~⟩,∣ψ~′⟩∈HC.
Milestones (in source order)
Section 3.1 (after Eq. (3.3)): for every encoded three-qutrit state, the reduced density matrix of each single qutrit is 311.
Eqs. (3.4)–(3.6): the permutation U12 of Eq. (3.6) is unitary, and (U12⊗I3)∣~⟩=∣i⟩⊗31(∣00⟩+∣11⟩+∣22⟩).
Eqs. (3.9)–(3.10): for every single-qutrit operator O, the operator O12=U12†(O⊗1)U12, with O acting on the first qutrit, satisfies O12∣~⟩=∑jOji∣~⟩.
Section 3.2, Eqs. (3.19) ⟺ (3.21): the projection of every XE onto the code subspace is proportional to the identity iff every operator acting within the code subspace has a representation on Eˉ. The source states, citing the literature, that (3.19) is equivalent to correctability of the erasure of E; that equivalence is not formalized.
Section 3.5, two-qubit example: on the code spanned by (∣00⟩+∣11⟩)/2 and (∣01⟩+∣10⟩)/2, the logical X is realized by the bit flip of either qubit. No operator on the first qubit alone reproduces the logical Z on the code, and every logical operator realizable on the first qubit acts on the code as a1+bXˉ: the code corrects only the subalgebra generated by 1 and Xˉ.
Section 3.5, algebraic no-cloning: if O1 has a representation on Eˉ and O2 has a representation on E, then O1 and O2 commute on the code subspace. Consequently, the elements of any family of logical operators that is represented both on E and on Eˉ commute pairwise on the code subspace, so a non-abelian algebra cannot be represented on both.
Significance
The result. The goal theorem characterizes, by a checkable commutation condition, which logical operators survive the loss of E; milestone 4 is its specialization to full erasure correction. Milestone 6 explains why a non-commuting algebra of bulk operators cannot be represented on two complementary boundary regions at once, so reconstructions of ϕ(x) on different regions are distinct operators that agree only on the code subspace. The three-qutrit code models this: every logical operator is realized on any two qutrits, and no single qutrit carries information.
Formalizing it. All statements are proved in the source, or cited there from standard references, and are finite-dimensional. This mission produces machine-checked versions and a reusable vocabulary of code subspaces, logical operators and subsystem representations. That vocabulary is the starting point for formalizing the later results it underlies, in particular the subsystem and operator-algebra theorems of Harlow's derivation of the Ryu–Takayanagi formula (arXiv:1607.03901).
Status honesty. The mathematics is unconditional finite-dimensional linear algebra. The application to AdS/CFT rests on the conjectured duality and on bulk effective field theory, and is context only; none of it enters the hypotheses. The appendix proof is the authors' own, and the theorem is a special case of the results of Bény, Kempf and Kribs. The equivalence of (3.19) with correctability of the erasure (the existence of a recovery unitary, Eqs. (3.14)–(3.18)) is cited in the source from Schumacher–Nielsen and Grassl–Beth–Pellizzari, and is not part of this mission. No machine-checked proof of any of these statements is known. Neither Mathlib nor Physlib (including its quantum-information library) formalizes code subspaces, erasure correction or operator-algebra quantum error correction.
Difficulty
The forward direction of the goal is a direct computation. The converse is an existence statement: an operator OEˉ=1E⊗Y has to be produced from a hypothesis that constrains only the matrix elements of Obetween code states. That hypothesis says nothing about how O acts off the code subspace, and O generally acts nontrivially on E. So no candidate for Y can be read off from O itself.
Milestone 4 has the same character in both directions. One direction must produce a representation on Eˉ for every operator acting within the code subspace, starting from the scalar condition (3.19), which concerns operators on E alone. The other direction is a non-existence claim about operators on E, to be derived from a property quantified over all logical operators.
The explicit-code milestones are finite but involve the irrational normalization 1/3 and a 27-dimensional space.
Formalization scope
Representation. Vectors on HE⊗HEˉ are functions on e×eˉ for finite types e,eˉ, with E first. Operators are complex matrices, tensor products are Mathlib's Kronecker product ⊗ₖ, O† is the conjugate transpose, and ⟨w∣u⟩ is star w ⬝ᵥ u.
Code subspace. The code subspace is an arbitrary complex subspace (Submodule ℂ). It is described without a basis: "⟨~∣⋯∣~⟩=0 for all i,j" is stated for all pairs of code vectors, which is equivalent by sesquilinearity.
Proportionality. Eq. (3.19), ⟨~∣XE∣~⟩=δijC(X), is stated basis-free as ⟨w∣XEv⟩=c⟨w∣v⟩ for one constant c and all code vectors v,w.
Three-qutrit vectors. These are indexed by ((q1,q2),q3). U12 is the permutation matrix of the table in Eq. (3.6), and the single-qutrit reduced states are partial traces over the other two qutrits.
Not trivial. The goal quantifies over every code subspace and every operator acting within it. The zero subspace makes both sides true and is harmless. The examples are fixed concrete codes.
Not formalized. Cited but not proved in the source: (3.14) with the recovery unitary (3.16)–(3.18), and the bound (3.25). Heuristic: the count (3.22) and the Page-theorem argument after it. Definitions only: quantum secret sharing (Section 3.3), (3.23) and (3.24). Immediate or by symmetry: (3.20), recovery from qutrits 2,3 or 1,3, and the ∗-subalgebra remark after the theorem. Out of scope: Sections 4–5 (the AdS/CFT model, backreaction).
Infrastructure. A complete development needs lemmas on Kronecker products acting on vectors ((A ⊗ₖ B) *ᵥ v), conjugate transposes of Kronecker products, orthogonal projection onto a Submodule, and partial traces. These are reusable; stand-alone contributions are welcome.
Selected references
A. Almheiri, X. Dong, D. Harlow, Bulk locality and quantum error correction in AdS/CFT, JHEP 04 (2015) 163. arXiv:1411.7041
C. Bény, A. Kempf, D. W. Kribs, Generalization of quantum error correction via the Heisenberg picture, Phys. Rev. Lett. 98, 100502 (2007). arXiv:quant-ph/0608071
C. Bény, A. Kempf, D. W. Kribs, Quantum error correction of observables, Phys. Rev. A 76, 042303 (2007). arXiv:0705.1574
B. Schumacher, M. A. Nielsen, Quantum data processing and error correction, Phys. Rev. A 54, 2629 (1996). arXiv:quant-ph/9604022
M. Grassl, T. Beth, T. Pellizzari, Codes for the quantum erasure channel, Phys. Rev. A 56, 33 (1997). arXiv:quant-ph/9610042
R. Cleve, D. Gottesman, H.-K. Lo, How to share a quantum secret, Phys. Rev. Lett. 83, 648 (1999). arXiv:quant-ph/9901025
S. Ryu, T. Takayanagi, Holographic derivation of entanglement entropy from AdS/CFT, Phys. Rev. Lett. 96, 181602 (2006). arXiv:hep-th/0603001
F. Pastawski, B. Yoshida, D. Harlow, J. Preskill, Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence, JHEP 06 (2015) 149. arXiv:1503.06237
X. Dong, D. Harlow, A. C. Wall, Reconstruction of bulk operators within the entanglement wedge in gauge-gravity duality, Phys. Rev. Lett. 117, 021601 (2016). arXiv:1601.05416
D. Harlow, The Ryu–Takayanagi formula from quantum error correction, Commun. Math. Phys. 354, 865 (2017). arXiv:1607.03901