Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5: convexity

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.relativeEntanglement_convex

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 density matrices σ1,σ2\sigma_1,\sigma_2σ1​,σ2​ on the same bipartite register and weights x1,x2≥0x_1,x_2\ge0x1​,x2​≥0 with x1+x2=1x_1+x_2=1x1​+x2​=1,

ER(x1σ1+x2σ2)≤x1ER(σ1)+x2ER(σ2).E_R(x_1\sigma_1+x_2\sigma_2)\le x_1E_R(\sigma_1)+x_2E_R(\sigma_2).ER​(x1​σ1​+x2​σ2​)≤x1​ER​(σ1​)+x2​ER​(σ2​).

This is convexity of the relative-entropy-generated measure.

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

/-- Theorem 5, PDF pp.15–16: convexity of relative entropy of entanglement. -/
theorem relativeEntanglement_convex {I J : Type} [Fintype I] [Fintype J]
    [DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J]
    (sigma tau : Matrix (I × J) (I × J) ℂ)
    (hsigma : IsDensityMatrix sigma) (htau : IsDensityMatrix tau)
    (x y : ℝ) (hx : 0 ≤ x) (hy : 0 ≤ y) (hxy : x+y=1) :
    relativeEntanglementNats ((x : ℂ) • sigma + (y : ℂ) • tau) ≤
      (x : EReal) * relativeEntanglementNats sigma + (y : EReal) * relativeEntanglementNats tau := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 15, Theorem 5: convexity
Read-back

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

For finite nonempty types I,JI,JI,J with decidable equality, let σ,τ\sigma,\tauσ,τ be positive semidefinite complex matrices on I×JI\times JI×J, each of trace 111, and let x,yx,yx,y be nonnegative real numbers with x+y=1x+y=1x+y=1. For any bipartite matrix AAA, define E(A)=inf⁡ω separableD(A∥ω)E(A)=\inf_{\omega\text{ separable}}D(A\Vert\omega)E(A)=infω separable​D(A∥ω), where separable matrices are finite convex combinations of tensor products of positive semidefinite trace-one matrices, and D(A∥B)D(A\Vert B)D(A∥B) equals Re⁡tr⁡(f(A)−Alog⁡B)\operatorname{Re}\operatorname{tr}(f(A)-A\log B)Retr(f(A)−AlogB) if ker⁡B⊆ker⁡A\ker B\subseteq\ker AkerB⊆kerA, and +∞+\infty+∞ otherwise; here f(u)=ulog⁡uf(u)=u\log uf(u)=ulogu, matrix functions use functional calculus, and log⁡0=0\log0=0log0=0. Then

E(xσ+yτ)≤xE(σ)+yE(τ)E(x\sigma+y\tau)\le xE(\sigma)+yE(\tau)E(xσ+yτ)≤xE(σ)+yE(τ)

in the extended real numbers, with real weights embedded into that number system. The allowed weights include x=0x=0x=0 and y=0y=0y=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