summaryrefslogtreecommitdiffstats
path: root/Fourier Series.page
diff options
context:
space:
mode:
authorsiveshs <siveshs@gmail.com>2010-07-03 05:13:19 +0000
committerbnewbold <bnewbold@adelie.robocracy.org>2010-07-03 05:13:19 +0000
commite396a2521591ee58bb52f1598cbb7fce8b4f5f7f (patch)
tree118250ba0cd45c52dd7589463eb9280264b8e905 /Fourier Series.page
parentfc8c27d5b42d9787edc375d7e31e4848c17511e7 (diff)
downloadafterklein-wiki-e396a2521591ee58bb52f1598cbb7fce8b4f5f7f.tar.gz
afterklein-wiki-e396a2521591ee58bb52f1598cbb7fce8b4f5f7f.zip
editing
Diffstat (limited to 'Fourier Series.page')
-rw-r--r--Fourier Series.page1
1 files changed, 1 insertions, 0 deletions
diff --git a/Fourier Series.page b/Fourier Series.page
index c279a3f..1ab4984 100644
--- a/Fourier Series.page
+++ b/Fourier Series.page
@@ -1,3 +1,4 @@
+[Josh's Notes for Lecture 2](/Lecture_2.pdf)
#<b>Why the Fourier decomposition is possible?</b>
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.