Ultrafilter on a set
Summary
In the mathematical field of set theory, an ultrafilter on a set is a maximal filter on the set In other words, it is a collection of subsets of that satisfies the definition of a filter on and that is maximal with respect to inclusion, in the sense that there does not exist a strictly larger collection of subsets of that is also a filter. (In the above, by definition a filter on a set does not contain the empty set.) Equivalently, an ultrafilter on the set can also be characterized as a filter on with the property that for every subset of either or its complement belongs to the ultrafilter.
Further reading
- Wikipedia, page 67416519, revision 1361725976, Ultrafilter on a set. adopted
About this page
| Tag | SWP7PEZX30 |
|---|---|
| URI | m2://SWP7PEZX30 |
| Aliases | countably-complete-ultrafilter, free-ultrafilter-set-theory, principal-ultrafilter, ramsey-ultrafilter, rudin-keisler-equivalent, rudin-keisler-order, rudin-keisler-ordering, selective-ultrafilter, ultra-prefilter, ultrafilter-set-theory, ultrafilter-monad, ultrafilter-principle |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (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.