Transition kernel

In the mathematics of probability, a transition kernel or kernel is a function in mathematics that has different applications.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 5 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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

edit edit source

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 s∈S, the mapping
B↦κ(s,B)
is a measure on (T,𝒯).

Classification of transition kernels

edit edit source

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 s∈S. 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 κ can be written as a countable sum of finite kernels (so that in particular, all κs are s-finite measures).
  • a uniformly σ-finite kernel if there are at most countably many measurable sets B1,B2,… in T with κs(Bi)<∞ for all s∈S and all i∈ℕ.

Operations

edit edit source

In this section, let (S,𝒮), (T,𝒯) and (U,𝒰) be measurable spaces and denote the product σ-algebra of 𝒮 and 𝒯 with 𝒮⊗𝒯

Product of kernels

edit edit source

Definition

edit edit source

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

edit edit source

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 s∈S.[4][3]

Composition of kernels

edit edit source

Definition

edit edit source

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 s∈S and all B∈𝒰.

Properties and comments

edit edit source

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

edit edit source

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

edit edit source
  1. ^ a b Klenke, Achim (2008). Probability Theory. Berlin: Springer. p. 180. doi:10.1007/978-1-84800-048-3. ISBN 978-1-84800-047-6. Wikipedia revision 1331103614, retrieved 2026-11-18
  2. ^ Kallenberg, Olav (2017). Random Measures, Theory and Applications. Switzerland: Springer. p. 30. doi:10.1007/978-3-319-41598-7. ISBN 978-3-319-41596-3. Wikipedia revision 1331103614, retrieved 2026-11-18
  3. ^ a b c d e Kallenberg, Olav (2017). Random Measures, Theory and Applications. Switzerland: Springer. p. 33. doi:10.1007/978-3-319-41598-7. ISBN 978-3-319-41596-3. Wikipedia revision 1331103614, retrieved 2026-11-18
  4. ^ a b Klenke, Achim (2008). Probability Theory. Berlin: Springer. p. 279. doi:10.1007/978-1-84800-048-3. ISBN 978-1-84800-047-6. Wikipedia revision 1331103614, retrieved 2026-11-18
  5. ^ Klenke, Achim (2008). Probability Theory. Berlin: Springer. p. 281. doi:10.1007/978-1-84800-048-3. ISBN 978-1-84800-047-6. Wikipedia revision 1331103614, retrieved 2026-11-18
  6. ^ Kallenberg, Olav (2017). Random Measures, Theory and Applications. Switzerland: Springer. pp. 29–30. doi:10.1007/978-3-319-41598-7. ISBN 978-3-319-41596-3. Wikipedia revision 1331103614, retrieved 2026-11-18

Text derived from https://en.wikipedia.org/w/index.php?oldid=1331103614 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001331103614 · captured 2026-01-04 · not yet sealed in the ledger · verify the chain · version history

Cite this page as: encyclopegia.org, “Transition kernel”, snapshot enwiki-001331103614. https://encyclopegia.org/a/transition-kernel