/- 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 FormalConjecturesUtil

Ben Green's Open Problem 35

Estimate the infimum of the $L^p$ norm of the self-convolution of a nonnegative integrable function supported on $[0,1]$ with total integral $1$.

We model a function f : [0,1] → ℝ≥0 as a function f : ℝ → ℝ that is nonnegative, integrable, supported on [0,1], and has total integral 1.

References:

    Ben Green's Open Problem 35

    Gr01 B. J. Green, The number of squares and $B_h[g]$-sets, Acta Arith. 100 (2001), no. 4, 365-390.

    CS17 A. Cloninger and S. Steinerberger, On suprema of autoconvolutions with an application to Sidon sets, Proc. Amer. Math. Soc. 145 (2017), no. 8, 3191-3200.

    MV10 M. Matolcsi and C. Vinuesa, Improved bounds on the supremum of autoconvolutions, J. Math. Anal. Appl. 372 (2010), 439-447.

    AE25 A. Novikov et al., AlphaEvolve: A coding agent for scientific and algorithmic discovery, arXiv:2506.13131 (2025), Appendix B.1.

    GGTW25 B. Georgiev, J. Gómez-Serrano, T. Tao and A. Z. Wagner, Mathematical exploration and discovery at scale, arXiv:2511.02864 (2025), Section 6.2.

    YD26 M. Yuksekgonul et al., Learning to Discover at Test Time, arXiv:2601.16175 (2026).

The constants of [CS17], [MV10], [AE25], [GGTW25] and [YD26] are stated for functions supported on $[-1/4, 1/4]$; rescaling to $[0, 1]$ halves them.

@[expose] public sectionnamespace Green35open MeasureTheoryopen scoped Convolution ENNReal

A nonnegative integrable function on $[0,1]$ with total integral $1$.

def IsUnitIntervalDensity (f : ℝ → ℝ) : Prop := Integrable f ∧ (∀ x, 0 ≤ f x) ∧ Function.support f ⊆ .Icc (0 : ℝ) 1 ∧ ∫ x, f x = 1

The infimum of $|f \ast f|_p$ over unit-interval densities.

noncomputable def c (p : ℝ≥0∞) : ℝ≥0∞ := sInf { r | ∃ f, IsUnitIntervalDensity f ∧ r = eLpNorm (f ⋆ f) p }def green_35.lower.answer : ℝ≥0∞ → ℝ≥0∞ := sorry

Lower bound for $c(p)$ for $1 < p \le \infty$, improving the known value $\sqrt{4/7}$ at $p = 2$ or the known value $0.64$ at $p = \infty$.

@[category research open, question value, AMS 26 28 42] theorem green_35.lower : (∀ p, 1 < p → green_35.lower.answer p ≤ c p) ∧ (ENNReal.ofReal (Real.sqrt (4 / 7)) < green_35.lower.answer 2 ∨ 0.64 < green_35.lower.answer ∞) := ⊢ (∀ (p : ℝ≥0∞), 1 < p → lower.answer p ≤ c p) ∧ (ENNReal.ofReal √(4 / 7) < lower.answer 2 ∨ 0.64 < lower.answer ∞) All goals completed! 🐙noncomputable def green_35.upper.answer : ℝ≥0∞ → ℝ≥0∞ := fun p ↦ if p = ∞ then 0.7515 else ⊤

Upper bound for $c(p)$ for $1 < p \le \infty$. The TTT-Discover construction gives $c(\infty) \le 0.751435$ after rescaling to $[0,1]$ [YD26]. The answer is informative only at $p = \infty$ and is ⊤ otherwise.

@[category research solved, question value, AMS 26 28 42] theorem green_35.upper : (∀ p, 1 < p → c p ≤ green_35.upper.answer p) ∧ green_35.upper.answer ∞ < 0.7516 := ⊢ (∀ (p : ℝ≥0∞), 1 < p → c p ≤ upper.answer p) ∧ upper.answer ∞ < 0.7516 All goals completed! 🐙/- Known bounds and comparisons. -/ namespace variants

Lower bound for $c(2)$ from Green's first paper ([Gr01]); the constant is sqrt(4/7) (about 0.7559).

@[category research solved, AMS 26 28 42] theorem c_2_lower : ENNReal.ofReal (Real.sqrt (4 / 7)) ≤ c 2 := ⊢ ENNReal.ofReal √(4 / 7) ≤ c 2 All goals completed! 🐙

Best-known lower bound for $c(\infty)$ due to Cloninger and Steinerberger ([CS17]).

@[category research solved, AMS 26 28 42] theorem c_inf_lower : 0.64 ≤ c ∞ := ⊢ 0.64 ≤ c ∞ All goals completed! 🐙

Upper bound for $c(\infty)$ due to Matolcsi and Vinuesa ([MV10]); their step function has autoconvolution supremum $1.50972\ldots$, which rescales to $0.75486\ldots$.

@[category research solved, AMS 26 28 42] theorem c_inf_upper : c ∞ ≤ 0.7549 := ⊢ c ∞ ≤ 0.7549 All goals completed! 🐙

Upper bound for $c(\infty)$ found by AlphaEvolve ([AE25]) and recorded in Green's 2025 update; the step function there has autoconvolution supremum at most $1.5053$, which rescales to $0.75265$.

@[category research solved, AMS 26 28 42] theorem c_inf_upper_ae25 : c ∞ ≤ 0.75265 := ⊢ c ∞ ≤ 0.75265 All goals completed! 🐙

Best-known upper bound for $c(\infty)$ ([GGTW25], §6.2): a step function with autoconvolution supremum at most $1.5032$, which rescales to $0.7516$.

@[category research solved, AMS 26 28 42] theorem c_inf_upper_ggtw25 : c ∞ ≤ 0.7516 := ⊢ c ∞ ≤ 0.7516 All goals completed! 🐙

A comparison bound from Young's inequality.

@[category textbook, AMS 26 28 42] theorem c_inf_lower_young : (c 2) ^ 2 ≤ c ∞ := ⊢ c 2 ^ 2 ≤ c ∞ All goals completed! 🐙end variantsend Green35