Markov Kernels: Foundations & Applications

• Markov kernels are measurable families of probability measures that encode stochastic transitions between spaces and serve as the foundation for conditional laws and posterior distributions.
• They facilitate the transformation of local similarity measures on manifolds into discrete Markov operators, bridging the gap between continuous dynamics and data-driven diffusion processes.
• Their unified framework supports diverse applications in stochastic modeling, optimization, and control by providing a common measure-theoretic language for probabilistic systems.

Markov kernels are measurable families of probability measures that encode stochastic transitions between measurable spaces: a kernel $K:(X,\mathfrak M)\to(Y,\mathfrak N)$ assigns to each $x\in X$ a probability law $K(x,\cdot)$ on $Y$, with $x\mapsto K(x,B)$ measurable for every $B\in\mathfrak N$. In contemporary research, this notion functions both as the basic language of stochastic dynamics and as an organizing abstraction for conditional laws, posterior distributions, optimal transport mechanisms, learned transition models, and manifold-based diffusion operators. The term is nonetheless context-sensitive: some nearby literatures use “kernel” for covariance kernels of Gaussian Markov processes or Martin kernels in potential theory, which are not transition kernels in the measure-theoretic sense (Ronan, 2022, Fendick, 2015, Juszczyszyn et al., 2015).

1. Measure-theoretic foundations

In the standard measurable-space formulation, a transition kernel is a map

$K:X\times \mathfrak N\to [0,\infty]$

such that for every $B\in\mathfrak N$, $x\mapsto K(x,B)$ is $\mathfrak M$-measurable, and for every $x\in X$0, $x\in X$1 is a measure on $x\in X$2. If that measure is a probability measure for every $x\in X$3, $x\in X$4 is a stochastic kernel or Markov kernel. The standard induced actions are

$x\in X$5

and the joint measure generated by $x\in X$6 and $x\in X$7 is

$x\in X$8

This is the basic calculus behind kernels as randomized maps (Ronan, 2022).

A measurable function $x\in X$9 defines a deterministic kernel $K(x,\cdot)$0. From this perspective, kernels strictly extend ordinary functions. Mathlib’s probability library makes this extension explicit by treating a kernel $K(x,\cdot)$1 as a measurable map from $K(x,\cdot)$2 into the measurable space of measures on $K(x,\cdot)$3. In that setting, deterministic kernels include the identity kernel $K(x,\cdot)$4, the copy kernel $K(x,\cdot)$5, the discard kernel to the one-point space, and constant kernels. Composition is defined by

$K(x,\cdot)$6

and is associative; parallel composition, product kernels, and composition-products formalize independent and sequential sampling patterns at the kernel level (Degenne, 5 Oct 2025).

This measure-theoretic viewpoint is the common substrate beneath otherwise disparate uses of kernels. It permits one to treat random transitions, conditional laws, posterior updates, and stochastic programs in a uniform language without collapsing everything to a single ambient probability space.

2. Transition kernels as generators and geometric operators

A major extension of the classical transition-kernel viewpoint appears in the theory of local kernels on sampled manifolds. For a compact smooth manifold $K(x,\cdot)$7, Berry and Sauer consider localized similarity kernels $K(x,\cdot)$8 whose mass is exponentially concentrated in an $K(x,\cdot)$9-neighborhood of $Y$0. After appropriate normalization, such kernels become discrete Markov transition operators on data, and their infinitesimal limits recover continuous generators on $Y$1 (Berry et al., 2014).

The central asymptotic object is

$Y$2

Its expansion has the form

$Y$3

for skew-free kernels. Since $Y$4, dividing by $Y$5 removes the mass term $Y$6 and the localization bias $Y$7. The normalized operator

$Y$8

then converges to $Y$9. On data, this normalization is the step that turns a nonnegative similarity matrix into a row-stochastic matrix, hence into a discrete Markov kernel.

The limiting differential operator is determined by the first two local moments of the kernel. In the nonsymmetric case, the induced generator is the Itô diffusion generator

$x\mapsto K(x,B)$0

with adjoint

$x\mapsto K(x,B)$1

Thus the first moment yields the drift $x\mapsto K(x,B)$2, and the second moment yields the diffusion tensor $x\mapsto K(x,B)$3. A prototypical anisotropic kernel

$x\mapsto K(x,B)$4

therefore realizes prescribed drift and diffusion after normalization.

In the symmetric case, the same construction becomes geometric. The covariance structure modifies the ambient metric $x\mapsto K(x,B)$5 to

$x\mapsto K(x,B)$6

and the normalized symmetric operator converges to a weighted Laplace-Beltrami-type operator for $x\mapsto K(x,B)$7, not necessarily for the ambient-induced geometry. Standard diffusion maps reappear as the isotropic, drift-free special case. In this sense, a normalized local kernel is simultaneously a discrete Markov kernel and a data-driven approximation to a diffusion generator, while anisotropy in the kernel encodes a chosen Riemannian geometry (Berry et al., 2014).

3. Reversibility, conditioning, and optimality

