Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.1 / (31): pure-state trace distance and equality cases

Open
QAlgorithms.Papers.Independent.Gap20.P07.pureState_traceDistance

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ\rhoρ be a positive trace-class operator of trace one on an arbitrary nonzero complex Hilbert space, and let ψ\psiψ have norm one. Then

∥ρ−∣ψ⟩⟨ψ∣∥1≤21−⟨ψ∣ρ∣ψ⟩.\|\rho-|\psi\rangle\langle\psi|\|_1\le2\sqrt{1-\langle\psi|\rho|\psi\rangle}.∥ρ−∣ψ⟩⟨ψ∣∥1​≤21−⟨ψ∣ρ∣ψ⟩​.

Equality holds if and only if ρ\rhoρ is pure or ψ\psiψ is orthogonal to its support, equivalently its expectation of ρ\rhoρ is zero. This retains the equality characterization used in the proof. The printed word “strict” is corrected to “equality”: the identical-pure-state case gives 0=00=00=0. The bound compares an arbitrary density state with a pure reference.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap20.P07

open QAlgorithms

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)

open QAlgorithms.Papers.Independent.Frontier30.P14
  (Operation isometryCoeff conjugateKernel)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
   transpose transposeBound TraceLinear tracePair MeasurePrepare)

open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)

/-- PDF p.12, Lemma 4.1, (31). Printed: 'strict iff'. Changed to equality iff,
as the proof explicitly computes and characterizes equality. At rho=|psi><psi|
both sides are zero. No finite-dimensional restriction is imposed. For a positive
rho, zero expectation is equivalent to orthogonality to its support. -/
theorem pureState_traceDistance {I : Type} [Nonempty I]
    (rho : State I) (psi : Hilbert I) (hpsi : ‖psi‖ = 1) :
    let overlap := (tracePair rho.coefficients (rankOne psi)).re
    traceSize (rho.coefficients - rankOne psi) ≤ ENNReal.ofReal (2 * Real.sqrt (1 - overlap)) ∧
    (traceSize (rho.coefficients - rankOne psi) = ENNReal.ofReal (2 * Real.sqrt (1 - overlap)) ↔
      (∃ phi : Hilbert I, ‖phi‖ = 1 ∧ rho.coefficients = rankOne phi) ∨ overlap = 0) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 12, Lemma 4.1 / (31): pure-state trace distance and equality cases
Read-back

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

Let III be any nonempty type, let HI=ℓ2(I;C)H_I=\ell^2(I;\mathbb C)HI​=ℓ2(I;C), and let ρ=(ρij)\rho=(\rho_{ij})ρ=(ρij​) be a density in the following precise sense: there are ur,vr∈HIu_r,v_r\in H_Iur​,vr​∈HI​ with ∑r≥0∥ur∥∥vr∥<∞\sum_{r\ge0}\|u_r\|\|v_r\|<\infty∑r≥0​∥ur​∥∥vr​∥<∞ and ρij=∑r≥0ur(i)vr(j)‾\rho_{ij}=\sum_{r\ge0}u_r(i)\overline{v_r(j)}ρij​=∑r≥0​ur​(i)vr​(j)​; every finite principal restriction of ρ\rhoρ is positive semidefinite; and (Re⁡ρii)i∈I(\operatorname{Re}\rho_{ii})_{i\in I}(Reρii​)i∈I​ is summable with sum 111. For any matrix XXX, define τ(X)∈[0,∞]\tau(X)\in[0,\infty]τ(X)∈[0,∞] as the infimum of ∑r∥ar∥∥br∥\sum_r\|a_r\|\|b_r\|∑r​∥ar​∥∥br​∥ over expansions Xij=∑r≥0ar(i)br(j)‾X_{ij}=\sum_{r\ge0}a_r(i)\overline{b_r(j)}Xij​=∑r≥0​ar​(i)br​(j)​ with square-summable vectors and finite such sum, taking +∞+\infty+∞ when no expansion exists. For every ψ∈HI\psi\in H_Iψ∈HI​ with ∥ψ∥=1\|\psi\|=1∥ψ∥=1, put Pψij=ψ(i)ψ(j)‾P_\psi{}_{ij}=\psi(i)\overline{\psi(j)}Pψ​ij​=ψ(i)ψ(j)​ and

c=Re⁡(∑i∑jρijψ(j)ψ(i)‾).c=\operatorname{Re}\left(\sum_i\sum_j \rho_{ij}\psi(j)\overline{\psi(i)}\right).c=Re(i∑​j∑​ρij​ψ(j)ψ(i)​).

Then

τ(ρ−Pψ)≤max⁡ ⁣(0,21−c),\tau(\rho-P_\psi)\le \max\!\left(0,2\sqrt{1-c}\right),τ(ρ−Pψ​)≤max(0,21−c​),

and equality holds if and only if either there exists ϕ∈HI\phi\in H_Iϕ∈HI​ with ∥ϕ∥=1\|\phi\|=1∥ϕ∥=1 and ρij=ϕ(i)ϕ(j)‾\rho_{ij}=\phi(i)\overline{\phi(j)}ρij​=ϕ(i)ϕ(j)​ for all i,ji,ji,j, or c=0c=0c=0. The right-hand side is regarded as an extended nonnegative real; the real square root is the total function that is 000 on negative inputs. The equality alternative c=0c=0c=0 does not require ρ\rhoρ to have the displayed rank-one form, and no countability assumption on III is imposed.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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