Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example IV.9: Uniform cloned cross {|00>,|11>}: Rq,Fe⊆{R1,R2≥1/2}, but Rq,Fbar={R1,R2≥0,R1+R2≥1}. Hence Rq,Fbar differs from Rq,Fe in general an

Open
QAlgorithms.Papers.Independent.Renew46.P43.clonedCrossRegions

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

prove2quantum

Consider the uniform cloned-cross ensemble ∣00⟩,∣11⟩|00\rangle,|11\rangle∣00⟩,∣11⟩. It has the same average state as the Bell plus/minus source. Its quantum average-fidelity region is exact below, whereas only an outer bound is asserted for entanglement fidelity. In particular the two fidelity regions differ, and the average-fidelity region differs from that of the EPR ensemble despite their identical averages.

Rq,Fe⊆{R1,R2≥12},Rq,Fˉ={R1,R2≥0, R1+R2≥1},Rq,Fe≠Rq,Fˉ.\mathcal R_{q,F_e}\subseteq\{R_1,R_2\ge\tfrac12\},\quad\mathcal R_{q,\bar F}=\{R_1,R_2\ge0,\ R_1+R_2\ge1\},\quad\mathcal R_{q,F_e}\ne\mathcal R_{q,\bar F}.Rq,Fe​​⊆{R1​,R2​≥21​},Rq,Fˉ​={R1​,R2​≥0, R1​+R2​≥1},Rq,Fe​​=Rq,Fˉ​.

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.9, PDF p.52: same average as the EPR source, different ensemble.
No claim that the Fe region contains the half/half corner is made. -/
theorem clonedCrossRegions :
    entanglementSourceRegion clonedCross.multiple (by intros; rfl) ⊆ halfRateRegion ∧
    quantumSourceRegion clonedCross.multiple = nonnegativeSumRegion 1 ∧
    quantumSourceRegion clonedCross.multiple ≠
      entanglementSourceRegion clonedCross.multiple (by intros; rfl) ∧
    clonedCross.multiple.average = eprSource.average ∧
    quantumSourceRegion clonedCross.multiple ≠ quantumSourceRegion eprSource := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

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

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

Consider two parties, each with a two-dimensional quantum system, and the source that chooses a uniformly random bit x∈{0,1}x\in\{0,1\}x∈{0,1} and supplies the product state ∣x⟩⟨x∣⊗∣x⟩⟨x∣|x\rangle\langle x|\otimes|x\rangle\langle x|∣x⟩⟨x∣⊗∣x⟩⟨x∣. Here ∣0⟩,∣1⟩|0\rangle,|1\rangle∣0⟩,∣1⟩ are the coordinate basis vectors. Define its quantum source region as follows: for every block length ℓ=n+1\ell=n+1ℓ=n+1, choose positive integer dimensions d0,ℓ,d1,ℓd_{0,\ell},d_{1,\ell}d0,ℓ​,d1,ℓ​, a channel encoding each party’s ℓ\ellℓ systems into its respective dimension, and a joint decoding channel back to the original two blocks; the rates log⁡2(di,ℓ)/ℓ\log_2(d_{i,\ell})/\elllog2​(di,ℓ​)/ℓ must converge to RiR_iRi​, and the average overlap Re⁡tr⁡(ρ^wρw)\operatorname{Re}\operatorname{tr}(\widehat\rho_w\rho_w)Retr(ρ​w​ρw​), averaged over the source words with their product probabilities, must converge to 111, where ρw\rho_wρw​ is the original word state and ρ^w\widehat\rho_wρ​w​ its decoded state. Every channel here must admit a finite Kraus representation X↦∑jEjXEj†X\mapsto\sum_j E_jXE_j^\daggerX↦∑j​Ej​XEj†​ with ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I; the two encoders act by their tensor product, followed by the joint decoder. The required restriction that decoded positive matrices have zero entries between different blocks imposes no additional condition here, since every system’s block label is 000. Define the entanglement source region using the same codes and rate convergence, but require instead that the overlap of a purification of the average word state with its image under the identity on the reference and the encoding–decoding channel converge to 111: for an average state ρ\rhoρ, the purification vector has coordinates v(i,j)=(ρ)j,iv_{(i,j)}=(\sqrt\rho)_{j,i}v(i,j)​=(ρ​)j,i​, and this overlap is Re⁡tr⁡[(id⁡⊗T)(vv†) vv†]\operatorname{Re}\operatorname{tr}[(\operatorname{id}\otimes\mathcal T)(vv^\dagger)\,vv^\dagger]Retr[(id⊗T)(vv†)vv†]. The declaration asserts that the entanglement source region is contained in {R:R0≥12, R1≥12}\{R:R_0\ge\tfrac12,\ R_1\ge\tfrac12\}{R:R0​≥21​, R1​≥21​}, that the quantum source region is exactly {R:R0≥0, R1≥0, R0+R1≥1}\{R:R_0\ge0,\ R_1\ge0,\ R_0+R_1\ge1\}{R:R0​≥0, R1​≥0, R0​+R1​≥1}, and that these two regions differ. It also asserts that the source’s average state equals that of the source choosing uniformly between (∣00⟩+∣11⟩)/2(|00\rangle+|11\rangle)/\sqrt2(∣00⟩+∣11⟩)/2​ and (∣00⟩−∣11⟩)/2(|00\rangle-|11\rangle)/\sqrt2(∣00⟩−∣11⟩)/2​—both averages are 12∣00⟩⟨00∣+12∣11⟩⟨11∣\tfrac12|00\rangle\langle00|+\tfrac12|11\rangle\langle11|21​∣00⟩⟨00∣+21​∣11⟩⟨11∣—while their quantum source regions, defined by the same average-overlap criterion, differ. All region definitions use positive block lengths tending to infinity.

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