Lesson plan
Ultrafilter
of the divisors of 210, ordered by the relation is divisor of, with the upper set ↑14 colored dark green. It is a , but not an , as it can be extended to the larger nontrivial filter ↑2, by including also the light green elements. Since ↑2 cannot be extended any further, it is an ultrafilter. In the mathematical field of order theory, an ultrafilter on a given partially ordered set (or "poset") P is a certain subset of P, namely a maximal filter on P; that is, a proper filter on P that cannot be enlarged to a bigger proper filter on P. If X is an arbitrary set, its power set {\mathcal P}(X), ordered by set inclusion, is always a Boolean algebra and hence a poset, and ultrafilters on {\mathcal P}(X) are usually called X . An ultrafilter on a set X may be considered as a finitely additive 0-1-valued measure on {\mathcal P}(X) . In this view, every subset of X is either considered "almost everything" (has measure 1) or "almost nothing" (has measure 0), depending on whether it belongs to the given ultrafilter or not. Ultrafilters have many applications in set theory, model theory, topology and combinatorics.
Article summary
of the divisors of 210, ordered by the relation is divisor of, with the upper set ↑14 colored dark green. It is a , but not an , as it can be extended to the larger nontrivial filter ↑2, by including also the light green elements. Since ↑2 cannot be extended any further, it is an ultrafilter. In the mathematical field of order theory, an ultrafilter on a given partially ordered set (or "poset") P is a certain subset of P, namely a maximal filter on P; that is, a proper filter on P that cannot be enlarged to a bigger proper filter on P. If X is an arbitrary set, its power set {\mathcal P}(X), ordered by set inclusion, is always a Boolean algebra and hence a poset, and ultrafilters on {\mathcal P}(X) are usually called X . An ultrafilter on a set X may be considered as a finitely additive 0-1-valued measure on {\mathcal P}(X) . In this view, every subset of X is either considered "almost everything" (has measure 1) or "almost nothing" (has measure 0), depending on whether it belongs to the given ultrafilter or not. Ultrafilters have many applications in set theory, model theory, topology and combinatorics.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.