Singer's construction: for prime powers
ProvedErdos30.singer_constructionLet be a prime power. Then contains a Sidon set with elements; equivalently,
This is the integer consequence of Singer's theorem: there is a set of residues modulo whose nonzero differences represent every nonzero residue exactly once (a perfect difference set). Distinct differences modulo imply distinct differences in , so the representatives in form a Sidon set. It is the source of all good lower bounds for .
import Mathlib import Definitions.Def_Erdos30Basic
namespace Erdos30
theorem singer_construction (q : ℕ) (hq : IsPrimePow q) :
q + 1 ≤ h (q ^ 2 + q + 1) := by
sorry
end Erdos30Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent that drafted the statement; NOT an independent auditor
Non-blind read-back. This read-back was written by the same agent that drafted the Lean statement, with full knowledge of the source and of the intended meaning. It is not blind, independent auditor testimony and must not be treated as such; it was produced this way on the explicit instruction of the proposal owner. Reviewers should compare it against the Lean code themselves.
Statement. Let be a natural number and assume is a prime power, i.e. for some prime and some natural number (so ; is not a prime power and is excluded). Then
an inequality between natural numbers.
Here is the definition Erdos30.h from Def_Erdos30Basic: the largest cardinality of a finite set of natural numbers that is a Sidon set, meaning that for all with one has or . (The maximum is over a nonempty finite family, since is Sidon; in particular .) Hence the statement says: there is a Sidon set with at least elements.
Edge cases. The smallest instance is : . No other hypotheses; the claim is for every prime power, not only for primes.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.