Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A finite monotone palette cannot decrease along too long a rising path

Proved
CollatzWork.finitePalette_path_obstruction

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

collatz-work-import

Let r,B∈Nr,B\in\mathbb Nr,B∈N, let f0,…,fr−1:N→Nf_0,\ldots,f_{r-1}:\mathbb N\to\mathbb Nf0​,…,fr−1​:N→N be nondecreasing on inputs at least BBB, and let σ:N→{0,…,r−1}\sigma:\mathbb N\to\{0,\ldots,r-1\}σ:N→{0,…,r−1}. Let V:N→NV:\mathbb N\to\mathbb NV:N→N satisfy V(n)=fσ(n)(n)V(n)=f_{\sigma(n)}(n)V(n)=fσ(n)​(n) for n≥Bn\ge Bn≥B.

Let x:N→Nx:\mathbb N\to\mathbb Nx:N→N have x0≥Bx_0\ge Bx0​≥B and xk≤xk+1x_k\le x_{k+1}xk​≤xk+1​ for k<rk<rk<r. Then it is impossible that

∀k<r,V(xk+1)<V(xk).\forall k<r,\quad V(x_{k+1})<V(x_k).∀k<r,V(xk+1​)<V(xk​).

This is a finite pigeonhole obstruction for ranks selected from monotone functions; it is independent of Collatz.

Preamble
import Std
import Init.Grind.Ordered.Module



Formal statement
theorem CollatzWork.finitePalette_path_obstruction
    (r B : Nat) (V : Nat → Nat) (f : Fin r → Nat → Nat)
    (selector : Nat → Fin r) (x : Nat → Nat)
    (hf : ∀ i a b, B ≤ a → a ≤ b → f i a ≤ f i b)
    (hV : ∀ n, B ≤ n → V n = f (selector n) n)
    (hB : B ≤ x 0)
    (hx : ∀ k, k < r → x k ≤ x (k + 1))
    (hdec : ∀ k, k < r → V (x (k + 1)) < V (x k)) : False := by sorry

Source
https://github.com/Sodelin/Collatz-Conjecture-Work/blob/026aa4ad4be6453a005ab950b160a9f2204c5271/lean/CollatzWork/FinitePaletteObstruction.lean#L38-L74

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