Physlib

PhyslibAlpha.Mathematics.Probability.Kernel.Factorization

Factorization of Markov kernels

i. Overview

A kernel `K : α → β` factors through a kernel `L : α → γ` when `K = κ ∘ₖ L` for some Markov kernel `κ : γ → β`. Factoring through is a preorder on kernels with a common source; the target spaces may differ. Relative to a measure `μ` on the source it suffices that the factorization holds at `μ`-almost every point, and on a countably generated target, kernels that agree almost everywhere on each measurable set agree almost everywhere. Two kernels have a common refinement when both factor through a third one.

ii. Key results

- `ProbabilityTheory.Kernel.FactorsThrough` : `K = κ ∘ₖ L` for a Markov kernel `κ`. - `ProbabilityTheory.Kernel.MutuallyFactor` : factoring in both directions. - `ProbabilityTheory.Kernel.FactorsThroughAE` : factoring at almost every point. - `ProbabilityTheory.Kernel.ae_eq_of_forall_ae_apply_eq` : on a countably generated target, kernels that agree almost everywhere on each measurable set agree almost everywhere. - `ProbabilityTheory.Kernel.HaveCommonRefinement` : both kernels factor through a third one.

iii. Table of contents

  • A. Factorization
  • B. Mutual factorization
  • C. Factorization almost everywhere
  • D. Mutual factorization almost everywhere
  • E. Kernels equal almost everywhere
  • F. Common refinements

A. Factorization

B. Mutual factorization

C. Factorization almost everywhere

D. Mutual factorization almost everywhere

E. Kernels equal almost everywhere

F. Common refinements

25 declarations

definition

KK factors through LL

A kernel K:α→βK: \alpha \to \beta factors through a kernel L:α→γL: \alpha \to \gamma if there exists a Markov kernel κ:γ→β\kappa: \gamma \to \beta such that KK is the composition of κ\kappa and LL, denoted as K=κ∘kLK = \kappa \circ_k L.

theorem

KK factors through KK

For any kernel K:α→βK: \alpha \to \beta, KK factors through itself. That is, there exists a Markov kernel κ:β→β\kappa: \beta \to \beta such that K=κ∘kKK = \kappa \circ_k K, where ∘k\circ_k denotes the composition of kernels.

theorem

Kernel Factorization is Transitive

Let K:α→βK: \alpha \to \beta, L:α→γL: \alpha \to \gamma, and M:α→δM: \alpha \to \delta be kernels. If KK factors through LL (meaning there exists a Markov kernel κ1\kappa_1 such that K=κ1∘kLK = \kappa_1 \circ_k L) and LL factors through MM (meaning there exists a Markov kernel κ2\kappa_2 such that L=κ2∘kML = \kappa_2 \circ_k M), then KK factors through MM.

theorem

If KK factors through LL, then K(a)=(L(a)).bind κK(a) = (L(a)).\text{bind } \kappa for some Markov kernel κ\kappa

Let K:α→βK: \alpha \to \beta and L:α→γL: \alpha \to \gamma be kernels. If KK factors through LL, then for any a∈αa \in \alpha, there exists a Markov kernel κ:γ→β\kappa: \gamma \to \beta such that the measure K(a)K(a) is the bind of the measure L(a)L(a) with κ\kappa, i.e., K(a)=(L(a)).bind κK(a) = (L(a)).\text{bind } \kappa.

theorem

A constant probability kernel factors through any Markov kernel

Let α,β,\alpha, \beta, and γ\gamma be measurable spaces. Let K:α→γK : \alpha \to \gamma be a Markov kernel and let μ\mu be a probability measure on β\beta. Then the constant kernel from α\alpha to β\beta defined by μ\mu factors through KK. That is, there exists a Markov kernel κ:γ→β\kappa : \gamma \to \beta such that the constant kernel Cμ:α→βC_\mu : \alpha \to \beta (where Cμ(a)=μC_\mu(a) = \mu for all a∈αa \in \alpha) satisfies Cμ=κ∘kKC_\mu = \kappa \circ_k K.

definition

KK and LL factor through each other

Two kernels K:α→βK: \alpha \to \beta and L:α→γL: \alpha \to \gamma mutually factor through each other if KK factors through LL and LL factors through KK. This means there exists a Markov kernel κ:γ→β\kappa: \gamma \to \beta such that K=κ∘kLK = \kappa \circ_k L, and there exists a Markov kernel κ′:β→γ\kappa': \beta \to \gamma such that L=κ′∘kKL = \kappa' \circ_k K.

theorem

KK mutually factors with itself

