Order, lattices, ordered algebraic structures Definition
Free Boolean algebra
Builds on Boolean algebra
Definition
Let be a set. Let be a Boolean algebra and let be a map. The pair is a free Boolean algebra on if the following holds. For every Boolean algebra and every map , there is exactly one homomorphism with .
Remarks
It exists for every and is unique up to a unique isomorphism compatible with . For finite , one model is the algebra of all Boolean functions , with the -th coordinate function; it has elements and atoms. For any , one model is the algebra of clopen subsets of the product space . The free Boolean algebra on a countably infinite set is atomless.
Example: for , the algebra with and incomparable is free. A map extends by , , , and this extension is forced.
Non-example: the power set of with and is generated by the image of but is not free on . For the map into the two-element algebra, a homomorphism would send to , but a homomorphism sends to .
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Boolean algebra concept
- Free Boolean algebra definition
Further reading
About this page
| Tag | C8ZPFCX1SJ |
|---|---|
| URI | m2://C8ZPFCX1SJ |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06E05, 03G05 |
| Defines | Free Boolean algebra |
| Uses | Boolean algebra |
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.