The 732 gadget replacement does not decrease size
ProvedErdos302Finite.replacement_cardinalerdos-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 admissible and supported in , then
This is the quantitative half of the replacement argument. The source cardinal function counts membership on the duplicate-free domain consisting of the gadget and its complement in 1 through 732.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_Plateau302
Formal statement
theorem Erdos302Finite.replacement_cardinal (S : Nat → Bool) (hS : Admissible 732 S) : cardinal S ≤ cardinal (replacement S) := by sorry
Source