The Cheeger Inequality and Coboundary Expansion: Beyond Constant Coefficients

TL;DR

The paper generalizes coboundary expansion from constant coefficients to arbitrary sheaves on graphs, linking expansion to spectral properties and mixing lemmas. It proves that expanders with any nontrivial coefficient group yield large 0-dimensional coboundary expansion for constant and many non-constant sheaves; for quotient sheaves defined by linearly disjoint subgroups, explicit lower bounds in terms of the graph’s spectral data are obtained. The work also provides new Expander Mixing Lemma variants for weighted multipartite graphs and applies the theory to finite spherical buildings, obtaining quantitative bounds that improve prior results and approach constants as thickness grows. These results bolster the construction of cosystolic expanders and, via the local criterion, enable new sparse locally testable codes, while also highlighting intrinsic limitations for certain locally constant sheaves. Overall, the paper deepens the connection between spectral expansion, coboundary expansion, and coding-theoretic applications in geometric/combinatorial settings.

Abstract

The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, $\mathbb{F}_2$. In this paper, we study Cheeger-type inequalities for graphs endowed with a generalized coefficient group, called a sheaf; this is motivated by applications to cosystolic expansion and locally testable codes. We prove that a graph is a good spectral expander if and only if it has good coboundary expansion relative to any (resp. some) constant sheaf, or equivalently, relative to any `ordinary' coefficient group. We moreover show that sheaves that are close to being constant in a well-defined sense are also good coboundary expanders, provided that their underlying graph is an expander, thus giving the first example of good coboundary expansion in non-cosntant sheaves on sparse graphs. By contrast, we observe that for general sheaves on graphs, it is impossible to relate the expansion of the graph and the coboundary expansion of the sheaf. We specialize our results to sheaves on (finite) spherical buildings. Specifically, we show that the normalized second eigenvalue of the (weighted) graph underlying a $q$-thick $d$-dimensional spherical building is $O(\frac{1}{\sqrt{q}-3d})$ if $q>9d^2$. Plugging this into our results about coboundary expansion gives explicit lower bounds on the coboundary expansion of some constant and non-constant sheaves on spherical buildings; for a fixed dimension $d$, the bounds approach a constant as the thickness $q$ grows. Along the way, we prove a new version of the Expander Mixing Lemma for $r$-partite weighted graphs.

Figures (1)

• Figure 1: An illustration of the collection of blobs ${\mathcal{M}}$ (left), the associated graph $\Gamma$ (middle), and the partition $\{Y^*\,|\, Y\in{\mathcal{M}}\}$ (right). The blobs are labelled $A$--$E$. The black vertices are those in living in $N$. The set of roots taken on the right is ${\mathcal{R}}=\{A\}$.

Theorems & Definitions (67)

• Example 1.1
• Example 1.2
• Remark 1.3
• Lemma 2.1
• Example 2.2
• Remark 2.3
• Lemma 2.4
• proof
• Remark 2.5
• Theorem 2.6: Kaufman_2021_amplified_local_testability_preprint