Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The measure E_W is not convex

Open
QAlgorithms.Papers.Independent.Intakethird100.P83.nonconvexity

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

There exist nonzero finite local dimensions, normalized bipartite states ρ,σ\rho,\sigmaρ,σ on the same product space, and a real parameter 0<p<10<p<10<p<1 for which

EW(pρ+(1−p)σ)>pEW(ρ)+(1−p)EW(σ).E_W\bigl(p\rho+(1-p)\sigma\bigr)>pE_W(\rho)+(1-p)E_W(\sigma).EW​(pρ+(1−p)σ)>pEW​(ρ)+(1−p)EW​(σ).

Here EWE_WEW​ is the base-two logarithm of SDP (7). This existential violation of convexity is compatible with the monotonicity on average established in Theorem 3.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P83
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Intakethird100.P83

open QAlgorithms.Papers.Independent.Support50.P11 (Loewner)

open QAlgorithms.Papers.Independent.Dependency50.P32 (partialTranspose)

open QAlgorithms.Papers.Independent.Information100.P34 (supportProjector)

variable {A B C D : Type*}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D]

variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]

/-- Unnumbered nonconvexity assertion following Theorem 3, PDF p.3.
The violating pair and mixing parameter exist; no violation is assumed. -/
theorem nonconvexity :
    ∃ a b : ℕ, ∃ rho sigma : Matrix (Fin (a+1) × Fin (b+1)) (Fin (a+1) × Fin (b+1)) ℂ,
    IsDensityMatrix rho ∧ IsDensityMatrix sigma ∧
    ∃ p : ℝ, 0 < p ∧ p < 1 ∧
    p * entanglementW rho + (1-p) * entanglementW sigma <
      entanglementW ((p : ℂ) • rho + ((1-p : ℝ) : ℂ) • sigma) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P83

end
Source
Improved Semidefinite Programming Upper Bound on Distillable Entanglement, arXiv:1601.07940v4, PDF p. 3, Unnumbered result following Theorem 3: nonconvexity
Read-back

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

There exist natural numbers a,ba,ba,b, positive semidefinite complex matrices ρ,σ\rho,\sigmaρ,σ of trace 111 indexed by {0,…,a}×{0,…,b}\{0,\ldots,a\}\times\{0,\ldots,b\}{0,…,a}×{0,…,b}, and a real number ppp with 0<p<10<p<10<p<1, such that

pW(ρ)+(1−p)W(σ)<W(pρ+(1−p)σ).pW(\rho)+(1-p)W(\sigma) < W\bigl(p\rho+(1-p)\sigma\bigr).pW(ρ)+(1−p)W(σ)<W(pρ+(1−p)σ).

Here, for every matrix XXX on this bipartite space,

W(X)=log⁡2sup⁡{Re⁡tr⁡(XΓR):R=R†, ∥R∥op≤1, RΓ≥0},X(i,j),(i′,j′)Γ=X(i,j′),(i′,j),W(X)=\log_2\sup\{\operatorname{Re}\operatorname{tr}(X^\Gamma R): R=R^\dagger,\ \|R\|_{\mathrm{op}}\le1,\ R^\Gamma\ge0\}, \qquad X^\Gamma_{(i,j),(i',j')}=X_{(i,j'),(i',j)},W(X)=log2​sup{Retr(XΓR):R=R†, ∥R∥op​≤1, RΓ≥0},X(i,j),(i′,j′)Γ​=X(i,j′),(i′,j)​,

and ∥⋅∥op\|\cdot\|_{\mathrm{op}}∥⋅∥op​ is the Euclidean operator norm. The local dimensions are a+1a+1a+1 and b+1b+1b+1, so dimension 111 is included among the existentially quantified possibilities.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me