Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.2 — entanglement wedge reconstruction ⇔ quantum RT formula ⇔ JLMS formula

Proved
HarlowTASI.entanglement_wedge_reconstruction

by Lucas · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

holographyoperator-algebrasquantum-error-correctionquantum-information

Let H=HR⊗HR‾\mathcal H=\mathcal H_R\otimes\mathcal H_{\overline R}H=HR​⊗HR​ be a finite-dimensional Hilbert space, let Hcode⊆H\mathcal H_{code}\subseteq\mathcal HHcode​⊆H be a subspace, and let MMM be a von Neumann algebra on Hcode\mathcal H_{code}Hcode​ with commutant M′M'M′ and center ZMZ_MZM​. For a state ρ~\tilde\rhoρ~​ on Hcode\mathcal H_{code}Hcode​ write ρ~R,ρ~R‾\tilde\rho_R,\tilde\rho_{\overline R}ρ~​R​,ρ~​R​ for its reductions to RRR and R‾\overline RR, and S(ρ~,M)S(\tilde\rho,M)S(ρ~​,M), S(ρ~∣σ~,M)S(\tilde\rho|\tilde\sigma,M)S(ρ~​∣σ~,M) for the algebraic entropy (5.16) and relative entropy (5.18). Then the following three statements are equivalent:

  1. Subregion duality. For all O~∈M\tilde O\in MO~∈M and O~′∈M′\tilde O'\in M'O~′∈M′ there are OR∈L(HR)O_R\in\mathcal L(\mathcal H_R)OR​∈L(HR​) and OR‾′∈L(HR‾)O'_{\overline R}\in\mathcal L(\mathcal H_{\overline R})OR′​∈L(HR​) such that for all ∣ψ~⟩∈Hcode|\tilde\psi\rangle\in\mathcal H_{code}∣ψ~​⟩∈Hcode​
OR∣ψ~⟩=O~∣ψ~⟩,OR†∣ψ~⟩=O~†∣ψ~⟩,OR‾′∣ψ~⟩=O~′∣ψ~⟩,OR‾′†∣ψ~⟩=O~′†∣ψ~⟩.(5.19)O_R|\tilde\psi\rangle=\tilde O|\tilde\psi\rangle,\quad O_R^\dagger|\tilde\psi\rangle=\tilde O^\dagger|\tilde\psi\rangle,\quad O'_{\overline R}|\tilde\psi\rangle=\tilde O'|\tilde\psi\rangle,\quad O'^\dagger_{\overline R}|\tilde\psi\rangle=\tilde O'^\dagger|\tilde\psi\rangle.\tag{5.19}OR​∣ψ~​⟩=O~∣ψ~​⟩,OR†​∣ψ~​⟩=O~†∣ψ~​⟩,OR′​∣ψ~​⟩=O~′∣ψ~​⟩,OR′†​∣ψ~​⟩=O~′†∣ψ~​⟩.(5.19)
  1. Quantum RT formula. There is an operator LR∈ZM\mathcal L_R\in Z_MLR​∈ZM​ such that for every state ρ~\tilde\rhoρ~​ on Hcode\mathcal H_{code}Hcode​
