The matrix approach for calculating the DFT also gives us a nice way to proof that the DFT can always be inverted. We just need to show that matrix F is always (for any positive integer N) invertible.
That can be proved in a number of ways. E.g. showing that det(F)!=0 or showing linear independence of the columns of F is sufficient.
During college, this guy had some banger articles. Had completely forgotten about the blog.
Now I check it and the burning question.. is it full of AI slop/psychosis (i.e. similar to the https://nullprogram.com guy..) Seems to have escaped the scourge.
The matrix approach for calculating the DFT also gives us a nice way to proof that the DFT can always be inverted. We just need to show that matrix F is always (for any positive integer N) invertible.
That can be proved in a number of ways. E.g. showing that det(F)!=0 or showing linear independence of the columns of F is sufficient.
The simplest way to show this is that the adjoint (complex transpose) DFT matrix is the inverse, so U^H U = I.
(For DFT there are different scaling conventions which may be taken into account.)
Maybe not the simplest way but constructive proofs are always nice.
Yes! It's discussed in the "Inverse DFT: reconstructing the signal" section, which relies on the earlier post https://eli.thegreenplace.net/2026/notes-on-the-complex-root...
I like that this takes care not to conflate the DFT (the computed value), with the FFT (a family of algorithm to compute it).
During college, this guy had some banger articles. Had completely forgotten about the blog.
Now I check it and the burning question.. is it full of AI slop/psychosis (i.e. similar to the https://nullprogram.com guy..) Seems to have escaped the scourge.
Likely made enough $ at GOOG to retire.
All posts are 100% written by me.
AI is very useful for brainstorming, checking the math, helping with some of the visualizations etc.