Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma I.3: For pure rho and normalized arbitrary sigma: D²≤1−F≤D.

Proved
QAlgorithms.Papers.Independent.Renew46.P43.mixedDistance

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

prove2quantum

Let ρ\rhoρ be a normalized pure state and σ\sigmaσ any normalized density operator on the same finite system. Write D(ρ,σ)=∥ρ−σ∥1/2D(\rho,\sigma)=\|\rho-\sigma\|_1/2D(ρ,σ)=∥ρ−σ∥1​/2.

D(ρ,σ)≥1−Tr⁡(ρσ)≥D(ρ,σ)2.D(\rho,\sigma)\ge 1-\operatorname{Tr}(\rho\sigma)\ge D(\rho,\sigma)^2.D(ρ,σ)≥1−Tr(ρσ)≥D(ρ,σ)2.

This is the source result with its stated operational or information-theoretic domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Renew46.P43

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator

open Filter MeasureTheory

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

open QAlgorithms.Papers.Independent.Information100.P06 (Below)

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

open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Lemma I.3, PDF p.9. Both states are normalized; the printed subnormalized
extension is false and is separately recorded in HARD.md. -/
theorem mixedDistance {I : Type} [Fintype I] [DecidableEq I]
    (rho sigma : Matrix I I ℂ) (hrho : IsPure rho) (hsigma : IsDensityMatrix sigma) :
    traceDistance rho sigma ≥ 1 - effectProb rho sigma ∧
      1 - effectProb rho sigma ≥ (traceDistance rho sigma)^2 := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 9, Lemma I.3
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 ρ,σ\rho,\sigmaρ,σ indexed by III, suppose that ρ\rhoρ is pure, meaning that there exists v∈CIv\in\mathbb C^Iv∈CI with ∥v∥2=1\|v\|_2=1∥v∥2​=1 and ρij=vivj‾\rho_{ij}=v_i\overline{v_j}ρij​=vi​vj​​, and that σ\sigmaσ is positive semidefinite with tr⁡σ=1\operatorname{tr}\sigma=1trσ=1. Define ∥M∥1=Re⁡tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M}∥M∥1​=RetrM†M​ and D(ρ,σ)=12∥ρ−σ∥1D(\rho,\sigma)=\frac12\|\rho-\sigma\|_1D(ρ,σ)=21​∥ρ−σ∥1​. Then

D(ρ,σ)≥1−Re⁡tr⁡(ρσ)and1−Re⁡tr⁡(ρσ)≥D(ρ,σ)2.D(\rho,\sigma)\ge 1-\operatorname{Re}\operatorname{tr}(\rho\sigma) \quad\text{and}\quad 1-\operatorname{Re}\operatorname{tr}(\rho\sigma)\ge D(\rho,\sigma)^2.D(ρ,σ)≥1−Retr(ρσ)and1−Retr(ρσ)≥D(ρ,σ)2.

The hypotheses cannot hold when III is empty.

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