Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, fidelity and trace-distance bounds (28)–(32)

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.fidelityBounds

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

prove2quantum

For finite-dimensional densities ρ,σ\rho,\sigmaρ,σ, put Q=inf⁡0≤s≤1Tr⁡(ρ1−sσs)Q=\inf_{0\le s\le1}\operatorname{Tr}(\rho^{1-s}\sigma^s)Q=inf0≤s≤1​Tr(ρ1−sσs), T=∥ρ−σ∥1/2T=\|\rho-\sigma\|_1/2T=∥ρ−σ∥1​/2, and use the unsquared fidelity F=∥ρ1/2σ1/2∥1F=\|\rho^{1/2}\sigma^{1/2}\|_1F=∥ρ1/2σ1/2∥1​. The complete bounds are

Q≤Tr⁡(ρ1/2σ1/2)=∥ρ1/4σ1/2ρ1/4∥1≤F,Q\le\operatorname{Tr}(\rho^{1/2}\sigma^{1/2})=\|\rho^{1/4}\sigma^{1/2}\rho^{1/4}\|_1\le F,Q≤Tr(ρ1/2σ1/2)=∥ρ1/4σ1/2ρ1/4∥1​≤F, (1−F)2≤T2≤1−F2,Q2+T2≤1,(1-F)^2\le T^2\le1-F^2,\qquad Q^2+T^2\le1,(1−F)2≤T2≤1−F2,Q2+T2≤1, 1−1−F2≤1−T≤Q≤F≤1−T2,F2≤Q.1-\sqrt{1-F^2}\le1-T\le Q\le F\le\sqrt{1-T^2},\qquad F^2\le Q.1−1−F2​≤1−T≤Q≤F≤1−T2​,F2≤Q.

If either state is pure, Q=F2Q=F^2Q=F2. These compare the operational Chernoff coefficient with standard state distinguishability measures.

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 pp.16,17: §4.1, fidelity and trace-distance bounds (28)–(32). -/
theorem fidelityBounds (rho sigma : Mat I)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
    let Q := chernoffInfimum rho sigma
    let F := rootFidelity rho sigma
    let T := traceDist rho sigma
    Q ≤ (positiveMatrixRpow rho (1/2) * positiveMatrixRpow sigma (1/2)).trace.re ∧
    (positiveMatrixRpow rho (1/2) * positiveMatrixRpow sigma (1/2)).trace.re =
      traceNorm (positiveMatrixRpow rho (1/4) * positiveMatrixRpow sigma (1/2) * positiveMatrixRpow rho (1/4)) ∧
    traceNorm (positiveMatrixRpow rho (1/4) * positiveMatrixRpow sigma (1/2) * positiveMatrixRpow rho (1/4)) ≤
      traceNorm (positiveMatrixRpow rho (1/2) * positiveMatrixRpow sigma (1/2)) ∧
    traceNorm (positiveMatrixRpow rho (1/2) * positiveMatrixRpow sigma (1/2)) = F ∧
    (1-F)^2 ≤ T^2 ∧ T^2 ≤ 1-F^2 ∧ Q^2+T^2 ≤ 1 ∧
    1-Real.sqrt (1-F^2) ≤ 1-T ∧ 1-T ≤ Q ∧ Q ≤ F ∧
    F ≤ Real.sqrt (1-T^2) ∧ F^2 ≤ Q ∧
    ((densityIdempotence rho ∨ densityIdempotence sigma) → Q=F^2) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 16, §4.1, fidelity and trace-distance bounds (28)–(32)
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every finite index type III with decidable equality and every positive semidefinite complex matrices ρ,σ\rho,\sigmaρ,σ indexed by III with trace one, define

∥M∥1=Re⁡tr⁡M†M,Q=inf⁡0≤s≤1Re⁡tr⁡(ρ 1−sσs),F=Re⁡tr⁡ρ σρ,T=∥ρ−σ∥12.\|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M}, \quad Q=\inf_{0\leq s\leq1}\operatorname{Re}\operatorname{tr}(\rho^{\,1-s}\sigma^s), \quad F=\operatorname{Re}\operatorname{tr}\sqrt{\sqrt{\rho}\,\sigma\sqrt{\rho}}, \quad T=\frac{\|\rho-\sigma\|_1}{2}.∥M∥1​=RetrM†M​,Q=0≤s≤1inf​Retr(ρ1−sσs),F=Retrρ​σρ​​,T=2∥ρ−σ∥1​​.

All matrix powers and square roots here are defined by continuous functional calculus using the corresponding real functions; in particular, the powers at the endpoints of the infimum use 00=10^0=100=1. Then

Q≤Re⁡tr⁡(ρ1/2σ1/2)=∥ρ1/4σ1/2ρ1/4∥1≤∥ρ1/2σ1/2∥1=F,\begin{aligned} Q &\leq\operatorname{Re}\operatorname{tr}(\rho^{1/2}\sigma^{1/2})\\ &=\|\rho^{1/4}\sigma^{1/2}\rho^{1/4}\|_1\\ &\leq\|\rho^{1/2}\sigma^{1/2}\|_1 =F, \end{aligned}Q​≤Retr(ρ1/2σ1/2)=∥ρ1/4σ1/2ρ1/4∥1​≤∥ρ1/2σ1/2∥1​=F,​

and all the following inequalities hold:

(1−F)2≤T2,T2≤1−F2,Q2+T2≤1,(1-F)^2\leq T^2,\qquad T^2\leq1-F^2,\qquad Q^2+T^2\leq1,(1−F)2≤T2,T2≤1−F2,Q2+T2≤1, 1−1−F2≤1−T,1−T≤Q,Q≤F,F≤1−T2,F2≤Q.1-\sqrt{1-F^2}\leq1-T,\qquad 1-T\leq Q,\qquad Q\leq F,\qquad F\leq\sqrt{1-T^2},\qquad F^2\leq Q.1−1−F2​≤1−T,1−T≤Q,Q≤F,F≤1−T2​,F2≤Q.

If either ρ2=ρ\rho^2=\rhoρ2=ρ or σ2=σ\sigma^2=\sigmaσ2=σ, then Q=F2Q=F^2Q=F2. The density hypotheses exclude an empty III.

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