Transition kernel
Mathematical function
In the mathematics of probability, a transition kernel or kernel is a function in mathematics that has different applications. Kernels can for example be used to define random measures or stochastic processes. The most important example of kernels are the Markov kernels.
01Definition
Let ,
be two measurable spaces. A function
is called a (transition) kernel from to
if the following two conditions hold:
- For any fixed
, the mapping
- is
-measurable;
- For every fixed
, the mapping
- is a measure on
.
02Classification of transition kernels
Transition kernels are usually classified by the measures they define. Those measures are defined as
with
for all and all
. With this notation, the kernel
is called
- a substochastic kernel, sub-probability kernel or a sub-Markov kernel if all
are sub-probability measures
- a Markov kernel, stochastic kernel or probability kernel if all
are probability measures
- a finite kernel if all
are finite measures
- a
-finite kernel if all
are
-finite measures
- a
-finite kernel if
can be written as a countable sum of finite kernels (so that in particular, all
are
-finite measures).
- a uniformly
-finite kernel if there are at most countably many measurable sets
in
with
for all
and all
.
03Operations
In this section, let ,
and
be measurable spaces and denote the product σ-algebra of
and
with
Product of kernels
Definition
Let be a s-finite kernel from
to
and
be a s-finite kernel from
to
. Then the product
of the two kernels is defined as
for all .
Properties and comments
The product of two kernels is a kernel from to
. It is again a s-finite kernel and is a
-finite kernel if
and
are
-finite kernels. The product of kernels is also associative, meaning it satisfies
for any three suitable s-finite kernels .
The product is also well-defined if is a kernel from
to
. In this case, it is treated like a kernel from
to
that is independent of
. This is equivalent to setting
for all and all
.
Composition of kernels
Definition
Let be a s-finite kernel from
to
and
a s-finite kernel from
to
. Then the composition
of the two kernels is defined as
for all and all
.
Properties and comments
The composition is a kernel from to
that is again s-finite. The composition of kernels is associative, meaning it satisfies
for any three suitable s-finite kernels . Just like the product of kernels, the composition is also well-defined if
is a kernel from
to
.
An alternative notation is for the composition is
04Kernels as operators
Let be the set of positive measurable functions on
.
Every kernel from
to
can be associated with a linear operator
given by
The composition of these operators is compatible with the composition of kernels, meaning
Sources and credits
This article is adapted from the Wikipedia article “Transition kernel”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.