This article is about specific collections of subsets of a given set. For more general ultrafilters on partially ordered sets, see Ultrafilter. For the physical device, see ultrafiltration.
The powerset lattice of the set {1,2,3,4}, with the upper set ↑{1,4} colored dark green. It is a principal filter, but not an ultrafilter, as it can be extended to the larger nontrivial filter ↑{1}, by including also the light green elements. Since ↑{1} cannot be extended any further, it is an ultrafilter.
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.
Ultrafilters on sets are an important special instance of ultrafilters on partially ordered sets, where the partially ordered set consists of the power set and the partial order is subset inclusion This article deals specifically with ultrafilters on a set and does not cover the more general notion.
There are two types of ultrafilter on a set. A principal ultrafilter on is the collection of all subsets of that contain a fixed element . The ultrafilters that are not principal are the free ultrafilters. The existence of free ultrafilters on any infinite set is implied by the ultrafilter lemma, which can be proven in ZFC. On the other hand, there exists models of ZF where every ultrafilter on a set is principal.
Ultrafilters have many applications in set theory, model theory, and topology.[1]: 186 Usually, only free ultrafilters lead to non-trivial constructions. For example, an ultraproduct modulo a principal ultrafilter is always isomorphic to one of the factors, while an ultraproduct modulo a free ultrafilter usually has a more complex structure.
^Davey, B. A.; Priestley, H. A. (1990). Introduction to Lattices and Order. Cambridge Mathematical Textbooks. Cambridge University Press.
and 18 Related for: Ultrafilter on a set information
field of set theory, an ultrafilteronaset X {\displaystyle X} is a maximal filter on the set X . {\displaystyle X.} In other words, it is a collection...
analysis, the notion of a property true almost everywhere is sometimes defined in terms of an ultrafilter. An ultrafilteronaset X is a maximal collection...
In set theory, a universal set is aset which contains all objects, including itself. In set theory as usually formulated, it can be proven in multiple...
aset, set theory — as a branch of mathematics — is mostly concerned with those that are relevant to mathematics as a whole. The modern study of set theory...
{\displaystyle V_{j(f)(\kappa )}\subset N} . A Shelah cardinal has a normal ultrafilter containing the set of weakly hyper-Woodin cardinals below it. Ernest...
mathematics and set theory, hereditarily finite sets are defined as finite sets whose elements are all hereditarily finite sets. In other words, the set itself...
every ultrafilterona finite set is principal, the index set I {\displaystyle I} is consequently also usually infinite. The ultraproduct acts as a filter...
theory Naive set theory S (set theory) Kripke–Platek set theory Scott–Potter set theory Constructive set theory Zermelo set theory General set theory Non-well-founded...
equality and inclusion. For a basic introduction to sets see the article onsets, for a fuller account see naive set theory, and for a full rigorous axiomatic...
is a nonprincipal ultrafilteron the set of natural numbers; each such ultrafilter induces, via binary representations of reals, aset of reals without...
In set theory, an infinite set is aset that is not a finite set. Infinite sets may be countable or uncountable. The set of natural numbers (whose existence...
algebra on X . {\displaystyle X.} In the other direction, a Boolean algebra A {\displaystyle A} has a unique non-principal ultrafilter (that is, a maximal...
set theory" is a non-formalized theory, that is, a theory that uses natural language to describe sets and operations onsets. Such theory treats sets...
A Venn diagram is a widely used diagram style that shows the logical relation between sets, popularized by John Venn (1834–1923) in the 1880s. The diagrams...
Zermelo set theory (sometimes denoted by Z-), as set out in a seminal paper in 1908 by Ernst Zermelo, is the ancestor of modern Zermelo–Fraenkel set theory...
mathematics, aset is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, aset is countable...
Global Information
