Introductory university-level calculus, linear algebra, abstract algebra, probability, statistics, and stochastic processes.
Kernels arising from the Fourier series
Get link
Facebook
X
Pinterest
Email
Other Apps
-
Here, we present a different way of looking at the Fourier series using kernels. We see that the partial Fourier sum of a function can be expressed as the convolution between and the Dirichlet kernel. We have already seen that the partial Fourier sum converges uniformly to if is continuously differentiable. Similarly, we show that the convolution of the function and the Fejér kernel converges uniformly to , but this time, if is continuous. These kernels are used to prove the convergence of the Fourier series.
Definition (Kernel function)
Let be a set, and be a two-variable function. is said to be a kernel function (or integral kernel or nucleus) if it satisfies the following conditions:
(symmetry) For any ,
(positive semi-definiteness) For any , , ,
We now consider kernel representations of the Fourier series.
The Dirichlet kernel
Consider the partial sum of :
Let us define by
Noting
we have
where
is called the Dirichlet kernel. As the name suggests, it is a kernel function. is an even function of , and has a period of . Thus, is symmetric with respect to and . Using (eq:Ddef), we can show that it is also positive semi-definite (exercise!).
For the constant function , for and so that for all . Therefore
The following figure shows the Dirichlet kernels with .
The integral of the form of (Eq:Dfconv) is so common that it has a name.
Definition (Convolution)
Let . The convolution of and , often denoted as , is defined as
It is known that, if converges, then converges to the same value and the convergence is generally ``faster'' than . Based on this observation, we introduce another kernel representation of the Fourier series. For the partial sum of the Fourier series of , we define Fejér's partial sum by
The integral representation of can be obtained as follows.
where is the Dirichlet kernel. Noting
we have
where
is called the Fejér kernel. is an even function and has a period of , so is symmetric. The positive semi-definiteness is inherited from that of the Dirichlet kernel.
For the constant function , () so that , and hence
Unlike , is non-negative:
The following figure shows the Fejér kernels for .
Lemma (Uniform convergence of )
If , then converges uniformly to .
Proof. Using (eq:Fnormal), we have
Therefore,
where the range of integration could be any one period.
For any , there exists a such that
as is uniformly continuous. Fixing this , we split the right-hand side of (eq:fms) into two parts:
where
Since is non-negative and normalized (eq:Fnormal),
Next, if , noting that
and letting ,
Thus, for a sufficiently large , we have
Putting these together, we have
Here, does not depend on , which proves that uniformly converges to with respect to . ■
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 cells at time . Assume that the probability that any individual cell divides in the time interval is proportional to for small . Further assume that each cell division is independent of others. Let be the birth rate. The probability of a cell division for a population of cells during is . We assume that the probability that two or more births take place in the time interval is . That is, it can be ignored. Consequently, the probability that no cell divides during is . Note that this process is an example of the Markov chain with states \({n_0}, {n_0 + 1}, {n_0 + 2}...
Generational growth Consider the following scenario (see the figure below): A single individual (cell, organism, etc.) produces descendants with probability , independently of other individuals. The probability of this reproduction, , is known. That individual produces no further descendants after the first (if any) reproduction. These descendants each produce further descendants at the next subsequent time with the same probabilities. This process carries on, creating successive generations. Figure 1. An example of the branching process. Let be the random variable representing the population size (number of individuals) of generation . In the above figure, we have , , , , We shall assume as the initial condition. Ideally, our goal would be to find how the population size grows through generations, that is, to find the probability for e...
In mathematics, we must prove (almost) everything and the proofs must be done logically and rigorously. Therefore, we need some understanding of basic logic. Here, I will informally explain some rudimentary formal logic. Definitions (Proposition): A proposition is a statement that is either true or false. "True" and "false" are called the truth values, and are often denoted and . Here is an example. "Dr. Akira teaches at UBD." is a statement that is either true or false (we understand the existence of Dr. Akira and UBD), hence a proposition. The following statement is also a proposition, although we don't know if it's true or false (yet): Any even number greater than or equal to 4 is equal to a sum of two primes. See also: Goldbach's conjecture Next, we define several operations on propositions. Note that propositions combined with these operations are again propositions. (Conjunction, logical "and"): Let ...
Comments
Post a Comment