一句话:用准马尔可夫范畴公理化经验采样态射,联合证明 de Finetti、Glivenko–Cantelli 与强大数定律。
本文在范畴概率框架下研究经验测度的收敛与强极限定理。作者提出置换不变性与经验充分性两条公理,刻画形如 X^N → X 的态射,使其可解释为输出序列经验测度之样本;由于部分序列经验测度未定义,这类经验采样态射需在允许部分态射的准马尔可夫范畴中处理。基于经验采样态射及若干附加性质,作者证明可表示性,并给出 de Finetti 定理、Glivenko–Cantelli 定理与强大数定律的抽象版本。最后在标准 Borel 空间上构造部分定义马尔可夫核作为实例,实例化后恢复经典 Glivenko–Cantelli 定理与有限一阶矩随机变量的强大数定律,从而统一给出这三个定理的第一性原理证明。
The Glivenko--Cantelli theorem is a uniform version of the strong law of large numbers. It states that for every IID sequence of random variables, the empirical measure converges to the underlying distribution (in the sense of uniform convergence of the CDF). In this work, we provide tools to study such limits of empirical measures in categorical probability. We propose two axioms, namely permutation invariance and empirical adequacy, that a morphism of type $X^{\mathbb{N}} \to X$ should satisfy to be interpretable as taking an infinite sequence as input and producing a sample from its empirical measure as output. Since not all sequences have a well-defined empirical measure, such \emph{empirical sampling morphisms} live in quasi-Markov categories, which, unlike Markov categories, allow for partial morphisms. Given an empirical sampling morphism and a few other properties, we prove representability as well as abstract versions of the de Finetti theorem, the Glivenko--Cantelli theorem and the strong law of large numbers. We provide several concrete constructions of empirical sampling morphisms as partially defined Markov kernels on standard Borel spaces. Instantiating our abstract results then recovers the standard Glivenko--Cantelli theorem and the strong law of large numbers for random variables with finite first moment. Our work thus provides a joint proof of these two theorems in conjunction with the de Finetti theorem from first principles.
DOI 原文 · arXiv · PDF(开放获取) · DBLP
@article{FritzGLPS26,
title = {Empirical Measures and Strong Laws of Large Numbers in Categorical Probability},
author = {Tobias Fritz and Tomáš Gonda and Antonio Lorenzin and Paolo Perrone and Areeb Shah Mohammed},
journal = {Logical Methods in Computer Science},
volume = {Volume 22, Issue 2},
year = {2026},
doi = {10.46298/lmcs-22(2:13)2026}
}