Regular Conditional Distributions of Correspondences
- The topic defines regular conditional distributions of correspondences as a generalization of classical conditional distributions to set-valued and random elements.
- It establishes key regularity properties—convexity, closedness, and compactness—through nowhere equivalence and extension of positive linear functionals.
- The framework is vital for applications in stochastic geometry, Bayesian games, and random closed sets, ensuring existence, uniqueness, and invariance in probabilistic models.
A regular conditional distribution of correspondences is a measure-theoretic and functional-analytic framework for describing distributions of random elements, sets, or processes where only partial information—such as prescribed expectations, moments, or marginal distributions of selected functionals—is specified. These objects generalize standard regular conditional distributions to set-valued correspondences and permit the analysis of existence, uniqueness, and structural properties (including symmetry and invariance) under minimal regularity constraints. The notion is fundamental in areas such as stochastic geometry, probabilistic modeling, Bayesian games, and mathematical economics, and is tightly connected to the theory of extensions of positive linear functionals, regularity moduli, and the interplay between measure-theoretic properties (notably, nowhere equivalence) and regularity features like convexity, compactness, and closed graph preservation.
1. Foundational Concepts
Central to the theory are measurable correspondences (assigning to almost every a nonempty subset ), sub--algebras , and , and regular conditional distributions (RCDs) arising via measurable selections . For each such , the RCD is defined, satisfying:
- For every , is a Borel probability measure on ;
- For all Borel sets , equals -conditional expectation of .
Associated sets of distributions include: and analogously, the set of RCDs given : These definitions generalize the notion of conditional expectation and probability kernel to the context of correspondences and set-valued maps.
2. Regularity Properties and Extension Theory
The core technical apparatus leverages the extension of positive linear functionals defined on subspaces of functions over a state-space to larger vector lattices , preserving positivity and upper semi-continuity (regularity). The fundamental extension result (a Kantorovich-type theorem) states: if majorizes (i.e., for , ), every positive on admits a positive extension to .
Regularity is further encoded via a "regularity modulus" , a lower semi-continuous function such that for all , the sublevel sets are relatively compact. The main existence theorem asserts the equivalence between the feasibility of a random element realizing the prescribed moments , with a bound , and the regularity condition: This decouples the realisability problem into positivity and regularity parts.
3. The Role of Nowhere Equivalence
A pivotal measure-theoretic condition underlying the regularity properties of RCDs of correspondences is nowhere equivalence between and . Formally, is nowhere equivalent to if every of positive measure contains a -measurable subset such that for all -measurable , . This feature is necessary and sufficient for convexity, closedness, compactness, and closed graph preservation of and , or for the purification property (i.e., existence of deterministic selections matching prescribed conditional distributions) (Otsuka, 19 Sep 2025).
Older results required to be countably generated and often imposed atomlessness (no atoms) on the base space; the nowhere equivalence framework removes these technical assumptions and yields a fully general characterization of the measure-theoretic underpinning of regularity.
4. Applications to Point Processes and Random Closed Sets
This machinery finds concrete implementation in stochastic geometry, notably in constructing point processes with given correlation measures or random closed sets with prescribed two-point covering or contact distributions (Lachieze-Rey et al., 2011):
- For point processes on locally compact spaces, quadratic polynomial functionals encode second-order structure. Existence of with and finiteness/local-exclusion properties (hard-core) is guaranteed by regularity moduli of the form
or more generally for monotone blowing up at $0$.
- For random closed sets , realization of finite-dimensional indicators (such as ) requires upper semi-continuity and regularity moduli ensuring that sublevel sets retain compactness, leading to closed realizations.
Verification typically relies on approximating via the test functions and separating the combinatorial positivity (e.g., positive-definiteness of kernels) from the analytic control of small-scale behavior.
5. Invariance and Symmetry Properties
Invariance under group actions plays a fundamental role. When both the function space and the linear functional are invariant under a group of transformations (e.g., translations or symmetry operations), the extension process ensures that the constructed random elements will also possess stationarity or invariance (distributional invariance under ) (Lachieze-Rey et al., 2011). Formally, if for all , , then can be chosen so that has the same law as .
Such symmetry constraints are crucial in the paper of spatial processes, random fields, and models in physics, image analysis, and econometrics, where invariance properties encode physical or economic homogeneity.
6. Connections to Bayesian Games and Large Game Equilibria
Regular conditional distributions of correspondences underpin existence results in economic models, especially Bayesian games and large games. In Bayesian games, regularity and convexity of conditional expectation correspondences with respect to inter-player informational structures are both necessary and sufficient for existence of pure-strategy equilibria (He et al., 2013): For large games with general trait or type spaces (possibly non-countably generated), the equivalence between nowhere equivalence and regularity yields existence of pure-strategy Nash equilibria and supports the purification principle (Otsuka, 19 Sep 2025, He et al., 2021), even when payoffs depend on the joint distribution over agents and actions ("semi-anonymous settings"). This broadens the mathematical economics toolkit for models with heterogeneous agents and aggregate externalities.
7. Advanced Themes and Mathematical Formulations
In application contexts, such as the description of random fields by systems of conditional distributions (Khachatryan, 2022), the specification and reconstruction of large-scale structure from finitely-parameterized conditional laws depend on factorization and quasilocality properties, and lead to explicit necessary and sufficient conditions for the unique existence of random field distributions.
Mathematical tools central to the theory include formulas for disintegration and reconstruction, e.g.,
and structural assertions about compactness, convexity, and upper semi-continuity. In operator algebra, analogous principles are seen in "regular" C*-correspondences, where regularity of module structures supports well-behaved decomposition and equivalence relations (Bilich et al., 8 Nov 2024).
Table: Core Regularity Properties and Their Measure-Theoretic Equivalence
| Property | Required for Regularity | Measure-Theoretic Condition |
|---|---|---|
| Convexity | Closed-valued correspondence | Nowhere equivalence of σ-algebras |
| Closedness | Closed-valued correspondence | Nowhere equivalence |
| Compactness | Compact-valued correspondence | Nowhere equivalence |
| Closed graph | Parameterized generators | Nowhere equivalence |
| Purification | Matching conditional laws | Nowhere equivalence |
These equivalences enable generalization to non-countably generated settings.
Summary
Regular conditional distributions of correspondences provide a comprehensive framework for the analysis, construction, and structural understanding of random elements, sets, and fields under partial specification. The equivalence between regularity properties (convexity, closedness, compactness, preservation of closed graph) and measure-theoretic conditions like nowhere equivalence assures robust and general existence results, supports purification arguments in large games, and enables structured control over symmetry and invariance. Applications encompass stochastic geometry, games with large populations, conditional independence modeling, and even operator algebraic settings, marking the framework as foundational in advanced probability, analysis, and mathematical economics.