Eq. (2.1) — Rayleigh's principle: for
ProvedAlonMilman.Diameter.rayleigh_eq_2_1graph-theoryp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1spectral-graph-theory
Let be a connected finite simple graph on vertices, with Laplacian and algebraic connectivity . Let be the space of real functions on with scalar product and norm . If is orthogonal to the constants, i.e. , then
This is the variational side of : it converts the spectral definition into a lower bound for the quadratic form , and it is the only place where the eigenvalue enters the proof of Lemma 2.1.
Formalization Note is dotProduct (⬝ᵥ) and is G.lapMatrix ℝ *ᵥ f. is defined spectrally (the mission's lambda1), so the statement is not definitional.
Preamble
import Mathlib import Definitions.Def_AlonMilman_Diameter_lambda1 open Matrix
Formal statement
namespace AlonMilman.Diameter
theorem rayleigh_eq_2_1 {V : Type*} [Fintype V] [DecidableEq V]
(G : SimpleGraph V) [DecidableRel G.Adj] (hG : G.Connected) (hn : 2 ≤ Fintype.card V)
(f : V → ℝ) (hf : ∑ v, f v = 0) :
lambda1 G * (f ⬝ᵥ f) ≤ f ⬝ᵥ (G.lapMatrix ℝ *ᵥ f) := by sorry
end AlonMilman.Diameter
Source
Alon, Milman, λ1, Isoperimetric Inequalities for Graphs, and Superconcentrators, J. Combin. Theory Ser. B 38 (1985), p. 76, Section 2, Eq. (2.1)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.