Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A fixed coprime denominator cannot recur forever

Proved
CollatzWork.noInfinitePositiveRecurrence

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

collatz-work-import

Let a,b∈Na,b\in\mathbb Na,b∈N satisfy gcd⁡(b,a)=1\gcd(b,a)=1gcd(b,a)=1 and b>1b>1b>1, and let y:N→Ny:\mathbb N\to\mathbb Ny:N→N satisfy y0>0y_0>0y0​>0. Then

¬(∀i∈N, byi+1=ayi).\neg\bigl(\forall i\in\mathbb N,\ b y_{i+1}=a y_i\bigr).¬(∀i∈N, byi+1​=ayi​).

This excludes an infinite sequence obeying this single recurrence, rather than arbitrary sequences of different affine blocks.

Preamble
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_CollatzWork_AffineRepetitionStatement
import Theorems.Thm_CollatzWork_finiteRepetitionBound



Formal statement
theorem CollatzWork.noInfinitePositiveRecurrence : NoInfinitePositiveRecurrenceStatement := by sorry

Source
https://github.com/Sodelin/Collatz-Conjecture-Work/blob/026aa4ad4be6453a005ab950b160a9f2204c5271/lean/CollatzWork/AffineRepetition.lean#L32-L36

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