Introductory university-level calculus, linear algebra, abstract algebra, probability, statistics, and stochastic processes.
Fourier series: Introduction
Get link
Facebook
X
Pinterest
Email
Other Apps
-
The theory of the Fourier series is based on a wild assumption: any "well-behaved" periodic function can be represented as a linear combination of sine and cosine functions, and that expression is unique for the given function. This theory (eventually) provided much of the foundations of modern mathematics. But it is also of tremendous practical importance.
Trigonometric functions are periodic. But what is a periodic function in general?
Definition (Periodic function)
A function \(f(x)\) is said to be a periodic function if there exists a real number \(T > 0\) such that
\[f(x + T) = f(x).\]
In this case, \(T\) is called a period of the function. Note that if \(T\) is a period of \(f(x)\), then \(2T\), \(3T\), \(\cdots, nT\) (\(n \in \mathbb{N}\)) is are also periods of \(f(x)\). In fact,
The smallest (non-zero) period is called the fundamental period.
Remark. If we say simply a period, we usually mean the fundamental period. □
Example. For any \(n\in \mathbb{N}\), \(\cos(nx)\) and \(\sin(nx)\) have a period of \(2\pi\), their fundamental periods are \(\frac{2\pi}{n}\) for each \(n\). □
where \(a_n\) (\(n = 0, 1, \cdots\)) and \(b_n\) (\(n=1, 2,\cdots\)) are (usually) real constants.
The factor \(\frac{1}{2}\) in the constant term (\(\frac{1}{2}a_0\)) is by convention as well as for convenience. Each term of the series has a period of \(2\pi\), so the domain of the above function of \(x\) may be \(\mathbb{R}\) or \([-\pi, \pi]\) or \([0, 2\pi]\).
Definition (Fourier expansion of a function)
Let \(f(x)\) be a function on \(\mathbb{R}\) that has a period of \(2\pi\). If
holds for all except for finitely many \(x \in \mathbb{R}\), the right-hand side is said to be
a Fourier expansion or Fourier series expansion of the function \(f\).
If term-wise integration is allowed, the coefficients \(a_n\) and \(b_n\) are readily determined. Note the following formulae: For any \(m, n \in \mathbb{N}\),
where \(\delta_{m,n}\) is Kronecker's delta. That is, the functions \(\cos x, \cos(2x), \cdots, \sin x, \sin(2x), \cdots\) are orthogonal. By multiplying (eq:FF) by \(\cos(mx)\) or \(\sin(mx)\) and then integrating, we have
Since we are assuming the period of \(2\pi\) for \(f\), the range of integration can be \([-\pi, \pi]\) instead of \([0, 2\pi]\).
The sequences \(\{a_m\}\) and \(\{b_m\}\) defined by (eq:fab) are called the Fourier coefficients of \(f\). The Fourier coefficients of \(f\) can be determined if \(f\) is integrable on \([0,2\pi]\). Given the Fourier coefficients of \(f\), we can formally define the following series, which is called the Fourier series of \(f\), denoted by \(S[f]\):
Note that, in this case, \(S[f]\) may not be the same function as \(f\). In fact, whether and/or when \(f = S[f]\) (note it's "\(=\)", not "\(\sim\)") is a fundamental question in the theory of Fourier series.
The fundamental problems in the theory of the Fourier series are
Under what conditions on \(f\) does \(S[f]\) converge?
What does the sum \(S[f]\) represent?
The continuity of \(f\) alone is known to be insufficient. To state the sufficient condition, we need the language of Lebesgue integral, or the measure theory, which is far beyond the scope of this post. We give it below anyway without proof.
Theorem (Carlson (1966))
Let \(f\) be a function that is measurable on \([0, 2\pi]\) and \(L^2\)-integrable, i.e.,
\[\int_0^{2\pi}|f(x)|^2dx < +\infty,\]
then the Fourier series \(S[f]\) converges to \(f\) almost everywhere.
Remark. The technical terms such as measurable, \(L^2\)-integrable, and almost everywhere come from the theory of Lebesgue integral. The Lebesgue integral is a generalization of the Riemann integral. Much of modern mathematics depends on the Lebesgue integral. □
Defining the birth process Consider a colony of bacteria that never dies. We study the following process known as the birth process , also known as the Yule process . The colony starts with \(n_0\) cells at time \(t = 0\). Assume that the probability that any individual cell divides in the time interval \((t, t + \delta t)\) is proportional to \(\delta t\) for small \(\delta t\). Further assume that each cell division is independent of others. Let \(\lambda\) be the birth rate. The probability of a cell division for a population of \(n\) cells during \(\delta t\) is \(\lambda n \delta t\). We assume that the probability that two or more births take place in the time interval \(\delta t\) is \(o(\delta t)\). That is, it can be ignored. Consequently, the probability that no cell divides during \(\delta t\) is \(1 - \lambda n \delta t - o(\delta t)\). Note that this process is an example of the Markov chain with states \({n_0}, {n_0 + 1}, {n_0 + 2}...
Joseph Fourier introduced the Fourier series to solve the heat equation in the 1810s. In this post, we show how the Fourier transform arises naturally in a simplified version of the heat equation. Suppose we have the unit circle \(S\) made of a metal wire. Pick an arbitrary point \(A\) on the circle. Any point \(P\) on the circle is identified by the distance \(x\) from \(A\) to \(P\) along the circle in the counter-clockwise direction (i.e., \(x\) is the angle of the section between \(A\) and \(P\) in radian). Let \(u(t,x)\) represent the temperature at position \(x\) and time \(t\). The temperature distribution at \(t = 0\) is given by \(u(0, x) = f(x)\). Assuming no radiation of heat out of the metal wire, \(u(t,x)\) for \(t > 0\) and \(0\leq x \leq 2\pi\) is determined by the following partial differential equation (PDE) called the heat equation : \[\gamma\frac{\partial u}{\partial t} = \kappa\frac{\partial^2 u}{\partial x^2}\] and the initial condition \[u(0,x) = f(x...
Given a sequence \(\{a_n\}\), the expression \[\sum_{n=0}^{\infty}a_n = a_0 + a_1 + a_2 + \cdots\] is called a series (or infinite series ). This expression may or may not have value. At this point, it is purely formal. Note that the order of addition matters : We first add \(a_0\) and \(a_1\), to the result of which we add \(a_2\), to the result of which we add \(a_3\), and so on (Not something like we first add \(a_{101}\) and \(a_{58}\), then add \(a_{333051}\), and so on). We will see, however, that for a special class of series (the positive term series), the order of addition does not matter if the series converges. Example . The sum of a geometric progression \(\{ar^n\}\), that is, \(\sum_{n=0}^{\infty}ar^n\) is called a geometric series . It is understood that \(r^0 = 1\) including the case when \(r = 0\). □ Given a series \(\sum_{n=0}^{\infty}a_n\) and a number \(n\geq 0\), the sum \[\sum_{k=0}^{n}a_k = a_0 + a_1 + \cdots + a_n\] is called the \(n\)-th partial sum . We m...
Comments
Post a Comment