Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The density-coordinate set is the pure-state convex hull

Proved
QAlgorithms.Papers.Independent.Support50.P35.density_coordinates_convex_hull

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

prove2quantum

For D≥1D\geq1D≥1, reconstruct ρ(c)=(I+∑jcjλj)/D\rho(c)=(I+\sum_jc_j\lambda_j)/Dρ(c)=(I+∑j​cj​λj​)/D in the paper's norm-one traceless Gellmann basis. Let P⋆\mathcal P_\starP⋆​ be the quadratic locus c⋅c=D(D−1)c\cdot c=D(D-1)c⋅c=D(D−1), c⋆c=(D−2)cc\star c=(D-2)cc⋆c=(D−2)c. Then

{c:ρ(c)⪰0, tr⁡ρ(c)=1}=conv⁡P⋆.\{c:\rho(c)\succeq0,\ \operatorname{tr}\rho(c)=1\}=\operatorname{conv}\mathcal P_\star.{c:ρ(c)⪰0, trρ(c)=1}=convP⋆​.

The hull uses finite convex combinations. The density set includes pure boundary points; “rank-D” is read as operators on a DDD-dimensional space. This supplies the convex domain for the roof construction.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P35
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate Topology Manifold

namespace QAlgorithms.Papers.Independent.Support50.P35

/-- PDF p.14: the density-coordinate set is the finite convex hull of the
pure quadratic variety; pure boundary states are included among densities. -/
theorem density_coordinates_convex_hull (D : ℕ) (hD : 0 < D) :
    {c : TracelessIndex D → ℝ | IsDensityMatrix (scaledGellmannState c)} =
      convexHull ℝ (pureQuadraticSet D) := by sorry

end QAlgorithms.Papers.Independent.Support50.P35

end
Source
Convex Hulls of Varieties and Entanglement Measures Based on the Roof Construction, arXiv:quant-ph/0402055v2, PDF p. 14, Unnumbered p.14: all density coordinates form the convex hull of pure coordinates
Read-back

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

For every natural number D>0D>0D>0, let JD={1,…,D−1}⊔{(p,q,β):0≤p<q<D, β∈{false,true}}J_D=\{1,\ldots,D-1\}\sqcup\{(p,q,\beta):0\le p<q<D,\ \beta\in\{\mathrm{false},\mathrm{true}\}\}JD​={1,…,D−1}⊔{(p,q,β):0≤p<q<D, β∈{false,true}}, and, using matrix units, define

Gh=∑i<hEii−hEhhh(h+1),Gpq,false=Epq+Eqp2,Gpq,true=−iEpq+iEqp2,ρ(c)=1D(ID+∑jcjGj).G_h=\frac{\sum_{i<h}E_{ii}-hE_{hh}}{\sqrt{h(h+1)}},\quad G_{pq,\mathrm{false}}=\frac{E_{pq}+E_{qp}}{\sqrt2},\quad G_{pq,\mathrm{true}}=\frac{-\mathrm iE_{pq}+\mathrm iE_{qp}}{\sqrt2},\qquad \rho(c)=\frac1D\left(I_D+\sum_jc_jG_j\right).Gh​=h(h+1)​∑i<h​Eii​−hEhh​​,Gpq,false​=2​Epq​+Eqp​​,Gpq,true​=2​−iEpq​+iEqp​​,ρ(c)=D1​(ID​+j∑​cj​Gj​).

The set of real families c:JD→Rc:J_D\to\mathbb Rc:JD​→R for which ρ(c)\rho(c)ρ(c) is positive semidefinite and has complex trace exactly 111 is precisely the real convex hull of

{c: ∑jcj2=D(D−1) and ∀l, ∑j,kcjckRe⁡tr⁡(GjGkGl)=(D−2)cl}.\left\{c:\ \sum_jc_j^2=D(D-1)\ \text{and}\ \forall l,\ \sum_{j,k}c_jc_k\operatorname{Re}\operatorname{tr}(G_jG_kG_l)=(D-2)c_l\right\}.⎩⎨⎧​c: j∑​cj2​=D(D−1) and ∀l, j,k∑​cj​ck​Retr(Gj​Gk​Gl​)=(D−2)cl​⎭⎬⎫​.

Thus the hull is the set of finite convex combinations of families satisfying the displayed equations; no closure is added. The case D=1D=1D=1, with an empty coefficient index set, is included.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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