Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 2: Bell plus |00><00|

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.example_two

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All local registers are nonzero and finite-dimensional. Density matrices are positive semidefinite with trace one. Entropies use natural logarithms, 0ln⁡0=00\ln0=00ln0=0, and Umegaki relative entropy S(σ∥ρ)S(\sigma\Vert\rho)S(σ∥ρ) is +∞+\infty+∞ on failure of support inclusion. The relative entropy of entanglement is ER(σ)=inf⁡ρ∈SepS(σ∥ρ)E_R(\sigma)=\inf_{\rho\in\mathrm{Sep}}S(\sigma\Vert\rho)ER​(σ)=infρ∈Sep​S(σ∥ρ), where separability is across the specified Alice:Bob cut.

For λ∈[0,1]\lambda\in[0,1]λ∈[0,1], put σ2=λ∣Φ+⟩⟨Φ+∣+(1−λ)∣00⟩⟨00∣\sigma_2=\lambda|\Phi^+\rangle\langle\Phi^+|+(1-\lambda)|00\rangle\langle00|σ2​=λ∣Φ+⟩⟨Φ+∣+(1−λ)∣00⟩⟨00∣ and ρ2=(1−λ/2)∣00⟩⟨00∣+(λ/2)∣11⟩⟨11∣\rho_2=(1-\lambda/2)|00\rangle\langle00|+(\lambda/2)|11\rangle\langle11|ρ2​=(1−λ/2)∣00⟩⟨00∣+(λ/2)∣11⟩⟨11∣. The state ρ2\rho_2ρ2​ is a separable minimizer. With s±=(1±1−2λ(1−λ))/2s_\pm=(1\pm\sqrt{1-2\lambda(1-\lambda)})/2s±​=(1±1−2λ(1−λ)​)/2,

ER(σ2)=s+ln⁡s++s−ln⁡s−−(1−λ/2)ln⁡(1−λ/2)−(λ/2)ln⁡(λ/2).E_R(\sigma_2)=s_+\ln s_++s_-\ln s_--(1-\lambda/2)\ln(1-\lambda/2)-(\lambda/2)\ln(\lambda/2).ER​(σ2​)=s+​lns+​+s−​lns−​−(1−λ/2)ln(1−λ/2)−(λ/2)ln(λ/2).

The formula includes the product and Bell endpoints.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P42

open QAlgorithms QAlgorithms.Entanglement

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open QAlgorithms.Papers.Independent.Information100.P04 (copies)

open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Example 2, PDF pp.23–24, corrected Eqs.(61)–(62).
The final diagonal entropy term is (t/2)ln(t/2), and the radicand is 1-2t(1-t),
as forced by Eq.(59)'s determinant; the printed radicand fails at t=1. -/
theorem example_two (t : ℝ) (ht : t ∈ Set.Icc 0 1) :
    let sp := (1+Real.sqrt (1-2*t*(1-t)))/2
    let sm := (1-Real.sqrt (1-2*t*(1-t)))/2
    IsMinimizer (exampleTwoInput t) (correlatedMinimum (1-t/2)) ∧
    relativeEntanglementNats (exampleTwoInput t) =
      ((sp*Real.log sp + sm*Real.log sm - (1-t/2)*Real.log (1-t/2) -
        (t/2)*Real.log (t/2) : ℝ) : EReal) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 23, Example 2: Bell plus |00><00|
Read-back

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

For every real t∈[0,1]t\in[0,1]t∈[0,1], let ∣uv⟩|uv\rangle∣uv⟩ denote the standard basis vector indexed by (u,v)∈{false,true}2(u,v)\in\{\mathrm{false},\mathrm{true}\}^2(u,v)∈{false,true}2, put ∣Φ+⟩=(∣00⟩+∣11⟩)/2|\Phi^+\rangle=(|00\rangle+|11\rangle)/\sqrt2∣Φ+⟩=(∣00⟩+∣11⟩)/2​, and define σt=t∣Φ+⟩⟨Φ+∣+(1−t)∣00⟩⟨00∣\sigma_t=t|\Phi^+\rangle\langle\Phi^+|+(1-t)|00\rangle\langle00|σt​=t∣Φ+⟩⟨Φ+∣+(1−t)∣00⟩⟨00∣ and ρt=(1−t/2)∣00⟩⟨00∣+(t/2)∣11⟩⟨11∣\rho_t=(1-t/2)|00\rangle\langle00|+(t/2)|11\rangle\langle11|ρt​=(1−t/2)∣00⟩⟨00∣+(t/2)∣11⟩⟨11∣. Here 000 and 111 denote false and true. For matrices σ,ρ\sigma,\rhoσ,ρ, define D(σ∥ρ)=Re⁡tr⁡[σlog⁡σ−σlog⁡ρ]D(\sigma\|\rho)=\operatorname{Re}\operatorname{tr}[\sigma\log\sigma-\sigma\log\rho]D(σ∥ρ)=Retr[σlogσ−σlogρ] if ker⁡ρ⊆ker⁡σ\ker\rho\subseteq\ker\sigmakerρ⊆kerσ, and D(σ∥ρ)=+∞D(\sigma\|\rho)=+\inftyD(σ∥ρ)=+∞ otherwise, with matrix functions interpreted through functional calculus. Define E(σ)E(\sigma)E(σ) as the infimum of D(σ∥ρ)D(\sigma\|\rho)D(σ∥ρ) over all separable density matrices ρ\rhoρ: these are finite sums ∑jwjAj⊗Bj\sum_j w_j A_j\otimes B_j∑j​wj​Aj​⊗Bj​ with wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and each Aj,BjA_j,B_jAj​,Bj​ positive semidefinite with trace 111. The assertion is that ρt\rho_tρt​ is such a separable density matrix and D(σt∥ρt)≤D(σt∥ρ)D(\sigma_t\|\rho_t)\le D(\sigma_t\|\rho)D(σt​∥ρt​)≤D(σt​∥ρ) for every separable density matrix ρ\rhoρ, and, setting s±=(1±1−2t(1−t))/2s_\pm=(1\pm\sqrt{1-2t(1-t)})/2s±​=(1±1−2t(1−t)​)/2, that

E(σt)=s+log⁡s++s−log⁡s−−(1−t/2)log⁡(1−t/2)−(t/2)log⁡(t/2).E(\sigma_t)=s_+\log s_++s_-\log s_--(1-t/2)\log(1-t/2)-(t/2)\log(t/2).E(σt​)=s+​logs+​+s−​logs−​−(1−t/2)log(1−t/2)−(t/2)log(t/2).

The real expression on the right is regarded as an extended real number. Logarithms are natural logarithms; the functional calculus and real logarithm use log⁡0=0\log0=0log0=0, so zero terms contribute 000. Both endpoints t=0t=0t=0 and t=1t=1t=1 are included.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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