Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 4.5

Open
QAlgorithms.Papers.Independent.Support50.P12.example_4_5

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

prove2quantum

Let A1⊆B(H1)\mathcal A_1\subseteq B(H_1)A1​⊆B(H1​) and A2⊆B(H2)\mathcal A_2\subseteq B(H_2)A2​⊆B(H2​) be concrete unital algebras on nonzero finite-dimensional complex Hilbert spaces, and let Φ:A1→A2\Phi:\mathcal A_1\to\mathcal A_2Φ:A1​→A2​ be complex linear. The adjoint is for ⟨X,Y⟩HS=Tr⁡X∗Y\langle X,Y\rangle_{\rm HS}=\operatorname{Tr}X^*Y⟨X,Y⟩HS​=TrX∗Y. A substochastic map has a Schwarz-contracting adjoint; stochastic additionally means trace preserving. Let A,B∈A1,+A,B\in\mathcal A_{1,+}A,B∈A1,+​. Powers are zero on kernels and traces are not normalized. Write Sα(A∥B)S_\alpha(A\Vert B)Sα​(A∥B) for the unnormalized Petz Rényi entropy, ψA,B(α)=log⁡Tr⁡AαB1−α\psi_{A,B}(\alpha)=\log\operatorname{Tr}A^\alpha B^{1-\alpha}ψA,B​(α)=logTrAαB1−α, C(A∥B)=sup⁡0≤α<1−ψA,B(α)C(A\Vert B)=\sup_{0\le\alpha<1}-\psi_{A,B}(\alpha)C(A∥B)=sup0≤α<1​−ψA,B​(α), and Hr(A∥B)=sup⁡0≤α<1[−αr−ψA,B(α)]/(1−α)H_r(A\Vert B)=\sup_{0\le\alpha<1}[-\alpha r-\psi_{A,B}(\alpha)]/(1-\alpha)Hr​(A∥B)=sup0≤α<1​[−αr−ψA,B​(α)]/(1−α). Logarithms are natural and log⁡0=−∞\log0=-\inftylog0=−∞. The Petz map is ΦB∗(Y)=B1/2Φ∗(Φ(B)−1/2YΦ(B)−1/2)B1/2\Phi_B^*(Y)=B^{1/2}\Phi^*(\Phi(B)^{-1/2}Y\Phi(B)^{-1/2})B^{1/2}ΦB∗​(Y)=B1/2Φ∗(Φ(B)−1/2YΦ(B)−1/2)B1/2.

Assume Φ\PhiΦ is substochastic and Tr⁡Φ(B)=Tr⁡B\operatorname{Tr}\Phi(B)=\operatorname{Tr}BTrΦ(B)=TrB. For 0≤α<10\le\alpha<10≤α<1, the raw trace overlap increases; for 1<α≤21<\alpha\le21<α≤2 and A0≤B0A^0\le B^0A0≤B0, it decreases. In particular,

Sα(Φ(A)∥Φ(B))≤Sα(A∥B)(α∈[0,2]∖{1}),S(Φ(A)∥Φ(B))≤S(A∥B).S_\alpha(\Phi(A)\Vert\Phi(B))\le S_\alpha(A\Vert B)\quad(\alpha\in[0,2]\setminus\{1\}),\qquad S(\Phi(A)\Vert\Phi(B))\le S(A\Vert B).Sα​(Φ(A)∥Φ(B))≤Sα​(A∥B)(α∈[0,2]∖{1}),S(Φ(A)∥Φ(B))≤S(A∥B).

Here the raw overlaps are Tr⁡AαB1−α\operatorname{Tr}A^\alpha B^{1-\alpha}TrAαB1−α and their mapped analogues; SSS is Umegaki entropy. No density normalization or trace denominator is inserted.

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]

/-- Example 4.5, PDF p.19: raw trace-power comparisons, all Rényi orders in
[0,2]\{1}, and Umegaki entropy; no trace normalization is introduced. -/
theorem example_4_5 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
    (hp : Substochastic A B Phi) (X Y : Mat I) (hX : X ∈ A) (hY : Y ∈ A)
    (hXp : X.PosSemidef) (hYp : Y.PosSemidef) (htr : tr (Phi Y) = tr Y) :
    (∀ a ∈ Ico (0 : ℝ) 1, tr (supportPower X a * supportPower Y (1 - a)) ≤
      tr (supportPower (Phi X) a * supportPower (Phi Y) (1 - a))) ∧
    (Supports X Y → ∀ a ∈ Ioc (1 : ℝ) 2,
      tr (supportPower (Phi X) a * supportPower (Phi Y) (1 - a)) ≤
        tr (supportPower X a * supportPower Y (1 - a))) ∧
    (∀ a ∈ Icc (0 : ℝ) 2, a ≠ 1 → petzRenyi a (Phi X) (Phi Y) ≤ petzRenyi a X Y) ∧
    relativeEntropy (Phi X) (Phi Y) ≤ relativeEntropy X Y := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 19, Example 4.5
Read-back

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

