Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5: one-sided trace-norm robustness

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.trace_norm_robustness

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

prove2quantum

Let ρ,σ\rho,\sigmaρ,σ be density matrices on the same finite-dimensional system, and let 0≤ε<10\le\varepsilon<10≤ε<1. Write ∥⋅∥1\|\cdot\|_1∥⋅∥1​ for the trace norm, Δ(ρ)=log⁡2(rank⁡ρ λmax⁡(ρ))\Delta(\rho)=\log_2(\operatorname{rank}\rho\,\lambda_{\max}(\rho))Δ(ρ)=log2​(rankρλmax​(ρ)), and Δe\Delta_eΔe​ for the retained-eigenvalue-subset spread at mass at least 1−e1-e1−e. If ∥ρ−σ∥1≤ε\|\rho-\sigma\|_1\le\varepsilon∥ρ−σ∥1​≤ε, then

Δ(ρ)≥Δε(σ)+log⁡2(1−ε).\Delta(\rho)\ge\Delta_{\sqrt\varepsilon}(\sigma)+\log_2(1-\sqrt\varepsilon).Δ(ρ)≥Δε​​(σ)+log2​(1−ε​).

The endpoint ε=0\varepsilon=0ε=0 is included. This is a one-sided robustness estimate for the unsmoothed spread.

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.4, Lemma 5: one-sided trace-norm robustness, including epsilon=0. -/
theorem trace_norm_robustness (rho sigma : Matrix I I ℂ)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (epsilon : ℝ) (hzero : 0 ≤ epsilon) (hone : epsilon < 1)
    (hclose : traceNorm (rho - sigma) ≤ epsilon) :
    smoothSpread sigma (Real.sqrt epsilon) + logTwo (1 - Real.sqrt epsilon) ≤ 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. 4, Lemma 5: one-sided trace-norm robustness
Read-back

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

For a finite index type III with decidable equality, let ρ,σ\rho,\sigmaρ,σ be positive semidefinite complex I×II\times II×I matrices of trace 111, and let 0≤ϵ<10\le\epsilon<10≤ϵ<1. Assume

∥ρ−σ∥1≤ϵ,∥M∥1=Re⁡tr⁡M†M.\|\rho-\sigma\|_1\le\epsilon, \qquad \|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M}.∥ρ−σ∥1​≤ϵ,∥M∥1​=RetrM†M​.

For the ascending eigenvalues λi\lambda_iλi​ of σ\sigmaσ, put

Δη(σ)=log⁡2min⁡s⊆{i:λi>0}∑i∈sλi≥1−η(∣s∣max⁡i∈sλi),\Delta^\eta(\sigma)= \log_2\min_{\substack{s\subseteq\{i:\lambda_i>0\}\\ \sum_{i\in s}\lambda_i\ge1-\eta}} \left(|s|\max_{i\in s}\lambda_i\right),Δη(σ)=log2​s⊆{i:λi​>0}∑i∈s​λi​≥1−η​min​(∣s∣i∈smax​λi​),

and write rρr_\rhorρ​ for the complex dimension of the range of ρ\rhoρ and λmax⁡(ρ)\lambda_{\max}(\rho)λmax​(ρ) for its largest eigenvalue. Then

Δϵ(σ)+log⁡2(1−ϵ)≤log⁡2rρ+log⁡2λmax⁡(ρ).\Delta^{\sqrt\epsilon}(\sigma)+\log_2(1-\sqrt\epsilon) \le \log_2 r_\rho+\log_2\lambda_{\max}(\rho).Δϵ​(σ)+log2​(1−ϵ​)≤log2​rρ​+log2​λmax​(ρ).

The tolerance ϵ=0\epsilon=0ϵ=0 is included; the retention family is nonempty, its subsets are nonempty, and the logarithm log⁡2(1−ϵ) \log_2(1-\sqrt\epsilon)log2​(1−ϵ​) has positive argument. The density hypotheses exclude 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