Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.2, Eqs. (3.19) ⟺ (3.21) — PXEP∝PP X_E P\propto PPXE​P∝P for every XEX_EXE​ iff every logical operator has a representation on Eˉ\bar EEˉ

Proved
ADH2015.correctsErasure_iff_allRep

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

holographyoperator-algebra-qecquantum-error-correctionquantum-gravity

Let H=HE⊗HEˉ\mathcal H=\mathcal H_E\otimes\mathcal H_{\bar E}H=HE​⊗HEˉ​ be finite-dimensional (EEE the erased part, Eˉ\bar EEˉ the retained part) and let HC⊆H\mathcal H_{\mathcal C}\subseteq\mathcal HHC​⊆H be a code subspace. An operator OOO acts within HC\mathcal H_{\mathcal C}HC​ if OOO and O†O^\daggerO† both map HC\mathcal H_{\mathcal C}HC​ into itself. It has a representation on Eˉ\bar EEˉ if some OEˉ=1E⊗YO_{\bar E}=\mathbb 1_E\otimes YOEˉ​=1E​⊗Y satisfies OEˉ∣ψ~⟩=O∣ψ~⟩O_{\bar E}|\tilde\psi\rangle=O|\tilde\psi\rangleOEˉ​∣ψ~​⟩=O∣ψ~​⟩ and OEˉ†∣ψ~⟩=O†∣ψ~⟩O_{\bar E}^\dagger|\tilde\psi\rangle=O^\dagger|\tilde\psi\rangleOEˉ†​∣ψ~​⟩=O†∣ψ~​⟩ for all ∣ψ~⟩∈HC|\tilde\psi\rangle\in\mathcal H_{\mathcal C}∣ψ~​⟩∈HC​ (and analogously on EEE, with X⊗1EˉX\otimes\mathbb 1_{\bar E}X⊗1Eˉ​). Then the following are equivalent:

  1. (Eq. (3.19)) for every operator XEX_EXE​ on EEE there is c∈Cc\in\mathbb Cc∈C with ⟨ψ~′∣XE⊗1Eˉ∣ψ~⟩=c ⟨ψ~′∣ψ~⟩\langle\tilde\psi'|X_E\otimes\mathbb 1_{\bar E}|\tilde\psi\rangle=c\,\langle\tilde\psi'|\tilde\psi\rangle⟨ψ~​′∣XE​⊗1Eˉ​∣ψ~​⟩=c⟨ψ~​′∣ψ~​⟩ for all code states, i.e. the projection of XEX_EXE​ onto the code subspace is proportional to the identity;
  2. (Eq. (3.21)) every operator acting within HC\mathcal H_{\mathcal C}HC​ has a representation on Eˉ\bar EEˉ.

This is the operator form of the erasure-correction condition: every logical operator can be implemented on the surviving subsystem Eˉ\bar EEˉ alone exactly when operators on the erased subsystem EEE cannot distinguish code states. It is the special case of the basic theorem of operator-algebra quantum error correction in which the logical algebra is the full operator algebra of the code subspace.

Formalization Note The source cites (3.19) as equivalent to correctability of the erasure of EEE (the existence of a recovery unitary, Eqs. (3.14)–(3.18), from refs. [26], [28]); that equivalence is not formalized here. Condition (3.19), ⟨ı~∣XE∣ȷ~⟩=δijC(X)\langle\tilde\imath|X_E|\tilde\jmath\rangle=\delta_{ij}C(X)⟨~∣XE​∣~​⟩=δij​C(X) in an orthonormal basis, is stated basis-free as ⟨ψ~′∣XEψ~⟩=c ⟨ψ~′∣ψ~⟩\langle\tilde\psi'|X_E\tilde\psi\rangle=c\,\langle\tilde\psi'|\tilde\psi\rangle⟨ψ~​′∣XE​ψ~​⟩=c⟨ψ~​′∣ψ~​⟩ for one constant ccc and all code vectors.

Preamble
import Mathlib
import Definitions.Def_ADH2015_defs

open Matrix
open scoped Kronecker
Formal statement
namespace ADH2015

theorem correctsErasure_iff_allRep {e ē : Type*} [Fintype e] [Fintype ē] [DecidableEq e]
    [DecidableEq ē] (C : Submodule ℂ (e × ē → ℂ)) :
    CorrectsErasureOfE C ↔ ∀ O : Matrix (e × ē) (e × ē) ℂ, ActsWithin C O → HasRepOnBar C O := by sorry

