Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

ER = EPR for `n` pairs.

Proved
EmergentGeometry.matching_ER_EPR

by raver1975 · Sep 11, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalognovelty

ER = EPR for n pairs. The geometry of n Bell pairs consists of exactly the bridges joining entangled partners: partners with positive throat area are bridged and entangled, non-partners are neither.

theorem EmergentGeometry.matching_ER_EPR(w : Fin n → ℝ) (hw : ∀ i, 0 ≤ w i) (i j : Fin n) (b c : Bool) :
    (i = j ∧ b ≠ c ∧ 0 < w i →
        BulkPath (matchingModel w hw).toBulkGraph (i, b) (j, c) ∧
        0 < mutualInfo (matchingModel w hw) (single (i, b)) (single (j, c)))
      ∧ (i ≠ j →
        ¬ BulkPath (matchingModel w hw).toBulkGraph (i, b) (j, c) ∧
        mutualInfo (matchingModel w hw) (single (i, b)) (single (j, c)) = 0) := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Novelty/EREPRQuantumBridge.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Novelty/EREPRQuantumBridge.lean
import Mathlib
import Definitions.Def_Novelty_EREPRBridge
import Definitions.Def_Novelty_EREPRQuantumBridge
import Definitions.Def_Novelty_EmergentGeometryEntropyCone

/-!
# From qubits to throats: quantitative ER=EPR for many Bell pairs

`Novelty.EREPRBridge` matches a single entangled qubit pair with a single bulk
throat.  This file makes the dictionary quantitative and extends it to many
pairs.

* `linearEntropy_eq_concurrence_sq`: for a normalised real two-qubit pure state
  the *linear entanglement entropy* `2(1 - Tr ρ²)` of either marginal equals the
  square of the concurrence.  Hence the throat area assigned to the pair in the
  ER=EPR dictionary is exactly the square root of the linear entropy of the
  state, and `mutualInfo² = 4 · linearEntropy`.

* `matchingModel`: the bulk geometry of `n` independent Bell pairs, a perfect
  matching of `2n` boundary cells by throats of prescribed areas.  We prove that
  partners have mutual information twice the throat area
  (`matching_partner_mutualInfo`), that non-partners are exactly unentangled
  (`matching_cross_mutualInfo`), that a bridge joins two cells precisely when
  they are partners with a positive throat (`matching_bridge_iff`), and that the
  whole geometry is reconstructed from the pairwise entanglement data
  (`matching_reconstruction`).
-/

noncomputable section

open EmergentGeometry

open Finset EmergentSpacetime

/-! ## Linear entanglement entropy of a real two-qubit state -/





/-! ## The geometry of `n` Bell pairs -/

variable {n : ℕ}
Formal statement
theorem EmergentGeometry.matching_ER_EPR(w : Fin n → ℝ) (hw : ∀ i, 0 ≤ w i) (i j : Fin n) (b c : Bool) :
    (i = j ∧ b ≠ c ∧ 0 < w i →
        BulkPath (matchingModel w hw).toBulkGraph (i, b) (j, c) ∧
        0 < mutualInfo (matchingModel w hw) (single (i, b)) (single (j, c)))
      ∧ (i ≠ j →
        ¬ BulkPath (matchingModel w hw).toBulkGraph (i, b) (j, c) ∧
        mutualInfo (matchingModel w hw) (single (i, b)) (single (j, c)) = 0) := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Novelty/EREPRQuantumBridge.lean#L167

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