/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilErdős Problem 52
Reference: erdosproblems.com/52
@[expose] public sectionopen scoped Pointwisenamespace Erdos52Let $A$ be a finite set of integers. Is it true that for every $\epsilon>0$ $\max( \lvert A+A\rvert,\lvert AA\rvert)\gg_\epsilon \lvert A\rvert^{2-\epsilon}?$
@[category research open, question, AMS 11]
theorem erdos_52 : ∀ (ε : ℝ), 0 < ε → ε < 1 → ∃ (C : ℝ), 0 < C ∧ ∀ (A : Finset ℤ),
(max (A + A).card (A * A).card : ℝ) ≥ C * (A.card : ℝ) ^ (2 - ε) := ⊢ ∀ (ε : ℝ), 0 < ε → ε < 1 → ∃ C, 0 < C ∧ ∀ (A : Finset ℤ), max ↑(A + A).card ↑(A * A).card ≥ C * ↑A.card ^ (2 - ε)
All goals completed! 🐙open scoped Classical in
The sum-product exponent for the reals: the largest s such that
max |A + A| |A * A| ≫_ε |A| ^ (s - ε) for every ε > 0 and every finite nonempty A ⊆ ℝ.
This is the real analogue of erdos_52, which concerns finite sets of integers.
@[optimization_constant "84b"]
noncomputable def sumProductExponentReal : ℝ :=
sSup {s : ℝ | ∀ ε > 0, ∃ C > 0, ∀ A : Finset ℝ, A.Nonempty →
(max (A + A).card (A * A).card : ℝ) ≥ C * (A.card : ℝ) ^ (s - ε)}-- TODO(firsching): Add additional material.
end Erdos52