Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Solymosi: exponent 4/34/34/3 up to logarithms

Proved
Erdos52.solymosi_four_thirds

by LG · Sep 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricserdos-problemssum-product

There is an absolute constant C>0C>0C>0 such that for every finite set A⊂ZA\subset\mathbb ZA⊂Z with ∣A∣≥2|A|\ge 2∣A∣≥2,

max⁡(∣A+A∣, ∣AA∣) ≥ C ∣A∣4/3(log⁡∣A∣)1/3,\max\bigl(|A+A|,\,|AA|\bigr)\ \ge\ C\,\frac{|A|^{4/3}}{(\log|A|)^{1/3}},max(∣A+A∣,∣AA∣) ≥ C(log∣A∣)1/3∣A∣4/3​,

where log⁡\loglog is the natural logarithm. This is the consequence of Solymosi's multiplicative-energy bound (2009), and was the record exponent for several years.

Formalization Note The hypothesis ∣A∣≥2|A|\ge2∣A∣≥2 ensures log⁡∣A∣>0\log|A|>0log∣A∣>0, avoiding division by zero.

Preamble
import Mathlib
open scoped Pointwise
Formal statement
namespace Erdos52
theorem solymosi_four_thirds : ∃ (C : ℝ), 0 < C ∧ ∀ (A : Finset ℤ), 2 ≤ A.card →
    (max (A + A).card (A * A).card : ℝ) ≥
      C * (A.card : ℝ) ^ ((4 : ℝ) / 3) / Real.log (A.card : ℝ) ^ ((1 : ℝ) / 3) := by sorry
end Erdos52
Source
https://www.erdosproblems.com/52; see the milestone description for the literature reference
Read-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 C>0C>0C>0 such that for every finite set AAA of integers with at least two elements,

max⁡(∣A+A∣, ∣AA∣) ≥ C⋅∣A∣4/3(log⁡∣A∣)1/3,\max\bigl(|A+A|,\,|AA|\bigr)\ \ge\ \frac{C\cdot|A|^{4/3}}{\bigl(\log|A|\bigr)^{1/3}},max(∣A+A∣,∣AA∣) ≥ (log∣A∣)1/3C⋅∣A∣4/3​,

where log⁡\loglog is the natural logarithm of the real number ∣A∣|A|∣A∣. Here A+A={a+b:a,b∈A}A+A=\{a+b: a,b\in A\}A+A={a+b:a,b∈A} and AA={ab:a,b∈A}AA=\{ab : a,b\in A\}AA={ab:a,b∈A} are the pointwise sumset and product set, ∣⋅∣|\cdot|∣⋅∣ is cardinality (a natural number, regarded as a real number), and powers with real exponents are real powers of the non-negative real ∣A∣|A|∣A∣.

Parsing. The right-hand side is (C⋅∣A∣4/3)\bigl(C\cdot|A|^{4/3}\bigr)(C⋅∣A∣4/3) divided by (log⁡∣A∣)1/3(\log|A|)^{1/3}(log∣A∣)1/3. Because ∣A∣≥2|A|\ge2∣A∣≥2, log⁡∣A∣≥log⁡2>0\log|A|\ge\log 2>0log∣A∣≥log2>0, so no division by zero or junk value occurs. Sets with 000 or 111 element are not covered by the statement.

Human review
  • Endorsed by Shuze Chen · Sep 26, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 26, 2026

    Confirmed by the mission captain (proposal self-audit).

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