The density-coordinate set is the pure-state convex hull
ProvedQAlgorithms.Papers.Independent.Support50.P35.density_coordinates_convex_hullFor , reconstruct in the paper's norm-one traceless Gellmann basis. Let be the quadratic locus , . Then
The hull uses finite convex combinations. The density set includes pure boundary points; “rank-D” is read as operators on a -dimensional space. This supplies the convex domain for the roof construction.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P35
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let , and, using matrix units, define
The set of real families for which is positive semidefinite and has complex trace exactly is precisely the real convex hull of
Thus the hull is the set of finite convex combinations of families satisfying the displayed equations; no closure is added. The case , with an empty coefficient index set, is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.