Unnumbered sharpness of 1-T<=Q
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.traceBoundSharpnessprove2quantum
For every , take the commuting qubit densities and . Then
Thus the bound is sharp for every allowed trace distance. The printed fixed- equality is corrected: for , the example has ; the infimum is obtained as when .
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P45
open QAlgorithms Filter
open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology
open QAlgorithms.Papers.Independent.Information100.P07
(support positivePart positiveProjection IsProjection)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- arXiv:0708.4282v1, PDF p.13: Unnumbered sharpness of 1-T<=Q. Source correction: PDF p.13 prints Qs=1-T; changed to the infimum Q=1-T, since the example gives Qs=(1-T)^s in the open interval. Independent moderation required. -/
theorem traceBoundSharpness (T : ℝ) (h0 : 0 ≤ T) (h1 : T ≤ 1) :
let rho : Mat (Fin 2) := Matrix.diagonal ![1,0]
let sigma : Mat (Fin 2) := Matrix.diagonal ![((1-T : ℝ) : ℂ),(T : ℂ)]
IsDensityMatrix rho ∧ IsDensityMatrix sigma ∧
traceDist rho sigma = T ∧ chernoffInfimum rho sigma = 1-T := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P45
end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 13, Unnumbered sharpness of 1-T<=Q
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real satisfying , the two-by-two matrices
are positive semidefinite and have trace one, and they satisfy
The matrix powers use continuous functional calculus applied to real powers, including . Both parameter endpoints and , as well as both endpoints in the infimum over , are included.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.