Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

remark3

Open
QAlgorithms.Papers.Independent.Support50.P15.remark3

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

prove2quantum

For d≥2d\ge2d≥2 let MMM be the minimum in Eq. (6) and τd(u)=diag⁡(1−u,u/(d−1),…,u/(d−1))\tau_d(u)=\operatorname{diag}(1-u,u/(d-1),\ldots,u/(d-1))τd​(u)=diag(1−u,u/(d−1),…,u/(d−1)). For every Δ∈[−log⁡d,log⁡d]\Delta\in[-\log d,\log d]Δ∈[−logd,logd] this minimum is attained. Its scalar minimizing pair (s,r)(s,r)(s,r) is unique when Δ≠0\Delta\ne0Δ=0. The witnesses obey

S(τd(s))=H(s)+slog⁡(d−1),D(τd(s)∥τd(r))=D2(s∥r).S(\tau_d(s))=H(s)+s\log(d-1),\qquad D(\tau_d(s)\|\tau_d(r))=D_2(s\|r).S(τd​(s))=H(s)+slog(d−1),D(τd​(s)∥τd​(r))=D2​(s∥r).

The analogous entropy identity holds for rrr. Every ordered state pair of nonzero entropy difference Δ\DeltaΔ attains M(Δ,d)M(\Delta,d)M(Δ,d) if and only if it is obtained from a minimizing witness pair by conjugating both states with the same unitary. At zero difference equality holds exactly for identical states. Thus uniqueness is simultaneous unitary equivalence of the ordered pair, and no uniqueness of the scalar pair is claimed at zero.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P15
Formal statement
noncomputable section

attribute [local instance] Classical.propDecidable

open scoped Matrix ComplexConjugate ENNReal Matrix.Norms.L2Operator

open Filter MeasureTheory

namespace QAlgorithms.Papers.Independent.Support50.P15

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

