Transition kernel

From testwiki
Revision as of 20:03, 15 November 2023 by 91.69.103.175 (talk) (โ†’Classification of transition kernels)
(diff) โ† Older revision | Latest revision (diff) | Newer revision โ†’ (diff)
Jump to navigation Jump to search

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.

Definition

Let (S,๐’ฎ), (T,๐’ฏ) be two measurable spaces. A function

κ:S×๐’ฏ[0,+]

is called a (transition) kernel from S to T if the following two conditions hold:[1]

  • For any fixed B๐’ฏ, the mapping
sκ(s,B)
is ๐’ฎ/โ„ฌ([0,+])-measurable;
  • For every fixed sS, the mapping
Bκ(s,B)
is a measure on (T,๐’ฏ).

Classification of transition kernels

Transition kernels are usually classified by the measures they define. Those measures are defined as

κs:๐’ฏ[0,+]

with

κs(B)=κ(s,B)

for all B๐’ฏ and all sS. With this notation, the kernel κ is called[1][2]

  • a substochastic kernel, sub-probability kernel or a sub-Markov kernel if all κs are sub-probability measures
  • a Markov kernel, stochastic kernel or probability kernel if all κs are probability measures
  • a finite kernel if all κs are finite measures
  • a σ-finite kernel if all κs are σ-finite measures
  • a s-finite kernel if all κs are s-finite measures, meaning it 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 B1,B2, in T with κs(Bi)< for all sS and all iโ„•.

Operations

In this section, let (S,๐’ฎ), (T,๐’ฏ) and (U,๐’ฐ) be measurable spaces and denote the product ฯƒ-algebra of ๐’ฎ and ๐’ฏ with ๐’ฎ๐’ฏ

Product of kernels

Definition

Let κ1 be a s-finite kernel from S to T and κ2 be a s-finite kernel from S×T to U. Then the product κ1κ2 of the two kernels is defined as[3][4]

κ1κ2:S×(๐’ฏ๐’ฐ)[0,]
κ1κ2(s,A)=Tκ1(s,dt)Uκ2((s,t),du)๐ŸA(t,u)

for all A๐’ฏ๐’ฐ.

Properties and comments

The product of two kernels is a kernel from S to T×U. It is again a s-finite kernel and is a σ-finite kernel if κ1 and κ2 are σ-finite kernels. The product of kernels is also associative, meaning it satisfies

(κ1κ2)κ3=κ1(κ2κ3)

for any three suitable s-finite kernels κ1,κ2,κ3.

The product is also well-defined if κ2 is a kernel from T to U. In this case, it is treated like a kernel from S×T to U that is independent of S. This is equivalent to setting

κ((s,t),A):=κ(t,A)

for all A๐’ฐ and all sS.[4][3]

Composition of kernels

Definition

Let κ1 be a s-finite kernel from S to T and κ2 a s-finite kernel from S×T to U. Then the composition κ1κ2 of the two kernels is defined as[5][3]

κ1κ2:S×๐’ฐ[0,]
(s,B)Tκ1(s,dt)Uκ2((s,t),du)๐ŸB(u)

for all sS and all B๐’ฐ.

Properties and comments

The composition is a kernel from S to U that is again s-finite. The composition of kernels is associative, meaning it satisfies

(κ1κ2)κ3=κ1(κ2κ3)

for any three suitable s-finite kernels κ1,κ2,κ3. Just like the product of kernels, the composition is also well-defined if κ2 is a kernel from T to U.

An alternative notation is for the composition is κ1κ2[3]

Kernels as operators

Let ๐’ฏ+,๐’ฎ+ be the set of positive measurable functions on (S,๐’ฎ),(T,๐’ฏ).

Every kernel κ from S to T can be associated with a linear operator

Aκ:๐’ฏ+๐’ฎ+

given by[6]

(Aκf)(s)=Tκ(s,dt)f(t).

The composition of these operators is compatible with the composition of kernels, meaning[3]

Aκ1Aκ2=Aκ1κ2

References