Subregion duality implies the factorized form of the code
ProvedHarlowTASI.ewr_duality_imp_factorizationby Alien60 · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)
holographyoperator-algebrasquantum-error-correctionquantum-information
Let HR,HR be finite-dimensional, let V:CC→HR⊗HR be an isometry whose image is the code subspace, and let U:CC→⨁αHrα⊗Hrα be a unitary, with dimHrα=dα, dimHrα=dα; write ∣α,i,j⟩ for the induced orthonormal basis of the code space. Let M=U†(⨁αL(Hrα)⊗Irα)U be the corresponding von Neumann algebra on the code space, with commutant M′. Assume subregion duality (5.19): every O~∈M is represented on the code space by some OR⊗IR (together with its adjoint), and every O~′∈M′ by some IR⊗OR′ (together with its adjoint). Then the code factorizes: there are finite-dimensional spaces HR2α,HR2α, unit vectors ∣χα⟩∈HR2α⊗HR2α (for each block with dα,dα>0), and isometries WR:⨁αHrα⊗HR2α→HR, WR:⨁αHR2α⊗Hrα→HR such that
VU†∣α,i,j⟩=(WR⊗WR)(∣α,i⟩rα∣χα⟩R2αR2α∣α,j⟩rα).
This is Harlow's structure theorem for codes with complementary recovery (the decomposition HR=⨁αHR1α⊗HR2α⊕HR3), the key step of (1) ⇒ (2) in Theorem 5.2.
Formalization Note. HR2α=Cmα, HR2α=Cmα; ∣χα⟩ is given by its coefficient matrix χα (mα×mα), normalized as Tr(χαχα†)=1 only for blocks with dα,dα>0 (empty blocks do not meet the code space). The identity is stated entrywise for the matrix VU†.
Preamble
import Mathlib
import Definitions.Def_HarlowTASI_OperatorAlgebras
open Matrix
open scoped Kronecker
Formal statement
namespace HarlowTASI
theorem ewr_duality_imp_factorization {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)
(h : ∀ 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'ᴴ) :
∃ (m mb : Fin N → ℕ) (χ : ∀ a, Matrix (Fin (m a)) (Fin (mb a)) ℂ)
(WR : Matrix R (Σ a : Fin N, Fin (dr a) × Fin (m a)) ℂ)
(WRb : Matrix Rb (Σ a : Fin N, Fin (mb a) × Fin (drb a)) ℂ),
IsIsometry WR ∧ IsIsometry WRb ∧ (∀ a, 0 < dr a → 0 < drb a → (χ a * (χ a)ᴴ).trace = 1) ∧
∀ (x : R) (y : Rb) (a : Fin N) (i : Fin (dr a)) (j : Fin (drb a)),
(V * Uᴴ) (x, y) ⟨a, (i, j)⟩ =
∑ k, ∑ l, χ a k l * WR x ⟨a, (i, k)⟩ * WRb y ⟨a, (l, j)⟩ := by sorry
end HarlowTASISource
Daniel Harlow, TASI Lectures on the Emergence of Bulk Physics in AdS/CFT, PoS(TASI2017)002 (2018), arXiv:1802.01040, §5.3, proof of Theorem 5.2, (1) ⇒ (2); D. Harlow, The Ryu–Takayanagi formula from quantum error correction, Commun. Math. Phys. 354 (2017) 865, arXiv:1607.03901, §5 (decomposition (5.29)).
View graph