Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2.5

Proved
QAlgorithms.Papers.Independent.Support50.P12.corollary_2_5

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.

For λ≥0\lambda\ge0λ≥0, mutually orthogonal support joins of two positive pairs, any linear or anti-linear isometry V:H→KV:H\to KV:H→K, and any unit vector x∈Kx\in Kx∈K, respectively,

Sf(λA∥λB)=λSf(A∥B),Sf(A1+A2∥B1+B2)=Sf(A1∥B1)+Sf(A2∥B2),Sf(VAV∗∥VBV∗)=Sf(A∥B),Sf(A⊗∣x⟩⟨x∣∥B⊗∣x⟩⟨x∣)=Sf(A∥B).\begin{gathered}S_f(\lambda A\Vert\lambda B)=\lambda S_f(A\Vert B),\\S_f(A_1+A_2\Vert B_1+B_2)=S_f(A_1\Vert B_1)+S_f(A_2\Vert B_2),\\S_f(VAV^*\Vert VBV^*)=S_f(A\Vert B),\\S_f(A\otimes|x\rangle\langle x|\Vert B\otimes|x\rangle\langle x|)=S_f(A\Vert B).\end{gathered}Sf​(λA∥λB)=λSf​(A∥B),Sf​(A1​+A2​∥B1​+B2​)=Sf​(A1​∥B1​)+Sf​(A2​∥B2​),Sf​(VAV∗∥VBV∗)=Sf​(A∥B),Sf​(A⊗∣x⟩⟨x∣∥B⊗∣x⟩⟨x∣)=Sf​(A∥B).​

In the sum identity the hypothesis is (A10∨B10)⊥(A20∨B20)(A_1^0\vee B_1^0)\perp(A_2^0\vee B_2^0)(A10​∨B10​)⊥(A20​∨B20​). Zero scaling is included. These are the basic covariance and direct-sum rules.

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.5, PDF p.6: zero scaling, orthogonal sums, both sorts of isometry,
and tensoring with any unit-vector projection. -/
theorem corollary_2_5 [Nonempty I] [Nonempty J] (f : ℝ → ℝ) (hf : DivergenceGenerator f)
    (A B A1 B1 A2 B2 : Mat I) (hA : A.PosSemidef) (hB : B.PosSemidef)
    (hA1 : A1.PosSemidef) (hB1 : B1.PosSemidef)
    (hA2 : A2.PosSemidef) (hB2 : B2.PosSemidef) :
    (∀ l : ℝ, 0 ≤ l → div f ((l : ℂ) • A) ((l : ℂ) • B) = (l : EReal) * div f A B) ∧
    ((A1 + B1) * (A2 + B2) = 0 →
      div f (A1 + A2) (B1 + B2) = div f A1 B1 + div f A2 B2) ∧
    (∀ (anti : Bool) (W : Matrix J I ℂ), Wᴴ * W = 1 →
      div f (isometricConjugation anti W A) (isometricConjugation anti W B) = div f A B) ∧
    (∀ x : J → ℂ, ∑ j, ‖x j‖ ^ 2 = 1 →
      div f (Matrix.kronecker A (fun i j => x i * conj (x j)))
        (Matrix.kronecker B (fun i j => x i * conj (x j))) = div f A B) := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

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

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

Let I,JI,JI,J be nonempty finite types with decidable equality, and let f:R→Rf:\mathbb R\to\mathbb Rf:R→R be continuous on (0,∞)(0,\infty)(0,∞), with f(x)/xf(x)/xf(x)/x converging in the extended reals at +∞+\infty+∞ to its selected limit. For positive semidefinite matrices X,YX,YX,Y, define

qf(X,Y)=Re⁡Tr⁡ ⁣[Y∑a∈sp⁡X∑b∈sp⁡Yf(a/b)PaXYPbY],q_f(X,Y)=\operatorname{Re}\operatorname{Tr}\!\left[ \sqrt Y\sum_{a\in\operatorname{sp}X}\sum_{b\in\operatorname{sp}Y} f(a/b)P^X_a\sqrt YP^Y_b \right],qf​(X,Y)=ReTr​Y​a∈spX∑​b∈spY∑​f(a/b)PaX​Y​PbY​​,

where the sums run over distinct eigenvalues, PaXP^X_aPaX​ is the eigenspace projection, and a/0=0a/0=0a/0=0. Define Df(X,Y)D_f(X,Y)Df​(X,Y) to be qf(X,Y)q_f(X,Y)qf​(X,Y) embedded in the extended reals if ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and otherwise the total selected right limit of qf(X,Y+ϵ1)q_f(X,Y+\epsilon1)qf​(X,Y+ϵ1) at zero. For any six positive semidefinite complex I×II\times II×I matrices A,B,A1,B1,A2,B2A,B,A_1,B_1,A_2,B_2A,B,A1​,B1​,A2​,B2​, all four claims hold: for every real λ≥0\lambda\ge0λ≥0, including λ=0\lambda=0λ=0,

Df(λA,λB)=λDf(A,B);D_f(\lambda A,\lambda B)=\lambda D_f(A,B);Df​(λA,λB)=λDf​(A,B);

if (A1+B1)(A2+B2)=0(A_1+B_1)(A_2+B_2)=0(A1​+B1​)(A2​+B2​)=0, then

Df(A1+A2,B1+B2)=Df(A1,B1)+Df(A2,B2);D_f(A_1+A_2,B_1+B_2)=D_f(A_1,B_1)+D_f(A_2,B_2);Df​(A1​+A2​,B1​+B2​)=Df​(A1​,B1​)+Df​(A2​,B2​);

for every Boolean choice bbb and every complex matrix W:CI→CJW:\mathbb C^I\to\mathbb C^JW:CI→CJ with W†W=1W^\dagger W=1W†W=1,

Df(WAbW†,WBbW†)=Df(A,B),D_f(WA_bW^\dagger,WB_bW^\dagger)=D_f(A,B),Df​(WAb​W†,WBb​W†)=Df​(A,B),

where Ab=AT,Bb=BTA_b=A^\mathsf T,B_b=B^\mathsf TAb​=AT,Bb​=BT when bbb is true and Ab=A,Bb=BA_b=A,B_b=BAb​=A,Bb​=B when it is false; and, for every x∈CJx\in\mathbb C^Jx∈CJ satisfying ∑j∈J∣xj∣2=1\sum_{j\in J}|x_j|^2=1∑j∈J​∣xj​∣2=1,

Df(A⊗xx†, B⊗xx†)=Df(A,B).D_f\bigl(A\otimes xx^\dagger,\ B\otimes xx^\dagger\bigr)=D_f(A,B).Df​(A⊗xx†, B⊗xx†)=Df​(A,B).

There are no trace-normalization or nonzero assumptions on the six matrices, and the displayed identities use extended-real arithmetic.

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