Orienting the thirteen YAH rows forces a negative weight
ProvedCollatzWork.YAH.yah13_forces_ff_negativeLet be an integer module equipped with a preorder, its associated lawful strict order, and order-compatible addition. Let assign weights to adjacent pairs in the seven-symbol YAH alphabet. For each row of the fixed thirteen-row certificate , define its gap , where is the left-minus-right adjacent-pair count. Suppose every dynamic row of has positive gap and every auxiliary row has nonnegative gap. Then
This is an obstruction for the displayed unlabelled additive potential class. An unbounded-below conclusion requires an additional cofinality hypothesis and is not part of this theorem.
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_weightedGapSum_pos
import Theorems.Thm_CollatzWork_YAH_evalCoefficients_weightedCoefficient
import Theorems.Thm_CollatzWork_YAH_unlabelledCertificate_cancellation
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.yah13_forces_ff_negative (weight : Symbol × Symbol → M)
(horients : ∀ entry ∈ unlabelledCertificate,
if (rule entry.2.ruleName).dynamic = true
then 0 < unlabelledGap weight entry.2
else 0 ≤ unlabelledGap weight entry.2) :
weight (.f, .f) < 0 := by sorry