Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§II, eqs.(1),(5): spread nonnegativity, flat-spectrum criterion and additivity

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.spread_properties

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ\rhoρ and σ\sigmaσ be finite-dimensional density matrices. All logarithms are base two. Write Δ(ρ)=log⁡2rank⁡ρ+log⁡2λmax⁡(ρ)\Delta(\rho)=\log_2\operatorname{rank}\rho+\log_2\lambda_{\max}(\rho)Δ(ρ)=log2​rankρ+log2​λmax​(ρ), and call a density matrix flat if all its positive eigenvalues are equal. Then

Δ(ρ)≥0,Δ(ρ)=0  ⟺  ρ is flat,Δ(ρ⊗σ)=Δ(ρ)+Δ(σ).\Delta(\rho)\ge0,\qquad \Delta(\rho)=0\iff\rho\text{ is flat},\qquad \Delta(\rho\otimes\sigma)=\Delta(\rho)+\Delta(\sigma).Δ(ρ)≥0,Δ(ρ)=0⟺ρ is flat,Δ(ρ⊗σ)=Δ(ρ)+Δ(σ).

A nonflat density has strictly positive spread. Flatness includes rank-one states. These properties measure spectral variation rather than the amount of entanglement.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P61
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P61

open scoped Matrix ComplexConjugate

open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)

open QAlgorithms.Papers.Independent.Dependency50.P35 (supportRank)

open QAlgorithms.Papers.Independent.Bridge50.P40 (entropyInfinity)

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

attribute [local instance] Classical.propDecidable

section SpectralResults

variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

/-- PDF pp.2--3, (1),(5): nonnegativity, exact flat-support criterion, strict
positivity otherwise, and tensor additivity. -/
theorem spread_properties (rho : Matrix I I ℂ) (sigma : Matrix J J ℂ)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
    0 ≤ spread rho ∧ (spread rho = 0 ↔ Flat rho) ∧ (¬ Flat rho → 0 < spread rho) ∧
    spread (Matrix.kronecker rho sigma) = spread rho + spread sigma := by sorry

end SpectralResults

end QAlgorithms.Papers.Independent.Intakenext100.P61

end
Source
On the communication cost of entanglement transformations, arXiv:quant-ph/0204092v3, PDF p. 2, §II, eqs.(1),(5): spread nonnegativity, flat-spectrum criterion and additivity
Read-back

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

For finite index types I,JI,JI,J with decidable equality and complex matrices ρ\rhoρ on III and σ\sigmaσ on JJJ, assume that both matrices are positive semidefinite and have complex trace 111. For either density matrix XXX, write rXr_XrX​ for the complex dimension of its range, λmax⁡(X)\lambda_{\max}(X)λmax​(X) for its largest eigenvalue, and define its spread by Δ(X)=log⁡2rX+log⁡2λmax⁡(X)\Delta(X)=\log_2 r_X+\log_2\lambda_{\max}(X)Δ(X)=log2​rX​+log2​λmax​(X). Say that XXX is flat when every pair of strictly positive eigenvalues, counted with their indexed multiplicities, have equal values. Then

0≤Δ(ρ),Δ(ρ)=0 ⟺ ρ is flat,ρ is not flat ⟹ 0<Δ(ρ),0\le\Delta(\rho),\qquad \Delta(\rho)=0\ \Longleftrightarrow\ \rho\text{ is flat},\qquad \rho\text{ is not flat}\ \Longrightarrow\ 0<\Delta(\rho),0≤Δ(ρ),Δ(ρ)=0 ⟺ ρ is flat,ρ is not flat ⟹ 0<Δ(ρ),

and Δ(ρ⊗σ)=Δ(ρ)+Δ(σ)\Delta(\rho\otimes\sigma)=\Delta(\rho)+\Delta(\sigma)Δ(ρ⊗σ)=Δ(ρ)+Δ(σ), where (ρ⊗σ)(i,j),(i′,j′)=ρii′σjj′(\rho\otimes\sigma)_{(i,j),(i',j')}=\rho_{ii'}\sigma_{jj'}(ρ⊗σ)(i,j),(i′,j′)​=ρii′​σjj′​. The index types are not separately assumed nonempty, but the density-matrix hypotheses cannot hold on an empty index type.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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