Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Numerical step 2(6log⁡(96n)+1896n)≤102log⁡n2(6\log(96n)+\tfrac{18}{96n})\le10^2\log n2(6log(96n)+96n18​)≤102logn (corrected: n≥2n\ge2n≥2; false at n=1n=1n=1)

Proved
HellingerSubadd.final_numeric_step

by mikedeng1 · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

hellinger-distanceinformation-theoryinteractive-decision-makingprobability

For every natural number n≥2n\ge2n≥2,

2(6log⁡(96n)+1896n)≤102log⁡(n),2\Bigl(6\log(96n)+\frac{18}{96n}\Bigr)\le10^2\log(n),2(6log(96n)+96n18​)≤102log(n),

with log⁡\loglog the natural logarithm. Together with the rearranged bound it gives the constant 102log⁡n10^2\log n102logn of (97).

Differences from the source:

  • correction: the inequality for the n of Lemma A.13 (no lower bound) → hypothesis 2 ≤ n; reason: false at n = 1: the left side is 2(6 log 96 + 18/96) ≈ 55.15 and the right side 10² log 1 = 0; it holds for all n ≥ 2 (≈ 63.28 ≤ ≈ 69.31 at n = 2, and the difference of the sides increases with n)
Preamble
import Mathlib
Formal statement
namespace HellingerSubadd

/-- **The numerical step `2(6 log(96n) + 18/(96n)) ≤ 10² log(n)` for `n ≥ 2`.**
Foster, Kakade, Qian & Rakhlin, *The Statistical Complexity of Interactive Decision Making*,
arXiv:2112.13487v3, proof of Lemma A.13, p. 74: "To conclude, we note that
2(6 log(96n) + 18/(96n)) ≤ 10² log(n). This establishes (97)."

**Formalization Note.** *Correction*: the paper states the inequality for the `n` of Lemma A.13
with no lower bound. It is false at `n = 1` (the left side is `2(6 log 96 + 18/96) ≈ 55.15`, the
right side `0`); it holds for every `n ≥ 2` (at `n = 2`: `≈ 63.28 ≤ ≈ 69.31`, and the difference
of the two sides is increasing in `n`). `log` is the natural logarithm; `10 ^ 2 = 100`. -/
theorem final_numeric_step (n : ℕ) (hn : 2 ≤ n) :
    2 * (6 * Real.log (96 * (n : ℝ)) + 18 / (96 * (n : ℝ))) ≤ 10 ^ 2 * Real.log n := by sorry

end HellingerSubadd
Source
Foster, Kakade, Qian & Rakhlin, The Statistical Complexity of Interactive Decision Making, arXiv:2112.13487v3, proof of Lemma A.13, p. 74 (last sentence)

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