Lemma I.3: For pure rho and normalized arbitrary sigma: D²≤1−F≤D.
ProvedQAlgorithms.Papers.Independent.Renew46.P43.mixedDistanceprove2quantum
Let be a normalized pure state and any normalized density operator on the same finite system. Write .
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 with decidable equality and complex matrices indexed by , suppose that is pure, meaning that there exists with and , and that is positive semidefinite with . Define and . Then
The hypotheses cannot hold when is empty.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.