Counting, trimming and lifting admissible sets through 734
DefinitionExtension734erdos-302finite-setsnumber-theorysodelin-erdos302
Let and let be the base count over 1 through 732. The extended count is
The interface also defines the domain list 1 through 734, trimming to732, lifting by the endpoints733 and 734 up to a supplied bound , adding or erasing734, and an exact-maximum predicate using this extended count.
These operations support finite lower- and upper-bound transfers. The exact-maximum predicate combines attainment and a universal upper bound; it does not supply any unproved numerical baseline.
Definition code
import Std import Init.Grind.Ordered.Module import Definitions.Def_Plateau302 /-! Exact maximum transfers through 734. The numerical corollaries retain an explicit external baseline. -/ namespace Erdos302Extension734 open Erdos302Finite def fullCardinal (S : Nat → Bool) : Nat := cardinal S + (S 733).toNat + (S 734).toNat def fullDomain : List Nat := (outside ++ gadget) ++ [733,734] def trim (S : Nat → Bool) (x : Nat) : Bool := S x && decide (x ≤ 732) def liftTo (S : Nat → Bool) (n x : Nat) : Bool := if x ≤ 732 then S x else (x == 733 || x == 734) && decide (x ≤ n) def FullExactMaximum (n k : Nat) : Prop := (∃ S : Nat → Bool, Admissible n S ∧ fullCardinal S = k) ∧ (∀ S : Nat → Bool, Admissible n S → fullCardinal S ≤ k) -- These numerical conclusions have an explicit external 731 baseline premise. def add734 (S : Nat → Bool) (x : Nat) : Bool := if x = 734 then true else S x def erase734 (S : Nat → Bool) (x : Nat) : Bool := if x = 734 then false else S x end Erdos302Extension734
Source