Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§VII.B, explicit small-distance equality construction

Proved
QAlgorithms.Papers.Independent.Gap48.P40.smallDistanceEquality

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

prove2quantum

Let d≥3d\ge3d≥3, 0<β≤1/d0<\beta\le1/d0<β≤1/d and 0≤T≤β0\le T\le\beta0≤T≤β. With e3e_3e3​ the third basis vector and F=diag⁡(1,−1,0,…)F=\operatorname{diag}(1,-1,0,\ldots)F=diag(1,−1,0,…), define σ=βI+(1−dβ)∣e3⟩⟨e3∣\sigma=\beta I+(1-d\beta)|e_3\rangle\langle e_3|σ=βI+(1−dβ)∣e3​⟩⟨e3​∣ and ρ=σ+TF\rho=\sigma+TFρ=σ+TF. These are states, their reference minimum eigenvalue is β\betaβ, and

12∥ρ−σ∥1=T,D(ρ∥σ)=(β+T)log⁡β+Tβ+(β−T)log⁡β−Tβ.\frac12\|\rho-\sigma\|_1=T,\qquad D(\rho\|\sigma)=(\beta+T)\log\frac{\beta+T}{\beta}+(\beta-T)\log\frac{\beta-T}{\beta}.21​∥ρ−σ∥1​=T,D(ρ∥σ)=(β+T)logββ+T​+(β−T)logββ−T​.

This attains the small-distance upper bound in each fixed dimension at least three, including its boundary values.

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.11: the source's explicit small-distance equality construction,
with third coordinate distinct from the first two and the actual minimum beta. -/
theorem smallDistanceEquality {d : ℕ} (hd : 3 ≤ d) (beta T : ℝ)
    (hbeta : 0 < beta ∧ beta ≤ 1 / (d : ℝ)) (hT : 0 ≤ T ∧ T ≤ beta) :
    IsDensityMatrix (smallRho d beta T) ∧ IsDensityMatrix (smallSigma d beta) ∧
    minEigenvalue (smallSigma d beta) = beta ∧
    traceNorm (smallRho d beta T - smallSigma d beta) / 2 = T ∧
    relativeEntropy (smallRho d beta T) (smallSigma d beta) =
      ((traceSmallBound beta T : ℝ) : EReal) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P40

end
Source
Continuity bounds on the quantum relative entropy, arXiv:quant-ph/0503218v3, PDF p. 11, §VII.B, explicit small-distance equality construction
Read-back

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

For every natural number d≥3d\ge3d≥3 and real numbers β,T\beta,Tβ,T satisfying 0<β≤1/d0<\beta\le1/d0<β≤1/d and 0≤T≤β0\le T\le\beta0≤T≤β, let σ\sigmaσ be the diagonal complex d×dd\times dd×d matrix whose entry at index 222 is 1−(d−1)β1-(d-1)\beta1−(d−1)β and whose other diagonal entries are β\betaβ, with indices numbered from 000. Let ρ\rhoρ be the same diagonal matrix except that its entries at indices 000 and 111 are respectively β+T\beta+Tβ+T and β−T\beta-Tβ−T. Then both ρ\rhoρ and σ\sigmaσ are positive semidefinite with trace 111, the smallest eigenvalue of σ\sigmaσ is β\betaβ, and

∥ρ−σ∥12=T,D(ρ∥σ)=(β+T)log⁡β+Tβ+(β−T)log⁡β−Tβ.\frac{\|\rho-\sigma\|_1}{2}=T,\qquad D(\rho\|\sigma) =(\beta+T)\log\frac{\beta+T}{\beta} +(\beta-T)\log\frac{\beta-T}{\beta}.2∥ρ−σ∥1​​=T,D(ρ∥σ)=(β+T)logββ+T​+(β−T)logββ−T​.

Here ∥M∥1=Re⁡Tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{M^\dagger M}∥M∥1​=ReTrM†M​, using matrix functional calculus. The extended-real quantity D(A∥B)D(A\|B)D(A∥B) is Re⁡Tr⁡(f(A)−Alog⁡B)\operatorname{Re}\operatorname{Tr}\bigl(f(A)-A\log B\bigr)ReTr(f(A)−AlogB), where f(x)=xlog⁡xf(x)=x\log xf(x)=xlogx, if ker⁡B⊆ker⁡A\ker B\subseteq\ker AkerB⊆kerA, and is +∞+\infty+∞ otherwise; the displayed right-hand side is embedded in the extended reals. All logarithms are natural, with the total-function convention log⁡0=0\log0=0log0=0. Both endpoints T=0T=0T=0 and T=βT=\betaT=β are included; at the latter endpoint, the term with coefficient β−T\beta-Tβ−T is zero.

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