5 Expansion in the hypercube graph
5.1 The graph and its spectrum
For \(u \in \mathbb {F}_q^m\), an index \(i \in \{ 1,\dots ,m\} \), and \(x \in \mathbb {F}_q\), let
This is the move obtained by rerandomizing the \(i\)-th coordinate of \(u\) by a uniform additive shift. In Lean, the same edge distribution is represented as the push-forward of the uniform distribution on triples \((u,i,x)\) by the map that replaces the \(i\)-th coordinate by \(x\); since \(x\) is uniform, this is the same distribution as the additive-shift presentation. The corresponding weight-sum identity identifies this push-forward distribution with the explicit edge coefficient used in the matrix proof.
The hypercube graph \(C=(V,E)\) has vertex set \(V=\mathbb {F}_q^m\), and an edge between \(u\) and \(v\) whenever they differ in at most one coordinate. A random edge \((u,v) \sim C\) is sampled by drawing \(u \sim \mathbb {F}_q^m\), \(i \in \{ 1,\dots ,m\} \), and \(x \in \mathbb {F}_q\) uniformly and then setting \(v=\operatorname {rerand}_i(u,x)\).
Let \(M=q^m\). The normalized adjacency matrix of \(C\) is
and the Laplacian is
The Laplacian can be written as
The two vertex marginals of a random edge are uniform on \(\mathbb {F}_q^m\). Expanding the right-hand side yields \((1/M)I-K\).
For \(\beta \in \mathbb {F}_q\),
If \(\beta =0\) the character is constant. If \(\beta \ne 0\), the map \(x \mapsto \beta x\) permutes \(\mathbb {F}_q\), so the average is the average of a nontrivial additive character, which vanishes.
For \(\alpha ,\beta \in \mathbb {F}_q^m\),
This is Lemma 3.3 applied to \(v=\beta -\alpha \).
For each \(\alpha \in \mathbb {F}_q^m\), define
Then the following two statements hold.
The \(\lvert \varphi _\alpha \rangle \)’s form an orthonormal basis of \(\mathbb {C}^V\).
For each \(\alpha \in \mathbb {F}_q^m\), \(\lvert \varphi _\alpha \rangle \) is an eigenvector for \(K\) with eigenvalue \(\frac{1}{M} \cdot \frac{m-|\alpha |}{m}\), where \(|\alpha |\) is the number of nonzero coordinates of \(\alpha \).
First we prove 1. For \(\alpha ,\beta \in \mathbb {F}_q^m\),
by Lemma 5.6. Thus the \(\lvert \varphi _\alpha \rangle \) form an orthonormal basis of \(\mathbb {C}^V\).
Next we prove 2. For \(\alpha \in \mathbb {F}_q^m\),
By the edge-sampling rule from Definition 5.2, we may write \(v=u+x e_i\), where \(i\) is uniformly random in \(\{ 1,\dots ,m\} \) and \(x\) is uniformly random in \(\mathbb {F}_q\). Therefore
Hence \(\lvert \varphi _\alpha \rangle \) is an eigenvector of \(K\) with eigenvalue
by Lemma 5.5.
If \(\lambda _1 \le \lambda _2 \le \cdots \le \lambda _{q^m}\) are the eigenvalues of \(L\), then
Lemma 5.7 identifies the two largest eigenvalues of \(K\), hence the two smallest eigenvalues of \(L=(1/q^m)I-K\).
5.2 Local and global variance
Let \(\lvert \psi \rangle \in \mathcal H_{\mathrm A} \otimes \mathcal H_{\mathrm B}\) and let \(0 \le A^u \le I\) be an operator for each \(u \in \mathbb {F}_q^m\). The local variance is
and the global variance is
Define
Then
For \(u,v \in \mathbb {F}_q^m\),
Therefore
by Lemma 5.4, and hence
by 8. Taking the trace gives
Write
where \(\lvert \varphi _\perp \rangle \) is orthogonal to \(\lvert \varphi _0 \rangle \). Then
We first compute
Writing \(A_{\mathrm{avg}}=\mathbb {E}_u A^u\), it follows that
Hence
Moreover,
Substituting this identity into 9 yields
For every family \(\{ A^u\} \),
The second step uses that \(\lvert \varphi _0 \rangle \) is a \(0\)-eigenvector of \(L\). Since \(\lvert \varphi _\perp \rangle \) is orthogonal to \(\lvert \varphi _0 \rangle \), Lemma 5.8 gives
Therefore
where the last step is Lemma 5.11. Rearranging gives the claim.