Theorem (1.4), p. 16 — Mixing Lemma: ||F(A_0,…,A_d)| − α|A_0|⋯|A_d|/n| ≤ ρ_α(|A_0|⋯|A_d|)^{d/(d+1)}
ProvedSimplicialIso.Mixing.theorem_1_4Theorem (1.4) (Mixing Lemma). Let be a -dimensional complex with a complete skeleton on vertices, , and fix . Let
the largest absolute value of an eigenvalue of on the -cycles. For any pairwise disjoint sets of vertices (not necessarily a partition),
Here is the set of -cells with exactly one vertex in each . The theorem generalizes the Expander Mixing Lemma of graphs (): the number of -cells across disjoint vertex sets is close to its expected value , with an error controlled by the spectrum of the upper Laplacian.
Formalization Note. is added (the Laplacians act on ). is not defined as a maximum: the statement is made for every with for all eigenvalues of on , which is equivalent to the statement for (the maximum is such a , and any such is at least the maximum); an empty eigenvalue set cannot make it trivially true through a default value. The page's first expression for relies on Proposition 3.3 and equals the one used, by (4.10). No hypothesis is needed: if , some is empty and both sides are . The power is Real.rpow with exponent computed in .
import Mathlib import Definitions.Def_SimplicialIso_Mixing_Setting
namespace SimplicialIso.Mixing
open Finset
open scoped InnerProductSpace
/-- Theorem (1.4), p. 16 (the Mixing Lemma, precise form): for a `d`-complex `X` with a complete
skeleton, `α ∈ ℝ`, disjoint vertex sets `A_0, …, A_d` (not necessarily a partition), and any `ρ`
bounding the absolute value of every eigenvalue of `αI − Δ⁺` on `Z_{d-1}` (in particular
`ρ = ρ_α = ‖(αI − Δ⁺)|_{Z_{d-1}}‖`),
`| |F(A_0, …, A_d)| − α |A_0| ⋯ |A_d| / n | ≤ ρ (|A_0| ⋯ |A_d|)^{d/(d+1)}`. -/
theorem theorem_1_4 (n d : ℕ) (hd : 1 ≤ d) (X : Complex n d) (α : ℝ)
(A : Fin (d + 1) → Finset (Fin n)) (hA : Pairwise (fun i j => Disjoint (A i) (A j))) (ρ : ℝ)
(hρ : ∀ μ, IsCycleEigenvalue (α • LinearMap.id - upLap X) μ → |μ| ≤ ρ) :
|((F X A).card : ℝ) - α * (∏ i, ((A i).card : ℝ)) / n| ≤
ρ * (∏ i, ((A i).card : ℝ)) ^ ((d : ℝ) / (d + 1)) := by sorry
end SimplicialIso.Mixing
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.