Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered sharpness of 1-T<=Q

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.traceBoundSharpness

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For every T∈[0,1]T\in[0,1]T∈[0,1], take the commuting qubit densities ρ=diag⁡(1,0)\rho=\operatorname{diag}(1,0)ρ=diag(1,0) and σ=diag⁡(1−T,T)\sigma=\operatorname{diag}(1-T,T)σ=diag(1−T,T). Then

12∥ρ−σ∥1=T,Q(ρ,σ)=1−T.\tfrac12\|\rho-\sigma\|_1=T,\qquad Q(\rho,\sigma)=1-T.21​∥ρ−σ∥1​=T,Q(ρ,σ)=1−T.

Thus the bound Q+T≥1Q+T\ge1Q+T≥1 is sharp for every allowed trace distance. The printed fixed-sss equality is corrected: for 0<s<10<s<10<s<1, the example has Qs=(1−T)sQ_s=(1-T)^sQs​=(1−T)s; the infimum is obtained as s↑1s\uparrow1s↑1 when 0<T<10<T<10<T<1.

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 TTT satisfying 0≤T≤10\leq T\leq10≤T≤1, the two-by-two matrices

ρ=(1000),σ=(1−T00T)\rho=\begin{pmatrix}1&0\\0&0\end{pmatrix}, \qquad \sigma=\begin{pmatrix}1-T&0\\0&T\end{pmatrix}ρ=(10​00​),σ=(1−T0​0T​)

are positive semidefinite and have trace one, and they satisfy

12Re⁡tr⁡(ρ−σ)†(ρ−σ)=T,inf⁡0≤s≤1Re⁡tr⁡(ρ 1−sσs)=1−T.\frac12\operatorname{Re}\operatorname{tr} \sqrt{(\rho-\sigma)^\dagger(\rho-\sigma)}=T, \qquad \inf_{0\leq s\leq1}\operatorname{Re}\operatorname{tr} (\rho^{\,1-s}\sigma^s)=1-T.21​Retr(ρ−σ)†(ρ−σ)​=T,0≤s≤1inf​Retr(ρ1−sσs)=1−T.

The matrix powers use continuous functional calculus applied to real powers, including 00=10^0=100=1. Both parameter endpoints T=0T=0T=0 and T=1T=1T=1, as well as both endpoints in the infimum over sss, are included.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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