Borel set
In mathematics, a Borel set is any set in a topological space that can be formed from open sets (or, equivalently, from closed sets) through the operations of countable union, countable intersection, and relative complement. Borel sets are named after Émile Borel.
For a topological space X, the collection of all Borel sets on X forms a
Borel sets are important in measure theory, since any measure defined on the open sets of a space, or on the closed sets of a space, must also be defined on all Borel sets of that space. Any measure defined on the Borel sets is called a Borel measure. Borel sets and the associated Borel hierarchy also play a fundamental role in descriptive set theory.
In some contexts, Borel sets are defined to be generated by the compact sets of the topological space, rather than the open sets. The two definitions are equivalent for many well-behaved spaces, including all Hausdorff
Generating the Borel algebra
[edit]In the case that X is a metric space, the Borel algebra in the first sense may be described generatively as follows.
For a collection T of subsets of X (that is, for any subset of the power set P(X) of X), let
- be all countable unions of elements of T
- be all countable intersections of elements of T
Now define by transfinite induction a sequence Gm, where m is an ordinal number, in the following manner:
- For the base case of the definition, let be the collection of open subsets of X.
- If i is not a limit ordinal, then i has an immediately preceding ordinal i − 1. Let
- If i is a limit ordinal, set
The claim is that the Borel algebra is G
To prove this claim, any open set in a metric space is the union of an increasing sequence of closed sets. In particular, complementation of sets maps Gm into itself for any limit ordinal m; moreover if m is an uncountable limit ordinal, Gm is closed under countable unions.
For each Borel set B, there is some countable ordinal
The resulting sequence of sets is termed the Borel hierarchy.
Example
[edit]An important example, especially in the theory of probability, is the Borel algebra on the set of real numbers. It is the algebra on which the Borel measure is defined. Given a real random variable defined on a probability space, its probability distribution is by definition also a measure on the Borel algebra.
The Borel algebra on the reals is the smallest
In the construction by transfinite induction, it can be shown that, in each step, the number of sets is, at most, the cardinality of the continuum. So, the total number of Borel sets is less than or equal to
In fact, the cardinality of the collection of Borel sets is equal to that of the continuum (compare to the number of Lebesgue measurable sets that exist, which is strictly larger and equal to ).
Standard Borel spaces and Kuratowski theorems
[edit]Let X be a topological space. The Borel space associated to X is the pair (X,B), where B is the
George Mackey defined a Borel space somewhat differently, writing that it is "a set together with a distinguished
Measurable spaces form a category in which the morphisms are measurable functions between measurable spaces. A function is measurable if it pulls back measurable sets, i.e., for all measurable sets B in Y, the set is measurable in X.
Theorem. Let X be a Polish space, that is, a topological space such that there is a metric d on X that defines the topology of X and that makes X a complete separable metric space. Then X as a Borel space is isomorphic to one of
- R,
- Z[clarification needed],
- a finite space.
(This result is reminiscent of Maharam's theorem.)
Considered as Borel spaces, the real line R, the union of R with a countable set, and Rn are isomorphic.
A standard Borel space is the Borel space associated to a Polish space. A standard Borel space is characterized up to isomorphism by its cardinality,[3] and any uncountable standard Borel space has the cardinality of the continuum.
For subsets of Polish spaces, Borel sets can be characterized as those sets that are the ranges of continuous injective maps defined on Polish spaces. Note however, that the range of a continuous noninjective map may fail to be Borel. See analytic set.
Every probability measure on a standard Borel space turns it into a standard probability space.
Non-Borel sets
[edit]An example of a subset of the reals that is non-Borel, due to Lusin,[4] is described below. In contrast, an example of a non-measurable set cannot be exhibited, although the existence of such a set is implied, for example, by the axiom of choice.
Every irrational number has a unique representation by an infinite continued fraction
where is some integer and all the other numbers are positive integers. Let be the set of all irrational numbers that correspond to sequences with the following property: there exists an infinite subsequence such that each element is a divisor of the next element. This set is not Borel. However, it is analytic (all Borel sets are also analytic), and complete in the class of analytic sets. For more details see descriptive set theory and the book by A. S. Kechris (see References), especially Exercise (27.2) on page 209, Definition (22.9) on page 169, Exercise (3.4)(ii) on page 14, and on page 196.
It's important to note, that while Zermelo–Fraenkel axioms (ZF) are sufficient to formalize the construction of , it cannot be proven in ZF alone that is non-Borel. In fact, it is consistent with ZF that is a countable union of countable sets,[5] so that any subset of is a Borel set.
Another non-Borel set is an inverse image of an infinite parity function . However, this is a proof of existence (via the axiom of choice), not an explicit example.
Alternative non-equivalent definitions
[edit]According to Paul Halmos,[6] a subset of a locally compact Hausdorff topological space is called a Borel set if it belongs to the smallest
Norberg and Vervaat[7] redefine the Borel algebra of a topological space as the -algebra generated by its open subsets and its compact saturated subsets. This definition is well-suited for applications in the case where is not Hausdorff. It coincides with the usual definition if is second countable or if every compact saturated subset is closed (which is the case in particular if is Hausdorff).
See also
[edit]- Borel hierarchy
- Borel isomorphism
- Baire set
- Cylindrical
σ -algebra - Descriptive set theory – Subfield of mathematical logic
- Polish space – Concept in topology
Notes
[edit]- ^ Mackey, G.W. (1966), "Ergodic Theory and Virtual Groups", Math. Ann., 166 (3): 187–207, doi:10.1007/BF01361167, ISSN 0025-5831, S2CID 119738592
- ^ Jochen Wengenroth, Is every sigma-algebra the Borel algebra of a topology?
- ^ Srivastava, S.M. (1991), A Course on Borel Sets, Springer Verlag, ISBN 978-0-387-98412-4
- ^ Lusin, Nicolas (1927), "Sur les ensembles analytiques", Fundamenta Mathematicae (in French), 10: Sect. 62, pages 76–78, doi:10.4064/fm-10-1-1-95
- ^ Jech, Thomas (2008). The Axiom of Choice. Courier Corporation. p. 142.
- ^ (Halmos 1950, page 219)
- ^ Tommy Norberg and Wim Vervaat, Capacities on non-Hausdorff spaces, in: Probability and Lattices, in: CWI Tract, vol. 110, Math. Centrum Centrum Wisk. Inform., Amsterdam, 1997, pp. 133-150
References
[edit]- William Arveson, An Invitation to C*-algebras, Springer-Verlag, 1981. (See Chapter 3 for an excellent exposition of Polish topology)
- Richard Dudley, Real Analysis and Probability. Wadsworth, Brooks and Cole, 1989
- Halmos, Paul R. (1950). Measure theory. D. van Nostrand Co. See especially Sect. 51 "Borel sets and Baire sets".
- Halsey Royden, Real Analysis, Prentice Hall, 1988
- Alexander S. Kechris, Classical Descriptive Set Theory, Springer-Verlag, 1995 (Graduate texts in Math., vol. 156)
External links
[edit]- "Borel set", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
- Formal definition of Borel Sets in the Mizar system, and the list of theorems Archived 2020-06-01 at the Wayback Machine that have been formally proved about it.
- Weisstein, Eric W. "Borel Set". MathWorld.
Lightface | Boldface | ||
---|---|---|---|
0 = 0 = 0 (sometimes the same as 1) |
0 = 0 = 0 (if defined) | ||
1 = recursive |
1 = clopen | ||
1 = recursively enumerable |
1 = co-recursively enumerable |
1 = G = open |
1 = F = closed |
2 |
2 | ||
2 |
2 |
2 = F |
2 = G |
3 |
3 | ||
3 |
3 |
3 = G |
3 = F |
⋮ | ⋮ | ||
< < < 0 = 0 = 0 = arithmetical |
< < < 0 = 0 = 0 = boldface arithmetical | ||
⋮ | ⋮ | ||
⋮ | ⋮ | ||
1 = 1 = 1 = 1 = hyperarithmetical |
1 = B = Borel | ||
1 = lightface analytic |
1 = lightface coanalytic |
1 = A = analytic |
1 = CA = coanalytic |
2 |
2 | ||
2 |
2 |
2 = PCA |
2 = CPCA |
3 |
3 | ||
3 |
3 |
3 = PCPCA |
3 = CPCPCA |
⋮ | ⋮ | ||
< < < 0 = 0 = 0 = analytical |
< < < 0 = 0 = 0 = P = projective | ||
⋮ | ⋮ |