For any kernel KK from a measurable space α\alpha to a measurable space β\beta, KK mutually factors with itself.

theorem

Mutual Factorization of Kernels is Symmetric

Let KK be a Markov kernel from α\alpha to β\beta and LL be a Markov kernel from α\alpha to γ\gamma. If KK and LL mutually factor through each other, then LL and KK mutually factor through each other.

theorem

Mutual factorization of kernels is transitive

Let α,β,γ,\alpha, \beta, \gamma, and δ\delta be measurable spaces. Let K:α→β,L:α→γ,K: \alpha \to \beta, L: \alpha \to \gamma, and M:α→δM: \alpha \to \delta be kernels. If KK and LL mutually factor through each other, and LL and MM mutually factor through each other, then KK and MM mutually factor through each other. (Note: Two kernels KK and LL mutually factor through each other if there exist Markov kernels κ\kappa and κ′\kappa' such that K=κ∘kLK = \kappa \circ_k L and L=κ′∘kKL = \kappa' \circ_k K).

definition

KK factors through LL μ\mu-a.e.

Let μ\mu be a measure on a measurable space α\alpha. For kernels K:α→βK: \alpha \to \beta and L:α→γL: \alpha \to \gamma, we say KK **factors through** LL **almost everywhere** with respect to μ\mu if there exists a Markov kernel κ:γ→β\kappa: \gamma \to \beta such that the equality K=κ∘kLK = \kappa \circ_k L holds for μ\mu-almost every point in α\alpha, where ∘k\circ_k denotes the composition of kernels.

theorem

If KK factors through LL, then KK factors through LL μ\mu-a.e.

Let α,β,\alpha, \beta, and γ\gamma be measurable spaces, and let μ\mu be a measure on α\alpha. For kernels K:α→βK: \alpha \to \beta and L:α→γL: \alpha \to \gamma, if KK factors through LL (meaning there exists a Markov kernel κ:γ→β\kappa: \gamma \to \beta such that K=κ∘kLK = \kappa \circ_k L), then KK factors through LL μ\mu-almost everywhere.

theorem

KK factors through itself μ\mu-a.e.

Let μ\mu be a measure on a measurable space α\alpha. For any kernel K:α→βK : \alpha \to \beta, it holds that KK factors through itself μ\mu-almost everywhere.

theorem

Transitivity of Factorization of Kernels μ\mu-a.e.

Let μ\mu be a measure on a measurable space α\alpha. Let K:α→βK: \alpha \to \beta, L:α→γL: \alpha \to \gamma, and M:α→δM: \alpha \to \delta be kernels. If KK factors through LL μ\mu-almost everywhere and LL factors through MM μ\mu-almost everywhere, then KK factors through MM μ\mu-almost everywhere. (Note: A kernel KK factors through LL μ\mu-almost everywhere if there exists a Markov kernel κ\kappa such that K=κ∘kLK = \kappa \circ_k L for μ\mu-almost every point in α\alpha, where ∘k\circ_k denotes the composition of kernels.)

definition

KK and LL mutually factor μ\mu-a.e.

Let μ\mu be a measure on a measurable space α\alpha. Two kernels K:α→βK: \alpha \to \beta and L:α→γL: \alpha \to \gamma **mutually factor almost everywhere** with respect to μ\mu if KK factors through LL μ\mu-almost everywhere and LL factors through KK μ\mu-almost everywhere. This means there exist Markov kernels κ1:γ→β\kappa_1: \gamma \to \beta and κ2:β→γ\kappa_2: \beta \to \gamma such that the equalities K=κ1∘kLK = \kappa_1 \circ_k L and L=κ2∘kKL = \kappa_2 \circ_k K hold for μ\mu-almost every point in α\alpha, where ∘k\circ_k denotes the composition of kernels.

theorem

Reflexivity of Mutual Factorization of Kernels μ\mu-a.e.

Let μ\mu be a measure on a measurable space α\alpha. For any kernel K:α→βK: \alpha \to \beta, the kernel KK mutually factors with itself μ\mu-almost everywhere.

theorem

Mutual Factorization μ\mu-a.e. is Symmetric

Let μ\mu be a measure on a measurable space α\alpha. For any two kernels K:α→βK: \alpha \to \beta and L:α→γL: \alpha \to \gamma, if KK and LL mutually factor μ\mu-almost everywhere, then LL and KK mutually factor μ\mu-almost everywhere.

theorem

Mutual factorization of kernels μ\mu-a.e. is transitive

