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 measure In probability theory, a random measure is a measure-valued random element. Random measures are for example used in the theory of random processes, where they form many important point processes such as Poisson point processes and Cox processes. ...
s or
stochastic processes. The most important example of kernels are the
Markov kernels.
Definition
Let
,
be two
measurable space
In mathematics, a measurable space or Borel space is a basic object in measure theory. It consists of a set and a σ-algebra, which defines the subsets that will be measured.
Definition
Consider a set X and a σ-algebra \mathcal A on X. Then ...
s. A function
:
is called a (transition) kernel from
to
if the following two conditions hold:
*For any fixed
, the mapping
::
:is
-
measurable
In mathematics, the concept of a measure is a generalization and formalization of geometrical measures (length, area, volume) and other common notions, such as mass and probability of events. These seemingly distinct concepts have many simila ...
;
*For every fixed
, the mapping
::
:is a
measure on
.
Classification 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 measure
In mathematics, a probability measure is a real-valued function defined on a set of events in a probability space that satisfies measure properties such as ''countable additivity''. The difference between a probability measure and the more g ...
s
* a finite kernel if all
are
finite measure
In measure theory, a branch of mathematics, a finite measure or totally finite measure is a special measure that always takes on finite values. Among finite measures are probability measures. The finite measures are often easier to handle than ...
s
* a
-finite kernel if all
are
-finite measures
* a s-finite kernel is a kernel that can be written as a countable sum of finite kernels
* a uniformly
-finite kernel if there are at most countably many measurable sets
in
with
for all
and all
.
Operations
In this section, let
,
and
be measurable spaces and denote the
product σ-algebra
Product may refer to:
Business
* Product (business), an item that serves as a solution to a specific consumer problem.
* Product (project management), a deliverable or set of deliverables that contribute to a business solution
Mathematics
* Produ ...
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
In mathematics, the associative property is a property of some binary operations, which means that rearranging the parentheses in an expression will not change the result. In propositional logic, associativity is a valid rule of replacement ...
, 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
In mathematics, the associative property is a property of some binary operations, which means that rearranging the parentheses in an expression will not change the result. In propositional logic, associativity is a valid rule of replacement ...
, 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
Kernels as operators
Let
be the set of positive measurable functions on
.
Every kernel
from
to
can be associated with a
linear operator
In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a Map (mathematics), mapping V \to W between two vect ...
:
given by
:
The composition of these operators is compatible with the composition of kernels, meaning
:
References
[ ]
[ ]
[ ]
[ ]
[ ]
[ {{cite book , last1=Klenke , first1=Achim , year=2008 , title=Probability Theory , url=https://archive.org/details/probabilitytheor00klen_341 , url-access=limited , location=Berlin , publisher=Springer , doi=10.1007/978-1-84800-048-3 , isbn=978-1-84800-047-6 , pag]
279
}
Probability theory