Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit oddness for branching-center arithmetic

Definition
CollatzWork_Disproof_BranchingCenter

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

collatz-work-import

For a natural number nnn, define

CenterOdd⁡(n)⟺∃k∈N, n=2k+1.\operatorname{CenterOdd}(n)\quad\Longleftrightarrow\quad\exists k\in\mathbb N,\ n=2k+1.CenterOdd(n)⟺∃k∈N, n=2k+1.

This is the local oddness predicate used by the power-of-two normal-form and branching-center rigidity theorems. The definition introduces the arithmetic predicate only; the source’s proposed graph construction is context for the separately stated equation theorem.

Definition code
import Std
import Init.Grind.Ordered.Module
namespace CollatzWork.Disproof.BranchingCenter

/-!
# Rigidity of the two-center, three-edge branching ansatz

This module checks the arithmetic core of one narrowly scoped attempted
divergence construction.  For accelerated odd Collatz macros

`U_j(x) = (3*x + 1) / 2^j`,

the proposed center graph has edges `A -a-> A`, `A -b-> B`, and
`B -c-> A`.  Eliminating the two rational centers gives

`2^(b+c) + 3*2^b = 2^(a+b) + 3*2^a`.

For positive labels, the theorem below proves that this equation forces
`a = b = c`.  Thus the proposed graph collapses before positive-natural
membership, guard invariance, or escape can be established.  This is only a
route obstruction; it is not a proof or disproof of the Collatz conjecture.
-/

/-- Elementary oddness, stated explicitly so the normal-form argument does
not depend on a library parity API. -/
def CenterOdd (n : Nat) : Prop := ∃ t : Nat, n = 2 * t + 1















end CollatzWork.Disproof.BranchingCenter
Source
https://github.com/Sodelin/Collatz-Conjecture-Work/blob/026aa4ad4be6453a005ab950b160a9f2204c5271/lean/CollatzWork/Disproof/BranchingCenter.lean#L1-L119

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