Lemma 2.4 — every -magnifier has
ProvedAlonExpanders.Core.lemma_2_4Let be a finite simple graph on vertices with maximal degree at most , and let be the second-smallest eigenvalue of its Laplacian . Let . If is an -magnifier, i.e. for every with , then
so is an -enlarger with .
This is the discrete Cheeger-type inequality of the paper: vertex expansion forces a spectral gap. Together with Corollary 2.3 it shows that magnifiers and enlargers are the same graphs up to the constants.
Formalization Note Two hypotheses absent from the page are added, both necessary. : on one vertex the only set with is , so every one-vertex graph is a -magnifier for every , while is by convention. : for the magnifier condition is vacuous, and two disjoint edges form a -magnifier with .
import Mathlib import Definitions.Def_AlonMilman_Diameter_lambda1 import Definitions.Def_AlonExpanders_Core_IsMagnifier
namespace AlonExpanders.Core
/-- Lemma 2.4 of Alon, *Eigenvalues and expanders*, Combinatorica 6 (1986), p. 86: every
`(n, d, c)`-magnifier satisfies `λ(G) ≥ c²/(4 + 2c²)`. The hypotheses `2 ≤ n` and `0 ≤ c` are
added: for `n = 1` every graph is a magnifier for every `c` while `λ = 0` by convention, and for
`c < 0` the magnifier condition is vacuous (two disjoint edges, `λ = 0`). -/
theorem lemma_2_4 {V : Type} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj]
(n d : ℕ) (c : ℝ) (hn : 2 ≤ n) (hc : 0 ≤ c) (hG : IsMagnifier G n d c) :
c ^ 2 / (4 + 2 * c ^ 2) ≤ AlonMilman.Diameter.lambda1 G := by sorry
end AlonExpanders.Core
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.