Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9.4.3 (Gentle Measurement for Ensembles): ∑xpX(x)∥ρx−ΛρxΛ∥1≤2ε\sum_x p_X(x)\|\rho_x-\sqrt\Lambda\rho_x\sqrt\Lambda\|_1\le2\sqrt\varepsilon∑x​pX​(x)∥ρx​−Λ​ρx​Λ​∥1​≤2ε​

Proved
WildeQIT.Gentle.lemma_9_4_3

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

fidelitygentle-measurementp2o-gran-per-chapterp2o-plan-bookp2o-v1quantum-informationtrace-norm

Let {pX(x),ρx}\{p_X(x),\rho_x\}{pX​(x),ρx​} be an ensemble of density operators over a finite alphabet X\mathcal XX, with average density operator

ρ≡∑xpX(x) ρx.\rho\equiv\sum_x p_X(x)\,\rho_x .ρ≡x∑​pX​(x)ρx​.

Let Λ\LambdaΛ be a positive semidefinite operator with Λ≤I\Lambda\le IΛ≤I, and suppose that Tr⁡{ρΛ}≥1−ε\operatorname{Tr}\{\rho\Lambda\}\ge1-\varepsilonTr{ρΛ}≥1−ε for some ε∈[0,1]\varepsilon\in[0,1]ε∈[0,1]. Then

∑xpX(x) ∥ρx−Λ ρx Λ∥1≤2ε.\sum_x p_X(x)\,\bigl\|\rho_x-\sqrt\Lambda\,\rho_x\,\sqrt\Lambda\bigr\|_1\le2\sqrt\varepsilon .x∑​pX​(x)​ρx​−Λ​ρx​Λ​​1​≤2ε​.

If an operator detects the average state of an ensemble with high probability, then on average over the ensemble it disturbs the individual states only a little. This is the form in which gentle measurement enters the coding theorems for classical communication over quantum channels.

Formalization Note The finite dimension and the finite alphabet are the book's setting. pXp_XpX​ is the published WildeQIT.FinDist; Λ≤I\Lambda\le IΛ≤I is positive semidefiniteness of I−ΛI-\LambdaI−Λ; Tr⁡{ρΛ}\operatorname{Tr}\{\rho\Lambda\}Tr{ρΛ} is the real part of the complex trace; Λ\sqrt\LambdaΛ​ is CFC.sqrt; ∥⋅∥1\|\cdot\|_1∥⋅∥1​ is the unhalved published trace norm. Λ\LambdaΛ need not belong to a POVM.

Differences from the source:

  • encoding: ensemble {pX(x),ρx}\{p_X(x),\rho_x\}{pX​(x),ρx​} → a FinDist on a finite alphabet and a family of density operators; reason: the book's ensembles have finite alphabets, so the same objects.
  • encoding: Tr⁡{ρΛ}\operatorname{Tr}\{\rho\Lambda\}Tr{ρΛ} → real part of the complex trace of ρΛ\rho\LambdaρΛ; reason: the trace is real for positive semidefinite ρ,Λ\rho,\Lambdaρ,Λ, so no instance changes.
Preamble
import Definitions.Def_WildeQIT_traceNorm
import Definitions.Def_WildeQIT_IsDensityOperator
import Definitions.Def_WildeQIT_FinDist
import Definitions.Def_WildeQIT_Gentle_averageState

open Matrix
open scoped MatrixOrder ComplexOrder
Formal statement
namespace WildeQIT.Gentle

/-- **Lemma 9.4.3 (Gentle Measurement for Ensembles)** (Wilde, *From Classical to Quantum
Shannon Theory*, arXiv:1106.1445v8, p. 279, eq. (9.211)). Let `{p_X(x), ρ_x}` be an ensemble with
average density operator `ρ ≡ ∑_x p_X(x) ρ_x`. Given a positive semi-definite operator `Λ` with
`Λ ≤ I` and `Tr{ρΛ} ≥ 1 − ε` where `ε ∈ [0, 1]`,
`∑_x p_X(x) ‖ρ_x − √Λ ρ_x √Λ‖₁ ≤ 2√ε`.

**Formalization Note.** Finite dimensions and a finite alphabet `𝒳` (a `Fintype`), as throughout
the book. `p_X` is the published `WildeQIT.FinDist`; each `ρ_x` is a density operator. `Λ ≤ I`
is `(1 − Λ).PosSemidef`; `Tr{ρΛ}` is the real part of the complex trace; `√Λ` is `CFC.sqrt Λ`;
`‖·‖₁` is the (unhalved) published `WildeQIT.traceNorm`. `Λ` need not belong to a POVM. -/
theorem lemma_9_4_3 {X n : Type} [Fintype X] [Fintype n] [DecidableEq n]
    (p : FinDist X) (ρ : X → Matrix n n ℂ) (hρ : ∀ x, IsDensityOperator (ρ x))
    (Λ : Matrix n n ℂ) (hΛ : Λ.PosSemidef) (hΛI : (1 - Λ).PosSemidef)
    (ε : ℝ) (hε0 : 0 ≤ ε) (hε1 : ε ≤ 1)
    (hdet : 1 - ε ≤ (averageState p ρ * Λ).trace.re) :
    ∑ x, p.prob x * traceNorm (ρ x - CFC.sqrt Λ * ρ x * CFC.sqrt Λ) ≤ 2 * Real.sqrt ε := by sorry

end WildeQIT.Gentle
Source
Wilde, From Classical to Quantum Shannon Theory, arXiv:1106.1445v8, Lemma 9.4.3 (Gentle Measurement for Ensembles), eq. (9.211), p. 279
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by Mrnaiq · Nov 20, 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