Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4.2 equation (12): pure-state trace distance

Open
QAlgorithms.Papers.Independent.Intakethird100.P03.pure_trace_distance

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

prove2quantum

For unit vectors ξ,η\xi,\etaξ,η in any finite complex Hilbert space,

∥∣ξ⟩⟨ξ∣−∣η⟩⟨η∣∥tr=21−∣⟨ξ∣η⟩∣2≤2∥ξ−η∥2.\bigl\||\xi\rangle\langle\xi|-|\eta\rangle\langle\eta|\bigr\|_{\mathrm{tr}} =2\sqrt{1-|\langle\xi|\eta\rangle|^2} \le2\|\xi-\eta\|_2.​∣ξ⟩⟨ξ∣−∣η⟩⟨η∣​tr​=21−∣⟨ξ∣η⟩∣2​≤2∥ξ−η∥2​.

The left norm is the full trace norm, without a factor of one half. This relates vector implementation errors to density-operator errors.

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, equation (12): full trace norm, without a factor of one half. -/
theorem pure_trace_distance {I : Type*} [Fintype I] [DecidableEq I]
    (x y : EuclideanSpace ℂ I) (hx : IsState x) (hy : IsState y) :
    traceNorm (pureDensity x - pureDensity y) =
      2 * Real.sqrt (1 - ‖inner ℂ x y‖ ^ 2) ∧
    traceNorm (pureDensity x - pureDensity y) ≤ 2 * ‖x - y‖ := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P03

end
Source
Quantum measurements and the Abelian Stabilizer Problem, arXiv:quant-ph/9511026v1, PDF p. 12, §2.4.2 equation (12): pure-state trace distance
Read-back

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

For every finite type III with decidable equality and every pair x,y∈CIx,y\in\mathbb C^Ix,y∈CI satisfying ∥x∥=∥y∥=1\|x\|=\|y\|=1∥x∥=∥y∥=1, both

∥∣x⟩⟨x∣−∣y⟩⟨y∣∥1=21−∣⟨x,y⟩∣2and∥∣x⟩⟨x∣−∣y⟩⟨y∣∥1≤2∥x−y∥\bigl\||x\rangle\langle x|-|y\rangle\langle y|\bigr\|_1 = 2\sqrt{1-|\langle x,y\rangle|^2} \quad\text{and}\quad \bigl\||x\rangle\langle x|-|y\rangle\langle y|\bigr\|_1 \le 2\|x-y\|​∣x⟩⟨x∣−∣y⟩⟨y∣​1​=21−∣⟨x,y⟩∣2​and​∣x⟩⟨x∣−∣y⟩⟨y∣​1​≤2∥x−y∥

hold. Here the vector norm is Euclidean, ⟨x,y⟩=∑i∈Ixi‾yi\langle x,y\rangle=\sum_{i\in I}\overline{x_i}y_i⟨x,y⟩=∑i∈I​xi​​yi​, the matrix ∣x⟩⟨x∣|x\rangle\langle x|∣x⟩⟨x∣ has entries xixj‾x_i\overline{x_j}xi​xj​​, and the matrix quantity ∥A∥1\|A\|_1∥A∥1​ is defined as Re⁡tr⁡A†A\operatorname{Re}\operatorname{tr}\sqrt{A^\dagger A}RetrA†A​, with the square root obtained by applying the real square-root function through continuous functional calculus. If III is empty, the unit-norm 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