Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Borel hierarchy
Summary
In mathematical logic, the Borel hierarchy is a stratification of the Borel algebra generated by the open subsets of a Polish space; elements of this algebra are called Borel sets. Each Borel set is assigned a unique countable ordinal number called the rank of the Borel set. The Borel hierarchy is of particular interest in descriptive set theory.
One common use of the Borel hierarchy is to prove facts about the Borel sets using transfinite induction on rank. Properties of sets of small finite ranks are important in measure theory and analysis.
Borel set
The Borel algebra in an arbitrary topological space is the smallest collection of subsets of the space that contains the open sets and is closed under countable unions and complementation. It can be shown that the Borel algebra is closed under countable intersections as well.
A short proof that the Borel algebra is well defined proceeds by showing that the entire powerset of the space is closed under complements and countable unions, and thus the Borel algebra is the intersection of all families of subsets of the space that have these closure properties. This proof does not give a simple procedure for determining whether a set is Borel. A motivation for the Borel hierarchy is to provide a more explicit characterization of the Borel sets.
The Borel hierarchy or boldface Borel hierarchy on a space X consists of classes , , and for every countable ordinal greater than zero. Each of these classes consists of subsets of X. The classes are defined inductively from the following rules:
A set is in if and only if it is open.
A set is in if and only if its complement is in .
A set is in for if and only if there is a sequence of sets such that each is in for some and .
A set is in if and only if it is both in and in .
The motivation for the hierarchy is to follow the way in which a Borel set could be constructed from open sets using complementation and countable unions.
A Borel set is said to have finite rank if it is in for some finite ordinal ; otherwise it has infinite rank.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.