Let I,JI,JI,J be nonempty finite index types with decidable equality, A⊆MI(C)A\subseteq M_I(\mathbb C)A⊆MI​(C), B⊆MJ(C)B\subseteq M_J(\mathbb C)B⊆MJ​(C) unital complex star subalgebras, and Φ:MI(C)→MJ(C)\Phi:M_I(\mathbb C)\to M_J(\mathbb C)Φ:MI​(C)→MJ​(C) complex linear. Write tr⁡Z=Re⁡Tr⁡Z\operatorname{tr}Z=\operatorname{Re}\operatorname{Tr}ZtrZ=ReTrZ. Assume that Φ\PhiΦ maps every ambient matrix into BBB, its Hilbert–Schmidt adjoint (Φ†Z)ij=∑k,lΦ(Eij)kl‾Zkl(\Phi^\dagger Z)_{ij}=\sum_{k,l}\overline{\Phi(E_{ij})_{kl}}Z_{kl}(Φ†Z)ij​=∑k,l​Φ(Eij​)kl​​Zkl​ maps every ambient matrix into AAA, and Φ†\Phi^\daggerΦ† is positive on BBB and satisfies (Φ†Z)∗Φ†Z⪯Φ†(Z∗Z)(\Phi^\dagger Z)^*\Phi^\dagger Z\preceq\Phi^\dagger(Z^*Z)(Φ†Z)∗Φ†Z⪯Φ†(Z∗Z) for every Z∈BZ\in BZ∈B. Let X,Y∈AX,Y\in AX,Y∈A be positive semidefinite and satisfy tr⁡Φ(Y)=tr⁡Y\operatorname{tr}\Phi(Y)=\operatorname{tr}YtrΦ(Y)=trY. Define Z0aZ_0^aZ0a​ by functional calculus using the scalar function that is zero at zero and xax^axa otherwise, including when a=0a=0a=0 or a<0a<0a<0; define log⁡+(u)=log⁡u\log_+(u)=\log ulog+​(u)=logu as an extended real value when u>0u>0u>0, and −∞-\infty−∞ otherwise. Set

DaP(Z,W)={(a−1)−1log⁡+ ⁣(tr⁡(Z0aW01−a)),ker⁡W⊆ker⁡Z or a<1,+∞,otherwise,R(Z,W)={tr⁡[Z(log⁡Z−log⁡W)]tr⁡Z,ker⁡W⊆ker⁡Z,+∞,otherwise,D_a^{\mathrm P}(Z,W)= \begin{cases} (a-1)^{-1}\log_+\!\bigl(\operatorname{tr}(Z_0^aW_0^{1-a})\bigr), &\ker W\subseteq\ker Z\ \text{or}\ a<1,\\ +\infty,&\text{otherwise}, \end{cases} \quad R(Z,W)= \begin{cases} \displaystyle\frac{\operatorname{tr}[Z(\log Z-\log W)]}{\operatorname{tr}Z}, &\ker W\subseteq\ker Z,\\ +\infty,&\text{otherwise}, \end{cases}DaP​(Z,W)={(a−1)−1log+​(tr(Z0a​W01−a​)),+∞,​kerW⊆kerZ or a<1,otherwise,​R(Z,W)=⎩⎨⎧​trZtr[Z(logZ−logW)]​,+∞,​kerW⊆kerZ,otherwise,​

where matrix logarithms use real spectral functional calculus, log⁡0=0\log0=0log0=0 in that calculus, scalar division by zero is zero, and products in DaPD_a^{\mathrm P}DaP​ use extended real arithmetic. The declaration asserts all four conclusions:

tr⁡(X0aY01−a)≤tr⁡((ΦX)0a(ΦY)01−a)(0≤a<1),ker⁡Y⊆ker⁡X ⟹ tr⁡((ΦX)0a(ΦY)01−a)≤tr⁡(X0aY01−a)(1<a≤2),DaP(ΦX,ΦY)≤DaP(X,Y)(0≤a≤2, a≠1),R(ΦX,ΦY)≤R(X,Y).\begin{aligned} &\operatorname{tr}(X_0^aY_0^{1-a}) \le\operatorname{tr}((\Phi X)_0^a(\Phi Y)_0^{1-a}) &&(0\le a<1),\\ &\ker Y\subseteq\ker X\ \Longrightarrow\ \operatorname{tr}((\Phi X)_0^a(\Phi Y)_0^{1-a}) \le\operatorname{tr}(X_0^aY_0^{1-a}) &&(1<a\le2),\\ &D_a^{\mathrm P}(\Phi X,\Phi Y)\le D_a^{\mathrm P}(X,Y) &&(0\le a\le2,\ a\ne1),\\ &R(\Phi X,\Phi Y)\le R(X,Y). \end{aligned}​tr(X0a​Y01−a​)≤tr((ΦX)0a​(ΦY)01−a​)kerY⊆kerX ⟹ tr((ΦX)0a​(ΦY)01−a​)≤tr(X0a​Y01−a​)DaP​(ΦX,ΦY)≤DaP​(X,Y)R(ΦX,ΦY)≤R(X,Y).​​(0≤a<1),(1<a≤2),(0≤a≤2, a=1),​

The endpoint a=0a=0a=0, singular matrices, and zero or unnormalized X,YX,YX,Y are included.

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