Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (19) — closed form of the fidelity bound HF(r)H_F(r)HF​(r)

Proved
SpedalieriQHT.eq_19

by iris · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

hoeffding-boundp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-hypothesis-testingquantum-information

Let F≥0F\ge 0F≥0 and rrr be real numbers, and let

HF(r)=sup⁡0≤s<1−rs−ln⁡F1−sH_F(r)=\sup_{0\le s<1}\frac{-r s-\ln F}{1-s}HF​(r)=0≤s<1sup​1−s−rs−lnF​

be the fidelity bound, with ln⁡0=−∞\ln 0=-\inftyln0=−∞. Then

HF(r)={ln⁡1F,r≥ln⁡1F,+∞,r<ln⁡1F,H_F(r)=\begin{cases}\ln\dfrac1F, & r\ge\ln\dfrac1F,\\[2mm] +\infty, & r<\ln\dfrac1F,\end{cases}HF​(r)=⎩⎨⎧​lnF1​,+∞,​r≥lnF1​,r<lnF1​,​

where ln⁡(1/0)=+∞\ln(1/0)=+\inftyln(1/0)=+∞, so that HF(r)=+∞H_F(r)=+\inftyHF​(r)=+∞ for every rrr when F=0F=0F=0.

The closed form shows that the fidelity bound depends only on the comparison between the rate rrr and ln⁡(1/F)\ln(1/F)ln(1/F).

Formalization Note ln⁡(1/F)\ln(1/F)ln(1/F) is written −elog⁡F-\operatorname{elog}F−elogF in EReal.

Differences from the source:

  • generalization: FFF the fidelity of two states, F∈[0,1]F\in[0,1]F∈[0,1] → any real F≥0F\ge 0F≥0; reason: the maximization uses no upper bound on FFF, and fidelities are a special case
  • generalization: r>0r>0r>0 (Eq. (13)) → every real rrr; reason: (18)–(19) hold for every real rrr, and the statement specializes to r>0r>0r>0
  • encoding: ln⁡\lnln, ln⁡(1/F)\ln(1/F)ln(1/F), +∞+\infty+∞ → EReal with ln⁡0=−∞\ln 0=-\inftyln0=−∞ (elog) and ln⁡(1/F)=−elog⁡F\ln(1/F)=-\operatorname{elog}Fln(1/F)=−elogF; reason: Lean convention; same instances, including ln⁡(1/0)=+∞\ln(1/0)=+\inftyln(1/0)=+∞
Preamble
import Mathlib
import Definitions.Def_HayashiHoeffding_elog
import Definitions.Def_SpedalieriQHT_fidelityBound

open HayashiHoeffding (elog)
Formal statement
namespace SpedalieriQHT

/-- **Eq. (19).** For every `F ≥ 0` and every real `r`, the fidelity bound
`H_F(r) = sup_{0≤s<1} (−r s − ln F)/(1 − s)` equals `ln(1/F)` when `r ≥ ln(1/F)` and `+∞`
when `r < ln(1/F)`.

Spedalieri–Braunstein, arXiv:1407.0884v3, Sec. III, Eq. (19), p.3: "After a simple calculation
we find H_F(r) = ln 1/F, for r ≥ ln 1/F ; +∞, for r < ln 1/F".

**Formalization Note.** `ln(1/F)` is `-elog F` in `EReal`, which is `+∞` at `F = 0`; then the
condition `r ≥ +∞` fails and the value is `+∞`, the paper's `ln(1/0) = +∞`. The statement is
made for every `F ≥ 0`, not only for fidelities `F ∈ [0, 1]`. -/
theorem eq_19 (F : ℝ) (hF : 0 ≤ F) (r : ℝ) :
    fidelityBound F r = if -elog F ≤ (r : EReal) then -elog F else ⊤ := by sorry

end SpedalieriQHT
Source
Spedalieri–Braunstein, Asymmetric quantum hypothesis testing with Gaussian states, arXiv:1407.0884v3, Sec. III, Eq. (19), p.3
Human review
  • Endorsed by Shuze Chen · Nov 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 4, 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