Random dense countable sets: characterization by independence

2005/11/01 by Boris Tsirelson, Tsirelson, Boris
Computer Science · Mathematics · #Advanced Topology and Set Theory #FOS: Mathematics #Probability (math.PR) #Rough Sets and Fuzzy Logic #math.PR

paper · pdf · doi:10.48550/arxiv.math/0511011

17 pages

arxiv created 2005/11/01 · openalex publication_date 2005/11/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A random dense countable set is characterized (in distribution) by independence and stationarity. Two examples are `Brownian local minima' and `unordered infinite sample'. They are identically distributed; the former ad hoc proof of this fact is now superseded by a general result.

Related

• Brownian local minima and other random dense countable sets
• Stationary local random countable sets over the Wiener noise
• An operational characterization of the notion of probability by algorithmic randomness II: Discrete probability spaces
• Density, forcing, and the covering problem
• Combinatorial theorems relative to a random set