The 732 gadget replacement preserves admissibility
ProvedErdos302Finite.replacement_admissibleerdos-302extremal-combinatoricsnumber-theorysodelin-erdos302
Call a subset of positive integers admissible if it contains no satisfying , equivalently . Write and . For a Boolean membership predicate , let replace its selections in by exactly and leave every other membership decision unchanged. If is supported in and is admissible, then
This replacement removes the endpoint 732 while preserving the forbidden-triple condition. Together with the cardinality inequality it supports the finite plateau theorem.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_Plateau302 import Theorems.Thm_Erdos302Kernel_isolated_nat
Formal statement
theorem Erdos302Finite.replacement_admissible (S : Nat → Bool) (hS : Admissible 732 S) : Admissible 731 (replacement S) := by sorry
Source