A finite monotone palette cannot decrease along too long a rising path
ProvedCollatzWork.finitePalette_path_obstructioncollatz-work-import
Let , let be nondecreasing on inputs at least , and let . Let satisfy for .
Let have and for . Then it is impossible that
This is a finite pigeonhole obstruction for ranks selected from monotone functions; it is independent of Collatz.
Preamble
import Std import Init.Grind.Ordered.Module
Formal statement
theorem CollatzWork.finitePalette_path_obstruction
(r B : Nat) (V : Nat → Nat) (f : Fin r → Nat → Nat)
(selector : Nat → Fin r) (x : Nat → Nat)
(hf : ∀ i a b, B ≤ a → a ≤ b → f i a ≤ f i b)
(hV : ∀ n, B ≤ n → V n = f (selector n) n)
(hB : B ≤ x 0)
(hx : ∀ k, k < r → x k ≤ x (k + 1))
(hdec : ∀ k, k < r → V (x (k + 1)) < V (x k)) : False := by sorry
Source