Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§VI, Lemma 8: a commuting pair attains the minimum

Proved
QAlgorithms.Papers.Independent.Gap48.P40.commutingMinimum

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. For d≥2d\ge2d≥2 and 0≤T≤N(F)0\le T\le N(F)0≤T≤N(F), let mN(T)m_N(T)mN​(T) be the extended infimum at raw distance TTT. There exist states ρ,σ\rho,\sigmaρ,σ, with Δ=ρ−σ\Delta=\rho-\sigmaΔ=ρ−σ, such that

N(Δ)=T,[σ,Δ]=0,D(ρ∥σ)=mN(T).N(\Delta)=T,\qquad[\sigma,\Delta]=0,\qquad D(\rho\|\sigma)=m_N(T).N(Δ)=T,[σ,Δ]=0,D(ρ∥σ)=mN​(T).

A commuting pair attains the minimum; the statement also includes the infinite endpoint.

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 pp.6–7, Lemma 8: a commuting pair attains the minimum, including infinity. -/
theorem commutingMinimum {d : ℕ} (hd : 2 ≤ d) (N : Mat d → ℝ) (hN : IsUINorm N)
    (T : ℝ) (hT : 0 ≤ T ∧ T ≤ N (matrixF d)) :
    ∃ rho sigma : Mat d, IsDensityMatrix rho ∧ IsDensityMatrix sigma ∧
      N (rho - sigma) = T ∧ sigma * (rho - sigma) = (rho - sigma) * sigma ∧
      relativeEntropy rho sigma = minimumAt d N T := by sorry

end QAlgorithms.Papers.Independent.Gap48.P40

end
Source
Continuity bounds on the quantum relative entropy, arXiv:quant-ph/0503218v3, PDF p. 6, §VI, Lemma 8: a commuting pair attains the minimum
Read-back

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

Let d≥2d\ge2d≥2 be a natural number, and let NNN be a real-valued function on complex d×dd\times dd×d matrices that is nonnegative, vanishes exactly at zero, is subadditive, satisfies N(cA)=∣c∣N(A)N(cA)=|c|N(A)N(cA)=∣c∣N(A) for every complex scalar ccc, and satisfies N(UAV)=N(A)N(UAV)=N(A)N(UAV)=N(A) for all unitary U,VU,VU,V. Set F=diag⁡(1,−1,0,…,0)F=\operatorname{diag}(1,-1,0,\ldots,0)F=diag(1,−1,0,…,0), and let TTT be any real number with 0≤T≤N(F)0\le T\le N(F)0≤T≤N(F). Define mN(T)m_N(T)mN​(T) to be the extended-real infimum of D(R∥S)D(R\|S)D(R∥S) over all positive semidefinite trace-one matrices R,SR,SR,S satisfying N(R−S)=TN(R-S)=TN(R−S)=T, where

D(R∥S)={Re⁡tr⁡ ⁣(f(R)−Rlog⁡S),ker⁡S⊆ker⁡R,+∞,otherwise,f(x)=xlog⁡x,D(R\|S)= \begin{cases} \operatorname{Re}\operatorname{tr}\!\bigl(f(R)-R\log S\bigr),&\ker S\subseteq\ker R,\\ +\infty,&\text{otherwise}, \end{cases} \qquad f(x)=x\log x,D(R∥S)={Retr(f(R)−RlogS),+∞,​kerS⊆kerR,otherwise,​f(x)=xlogx,

using functional calculus with log⁡0=f(0)=0\log0=f(0)=0log0=f(0)=0. Then there exist positive semidefinite trace-one matrices ρ,σ\rho,\sigmaρ,σ such that

N(ρ−σ)=T,σ(ρ−σ)=(ρ−σ)σ,D(ρ∥σ)=mN(T).N(\rho-\sigma)=T,\qquad \sigma(\rho-\sigma)=(\rho-\sigma)\sigma,\qquad D(\rho\|\sigma)=m_N(T).N(ρ−σ)=T,σ(ρ−σ)=(ρ−σ)σ,D(ρ∥σ)=mN​(T).

Both endpoints of the permitted interval for TTT are included; the asserted equality with the infimum is an extended-real equality and permits the value +∞+\infty+∞.

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