Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Gentle measurement with constant two

Open
QAlgorithms.Papers.Independent.Intakethird100.P05.gentle_measurement

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

prove2quantum

Let ρ\rhoρ be a positive semidefinite trace-one operator on a finite-dimensional complex Hilbert space, and let XXX be any effect, so 0≤X≤I0\le X\le I0≤X≤I. Then

∥ρ−X ρX∥1≤2Tr⁡[ρ(I−X)].\left\|\rho-\sqrt X\,\rho\sqrt X\right\|_1\le2\sqrt{\operatorname{Tr}[\rho(I-X)]}.​ρ−X​ρX​​1​≤2Tr[ρ(I−X)]​.

Here ∥A∥1=Tr⁡A∗A\|A\|_1=\operatorname{Tr}\sqrt{A^*A}∥A∥1​=TrA∗A​ is the full trace norm, and X ρX\sqrt X\,\rho\sqrt XX​ρX​ is the unnormalized postmeasurement operator. Singular effects and zero rejection probability are included. This bound controls the disturbance caused by a likely measurement outcome.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P05
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P05

open scoped Matrix ComplexConjugate ComplexOrder BigOperators

open Filter Topology QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)

open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)

open QAlgorithms.Papers.Independent.Dependency50.P28 (tr pinch typeI accept)

open QAlgorithms.Papers.Independent.Claimed50.P45 (pinchedTest)

open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)

open QAlgorithms.Papers.Independent.Dependency50.P35 (directSum)

open QAlgorithms.Papers.Independent.Renew46.P44 (wordOutput)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {X I : Type} [Fintype X] [DecidableEq X] [Fintype I] [DecidableEq I]

/-- PDF p.10, Lemma 5, (57): gentle measurement with constant 2 in the FULL
trace norm. The postmeasurement operator is unnormalized; zero effects,
singular effects, and zero rejection probability are allowed. -/
theorem gentle_measurement (rho E : Mat I) (hrho : IsDensityMatrix rho)
    (hE : IsEffect E) :
    traceNorm (rho - cfc Real.sqrt E * rho * cfc Real.sqrt E) ≤
      2 * Real.sqrt (tr (rho * (1 - E))) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P05

end
Source
A New Proof of the Channel Coding Theorem via Hypothesis Testing in Quantum Information Theory, arXiv:quant-ph/0208139v1, PDF p. 10, Lemma 5, (57)
Read-back

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

For every finite type III with decidable equality and complex matrices ρ,E\rho,Eρ,E on III, assume that ρ\rhoρ is positive semidefinite with complex trace 111, and that both EEE and 1−E\mathbf1-E1−E are positive semidefinite. Writing S=ES=\sqrt ES=E​, defined by continuous functional calculus, and Z=ρ−SρSZ=\rho-S\rho SZ=ρ−SρS, the assertion is

Re⁡Tr⁡Z†Z≤2Re⁡Tr⁡(ρ(1−E)).\operatorname{Re}\operatorname{Tr}\sqrt{Z^\dagger Z} \le 2\sqrt{\operatorname{Re}\operatorname{Tr}\bigl(\rho(\mathbf1-E)\bigr)}.ReTrZ†Z​≤2ReTr(ρ(1−E))​.

Thus the norm on the left is explicitly the real trace of the positive square root of Z†ZZ^\dagger ZZ†Z. The hypotheses include effects with zero or full acceptance probability; no strict positivity or invertibility is required. If III is empty, the trace-111 hypothesis cannot hold.

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