Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Density hull in an arbitrary operator basis

Proved
QAlgorithms.Papers.Independent.Support50.P35.general_density_convex_hull

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

prove2quantum

Let D>0D>0D>0, and let μα\mu_\alphaμα​, 1≤α≤D21\leq\alpha\leq D^21≤α≤D2, be a complete Hermitian orthonormal basis. Reconstruct ρ(c)=∑αcαμα\rho(c)=\sum_\alpha c_\alpha\mu_\alphaρ(c)=∑α​cα​μα​. Let VμV_\muVμ​ be the real quadratic locus defined by trace one, ∑αcα2=1\sum_\alpha c_\alpha^2=1∑α​cα2​=1, and ∑αβcαcβRe⁡tr⁡(μαμβμγ)=cγ\sum_{\alpha\beta}c_\alpha c_\beta\operatorname{Re}\operatorname{tr}(\mu_\alpha\mu_\beta\mu_\gamma)=c_\gamma∑αβ​cα​cβ​Retr(μα​μβ​μγ​)=cγ​ for every γ\gammaγ. Then

{c:ρ(c)⪰0, tr⁡ρ(c)=1}=conv⁡Vμ.\{c:\rho(c)\succeq0,\ \operatorname{tr}\rho(c)=1\}=\operatorname{conv}V_\mu.{c:ρ(c)⪰0, trρ(c)=1}=convVμ​.

All density matrices, including pure boundary matrices, occur on the left. This is the general-basis version of the source's state-space hull assertion.

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.16: general operator-basis density hull, including its pure boundary.
The source's rank-D means operators on a D-dimensional space here. -/
theorem general_density_convex_hull (D : ℕ) (hD : 0 < D)
    (mu : Fin (D ^ 2) → Matrix (Fin D) (Fin D) ℂ)
    (hmu : IsHermitianONBasis mu) :
    {c : Fin (D ^ 2) → ℝ | IsDensityMatrix (hermitianReconstruction mu c)} =
      convexHull ℝ (generalPureSet mu) := 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. 16, Unnumbered p.16: density hull in a general operator basis
Read-back

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

For every positive integer DDD and family (μk)k=0D2−1(\mu_k)_{k=0}^{D^2-1}(μk​)k=0D2−1​ of complex D×DD\times DD×D matrices, assume that each μk\mu_kμk​ is Hermitian, that tr⁡(μjμk)=1\operatorname{tr}(\mu_j\mu_k)=1tr(μj​μk​)=1 when j=kj=kj=k and 000 otherwise, and that every Hermitian D×DD\times DD×D matrix is a real linear combination of the μk\mu_kμk​. Then the set of real coordinate vectors c∈RD2c\in\mathbb R^{D^2}c∈RD2 for which ∑kckμk\sum_k c_k\mu_k∑k​ck​μk​ is positive semidefinite with trace 111 equals the real convex hull of the set of vectors satisfying

∑kckRe⁡tr⁡(μk)=1,∑kck2=1,∀g,∑a∑bcacbRe⁡tr⁡(μaμbμg)=cg.\sum_k c_k\operatorname{Re}\operatorname{tr}(\mu_k)=1,\qquad \sum_k c_k^2=1,\qquad \forall g,\quad \sum_a\sum_b c_a c_b\operatorname{Re}\operatorname{tr}(\mu_a\mu_b\mu_g)=c_g.k∑​ck​Retr(μk​)=1,k∑​ck2​=1,∀g,a∑​b∑​ca​cb​Retr(μa​μb​μg​)=cg​.

Here the convex hull consists of finite convex combinations, allowing zero weights.

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