Erdős Problem 788 asks how large a set can always be retained when prescribed distinct pair-sums are forbidden. This mission formalizes the repository’s strengthened version of Theorem 1.1: an explicit lower bound valid for every , an eventual quantitative upper bound, the conclusion , and the exact affirmative answer to the original upper-bound question.
namespace Erdos788 /-- Erdős Problem 788, preserving both the strengthened paper statement and the exact quantifier form of the original upper-bound question. -/ theorem erdos788 : MainTheorem := by sorry end Erdos788
Let be the exact integer-valued extremal function in Erdős Problem 788. The complete strengthened theorem asserts all of the following:
there exist and such that for every ,
and for every , all sufficiently large satisfy
The statement additionally includes, as its own fully quantified conjunct, the affirmative answer to the original Erdős Problems upper-bound question:
This is the repository’s strengthened formal version of the public manuscript’s Theorem 1.1: it makes the lower constant explicit and proves that lower bound for every .
No open leaves. Every sub-goal is proved or awaiting decomposition.