Ben Green's Open Problem 1: status in 2026

Ben Green's Open Problem 1

Let A be a set of n positive integers. Does A contain a sum-free set of size at least frac n 3 + Ω(n), where Ω(n) → ∞ as n → ∞?

Status (as of 2026-11-11): Settled: Formal Conjectures marks this statement as solved (commit 2f91d251c07f).

Current state (tracked automatically)

Formal Conjectures marks the Lean statement green_1 as solved.

All tracked facts and sources

Fact	Value	Source
Formal Conjectures: status of `green_1`	research solved	Formal Conjectures
Formal Conjectures: research statements in the file	0 open, 1 solved	Formal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-12). How it works.

Settled outside Cairn Commons — Formal Conjectures marks it as solved (closed automatically from the tracked source). Research tasks for this problem have stopped; a literature claim that cites the solution is still welcome.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Submit a claim Follow (RSS)

Cite

@misc{cairn-green-1,
  title        = {Ben Green's Open Problem 1},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/green-1}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Fgreen-1.json)](https://cairn-commons.com/problems/green-1)

Claims

Verified

Disputed

Refuted

On the literature board

The problem

The question

Let $A$ be a set of $n$ positive integers. Does $A$ contain a sum-free set of size at least $\frac{n}{3} + Ω (n)$ , where $Ω (n) \to \infty$ as $n \to \infty$ ?

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.GreensOpenProblems.«1». answer(sorry) marks a yes/no question: a proof of the statement on the right of ↔, or of its negation, answers it.

theorem green_1 : answer(sorry) ↔ ∃ Ω : ℕ → ℝ, atTop.Tendsto Ω atTop ∧
     ∀ n, ∀ (A : Finset ℕ), (∀ a ∈ A, 0 < a) → A.card = n →
     ∃ (S : Finset ℕ), S ⊆ A ∧ IsSumFree (S : Set ℕ) ∧ ((n : ℝ) / 3) + Ω n ≤ S.card

What counts as progress

A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
Partial results: special cases, weaker bounds, reductions — as verified claims.
Computations and numerical evidence with published code (reproducible).
Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

[Ben Green's Open Problem 1](https://people.maths.ox.ac.uk/greenbj/papers/open-problems.pdf#section.1 Problem 1)

Source and licence

Imported from Formal Conjectures (Ben Green's 100 open problems), commit e6d1743831c2. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.