Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.8

Open
QAlgorithms.Papers.Independent.Support50.P12.lemma_3_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.

The class of Schwarz maps is closed under composition, Hilbert–Schmidt adjoints, and nonnegative linear combinations. With the extended Schwarz norm,

∥aΦ∥S=a∥Φ∥S(a≥0),∥Φ1+Φ2∥S≤∥Φ1∥S+∥Φ2∥S.\|a\Phi\|_S=a\|\Phi\|_S\quad(a\ge0),\qquad\|\Phi_1+\Phi_2\|_S\le\|\Phi_1\|_S+\|\Phi_2\|_S.∥aΦ∥S​=a∥Φ∥S​(a≥0),∥Φ1​+Φ2​∥S​≤∥Φ1​∥S​+∥Φ2​∥S​.

Here 0⋅∞=00\cdot\infty=00⋅∞=0. Composed maps have compatible concrete domain and range algebras. These properties hold beyond two-positive maps.

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]

/-- Lemma 3.8, PDF pp.13–14: closure under composition, adjoints and nonnegative
linear combinations, with the extended homogeneous and triangle bounds. -/
theorem lemma_3_8 [Nonempty I] [Nonempty J] [Nonempty K]
    (A : Alg I) (B : Alg J) (C : Alg K) (Phi Phi1 Phi2 : MatrixMap I J) (Psi : MatrixMap J K)
    (hc : AlgebraExtension A B Phi) (hc1 : AlgebraExtension A B Phi1) (hc2 : AlgebraExtension A B Phi2)
    (hd : AlgebraExtension B C Psi) :
    (AlgebraSchwarzMap A Phi → AlgebraSchwarzMap B Psi → AlgebraSchwarzMap A (Psi.comp Phi)) ∧
    (AlgebraSchwarzMap A Phi → AlgebraSchwarzMap B (channelAdjoint Phi)) ∧
    (∀ a b : ℝ, 0 ≤ a → 0 ≤ b → AlgebraSchwarzMap A Phi1 → AlgebraSchwarzMap A Phi2 →
      AlgebraSchwarzMap A ((a : ℂ) • Phi1 + (b : ℂ) • Phi2)) ∧
    (∀ a : ℝ, 0 ≤ a → snorm A ((a : ℂ) • Phi) = ENNReal.ofReal a * snorm A Phi) ∧
    snorm A (Phi1 + Phi2) ≤ snorm A Phi1 + snorm A Phi2 := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 13, Lemma 3.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 types with decidable equality, let A,B,CA,B,CA,B,C be unital complex subalgebras of MI(C),MJ(C),MK(C)M_I(\mathbb C),M_J(\mathbb C),M_K(\mathbb C)MI​(C),MJ​(C),MK​(C), respectively, closed under conjugate transpose, and let Φ,Φ1,Φ2:MI(C)→MJ(C)\Phi,\Phi_1,\Phi_2:M_I(\mathbb C)\to M_J(\mathbb C)Φ,Φ1​,Φ2​:MI​(C)→MJ​(C) and Ψ:MJ(C)→MK(C)\Psi:M_J(\mathbb C)\to M_K(\mathbb C)Ψ:MJ​(C)→MK​(C) be complex linear. For any such map FFF, write F∗F^\astF∗ for the map with entries F∗(Z)ij=∑k,lF(Eij)kl‾ZklF^\ast(Z)_{ij}=\sum_{k,l}\overline{F(E_{ij})_{kl}}Z_{kl}F∗(Z)ij​=∑k,l​F(Eij​)kl​​Zkl​. Assume each of Φ,Φ1,Φ2\Phi,\Phi_1,\Phi_2Φ,Φ1​,Φ2​ sends every input matrix into BBB, each of their adjoints sends every matrix into AAA, Ψ\PsiΨ sends every matrix into CCC, and Ψ∗\Psi^\astΨ∗ sends every matrix into BBB. For a source algebra DDD, let CD(F)\mathcal C_D(F)CD​(F) be the set of real c≥0c\ge0c≥0 for which FFF is positive on positive semidefinite elements of DDD and

F(X)†F(X)⪯cF(X†X)(X∈D),F(X)^\dagger F(X)\preceq cF(X^\dagger X)\qquad(X\in D),F(X)†F(X)⪯cF(X†X)(X∈D),

and set sD(F)=inf⁡{ofReal⁡(c):c∈CD(F)}∈[0,∞]s_D(F)=\inf\{\operatorname{ofReal}(c):c\in\mathcal C_D(F)\}\in[0,\infty]sD​(F)=inf{ofReal(c):c∈CD​(F)}∈[0,∞]. Then nonemptiness of CA(Φ)\mathcal C_A(\Phi)CA​(Φ) and CB(Ψ)\mathcal C_B(\Psi)CB​(Ψ) implies nonemptiness of CA(Ψ∘Φ)\mathcal C_A(\Psi\circ\Phi)CA​(Ψ∘Φ); nonemptiness of CA(Φ)\mathcal C_A(\Phi)CA​(Φ) implies nonemptiness of CB(Φ∗)\mathcal C_B(\Phi^\ast)CB​(Φ∗); for every real a,b≥0a,b\ge0a,b≥0, nonemptiness of CA(Φ1)\mathcal C_A(\Phi_1)CA​(Φ1​) and CA(Φ2)\mathcal C_A(\Phi_2)CA​(Φ2​) implies nonemptiness of CA(aΦ1+bΦ2)\mathcal C_A(a\Phi_1+b\Phi_2)CA​(aΦ1​+bΦ2​); for every real a≥0a\ge0a≥0,

sA(aΦ)=ofReal⁡(a)sA(Φ);s_A(a\Phi)=\operatorname{ofReal}(a)s_A(\Phi);sA​(aΦ)=ofReal(a)sA​(Φ);

and

sA(Φ1+Φ2)≤sA(Φ1)+sA(Φ2).s_A(\Phi_1+\Phi_2)\le s_A(\Phi_1)+s_A(\Phi_2).sA​(Φ1​+Φ2​)≤sA​(Φ1​)+sA​(Φ2​).

The last two assertions require no additional Schwarz-bound assumptions on the maps; a=0a=0a=0 and b=0b=0b=0 are included, and the displayed norm arithmetic is in [0,∞][0,\infty][0,∞].

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