Lemma 4.1 / (31): pure-state trace distance and equality cases
OpenQAlgorithms.Papers.Independent.Gap20.P07.pureState_traceDistanceLet be a positive trace-class operator of trace one on an arbitrary nonzero complex Hilbert space, and let have norm one. Then
Equality holds if and only if is pure or is orthogonal to its support, equivalently its expectation of 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 . The bound compares an arbitrary density state with a pure reference.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any nonempty type, let , and let be a density in the following precise sense: there are with and ; every finite principal restriction of is positive semidefinite; and is summable with sum . For any matrix , define as the infimum of over expansions with square-summable vectors and finite such sum, taking when no expansion exists. For every with , put and
Then
and equality holds if and only if either there exists with and for all , or . The right-hand side is regarded as an extended nonnegative real; the real square root is the total function that is on negative inputs. The equality alternative does not require to have the displayed rank-one form, and no countability assumption on is imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.