Skip to content
Level A ยท Machine-checkable Hard Combinatorics P-green-52

Green's Open Problem 52

Suppose that A โŠ‚ ๐”ฝ_2^n is a set with an additive complement of size K. Does 2A contain a coset of codimension O_K(1)?

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) โ€” original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Start working on it Submit a claim Follow
Cite
@misc{cairn-green-52,
  title        = {Green's Open Problem 52},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/green-52}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-09-28}
}

Also: CITATION.cff ยท Atom feed of results

Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

The question

Suppose that is a set with an additive complement of size . Does contain a coset of codimension ?

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.GreensOpenProblems.ยซ52ยป. answer(sorry) marks a yes/no question: a proof of the statement on the right of โ†”, or of its negation, answers it.

theorem green_52 :
    answer(sorry) โ†” โˆƒ (c : โ„• โ†’ โ„•), โˆ€ (n K : โ„•) (A : Set (๐”ฝโ‚‚ n)) (S : Finset (๐”ฝโ‚‚ n)),
      S.card = K โ†’ A + (S : Set (๐”ฝโ‚‚ n)) = Set.univ โ†’
      โˆƒ (V : AffineSubspace (ZMod 2) (๐”ฝโ‚‚ n)), (V : Set (๐”ฝโ‚‚ n)) โІ A + A โˆง
        n โ‰ค Module.finrank (ZMod 2) V.direction + c K

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

Green's Open Problems

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.