Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Singer's construction: h(q2+q+1)≥q+1h(q^2+q+1)\ge q+1h(q2+q+1)≥q+1 for prime powers qqq

Proved
Erdos30.singer_construction

by LG · Sep 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricserdos-problemsnumber-theorysidon-sets

Let qqq be a prime power. Then {1,2,…,q2+q+1}\{1,2,\dots,q^2+q+1\}{1,2,…,q2+q+1} contains a Sidon set with q+1q+1q+1 elements; equivalently,

h(q2+q+1) ≥ q+1.h(q^2+q+1)\ \ge\ q+1.h(q2+q+1) ≥ q+1.

This is the integer consequence of Singer's theorem: there is a set of q+1q+1q+1 residues modulo m=q2+q+1m=q^2+q+1m=q2+q+1 whose nonzero differences represent every nonzero residue exactly once (a perfect difference set). Distinct differences modulo mmm imply distinct differences in Z\mathbb ZZ, so the representatives in {1,…,m}\{1,\dots,m\}{1,…,m} form a Sidon set. It is the source of all good lower bounds for h(N)h(N)h(N).

Preamble
import Mathlib
import Definitions.Def_Erdos30Basic
Formal statement
namespace Erdos30

theorem singer_construction (q : ℕ) (hq : IsPrimePow q) :
    q + 1 ≤ h (q ^ 2 + q + 1) := by
  sorry

end Erdos30
Source
J. Singer, A theorem in finite projective geometry and some applications to number theory, Trans. Amer. Math. Soc. 43 (1938), 377–385, https://doi.org/10.1090/S0002-9947-1938-1501951-4 (main theorem: perfect difference sets of size q+1 modulo q^2+q+1 for prime powers q); cited at Erdős Problem #30, https://www.erdosproblems.com/30 as [Si38]
Read-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 qqq be a natural number and assume qqq is a prime power, i.e. q=pkq=p^kq=pk for some prime ppp and some natural number k≥1k\ge 1k≥1 (so q≥2q\ge 2q≥2; q=1q=1q=1 is not a prime power and is excluded). Then

q+1 ≤ h ⁣(q2+q+1),q+1\ \le\ h\!\left(q^2+q+1\right),q+1 ≤ h(q2+q+1),

an inequality between natural numbers.

Here h(N)h(N)h(N) is the definition Erdos30.h from Def_Erdos30Basic: the largest cardinality of a finite set B⊆{1,2,…,N}B\subseteq\{1,2,\dots,N\}B⊆{1,2,…,N} of natural numbers that is a Sidon set, meaning that for all i1,j1,i2,j2∈Bi_1,j_1,i_2,j_2\in Bi1​,j1​,i2​,j2​∈B with i1+i2=j1+j2i_1+i_2=j_1+j_2i1​+i2​=j1​+j2​ one has (i1,i2)=(j1,j2)(i_1,i_2)=(j_1,j_2)(i1​,i2​)=(j1​,j2​) or (i1,i2)=(j2,j1)(i_1,i_2)=(j_2,j_1)(i1​,i2​)=(j2​,j1​). (The maximum is over a nonempty finite family, since ∅\varnothing∅ is Sidon; in particular h(0)=0h(0)=0h(0)=0.) Hence the statement says: there is a Sidon set B⊆{1,2,…,q2+q+1}B\subseteq\{1,2,\dots,q^2+q+1\}B⊆{1,2,…,q2+q+1} with at least q+1q+1q+1 elements.

Edge cases. The smallest instance is q=2q=2q=2: h(7)≥3h(7)\ge 3h(7)≥3. No other hypotheses; the claim is for every prime power, not only for primes.

Human review
  • Endorsed by Shuze Chen · Sep 26, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 26, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me