Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.2 — An explicitly constructible growing family of 102-regular graphs with all nonleading eigenvalues below 21 in absolute value

Open
MTWalkSAT3CNF.TwoOcc.Supplement.lemma_6_2

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1randomized-algorithmssatisfiability

There is an algorithm outputting a finite adjacency matrix for each index j≥1j\ge1j≥1, defining simple connected 102-regular graphs GjG_jGj​ whose vertex counts NjN_jNj​ tend to infinity and whose real adjacency eigenvalues, sorted decreasingly with multiplicity, satisfy

λ1(Gj)=102,∣λi(Gj)∣<21(2≤i≤Nj).\lambda_1(G_j)=102,\qquad |\lambda_i(G_j)|<21\quad(2\le i\le N_j).λ1​(Gj​)=102,∣λi​(Gj​)∣<21(2≤i≤Nj​).

Explicit constructibility is retained as computability of the matrix-code output function; no running-time bound on the construction is imposed. Negative eigenvalues are included in the absolute-value condition. This supplies the graph family used by the separation theorem.

Differences from the source:

  • encoding: an explicitly constructible graph family indexed by j≥1 → a computable function on ℕ returning vertex counts and adjacency-bit codes, with sorted real adjacency eigenvalues; reason: j in Lean corresponds to j+1 in the source; decoding finite codes gives the actual matrices, and the statement keeps all spectral and growth conditions
Preamble
import Definitions.Def_MTWalkSAT3CNF_TwoOcc_Supplement_Expander

set_option autoImplicit false
open MeasureTheory
open scoped ENNReal
Formal statement
namespace MTWalkSAT3CNF.TwoOcc.Supplement

theorem lemma_6_2 :
    ∃ f : ℕ → ℕ × ℕ, ExplicitExpanderFamily f := by sorry

end MTWalkSAT3CNF.TwoOcc.Supplement
Source
Minbo Gao, Kun He, Tao Jiang, STOC 2027 submission #914 (October 2026), Lemma 6.2, p. 35; https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/914.pdf

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