Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Convergence is equivalent to universal smaller coalescence

Proved
CollatzWork.smallerCoalescenceCriterion

by Sodelin · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

collatz-work-import

Let T:N→NT:\mathbb N\to\mathbb NT:N→N be the shortcut Collatz map: T(n)=n/2T(n)=n/2T(n)=n/2 for even nnn and T(n)=(3n+1)/2T(n)=(3n+1)/2T(n)=(3n+1)/2 for odd nnn. Write TkT^kTk for its kkk-fold iterate, with T0(n)=nT^0(n)=nT0(n)=n. Write C(n)\mathcal C(n)C(n) for the assertion that Tj(n)=1T^j(n)=1Tj(n)=1 for some j∈Nj\in\mathbb Nj∈N.

Let S\mathsf SS assert that every n>1n>1n>1 has a positive m<nm<nm<n and r,s∈Nr,s\in\mathbb Nr,s∈N with Tr(n)=Ts(m)T^r(n)=T^s(m)Tr(n)=Ts(m). Then

(∀n>0, C(n))  ⟺  S.\bigl(\forall n>0,\ \mathcal C(n)\bigr)\iff\mathsf S.(∀n>0, C(n))⟺S.

This exact equivalence identifies a possible proof obligation; it does not discharge that obligation.

Preamble
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_CollatzWork_ConvergenceStatement
import Theorems.Thm_CollatzWork_allPositiveConverge_of_smallerCoalescence



Formal statement
theorem CollatzWork.smallerCoalescenceCriterion : SmallerCoalescenceCriterionStatement := by sorry

Source
https://github.com/Sodelin/Collatz-Conjecture-Work/blob/026aa4ad4be6453a005ab950b160a9f2204c5271/lean/CollatzWork/Convergence.lean#L75-L77

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