LEVEL 10 • 10-DAN NEWMILLENNIUMSFormal Lean 4 Statement (
Formal Lean 4 Statement (NewMillenniums/Collatz.lean)
The global conjecture (collatz_conjecture) remains open for all n > 0, while any individual seed n0 (including your active seed n0 = 27) compiles and verifies in milliseconds via Lean 4’s kernel reflexivity tactic rfl:
/- Mathgod Challenges • Level 10 (10-Dan NewMillenniums): NewMillenniums/Collatz.lean -/
namespace CollatzConjecture
/-- Single step of the standard Collatz map T : ℕ → ℕ -/
def collatzStep (n : Nat) : Nat :=
if n % 2 == 0 then n / 2 else 3 * n + 1
/-- k-fold strict iteration of the Collatz map starting from seed n -/
def collatzIter : Nat → Nat → Nat
| 0, n => n
| k + 1, n =>
match collatzStep n with
| 0 => 0
| m + 1 => collatzIter k (m + 1)
/-- The Collatz Conjecture (Lothar Collatz, 1937 — Level 10 / 10-Dan NewMillennium Unsolved Challenge):
For every positive integer n > 0, iterating the Collatz map eventually reaches 1. -/
theorem collatz_conjecture (n : Nat) (hn : n > 0) :
∃ k : Nat, collatzIter k n = 1 := by {
sorry
}
/-- Live Kernel Verification for Active Seed n₀ = 27 (Peak 9,232 at step 77): -/
theorem collatz_27_peak_9232 :
collatzIter 77 27 = 9232 := by {
rfl
}
theorem collatz_27_reaches_1 :
collatzIter 111 27 = 1 := by {
rfl
}
end CollatzConjecture