Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pure-coordinate angles and attained maximal separation

Proved
QAlgorithms.Papers.Independent.Support50.P35.pure_state_angle

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

prove2quantum

Let D≥2D\geq2D≥2, and let r,sr,sr,s represent normalized pure states ρ=(I+r⋅λ)/D\rho=(I+r\cdot\lambda)/Dρ=(I+r⋅λ)/D and σ=(I+s⋅λ)/D\sigma=(I+s\cdot\lambda)/Dσ=(I+s⋅λ)/D. With θ\thetaθ their ordinary Euclidean coordinate angle,

tr⁡(ρσ)=1D+r⋅sD2,θ=arccos⁡Dtr⁡(ρσ)−1D−1≤arccos⁡11−D.\operatorname{tr}(\rho\sigma)=\frac1D+\frac{r\cdot s}{D^2},\qquad \theta=\arccos\frac{D\operatorname{tr}(\rho\sigma)-1}{D-1} \leq\arccos\frac1{1-D}.tr(ρσ)=D1​+D2r⋅s​,θ=arccosD−1Dtr(ρσ)−1​≤arccos1−D1​.

There exist pure coordinate vectors attaining the displayed upper bound. For every pure coordinate vector rrr, its antipode −r-r−r is pure if and only if D=2D=2D=2. The restriction D≥2D\geq2D≥2 makes both vectors nonzero and all angle denominators meaningful. This quantifies the maximal separation inside the pure-state subset of the coordinate sphere.

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, Eqs.(40)--(41): angle, attained maximal separation, and the
antipode restriction. D>=2 excludes zero vectors and zero denominator. -/
theorem pure_state_angle (D : ℕ) (hD : 2 ≤ D) :
    (∀ r s : TracelessIndex D → ℝ, r ∈ pureQuadraticSet D → s ∈ pureQuadraticSet D →
      (scaledGellmannState r * scaledGellmannState s).trace.re = 1 / (D : ℝ) + dotProduct r s / (D : ℝ) ^ 2 ∧
      coordinateAngle r s = Real.arccos
        (((D : ℝ) * (scaledGellmannState r * scaledGellmannState s).trace.re - 1) / ((D : ℝ) - 1)) ∧
      coordinateAngle r s ≤ Real.arccos (1 / (1 - (D : ℝ)))) ∧
    (∃ r s : TracelessIndex D → ℝ, r ∈ pureQuadraticSet D ∧ s ∈ pureQuadraticSet D ∧
      coordinateAngle r s = Real.arccos (1 / (1 - (D : ℝ)))) ∧
    (∀ r : TracelessIndex D → ℝ, r ∈ pureQuadraticSet D →
      (-r ∈ pureQuadraticSet D ↔ D = 2)) := 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 Eqs.(40)–(41): pure-state angle and maximal separation
Read-back

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

For every natural number D≥2D\ge2D≥2, let JDJ_DJD​ consist of labels h=1,…,D−1h=1,\ldots,D-1h=1,…,D−1 and (p,q,β)(p,q,\beta)(p,q,β) with 0≤p<q<D0\le p<q<D0≤p<q<D and Boolean β\betaβ. With matrix units EpqE_{pq}Epq​, 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​).

Let QDQ_DQD​ be the set of real families satisfying ∑jcj2=D(D−1)\sum_jc_j^2=D(D-1)∑j​cj2​=D(D−1) and, for every lll, ∑j,kcjckRe⁡tr⁡(GjGkGl)=(D−2)cl\sum_{j,k}c_jc_k\operatorname{Re}\operatorname{tr}(G_jG_kG_l)=(D-2)c_l∑j,k​cj​ck​Retr(Gj​Gk​Gl​)=(D−2)cl​; define ∠(r,s)=arccos⁡((∑jrjsj)/(∑jrj2∑jsj2))\angle(r,s)=\arccos((\sum_jr_js_j)/(\sqrt{\sum_jr_j^2}\sqrt{\sum_js_j^2}))∠(r,s)=arccos((∑j​rj​sj​)/(∑j​rj2​​∑j​sj2​​)). For every r,s∈QDr,s\in Q_Dr,s∈QD​, all three assertions hold:

Re⁡tr⁡(ρ(r)ρ(s))=1D+∑jrjsjD2,∠(r,s)=arccos⁡ ⁣(D Re⁡tr⁡(ρ(r)ρ(s))−1D−1),∠(r,s)≤arccos⁡ ⁣(11−D).\operatorname{Re}\operatorname{tr}(\rho(r)\rho(s)) =\frac1D+\frac{\sum_jr_js_j}{D^2},\qquad \angle(r,s)=\arccos\!\left(\frac{D\,\operatorname{Re}\operatorname{tr}(\rho(r)\rho(s))-1}{D-1}\right),\qquad \angle(r,s)\le\arccos\!\left(\frac1{1-D}\right).Retr(ρ(r)ρ(s))=D1​+D2∑j​rj​sj​​,∠(r,s)=arccos(D−1DRetr(ρ(r)ρ(s))−1​),∠(r,s)≤arccos(1−D1​).

There exist r,s∈QDr,s\in Q_Dr,s∈QD​ attaining the last bound, and for every r∈QDr\in Q_Dr∈QD​, its pointwise negative belongs to QDQ_DQD​ if and only if D=2D=2D=2.

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