Mathematical logic and foundations Definition
Borel hierarchy
Definition
Let be a Polish space, and let be the first uncountable ordinal. Define classes of subsets of by recursion on with :
- is the class of open subsets of .
- For , is the class of complements of sets in .
- For , is the class of countable unions with each in for some .
- For , .
This system of classes is the Borel hierarchy of .
Remarks
The class is the class of closed sets, is the class of sets, and is the class of sets. In , the set is in , as the countable union of the closed sets . It is not in , since by the Baire category theorem a dense subset of is uncountable. Every class satisfies , and the union of all the classes is the Borel sigma-algebra of . A non-example: an analytic set that is not Borel lies in no class of the hierarchy. If is uncountable, then for every , so the hierarchy does not collapse. The same definition works in any metrizable space; metrizability is used to show that closed sets are sets.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Borel sigma-algebra concept
- Ordinal number concept
- Polish space concept
- Borel hierarchy definition
Further reading
About this page
| Tag | RMH7ZQ2F40 |
|---|---|
| URI | m2://RMH7ZQ2F40 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03E15, 54H05, 28A05 |
| Defines | Borel hierarchy |
| Uses | Polish space, Ordinal number, Borel sigma-algebra |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.