/-- Remark 3, PDF p.4, with uniqueness proved pp.20--22. A common unitary acts on the ordered pair. -/
theorem remark3 (d : ℕ) (hd : 2 ≤ d) :
    (∀ delta ∈ Set.Icc (-Real.log d) (Real.log d), ∃ s r, minimizingPair d delta s r) ∧
    (∀ delta ∈ Set.Icc (-Real.log d) (Real.log d), delta ≠ 0 →
      ∃! sr : ℝ × ℝ, minimizingPair d delta sr.1 sr.2) ∧
    (∀ s ∈ Set.Icc (0 : ℝ) (massLimit d), ∀ r ∈ Set.Icc (0 : ℝ) (massLimit d),
      entropy (family d s) = degenerateSpectrumEntropy d s ∧ entropy (family d r) = degenerateSpectrumEntropy d r ∧
      ∀ (ha : IsDensityMatrix (family d s)) (hb : IsDensityMatrix (family d r)),
        stateRelativeNats ⟨family d s, ha⟩ ⟨family d r, hb⟩ = binaryRelative s r) ∧
    (∀ (a b : EntropyState d) (delta : ℝ), delta ≠ 0 → difference a.val b.val = delta →
      (stateRelativeNats a b = tightBound d delta ↔
        ∃ s r, minimizingPair d delta s r ∧
          ∃ u : Matrix.unitaryGroup (Fin d) ℂ,
            a.val = (u : Matrix (Fin d) (Fin d) ℂ) * family d s * (u : Matrix (Fin d) (Fin d) ℂ)ᴴ ∧
            b.val = (u : Matrix (Fin d) (Fin d) ℂ) * family d r * (u : Matrix (Fin d) (Fin d) ℂ)ᴴ)) ∧
    (∀ a b : EntropyState d, difference a.val b.val = 0 →
      (stateRelativeNats a b = tightBound d 0 ↔ a = b)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P15

end
Source
Tight bound on relative entropy by entropy difference, arXiv:1304.0036v3, PDF p. 4, remark3
Read-back

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

For every natural number d≥2d\ge2d≥2, let states mean complex d×dd\times dd×d positive semidefinite matrices of trace 111, define S(a)=−Re⁡tr⁡(f(a))S(a)=-\operatorname{Re}\operatorname{tr}(f(a))S(a)=−Retr(f(a)) with f(x)=xlog⁡xf(x)=x\log xf(x)=xlogx applied by continuous functional calculus, and define D(a∥b)=+∞D(a\Vert b)=+\inftyD(a∥b)=+∞ if ker⁡b⊈ker⁡a\ker b\not\subseteq\ker akerb⊆kera, otherwise D(a∥b)=max⁡{0,Re⁡tr⁡(f(a)−alog⁡b)}D(a\Vert b)=\max\{0,\operatorname{Re}\operatorname{tr}(f(a)-a\log b)\}D(a∥b)=max{0,Retr(f(a)−alogb)}. All logarithms are natural, with log⁡0=0\log0=0log0=0. Write

Hd(u)=−ulog⁡u−(1−u)log⁡(1−u)+ulog⁡(d−1),Bd(δ)=inf⁡0≤u,v≤(d−1)/dHd(u)−Hd(v)=δK(u,v),H_d(u)=-u\log u-(1-u)\log(1-u)+u\log(d-1),\qquad B_d(\delta)=\inf_{\substack{0\le u,v\le(d-1)/d\\H_d(u)-H_d(v)=\delta}}K(u,v),Hd​(u)=−ulogu−(1−u)log(1−u)+ulog(d−1),Bd​(δ)=0≤u,v≤(d−1)/dHd​(u)−Hd​(v)=δ​inf​K(u,v),

where K(u,v)=k(u,v)+k(1−u,1−v)K(u,v)=k(u,v)+k(1-u,1-v)K(u,v)=k(u,v)+k(1−u,1−v), k(p,q)=0k(p,q)=0k(p,q)=0 if p=0p=0p=0, k(p,q)=+∞k(p,q)=+\inftyk(p,q)=+∞ if p≠0p\ne0p=0 and q=0q=0q=0, and k(p,q)=plog⁡(p/q)k(p,q)=p\log(p/q)k(p,q)=plog(p/q) otherwise; empty infima are +∞+\infty+∞. Call (u,v)(u,v)(u,v) minimizing for δ\deltaδ when it satisfies the displayed feasibility conditions and K(u,v)=Bd(δ)K(u,v)=B_d(\delta)K(u,v)=Bd​(δ), and put Fd(u)=diag⁡(1−u,u/(d−1),…,u/(d−1))F_d(u)=\operatorname{diag}(1-u,u/(d-1),\ldots,u/(d-1))Fd​(u)=diag(1−u,u/(d−1),…,u/(d−1)). The theorem asserts that every δ∈[−log⁡d,log⁡d]\delta\in[-\log d,\log d]δ∈[−logd,logd] has a minimizing pair, and that this ordered pair is unique whenever δ≠0\delta\ne0δ=0 in that interval. For every u,v∈[0,(d−1)/d]u,v\in[0,(d-1)/d]u,v∈[0,(d−1)/d], it asserts S(Fd(u))=Hd(u)S(F_d(u))=H_d(u)S(Fd​(u))=Hd​(u) and S(Fd(v))=Hd(v)S(F_d(v))=H_d(v)S(Fd​(v))=Hd​(v), and, for every choice of witnesses that these two matrices are states, D(Fd(u)∥Fd(v))=K(u,v)D(F_d(u)\Vert F_d(v))=K(u,v)D(Fd​(u)∥Fd​(v))=K(u,v). For any states a,ba,ba,b and real δ≠0\delta\ne0δ=0 satisfying S(a)−S(b)=δS(a)-S(b)=\deltaS(a)−S(b)=δ, it asserts

D(a∥b)=Bd(δ)⟺∃ u,v,U: (u,v) is minimizing for δ, U∗U=UU∗=I, a=UFd(u)U∗, b=UFd(v)U∗,D(a\Vert b)=B_d(\delta) \quad\Longleftrightarrow\quad \exists\,u,v,U:\ (u,v)\text{ is minimizing for }\delta,\ U^*U=UU^*=I,\ a=UF_d(u)U^*,\ b=UF_d(v)U^*,D(a∥b)=Bd​(δ)⟺∃u,v,U: (u,v) is minimizing for δ, U∗U=UU∗=I, a=UFd​(u)U∗, b=UFd​(v)U∗,

where UUU is a complex d×dd\times dd×d unitary matrix. Finally, for all states a,ba,ba,b with S(a)−S(b)=0S(a)-S(b)=0S(a)−S(b)=0, it asserts D(a∥b)=Bd(0)D(a\Vert b)=B_d(0)D(a∥b)=Bd​(0) if and only if a=ba=ba=b.

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

    Confirmed by the moderator at approval.

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