Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.8, classical Hellinger identities (34)–(37)

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.classicalHellinger

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

prove2quantum

Let p,qp,qp,q be finite probability laws with identical support. Define Qs=∑ipi1−sqisQ_s=\sum_i p_i^{1-s}q_i^sQs​=∑i​pi1−s​qis​, ps(i)=pi1−sqis/Qsp_s(i)=p_i^{1-s}q_i^s/Q_sps​(i)=pi1−s​qis​/Qs​, and L(s)=log⁡QsL(s)=\log Q_sL(s)=logQs​. Then psp_sps​ is a probability law and, for s∈[0,1]s\in[0,1]s∈[0,1],

H(ps∥p)=sL′(s)−L(s),H(ps∥q)=−(1−s)L′(s)−L(s).H(p_s\|p)=sL'(s)-L(s),\qquad H(p_s\|q)=-(1-s)L'(s)-L(s).H(ps​∥p)=sL′(s)−L(s),H(ps​∥q)=−(1−s)L′(s)−L(s).

A parameter minimizes QsQ_sQs​ exactly when these two relative entropies coincide. A minimizer exists and satisfies H(ps∥p)=H(ps∥q)=ξ(p,q)H(p_s\|p)=H(p_s\|q)=\xi(p,q)H(ps​∥p)=H(ps​∥q)=ξ(p,q). It is unique when p≠qp\ne qp=q; for equal laws every parameter minimizes. Logs concern the common positive support; ambient zero coordinates are allowed.

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.19: §4.8, classical Hellinger identities (34)–(37). Source correction: PDF p.19 claims unconditional uniqueness; uniqueness is restricted to p != q, since equal laws have every s as a minimizer. Independent moderation required. -/
theorem classicalHellinger (p q : I → ℝ) (hp : IsLaw p) (hq : IsLaw q) (heq : SamePositiveSupport p q) :
    (∀ s ∈ Set.Icc (0 : ℝ) 1,
      IsLaw (hellingerArc p q s) ∧
      kl (hellingerArc p q s) p =
        ((s*logDerivative p q s-Real.log (classicalOverlap p q s) : ℝ) : EReal) ∧
      kl (hellingerArc p q s) q =
        ((-(1-s)*logDerivative p q s-Real.log (classicalOverlap p q s) : ℝ) : EReal) ∧
      ((∀ t ∈ Set.Icc (0 : ℝ) 1, classicalOverlap p q s ≤ classicalOverlap p q t) ↔
        kl (hellingerArc p q s) p = kl (hellingerArc p q s) q)) ∧
    (∃ s ∈ Set.Icc (0 : ℝ) 1,
      (∀ t ∈ Set.Icc (0 : ℝ) 1, classicalOverlap p q s ≤ classicalOverlap p q t) ∧
      kl (hellingerArc p q s) p = classicalDistance p q ∧
      kl (hellingerArc p q s) q = classicalDistance p q) ∧
    (p ≠ q → ∃! s : ℝ, s ∈ Set.Icc (0 : ℝ) 1 ∧
      kl (hellingerArc p q s) p = kl (hellingerArc p q s) q) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 19, §4.8, classical Hellinger identities (34)–(37)
Read-back

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

For every finite index type III with decidable equality, let p,q:I→Rp,q:I\to\mathbb Rp,q:I→R satisfy pi,qi≥0p_i,q_i\ge0pi​,qi​≥0, ∑ipi=∑iqi=1\sum_i p_i=\sum_i q_i=1∑i​pi​=∑i​qi​=1, and pi>0p_i>0pi​>0 if and only if qi>0q_i>0qi​>0 for every iii. Define

Z(s)=∑ipi1−sqis,hs(i)=pi1−sqisZ(s),ℓ′(s)=ddslog⁡Z(s),d(p,q)=−L ⁣(inf⁡s∈[0,1]Z(s)),Z(s)=\sum_i p_i^{1-s}q_i^s,\qquad h_s(i)=\frac{p_i^{1-s}q_i^s}{Z(s)},\qquad \ell'(s)=\frac{d}{ds}\log Z(s),\qquad d(p,q)=-L\!\left(\inf_{s\in[0,1]}Z(s)\right),Z(s)=i∑​pi1−s​qis​,hs​(i)=Z(s)pi1−s​qis​​,ℓ′(s)=dsd​logZ(s),d(p,q)=−L(s∈[0,1]inf​Z(s)),

where real powers and division use their total conventions, L(x)=log⁡xL(x)=\log xL(x)=logx for x>0x>0x>0 and L(x)=−∞L(x)=-\inftyL(x)=−∞ otherwise, and the derivative is the ordinary derivative of the function on R\mathbb RR, including when evaluated at 000 or 111. For real functions a,ba,ba,b on the same index type, write K(a∥b)=+∞K(a\Vert b)=+\inftyK(a∥b)=+∞ if some ai>0a_i>0ai​>0 has bi≤0b_i\le0bi​≤0, and otherwise write K(a∥b)=∑i:ai>0ailog⁡(ai/bi)K(a\Vert b)=\sum_{i:a_i>0}a_i\log(a_i/b_i)K(a∥b)=∑i:ai​>0​ai​log(ai​/bi​), viewed as an extended real number. For every s∈[0,1]s\in[0,1]s∈[0,1], hsh_shs​ is nonnegative and sums to 111, and

K(hs∥p)=sℓ′(s)−log⁡Z(s),K(hs∥q)=−(1−s)ℓ′(s)−log⁡Z(s);K(h_s\Vert p)=s\ell'(s)-\log Z(s),\qquad K(h_s\Vert q)=-(1-s)\ell'(s)-\log Z(s);K(hs​∥p)=sℓ′(s)−logZ(s),K(hs​∥q)=−(1−s)ℓ′(s)−logZ(s);

moreover, Z(s)≤Z(t)Z(s)\le Z(t)Z(s)≤Z(t) for every t∈[0,1]t\in[0,1]t∈[0,1] if and only if K(hs∥p)=K(hs∥q)K(h_s\Vert p)=K(h_s\Vert q)K(hs​∥p)=K(hs​∥q). There exists s∈[0,1]s\in[0,1]s∈[0,1] minimizing ZZZ on this interval for which both these divergences equal d(p,q)d(p,q)d(p,q). If p≠qp\ne qp=q, there is exactly one real sss satisfying both s∈[0,1]s\in[0,1]s∈[0,1] and K(hs∥p)=K(hs∥q)K(h_s\Vert p)=K(h_s\Vert q)K(hs​∥p)=K(hs​∥q). Common zero coordinates are allowed, but disjoint positive supports and an empty III are excluded by the hypotheses; no uniqueness is asserted when p=qp=qp=q.

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