Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Discrete Fourier transform
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Representation theory === {{further|Representation theory of finite groups#Discrete Fourier transform}} The DFT can be interpreted as a complex-valued [[representation theory|representation]] of the finite [[cyclic group]]. In other words, a sequence of <math>n</math> complex numbers can be thought of as an element of <math>n</math>-dimensional complex space <math>\mathbb{C}^n</math> or equivalently a function <math>f</math> from the finite cyclic group of order <math>n</math> to the complex numbers, <math>\mathbb{Z}_n \mapsto \mathbb{C}</math>. So <math>f</math> is a [[class function]] on the finite cyclic group, and thus can be expressed as a linear combination of the irreducible characters of this group, which are the roots of unity. From this point of view, one may generalize the DFT to representation theory generally, or more narrowly to the [[representation theory of finite groups]]. More narrowly still, one may generalize the DFT by either changing the target (taking values in a field other than the complex numbers), or the domain (a group other than a finite cyclic group), as detailed in the sequel.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)