end ADH2015
Source
A. Almheiri, X. Dong, D. Harlow, Bulk Locality and Quantum Error Correction in AdS/CFT, JHEP 04 (2015) 163, https://arxiv.org/abs/1411.7041v3, Section 3.2, Eq. (3.19), Eq. (3.21) and the paragraph following (3.21) ('In fact the converse of this statement also holds')
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Read-back of ADH2015.correctsErasure_iff_allRep.

Setting and binders. Let eee and eˉ\bar eeˉ be arbitrary finite types, each with decidable equality. Nothing else is assumed: either may be empty, and there is no other size condition. The ambient space is

H=Ce×eˉ  ≅  Ce⊗Ceˉ,\mathcal H = \mathbb C^{e \times \bar e} \;\cong\; \mathbb C^{e} \otimes \mathbb C^{\bar e},H=Ce×eˉ≅Ce⊗Ceˉ,

the complex vectors indexed by pairs (i,a)(i,a)(i,a) with i∈ei \in ei∈e and a∈eˉa \in \bar ea∈eˉ. The first factor Ce\mathbb C^{e}Ce is the one called EEE, and the second factor Ceˉ\mathbb C^{\bar e}Ceˉ is the one called Eˉ\bar EEˉ. Let C⊆HC \subseteq \mathcal HC⊆H be an arbitrary complex linear subspace (the "code subspace"). It may be {0}\{0\}{0}, all of H\mathcal HH, or anything in between. Operators are complex square matrices indexed by e×eˉe \times \bar ee×eˉ. O†O^\daggerO† is the conjugate transpose. For u,w∈Hu, w \in \mathcal Hu,w∈H the pairing is ⟨w∣u⟩=∑xwx‾ ux\langle w | u\rangle = \sum_{x} \overline{w_x}\, u_x⟨w∣u⟩=∑x​wx​​ux​, the standard Hermitian inner product, conjugate-linear in www. For matrices AAA (on eee) and BBB (on eˉ\bar eeˉ), A⊗BA \otimes BA⊗B is the Kronecker product with entries (A⊗B)(i,a),(j,b)=AijBab(A\otimes B)_{(i,a),(j,b)} = A_{ij} B_{ab}(A⊗B)(i,a),(j,b)​=Aij​Bab​. So X⊗1EˉX \otimes \mathbb 1_{\bar E}X⊗1Eˉ​ acts only on the EEE factor, and 1E⊗Y\mathbb 1_E \otimes Y1E​⊗Y acts only on the Eˉ\bar EEˉ factor.

The statement. For every such e,eˉ,Ce, \bar e, Ce,eˉ,C:

CorrectsErasureOfE(C)  ⟺  (∀O∈Me×eˉ(C): ActsWithin(C,O)⇒HasRepOnBar(C,O)).\mathrm{CorrectsErasureOfE}(C) \iff \Big(\forall O \in M_{e\times\bar e}(\mathbb C):\ \mathrm{ActsWithin}(C,O) \Rightarrow \mathrm{HasRepOnBar}(C,O)\Big).CorrectsErasureOfE(C)⟺(∀O∈Me×eˉ​(C): ActsWithin(C,O)⇒HasRepOnBar(C,O)).

The connective is a genuine "if and only if". Inside the right-hand side, "acts within" implies "has a representation" for every complex matrix OOO.

Definitions, unfolded.

  • CorrectsErasureOfE(C)\mathrm{CorrectsErasureOfE}(C)CorrectsErasureOfE(C): for every complex matrix XXX on the first factor EEE (indexed by eee), there exists a complex number ccc such that for all v∈Cv \in Cv∈C and all w∈Cw \in Cw∈C,
⟨w ∣ (X⊗1Eˉ) v⟩=c ⟨w ∣ v⟩.\langle w \,|\, (X \otimes \mathbb 1_{\bar E})\, v\rangle = c\,\langle w \,|\, v\rangle.⟨w∣(X⊗1Eˉ​)v⟩=c⟨w∣v⟩.

