Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equations (10)–(11): smooth-spread floor and monotonicity

Open
QAlgorithms.Papers.Independent.Intakenext100.P61.smooth_floor_monotone

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

prove2quantum

Let ρ\rhoρ be a density matrix and 0≤ε′<ε<10\le\varepsilon'<\varepsilon<10≤ε′<ε<1. Define Δe(ρ)\Delta_e(\rho)Δe​(ρ) as the base-two logarithm of the minimum of ∣J∣max⁡j∈Jrj|J|\max_{j\in J}r_j∣J∣maxj∈J​rj​ over eigenvalue subsets of retained mass at least 1−e1-e1−e. Then

Δε(ρ)≥log⁡2(1−ε),Δε(ρ)≤Δε′(ρ).\Delta_\varepsilon(\rho)\ge\log_2(1-\varepsilon),\qquad \Delta_\varepsilon(\rho)\le\Delta_{\varepsilon'}(\rho).Δε​(ρ)≥log2​(1−ε),Δε​(ρ)≤Δε′​(ρ).

The retained operators are subnormalized, so the lower floor can be negative. These estimates control the smoothing dependence.

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, (10)--(11): the floor is log(1-epsilon), which can be negative. -/
theorem smooth_floor_monotone (rho : Matrix I I ℂ) (hrho : IsDensityMatrix rho)
    (epsilon epsilonSmall : ℝ) (hsmall : 0 ≤ epsilonSmall)
    (horder : epsilonSmall < epsilon) (hone : epsilon < 1) :
    logTwo (1 - epsilon) ≤ smoothSpread rho epsilon ∧
    smoothSpread rho epsilon ≤ smoothSpread rho epsilonSmall := 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, Equations (10)–(11): smooth-spread floor and monotonicity
Read-back

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

For a finite index type III with decidable equality and a positive semidefinite complex I×II\times II×I matrix ρ\rhoρ with trace 111, let ϵsmall,ϵ∈R\epsilon_{\mathrm{small}},\epsilon\in\mathbb Rϵsmall​,ϵ∈R satisfy 0≤ϵsmall<ϵ<10\le\epsilon_{\mathrm{small}}<\epsilon<10≤ϵsmall​<ϵ<1. For its ascending eigenvalues λi\lambda_iλi​, define

Δη(ρ)=log⁡2min⁡s⊆{i:λi>0}∑i∈sλi≥1−η(∣s∣max⁡i∈sλi).\Delta^\eta(\rho)= \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​).

The eligible families at both tolerances are nonempty and contain no empty subset. Then

log⁡2(1−ϵ)≤Δϵ(ρ)≤Δϵsmall(ρ).\log_2(1-\epsilon)\le\Delta^\epsilon(\rho) \le\Delta^{\epsilon_{\mathrm{small}}}(\rho).log2​(1−ϵ)≤Δϵ(ρ)≤Δϵsmall​(ρ).

The smaller tolerance may be zero, while the larger one is strictly positive. 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