For a probability measure $x\mapsto K(x,B)$8, a kernel $x\mapsto K(x,B)$9 is $B\in\mathfrak N$0-reversible if

$B\in\mathfrak N$1

A structural representation of this symmetry is developed through random update maps $B\in\mathfrak N$2. If $B\in\mathfrak N$3 for $B\in\mathfrak N$4, and $B\in\mathfrak N$5 satisfies symmetry and uniqueness conditions on its accessible set, then one can construct a canonical involutive augmentation $B\in\mathfrak N$6 on $B\in\mathfrak N$7. Under those conditions, invariance of $B\in\mathfrak N$8 under $B\in\mathfrak N$9 is equivalent to $K:X\times \mathfrak N\to [0,\infty]$0-reversibility of $K:X\times \mathfrak N\to [0,\infty]$1. This yields a product-space interpretation of detailed balance as invariance under an involution on state-plus-noise space (Piccioni et al., 2024).

Conditioning theory is likewise kernel-theoretic. In Mathlib, a kernel $K:X\times \mathfrak N\to [0,\infty]$2 is disintegrated by $K:X\times \mathfrak N\to [0,\infty]$3 if

$K:X\times \mathfrak N\to [0,\infty]$4

Under standard Borel and countability hypotheses, every finite kernel admits such a disintegration. This makes conditional distributions, posterior kernels, and kernel-valued conditional expectations first-class objects. Posterior kernels arise by disintegrating a swapped joint law: $K:X\times \mathfrak N\to [0,\infty]$5 The same framework unifies ordinary independence and conditional independence by interpreting both as factorization properties relative to a kernel and a measure, rather than relative to a single probability measure alone (Degenne, 5 Oct 2025).

A separate extension treats conditional expectation of one kernel given another. If $K:X\times \mathfrak N\to [0,\infty]$6 is $K:X\times \mathfrak N\to [0,\infty]$7-integrable and $K:X\times \mathfrak N\to [0,\infty]$8 is another kernel, the conditional expectation is defined by

$K:X\times \mathfrak N\to [0,\infty]$9

This recovers ordinary conditional expectation for degenerate kernels induced by random variables. Moreover, if $B\in\mathfrak N$0 is independent of the pair kernel $B\in\mathfrak N$1, then

$B\in\mathfrak N$2

which is the kernel analogue of the classical rule that extra independent information does not change conditional expectation (Nogales, 2020).

Optimization theory adds a further distinction. In Belavkin’s convex-dual framework, strict convexity of the dual information functional forces optimal measures to be mutually absolutely continuous. Applied to joint measures on $B\in\mathfrak N$3, this yields a strict separation between deterministic and nondeterministic Markov transition kernels: under an active information/resource constraint, deterministic kernels are strictly suboptimal unless the information resource is unconstrained (Belavkin, 2010).

4. Terminological variants and neighboring kernel notions

The word “kernel” is not used uniformly across probability, analysis, and data science. Several technically important objects are adjacent to Markov kernels without being transition kernels themselves.

Usage	Representative object	Relation to transition kernels
Markov transition kernel	$B\in\mathfrak N$4 or $B\in\mathfrak N$5	Canonical measurable family of probability laws
Covariance kernel	$B\in\mathfrak N$6	Encodes Gaussian Markov structure, but is not a transition kernel
Martin kernel	$B\in\mathfrak N$7	Boundary kernel in potential theory, not a transition law
Local similarity kernel	$B\in\mathfrak N$8 on data	Becomes Markovian only after normalization

In Gaussian process theory, a covariance kernel may characterize the Markov property. In particular, for sufficiently regular Gaussian processes with stationary increments, the kernel

$B\in\mathfrak N$9

is necessary and sufficient for stationary increments plus the Markov property. Nevertheless, this object is a covariance function, not a transition kernel; its role is to encode finite-dimensional distributions through second moments rather than to assign a conditional law $x\mapsto K(x,B)$0 (Fendick, 2015).

Potential theory uses “Martin kernel” differently. For a killed jump Markov process in a bounded domain $x\mapsto K(x,B)$1,

$x\mapsto K(x,B)$2

is a boundary object derived from Green functions. Under boundary Harnack and oscillation-reduction hypotheses, the Martin boundary coincides with the topological boundary, and nonnegative harmonic functions admit a Martin representation. Again, the kernel is not a stochastic transition rule; it is a normalized boundary limit of Green functions (Juszczyszyn et al., 2015).

A third source of confusion comes from data-analysis kernels. A raw local affinity $x\mapsto K(x,B)$3 is not itself Markovian. Only after normalization—typically row normalization or an empirical analogue thereof—does it become a row-stochastic matrix, hence a discrete Markov kernel. This distinction is conceptually central in kernel-based manifold learning (Berry et al., 2014).

5. Learning, approximation, and numerical metrics

Learning a transition kernel requires both expressive approximation and preservation of kernel validity. On finite binary spaces, a shallow stochastic feedforward network with one hidden layer can approximate any Markov kernel from $x\mapsto K(x,B)$4 to $x\mapsto K(x,B)$5. The main constructive width bound is

$x\mapsto K(x,B)$6

