Kernels to countable types #
In the algorithms of the paper, the indices of the particles, which take finitely many values, are
drawn from probabilities which are measurable functions of the particle positions. Two kernels are
defined here: the kernel kernelOfMassFn f from a measurable space α to a countable type β,
with mass f a b at b, that is, with density f a with respect to the counting measure, and the
kernel kernelOfSections κ on α × β, for a countable β, whose section at b is the kernel
κ b.
For a measurable mass function, kernelOfMassFn f is a Markov kernel if the masses sum to one.
The kernel kernelOfSections κ is s-finite (an instance) or Markov if its sections are.
The kernel from α to a countable type β with mass f a b at b, that is, with density
f a with respect to the counting measure. It is the zero kernel if f is not measurable.
Equations
- CSMC.kernelOfMassFn f = (ProbabilityTheory.Kernel.const α MeasureTheory.Measure.count).withDensity fun (a : α) (b : β) => ↑(f a b)
Instances For
The kernel kernelOfMassFn f is s-finite.
The kernel on α × β, for a countable β, whose section at b is the kernel κ b:
(a, b) ↦ κ b a.
Equations
- CSMC.kernelOfSections κ = { toFun := fun (ab : α × β) => (κ ab.2) ab.1, measurable' := ⋯ }
Instances For
The section of kernelOfSections κ at (a, b) is κ b a.
If f a b is measurable in a for every b, then kernelOfMassFn f a {b} = f a b.
If f a b is measurable in a for every b, integrals with respect to kernelOfMassFn f a
are sums weighted by f a.
If f a b is measurable in a for every b and the masses f a b sum to one over the finite
type β, then kernelOfMassFn f is a Markov kernel.
The kernel whose sections are s-finite kernels is s-finite.
The kernel whose sections are Markov kernels is a Markov kernel.