Green's Open ProblemsCombinatorics
Ben Green's Open Problem 5
Which finite groups have the smallest biggest product-free sets?
Mathematical statement
Which finite groups have the smallest biggest product-free sets?
We formalise this as: determine the supremum of exponents such that every nontrivial finite group of order contains a product-free set of size for some absolute constant . (The trivial group is excluded since its only product-free subset is empty.) Kedlaya [Ke97] showed that is admissible, and Green suggests this exponent may well be sharp; the candidate extremal family is the Ree groups , .
Statement source: Green's Open Problems statement material
Statement terms: Source-specific
Source-specific terms. Therefore does not assert reuse rights beyond attributed display.
Statement artifacts, not proofs
These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.
Pinned Lean formulation 1
green_5
theorem green_5 : IsLUB {α : ℝ | ∃ c > (0 : ℝ), ∀ (G : Type) [Group G] [Fintype G], Nontrivial G → ∃ S : Finset G, IsProductFree (S : Set G) ∧ c * (Fintype.card G : ℝ) ^ α ≤ (S.card : ℝ)} answer(sorry) := by sorry- Statement source
- Formal Conjectures
- Lean version
- v4.27.0
- Placeholder
- Present; no proof artifact
- Source evidence
- Pinned source index
- Fidelity review
- Community formulation
References