No universal adjacent-edge additive orientation in the fixed YAH algebra
ProvedCollatzWork.YAH.noTwoStateEdgeAdditiveOrderLet 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{},\}T=\Sigma\times{\mathrm{false},\mathrm{true}}w:T^2\to Mg_w(r)=\sum_{e\in T^2}\delta(r,e)w(e)\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
Here the dynamic rules are . 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.
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]
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