Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, lines (28)–(32), p. 9 — the trace Cauchy–Schwarz step

Proved
QReversal.NearOpt.eq_29_32

by mikedeng1 · Oct 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

cauchy-schwarzmatrix-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-channel

Let pl≥0p_l\ge0pl​≥0 be weights and ρl\rho_lρl​ density matrices, and let {Ril}i\{R^l_i\}_i{Ril​}i​, {Bil}i\{B^l_i\}_i{Bil​}i​ be arbitrary finite families of matrices indexed by the same set, for each lll. Then

∑lpl∑i∣tr⁡ρlRilBil∣2  ≤  ∑lpl∑i,jtr⁡RilBjlρlBjl†Ril†.\sum_lp_l\sum_i\bigl|\operatorname{tr}\rho_lR^l_iB^l_i\bigr|^2\;\le\;\sum_lp_l\sum_{i,j}\operatorname{tr}R^l_iB^l_j\rho_lB_j^{l\dagger}R_i^{l\dagger}.l∑​pl​i∑​​trρl​Ril​Bil​​2≤l∑​pl​i,j∑​trRil​Bjl​ρl​Bjl†​Ril†​.

This is the chain (28)–(32): the Cauchy–Schwarz inequality for the Hilbert–Schmidt inner product, tr⁡ρl=1\operatorname{tr}\rho_l=1trρl​=1, and the addition of the non-negative terms j≠ij\ne ij=i. In the proof of Theorem 3 the left side bounds the normalization factor needed in line (23).

Formalization Note The traces on the right are of positive semidefinite matrices, hence real; the statement takes their real parts. The families are arbitrary, so the statement does not depend on the singular-value choices made earlier in the proof.

Preamble
import Mathlib
import Definitions.Def_PeresTerno_kraus_basics
import Definitions.Def_QReversal_NearOpt_Setting

open Matrix PeresTerno
open scoped MatrixOrder ComplexOrder
Formal statement
namespace QReversal.NearOpt

theorem eq_29_32 {n L κ : Type*} [Fintype n] [Fintype L] [Fintype κ]
    (p : L → ℝ) (hp : ∀ l, 0 ≤ p l) (ρs : L → Matrix n n ℂ)
    (hρs : ∀ l, IsDensityMatrix (ρs l))
    (Rl Bl : L → κ → Matrix n n ℂ) :
    ∑ l, p l * ∑ i, Complex.normSq (Matrix.trace (ρs l * Rl l i * Bl l i)) ≤
      ∑ l, p l * ∑ i, ∑ j,
        (Matrix.trace (Rl l i * Bl l j * ρs l * (Bl l j)ᴴ * (Rl l i)ᴴ)).re := by sorry

end QReversal.NearOpt
Source
Barnum, Knill, Reversing quantum dynamics with near-optimal quantum and classical fidelity, arXiv:quant-ph/0004088v2, p. 9, proof of Theorem 3, lines (28)–(32)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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