Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exclusion of an infinitely repeated affine block

Proved
BlindCollatz.RepetitionBound.no_infinite_expanding_affine_blocks

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

collatz-work-import

Let b,d,c∈Nb,d,c\in\mathbb Nb,d,c∈N with gcd⁡(b,b+d)=1\gcd(b,b+d)=1gcd(b,b+d)=1 and b>1b>1b>1, and let x:N→Nx:\mathbb N\to\mathbb Nx:N→N satisfy dx0+c>0d x_0+c>0dx0​+c>0. Then

¬(∀i∈N, bxi+1=(b+d)xi+c).\neg\bigl(\forall i\in\mathbb N,\ b x_{i+1}=(b+d)x_i+c\bigr).¬(∀i∈N, bxi+1​=(b+d)xi​+c).

Only the displayed fixed block is excluded; this does not exclude every nonconvergent Collatz itinerary.

Preamble
import Std
import Init.Grind.Ordered.Module
import Theorems.Thm_BlindCollatz_RepetitionBound_telescope



Formal statement
theorem BlindCollatz.RepetitionBound.no_infinite_expanding_affine_blocks (b d c : Nat)
    (hcop : b.Coprime (b + d)) (hb : 1 < b) (x : Nat → Nat)
    (hpos : 0 < d * x 0 + c) :
    ¬ (∀ i, b * x (i + 1) = (b + d) * x i + c) := by sorry

Source
https://github.com/Sodelin/Collatz-Conjecture-Work/blob/026aa4ad4be6453a005ab950b160a9f2204c5271/research/blind-2026-09-05/RepetitionBound.lean#L78-L87

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