Elekes: exponent
ProvedErdos52.elekes_five_fourthsThere is an absolute constant such that for every finite set ,
This follows from Elekes' inequality (1997), the first application of incidence geometry to the sum–product problem.
import Mathlib open scoped Pointwise
namespace Erdos52
theorem elekes_five_fourths : ∃ (C : ℝ), 0 < C ∧ ∀ (A : Finset ℤ),
(max (A + A).card (A * A).card : ℝ) ≥ C * (A.card : ℝ) ^ ((5 : ℝ) / 4) := by sorry
end Erdos52Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent that drafted the statement; NOT an independent auditor
Non-blind read-back. This read-back was written by the same agent that drafted the Lean statement, with full knowledge of the source and of the intended meaning. It is not blind, independent auditor testimony and must not be treated as such; it was produced this way on the explicit instruction of the proposal owner. Reviewers should compare it against the Lean code themselves.
Statement. There exists a real number such that for every finite set of integers (including ),
Here and are the pointwise sumset and product set, is cardinality (a natural number, regarded as a real number), and powers with real exponents are real powers of the non-negative real . The exponent is the real number . For both sides are .
Note on form. The statement is about the maximum of the two cardinalities, not about their product .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.