Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reciprocal-triple admissibility and the 732 gadget interface

Definition
Plateau302

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

erdos-302finite-setsnumber-theorysodelin-erdos302

Call a subset of positive integers admissible if it contains no a<b<ca<b<ca<b<c satisfying a(b+c)=bca(b+c)=bca(b+c)=bc, equivalently 1/a=1/b+1/c1/a=1/b+1/c1/a=1/b+1/c. Write G={122,183,244,366,732}G=\{122,183,244,366,732\}G={122,183,244,366,732} and B={122,183,244}B=\{122,183,244\}B={122,183,244}. For a Boolean membership predicate S:N→{false,true}S:\mathbb N\to\{\mathrm{false},\mathrm{true}\}S:N→{false,true}, let R(S)R(S)R(S) replace its selections in GGG by exactly BBB and leave every other membership decision unchanged. The interface defines the finite counting function c(S)c(S)c(S) over 1 through 732, the exact-maximum predicate M(n,k)M(n,k)M(n,k) (an attaining admissible set of count kkk together with the upper bound for all such sets), and rational admissibility using exact unit fractions.

G={122,183,244,366,732},R(S)=(S∖G)∪{122,183,244}.G=\{122,183,244,366,732\},\qquad R(S)=(S\setminus G)\cup\{122,183,244\}.G={122,183,244,366,732},R(S)=(S∖G)∪{122,183,244}.

These definitions support the finite plateau and endpoint-transfer theorems. The count is over the fixed domain1 through 732; numerical baseline statements remain hypotheses in downstream theorems.

Definition code
import Std
import Init.Grind.Ordered.Module
/-!
Finite plateau for the reciprocal-triple-free extremal function in Erdős problem 302.

The main theorem `plateau_732` says that the attainable cardinality thresholds for
subsets of {1,...,732} and {1,...,731} are identical. It does not assume a numerical
value for either extremal function. `exact_maximum_transfer` explicitly assumes
a numerical baseline at 731 and transfers it to 732.

The OEIS A390395 b-file, accessed 2026-09-07, ends with 731 606. Combining that
external baseline with this transition gives 732 606. The baseline is not
formalized in this file. This does not solve the asymptotic Erdős conjecture.

The finite isolation proof now uses exact quotient tables evaluated by the Lean
kernel. The earlier native bv_decide version remains in the publication history.
The current theorem has only ordinary Lean logical axioms; dependencies are printed below.
-/

namespace Erdos302Finite

-- Exact bridge to the original unit-fraction equation, using Lean core rationals.


def inGNat (x : Nat) : Bool :=
 x == 122 || x == 183 || x == 244 || x == 366 || x == 732



def gadget : List Nat := [122, 183, 244, 366, 732]
def outside : List Nat := (List.range 733).filter (fun x => 0 < x && !inGNat x)

def cardinal (S : Nat → Bool) : Nat :=
 (outside.filter S).length + (gadget.filter S).length

def Admissible (n : Nat) (S : Nat → Bool) : Prop :=
 (∀ x, S x → 0 < x ∧ x ≤ n) ∧
 (∀ a b c, a < b → b < c → S a → S b → S c → a * (b + c) ≠ b * c)

def replacement (S : Nat → Bool) (x : Nat) : Bool :=
 if inGNat x then x == 122 || x == 183 || x == 244 else S x















-- This domain is a permutation of 1,...,732, so `cardinal` is ordinary set cardinality.






def ExactMaximum (n k : Nat) : Prop :=
 (∃ S : Nat → Bool, Admissible n S ∧ cardinal S = k) ∧
 (∀ S : Nat → Bool, Admissible n S → cardinal S ≤ k)

-- The numerical 731 baseline is an explicit premise, not an axiom or an unproved assertion.








-- The same admissibility condition stated with exact rational unit fractions.
def RatAdmissible (n : Nat) (S : Nat → Bool) : Prop :=
 (∀ x, S x → 0 < x ∧ x ≤ n) ∧
 (∀ a b c, a < b → b < c → S a → S b → S c →
   (1 : Rat) / (↑a : Rat) ≠ (1 : Rat) / (↑b : Rat) + (1 : Rat) / (↑c : Rat))









end Erdos302Finite
Source
https://github.com/Sodelin/oldest-conjecture-/blob/48bcf1429395b980198207bf6a876994fab80789/Plateau302.lean#L1-L213

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