Disintegration Theorem for Markov Kernels
- Disintegration Theorem for Markov Kernels is a factorization principle that decomposes a joint measure into a marginal measure and a conditional kernel.
- It formalizes regular conditional probabilities by establishing measurable constructions in standard Borel spaces and computable analysis frameworks.
- Extensions in geometric, optimal transport, and proof assistant contexts ensure almost-everywhere uniqueness and continuous variants of the conditional laws.
The disintegration theorem for Markov kernels is the statement that a joint measure or joint kernel can be decomposed into a marginal object and a conditional kernel. In kernel notation, for a finite kernel , one seeks a kernel such that ; in the equivalent measure-theoretic formulation, a measure together with a measurable map is represented as with and the conditional measures concentrated on the fibers (Degenne, 5 Oct 2025). In contemporary work, this theorem underlies regular conditional distributions, posterior kernels, conditional expectation kernels, formalized probability theory, and several geometric and computability-theoretic refinements of conditioning (Possobon et al., 2022).
1. Kernel-theoretic formulation
A Markov kernel is a measurable family of probability measures. In the Mathlib formalization, a kernel from a measurable space to a measurable space 0 is literally a measurable function
1
where measurability means that for every measurable set 2, the map 3 is measurable; a Markov kernel is then a kernel for which each 4 is a probability measure (Degenne, 5 Oct 2025).
Within that language, disintegration is the kernel-level version of the probabilistic factorization
5
The formal theorem described in Mathlib states that if 6 is a standard Borel space and either 7 is countable or 8 has a countably generated 9-algebra, then every finite kernel
0
admits a disintegration. Informally, there exists a conditional kernel
1
such that 2 (Degenne, 5 Oct 2025).
This formulation packages conditioning as an equality of kernels rather than as an almost-everywhere identity for random variables. A plausible implication is that the theorem is best understood not merely as a construction of regular conditional probabilities, but as a structural factorization principle for stochastic morphisms.
2. Measure disintegration, fibers, and regular conditional laws
A classical measure-space version is given in the transport-geometric setting of locally compact and separable metric spaces. If 3 and 4 are locally compact and separable metric spaces, 5 is a Borel map, and 6 is a positive finite Radon measure with 7, then there exist measures 8 such that 9 is a Borel map, 0 for 1-a.e. 2, the measure 3 disintegrates as
4
and 5 is concentrated on the fiber 6 for 7-a.e. 8 (Possobon et al., 2022).
The equivalent integral form is
9
for 0, and then by extension for Borel sets and Borel functions (Possobon et al., 2022). In this setting, the family 1 is exactly a regular conditional probability kernel: for each 2, 3 is a probability measure; for each Borel set 4, the map 5 is measurable; and the original measure is recovered by integration against 6 (Possobon et al., 2022).
A 2011 abstract-level contribution described a new approach to disintegration of measures that allows one to drop the usually taken separability assumption, using a result on fibers in the spectrum of algebra of essentially bounded functions as its main tool (Kosiek et al., 2011). Since only the abstract-level statement is available there, the precise kernel-theoretic form is not specified in that source summary. This suggests a nonseparable extension of the standard separable or standard Borel paradigms emphasized in later accounts.
3. Existence hypotheses, uniqueness, and canonicality
The cited literature does not treat arbitrary measurable spaces uniformly. In the Mathlib formalization, the disintegration theorem is stated under the hypotheses that 7 is standard Borel and that either 8 is countable or 9 has a countably generated 0-algebra; these are described as exactly the assumptions that make the measurable selection and density construction work in the formal proof (Degenne, 5 Oct 2025). In the transport-geometric theorem, the ambient spaces are locally compact and separable metric spaces and the base measure is a positive finite Radon measure (Possobon et al., 2022). In the computable-analysis treatment, the setting is complete separable metric spaces along a projection map (Ackerman et al., 2015).
Uniqueness is typically only almost-everywhere. The Mathlib account stresses that conditional kernels are almost everywhere equal to a Markov kernel and almost everywhere unique; moreover, if 1 disintegrates 2 and 3 is equal to 4 almost everywhere with respect to 5, then 6 also disintegrates 7 (Degenne, 5 Oct 2025). In the geometric formulation, a uniqueness proposition states that if
8
then the family 9 is unique 0-a.e. (Possobon et al., 2022).
A stronger form of canonicity appears when disintegrations are continuous. On the domain of measures admitting a continuous disintegration along the projection 1 and whose marginal 2 has full support, the disintegration is necessarily unique. The same work relates this to Tjur’s pointwise notion of conditioning: under mild assumptions, the existence of a continuous disintegration on a measure-one set is equivalent to every point in that set being a Tjur point (Ackerman et al., 2015).
When continuous disintegration fails, pointwise conditioning can still be recovered from a Vitali basis. The Fraser–Naderi construction defines
3
for sequences 4 converging regularly to 5, and yields a measurable disintegration satisfying the correct integral identity. However, the resulting pointwise version may depend on the chosen class 6 (Ackerman et al., 2015). A common misconception is that disintegration always yields a canonical pointwise conditional law; the literature instead separates almost-everywhere uniqueness, continuous uniqueness, and basis-dependent pointwise realizations.
4. Formalization in proof assistants and proof architecture
The theorem has been formalized in Lean within Mathlib’s probability library, specifically in
7
where disintegration is expressed as an equality between kernels rather than as an external existence statement (Degenne, 5 Oct 2025). The library treats kernels as first-class objects, and this design is presented as central rather than auxiliary.
The formal proof proceeds through several intermediate kernel constructions. First, densities for finite kernels are built in a jointly measurable form,
8
so that
9
Second, a Radon–Nikodym theorem for kernels constructs a jointly measurable derivative
0
together with a singular remainder. Third, for 1, a conditional CDF is built and converted into a kernel using Stieltjes measures. Fourth, the standard Borel case is reduced to the real-valued case by measurable embedding into 2 (Degenne, 5 Oct 2025).
This formalization is not isolated from downstream probability theory. It is used to define conditional distributions of random variables, posterior distributions, and conditional expectation kernels. For random variables 3 and 4 with 5 standard Borel, disintegration yields a kernel 6 such that
7
Given a prior measure 8 on 9 and a kernel 0, disintegrating the swapped joint law defines a posterior kernel 1 satisfying
2
5. Geometric and computational perspectives
One contemporary line of work interprets disintegration through optimal transport. For a transport plan 3 with marginals 4 and 5, one may disintegrate
6
and regard the conditional family as a disintegration map
7
or, in product settings,
8
In the Monge case, if 9 is a transport map, the disintegration map is 0 (Possobon et al., 2022).
This geometric perspective yields regularity statements beyond bare existence. If 1, then the disintegration map is nearly weakly continuous; if 2 is bijective and continuous, the conditional measures become Dirac masses,
3
and the map is weakly continuous; in the metric measure foliation setting, the identity
4
makes the disintegration map an isometry, hence weakly continuous (Possobon et al., 2022). The same paper proves a rigidity theorem asserting that absolute continuity can propagate along Wasserstein paths of fiber measures when the disintegration map is weakly continuous and the stated geometric hypotheses hold (Possobon et al., 2022).
A different refinement studies disintegration as a computational operator. On the domain of measures with a unique continuous disintegration, the disintegration operator
5
is strongly Weihrauch equivalent to the limit operator,
6
The lower bound is obtained by encoding an arbitrary element of 7 into a computable measure whose unique continuous disintegration reveals that element, while the upper bound computes a continuous disintegration via a single limit procedure using a 8-continuous basis and the Tjur property (Ackerman et al., 2015). In the noncontinuous case, if a Vitali basis is computable, the induced pointwise disintegration remains strongly Weihrauch reducible to 9 (Ackerman et al., 2015). This establishes that conditioning is, in general, not computable, even when existence is secured.
6. Related kernel constructions and conceptual boundaries
Disintegration also appears in higher-order kernel constructions where the conditioned objects are themselves kernels. One formulation defines the conditional distribution of a Markov kernel 00 given another kernel 01 as a kernel
02
such that
03
for every 04 and 05. Existence is stated under standard regularity assumptions, for example when the relevant measurable spaces are standard Borel (Nogales et al., 2017). In that framework, conditional independence of kernels is defined by factorization of a conditional joint kernel, and a main theorem states that under 06, unconditional independence of 07 and 08 is equivalent to independence of the conditional kernels 09 and 10 (Nogales et al., 2017).
A related but narrower development studies conditional expectation for Markov kernels. There the conditional expectation of an integrable kernel 11 given another kernel 12 is defined via the Radon–Nikodym derivative
13
and the main theorem proves the invariance identity
14
under the independence assumption
15
That work explicitly does not claim a general disintegration theorem with existence and uniqueness of regular conditional probabilities; rather, it proves a conditional-expectation identity inside a kernel framework (Nogales, 2020).
Disintegration-style reasoning also appears in the theory of invariant measures for Markov kernels. A recent uniqueness result on standard Borel spaces reduces multiplicity of invariant probability measures to a measurable decomposition into disjoint absorbing sets, using the mutual singularity of distinct invariant ergodic measures and an ergodic-decomposition argument (Attali, 8 Jan 2026). This suggests that disintegration is not only a theorem about conditional laws, but also a recurrent structural pattern in the analysis of kernels: measures are decomposed into components, and qualitative properties are recovered from the behavior of those components.
Across these developments, the central content of the disintegration theorem remains stable. It asserts that a joint probabilistic object can be reconstructed from a marginal and a conditional kernel, but the surrounding theory varies according to the regularity sought: almost-everywhere existence, continuous versions, formalized equality of kernels, Wasserstein continuity, posterior inversion, or computability bounds.