Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§IV, Lemma 5: maximal rescaled distance under a spectral floor

Proved
QAlgorithms.Papers.Independent.Gap48.P40.distanceSpectralFloor

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

prove2quantum

All matrices act on a complex Hilbert space of positive finite dimension ddd. A state is positive semidefinite with trace one. All logarithms are natural, and D(ρ∥σ)D(\rho\|\sigma)D(ρ∥σ) denotes support-aware Umegaki relative entropy, with value +∞+\infty+∞ when support containment fails. Let NNN be any genuine unitarily invariant norm on d×dd\times dd×d complex matrices. Write E=diag⁡(1,0,…)E=\operatorname{diag}(1,0,\ldots)E=diag(1,0,…) and, when d≥2d\ge2d≥2, F=diag⁡(1,−1,0,…)F=\operatorname{diag}(1,-1,0,\ldots)F=diag(1,−1,0,…). The symbols ∥⋅∥∞\|\cdot\|_\infty∥⋅∥∞​, ∥⋅∥1\|\cdot\|_1∥⋅∥1​ and ∥⋅∥2\|\cdot\|_2∥⋅∥2​ mean operator, full trace and Hilbert–Schmidt norms, respectively. Suppose d≥2d\ge2d≥2, ρ,σ\rho,\sigmaρ,σ are states and σ≥βI\sigma\ge\beta Iσ≥βI in Loewner order, where β∈R\beta\in\mathbb Rβ∈R. Then

N(ρ−σ)N(F)≤1−β.\frac{N(\rho-\sigma)}{N(F)}\le1-\beta.N(F)N(ρ−σ)​≤1−β.

The minimum-eigenvalue floor controls every rescaled UI distance.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P40
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder Topology Matrix.Norms.L2Operator

open Filter MeasureTheory Asymptotics

open QAlgorithms

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P50 (IsUINorm)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open QAlgorithms.Papers.Independent.Information100.P60 (copies)

open QAlgorithms.Papers.Independent.Information100.P44 (Mat)

namespace QAlgorithms.Papers.Independent.Gap48.P40

/-- PDF p.4, Lemma 5: beta is a lower spectral floor, with no positivity restriction. -/
theorem distanceSpectralFloor {d : ℕ} (hd : 2 ≤ d) (N : Mat d → ℝ)
    (hN : IsUINorm N) (rho sigma : Mat d) (hrho : IsDensityMatrix rho)
    (hsigma : IsDensityMatrix sigma) (beta : ℝ)
    (hfloor : (sigma - (beta : ℂ) • (1 : Mat d)).PosSemidef) :
    rescaled N (rho - sigma) ≤ 1 - beta := by sorry

end QAlgorithms.Papers.Independent.Gap48.P40

end
Source
Continuity bounds on the quantum relative entropy, arXiv:quant-ph/0503218v3, PDF p. 4, §IV, Lemma 5: maximal rescaled distance under a spectral floor
Read-back

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

For every natural number d≥2d\ge2d≥2, every real-valued function NNN on complex d×dd\times dd×d matrices that is nonnegative, vanishes exactly at zero, satisfies the triangle inequality and complex absolute homogeneity, and is invariant under left and right unitary multiplication, every pair of positive-semidefinite matrices ρ,σ\rho,\sigmaρ,σ with tr⁡ρ=tr⁡σ=1\operatorname{tr}\rho=\operatorname{tr}\sigma=1trρ=trσ=1, and every real β\betaβ such that σ−βI\sigma-\beta Iσ−βI is positive semidefinite,

N(ρ−σ)N ⁣(diag⁡(1,−1,0,…,0))≤1−β.\frac{N(\rho-\sigma)} {N\!\left(\operatorname{diag}(1,-1,0,\ldots,0)\right)} \le 1-\beta.N(diag(1,−1,0,…,0))N(ρ−σ)​≤1−β.

There is no separate assumption that β\betaβ is positive; zero and negative values are included whenever the stated semidefinite inequality holds.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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