Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4: measurement variation bounded by trace norm

Open
QAlgorithms.Papers.Independent.Intakethird100.P03.measurement_variation

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let Ω\OmegaΩ be a finite family of mutually orthogonal subspaces of a finite complex Hilbert space, and let ρ,γ\rho,\gammaρ,γ be density operators. With P(ρ,V)=Tr⁡(ρΠV)P(\rho,V)=\operatorname{Tr}(\rho\Pi_V)P(ρ,V)=Tr(ρΠV​),

∑V∈Ω∣P(ρ,V)−P(γ,V)∣≤∥ρ−γ∥tr.\sum_{V\in\Omega}|P(\rho,V)-P(\gamma,V)|\le\|\rho-\gamma\|_{\mathrm{tr}}.V∈Ω∑​∣P(ρ,V)−P(γ,V)∣≤∥ρ−γ∥tr​.

The family need not span the Hilbert space. The sum is the unhalved variation expression used in the paper.

This bounds measurement errors even when the observable can have no value.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P03
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate Kronecker

namespace QAlgorithms.Papers.Independent.Intakethird100.P03

open QAlgorithms.Papers.Independent.Renew46.P01 (cleanVector)

attribute [local instance] Classical.propDecidable

/-- PDF p.12, Lemma 4: sum of absolute probability differences for a possibly
incomplete orthogonal family; this is not half-normalized total variation. -/
theorem measurement_variation {I : Type*} [Fintype I] [DecidableEq I]
    (r : ℕ) (O : OrthogonalProjectorFamily I r) (rho gamma : Matrix I I ℂ)
    (hrho : IsDensityMatrix rho) (hgamma : IsDensityMatrix gamma) :
    (∑ v, |subspaceProbability rho (O.proj v) -
      subspaceProbability gamma (O.proj v)|) ≤ traceNorm (rho - gamma) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P03

end
Source
Quantum measurements and the Abelian Stabilizer Problem, arXiv:quant-ph/9511026v1, PDF p. 12, Lemma 4: measurement variation bounded by trace norm
Read-back

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

For every finite type III with decidable equality, every natural number rrr, every family P0,…,Pr−1P_0,\ldots,P_{r-1}P0​,…,Pr−1​ of complex I×II\times II×I matrices satisfying Pv†=PvP_v^\dagger=P_vPv†​=Pv​, Pv2=PvP_v^2=P_vPv2​=Pv​, and PvPu=0P_vP_u=0Pv​Pu​=0 when v≠uv\ne uv=u, and every pair of positive semidefinite complex matrices ρ,γ\rho,\gammaρ,γ with tr⁡ρ=tr⁡γ=1\operatorname{tr}\rho=\operatorname{tr}\gamma=1trρ=trγ=1,

∑v=0r−1∣Re⁡tr⁡(ρPv)−Re⁡tr⁡(γPv)∣≤Re⁡tr⁡(ρ−γ)†(ρ−γ).\sum_{v=0}^{r-1} \left|\operatorname{Re}\operatorname{tr}(\rho P_v) -\operatorname{Re}\operatorname{tr}(\gamma P_v)\right| \le \operatorname{Re}\operatorname{tr}\sqrt{(\rho-\gamma)^\dagger(\rho-\gamma)}.v=0∑r−1​∣Retr(ρPv​)−Retr(γPv​)∣≤Retr(ρ−γ)†(ρ−γ)​.

The square root on the right is defined by continuous functional calculus. The projector family need not sum to the identity. When r=0r=0r=0, the left side is 000; if III is empty, the trace-one hypotheses cannot be satisfied.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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