|
| 1 | +/- |
| 2 | +Copyright 2026 The Formal Conjectures Authors. |
| 3 | +
|
| 4 | +Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | +you may not use this file except in compliance with the License. |
| 6 | +You may obtain a copy of the License at |
| 7 | +
|
| 8 | + https://www.apache.org/licenses/LICENSE-2.0 |
| 9 | +
|
| 10 | +Unless required by applicable law or agreed to in writing, software |
| 11 | +distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | +WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | +See the License for the specific language governing permissions and |
| 14 | +limitations under the License. |
| 15 | +-/ |
| 16 | + |
| 17 | +import FormalConjectures.Util.ProblemImports |
| 18 | + |
| 19 | +/-! |
| 20 | +# Green's Open Problem 52 |
| 21 | +
|
| 22 | +*Reference:* [Green's Open Problems](https://people.maths.ox.ac.uk/greenbj/papers/open-problems.pdf#problem.52) |
| 23 | +
|
| 24 | +-/ |
| 25 | + |
| 26 | +open Filter Real |
| 27 | +open scoped Pointwise |
| 28 | + |
| 29 | +namespace Green52 |
| 30 | + |
| 31 | +/-- The group $G = \mathbb{F}_2^n = (Z/2Z)^n$. -/ |
| 32 | +abbrev 𝔽₂ (n : ℕ) := Fin n → ZMod 2 |
| 33 | + |
| 34 | +/-- |
| 35 | +Suppose that $A \subset \mathbb{F}_2^n$ is a set with an additive complement of size $K$. |
| 36 | +Does $2A$ contain a coset of codimension $O_K(1)$? |
| 37 | +-/ |
| 38 | +@[category research open, AMS 5 11] |
| 39 | +theorem green_52 : |
| 40 | + answer(sorry) ↔ ∃ (c : ℕ → ℕ), ∀ (n K : ℕ) (A : Set (𝔽₂ n)) (S : Finset (𝔽₂ n)), |
| 41 | + S.card = K → A + (S : Set (𝔽₂ n)) = Set.univ → |
| 42 | + ∃ (V : AffineSubspace (ZMod 2) (𝔽₂ n)), (V : Set (𝔽₂ n)) ⊆ A + A ∧ |
| 43 | + n ≤ Module.finrank (ZMod 2) V.direction + c K := by |
| 44 | + sorry |
| 45 | + |
| 46 | +/-- |
| 47 | +Could $2A$ even contain a coset of codimension $O(\log K)$? |
| 48 | +-/ |
| 49 | +@[category research open, AMS 5 11] |
| 50 | +theorem green_52_log : |
| 51 | + answer(sorry) ↔ ∃ (C D : ℝ), ∀ (n K : ℕ) (A : Set (𝔽₂ n)) (S : Finset (𝔽₂ n)), |
| 52 | + 0 < K → S.card = K → A + (S : Set (𝔽₂ n)) = Set.univ → |
| 53 | + ∃ (V : AffineSubspace (ZMod 2) (𝔽₂ n)), (V : Set (𝔽₂ n)) ⊆ A + A ∧ |
| 54 | + (n : ℝ) ≤ (Module.finrank (ZMod 2) V.direction : ℝ) + C * log (K : ℝ) + D := by |
| 55 | + sorry |
| 56 | + |
| 57 | +-- TODO(jgd): Implement variants from Green's comments [Gr24]. |
| 58 | + |
| 59 | +end Green52 |
0 commit comments