The eigenvectors of the Laplacian of a Ring graph with $n$ vertices are:
$x_k(u) = \sin(2\pi ku/n)$ and
$y_k(u) = \cos(2\pi ku/n)$
for $1\leq k \leq n/2$. The explanation according to Spielman's lecture notes is:
The best way to see that $x_k$ and $y_k$ are eigenvectors is to plot the graph on the circle using these vectors as coordinates. That they are eigenvectors is geometrically obvious.
Why is this "geometrically obvious"? I can see that embedding the graph into the plane using $x_k$ and $y_k$ as coordinates places the vertices uniformly over the unit circle. What I cannot understand is why the eigenvectors of the Laplacian must produce this embedding.
I think the following is what Spielman is referring to. Let $z(u)$ be the point $(x_k(u), y_k(u))$ in $\mathbb{R}^2$. Consider the vector $z(u-1) - 2 z(u) + z(u+1)$. By the reflection symmetry of the picture, it is parallel to $z(u)$; let $$z(u-1) - 2 z(u) + z(u+1) = \lambda z(u)$$ for some scalar $\lambda$. Moreover, by rotational symmetry, the constant $\lambda$ is independent of $u$.
Taking the first coordinates of this equation, $$x_{k}(u-1) - 2 x_k(u) + x_{k}(u+1) = \lambda x_k(u)$$ This exactly says that the vector $x_k$ is an eigenvector for $D$, with eigenvalue $\lambda$. Looking at the second coordinate, we get the same conclusion for $y_k$.