Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Counting, trimming and lifting admissible sets through 734

Definition
Extension734

by Sodelin · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

erdos-302finite-setsnumber-theorysodelin-erdos302

Let S:N→{false,true}S:\mathbb N\to\{\mathrm{false},\mathrm{true}\}S:N→{false,true} and let c(S)c(S)c(S) be the base count over 1 through 732. The extended count is

c734(S)=c(S)+1S(733)+1S(734).c_{734}(S)=c(S)+\mathbf{1}_{S(733)}+\mathbf{1}_{S(734)}.c734​(S)=c(S)+1S(733)​+1S(734)​.

The interface also defines the domain list 1 through 734, trimming to732, lifting by the endpoints733 and 734 up to a supplied bound nnn, 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
https://github.com/Sodelin/oldest-conjecture-/blob/48bcf1429395b980198207bf6a876994fab80789/Extension734.lean#L1-L234

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me