Math 2.0

Proof

Proof of Expander mixing lemma

Proof

To show the tighter bound above, we instead consider the vectors 1S−∣S∣n𝟏1_S-\frac{|S|}n\mathbf 1 and 1T−∣T∣n𝟏1_T-\frac{|T|}n\mathbf 1, which are both perpendicular to v1v_1. We can expand

1_S^\operatorname{T}A_G1_T=\left(\frac{|S|}n\mathbf 1\right)^\operatorname{T}A_G\left(\frac{|T|}n\mathbf 1\right)+\left(1_S-\frac{|S|}n\mathbf 1\right)^\operatorname{T}A_G\left(1_T-\frac{|T|}n\mathbf 1\right)

because the other two terms of the expansion are zero. The first term is equal to \frac{|S||T|}{n^2}\mathbf 1^\operatorname{T}A_G\mathbf 1=\frac dn|S||T|, so we find that

\left|e(S,T)-\frac dn|S||T|\right| \leq\left|\left(1_S-\frac{|S|}n\mathbf 1\right)^\operatorname{T}A_G\left(1_T-\frac{|T|}n\mathbf 1\right)\right|

We can bound the right hand side by λ∥1S−∣S∣∣n∣𝟏∥∥1T−∣T∣∣n∣𝟏∥=λ∣S∣∣T∣(1−∣S∣n)(1−∣T∣n)\lambda\left\|1_S-\frac{|S|}{|n|}\mathbf 1\right\|\left\|1_T-\frac{|T|}{|n|}\mathbf 1\right\| =\lambda\sqrt{|S||T|\left(1-\frac{|S|}n\right)\left(1-\frac{|T|}n\right)} using the same methods as in the earlier proof.

Where this leads

1 page builds on this one.

Further reading

  1. Wikipedia, page 6230931, revision 1354782268, Expander mixing lemma, section Proofs > Proof Sketch of Tighter Bound. adopted
About this page
TagES427AJ8B6
URIm2://ES427AJ8B6
Kindproof
WritingW0 stub
ProvesExpander mixing lemma
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • edge uses out: each node that the argument needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.