We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, ACM Press, May 1999]. The transparency of our prooftechnique allows us to generalize and tighten their result.