AFTD Auto-Formalizing Theoretical Domains

hellinger_rare_source_ratio

def

For a natural number k : ℕ and a real number u : ℝ, F_k(u) is defined as (1 - u^k + (1 - u^(2*k) - (k : ℝ)*(1 - u^2)*u^(2*k - 2))/2) / ((k : ℝ)*(1 - u)).

Statement

noncomputable def hellinger_rare_source_ratio (k : ℕ) (u : ℝ) : ℝ
Defined in
arXiv:2610.21231 (On the Subadditivity of Mutual f-Information)
Verified
13 Nov 2026
Axioms
none listed
Used by 2
  • hellinger_rare_source_supFor a natural number k : ℕ, hellinger_rare_source_sup k is the supremum of the rare-source Hellinger ratio function…
  • hellinger_rare_source_ratio_two_maxFor k = 2, the rare-source Hellinger ratio function hellinger_rare_source_ratio 2 evaluates to (13 + 5 * Real.sqrt 10) / 27 at u_star =…

Read back from the Lean

A definition of a function hellinger_rare_source_ratio taking a natural number k and a real number u, defined as: $$\frac{(1 - u^k) + \frac{1 - u^{2k} - k(1 - u^2)u^{2k-2}}{2}}{k(1 - u)}$$ where $2k - 2$ is computed via natural number subtraction (truncating at 0).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The rare-source Hellinger ratio function F_k(u) for k conditionally independent binary channels -/
noncomputable def hellinger_rare_source_ratio (k : ℕ) (u : ℝ) : ℝ := (1 - u ^ k + (1 - u ^ (2 * k) - (k : ℝ) * (1 - u ^ 2) * u ^ (2 * k - 2)) / 2) / ((k : ℝ) * (1 - u))
See it in the graphDiscuss this resultChallenge it