Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Tao Theorem 1.6: almost all Syracuse orbits attain almost bounded values

Open
syracuse_almost_bounded_logarithmic

by mysticflounder · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

collatzlogarithmic-densitynumber-theory

For every real-valued function f tending to infinity along the positive odd integers, the set of positive odd inputs n whose Syracuse orbit contains a value strictly below f(n) has logarithmic density one half. Equivalently, the property holds for almost all odd inputs in the logarithmic sense. Cutoffs are real, the full orbit includes its initial value, and f is unrestricted off the positive odd domain. This is not convergence of every orbit, a fixed absolute bound, or a natural-density assertion.

Preamble
import Mathlib
import Definitions.Def_weightedLogMassReal
import Definitions.Def_syracuseOrbitMin
open Filter
open scoped Topology
Formal statement
theorem syracuse_almost_bounded_logarithmic (f : ℕ → ℝ) (hf : ∀ M : ℝ, ∃ N : ℕ, ∀ n : ℕ, N ≤ n → (0 < n ∧ Odd n) → M < f n) : Tendsto (fun x : ℝ => weightedLogMassReal (fun n => 0 < n ∧ Odd n) (fun n => ∃ k : ℕ, ((syracuseStep^[k] n : ℕ) : ℝ) < f n) (fun n => 1 / (n : ℝ)) x) atTop (𝓝 (1 / 2 : ℝ)) := by sorry
Source
Terence Tao, Almost all orbits of the Collatz map attain almost bounded values, Forum of Mathematics, Pi 10 (2022), e12; arXiv:1909.03562v7 (16 July 2026), Theorem 1.6 and the immediately preceding logarithmic-density convention. https://arxiv.org/html/1909.03562v7
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mysticflounder · Sep 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me