summaryrefslogtreecommitdiffstats
path: root/Fourier Series.page
diff options
context:
space:
mode:
authorsiveshs <siveshs@gmail.com>2010-07-03 05:30:53 +0000
committerbnewbold <bnewbold@adelie.robocracy.org>2010-07-03 05:30:53 +0000
commit860a88ac4a6b4cd50f32f00ea77e6b98c5535dfb (patch)
treedf7537738e537ab679cb17464d7d6f1ea4eee24f /Fourier Series.page
parent8c7d2e6af68b04e0e33842c2aa052c20dcfb0506 (diff)
downloadafterklein-wiki-860a88ac4a6b4cd50f32f00ea77e6b98c5535dfb.tar.gz
afterklein-wiki-860a88ac4a6b4cd50f32f00ea77e6b98c5535dfb.zip
editing
Diffstat (limited to 'Fourier Series.page')
-rw-r--r--Fourier Series.page2
1 files changed, 1 insertions, 1 deletions
diff --git a/Fourier Series.page b/Fourier Series.page
index 8010928..06e2d9b 100644
--- a/Fourier Series.page
+++ b/Fourier Series.page
@@ -13,7 +13,7 @@ We first begin with a few basic identities on the size of sets. Then, we will sh
## Proof that no. of available functions is greater than number of functions required to define the periodic function
Consider any arbitrary periodic function in the interval $[-\pi,\pi]$. This can be represented as a series of values at various points in the interval. For example,
-$ f(0) = ... , f(0.1) = ..., f(0.2) = ... $ and so on. At each point, we can assign any real number (i.e. $\in \mathbb R$). So, the number of possible periodic functions in an interval is of the order of $\mathbb R^{\mathbb R}$.
+$\qquad f(0) = ... , f(0.1) = ..., f(0.2) = ... $ and so on. At each point, we can assign any real number (i.e. $\in \mathbb R$). So, the number of possible periodic functions in an interval is of the order of $\mathbb R^{\mathbb R}$.
--> don't quite remember how this goes.
#<b>Why Fourier decomposition is plausible?</b>