Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Minimum of the forward Syracuse orbit

Definition
syracuseOrbitMin

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

collatznumber-theory

The least value in the full forward Syracuse orbit of n, including the initial value at iterate zero. The orbit is indexed by all natural iteration counts, not a finite cutoff. The natural-number infimum of this nonempty set is attained. The definition is total on natural inputs; Tao's applications restrict the initial input to positive odd integers.

Definition code
/-
Copyright (c) 2026 Adam McKenna. All rights reserved.
Released under GPL-3.0-or-later as described in the file LICENSE.
Authors: Adam McKenna
-/
import Mathlib.Logic.Function.Iterate
import Mathlib.Order.Lattice.Nat
import Definitions.Def_syracuseStep

noncomputable def syracuseOrbitMin (n : ℕ) : ℕ :=
  sInf (Set.range (fun k : ℕ => syracuseStep^[k] n))
Source
Terence Tao, Almost all orbits of the Collatz map attain almost bounded values, arXiv:1909.03562v7, Section 1, Syracuse orbit minimum preceding Theorem 1.6; used in Theorem 3.1. https://arxiv.org/html/1909.03562v7

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