Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary after Theorem 7: comparison with reduced entropy

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.bures_le_pure_entropy

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.

Let ∣ψ⟩|\psi\rangle∣ψ⟩ be any unit vector on two qubits, put σ=∣ψ⟩⟨ψ∣\sigma=|\psi\rangle\langle\psi|σ=∣ψ⟩⟨ψ∣ and σB=Tr⁡Aσ\sigma_B=\operatorname{Tr}_A\sigmaσB​=TrA​σ, and define EB(σ)=inf⁡ρ∈Sep[2−2Tr⁡σρσ]E_B(\sigma)=\inf_{\rho\in\mathrm{Sep}}[2-2\operatorname{Tr}\sqrt{\sqrt\sigma\rho\sqrt\sigma}]EB​(σ)=infρ∈Sep​[2−2Trσ​ρσ​​]. Then

EB(σ)≤−Tr⁡(σBln⁡σB).E_B(\sigma)\le-\operatorname{Tr}(\sigma_B\ln\sigma_B).EB​(σ)≤−Tr(σB​lnσB​).

The statement uses the source’s actual root-fidelity generator, independently of its erroneous Theorem 7 formula.

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

/-- Corollary, PDF p.18, Eq.(45): the actual Bures-generated measure is bounded by
pure-state reduced entropy, in the two-qubit setting. The false intermediate (46) is not used. -/
theorem bures_le_pure_entropy (psi : EuclideanSpace ℂ (Bool × Bool)) (hpsi : ‖psi‖=1) :
    buresEntanglement (pureDensity psi) ≤ (entropy (traceLeft (pureDensity psi)) : EReal) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 18, Corollary after Theorem 7: comparison with reduced entropy
Read-back

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

For every vector ψ∈CBool×Bool\psi\in\mathbb C^{\mathrm{Bool}\times\mathrm{Bool}}ψ∈CBool×Bool with Euclidean norm 111, set P=ψψ†P=\psi\psi^\daggerP=ψψ† and PJ(b,b′)=∑a∈BoolP((a,b),(a,b′))P_J(b,b')=\sum_{a\in\mathrm{Bool}}P((a,b),(a,b'))PJ​(b,b′)=∑a∈Bool​P((a,b),(a,b′)). For positive semidefinite matrices A,BA,BA,B, write

Froot(A,B)=Re⁡tr⁡A B A,F_{\mathrm{root}}(A,B) =\operatorname{Re}\operatorname{tr} \sqrt{\sqrt A\,B\,\sqrt A},Froot​(A,B)=RetrA​BA​​,

where square roots are functional-calculus matrix functions. Then, in the extended reals,

inf⁡ρ separable(2−2Froot(P,ρ))≤−Re⁡tr⁡f(PJ),f(u)=ulog⁡u.\inf_{\rho\text{ separable}}\bigl(2-2F_{\mathrm{root}}(P,\rho)\bigr) \le -\operatorname{Re}\operatorname{tr}f(P_J), \qquad f(u)=u\log u.ρ separableinf​(2−2Froot​(P,ρ))≤−Retrf(PJ​),f(u)=ulogu.

Here separable means a finite convex combination of tensor products of positive semidefinite trace-one matrices on the two Boolean registers, and the logarithm is natural with the total-function convention log⁡0=0\log0=0log0=0.

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