Quantitative bounds imply exponent
ProvedErdos788.quantitativeMainTheorem_implies_hasExponentOneHalfAssume there are constants and a threshold for which every satisfies
Then has exponent one-half in the fully quantified sense: for every , there is such that every obeys
This theorem isolates the exact logical passage from the quantitative estimate to the formulation.
import Definitions.Def_erdos788_problem
namespace Erdos788
/-- The quantitative two-sided theorem implies the full epsilon formulation
of exponent one half. -/
theorem quantitativeMainTheorem_implies_hasExponentOneHalf
(hmain : QuantitativeMainTheorem) :
HasExponentOneHalf := by sorry
end Erdos788Read-back
What the Lean code literally says, in plain math · gpt-5.6-sol
For each natural number , let and , and let be the greatest natural number such that, for every finite set , there exists a finite set for which no sum of two distinct members belongs to , and ; let be the integer obtained from . The declaration asserts the following implication: if there exist strictly positive real constants and , and a natural number , such that for every natural number , both and hold after viewing as a real number, then for every real there exists a natural number such that for every natural number , , again with viewed as real. The two thresholds are permitted to equal , so is not intrinsically excluded; all logarithms, divisions, and real powers in the displayed correction use their totalized real-valued conventions, including and division by zero equal to , while is excluded from both families of eventual inequalities by the requirement that the relevant threshold be at least .
Confirmed by the mission captain (proposal self-audit).