Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Zero coefficient sum for the 8-row YAH symbol certificate

Proved
CollatzWork.YAH.symbolCertificate_cancellation

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

collatz-work-import

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.Letunder the specified two-state suffix algebra. Letunderthespecifiedtwo−statesuffixalgebra.LetC_sbethefixed8−rowsymbolcertificate.Forlabeledsymbolsbe the fixed 8-row symbol certificate. For labeled symbolsbethefixed8−rowsymbolcertificate.Forlabeledsymbolse\in T,let, let ,let\delta(r,e)beitscountonthelocalleftsideofrowbe its count on the local left side of rowbeitscountonthelocalleftsideofrowr$ minus its count on the local right side. Then

∀e∈T,∑(a,r)∈Csa δ(r,e)=0.\forall e\in T,\qquad\sum_{(a,r)\in C_s}a\,\delta(r,e)=0.∀e∈T,(a,r)∈Cs​∑​aδ(r,e)=0.

The Lean statement expresses this equality as matching coefficient lists over the complete finite feature enumeration. It supplies the cancellation identity for this particular fixed-algebra additive obstruction.

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

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

Formal statement
theorem CollatzWork.YAH.symbolCertificate_cancellation :
    allTokens.map
        (weightedCoefficient symbolCertificate labeledSymbolDelta) =
      allTokens.map (fun _ => 0) := by sorry

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

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