Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Spectral lower bound for the connection set S

Proved
KonyaginUnitVectors.Alon.S_spectrum

by moona3k · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

alonextremal-combinatoricsfinite-fieldsorthonormal-labelings

Throughout, FFF is a finite field of characteristic 222 with qqq elements, regarded as an algebra over F2\mathbb F_2F2​ (for example GF(2k)\mathrm{GF}(2^k)GF(2k)), Tr:F→F2\mathrm{Tr}:F\to\mathbb F_2Tr:F→F2​ is the absolute trace, and ψ(y)=(−1)Tr(y)∈{1,−1}\psi(y)=(-1)^{\mathrm{Tr}(y)}\in\{1,-1\}ψ(y)=(−1)Tr(y)∈{1,−1} is the associated additive character of FFF.

Let W0,W1⊆F∖{0}W_0,W_1\subseteq F\setminus\{0\}W0​,W1​⊆F∖{0} and S={γ(x)+γ(y):x∈W0,y∈W1}⊆F3S=\{\gamma(x)+\gamma(y):x\in W_0,y\in W_1\}\subseteq F^3S={γ(x)+γ(y):x∈W0​,y∈W1​}⊆F3 be as in the definition module, and assume that (x,y)↦γ(x)+γ(y)(x,y)\mapsto\gamma(x)+\gamma(y)(x,y)↦γ(x)+γ(y) is injective on W0×W1W_0\times W_1W0​×W1​. Put R=8q+1R=8\sqrt q+1R=8q​+1. Then for every character χw\chi_wχw​ of F3F^3F3

∑s∈Sχw(s) ≥ −R24,\sum_{s\in S}\chi_w(s)\ \ge\ -\frac{R^2}{4},s∈S∑​χw​(s) ≥ −4R2​,

and moreover

∣ ∣W0∣−∣W1∣ ∣≤R.\bigl|\,|W_0|-|W_1|\,\bigr|\le R .​∣W0​∣−∣W1​∣​≤R.

These bounds on the smallest eigenvalue of the Cayley graph on F3F^3F3 with connection set SSS, and on the sizes of the two classes, are what make the Fourier-type system of unit vectors of Alon's construction well defined and give the norm estimate.

Formalization Note. Injectivity is a hypothesis (it is proved separately); chi F w s is the character ψ(w1s1+w2s2+w3s3)\psi(w_1s_1+w_2s_2+w_3s_3)ψ(w1​s1​+w2​s2​+w3​s3​) of the definition module.

Preamble
import Mathlib
import Definitions.Def_KonyaginUnitVectors_AlonConstruction
Formal statement
namespace KonyaginUnitVectors.Alon

theorem S_spectrum (F : Type*) [Field F] [Fintype F] [CharP F 2] [Algebra (ZMod 2) F]
    (hinj : Set.InjOn (fun p : F × F => gamma F p.1 + gamma F p.2) ↑(W0 F ×ˢ W1 F)) :
    (∀ w : F × F × F, -((8 * Real.sqrt (Fintype.card F) + 1) ^ 2 / 4) ≤ ∑ s ∈ Sset F, chi F w s) ∧
    |((W0 F).card : ℝ) - ((W1 F).card : ℝ)| ≤ 8 * Real.sqrt (Fintype.card F) + 1 := by sorry

end KonyaginUnitVectors.Alon
Source
N. Alon, Explicit Ramsey graphs and orthonormal labelings, Electron. J. Combin. 1 (1994), R12, doi:10.37236/1192 (Sections 3 and 4; the construction here partitions by Tr(x^9) instead of the leading bit of x^7)

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