Positivity of a finite nonnegative weighted gap sum
ProvedCollatzWork.YAH.weightedGapSum_poscollatz-work-import
Let be an integer module equipped with a preorder, its associated lawful strict order, and order-compatible addition. Let be any row type, let be a finite list of pairs with and , and let . Assume for every entry of , and that some entry has both and . Then
The sum counts list entries with multiplicity; denotes repeated addition. This is the generic positivity principle used to turn a finite cancellation certificate into an orientation obstruction.
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.
Preamble
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_CollatzWork_YAHFiniteObstructionStatement
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]
Formal statement
theorem CollatzWork.YAH.weightedGapSum_pos {ρ : Type _}
(certificate : List (Nat × ρ)) (gap : ρ → M)
(hnonneg : ∀ entry ∈ certificate, 0 ≤ gap entry.2)
(hstrict : ∃ entry ∈ certificate,
0 < entry.1 ∧ 0 < gap entry.2) :
0 < weightedGapSum certificate gap := by sorry
Source