Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (9): comparison of joint and separate smoothing

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.joint_separate_smoothing

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

prove2quantum

Let ρ\rhoρ be a finite density matrix with positive eigenvalues rjr_jrj​, and let 0≤ε<10\le\varepsilon<10≤ε<1. Over subsets JJJ with ∑j∈Jrj≥1−ε\sum_{j\in J}r_j\ge1-\varepsilon∑j∈J​rj​≥1−ε, define S0,ε=log⁡2min⁡∣J∣S_{0,\varepsilon}=\log_2\min|J|S0,ε​=log2​min∣J∣, S∞,ε=−log⁡2min⁡max⁡j∈JrjS_{\infty,\varepsilon}=-\log_2\min\max_{j\in J}r_jS∞,ε​=−log2​minmaxj∈J​rj​, and Δε=log⁡2min⁡(∣J∣max⁡j∈Jrj)\Delta_\varepsilon=\log_2\min(|J|\max_{j\in J}r_j)Δε​=log2​min(∣J∣maxj∈J​rj​). Then

Δε(ρ)≥S0,ε(ρ)−S∞,ε(ρ).\Delta_\varepsilon(\rho)\ge S_{0,\varepsilon}(\rho)-S_{\infty,\varepsilon}(\rho).Δε​(ρ)≥S0,ε​(ρ)−S∞,ε​(ρ).

At zero error, these three quantities equal S0(ρ)S_0(\rho)S0​(ρ), S∞(ρ)S_\infty(\rho)S∞​(ρ) and Δ(ρ)=S0−S∞\Delta(\rho)=S_0-S_\inftyΔ(ρ)=S0​−S∞​, respectively. Equality can also occur at nonzero error; no converse is claimed. The inequality distinguishes joint from separate spectral optimization.

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 p.3, (9): joint versus separate smoothing, and the zero-error identities.
"Generally only" is not strengthened to an iff characterization of equality. -/
theorem joint_separate_smoothing (rho : Matrix I I ℂ) (hrho : IsDensityMatrix rho)
    (epsilon : ℝ) (hepsilon : 0 ≤ epsilon) (hepsilonOne : epsilon < 1) :
    smoothZero rho epsilon - smoothInfinity rho epsilon ≤ smoothSpread rho epsilon ∧
    smoothZero rho 0 = entropyZero rho ∧ smoothInfinity rho 0 = entropyInfinity rho ∧
    smoothSpread rho 0 = spread rho := 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. 3, Equation (9): comparison of joint and separate smoothing
Read-back

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

For a finite index type III with decidable equality, a positive semidefinite complex I×II\times II×I matrix ρ\rhoρ with trace 111, and a real tolerance 0≤ϵ<10\le\epsilon<10≤ϵ<1, let λi\lambda_iλi​ be its ascending eigenvalues and let Rη={s⊆{i:λi>0}:∑i∈sλi≥1−η}\mathcal R_\eta=\{s\subseteq\{i:\lambda_i>0\}:\sum_{i\in s}\lambda_i\ge1-\eta\}Rη​={s⊆{i:λi​>0}:∑i∈s​λi​≥1−η}. Define

H0η=log⁡2min⁡s∈Rη∣s∣,H∞η=−log⁡2min⁡s∈Rηmax⁡i∈sλi,Δη=log⁡2min⁡s∈Rη(∣s∣max⁡i∈sλi).H_0^\eta=\log_2\min_{s\in\mathcal R_\eta}|s|,\qquad H_\infty^\eta=-\log_2\min_{s\in\mathcal R_\eta}\max_{i\in s}\lambda_i,\qquad \Delta^\eta=\log_2\min_{s\in\mathcal R_\eta} \left(|s|\max_{i\in s}\lambda_i\right).H0η​=log2​s∈Rη​min​∣s∣,H∞η​=−log2​s∈Rη​min​i∈smax​λi​,Δη=log2​s∈Rη​min​(∣s∣i∈smax​λi​).

For η=ϵ\eta=\epsilonη=ϵ and η=0\eta=0η=0, these families are nonempty and contain only nonempty subsets. If rrr is the complex dimension of the range of ρ\rhoρ and λmax⁡\lambda_{\max}λmax​ its largest eigenvalue, then

H0ϵ−H∞ϵ≤Δϵ,H00=log⁡2r,H∞0=−log⁡2λmax⁡,Δ0=log⁡2r+log⁡2λmax⁡.H_0^\epsilon-H_\infty^\epsilon\le\Delta^\epsilon,\qquad H_0^0=\log_2 r,\qquad H_\infty^0=-\log_2\lambda_{\max},\qquad \Delta^0=\log_2 r+\log_2\lambda_{\max}.H0ϵ​−H∞ϵ​≤Δϵ,H00​=log2​r,H∞0​=−log2​λmax​,Δ0=log2​r+log2​λmax​.

The endpoint ϵ=0\epsilon=0ϵ=0 is included; the density hypothesis excludes empty III.

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