Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The fixed two-state suffix algebra satisfies every YAH rule equation

Proved
CollatzWork.YAH.twoState_rule_equations

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

collatz-work-import

Let R\mathcal RR be the list of all eleven YAH rules and let AsA_sAs​ denote the specified Boolean unary map of a symbol sss. For a word s1⋯sks_1\cdots s_ks1​⋯sk​, define E(s1⋯sk,b)=As1(⋯Ask(b)⋯ )E(s_1\cdots s_k,b)=A_{s_1}(\cdots A_{s_k}(b)\cdots)E(s1​⋯sk​,b)=As1​​(⋯Ask​​(b)⋯), with E(∅,b)=bE(\varnothing,b)=bE(∅,b)=b. Then

∀r∈R  ∀b∈{false,true},E(lhs⁡(r),b)=E(rhs⁡(r),b).\forall r\in\mathcal R\;\forall b\in\{\mathrm{false},\mathrm{true}\},\qquad E(\operatorname{lhs}(r),b)=E(\operatorname{rhs}(r),b).∀r∈R∀b∈{false,true},E(lhs(r),b)=E(rhs(r),b).

This verifies the rule equations for the one fixed two-state algebra used for suffix labeling. It does not assert that any induced order proves termination.

Preamble
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_CollatzWork_YAHFiniteObstructionStatement

open Lean.Grind
open Lean.Grind.AddCommMonoid
open Lean.Grind.IntModule

Formal statement
theorem CollatzWork.YAH.twoState_rule_equations :
    ∀ name ∈ allRuleNames, ∀ tail : Bool,
      evalWord (rule name).lhs tail = evalWord (rule name).rhs tail := by sorry

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

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