Let μ\mu be a measure on a measurable space α\alpha. Let K:α→βK: \alpha \to \beta, L:α→γL: \alpha \to \gamma, and M:α→δM: \alpha \to \delta be kernels. If KK and LL mutually factor μ\mu-almost everywhere, and LL and MM mutually factor μ\mu-almost everywhere, then KK and MM mutually factor μ\mu-almost everywhere. (Two kernels KK and LL mutually factor μ\mu-almost everywhere if there exist Markov kernels κ1\kappa_1 and κ2\kappa_2 such that K=κ1∘kLK = \kappa_1 \circ_k L and L=κ2∘kKL = \kappa_2 \circ_k K hold for μ\mu-almost every point in α\alpha, where ∘k\circ_k denotes the composition of kernels.)

theorem

K=LK = L μ\mu-a.e. implies mutual factorization μ\mu-a.e.

Let μ\mu be a measure on a measurable space α\alpha, and let K,L:α→βK, L : \alpha \to \beta be two kernels. If KK and LL are equal μ\mu-almost everywhere (K=LK = L μ\mu-a.e.), then they mutually factor μ\mu-almost everywhere. That is, there exist Markov kernels κ1,κ2:β→β\kappa_1, \kappa_2 : \beta \to \beta such that the compositions K=κ1∘kLK = \kappa_1 \circ_k L and L=κ2∘kKL = \kappa_2 \circ_k K hold for μ\mu-almost every x∈αx \in \alpha.

theorem

K=LK = L a.e. if K(x,s)=L(x,s)K(x, s) = L(x, s) a.e. for all measurable ss

Let α\alpha be a measurable space and β\beta be a countably generated measurable space. Let μ\mu be a measure on α\alpha, and let K,L:α→βK, L : \alpha \to \beta be kernels where KK is a finite kernel. If for every measurable set s⊆βs \subseteq \beta, the measures assigned to ss satisfy K(x,s)=L(x,s)K(x, s) = L(x, s) for μ\mu-almost every x∈αx \in \alpha, then KK and LL are equal μ\mu-almost everywhere (i.e., K(x,⋅)=L(x,⋅)K(x, \cdot) = L(x, \cdot) as measures for μ\mu-almost every xx).

definition

Common refinement of kernels KK and LL

Two kernels K:α→βK: \alpha \to \beta and L:α→γL: \alpha \to \gamma have a **common refinement** if there exists a measurable space Ω\Omega and a kernel G:α→ΩG: \alpha \to \Omega such that both KK and LL factor through GG. This means there exist Markov kernels κ1:Ω→β\kappa_1: \Omega \to \beta and κ2:Ω→γ\kappa_2: \Omega \to \gamma such that the compositions satisfy K=κ1∘kGK = \kappa_1 \circ_k G and L=κ2∘kGL = \kappa_2 \circ_k G.

theorem

Common refinement of kernels is reflexive

Let α\alpha and β\beta be measurable spaces. For any kernel K:α→βK : \alpha \to \beta, KK and KK have a common refinement. That is, there exists a measurable space Ω\Omega, a kernel G:α→ΩG : \alpha \to \Omega, and Markov kernels κ1,κ2:Ω→β\kappa_1, \kappa_2 : \Omega \to \beta such that K=κ1∘kGK = \kappa_1 \circ_k G and K=κ2∘kGK = \kappa_2 \circ_k G.

theorem

Symmetry of Common Refinement for Kernels

Let K:α→βK: \alpha \to \beta and L:α→γL: \alpha \to \gamma be kernels. If KK and LL have a common refinement, then LL and KK also have a common refinement. Two kernels have a common refinement if there exists a kernel G:α→ΩG: \alpha \to \Omega such that both KK and LL factor through GG.

theorem

Common Refinement of Kernels is Monotone under Factorization

Let K:α→βK: \alpha \to \beta, L:α→γL: \alpha \to \gamma, K′:α→δK': \alpha \to \delta, and L′:α→ϵL': \alpha \to \epsilon be kernels. If KK and LL have a common refinement, and K′K' factors through KK and L′L' factors through LL, then K′K' and L′L' also have a common refinement.

theorem

If KK factors through LL, then KK and LL have a common refinement

Let K:α→βK: \alpha \to \beta and L:α→γL: \alpha \to \gamma be kernels. If KK factors through LL, meaning there exists a Markov kernel κ:γ→β\kappa: \gamma \to \beta such that K=κ∘kLK = \kappa \circ_k L, then KK and LL have a common refinement (i.e., there exists a kernel through which both KK and LL factor).

theorem

LL factors through K  ⟹  K \implies KK and LL have a common refinement

Let K:α→βK: \alpha \to \beta and L:α→γL: \alpha \to \gamma be kernels. If LL factors through KK, then KK and LL have a common refinement.