The quantifier order is ∀X ∃c ∀v ∀w\forall X\ \exists c\ \forall v\ \forall w∀X ∃c ∀v ∀w. So ccc may depend on XXX but must be the same for all pairs v,w∈Cv, w \in Cv,w∈C. Here XXX ranges over all complex matrices on EEE, not only Hermitian or unitary ones. Equivalently, if PCP_CPC​ is the orthogonal projection onto CCC, then PC(X⊗1Eˉ)PC=c PCP_C (X\otimes \mathbb 1_{\bar E}) P_C = c\,P_CPC​(X⊗1Eˉ​)PC​=cPC​.

  • ActsWithin(C,O)\mathrm{ActsWithin}(C,O)ActsWithin(C,O): for every v∈Cv \in Cv∈C, both Ov∈CO v \in COv∈C and O†v∈CO^\dagger v \in CO†v∈C. This means CCC is invariant under both OOO and O†O^\daggerO†.

  • HasRepOnBar(C,O)\mathrm{HasRepOnBar}(C,O)HasRepOnBar(C,O): there exists a complex matrix YYY on the second factor Eˉ\bar EEˉ (indexed by eˉ\bar eeˉ) such that for every v∈Cv \in Cv∈C,

(1E⊗Y) v=O vand(1E⊗Y)† v=O†v.(\mathbb 1_E \otimes Y)\, v = O\, v \quad\text{and}\quad (\mathbb 1_E \otimes Y)^\dagger\, v = O^\dagger v .(1E​⊗Y)v=Ovand(1E​⊗Y)†v=O†v.

Note that (1E⊗Y)†=1E⊗Y†(\mathbb 1_E\otimes Y)^\dagger = \mathbb 1_E \otimes Y^\dagger(1E​⊗Y)†=1E​⊗Y†. The order is ∃Y ∀v\exists Y\ \forall v∃Y ∀v: one YYY works for all of CCC. Both equalities are equalities of vectors in the full space H\mathcal HH, required only on vectors of CCC. YYY is any complex matrix, with no unitarity or Hermiticity condition.

So the theorem asserts the following two statements are equivalent:

  1. Every operator acting only on EEE is compressed to a scalar multiple of the identity on CCC.
  2. Every operator OOO on H\mathcal HH that leaves CCC invariant together with O†O^\daggerO† agrees on CCC, together with its adjoint, with some operator of the form 1E⊗Y\mathbb 1_E \otimes Y1E​⊗Y and that operator's adjoint.

Edge cases.

  • Zero subspace C={0}C = \{0\}C={0}: every condition quantified over v,w∈Cv, w \in Cv,w∈C holds trivially. So the left side is true (any ccc works), every OOO acts within CCC, and every OOO has a representation (any YYY works). Both sides are true.
  • Empty types: if eee or eˉ\bar eeˉ is empty, then H\mathcal HH is the zero space. So C={0}C = \{0\}C={0} and the zero-subspace case applies.
  • One-dimensional code C=CψC = \mathbb C\psiC=Cψ with ψ≠0\psi \ne 0ψ=0: the left side always holds, taking c=⟨ψ∣(X⊗1)ψ⟩/⟨ψ∣ψ⟩c = \langle\psi|(X\otimes\mathbb 1)\psi\rangle / \langle\psi|\psi\ranglec=⟨ψ∣(X⊗1)ψ⟩/⟨ψ∣ψ⟩. For such CCC the theorem therefore states something unconditional. Take any OOO such that ψ\psiψ is an eigenvector of both OOO and O†O^\daggerO†, say Oψ=λψO\psi = \lambda\psiOψ=λψ and O†ψ=μψO^\dagger\psi = \mu\psiO†ψ=μψ. Then there is a YYY with
(1⊗Y)ψ=λψand(1⊗Y†)ψ=μψ.(\mathbb 1\otimes Y)\psi = \lambda\psi \quad\text{and}\quad (\mathbb 1\otimes Y^\dagger)\psi = \mu\psi.(1⊗Y)ψ=λψand(1⊗Y†)ψ=μψ.
  • Full space C=HC = \mathcal HC=H (nonzero): every OOO acts within CCC. The right side then requires every operator on H\mathcal HH to equal some 1E⊗Y\mathbb 1_E\otimes Y1E​⊗Y. The left side requires every X⊗1EˉX\otimes\mathbb 1_{\bar E}X⊗1Eˉ​ to be a scalar multiple of the identity.

Logical strength. The statement is a biconditional, universally quantified over all finite decidable index types eee and eˉ\bar eeˉ and all complex subspaces CCC. It has no hypotheses beyond finiteness and decidable equality of the index types. No normalization, orthonormal basis, Hermiticity, or unitarity is assumed anywhere.

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

    Confirmed by the moderator at approval.

  • Endorsed by Alien60 · Oct 9, 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