Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2.10

Proved
QAlgorithms.Papers.Independent.Support50.P12.corollary_2_10

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

prove2quantum

Let A,BA,BA,B be positive semidefinite operators on a nonzero finite-dimensional complex Hilbert space. Let f:[0,∞)→Rf:[0,\infty)\to\mathbb Rf:[0,∞)→R be continuous on (0,∞)(0,\infty)(0,∞) with signed extended recession slope ω(f)=lim⁡x→∞f(x)/x\omega(f)=\lim_{x\to\infty}f(x)/xω(f)=limx→∞​f(x)/x. Write SfS_fSf​ for the paper's quantum divergence, Qf(A,B)=⟨B1/2,f(LARB−1)B1/2⟩HSQ_f(A,B)=\langle B^{1/2},f(L_AR_{B^{-1}})B^{1/2}\rangle_{\rm HS}Qf​(A,B)=⟨B1/2,f(LA​RB−1​)B1/2⟩HS​, and X0X^0X0 for the support projection. All powers vanish on the kernel, including exponent zero. Traces are representation traces.

Let ggg satisfy the same generator assumptions as fff. If Sf(p∥q)=Sg(p∥q)S_f(p\Vert q)=S_g(p\Vert q)Sf​(p∥q)=Sg​(p∥q) for every pair of probability laws on every finite alphabet, then for every density pair on any finite quantum system,

Sf(ρ∥σ)=Sg(ρ∥σ).S_f(\rho\Vert\sigma)=S_g(\rho\Vert\sigma).Sf​(ρ∥σ)=Sg​(ρ∥σ).

Uniformity over all alphabets includes the product spectral alphabet of a quantum pair. Classical values therefore determine the quantum extension within this class.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P12
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P12

open Filter MeasureTheory Set

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

open QAlgorithms.Papers.Independent.Information100.P30 (MatrixMap)

open QAlgorithms.Papers.Independent.Dependency50.P28 (tr LE logNonnegativeExtended pinch)

open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint spectralFunction petz relativeEntropy)

open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)

open QAlgorithms.Papers.Independent.Next46.P23 (Supports)

open QAlgorithms.Papers.Independent.Support21.P03 (ExtendedConvex)

open QAlgorithms (spectralProjector)

open QAlgorithms.Learning (IsDistribution)

open QAlgorithms.Papers.Independent.Information100.P04 (absOp)

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Topology Kronecker

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)

variable {I J K : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
  [Fintype K] [DecidableEq K]

/-- Corollary 2.10, PDF p.7: agreement on ALL finite classical alphabets determines
agreement on all quantum states. -/
theorem corollary_2_10 [Nonempty I] (f g : ℝ → ℝ)
    (hf : DivergenceGenerator f) (hg : DivergenceGenerator g)
    (hc : ∀ (n : ℕ) (p q : Fin n → ℝ), IsDistribution p → IsDistribution q →
      div f (Matrix.diagonal (fun i => (p i : ℂ))) (Matrix.diagonal (fun i => (q i : ℂ))) =
      div g (Matrix.diagonal (fun i => (p i : ℂ))) (Matrix.diagonal (fun i => (q i : ℂ))))
    (A : Alg I) (rho sigma : Mat I) (hr : AlgebraDensity A rho) (hs : AlgebraDensity A sigma) :
    div f rho sigma = div g rho sigma := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 7, Corollary 2.10
Read-back

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

Let III be a finite, nonempty index type with decidable equality, and let f,g:R→Rf,g:\mathbb R\to\mathbb Rf,g:R→R each be continuous on (0,∞)(0,\infty)(0,∞), with f(x)/xf(x)/xf(x)/x and g(x)/xg(x)/xg(x)/x each converging in the extended real line at +∞+\infty+∞. For either function hhh, define on positive semidefinite matrices

Qh(U,V)=∑λ∈spec⁡U∑μ∈spec⁡Vμh(λ/μ)Re⁡Tr⁡(Pλ(U)Pμ(V)),Dh(U,V)={Qh(U,V),ker⁡V⊆ker⁡U,lim⁡ε↓0Qh(U,V+εI),otherwise,Q_h(U,V)=\sum_{\lambda\in\operatorname{spec}U}\sum_{\mu\in\operatorname{spec}V} \mu h(\lambda/\mu)\operatorname{Re}\operatorname{Tr}(P_\lambda(U)P_\mu(V)), \qquad D_h(U,V)= \begin{cases} Q_h(U,V),&\ker V\subseteq\ker U,\\ \displaystyle\lim_{\varepsilon\downarrow0}Q_h(U,V+\varepsilon I),&\text{otherwise}, \end{cases}Qh​(U,V)=λ∈specU∑​μ∈specV∑​μh(λ/μ)ReTr(Pλ​(U)Pμ​(V)),Dh​(U,V)=⎩⎨⎧​Qh​(U,V),ε↓0lim​Qh​(U,V+εI),​kerV⊆kerU,otherwise,​

using distinct eigenvalues and orthogonal eigenspace projections, division by zero equal to zero, and the formal total extended-real limit-selection operation. Assume that for every natural number nnn and every pair of probability distributions p,q:{0,…,n−1}→Rp,q:\{0,\ldots,n-1\}\to\mathbb Rp,q:{0,…,n−1}→R,

Df(diag⁡p,diag⁡q)=Dg(diag⁡p,diag⁡q).D_f(\operatorname{diag}p,\operatorname{diag}q) =D_g(\operatorname{diag}p,\operatorname{diag}q).Df​(diagp,diagq)=Dg​(diagp,diagq).

Then, for every unital complex star subalgebra A\mathcal AA of the matrices indexed by III, and every positive semidefinite ρ,σ∈A\rho,\sigma\in\mathcal Aρ,σ∈A of real trace one, Df(ρ,σ)=Dg(ρ,σ)D_f(\rho,\sigma)=D_g(\rho,\sigma)Df​(ρ,σ)=Dg​(ρ,σ). The assumption quantifies over n=0n=0n=0 as well, but there is no probability distribution on that empty alphabet; singular matrices and distributions with zero entries are allowed.

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