Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.2

Proved
QAlgorithms.Papers.Independent.Support50.P12.lemma_3_2

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.

Assume Φ\PhiΦ is positive and S:=Φ∗(Φ(B)0)≤I1S:=\Phi^*(\Phi(B)^0)\le I_1S:=Φ∗(Φ(B)0)≤I1​. Then Tr⁡Φ(B)≤Tr⁡B\operatorname{Tr}\Phi(B)\le\operatorname{Tr}BTrΦ(B)≤TrB, and the following five conditions are equivalent:

Tr⁡Φ(B)=Tr⁡B;f(B)S=Sf(B)=f(B) for every complex f on spec(B), f(0)=0 if needed;B0≤P{1}(S);Φ preserves trace on B0A1B0;ΦB∗(Φ(B))=B.\begin{gathered}\operatorname{Tr}\Phi(B)=\operatorname{Tr}B;\\f(B)S=Sf(B)=f(B)\text{ for every complex }f\text{ on spec}(B),\ f(0)=0\text{ if needed};\\B^0\le P_{\{1\}}(S);\\\Phi\text{ preserves trace on }B^0\mathcal A_1B^0;\\\Phi_B^*(\Phi(B))=B.\end{gathered}TrΦ(B)=TrB;f(B)S=Sf(B)=f(B) for every complex f on spec(B), f(0)=0 if needed;B0≤P{1}​(S);Φ preserves trace on B0A1​B0;ΦB∗​(Φ(B))=B.​

Under these conditions, every positive AAA supported in BBB has its trace preserved. The adjoint bound is local; global trace non-increase is not substituted for it.

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.2, PDF p.10: the local adjoint bound, all five equivalent criteria,
and trace preservation throughout the support corner. -/
theorem lemma_3_2 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J)
    (Phi : MatrixMap I J) (hc : AlgebraExtension A B Phi) (hp : PositiveOnConcreteAlgebra A Phi)
    (Y : Mat I) (hY : Y ∈ A) (hYp : Y.PosSemidef)
    (hb : LE (channelAdjoint Phi (supp (Phi Y))) 1) :
    let S := channelAdjoint Phi (supp (Phi Y))
    let c1 := tr (Phi Y) = tr Y
    let c2 := ∀ f : ℝ → ℂ, (0 ∈ spec Y → f 0 = 0) →
      spectralFunction f Y * S = spectralFunction f Y ∧ S * spectralFunction f Y = spectralFunction f Y
    let c3 := LE (supp Y) (spectralProjector S 1)
    let c4 := CornerTP A Phi (supp Y)
    let c5 := petz Y Phi (Phi Y) = Y
    tr (Phi Y) ≤ tr Y ∧ (c1 ↔ c2) ∧ (c2 ↔ c3) ∧ (c3 ↔ c4) ∧ (c4 ↔ c5) ∧
      (c1 → ∀ X ∈ A, X.PosSemidef → Supports X Y → tr (Phi X) = tr X) := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 10, Lemma 3.2
Read-back

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

Let I,JI,JI,J be finite, nonempty index types with decidable equality, let A,B\mathcal A,\mathcal BA,B be unital complex star subalgebras, and let Φ:Mat⁡(I)→Mat⁡(J)\Phi:\operatorname{Mat}(I)\to\operatorname{Mat}(J)Φ:Mat(I)→Mat(J) be complex linear. Define [Φ†(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​. Assume that Φ\PhiΦ maps every ambient matrix into B\mathcal BB, that Φ†\Phi^\daggerΦ† maps every ambient matrix into A\mathcal AA, and that Φ\PhiΦ is positive on positive semidefinite members of A\mathcal AA. Let Y∈AY\in\mathcal AY∈A be positive semidefinite, put S=Φ†(PΦ(Y))S=\Phi^\dagger(P_{\Phi(Y)})S=Φ†(PΦ(Y)​), and assume S≤IS\le IS≤I, where matrix inequalities mean that the difference is positive semidefinite and PZP_ZPZ​ is the range projection of ZZZ. Write tr⁡=Re⁡Tr⁡\operatorname{tr}=\operatorname{Re}\operatorname{Tr}tr=ReTr, let Z[s]Z^{[s]}Z[s] be functional calculus with value zero at eigenvalue zero and xsx^sxs elsewhere, and define

RY,Φ(Z)=Y[1/2]Φ† ⁣((ΦY)[−1/2]Z(ΦY)[−1/2])Y[1/2].\mathcal R_{Y,\Phi}(Z) =Y^{[1/2]}\Phi^\dagger\!\left( (\Phi Y)^{[-1/2]}Z(\Phi Y)^{[-1/2]} \right)Y^{[1/2]}.RY,Φ​(Z)=Y[1/2]Φ†((ΦY)[−1/2]Z(ΦY)[−1/2])Y[1/2].

Then tr⁡(ΦY)≤tr⁡Y\operatorname{tr}(\Phi Y)\le\operatorname{tr}Ytr(ΦY)≤trY, and the following five conditions are equivalent: tr⁡(ΦY)=tr⁡Y\operatorname{tr}(\Phi Y)=\operatorname{tr}Ytr(ΦY)=trY; for every function f:R→Cf:\mathbb R\to\mathbb Cf:R→C satisfying f(0)=0f(0)=0f(0)=0 if zero is an eigenvalue of YYY, the spectral operator f(Y)=∑λ∈spec⁡Yf(λ)Pλ(Y)f(Y)=\sum_{\lambda\in\operatorname{spec}Y}f(\lambda)P_\lambda(Y)f(Y)=∑λ∈specY​f(λ)Pλ​(Y) satisfies f(Y)S=f(Y)f(Y)S=f(Y)f(Y)S=f(Y) and Sf(Y)=f(Y)Sf(Y)=f(Y)Sf(Y)=f(Y); PY≤P1(S)P_Y\le P_1(S)PY​≤P1​(S), where P1(S)P_1(S)P1​(S) is the orthogonal projection onto the eigenvalue-one eigenspace of SSS; Tr⁡Φ(PYXPY)=Tr⁡(PYXPY)\operatorname{Tr}\Phi(P_YXP_Y)=\operatorname{Tr}(P_YXP_Y)TrΦ(PY​XPY​)=Tr(PY​XPY​) for every X∈AX\in\mathcal AX∈A; and RY,Φ(ΦY)=Y\mathcal R_{Y,\Phi}(\Phi Y)=YRY,Φ​(ΦY)=Y. Moreover, the first condition implies tr⁡(ΦX)=tr⁡X\operatorname{tr}(\Phi X)=\operatorname{tr}Xtr(ΦX)=trX for every positive semidefinite X∈AX\in\mathcal AX∈A with ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX. The matrix Y=0Y=0Y=0 is allowed, and the corner trace-preservation condition concerns all matrices in A\mathcal AA, not only positive ones.

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