Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example IV.8: Uniform {PhiPlus,PhiMinus} EPR source: Rq,Fe⊆Rq,Fbar⊆{R1,R2≥1/2}.

Open
QAlgorithms.Papers.Independent.Renew46.P43.eprSourceRegions

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Consider the source uniformly distributed on the two Bell states ∣Φ+⟩,∣Φ−⟩|\Phi^+\rangle,|\Phi^-\rangle∣Φ+⟩,∣Φ−⟩, with each party holding one qubit. Its average is (∣00⟩⟨00∣+∣11⟩⟨11∣)/2(|00\rangle\langle00|+|11\rangle\langle11|)/2(∣00⟩⟨00∣+∣11⟩⟨11∣)/2. The following are necessary rate constraints, not an exact quadrant characterization.

Rq,Fe⊆Rq,Fˉ⊆{R1,R2≥12}.\mathcal R_{q,F_e}\subseteq\mathcal R_{q,\bar F}\subseteq\{R_1,R_2\ge\tfrac12\}.Rq,Fe​​⊆Rq,Fˉ​⊆{R1​,R2​≥21​}.

This is the source result with its stated operational or information-theoretic domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Renew46.P43

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator

open Filter MeasureTheory

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

open QAlgorithms.Papers.Independent.Information100.P06 (Below)

open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)

open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)

attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace

/-- Example IV.8, PDF pp.51-52: uniform Bell plus/minus ensemble. These are
necessary individual bounds, with no claim that the entire quadrant is achievable. -/
theorem eprSourceRegions :
    entanglementSourceRegion eprSource (by intros; rfl) ⊆ quantumSourceRegion eprSource ∧
    quantumSourceRegion eprSource ⊆ halfRateRegion := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 51, Example IV.8
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let ∣β0⟩=(∣00⟩+∣11⟩)/2|\beta_0\rangle=(|00\rangle+|11\rangle)/\sqrt2∣β0​⟩=(∣00⟩+∣11⟩)/2​ and ∣β1⟩=(∣00⟩−∣11⟩)/2|\beta_1\rangle=(|00\rangle-|11\rangle)/\sqrt2∣β1​⟩=(∣00⟩−∣11⟩)/2​. The source chooses either vector with probability 12\frac1221​ and supplies its two qubits to two separate parties. For each positive length ℓ\ellℓ and word w∈{0,1}ℓw\in\{0,1\}^{\ell}w∈{0,1}ℓ, let ρw\rho_wρw​ be the density matrix of ⨂t=0ℓ−1∣βwt⟩\bigotimes_{t=0}^{\ell-1}|\beta_{w_t}\rangle⨂t=0ℓ−1​∣βwt​​⟩, with factors regrouped by party, and let ρˉℓ=2−ℓ∑wρw\bar\rho_\ell=2^{-\ell}\sum_w\rho_wρˉ​ℓ​=2−ℓ∑w​ρw​. A permitted code at length ℓ\ellℓ has positive compressed dimensions d0,ℓ,d1,ℓd_{0,\ell},d_{1,\ell}d0,ℓ​,d1,ℓ​, separate quantum channels Ei,ℓE_{i,\ell}Ei,ℓ​ from each party’s ℓ\ellℓ qubits to its compressed register, and a joint decoding channel DℓD_\ellDℓ​ back to both parties’ ℓ\ellℓ-qubit registers; write Tℓ=Dℓ∘(E0,ℓ⊗E1,ℓ)\mathcal T_\ell=D_\ell\circ(E_{0,\ell}\otimes E_{1,\ell})Tℓ​=Dℓ​∘(E0,ℓ​⊗E1,ℓ​). Each channel must admit a finite Kraus representation X↦∑jKjXKj†X\mapsto\sum_jK_jXK_j^\daggerX↦∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. The source systems each have a single matrix block, so the decoder’s condition on entries between different blocks is automatic. Let Q\mathcal QQ be the set of real pairs RRR admitting such codes for every positive ℓ\ellℓ, with log⁡2(di,ℓ)/ℓ→Ri\log_2(d_{i,\ell})/\ell\to R_ilog2​(di,ℓ​)/ℓ→Ri​ and 2−ℓ∑wRe⁡Tr⁡[Tℓ(ρw)ρw]→12^{-\ell}\sum_w\operatorname{Re}\operatorname{Tr}[\mathcal T_\ell(\rho_w)\rho_w]\to12−ℓ∑w​ReTr[Tℓ​(ρw​)ρw​]→1. Let E\mathcal EE instead require the same rate limits and Re⁡Tr⁡ ⁣[(id⊗Tℓ)(Pℓ)Pℓ]→1\operatorname{Re}\operatorname{Tr}\!\left[(\mathrm{id}\otimes\mathcal T_\ell)(P_\ell)P_\ell\right]\to1ReTr[(id⊗Tℓ​)(Pℓ​)Pℓ​]→1, where Pℓ=∣Ωℓ⟩⟨Ωℓ∣P_\ell=|\Omega_\ell\rangle\langle\Omega_\ell|Pℓ​=∣Ωℓ​⟩⟨Ωℓ​∣ and the canonical purification vector has coordinates Ωℓ(a,b)=(ρˉℓ)b,a\Omega_\ell(a,b)=(\sqrt{\bar\rho_\ell})_{b,a}Ωℓ​(a,b)=(ρˉ​ℓ​​)b,a​ in the computational basis. The theorem asserts E⊆Q\mathcal E\subseteq\mathcal QE⊆Q and Q⊆{R:R0≥12, R1≥12}\mathcal Q\subseteq\{R:R_0\ge\frac12,\ R_1\ge\frac12\}Q⊆{R:R0​≥21​, R1​≥21​}.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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