Order, lattices, ordered algebraic structures Boolean algebras Example
Regular open algebra
Builds on Regular open setTopological space
Example
Let be a topological space, and let be the set of its regular open sets, the open sets with . Order by inclusion and define:
- ;
- ;
- ;
- and .
Then is a complete Boolean algebra, called the regular open algebra of . The supremum of a family is , and the infimum is .
Check of the key points: the intersection of two regular open sets is regular open. Also is regular open for every open , so the operations stay in . For regular open, is regular open, , and , because is dense in . For any family, is regular open, contains every , and lies in every regular open that contains all , since then .
Remarks
The join is not the union: in , .
For , the algebra has no atoms, since every nonempty regular open set contains two disjoint open intervals.
Every Boolean algebra embeds densely into the regular open algebra of its Stone space, and this gives the completion of .
In Mathlib, the regular elements of a Heyting algebra are Heyting.Regular; for the open sets of they are the regular open sets.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Regular open set concept
- Topological space concept
- Regular open algebra example
Further reading
About this page
| Tag | 17S8AM75AD |
|---|---|
| URI | m2://17S8AM75AD |
| Kind | example |
| Writing | W0 stub |
| MSC | 06E10, 54A05 |
| Instance of | Complete Boolean algebra |
| Uses | Regular open set, Topological space |
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.