Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

No universal adjacent-edge additive orientation in the fixed YAH algebra

Proved
CollatzWork.YAH.noTwoStateEdgeAdditiveOrder

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

collatz-work-import

Let MMM be an integer module equipped with a preorder, its associated lawful strict order, and order-compatible addition. The alphabet is the fixed seven-symbol YAH alphabet \Sigma=\{f,t,0,1,2,\hat{},\};labeledtokensarepairsin; labeled tokens are pairs in ;labeledtokensarepairsinT=\Sigma\times{\mathrm{false},\mathrm{true}}underthespecifiedtwo−statesuffixalgebra.Forunder the specified two-state suffix algebra. Forunderthespecifiedtwo−statesuffixalgebra.Forw:T^2\to M,letthegapbe, let the gap be ,letthegapbeg_w(r)=\sum_{e\in T^2}\delta(r,e)w(e),usinglocalleft−minus−rightadjacent−edgecounts.Let, using local left-minus-right adjacent-edge counts. Let ,usinglocalleft−minus−rightadjacent−edgecounts.Let\mathcal L$ be the set of locally legal labeled instances: the two rule-side evaluations agree and the stored immediate contexts satisfy the fixed suffix-label conditions. Then

¬[∀r∈L,{gw(r)>0,r dynamic,gw(r)≥0,r auxiliary.].\neg\left[\forall r\in\mathcal L,\quad\begin{cases}g_w(r)>0,&r\text{ dynamic},\\g_w(r)\ge0,&r\text{ auxiliary}.\end{cases}\right].¬[∀r∈L,{gw​(r)>0,gw​(r)≥0,​r dynamic,r auxiliary.​].

Here the dynamic rules are Df,DtD_f,D_tDf​,Dt​. This is the public obstruction for the named additive weight class with this exact two-state algebra. It makes no claim about arbitrary labelings or Collatz termination.

Formalization Note. The assumptions are Lean’s IntModule M, Std.IsPreorder M, Std.LawfulOrderLT M, and OrderedAdd M; no total-order or Archimedean assumption is imposed unless stated.

Preamble
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_CollatzWork_YAHFiniteObstruction
import Definitions.Def_CollatzWork_YAHFiniteObstructionStatement
import Theorems.Thm_CollatzWork_YAH_noTwoStateEdgeCertificateOrientation

universe u

open Lean.Grind
open Lean.Grind.AddCommMonoid
open Lean.Grind.IntModule
variable {M : Type u} [LE M] [LT M] [Std.IsPreorder M]
  [Std.LawfulOrderLT M] [IntModule M] [OrderedAdd M]

Formal statement
theorem CollatzWork.YAH.noTwoStateEdgeAdditiveOrder (weight : Token × Token → M) :
    ¬ (∀ row : LabeledInstance, validLabeledInstance row = true →
      if (rule row.ruleName).dynamic = true
      then 0 < edgeGap weight row
      else 0 ≤ edgeGap weight row) := by sorry

Source
https://github.com/Sodelin/Collatz-Conjecture-Work/blob/026aa4ad4be6453a005ab950b160a9f2204c5271/lean/CollatzWork/YAHFiniteObstruction.lean#L698-L709

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