Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Guarded residue-20 ancestor interfaces

Definition
CollatzWork_ResidueAncestorStatement

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.

For a natural root r, the common conclusion is

∃m,b∈N,0<m<r,m≡20(mod27),Tb(m)=r.\exists m,b\in\mathbb N,\quad 0<m<r,\quad m\equiv20\pmod{27},\quad T^b(m)=r.∃m,b∈N,0<m<r,m≡20(mod27),Tb(m)=r.

One interface assumes a factorization 4r+1=3^v u with v at least 13 and positive u not divisible by 3. The second assumes only divisibility by the thirteenth power of 3. Both retain a guard on the root, and neither asserts universal convergence.

Definition code
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_CollatzWork_ConvergenceStatement
import Definitions.Def_CollatzWork_InverseWordBoundaryStatement
namespace CollatzWork

/-- Complete uniform refined residue-20 ancestor theorem in factorized form.
The exponent and positive 3-adic unit are unbounded. The factorization guard
implies that the original root is also 20 modulo 27. The conclusion gives
an actual forward orbit from a strictly smaller positive root in that class.
This statement does not assert that all roots satisfy the valuation guard. -/
def ResidueAncestorStatement : Prop :=
  ∀ v u r : Nat, 13 ≤ v → 0 < u → u % 3 ≠ 0 →
    3 ^ v * u = 4 * r + 1 →
    ∃ m b : Nat, 0 < m ∧ m < r ∧ m % 27 = 20 ∧ shortcutIter b m = r

/-- Direct integer-divisibility form of the complete valuation-at-least-13
theorem. No separate existence or maximality assumption for a 3-adic
factorization is required at this public boundary. -/
def ResidueAncestorDivisibilityStatement : Prop :=
  ∀ r : Nat, 3 ^ 13 ∣ 4 * r + 1 →
    ∃ m b : Nat, 0 < m ∧ m < r ∧ m % 27 = 20 ∧ shortcutIter b m = r

end CollatzWork
Source
https://github.com/Sodelin/Collatz-Conjecture-Work/blob/026aa4ad4be6453a005ab950b160a9f2204c5271/lean/CollatzWork/ResidueAncestorStatement.lean#L1-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