which suffices for universal approximation when both hidden and output layers are trainable. The network represents the kernel as a mixture over hidden states, with input-dependent product distributions at the hidden layer and stochastic output decoding (Montufar, 2015).

For MCMC, Ai-Sampler parameterizes reversible Metropolis–Hastings kernels by involutive neural maps. Given an involution $x\mapsto K(x,B)$7, the transition kernel has the form

$x\mapsto K(x,B)$8

with Jacobian-corrected density ratio

$x\mapsto K(x,B)$9

Using a reversible neural construction $\mathfrak M$0, the proposal is involutive by construction; detailed balance follows from the Metropolis correction, and the associated discriminator satisfies a $\mathfrak M$1-equivariance induced by the involution (Egorov et al., 2024).

A more recent statistical framework treats kernel learning as a contrastive estimation problem in an explicitly invertible coordinate system. The Doeblin-anchored chart

$\mathfrak M$2

mixes the target transition with a restart law $\mathfrak M$3. The anchored kernel is simultaneously a Doeblin-minorized Markov kernel, the positive conditional law in a binary contrastive experiment, and an invertible coordinate for the original kernel. The anchored contrastive risk identifies the anchored density, excess risk calibrates to density error, and a measurable Markovization operator restores kernel validity when inversion yields a signed or unnormalized object, preserving integrated $\mathfrak M$4 accuracy up to a factor $\mathfrak M$5. The same framework proves oracle inequalities, Hölder–ReLU approximation bounds, a geometrically $\mathfrak M$6-mixing extension, and finite-horizon perturbation bounds for marginals, path laws, and occupation measures (Xu, 1 Jun 2026).

For approximation and numerical analysis, the integrated transportation distance

$\mathfrak M$7

provides a kernel-level Wasserstein metric. It is a genuine metric on the corresponding quotient space, dominates the Wasserstein distances between induced joint and mixture laws, and metrizes the paper’s weak convergence topology on kernels. In forward–backward Markov systems, stagewise bounds on $\mathfrak M$8 propagate into explicit error bounds for recursively computed dynamic risk values, including stopping problems and coherent risk measures (Lin et al., 2023).

6. Extensions across transport, control, extremes, logic, and formalization

Markov kernels also serve as primary modeling objects outside classical stochastic-process theory. In optimal transport, a kernel $\mathfrak M$9 is called an optimal transport kernel for cost $x\in X$00 if, for $x\in X$01, the joint law $x\in X$02 is an optimal coupling between $x\in X$03 and $x\in X$04. This perspective emphasizes reusable transport mechanisms rather than single couplings, extends naturally to signed measures by keeping the kernel positive while allowing signed source measures, and leads to compatibility conditions based on $x\in X$05-cyclical monotonicity of supports (Ronan, 2022).

In stochastic control, an explicit sub-Markov kernel is derived for the linear time-varying diffusion

$x\in X$06

with quadratic killing rate $x\in X$07. The resulting Green’s function has the form

$x\in X$08

where $x\in X$09 is built from a Riccati flow, a modified state transition matrix, and a controllability Gramian. This kernel underlies exact propagation operators for dynamic Sinkhorn recursions in linear quadratic non-Gaussian Schrödinger bridge problems (Teter et al., 22 Apr 2025).

Extreme-value theory gives a different asymptotic role to kernels. For a Markov chain with transition kernel $x\in X$10, if

$x\in X$11

then the extreme-regime dynamics are captured by a tail kernel and a tail chain. In the conditional extreme value model, the regular conditional law

$x\in X$12

acts as the asymptotic conditional mechanism: combined with the domain of attraction of the conditioning variable $x\in X$13, kernel convergence yields vague convergence of normalized joint tail measures. Coherent asymptotics across levels $x\in X$14 force the normalization functions into extended regular variation and produce a generalized tail-kernel form for the limit family (Resnick et al., 2011, Resnick et al., 2012).

Markov kernels also support nontraditional semantics. In probabilistic fuzzy logic, a fuzzy predicate with confidence $x\in X$15 is represented by a kernel $x\in X$16 on the Boolean space $x\in X$17 via

$x\in X$18

Logical connectives are then pushforwards of joint kernels on products of Boolean spaces. This makes conjunction, disjunction, and implication depend on joint confidence functions rather than on marginal confidences alone, with the usual fuzzy connectives reappearing as extremal bounds or independence cases (Brussee, 2023).

Finally, formalized mathematics has turned kernels into a central software-level abstraction. In Mathlib, kernels organize conditional distributions, posterior distributions, independence, conditional independence, sub-Gaussianity, entropy, and Kullback–Leibler divergence. The disintegration theorem for kernels supplies the formal basis for conditional probability distributions, and composition-product identities make sequential stochastic constructions compositional at the library level (Degenne, 5 Oct 2025).

Markov kernels therefore occupy a dual position. They are, at once, the classical measurable objects that define stochastic transitions and a higher-level language in which geometric approximation, reversible dynamics, contrastive learning, transport, extremes, logical uncertainty, and formal verification can be expressed in a common syntax.