S(ρ~R)=Tr(ρ~LR)+S(ρ~,M),S(ρ~R‾)=Tr(ρ~LR)+S(ρ~,M′).(5.20)S(\tilde\rho_R)=\mathrm{Tr}(\tilde\rho\mathcal L_R)+S(\tilde\rho,M),\qquad S(\tilde\rho_{\overline R})=\mathrm{Tr}(\tilde\rho\mathcal L_R)+S(\tilde\rho,M').\tag{5.20}S(ρ~​R​)=Tr(ρ~​LR​)+S(ρ~​,M),S(ρ~​R​)=Tr(ρ~​LR​)+S(ρ~​,M′).(5.20)
  1. JLMS formula. For all states ρ~,σ~\tilde\rho,\tilde\sigmaρ~​,σ~ on Hcode\mathcal H_{code}Hcode​
S(ρ~R∣σ~R)=S(ρ~∣σ~,M),S(ρ~R‾∣σ~R‾)=S(ρ~∣σ~,M′).(5.21)S(\tilde\rho_R|\tilde\sigma_R)=S(\tilde\rho|\tilde\sigma,M),\qquad S(\tilde\rho_{\overline R}|\tilde\sigma_{\overline R})=S(\tilde\rho|\tilde\sigma,M').\tag{5.21}S(ρ~​R​∣σ~R​)=S(ρ~​∣σ~,M),S(ρ~​R​∣σ~R​)=S(ρ~​∣σ~,M′).(5.21)

The theorem (proved in Harlow, The Ryu–Takayanagi formula from quantum error correction, 2017) shows that subregion duality in the entanglement wedge, the quantum Ryu–Takayanagi formula with a central area operator, and the JLMS formula are mathematically equivalent; the lectures name it as their main target. It does not assert that any of the three statements holds.

Formalization Note Hcode\mathcal H_{code}Hcode​ is the image of an isometry V:CC→CR×R‾V:\mathbb C^C\to\mathbb C^{R\times\overline R}V:CC→CR×R, states on it are C×CC\times CC×C density matrices ρ~\tilde\rhoρ~​ (embedded as Vρ~V†V\tilde\rho V^\daggerVρ~​V†), and ORO_ROR​ acts as OR⊗IR‾O_R\otimes I_{\overline R}OR​⊗IR​. MMM is a ∗*∗-subalgebra of C×CC\times CC×C matrices; the algebraic entropies are evaluated in an arbitrary block decomposition UUU of MMM (Theorem 5.1 guarantees one exists; the entropies do not depend on the choice). The RT identity is stated in C\mathbb CC, so it also forces Tr(ρ~LR)\mathrm{Tr}(\tilde\rho\mathcal L_R)Tr(ρ~​LR​) to be real; relative entropies are compared in the extended reals, so the value +∞+\infty+∞ is allowed on both sides.

Preamble
import Mathlib
import Definitions.Def_HarlowTASI_OperatorAlgebras

open Matrix
open scoped Kronecker
Formal statement
namespace HarlowTASI
theorem entanglement_wedge_reconstruction {R Rb C : Type} [Fintype R] [DecidableEq R]
    [Fintype Rb] [DecidableEq Rb] [Fintype C] [DecidableEq C]
    (V : Matrix (R × Rb) C ℂ) (hV : IsIsometry V)
    (M : StarSubalgebra ℂ (Matrix C C ℂ))
    (N : ℕ) (dr drb : Fin N → ℕ) (U : Matrix (BlockIndex N dr drb) C ℂ)
    (hU : IsUnitaryMatrix U) (hMU : (M : Set (Matrix C C ℂ)) = blockAlgebraLeft U) :
    List.TFAE
      [ ∀ O ∈ M, ∀ O' ∈ StarSubalgebra.centralizer ℂ (M : Set (Matrix C C ℂ)),
          ∃ (OR : Matrix R R ℂ) (ORb : Matrix Rb Rb ℂ),
            (OR ⊗ₖ (1 : Matrix Rb Rb ℂ)) * V = V * O ∧
            (ORᴴ ⊗ₖ (1 : Matrix Rb Rb ℂ)) * V = V * Oᴴ ∧
            ((1 : Matrix R R ℂ) ⊗ₖ ORb) * V = V * O' ∧
            ((1 : Matrix R R ℂ) ⊗ₖ ORbᴴ) * V = V * O'ᴴ,
        ∃ L ∈ M ⊓ StarSubalgebra.centralizer ℂ (M : Set (Matrix C C ℂ)),
          ∀ ρ : Matrix C C ℂ, IsDensityMatrix ρ →
            ((vonNeumannEntropy (traceRight (V * ρ * Vᴴ)) : ℝ) : ℂ) =
                (ρ * L).trace + ((algebraicEntropyLeft U ρ : ℝ) : ℂ) ∧
            ((vonNeumannEntropy (traceLeft (V * ρ * Vᴴ)) : ℝ) : ℂ) =
                (ρ * L).trace + ((algebraicEntropyRight U ρ : ℝ) : ℂ),
        ∀ ρ σ : Matrix C C ℂ, IsDensityMatrix ρ → IsDensityMatrix σ →
          relativeEntropy (traceRight (V * ρ * Vᴴ)) (traceRight (V * σ * Vᴴ)) =
              algebraicRelEntropyLeft U ρ σ ∧
          relativeEntropy (traceLeft (V * ρ * Vᴴ)) (traceLeft (V * σ * Vᴴ)) =
              algebraicRelEntropyRight U ρ σ ] := by sorry
end HarlowTASI
Source
Daniel Harlow, TASI Lectures on the Emergence of Bulk Physics in AdS/CFT, PoS(TASI2017)002 (2018), arXiv:1802.01040, §5.3, pp. 45–46, Theorem 5.2, eqs. (5.19)–(5.21), with the entropies of eqs. (5.14)–(5.18).
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - NON-BLIND: same agent that drafted the statements

Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, with full knowledge of the source lectures and of the intended meaning. It was not produced blind by an independent auditor, so it must not be mistaken for independent testimony; reviewers should treat it as the drafter's own rendering of the code and check the Lean text directly.

Data.

  • Finite sets RRR, R‾\overline RR, CCC (decidable equality); no nonemptiness is assumed.
  • A matrix VVV (rows R×R‾R\times\overline RR×R, columns CCC) with V†V=ICV^\dagger V=I_CV†V=IC​.
  • A ∗*∗-subalgebra MMM of the C×CC\times CC×C complex matrices (containing all λI\lambda IλI); M′M'M′ denotes its centralizer {Y:YX=XY ∀X∈M}\{Y:YX=XY\ \forall X\in M\}{Y:YX=XY ∀X∈M} and ZM=M∩M′Z_M=M\cap M'ZM​=M∩M′.
  • N∈NN\in\mathbb NN∈N, dr,dr‾:{0,..,N−1}→Nd_r,d_{\overline r}:\{0,..,N-1\}\to\mathbb Ndr​,dr​:{0,..,N−1}→N (zero dimensions allowed), and a matrix UUU (rows: block index set {(α,i,j)}\{(\alpha,i,j)\}{(α,i,j)}, columns: CCC) with U†U=IU^\dagger U=IU†U=I and UU†=IUU^\dagger=IUU†=I.
  • Hypothesis: MMM equals, as a set, {U†(⨁αxα⊗Idr‾(α))U}\{U^\dagger(\bigoplus_\alpha x_\alpha\otimes I_{d_{\overline r}(\alpha)})U\}{U†(⨁α​xα​⊗Idr​(α)​)U} over all families of dr(α)×dr(α)d_r(\alpha)\times d_r(\alpha)dr​(α)×dr​(α) matrices xαx_\alphaxα​.

Notation: for a C×CC\times CC×C matrix ρ\rhoρ, ρR=TrR‾(VρV†)\rho_R=\mathrm{Tr}_{\overline R}(V\rho V^\dagger)ρR​=TrR​(VρV†) and ρR‾=TrR(VρV†)\rho_{\overline R}=\mathrm{Tr}_R(V\rho V^\dagger)ρR​=TrR​(VρV†). SL,SRS_L,S_RSL​,SR​ and SL(⋅∣⋅),SR(⋅∣⋅)S_L(\cdot|\cdot),S_R(\cdot|\cdot)SL​(⋅∣⋅),SR​(⋅∣⋅) are the block-wise algebraic entropies of the operator-algebra definition file, computed with this UUU: SL(ρ)=−∑αpαlog⁡pα+∑αpαS(ρrα)S_L(\rho)=-\sum_\alpha p_\alpha\log p_\alpha+\sum_\alpha p_\alpha S(\rho_{r_\alpha})SL​(ρ)=−∑α​pα​logpα​+∑α​pα​S(ρrα​​) with pαp_\alphapα​ the trace of the α\alphaα-th diagonal block of UρU†U\rho U^\daggerUρU† and ρrα\rho_{r_\alpha}ρrα​​ the normalized partial trace of that block over its second factor; SRS_RSR​ uses the partial trace over the first factor; the relative versions add the classical term c(pα(ρ),pα(σ))c(p_\alpha(\rho),p_\alpha(\sigma))c(pα​(ρ),pα​(σ)) and pα(ρ) S(ρrα∣σrα)p_\alpha(\rho)\,S(\rho_{r_\alpha}|\sigma_{r_\alpha})pα​(ρ)S(ρrα​​∣σrα​​) (resp. r‾α\overline r_\alpharα​).

Claim. The following three statements are pairwise equivalent:

  1. For every O∈MO\in MO∈M and every O′∈M′O'\in M'O′∈M′ there exist an R×RR\times RR×R matrix ORO_ROR​ and an R‾×R‾\overline R\times\overline RR×R matrix OR‾′O'_{\overline R}OR′​ with
(OR⊗I)V=VO,(OR†⊗I)V=VO†,(I⊗OR‾′)V=VO′,(I⊗OR‾′†)V=VO′†.(O_R\otimes I)V=VO,\quad(O_R^\dagger\otimes I)V=VO^\dagger,\quad(I\otimes O'_{\overline R})V=VO',\quad(I\otimes O'^\dagger_{\overline R})V=VO'^\dagger .(OR​⊗I)V=VO,(OR†​⊗I)V=VO†,(I⊗OR′​)V=VO′,(I⊗OR′†​)V=VO′†.
  1. There exists L∈M∩M′L\in M\cap M'L∈M∩M′ such that for every C×CC\times CC×C density matrix ρ\rhoρ (positive semidefinite, trace 111), as complex numbers,
S(ρR)=Tr(ρL)+SL(ρ)andS(ρR‾)=Tr(ρL)+SR(ρ),S(\rho_R)=\mathrm{Tr}(\rho L)+S_L(\rho)\quad\text{and}\quad S(\rho_{\overline R})=\mathrm{Tr}(\rho L)+S_R(\rho),S(ρR​)=Tr(ρL)+SL​(ρ)andS(ρR​)=Tr(ρL)+SR​(ρ),

where S(⋅)S(\cdot)S(⋅) is the von Neumann entropy (eigenvalue formula). 3. For all C×CC\times CC×C density matrices ρ,σ\rho,\sigmaρ,σ, as extended reals,

S(ρR∣σR)=SL(ρ∣σ)andS(ρR‾∣σR‾)=SR(ρ∣σ),S(\rho_R|\sigma_R)=S_L(\rho|\sigma)\quad\text{and}\quad S(\rho_{\overline R}|\sigma_{\overline R})=S_R(\rho|\sigma),S(ρR​∣σR​)=SL​(ρ∣σ)andS(ρR​∣σR​)=SR​(ρ∣σ),

where S(⋅∣⋅)S(\cdot|\cdot)S(⋅∣⋅) is the spectral relative entropy (with value +∞+\infty+∞ when a nonzero eigenvalue direction of the first argument overlaps a zero eigenvalue direction of the second).

Edge remarks: if CCC is empty there are no density matrices, so (2) and (3) hold trivially and (1) holds trivially as well. The theorem asserts only the equivalence, not that any of the statements is true.

Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me