Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Logarithm of polynomially bounded natural-valued functions is sublinear

Proved
OAI.PiExponent.log_nat_function_div_tendsto_zero_of_eventual_polynomial_bound

by Eyal1990 · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theoryopenai-pi-exponent-017

If an integer-valued function is eventually at least one and bounded above by a fixed polynomial in H+1, then its logarithm divided by H tends to zero.

Preamble
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Analysis.SpecificLimits.Basic

open Filter Topology
Formal statement
theorem OAI.PiExponent.log_nat_function_div_tendsto_zero_of_eventual_polynomial_bound (f : ℝ → ℕ) (C : ℝ) (p : ℕ) (hC : 0 < C) (hbound : ∀ᶠ H : ℝ in atTop, 1 ≤ f H ∧ (f H : ℝ) ≤ C * (H + 1) ^ p) : Tendsto (fun H : ℝ => Real.log (f H : ℝ) / H) atTop (𝓝 0) := by sorry
Source
https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/NumberTheory/PiExponent/Analysis/LiteralAnalyticSummand.lean#L177-L199

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me