Adjoining endpoints through 734 preserves admissibility
ProvedErdos302Extension734.lift_admissibleerdos-302extremal-combinatoricsnumber-theorysodelin-erdos302
Call a subset of positive integers admissible if it contains no satisfying , equivalently . Let be admissible and supported in , and let satisfy . Define to agree with at all and to select exactly those of 733 and 734 that are at most . Then
This endpoint extension supplies witnesses for the exact-maximum transfers at 733 and 734.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_Extension734 import Definitions.Def_KernelEndpoints734 import Definitions.Def_Plateau302 open Erdos302Finite
Formal statement
theorem Erdos302Extension734.lift_admissible (S : Nat → Bool) (n : Nat) (hnlo : 732 ≤ n) (hnhi : n ≤ 734) (hS : Admissible 732 S) : Admissible n (liftTo S n) := by sorry
Source