Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Power-purity costs and their product-state zero set

Proved
QAlgorithms.Papers.Independent.Support50.P35.power_purity_family

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

prove2quantum

Let 1≤N≤M1\leq N\leq M1≤N≤M, let a∈Na\in\mathbb Na∈N with a>1a>1a>1, and put fa(ρ)=2(1−tr⁡(ρa))f_a(\rho)=2(1-\operatorname{tr}(\rho^a))fa​(ρ)=2(1−tr(ρa)) for density matrices on CM\mathbb C^MCM. The function is continuous, unitarily invariant, and concave: for every unitary UUU, density matrices ω1,ω2\omega_1,\omega_2ω1​,ω2​, and p∈[0,1]p\in[0,1]p∈[0,1],

fa(UρU†)=fa(ρ),fa(pω1+(1−p)ω2)≥pfa(ω1)+(1−p)fa(ω2).f_a(U\rho U^\dagger)=f_a(\rho),\qquad f_a(p\omega_1+(1-p)\omega_2)\geq p f_a(\omega_1)+(1-p)f_a(\omega_2).fa​(UρU†)=fa​(ρ),fa​(pω1​+(1−p)ω2​)≥pfa​(ω1​)+(1−p)fa​(ω2​).

It vanishes on normalized pure density matrices. For every unit vector ψ∈CM⊗CN\psi\in\mathbb C^M\otimes\mathbb C^Nψ∈CM⊗CN,

fa(tr⁡B∣ψ⟩⟨ψ∣)=0  ⟺  ψ=u⊗v for unit vectors u,v.f_a(\operatorname{tr}_B|\psi\rangle\langle\psi|)=0 \iff \psi=u\otimes v\text{ for unit vectors }u,v.fa​(trB​∣ψ⟩⟨ψ∣)=0⟺ψ=u⊗v for unit vectors u,v.

The partial trace removes the second factor, and the coefficient 2 is literal. This supplies the source's family of pure-state marginal costs and its exact product-state zero set.

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.18, Eq.(56): unitary invariance, concavity, pure-state vanishing,
and exactly the product-vector zero set for the induced pure bipartite cost. -/
theorem power_purity_family (M N a : ℕ) (hN : 0 < N) (hNM : N ≤ M) (ha : 1 < a) :
    IsMarginalCost (powerPurityCost (I := Fin M) a) ∧
    (∀ rho : Matrix (Fin M) (Fin M) ℂ, QAlgorithms.Papers.Independent.Information100.P08.IsPure rho → powerPurityCost a rho = 0) ∧
    (∀ psi : EuclideanSpace ℂ (Fin M × Fin N), IsState psi →
      (powerPurityCost a (traceRight (pureDensity psi)) = 0 ↔
        ∃ u : EuclideanSpace ℂ (Fin M), ∃ v : EuclideanSpace ℂ (Fin N),
          IsState u ∧ IsState v ∧ psi = tensorVec u v)) := 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. 18, Unnumbered Eq.(56): properties of power-purity costs and pure-state zero set
Read-back

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

For all natural numbers M,N,aM,N,aM,N,a with 0<N≤M0<N\le M0<N≤M and 1<a1<a1<a, define Fa(ρ)=2(1−Re⁡tr⁡(ρa))F_a(\rho)=2(1-\operatorname{Re}\operatorname{tr}(\rho^a))Fa​(ρ)=2(1−Retr(ρa)) for every complex M×MM\times MM×M matrix ρ\rhoρ. Then FaF_aFa​ is continuous and concave on the convex set of positive semidefinite trace-111 matrices and satisfies Fa(UρU†)=Fa(ρ)F_a(U\rho U^\dagger)=F_a(\rho)Fa​(UρU†)=Fa​(ρ) for every such ρ\rhoρ and every unitary UUU. Moreover, Fa(ρ)=0F_a(\rho)=0Fa​(ρ)=0 whenever ρ=vv†\rho=vv^\daggerρ=vv† for a vector v∈CMv\in\mathbb C^Mv∈CM with ∥v∥=1\|v\|=1∥v∥=1. Finally, for every vector ψ∈CM×N\psi\in\mathbb C^{M\times N}ψ∈CM×N with ∥ψ∥=1\|\psi\|=1∥ψ∥=1, let RψR_\psiRψ​ be the M×MM\times MM×M matrix with entries (Rψ)ij=∑b=0N−1ψi,bψj,b‾(R_\psi)_{ij}=\sum_{b=0}^{N-1}\psi_{i,b}\overline{\psi_{j,b}}(Rψ​)ij​=∑b=0N−1​ψi,b​ψj,b​​. Then

Fa(Rψ)=0⟺∃u∈CM, ∃v∈CN,∥u∥=∥v∥=1 and ψi,b=uivb for all i,b.F_a(R_\psi)=0 \quad\Longleftrightarrow\quad \exists u\in\mathbb C^M,\ \exists v\in\mathbb C^N,\quad \|u\|=\|v\|=1\ \text{and}\ \psi_{i,b}=u_i v_b\ \text{for all }i,b.Fa​(Rψ​)=0⟺∃u∈CM, ∃v∈CN,∥u∥=∥v∥=1 and ψi,b​=ui​vb​ for all i,b.
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