Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 4.8

Open
QAlgorithms.Papers.Independent.Support50.P12.remark_4_8

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.

For operator convex fff, let MfM_fMf​ contain the positive maps monotone for SfS_fSf​ on all positive pairs. This class is convex and closed under compatible composition. A co-Schwarz bound is Φ(X)∗Φ(X)≤cΦ(XX∗)\Phi(X)^*\Phi(X)\le c\Phi(XX^*)Φ(X)∗Φ(X)≤cΦ(XX∗), c≥0c\ge0c≥0; it is equivalent, with the same ccc, to a Schwarz bound after transposing the input algebra. Co-substochastic means that the adjoint satisfies the co-Schwarz bound with c=1c=1c=1. Under trace preservation of BBB and the alternative Tr⁡Φ(A)=Tr⁡A\operatorname{Tr}\Phi(A)=\operatorname{Tr}ATrΦ(A)=TrA or ω(f)≥0\omega(f)\ge0ω(f)≥0,

Sf(Φ(A)∥Φ(B))≤Sf(A∥B)S_f(\Phi(A)\Vert\Phi(B))\le S_f(A\Vert B)Sf​(Φ(A)∥Φ(B))≤Sf​(A∥B)

also holds for co-substochastic maps. Every convex combination of a stochastic and a co-stochastic map belongs to MfM_fMf​. This uses the paper's specific decomposability, without replacing it by the entire CP plus co-CP cone.

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]

