Algebra: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
Line 4: | Line 4: | ||
==Examples of | ==Examples of Algebras== | ||
Assume that <math>X</math> is nonempty. | Assume that <math>X</math> is nonempty. | ||
* Given a set <math>X</math>, then <math>2^X</math> and <math>\{\emptyset,X\}</math> are algebras. | * Given a set <math>X</math>, then <math>2^X</math> and <math>\{\emptyset,X\}</math> are algebras. |
Revision as of 20:37, 26 October 2020
Let be a nonempty set. An algebra[1] is a nonempty collection of subsets of that is closed under finite unions and complements.
By DeMorgan's laws, an algebra is also closed under finite intersections, and also contains the empty set and itself.
Examples of Algebras
Assume that is nonempty.
- Given a set , then and are algebras.
- Given a set , the collection of all finite and cofinite (having finite complement) subsets of is an algebra.
- A sigma-algebra is a particular example of an algebra.
Non-examples
- Given a topological space , the topology is in general not an algebra, for the complement of an open set may fail to be open. For example, in with the standard topology, the open interval is open, but its complement is not.
References
- ↑ Folland, Gerald B. (1999). Real Analysis: Modern Techniques and Their Applications, John Wiley and Sons, ISBN 0471317160, Second edition.