Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The time of a first coefficient contraction

Proved
CollatzWork.firstContractionTime

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. Let qk(n)q_k(n)qk​(n) count the odd inputs among the first kkk shortcut steps, and let R0(n)=0R_0(n)=0R0​(n)=0; recursively Rk+1(n)=Rk(n)R_{k+1}(n)=R_k(n)Rk+1​(n)=Rk​(n) for an even input Tk(n)T^k(n)Tk(n) and Rk+1(n)=3Rk(n)+2kR_{k+1}(n)=3R_k(n)+2^kRk+1​(n)=3Rk​(n)+2k for an odd input. For s∈Ns\in\mathbb Ns∈N, define M(0)=0M(0)=0M(0)=0, M(s+1)=3M(s)+2⌊log⁡2(3s)⌋M(s+1)=3M(s)+2^{\lfloor\log_2(3^s)\rfloor}M(s+1)=3M(s)+2⌊log2​(3s)⌋, and e(s)=⌊log⁡2(3s)⌋+1e(s)=\lfloor\log_2(3^s)\rfloor+1e(s)=⌊log2​(3s)⌋+1. A first coefficient contraction at time kkk means k>0k>0k>0, 3qk(n)<2k3^{q_k(n)}<2^k3qk​(n)<2k, and 2j≤3qj(n)2^j\le3^{q_j(n)}2j≤3qj​(n) for every j<kj<kj<k. Its existence is a hypothesis.

If n,k∈Nn,k\in\mathbb Nn,k∈N and kkk is a first coefficient contraction for nnn, then

k=e(qk(n)).k=e(q_k(n)).k=e(qk​(n)).

This determines the crossing time from its odd count, conditional on that first crossing existing.

Preamble
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_CollatzWork_ConvergenceStatement
import Definitions.Def_CollatzWork_FirstContractionStatement
import Definitions.Def_CollatzWork_QuarterGapStatement



Formal statement
theorem CollatzWork.firstContractionTime : FirstContractionTimeStatement := by sorry

Source
https://github.com/Sodelin/Collatz-Conjecture-Work/blob/026aa4ad4be6453a005ab950b160a9f2204c5271/lean/CollatzWork/FirstContraction.lean#L6-L22

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