Cofinal negative multiples obstruct a lower bound on repeated- potentials
ProvedCollatzWork.YAH.noBoundedBelowCanonicalFFPumpWordsLet be an integer module equipped with a preorder, its associated lawful strict order, and order-compatible addition. Let be an adjacent-pair weight on the YAH alphabet. Assume negative multiples are cofinal below: for every and there is with . Assume also that the left-minus-right weighted gap of each dynamic row in the fixed thirteen-row certificate is positive, and that of each auxiliary row is nonnegative. For W_m=\hat{}\,f^{m+1}\,\$$, let P_w(W_m)w$ over consecutive symbol pairs of that word. Then
Thus the actual canonical pumping words have no common lower potential bound under the stated hypotheses. Cofinality is an explicit hypothesis of this implication and is not assumed for arbitrary ordered targets.
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_yah13_forces_ff_negative
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.noBoundedBelowCanonicalFFPumpWords
(weight : Symbol × Symbol → M)
(hcofinal : NegativeMultiplesCofinal (M := M))
(horients : ∀ entry ∈ unlabelledCertificate,
if (rule entry.2.ruleName).dynamic = true
then 0 < unlabelledGap weight entry.2
else 0 ≤ unlabelledGap weight entry.2) :
¬ ∃ bound : M, ∀ multiplicity : Nat,
bound ≤ edgePotential weight (ffPumpWord multiplicity) := by sorry