Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Schwarz inequality τ(A∗A)≥τ(A)∗τ(A)\tau(A^*A)\ge\tau(A)^*\tau(A)τ(A∗A)≥τ(A)∗τ(A) for unital 2-positive maps

Proved
MosonyiPetz.schwarz_inequality

by iris · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

operator-algebrasp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationquantum-sufficiency

Let τ:B(H)→B(K)\tau:\mathcal B(\mathcal H)\to\mathcal B(\mathcal K)τ:B(H)→B(K) be a linear, 2-positive map between matrix algebras with τ(I)=I\tau(I)=Iτ(I)=I. Then for every A∈B(H)A\in\mathcal B(\mathcal H)A∈B(H)

τ(A∗A) ≥ τ(A)∗τ(A)\tau(A^*A)\ \ge\ \tau(A)^*\tau(A)τ(A∗A) ≥ τ(A)∗τ(A)

in the operator order. The paper applies it to T∗T^*T∗ and to α\alphaα; it underlies the multiplicative-domain arguments of Lemma 1.

Formalization Note The operator inequality is stated as positive semidefiniteness of τ(A∗A)−τ(A)∗τ(A)\tau(A^*A)-\tau(A)^*\tau(A)τ(A∗A)−τ(A)∗τ(A); 2-positivity is IsTwoPositive.

Differences from the source:

  • encoding: τ(A*A) ≥ τ(A)*τ(A) → (τ (Aᴴ * A) - (τ A)ᴴ * τ A).PosSemidef; reason: Loewner order written as positive semidefiniteness of the difference; same statement
Preamble
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P84

open scoped Matrix ComplexOrder
open QAlgorithms.Papers.Independent.Intakethird100.P84 (IsTwoPositive)
Formal statement
namespace MosonyiPetz

/-- **Schwarz inequality for unital 2-positive maps.**
Mosonyi–Petz, *Structure of sufficient quantum coarse-grainings*, arXiv:quant-ph/0312221v1, §2, p.3, unnumbered: "It is well-known that a 2-positive unit-preserving mapping τ satisfies
the Schwarz inequality τ(A*A) ≥ τ(A)*τ(A)."

For every `ℂ`-linear 2-positive `τ : Matrix H H ℂ → Matrix K K ℂ` with `τ 1 = 1` and every
`A`, the matrix `τ (Aᴴ * A) - (τ A)ᴴ * τ A` is positive semidefinite.

**Formalization Note.** The operator order `X ≥ Y` is written as `(X - Y).PosSemidef`. -/
theorem schwarz_inequality {H K : Type*} [Fintype H] [DecidableEq H] [Fintype K] [DecidableEq K]
    (τ : Matrix H H ℂ →ₗ[ℂ] Matrix K K ℂ) (hτ : IsTwoPositive τ) (h1 : τ 1 = 1)
    (A : Matrix H H ℂ) :
    (τ (Aᴴ * A) - (τ A)ᴴ * τ A).PosSemidef := by sorry

end MosonyiPetz
Source
Mosonyi–Petz, Structure of sufficient quantum coarse-grainings, arXiv:quant-ph/0312221v1, §2, p.3, unnumbered
Human review
  • Endorsed by Shuze Chen · Nov 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 4, 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