Article contents
ALMOST INDISCERNIBLE SEQUENCES AND CONVERGENCE OF CANONICAL BASES
Published online by Cambridge University Press: 25 June 2014
Abstract
We give a model-theoretic account for several results regarding sequences of random variables appearing in Berkes and Rosenthal [12]. In order to do this,
• We study and compare three notions of convergence of types in a stable theory: logic convergence, i.e., formula by formula, metric convergence (both already well studied) and convergence of canonical bases. In particular, we characterise א0-categorical stable theories in which the last two agree.
• We characterise sequences that admit almost indiscernible sub-sequences.
• We apply these tools to the theory of atomless random variables (ARV). We characterise types and notions of convergence of types as conditional distributions and weak/strong convergence thereof, and obtain, among other things, the Main Theorem of Berkes and Rosenthal.
Keywords
- Type
- Articles
- Information
- Copyright
- Copyright © The Association for Symbolic Logic 2014
References
REFERENCES
- 4
- Cited by