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
factors through
A kernel factors through a kernel if there exists a Markov kernel such that is the composition of and , denoted as .
factors through
For any kernel , factors through itself. That is, there exists a Markov kernel such that , where denotes the composition of kernels.
Kernel Factorization is Transitive
Let , , and be kernels. If factors through (meaning there exists a Markov kernel such that ) and factors through (meaning there exists a Markov kernel such that ), then factors through .
If factors through , then for some Markov kernel
Let and be kernels. If factors through , then for any , there exists a Markov kernel such that the measure is the bind of the measure with , i.e., .
A constant probability kernel factors through any Markov kernel
Let and be measurable spaces. Let be a Markov kernel and let be a probability measure on . Then the constant kernel from to defined by factors through . That is, there exists a Markov kernel such that the constant kernel (where for all ) satisfies .
and factor through each other
Two kernels and mutually factor through each other if factors through and factors through . This means there exists a Markov kernel such that , and there exists a Markov kernel such that .
mutually factors with itself
For any kernel from a measurable space to a measurable space , mutually factors with itself.
Mutual Factorization of Kernels is Symmetric
Let be a Markov kernel from to and be a Markov kernel from to . If and mutually factor through each other, then and mutually factor through each other.
Mutual factorization of kernels is transitive
Let and be measurable spaces. Let and be kernels. If and mutually factor through each other, and and mutually factor through each other, then and mutually factor through each other. (Note: Two kernels and mutually factor through each other if there exist Markov kernels and such that and ).
factors through -a.e.
Let be a measure on a measurable space . For kernels and , we say **factors through** **almost everywhere** with respect to if there exists a Markov kernel such that the equality holds for -almost every point in , where denotes the composition of kernels.
If factors through , then factors through -a.e.
Let and be measurable spaces, and let be a measure on . For kernels and , if factors through (meaning there exists a Markov kernel such that ), then factors through -almost everywhere.
factors through itself -a.e.
Let be a measure on a measurable space . For any kernel , it holds that factors through itself -almost everywhere.
Transitivity of Factorization of Kernels -a.e.
Let be a measure on a measurable space . Let , , and be kernels. If factors through -almost everywhere and factors through -almost everywhere, then factors through -almost everywhere. (Note: A kernel factors through -almost everywhere if there exists a Markov kernel such that for -almost every point in , where denotes the composition of kernels.)
and mutually factor -a.e.
Let be a measure on a measurable space . Two kernels and **mutually factor almost everywhere** with respect to if factors through -almost everywhere and factors through -almost everywhere. This means there exist Markov kernels and such that the equalities and hold for -almost every point in , where denotes the composition of kernels.
Reflexivity of Mutual Factorization of Kernels -a.e.
Let be a measure on a measurable space . For any kernel , the kernel mutually factors with itself -almost everywhere.
Mutual Factorization -a.e. is Symmetric
Let be a measure on a measurable space . For any two kernels and , if and mutually factor -almost everywhere, then and mutually factor -almost everywhere.
Mutual factorization of kernels -a.e. is transitive
Let be a measure on a measurable space . Let , , and be kernels. If and mutually factor -almost everywhere, and and mutually factor -almost everywhere, then and mutually factor -almost everywhere. (Two kernels and mutually factor -almost everywhere if there exist Markov kernels and such that and hold for -almost every point in , where denotes the composition of kernels.)
-a.e. implies mutual factorization -a.e.
Let be a measure on a measurable space , and let be two kernels. If and are equal -almost everywhere ( -a.e.), then they mutually factor -almost everywhere. That is, there exist Markov kernels such that the compositions and hold for -almost every .
a.e. if a.e. for all measurable
Let be a measurable space and be a countably generated measurable space. Let be a measure on , and let be kernels where is a finite kernel. If for every measurable set , the measures assigned to satisfy for -almost every , then and are equal -almost everywhere (i.e., as measures for -almost every ).
Common refinement of kernels and
Two kernels and have a **common refinement** if there exists a measurable space and a kernel such that both and factor through . This means there exist Markov kernels and such that the compositions satisfy and .
Common refinement of kernels is reflexive
Let and be measurable spaces. For any kernel , and have a common refinement. That is, there exists a measurable space , a kernel , and Markov kernels such that and .
Symmetry of Common Refinement for Kernels
Let and be kernels. If and have a common refinement, then and also have a common refinement. Two kernels have a common refinement if there exists a kernel such that both and factor through .
Common Refinement of Kernels is Monotone under Factorization
Let , , , and be kernels. If and have a common refinement, and factors through and factors through , then and also have a common refinement.
If factors through , then and have a common refinement
Let and be kernels. If factors through , meaning there exists a Markov kernel such that , then and have a common refinement (i.e., there exists a kernel through which both and factor).
factors through and have a common refinement
Let and be kernels. If factors through , then and have a common refinement.