/-- Remark 4.8, PDF pp.20–21: convex/compositional closure, transpose reduction,
co-substochastic monotonicity, and the stated stochastic/co-stochastic decomposability. -/
theorem remark_4_8 [Nonempty I] [Nonempty J] [Nonempty K]
    (A : Alg I) (B : Alg J) (C : Alg K) (f : ℝ → ℝ)
    (hf : DivergenceGenerator f) (hconv : SemidefiniteOperatorConvex f) :
    (∀ (Phi Psi : MatrixMap I J), AlgebraExtension A B Phi → AlgebraExtension A B Psi →
      MonotoneMap A f Phi → MonotoneMap A f Psi → ∀ t ∈ Icc (0 : ℝ) 1,
        MonotoneMap A f (((1 - t : ℝ) : ℂ) • Phi + (t : ℂ) • Psi)) ∧
    (∀ (Phi : MatrixMap I J) (Psi : MatrixMap J K), AlgebraExtension A B Phi → AlgebraExtension B C Psi →
      MonotoneMap A f Phi → MonotoneMap B f Psi → MonotoneMap A f (Psi.comp Phi)) ∧
    (∀ Phi : MatrixMap I J, AlgebraExtension A B Phi → ∀ c : ℝ,
      CoBound A Phi c ↔ ∃ Psi : MatrixMap I J, (∀ X ∈ A, Phi X = Psi (Xᵀ)) ∧
        0 ≤ c ∧ (∀ X : Mat I, Xᵀ ∈ A → X.PosSemidef → (Psi X).PosSemidef) ∧
        ∀ X : Mat I, Xᵀ ∈ A → LE ((Psi X)ᴴ * Psi X) ((c : ℂ) • Psi (Xᴴ * X))) ∧
    (∀ (Phi : MatrixMap I J), CoSubstochastic A B Phi → ∀ X ∈ A, ∀ Y ∈ A,
      X.PosSemidef → Y.PosSemidef → tr (Phi Y) = tr Y →
      (tr (Phi X) = tr X ∨ 0 ≤ recessionSlope f) → div f (Phi X) (Phi Y) ≤ div f X Y) ∧
    (∀ (Phi Psi : MatrixMap I J), AlgebraStochastic A B Phi → CoStochastic A B Psi →
      ∀ t ∈ Icc (0 : ℝ) 1, MonotoneMap A f (((1 - t : ℝ) : ℂ) • Phi + (t : ℂ) • Psi)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 20, Remark 4.8
Read-back

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

Let I,J,KI,J,KI,J,K be nonempty finite index types with decidable equality, and let A,B,CA,B,CA,B,C be unital complex star subalgebras of their respective matrix algebras. All maps quantified below are complex linear. Write tr⁡Z=Re⁡Tr⁡Z\operatorname{tr}Z=\operatorname{Re}\operatorname{Tr}ZtrZ=ReTrZ and (Φ†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​. Say that Φ\PhiΦ has the extension property from AAA to BBB if its entire ambient range lies in BBB and the entire range of Φ†\Phi^\daggerΦ† lies in AAA. For a function FFF, write SA(F,c)S_A(F,c)SA​(F,c) for the conjunction of c≥0c\ge0c≥0, positivity of FFF on positive elements of AAA, and (FZ)∗FZ⪯cF(Z∗Z)(FZ)^*FZ\preceq cF(Z^*Z)(FZ)∗FZ⪯cF(Z∗Z) for every Z∈AZ\in AZ∈A; write SAco(F,c)S_A^{\mathrm{co}}(F,c)SAco​(F,c) for the same requirements with F(ZZ∗)F(ZZ^*)F(ZZ∗) in place of F(Z∗Z)F(Z^*Z)F(Z∗Z). A map is substochastic from AAA to BBB when it has the extension property and SB(Φ†,1)S_B(\Phi^\dagger,1)SB​(Φ†,1); it is co-substochastic when it has the extension property and SBco(Φ†,1)S_B^{\mathrm{co}}(\Phi^\dagger,1)SBco​(Φ†,1); the corresponding stochastic and co-stochastic conditions additionally require Tr⁡ΦZ=Tr⁡Z\operatorname{Tr}\Phi Z=\operatorname{Tr}ZTrΦZ=TrZ for every Z∈AZ\in AZ∈A. Let f:R→Rf:\mathbb R\to\mathbb Rf:R→R be continuous on (0,∞)(0,\infty)(0,∞), with f(x)/x→f∞f(x)/x\to f_\inftyf(x)/x→f∞​ in the extended real line at infinity, and operator convex on positive semidefinite matrices in every size. Define

Qf(Z,W)=Re⁡Tr⁡ ⁣[(W01/2)∗∑λ∈sp⁡(Z)∑μ∈sp⁡(W)f(λ/μ)Pλ(Z)W01/2Pμ(W)],Df(Z,W)={Qf(Z,W),ker⁡W⊆ker⁡Z,lim⁡e↓0selectedQf(Z,W+e1),otherwise.Q_f(Z,W)=\operatorname{Re}\operatorname{Tr}\!\left[(W_0^{1/2})^* \sum_{\lambda\in\operatorname{sp}(Z)}\sum_{\mu\in\operatorname{sp}(W)} f(\lambda/\mu)P_\lambda(Z)W_0^{1/2}P_\mu(W)\right], \quad D_f(Z,W)= \begin{cases} Q_f(Z,W),&\ker W\subseteq\ker Z,\\ \displaystyle\operatorname{lim}_{e\downarrow0}^{\mathrm{selected}}Q_f(Z,W+e1),&\text{otherwise}. \end{cases}Qf​(Z,W)=ReTr​(W01/2​)∗λ∈sp(Z)∑​μ∈sp(W)∑​f(λ/μ)Pλ​(Z)W01/2​Pμ​(W)​,Df​(Z,W)={Qf​(Z,W),lime↓0selected​Qf​(Z,W+e1),​kerW⊆kerZ,otherwise.​

Here powers vanish at zero, sp⁡\operatorname{sp}sp is the distinct Hermitian spectrum and is empty otherwise, PλP_\lambdaPλ​ is the orthogonal eigenspace projection, division by zero is zero, and the selected limit is the total extended real limit operation. Call a function FFF monotone on AAA for fff when it is positive on positive elements of AAA and Df(FX,FY)≤Df(X,Y)D_f(FX,FY)\le D_f(X,Y)Df​(FX,FY)≤Df​(X,Y) for every positive semidefinite X,Y∈AX,Y\in AX,Y∈A. The declaration asserts that convex combinations (1−t)Φ+tΨ(1-t)\Phi+t\Psi(1−t)Φ+tΨ, 0≤t≤10\le t\le10≤t≤1, are monotone whenever both maps have the extension property A→BA\to BA→B and are monotone; that Ψ∘Φ\Psi\circ\PhiΨ∘Φ is monotone on AAA whenever the maps have extension properties A→BA\to BA→B and B→CB\to CB→C and are respectively monotone on AAA and BBB; that, for every Φ\PhiΦ having extension property A→BA\to BA→B and every real ccc, SAco(Φ,c)S_A^{\mathrm{co}}(\Phi,c)SAco​(Φ,c) is equivalent to the existence of a complex-linear Ψ:MI(C)→MJ(C)\Psi:M_I(\mathbb C)\to M_J(\mathbb C)Ψ:MI​(C)→MJ​(C) such that ΦX=Ψ(XT)\Phi X=\Psi(X^{\mathsf T})ΦX=Ψ(XT) for every X∈AX\in AX∈A, c≥0c\ge0c≥0, ΨX⪰0\Psi X\succeq0ΨX⪰0 whenever XT∈AX^{\mathsf T}\in AXT∈A and X⪰0X\succeq0X⪰0, and (ΨX)∗ΨX⪯cΨ(X∗X)(\Psi X)^*\Psi X\preceq c\Psi(X^*X)(ΨX)∗ΨX⪯cΨ(X∗X) whenever XT∈AX^{\mathsf T}\in AXT∈A; that every co-substochastic Φ\PhiΦ satisfies Df(ΦX,ΦY)≤Df(X,Y)D_f(\Phi X,\Phi Y)\le D_f(X,Y)Df​(ΦX,ΦY)≤Df​(X,Y) for positive semidefinite X,Y∈AX,Y\in AX,Y∈A with tr⁡ΦY=tr⁡Y\operatorname{tr}\Phi Y=\operatorname{tr}YtrΦY=trY and either tr⁡ΦX=tr⁡X\operatorname{tr}\Phi X=\operatorname{tr}XtrΦX=trX or f∞≥0f_\infty\ge0f∞​≥0; and that every convex combination of a stochastic Φ:A→B\Phi:A\to BΦ:A→B and a co-stochastic Ψ:A→B\Psi:A\to BΨ:A→B is monotone on AAA. These assertions include zero and unnormalized positive matrices.

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