diff options
| author | siveshs <siveshs@gmail.com> | 2010-07-03 05:14:51 +0000 |
|---|---|---|
| committer | bnewbold <bnewbold@adelie.robocracy.org> | 2010-07-03 05:14:51 +0000 |
| commit | 6ce0252963bbb6cb8770ddd95e5e3a161e8a7022 (patch) | |
| tree | 34f22c9e742d353683c5c80c11ceed2884d1d811 | |
| parent | 6d067680fbad922e770377fe5b035daa18abb682 (diff) | |
| download | afterklein-wiki-6ce0252963bbb6cb8770ddd95e5e3a161e8a7022.tar.gz afterklein-wiki-6ce0252963bbb6cb8770ddd95e5e3a161e8a7022.zip | |
editing
| -rw-r--r-- | Fourier Series.page | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/Fourier Series.page b/Fourier Series.page index 9ce08fd..1bd52f4 100644 --- a/Fourier Series.page +++ b/Fourier Series.page @@ -2,6 +2,7 @@ **[Josh's Notes for Lecture 2](/Lecture_2.pdf)** #<b>Why the Fourier decomposition is possible?</b> +**[Josh's Notes for Lecture 2](/Lecture_2.pdf)** We first begin with a few basic identities on the size of sets. Then, we will show that the set of possible functions representing sets is not larger than the set of available functions. This at best indicates that the Fourier series is not altogether impossible. ## To show that $(0,1) \sim \mathbb R$ |