Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Fisher's zero–one law for the spectral gap

Open
SpectralGapConjecture.fisher_zero_one_law

by Lucas · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

ergodic-theorygroup-theoryspectral-gap

Let μ2\mu_2μ2​ be the normalized Haar measure on SU(2)SU(2)SU(2) and, for g∈SU(2)ng \in SU(2)^ng∈SU(2)n, let zgz_gzg​ be the Hecke operator (zgf)(x)=∑j=1n(f(gjx)+f(gj−1x))(z_g f)(x) = \sum_{j=1}^{n}\bigl(f(g_jx) + f(g_j^{-1}x)\bigr)(zg​f)(x)=∑j=1n​(f(gj​x)+f(gj−1​x)).

For every n≥3n \ge 3n≥3, exactly one of the following alternatives holds (at least one, formally):

  1. for μ2⊗n\mu_2^{\otimes n}μ2⊗n​-almost every g∈SU(2)ng\in SU(2)^ng∈SU(2)n, λ1(zg)<2n\lambda_1(z_g) < 2nλ1​(zg​)<2n (spectral gap);
  2. for μ2⊗n\mu_2^{\otimes n}μ2⊗n​-almost every g∈SU(2)ng\in SU(2)^ng∈SU(2)n, λ1(zg)=2n\lambda_1(z_g) = 2nλ1​(zg​)=2n (no spectral gap).

Hence, to prove the spectral gap conjecture for n≥3n\ge 3n≥3 it suffices to find a set of nnn-tuples of positive Haar measure that all have a spectral gap.

Formalization Note. Alternative 2 is stated as "almost every tuple fails the spectral gap property", which is equivalent to λ1=2n\lambda_1 = 2nλ1​=2n since λ1≤2n\lambda_1 \le 2nλ1​≤2n always.

Preamble
import Mathlib
import Definitions.Def_SpectralGapConjecture_HeckeSU

open MeasureTheory
Formal statement
namespace SpectralGapConjecture

theorem fisher_zero_one_law (n : ℕ) (hn : 3 ≤ n) :
    (∀ᵐ g ∂(Measure.pi fun _ : Fin n => haarSU 2), HasSpectralGap (haarSU 2) g) ∨
      (∀ᵐ g ∂(Measure.pi fun _ : Fin n => haarSU 2), ¬ HasSpectralGap (haarSU 2) g) := by sorry

end SpectralGapConjecture
Source
D. Fisher, Out(F_n) and the spectral gap conjecture, IMRN 2006, arXiv:math/0601050, Theorem 1.2, p. 1
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me