diff options
| author | luccul <luccul@gmail.com> | 2010-07-06 05:56:22 +0000 |
|---|---|---|
| committer | bnewbold <bnewbold@adelie.robocracy.org> | 2010-07-06 05:56:22 +0000 |
| commit | ac96ec72aa17d21e88f97e450ad0d8be6d1b972b (patch) | |
| tree | 67ac4f9c28e9781280e5b50d428a50186214d707 /ClassJune28.page | |
| parent | 521a98c8cbedf7525e18a6fb651245eec5a1844f (diff) | |
| download | afterklein-wiki-ac96ec72aa17d21e88f97e450ad0d8be6d1b972b.tar.gz afterklein-wiki-ac96ec72aa17d21e88f97e450ad0d8be6d1b972b.zip | |
removed redundancy
Diffstat (limited to 'ClassJune28.page')
| -rw-r--r-- | ClassJune28.page | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/ClassJune28.page b/ClassJune28.page index 64df72a..17ca1f1 100644 --- a/ClassJune28.page +++ b/ClassJune28.page @@ -2,7 +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$ |