Rudnev–Stevens: exponent
ProvedErdos52.rudnev_stevens_exponentFor every with there is a constant such that for every finite set ,
This is a consequence of the Rudnev–Stevens bound (2022), which improved the exponents obtained after the Konyagin–Shkredov breakthrough past .
Formalization Note The restriction keeps the exponent positive, so that the empty set gives the trivial inequality (without it, would give the junk value and make the statement false).
import Mathlib open scoped Pointwise
namespace Erdos52
theorem rudnev_stevens_exponent : ∀ (ε : ℝ), 0 < ε → ε < 1 → ∃ (C : ℝ), 0 < C ∧ ∀ (A : Finset ℤ),
(max (A + A).card (A * A).card : ℝ) ≥
C * (A.card : ℝ) ^ ((4 : ℝ) / 3 + 2 / 1167 - ε) := 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. For every real with and , there exists a real 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 . depends on only.
Edge cases. Since , the exponent exceeds , so for both sides are . Smaller gives a stronger claim.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.