# Filters in topology

Last updated

In topology, a subfield of mathematics, filters are special families of subsets of a set ${\displaystyle X}$ that can be used to study topological spaces and define all basic topological notions such a convergence, continuity, compactness, and more. Filters also provide a common framework for defining various types of limits of functions such as limits from the left/right, to infinity, to a point or a set, and many others. Special types of filters called ultrafilters have many useful technical properties and they may often be used in place of arbitrary filters.

## Contents

Filters have generalizations called prefilters (also known as filter bases) and filter subbases, all of which appear naturally and repeatedly throughout topology. Examples include neighborhood filters/bases/subbases and uniformities. Every filter is a prefilter and both are filter subbases. Every prefilter and filter subbase is contained in a unique smallest filter, which they are said to generate. This establishes a relationship between filters and prefilters that may often be exploited to allow one to use whichever of these two notion is more technically convenient. A preorder on families of sets helps to determine exactly when and how one notion (filter, prefilter, etc.) can or cannot be used in place of another. This preorder's importance is amplified by the fact that it defines the notion of filter convergence, where by definition, a filter (or prefilter) ${\displaystyle {\mathcal {B}}}$converges to a point if and only if ${\displaystyle {\mathcal {N}}\leq {\mathcal {B}},}$ where ${\displaystyle {\mathcal {N}}}$ is that point's neighborhood filter. Consequently, subordination also plays an important role in many concepts that are related to convergence, such as cluster points and limits of functions. In addition, the relation ${\displaystyle {\mathcal {S}}\geq {\mathcal {B}},}$ which denotes ${\displaystyle {\mathcal {B}}\leq {\mathcal {S}}}$ and is expressed by saying that ${\displaystyle {\mathcal {S}}}$is subordinate to${\displaystyle {\mathcal {B}},}$ also establishes a relationship in which ${\displaystyle {\mathcal {S}}}$ is to ${\displaystyle {\mathcal {B}}}$ as a subsequence is to a sequence (that is, the relation ${\displaystyle \geq ,}$ which is called subordination, is for filters the analog of "is a subsequence of").

Filters were introduced by Henri Cartan in 1937 [1] [2] and subsequently used by Bourbaki in their book Topologie Générale as an alternative to the similar notion of a net developed in 1922 by E. H. Moore and H. L. Smith. Filters can also be used to characterize the notions of sequence and net convergence. But unlike [note 1] sequence and net convergence, filter convergence is defined entirely in terms of subsets of the topological space ${\displaystyle X}$ and so it provides a notion of convergence that is completely intrinsic to the topological space. Every net induces a canonical filter and dually, every filter induces a canonical net, where this induced net (resp. induced filter) converges to a point if and only if the same is true of the original filter (resp. net). This characterization also holds for many other definitions such as cluster points. These relationships make it possible to switch between filters and nets, and they often also allow one to choose whichever of these two notions (filter or net) is more convenient for the problem at hand. However, in general this relationship does not extend to subordinate filters and subnets because as detailed below, there exist subordinate filters whose filter/subordinate–filter relationship cannot be described in terms of the corresponding net/subnet relationship (here it is assumed that "subnet" is defined using any of its most popular definitions, which are given in this article).

## Motivation

Archetypical example of a filter

The archetypical example of a filter is the neighborhood filter ${\displaystyle {\mathcal {N}}(x)}$ at a point ${\displaystyle x}$ in a topological space ${\displaystyle (X,\tau ),}$ which by definition is the family of sets consisting of all neighborhoods of ${\displaystyle x.}$ By definition, a neighborhood of some given point (or subset) is any subset ${\displaystyle N\subseteq X}$ whose topological interior contains this point (or subset); importantly, neighborhoods are not required to be open sets (those are called open neighborhoods). The fundamental properties shared by neighborhood filters, which are listed below, ultimately became the definition of a "filter." A filter on ${\displaystyle X}$ is a set ${\displaystyle {\mathcal {B}}}$ of subsets of ${\displaystyle X}$ that satisfies all of the following conditions:

1. Not empty:  ${\displaystyle X\in {\mathcal {B}}}$ just as ${\displaystyle X\in {\mathcal {N}}(x),}$ since ${\displaystyle X}$ is always an (open) neighborhood of ${\displaystyle x}$ (and of anything else that it contains);
2. Does not contain the empty set:  ${\displaystyle \varnothing \not \in {\mathcal {B}}}$ just as no neighborhood of ${\displaystyle x}$ is empty;
3. Closed under finite intersections:   If ${\displaystyle B,C\in {\mathcal {B}}}$ then ${\displaystyle B\cap C\in {\mathcal {B}}}$ just as the intersection of any two neighborhoods of ${\displaystyle x}$ is again a neighborhood of ${\displaystyle x}$;
4. Upward closed:   If ${\displaystyle B\in {\mathcal {B}}}$ and ${\displaystyle B\subseteq S\subseteq X}$ then ${\displaystyle S\in {\mathcal {B}}}$ just as any subset of ${\displaystyle X}$ that contains a neighborhood of ${\displaystyle x}$ will necessarily be a neighborhood of ${\displaystyle x}$ (because ${\displaystyle \operatorname {Int} _{X}B\subseteq \operatorname {Int} _{X}S}$ and by definition of "neighborhood of ${\displaystyle x}$").
Generalizing sequence convergence by using sets − determining sequence convergence without the sequence

A sequence in ${\displaystyle X}$ is by definition a map ${\displaystyle \mathbb {N} \to X}$ from the natural numbers, which are an example of a directed set, into the space ${\displaystyle X.}$ The original notion of convergence in a topological space was that of a sequence converging to some given point in a space, such as a metric space. With metrizable spaces (or more generally first–countable spaces or Fréchet–Urysohn spaces), sequences usually suffices to characterize, or "describe", most topological properties, such as the closures of subsets or continuity of functions. But there are many spaces where sequences can not be used to describe even basic topological properties like closure or continuity. This failure of sequences was the motivation for defining notions such as nets and filters, which never fail to characterize topological properties.

Nets directly generalize the notion of a sequence since nets are, by definition, maps ${\displaystyle I\to X}$ from an arbitrary directed set ${\displaystyle (I,\leq )}$ into the space ${\displaystyle X.}$ A sequence is just a net whose domain is ${\displaystyle I=\mathbb {N} }$ with the natural ordering. Nets have their own notion of convergence, which is a direct generalization of sequence convergence.

Filters generalize sequence convergence in a different way by considering only values in the range of a sequence. To see how this is done, consider a sequence ${\displaystyle x_{\bullet }=\left(x_{i}\right)_{i=1}^{\infty }}$ in ${\displaystyle X,}$ which is by definition just a map ${\displaystyle x_{\bullet }:\mathbb {N} \to X}$ whose value at ${\displaystyle i\in \mathbb {N} }$ is denoted by ${\displaystyle x_{i}}$ rather than the more common parentheses notation ${\displaystyle x_{\bullet }(i).}$ Knowing only the range of the sequence is not enough to describe its convergence; multiple sets are needed. It turns out that the needed sets are the following, [note 2] which are called the tails of the sequence ${\displaystyle x_{\bullet }}$:

${\displaystyle \left\{x_{1},x_{2},x_{3},x_{4},\ldots \right\}}$
${\displaystyle \left\{x_{2},x_{3},x_{4},x_{5},\ldots \right\}}$
${\displaystyle \left\{x_{3},x_{4},x_{5},x_{6},\ldots \right\}}$
${\displaystyle ~~~~~~~~~~~~~~~~\vdots }$
${\displaystyle \left\{x_{n},x_{n+1},x_{n+2},x_{n+3},\ldots \right\}}$
${\displaystyle ~~~~~~~~~~~~~~~~\vdots }$

These sets completely determine this sequence's convergence (or non–convergence) because given any point, this sequence converges to it if and only if for every neighborhood U (of this point), there is some integer n such that U contains all of the points ${\displaystyle x_{n},x_{n+1},\ldots .}$ This can be reworded as:

every neighborhood U must contain some set of the form ${\displaystyle \{x_{n},x_{n+1},\ldots \}}$ as a subset.

It is the above characterization that can be used with the above family of tails to determine convergence (or non–convergence) of the sequence ${\displaystyle x_{\bullet }:\mathbb {N} \to X.}$ With these sets in hand, the map${\displaystyle x_{\bullet }:\mathbb {N} \to X}$ is no longer needed to determine convergence of this sequence (no matter what topology is placed on ${\displaystyle X}$). By generalizing this observation, the notion of "convergence" can be extended from maps to families of sets.

The above set of tails of a sequence is in general not a filter but it does "generate" a filter via taking its upward closure . The same is true of other important families of sets such as any neighborhood basis at a given point, which in general is also not a filter but does generate a filter via its upward closure (in particular, it generates the neighborhood filter at that point). The properties that these families share led to the notion of a filter base, also called a prefilter, which by definition is any family having the minimal properties necessary and sufficient for it to generate a filter via taking its upward closure only.

Filters and nets each have their own advantages and drawbacks and there's no reason to use one notion exclusively over the other. [note 3] Depending on what is being proved, a proof may be made significantly easier by using one of these notions instead of the other. [3] Both filters and nets can be used to completely characterize any given topology. Nets are direct generalizations of sequences and can often be used similarly to sequences, so the learning curve for nets is typically much less steep than that for filters. However, filters, and especially ultrafilters, have many more uses outside of topology, such as in set theory, mathematical logic, model theory (e.g. ultraproducts), abstract algebra, [4] order theory, generalized convergence spaces, and in the definition and use of hyperreal numbers.

Like sequences, nets are functions and so they have the advantages of functions. For example, like sequences, nets can be "plugged into" other functions, where "plugging in" is just function composition. Theorems related to functions and function composition may then be applied to nets. One example is the universal property of inverse limits, which is defined in terms of composition of maps rather than sets and it is more readily applied to functions like nets than to sets like filters (a prominent example of an inverse limit is the Cartesian product). Filters may be awkward to use in certain situations, such as when switching between a filter on a space ${\displaystyle X}$ and dense subspace ${\displaystyle S\subseteq X.}$ [5]

In contrast to nets, filters (and prefilters) are families of sets and so they have the advantages of sets. For example, if ${\displaystyle f}$ is surjective then the preimage or pullback f–1(ℬ) { f–1 (B) : B ∈ ℬ } of an arbitrary filter or prefilter ${\displaystyle {\mathcal {B}}}$ is both easily defined and guaranteed to be a prefilter, whereas it is less clear how to define the pullback of an arbitrary sequence (or net) x so that it is once again a sequence or net (unless ${\displaystyle f}$ is also injective and consequently a bijection, which is a stringent requirement). Because filters are composed of subsets of the very topological space ${\displaystyle X}$ that is under consideration, topological set operations (such as closure or interior) may be applied to the sets that constitute the filter. Taking the closure of the all sets in a filter is sometimes useful in Functional Analysis for instance. Theorems about images or preimages of sets under functions (e.g. continuity's definitions in terms of images or preimages of sets) may also be applied to filters. Special types of filters called ultrafilters have many useful properties that can significantly help in proving results. One downside of nets is their dependence on the directed sets that constitute their domains, which in general may be entirely unrelated to the space ${\displaystyle X.}$ In fact, the class of nets in a given set ${\displaystyle X}$ is too large to even be a set (it is a proper class); this is because nets in ${\displaystyle X}$ can have domains of any cardinality. In contrast, the collection of all filters (and all prefilters) on ${\displaystyle X}$ is a set. Unlike nets and sequences, the notions of a "filter on ${\displaystyle X}$" and of a "topology on ${\displaystyle X}$" are both "intrinsic to ${\displaystyle X}$" in the sense that both consist entirely of the subsets of ${\displaystyle X}$ and do not require any set that cannot be constructed from ${\displaystyle X}$ (such as or other directed sets, which sequences and nets require).

## Preliminaries, notation, and basic notions

In this article, upper case Roman letters like S and ${\displaystyle X}$ denote sets (but not families unless indicated otherwise) and ℘(X) will denote the powerset of ${\displaystyle X.}$ A subset of a powerset is called a family of sets (or simply, a family) where it is over ${\displaystyle X}$ if it is a subset of ℘(X). Families of sets will be denoted by upper case calligraphy letters such as ${\displaystyle {\mathcal {B}},}$${\displaystyle {\mathcal {C}},}$ and ${\displaystyle {\mathcal {F}}.}$ Whenever these assumptions are needed, then it should be assumed that ${\displaystyle X}$ is non–empty and that ${\displaystyle {\mathcal {B}},}$${\displaystyle {\mathcal {F}},}$ etc. are families of sets over ${\displaystyle X.}$

The terms "prefilter" and "filter base" are synonyms and will be used interchangeably.

Warning about competing definitions and notation

There are unfortunately several terms in the theory of filters that are defined differently by different authors. These include some of the most important terms such as "filter." While different definitions of the same term usually have significant overlap, due to the very technical nature of filters (and point–set topology), these differences in definitions nevertheless often have important consequences. When reading mathematical literature, it is recommended that readers check how the terminology related to filters is defined by the author. For this reason, this article will clearly state all definitions that are used in this article. Unfortunately, not all notation related to filters is well established and some notation varies greatly across the literature (e.g. the notation for the set of all prefilters on a set) so in such cases this article uses whatever notation is most self describing or easily remembered.

The theory of filters and prefilter is well developed and has a plethora of definitions and notations, many of which are now unceremoniously listed to prevent this article from becoming prolix and to allow for the easy look up of notation and definitions. Their important properties are described later.

Sets operations
The upward closure or isotonization in ${\displaystyle X}$ [6] of a family of subsets ${\displaystyle {\mathcal {B}}\subseteq \wp (X)}$ is
${\displaystyle {\mathcal {B}}^{\uparrow X}:=\left\{S\subseteq X~:~B\subseteq S{\text{ for some }}B\in {\mathcal {B}}\,\right\}=\bigcup _{B\in {\mathcal {B}}}\left\{S~:~B\subseteq S\subseteq X\right\}}$
and similarly the downward closure of ${\displaystyle {\mathcal {B}}}$ is ${\displaystyle {\mathcal {B}}^{\downarrow }:=\left\{S\subseteq B~:~B\in {\mathcal {B}}\,\right\}=\bigcup _{B\in {\mathcal {B}}}\wp (B).}$
Notation and DefinitionAssumptionsName
${\displaystyle \operatorname {ker} {\mathcal {B}}=\bigcap _{B\in {\mathcal {B}}}B}$ Kernel of ${\displaystyle {\mathcal {B}}}$ [7]
℘(X) = { S : SX} Power set of a set ${\displaystyle X}$ [7]
|S= { BS : B ∈ ℬ } = ℬ (∩) { S }${\displaystyle S}$ is a setTrace of ${\displaystyle {\mathcal {B}}}$ on S [8] or the restriction of ${\displaystyle {\mathcal {B}}}$ to S
(∩) 𝒞 = { BC : B ∈ ℬ and C ∈ 𝒞 } [9] Elementwise (set) intersection (${\displaystyle {\mathcal {B}}\cap {\mathcal {C}}}$ will denote the usual intersection)
(∪) 𝒞 = { BC : B ∈ ℬ and C ∈ 𝒞 } [9] Elementwise (set) union (${\displaystyle {\mathcal {B}}\cup {\mathcal {C}}}$ will denote the usual union)
(∖) 𝒞 = { BC : B ∈ ℬ and C ∈ 𝒞 }Elementwise (set) subtraction
S ∖ ℬ = { SB : B ∈ ℬ } = { S } (∖) ℬ${\displaystyle S}$ is a setDual of ${\displaystyle {\mathcal {B}}}$ in S or set subtraction [8]
SX= { S }X${\displaystyle S}$ is a set Upward closure or Isotonization [7]
The preorder is defined on families of sets, say ${\displaystyle {\mathcal {C}}}$ and ${\displaystyle {\mathcal {F}},}$ by declaring that ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}}}$ if and only if
for every${\displaystyle C\in {\mathcal {C}}}$ there is some ${\displaystyle F\in {\mathcal {F}}}$ such that FC

in which case it is said that ${\displaystyle {\mathcal {C}}}$ is coarser than${\displaystyle {\mathcal {F}},}$${\displaystyle {\mathcal {F}}}$ is finer than (or subordinate to) ${\displaystyle {\mathcal {C}},}$ [10] [11] [12] and ℱ ⊢ 𝒞 may be written.

Two families ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {C}}}$ of sets mesh [8] if BC ≠ ∅ for all ${\displaystyle B\in {\mathcal {B}}}$ and ${\displaystyle C\in {\mathcal {C}}}$.
NotationDefinitionName
${\displaystyle f^{-1}\left({\mathcal {B}}\right)=\left\{f^{-1}(B)~:~B\in {\mathcal {B}}\right\}}$${\displaystyle f}$ is a mapPreimage of ${\displaystyle {\mathcal {B}}}$ under ${\displaystyle f}$ [13]
${\displaystyle f^{-1}(S)=\left\{x\in \operatorname {domain} f~:~f(x)\in S\right\}}$${\displaystyle f}$ is a map and ${\displaystyle S}$ is a setPreimage a S under ${\displaystyle f}$
${\displaystyle f\left({\mathcal {B}}\right)=\{f(B)~:~B\in {\mathcal {B}}\}}$${\displaystyle f}$ is a mapImage of ${\displaystyle {\mathcal {B}}}$ under ${\displaystyle f}$ [13]
${\displaystyle f(S)=\left\{f(s)~:~s\in S\cap \operatorname {domain} f\right\}}$${\displaystyle f}$ is a map and ${\displaystyle S}$ is a setImage a S under ${\displaystyle f}$
Topology notation

The set of all topologies ${\displaystyle X}$ will be denoted by Top(X). Suppose ${\displaystyle \tau }$ is a topology on ${\displaystyle X.}$

Notation and DefinitionAssumptionsName
${\displaystyle \tau (S)=\left\{O\in \tau ~:~S\subseteq O\right\}}$${\displaystyle S\subseteq X}$Set or prefilter [note 4] of open neighborhoods of S in ${\displaystyle (X,\tau ).}$
${\displaystyle \tau (x)=\left\{O\in \tau ~:~x\in O\right\}}$${\displaystyle x\in X}$Set or prefilterof open neighborhoods of ${\displaystyle x}$ in ${\displaystyle (X,\tau ).}$
${\displaystyle {\mathcal {N}}_{\tau }(S)={\mathcal {N}}(S):=\tau (S)^{\uparrow X}}$${\displaystyle S\subseteq X}$Set or filter [note 4] of neighborhoods of S in ${\displaystyle (X,\tau ).}$
${\displaystyle {\mathcal {N}}_{\tau }(x)={\mathcal {N}}(x):=\tau (x)^{\uparrow X}}$${\displaystyle x\in X}$Set or filter of neighborhoods of ${\displaystyle x}$ in ${\displaystyle (X,\tau ).}$

Nets and their tails
A directed set is a set ${\displaystyle I}$ together with a preorder, which will be denoted by ${\displaystyle \leq }$ (unless explicitly indicated otherwise), that makes ${\displaystyle (I,\leq )}$ into an (upward) directed set; [14] this means that for all ${\displaystyle i,j\in I,}$ there exists some ${\displaystyle k\in I}$ such that ${\displaystyle i\leq k}$ and ${\displaystyle j\leq k.}$ For any indices ${\displaystyle i}$ and ${\displaystyle j,}$ the notation ${\displaystyle j\geq i}$ is defined to mean ${\displaystyle i\leq j}$ while ${\displaystyle i is defined to mean that ${\displaystyle i\leq j}$ holds but it is not true that ${\displaystyle j\leq i}$ (if is antisymmetric then this is equivalent to ${\displaystyle i\leq j}$ and ${\displaystyle i\neq j}$).
A net in ${\displaystyle X}$ [14] is a map from a non–empty directed set into ${\displaystyle X.}$
Notation and DefinitionAssumptionsName
${\displaystyle I_{\geq i}=\left\{j\in I~:~i\leq j\right\}}$${\displaystyle i\in I}$ and ${\displaystyle (I,\leq )}$ is a directed set Tail or section of ${\displaystyle I}$ starting at ${\displaystyle i}$
${\displaystyle f\left(I_{\geq i}\right)=\left\{f(j)~:~i\leq j{\text{ and }}j\in I\right\}}$${\displaystyle i\in I}$ and ${\displaystyle f~:~(I,\leq )\to X}$ is a net Tail or section of ${\displaystyle f}$ starting at ${\displaystyle i}$ [15]
${\displaystyle x_{\geq i}=\left\{x_{j}\in I~:~i\leq j{\text{ and }}j\in I\right\}}$${\displaystyle i\in I}$ and ${\displaystyle x_{\bullet }=\left(x_{i}\right)_{i\in I}}$ is a netTail or section of ${\displaystyle x_{\bullet }}$ starting at ${\displaystyle i}$
${\displaystyle \operatorname {Tails} \left(x_{\bullet }\right)=x_{\geq \bullet }=\left\{x_{\geq i}~:~i\in I\right\}}$${\displaystyle x_{\bullet }=\left(x_{i}\right)_{i\in I}}$ is a netSet or prefilter of tails/sections of ${\displaystyle x_{\bullet }.}$ Also called the eventuality filter base generated by (the tails of) ${\displaystyle x_{\bullet }.}$ If ${\displaystyle x_{\bullet }}$ is a sequence then ${\displaystyle \operatorname {Tails} \left(x_{\bullet }\right)}$ is called the sequential filter base instead. [15]
${\displaystyle \operatorname {TailsFilter} \left(x_{\bullet }\right)=\operatorname {Tails} \left(x_{\bullet }\right)^{\uparrow X}}$${\displaystyle x_{\bullet }=\left(x_{i}\right)_{i\in I}}$ is a net(Eventuality) filter of/generated by (tails of) ${\displaystyle x_{\bullet }.}$ [15]

If ${\displaystyle x_{\bullet }=\left(x_{i}\right)_{i\in I}}$ is a net and ${\displaystyle i\in I}$ then it is possible for the set ${\displaystyle x_{>i}=\left\{x_{j}\in I~:~i>j{\text{ and }}j\in I\right\},}$ which is called the tail of ${\displaystyle x_{\bullet }}$after${\displaystyle i}$, to be empty (e.g. this happens if ${\displaystyle i}$ is an upper bound of the directed set ${\displaystyle I}$). In this case, the family ${\displaystyle \left\{x_{>i}~:~i\in I\right\}}$ would contain the empty set, which would prevent it from being a prefilter (defined later). This is the (important) reason for defining ${\displaystyle \operatorname {Tails} \left(x_{\bullet }\right)}$ as ${\displaystyle \left\{x_{\geq i}~:~i\in I\right\}}$ rather than ${\displaystyle \left\{x_{>i}~:~i\in I\right\}}$ or even ${\displaystyle \left\{x_{>i}~:~i\in I\right\}\cup \left\{x_{\geq i}~:~i\in I\right\}}$ and it is for this reason that in general, when dealing with the prefilter of tails of a net, the strict inequality < may not be used interchangeably with the inequality ${\displaystyle \leq }$.

### Filters and prefilters

The following is a list of properties that a family ${\displaystyle {\mathcal {B}}}$ of sets may possess and they form the defining properties of filters, prefilters, and filter subbases. Whenever it is necessary, it should be assumed that ${\displaystyle {\mathcal {B}}\subseteq \wp (X).}$

The family of sets ${\displaystyle {\mathcal {B}}}$ is:
1. Proper or nondegenerate if ${\displaystyle \varnothing \not \in {\mathcal {B}}.}$ Otherwise, if ${\displaystyle \varnothing \in {\mathcal {B}},}$ then it is called improper [16] or degenerate.
2. Directed downward [14] if whenever A, B ∈ ℬ then there exists some ${\displaystyle C\in {\mathcal {B}}}$ such that ${\displaystyle C\subseteq A\cap B.}$
• Alternatively, ${\displaystyle {\mathcal {B}}}$directed downward (resp. directed upward) if and only if ${\displaystyle {\mathcal {B}}}$ is (upward) directed with respect to the preorder (resp. ${\displaystyle \subseteq }$), where by definition this means that for all A, B ∈ ℬ, there exists some "greater" ${\displaystyle C\in {\mathcal {B}}}$ such that AC and BC (resp. such that AC and BC), which can be rewritten as ${\displaystyle A\cap B\supseteq C}$ (resp.${\displaystyle A\cup B\subseteq C}$). This explains the word "directed."
• If a family ${\displaystyle {\mathcal {B}}}$ has a greatest element with respect to (for example, if ${\displaystyle \varnothing \in {\mathcal {B}}}$) then it is necessarily directed downward.
3. Closed under finite intersections (resp. unions) if the intersection (resp. union) of any two elements of ${\displaystyle {\mathcal {B}}}$ is an element of ${\displaystyle {\mathcal {B}}.}$
• If ${\displaystyle {\mathcal {B}}}$ is closed under finite intersections then ${\displaystyle {\mathcal {B}}}$ is necessarily directed downward. The converse is generally false.
4. Upward closed or Isotone in ${\displaystyle X}$ [6] if ${\displaystyle {\mathcal {B}}\subseteq \wp (X)}$ and ℬ = ℬX, or equivalently, if whenever ${\displaystyle B\in {\mathcal {B}}}$ and ${\displaystyle C}$ satisfies BCX then ${\displaystyle C\in {\mathcal {B}}}$. Similarly, ${\displaystyle {\mathcal {B}}}$ is downward closed if ℬ = ℬ. An upward (respectively, downward) closed set is also called an upper set or upset (resp. a lower set or down set).
• The family ${\displaystyle {\mathcal {B}}^{\uparrow X},}$ which is the upward closure of ${\displaystyle {\mathcal {B}}}$ in ${\displaystyle X,}$ is the unique smallest isotone family of sets over ${\displaystyle X}$ having ${\displaystyle {\mathcal {B}}}$ as a subset.

Many of the properties of ${\displaystyle {\mathcal {B}}}$ defined above (and below), such as "proper" and "directed downward," do not depend on ${\displaystyle X,}$ so mentioning the set ${\displaystyle X}$ is optional when using such terms. Definitions involving being "upward closed in ${\displaystyle X,}$" such as that of "filter on ${\displaystyle X,}$" do depend on ${\displaystyle X}$ so the set ${\displaystyle X}$ should be mentioned if it is not clear from context.

Ultrafilters(X)  =  Filters(X) UltraPrefilters(X)    Filters(X) UltraPrefilters(X)    Prefilters(X)    FilterSubbases(X).
A family ${\displaystyle {\mathcal {B}}}$ is/is a(n):
1. Ideal [16] [17] if ${\displaystyle {\mathcal {B}}\neq \varnothing }$ is downward closed and closed under finite unions.
2. Dual ideal on ${\displaystyle X}$ [18] if ${\displaystyle {\mathcal {B}}\neq \varnothing }$ is upward closed in ${\displaystyle X}$ and also closed under finite intersections.
• Explanation of the word "dual": A family ${\displaystyle {\mathcal {B}}}$ is a dual ideal (resp. an ideal) on ${\displaystyle X}$ if and only if the dual of ${\displaystyle {\mathcal {B}}}$ in ${\displaystyle X}$, which is the family
X ∖ ℬ = { XB : B ∈ ℬ },
is an ideal (resp. a dual ideal) on ${\displaystyle X.}$ The family X ∖ ℬ should not be confused with ℘(X) ∖ ℬ ≝ { SX:S ∉ ℬ }, where in general X ∖ ℬ ≠ ℘(X) ∖ ℬ. The dual of the dual is the original family, meaning X ∖ (X ∖ ℬ) = ℬ; and also X belongs to the dual of ${\displaystyle {\mathcal {B}}}$ if and only if ${\displaystyle \varnothing \in {\mathcal {B}}.}$ [16]
3. Filter on ${\displaystyle X}$ [18] [8] if ${\displaystyle {\mathcal {B}}}$ is a proper dual ideal on ${\displaystyle X.}$ That is, a filter on ${\displaystyle X}$ is a non-empty subset of ℘(X) ∖ { ∅ } that is closed under finite intersections and upward closed in ${\displaystyle X.}$ Equivalently, it is a prefilter that is upward closed in ${\displaystyle X.}$ In words, a filter on ${\displaystyle X}$ is a family of sets over ${\displaystyle X}$ that (1) is not empty (or equivalently, it contains ${\displaystyle X}$), (2) is closed under finite intersections, (3) is upward closed in ${\displaystyle X,}$ and (4) does not have the empty set as an element.
• Warning: Some authors, particularly algebrists, use "filter" to mean a dual ideal; others, particularly topologists, use "filter" to mean a proper dual ideal. [19] It is recommended that readers always check how "filter" is defined when reading mathematical literature. This article uses Henri Cartan's original definition of filter, which required propriety.
• ${\displaystyle {\mathcal {B}}}$ is a filter on ${\displaystyle X}$ if and only if its dual X ∖ ℬ is an ideal that does not contain X as an element. If ${\displaystyle {\mathcal {B}}}$ is an ideal on ${\displaystyle X}$ that satisfies X ∉ ℬ then X ∖ ℬ is called its dual filter on ${\displaystyle X.}$
4. Prefilter or filter base [8] [20] if ${\displaystyle {\mathcal {B}}\neq \varnothing }$ is proper and directed downward. Equivalently, ${\displaystyle {\mathcal {B}}}$ is a prefilter if its upward closure ${\displaystyle {\mathcal {B}}^{\uparrow X}}$ is a filter. It can also be defined as any family that is equivalent (with respect to ${\displaystyle \leq }$) to some filter. [9] A proper family ${\displaystyle {\mathcal {B}}\neq \varnothing }$ is a prefilter if and only if (∩) ℬ ≤ ℬ. [9]
• If ${\displaystyle {\mathcal {B}}}$ is a prefilter then its upward closure ${\displaystyle {\mathcal {B}}^{\uparrow X}}$ is the unique smallest (relative to ${\displaystyle \subseteq }$) filter on ${\displaystyle X}$ containing ${\displaystyle {\mathcal {B}}}$ and it is called the filter generated by${\displaystyle {\mathcal {B}}.}$ A filter ${\displaystyle {\mathcal {F}}}$ is said to be generated by a prefilter ${\displaystyle {\mathcal {B}}}$ if ℱ = ℬX, in which ${\displaystyle {\mathcal {B}}}$ is called a filter base for ${\displaystyle {\mathcal {F}}}$.
• Unlike a filter, a prefilter is not necessarily closed under finite intersections.
5. π–system if ${\displaystyle {\mathcal {B}}\neq \varnothing }$ is closed under finite intersections. Every non–empty family ${\displaystyle {\mathcal {B}}}$ is contained in a unique smallest π–system called the π–system generated by${\displaystyle {\mathcal {B}},}$ which is sometimes denoted by π(ℬ). It is equal to the intersection of all π–systems containing ${\displaystyle {\mathcal {B}}}$ and also to the set of all possible finite intersections of sets from ${\displaystyle {\mathcal {B}}}$:
π(ℬ) = { B1 ∩ ⋅⋅⋅ ∩ Bn:n ≥ 1 and B1, ..., Bn ∈ ℬ }.
• A π–system is a prefilter if and only if it is proper. Every filter is a proper π–system and every proper π–system is a prefilter but the converses do not hold in general.
• A prefilter is equivalent (with respect to ${\displaystyle \leq }$) to the π–system generated by it and both of these families generate the same filter on ${\displaystyle X.}$
6. Filter subbase [8] [21] and centered [9] if ${\displaystyle {\mathcal {B}}\neq \varnothing }$ and ${\displaystyle {\mathcal {B}}}$ satisfies any of the following equivalent conditions:
1. ${\displaystyle {\mathcal {B}}}$ has the finite intersection property , which means that intersection of any finite family of (one or more) sets in ${\displaystyle {\mathcal {B}}}$ is not empty; explicitly, this means that whenever n ≥ 1 and B1, ..., Bn ∈ ℬ then ${\displaystyle \varnothing \neq B_{1}\cap \cdots \cap B_{n}.}$
2. The π–system generated by ${\displaystyle {\mathcal {B}}}$ is proper (i.e. ${\displaystyle \varnothing }$ is not an element).
3. The π–system generated by ${\displaystyle {\mathcal {B}}}$ is a prefilter.
4. ${\displaystyle {\mathcal {B}}}$ is a subset of some prefilter.
5. ${\displaystyle {\mathcal {B}}}$ is a subset of some filter.
• The filter generated by ${\displaystyle {\mathcal {B}}}$ is the unique smallest (relative to ${\displaystyle \subseteq }$) filter on ${\displaystyle X}$ containing ${\displaystyle {\mathcal {B}}.}$ It is equal to the intersection of all filters on ${\displaystyle X}$ that have ${\displaystyle {\mathcal {B}}}$ as a subset. The π–system generated by ${\displaystyle {\mathcal {B}},}$ denoted by π(ℬ), will be a prefilter and a subset of . Moreover, the filter generated by ${\displaystyle {\mathcal {B}}}$ is the upward closure of π(ℬ), meaning π(ℬ)X=. [9]
• A smallest (relative to ${\displaystyle \subseteq }$) prefilter containing a filter subbase ${\displaystyle {\mathcal {B}}}$ will exist only under certain circumstances. For example, (1) ${\displaystyle {\mathcal {B}}}$ is a prefilter, or (2) the filter (or equivalently, the π–system) generated by ${\displaystyle {\mathcal {B}}}$ is principle, in which case ℬ ∪ { ker ℬ } is the unique smallest prefilter containing ${\displaystyle {\mathcal {B}}.}$ Otherwise, in general, a ${\displaystyle \subseteq }$–smallest prefilter containing ${\displaystyle {\mathcal {B}}}$ may not exist. For this reason, some authors may refer to the π–system generated by ${\displaystyle {\mathcal {B}}}$ as the prefilter generated by ${\displaystyle {\mathcal {B}}}$. However, as shown in an example below, if such a ${\displaystyle \subseteq }$–smallest prefilter does exist then it is not necessarily equal to the prefilter (i.e. π–system) generated by . So unfortunately, "the prefilter generated by" a prefilter ${\displaystyle {\mathcal {B}}}$ may not be ${\displaystyle {\mathcal {B}},}$ which is why this article will prefer the accurate and unambiguous terminology of "the π–system generated by ${\displaystyle {\mathcal {B}}}$".
7. Subfilter of a filter ${\displaystyle {\mathcal {F}}}$ and that ${\displaystyle {\mathcal {F}}}$ is a superfilter of ${\displaystyle {\mathcal {B}}}$ [16] [22] if ${\displaystyle {\mathcal {B}}}$ is a filter and where for filters, if and only if ${\displaystyle {\mathcal {B}}\leq {\mathcal {F}}.}$
• Importantly, the expression "is a superfilter of" is for filters the analog of "is a subsequence of". So despite having the prefix "sub" in common, "is a subfilter of" is actually the reverse of "is a subsequence of."
• However, ${\displaystyle {\mathcal {B}}\leq {\mathcal {F}}}$ can also be written which is described by saying "${\displaystyle {\mathcal {F}}}$ is subordinate to ${\displaystyle {\mathcal {B}}.}$" With this terminology, "is subordinate to" becomes for filters (and also for prefilters) the analog of "is a subsequence of," [23] which makes this one situation where using the term "subordinate" and symbol may be helpful.

There are no prefilters on ${\displaystyle X=\varnothing }$ (nor are there any nets valued in ${\displaystyle \varnothing }$), which is why this article, like most authors, will automatically assume without comment that ${\displaystyle X\neq \varnothing }$ whenever this assumption is needed.

#### Basic examples

Named examples
• The singleton set ${\displaystyle {\mathcal {B}}=\{X\}}$ is called the trivial or indiscrete filter on ${\displaystyle X}$. [24] [10] It is the unique minimal filter on ${\displaystyle X}$ because it is a subset of every filter on ${\displaystyle X}$; however, it need not be a subset of every prefilter on ${\displaystyle X.}$
• If ${\displaystyle (X,\tau )}$ is a topological space and ${\displaystyle x\in X,}$ then the neighborhood filter ${\displaystyle {\mathcal {N}}(x)}$ at ${\displaystyle x}$ is a filter on ${\displaystyle X.}$ By definition, a family ${\displaystyle {\mathcal {B}}}$ of subsets of ${\displaystyle X}$ is called a neighborhood basis (resp. a neighborhood subbasis) at ${\displaystyle x}$ for ${\displaystyle (X,\tau )}$ if and only if ${\displaystyle {\mathcal {B}}}$ is a prefilter (resp. ${\displaystyle {\mathcal {B}}}$ is a filter subbase) and the filter on ${\displaystyle X}$ that ${\displaystyle {\mathcal {B}}}$ generates is equal to the neighborhood filter ${\displaystyle {\mathcal {N}}(x).}$ The subfamily ${\displaystyle \tau (x)\subseteq {\mathcal {N}}(x)}$ of open neighborhoods is a filter base for ${\displaystyle {\mathcal {N}}(x).}$ Both prefilters ${\displaystyle {\mathcal {N}}(x)}$ and ${\displaystyle \tau (x)}$ also form a bases for topologies on ${\displaystyle X,}$ with the topology generated ${\displaystyle \tau (x)}$ being coarser than ${\displaystyle \tau }$. This example immediately generalizes from neighborhoods of points to neighborhoods of non–empty subsets ${\displaystyle S\subseteq X.}$
• ${\displaystyle {\mathcal {B}}}$ is an elementary prefilter [25] if ${\displaystyle {\mathcal {B}}=\operatorname {Tails} \left(x_{\bullet }\right)}$ for some sequence ${\displaystyle x_{\bullet }=\left(x_{i}\right)_{i=1}^{\infty }}$ in ${\displaystyle X.}$
• ${\displaystyle {\mathcal {B}}}$ is an elementary filter on ${\displaystyle X}$ [26] if ${\displaystyle {\mathcal {B}}}$ is a filter on ${\displaystyle X}$ generated by some elementary prefilter. The filter of tails generated by a sequence that is not eventually constant is necessarily not an ultrafilter. [27]
• The set ${\displaystyle {\mathcal {F}}}$ of all cofinite subsets of ${\displaystyle X}$ (meaning those sets whose complement in ${\displaystyle X}$ is finite) is proper if and only if ${\displaystyle {\mathcal {F}}}$ is infinite (or equivalently, ${\displaystyle X}$ is infinite), in which case ${\displaystyle {\mathcal {F}}}$ is a filter on ${\displaystyle X}$ known as the Fréchet or cofinite filter on ${\displaystyle X.}$ [10] [24] If ${\displaystyle X}$ is finite then ${\displaystyle {\mathcal {F}}}$ is equal to the dual ideal ℘(X), which is not a filter. If ${\displaystyle X}$ is infinite then the family ${\displaystyle \left\{X\setminus \{x\}~:~x\in X\right\}}$ of complements of singleton sets is a filter subbase that generates the Fréchet filter on ${\displaystyle X.}$ As with any family of sets over ${\displaystyle X}$ that contains ${\displaystyle \left\{X\setminus \{x\}~:~x\in X\right\},}$ the kernel of the Fréchet filter on ${\displaystyle X}$ is the empty set: ${\displaystyle \operatorname {ker} {\mathcal {F}}=\varnothing }$.
• The intersection of any non–empty set ${\displaystyle \mathbb {F} }$ of filters on ${\displaystyle X}$ is itself a filter on ${\displaystyle X}$ called the infimum or greatest lower bound of ${\displaystyle \mathbb {F} }$ in ${\displaystyle \operatorname {Filters} (X)}$. Since every filter on ${\displaystyle X}$ has ${\displaystyle \{X\}}$ as a subset, this intersection is never empty. By definition, the infimum is the finest/largest (relative to ${\displaystyle \subseteq }$ and ${\displaystyle \leq }$) filter contained as a subset of each member of ${\displaystyle \mathbb {F} }$. [10]
• If ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {F}}}$ are filters then their infimum in ${\displaystyle \operatorname {Filters} (X)}$ is the filter ${\displaystyle {\mathcal {B}}(\cup ){\mathcal {F}}.}$ [9] If ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {F}}}$ are prefilters then ${\displaystyle {\mathcal {B}}(\cup ){\mathcal {F}}}$ is a prefilter and one of the finest (with respect to ${\displaystyle \leq }$) prefilters coarser (with respect to ${\displaystyle \leq }$) than both ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {F}}}$; that is, if ${\displaystyle {\mathcal {S}}}$ is a prefilter such that ${\displaystyle {\mathcal {S}}\leq {\mathcal {B}}}$ and ${\displaystyle {\mathcal {S}}\leq {\mathcal {F}}}$ then ${\displaystyle {\mathcal {B}}(\cup ){\mathcal {F}}.}$ [9] More generally, if ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {F}}}$ are non-empty families and if 𝕊 ≝ { 𝒮 ⊆ ℘(X) : 𝒮 ≤ ℬ and 𝒮 ≤ ℱ } then ${\displaystyle {\mathcal {B}}(\cup ){\mathcal {F}}\in \mathbb {S} }$ and ${\displaystyle {\mathcal {B}}(\cup ){\mathcal {F}}}$ is a greatest element (with respect to ${\displaystyle \leq }$) of 𝕊. [9]
• Let ${\displaystyle \mathbb {F} }$ be a set of filters on ${\displaystyle X}$ and let ${\displaystyle {\mathcal {B}}=\cup _{{\mathcal {F}}\in \mathbb {F} }{\mathcal {F}}.}$ If ${\displaystyle {\mathcal {B}}}$ is a filter subbase then the filter on ${\displaystyle X}$ generated by ${\displaystyle {\mathcal {B}}}$ is the supremum or least upper bound of ${\displaystyle \mathbb {F} }$ in ${\displaystyle \operatorname {Filters} (X)}$. [10] By definition, the supremum, if it exists, is the smallest (relative to ${\displaystyle \subseteq }$) filter containing each member of ${\displaystyle \mathbb {F} }$ as a subset. If ${\displaystyle {\mathcal {B}}}$ is not a filter subbase, then the supremum of ${\displaystyle \mathbb {F} }$ in ${\displaystyle \operatorname {Filters} (X)}$ (and also in ${\displaystyle \operatorname {Prefilters} (X)}$) does not exist.
• If ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {F}}}$ are prefilters (resp. filters on ${\displaystyle X}$) then (∩) is a prefilter (resp. a filter) if and only if it is proper (or said differently, if and only if ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {F}}}$ mesh), in which case it is one of the coarsest (with respect to ${\displaystyle \leq }$) prefilters (resp. the${\displaystyle \leq }$-coarsest filters) that is finer (with respect to ${\displaystyle \leq }$) than both ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {F}}}$; that is, if ${\displaystyle {\mathcal {S}}}$ is a prefilter (resp. filter) such that ${\displaystyle {\mathcal {B}}\leq {\mathcal {S}}}$ and ${\displaystyle {\mathcal {F}}\leq {\mathcal {S}}}$ then ${\displaystyle {\mathcal {B}}\cap {\mathcal {F}}\leq {\mathcal {S}}.}$ [9]
• Let ${\displaystyle I}$ and ${\displaystyle X}$ be non-empty sets and for every ${\displaystyle i\in I}$ let ${\displaystyle {\mathcal {D}}_{i}}$ be a dual ideal on ${\displaystyle X.}$ If ${\displaystyle {\mathcal {I}}}$ is any dual ideal on ${\displaystyle I}$ then ${\displaystyle \bigcup _{\Xi \in {\mathcal {I}}}\;\;\bigcap _{i\in \Xi }\;{\mathcal {D}}_{i}}$ is a dual ideal on ${\displaystyle X}$ called Kowalsky's dual ideal or Kowalsky's filter. [16]
Other examples
• Let ${\displaystyle X=\{p,1,2,3\}}$ and let ℬ = { { p }, { p, 1, 2 }, { p, 1, 3 } }, which makes ${\displaystyle {\mathcal {B}}}$ a prefilter and a filter subbase that is not closed under finite intersections. Because ${\displaystyle {\mathcal {B}}}$ is a prefilter, the smallest prefilter containing ${\displaystyle {\mathcal {B}}}$ is ${\displaystyle {\mathcal {B}}.}$ The π–system generated by ${\displaystyle {\mathcal {B}}}$ is { { p, 1 } } ∪ ℬ. In particular, the smallest prefilter containing the filter subbase ${\displaystyle {\mathcal {B}}}$ is not equal to the set of all finite intersections of sets in ${\displaystyle {\mathcal {B}}.}$ The filter on ${\displaystyle X}$ generated by ${\displaystyle {\mathcal {B}}}$ is X = { SX : pS } = { { p } ∪ T:T ⊆ { 1, 2, 3 }}. All three of ${\displaystyle {\mathcal {B}},}$ the π–system ${\displaystyle {\mathcal {B}}}$ generates, and ${\displaystyle {\mathcal {B}}^{\uparrow X}}$ are examples of fixed, principal, ultra prefilters that are principal at the point p; ${\displaystyle {\mathcal {B}}^{\uparrow X}}$ is also an ultrafilter on ${\displaystyle X.}$
• A prefilter ${\displaystyle {\mathcal {B}}}$ on a topological space X is finer than the prefilter { cl'XB:B ∈ ℬ }. [28]
• The set ${\displaystyle {\mathcal {B}}}$ of all dense open subsets of a (non–empty) topological space ${\displaystyle X}$ is a proper π–system and so also a prefilter. If ${\displaystyle X=\mathbb {R} ^{n}}$ (with 1 ≤ n ∈ ℕ), then the set LebFinite of all ${\displaystyle B\in {\mathcal {B}}}$ such that ${\displaystyle B}$ has finite Lebesgue measure is a proper π–system and prefilter that is also a proper subset of ${\displaystyle {\mathcal {B}}.}$ The prefilters LebFinite and ${\displaystyle {\mathcal {B}}}$ generate the same filter on ${\displaystyle X.}$
• This example illustrates a class of a filter subbases 𝒮R where all sets in both 𝒮R and its generated π-system can be described as sets of the form ${\displaystyle B_{r,s},}$ so that in particular, no more than two variables (i.e. r and s) are needed to describe the generated π-system. However, this is not typical and in general, this should not be expected of a filter subbase ${\displaystyle {\mathcal {S}}}$ that is not a π-system. More often, an intersection ${\displaystyle S_{1}\cap \cdots S_{n}}$ of n sets from ${\displaystyle {\mathcal {S}}}$ will usually require a description involving n variables that cannot be reduced down to only two (consider, for instance, if 𝒮R was instead ${\displaystyle \left\{(0,r)\cup (r,\infty )~:~r\in R\right\}}$). For all ${\displaystyle r,s\in \mathbb {R} ,}$, let ${\displaystyle B_{r,s}=(r,0)\cup (s,\infty ),}$ where ${\displaystyle B_{r,s}=B_{\min(r,s),s}}$ so no generality is lost by adding the assumption rs. For all real ${\displaystyle r\leq s}$ and ${\displaystyle u\leq v,}$ if ${\displaystyle s\geq 0}$ or ${\displaystyle v\geq 0}$ then ${\displaystyle B_{-r,s}\cap B_{-u,v}=B_{-\min(r,u),\max(s,v)}.}$ [note 5] For every R ⊆ ℝ, let 𝒮R = { Br, r : rR } and let R = { Br, s : rs with r, sR}. [note 6] Let ${\displaystyle X=\mathbb {R} }$ and suppose ${\displaystyle \varnothing \neq R\subseteq (0,\infty )}$ is not a singleton set. Then 𝒮R is a filter subbase but not a prefilter and R is the π-system it generates, so that RX is the unique smallest filter in ${\displaystyle X=\mathbb {R} }$ containing 𝒮R. However, 𝒮RX is not a filter on ${\displaystyle X}$ (nor is it a prefilter because it is not directed downward, although it is a filter subbase) and 𝒮RX is a proper subset of the filter RX. If ${\displaystyle R,S\subseteq (0,\infty )}$ are non-empty intervals then the filter subbases 𝒮R and 𝒮S generate the same filter on ${\displaystyle X}$ if and only if ${\displaystyle R=S.}$ If ${\displaystyle {\mathcal {C}}}$ is a family such that 𝒮(0, ∞) ⊆ 𝒞 ⊆ ℬ(0, ∞) then ${\displaystyle {\mathcal {C}}}$ is a prefilter if and only if for all real ${\displaystyle 0 there exist real ${\displaystyle 0 such that ${\displaystyle u\leq r\leq s\leq v}$ and Bu, v ∈ 𝒞. If ${\displaystyle {\mathcal {C}}}$ is such a prefilter then for any C ∈ 𝒞 ∖ 𝒮(0, ∞), the family 𝒞 ∖ { C } is also a prefilter satisfying 𝒮(0, ∞) ⊆ 𝒞 ∖ { C } ⊆ ℬ(0, ∞). This shows that there cannot exist a minimal (with respect to ${\displaystyle \subseteq }$) prefilter that both contains 𝒮(0, ∞) and is a subset of the π-system generated by 𝒮(0, ∞). This remains true even if the requirement that the prefilter be a subset of (0, ∞) is removed.

#### Ultrafilters

There are many other characterizations of "ultrafilter" and "ultra prefilter," which are listed in the article on ultrafilters. Important properties of ultrafilters are also described in that article.

A non–empty family ${\displaystyle {\mathcal {B}}\subseteq \wp (X)}$ of sets is/is an:
1. Ultra [8] [29] if ${\displaystyle \varnothing \not \in {\mathcal {B}}}$ and any of the following equivalent conditions are satisfied:
1. For every set ${\displaystyle S\subseteq X}$ there exists some set ${\displaystyle B\in {\mathcal {B}}}$ such that BS or BXS (or equivalently, such that ${\displaystyle B\cap S}$ equals ${\displaystyle B}$ or ${\displaystyle \varnothing }$).
2. For every set SB there exists some set ${\displaystyle B\in {\mathcal {B}}}$ such that ${\displaystyle B\cap S}$ equals ${\displaystyle B}$ or ${\displaystyle \varnothing .}$
• This characterization of "${\displaystyle {\mathcal {B}}}$ is ultra" does not depend on the set ${\displaystyle X,}$ so mentioning the set ${\displaystyle X}$ is optional when using the term "ultra."
3. For every set ${\displaystyle S}$ (not necessarily even a subset of ${\displaystyle X}$) there exists some set ${\displaystyle B\in {\mathcal {B}}}$ such that ${\displaystyle B\cap S}$ equals ${\displaystyle B}$ or ${\displaystyle \varnothing .}$
• If ${\displaystyle {\mathcal {B}}}$ satisfies this condition then so does every superset . In particular, a set ${\displaystyle {\mathcal {F}}}$ is ultra if and only if ${\displaystyle \varnothing \not \in {\mathcal {F}}}$ and ${\displaystyle {\mathcal {F}}}$ contains as a subset some ultra family of sets.
2. Ultra prefilter [8] [29] if it is a prefilter that is also ultra. Equivalently, it is a filter subbase that is ultra.
• A filter subbase that is ultra is necessarily a prefilter. [proof 1]
3. Ultrafilter on ${\displaystyle X}$ [8] [29] if it is a filter on ${\displaystyle X}$ that is ultra. Equivalently, an ultrafilter on ${\displaystyle X}$ is a filter ${\displaystyle {\mathcal {B}}}$ on ${\displaystyle X}$ that satisfies any of the following equivalent conditions:
1. ${\displaystyle {\mathcal {B}}}$ is generated by an ultra prefilter;
2. For any ${\displaystyle S\subseteq X,}$${\displaystyle S\in {\mathcal {B}}}$ or XS ∈ ℬ. [16]
3. (X ∖ ℬ) = ℘(X). This condition can be restated as: ℘(X) is partitioned by ${\displaystyle {\mathcal {B}}}$ and its dual X ∖ ℬ.
• The sets ${\displaystyle {\mathcal {B}}}$ and X ∖ ℬ are disjoint whenever ${\displaystyle {\mathcal {B}}}$ is a prefilter.
4. For any ${\displaystyle R,S\subseteq X,}$ if RS ∈ ℬ then ${\displaystyle R\in {\mathcal {B}}}$ or ${\displaystyle S\in {\mathcal {B}}}$ (a filter with this property is called a prime filter).
• This property extends to any finite union of two or more sets.
5. For any ${\displaystyle R,S\subseteq X,}$ if ${\displaystyle R\cup S=X}$ then ${\displaystyle R\in {\mathcal {B}}}$ or ${\displaystyle S\in {\mathcal {B}}.}$
6. For any ${\displaystyle R,S\subseteq X,}$ if RS ∈ ℬ and ${\displaystyle R\cap S=\varnothing }$ then either${\displaystyle R\in {\mathcal {B}}}$ or ${\displaystyle S\in {\mathcal {B}}.}$
7. ${\displaystyle {\mathcal {B}}}$ is a maximal filter on ${\displaystyle X}$; meaning that if ${\displaystyle {\mathcal {F}}}$ is a filter on ${\displaystyle X}$ such that then =.
• An ultra prefilter has a similar characterization in terms of maximality with respect to , where in the special case of filters, ${\displaystyle {\mathcal {B}}\leq {\mathcal {F}}}$ if and only if .
• Because ${\displaystyle \geq }$ is for filters the analog of "is a subnet of," (specifically, "subnet" should mean "AA-subnet," which is defined below) an ultrafilter can be interpreted as being analogous to some sort of "maximally deep net." This idea is actually made rigorous by ultranets.

The ultrafilter lemma/principle/theorem [10]  (Tarski (1930) [30] )  Every filter on a set ${\displaystyle X}$ is a subset of some ultrafilter on ${\displaystyle X.}$

A consequence of the ultrafilter lemma is that every filter is equal to the intersection of all ultrafilters containing it. [10]

Examples
• Any family that has a singleton set as an element is ultra, in which case it will then be an ultra prefilter if and only if it also has the finite intersection property.
• The trivial filter ${\displaystyle \{X\}}$ on ${\displaystyle X}$ is ultra if and only if ${\displaystyle X}$ is a singleton set.
• A family ${\displaystyle {\mathcal {B}}\subseteq \wp (X)}$ of sets is an ultra prefilter if and only if it is equivalent (with respect to ${\displaystyle \leq }$) to some ultrafilter on ${\displaystyle X,}$ in which case this ultrafilter is necessarily equal to the upward closure ${\displaystyle {\mathcal {B}}^{\uparrow X}.}$ Consequently, a family ${\displaystyle {\mathcal {B}}\subseteq \wp (X)}$ of sets is an ultra prefilter if and only if ${\displaystyle {\mathcal {B}}^{\uparrow X}}$ is an ultrafilter on ${\displaystyle X.}$

#### Free, principal, and kernels

The kernel is useful in classifying the properties of prefilters and other families of sets.

The kernel [6] of a family of sets ${\displaystyle {\mathcal {B}}}$ is the intersection of all sets that are elements of ${\displaystyle {\mathcal {B}}}$:
${\displaystyle \operatorname {ker} {\mathcal {B}}=\bigcap _{B\in {\mathcal {B}}}B}$

If ${\displaystyle {\mathcal {B}}\subseteq \wp (X)}$ then for any point ${\displaystyle x,}$${\displaystyle x\not \in \operatorname {ker} {\mathcal {B}}}$if and only if ${\displaystyle X\setminus \{x\}\in {\mathcal {B}}^{\uparrow X}.}$

Properties of kernels

For any ${\displaystyle {\mathcal {B}}\subseteq \wp (X),}$ the ker (ℬX) = ker ℬ and this set is also equal to the kernel of the π–system that it generated by ${\displaystyle {\mathcal {B}}.}$ In particular, if ${\displaystyle {\mathcal {B}}}$ is a filter subbase then the kernels of all of the following sets are equal:

(1) ${\displaystyle {\mathcal {B}},}$ (2) the π–system generated by ${\displaystyle {\mathcal {B}},}$ and (3) the filter generated by ${\displaystyle {\mathcal {B}}.}$

If ${\displaystyle f}$ is a map then f (ker ℬ) ⊆ ker f () and f–1(ker ℬ) = ker f–1(ℬ). If ${\displaystyle {\mathcal {B}}\leq {\mathcal {C}}}$ then ker 𝒞 ⊆ ker ℬ while if ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {C}}}$ are equivalent then ker ℬ = ker 𝒞. If ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {C}}}$ are principal then they are equivalent if and only if ker ℬ = ker 𝒞.

Classifying families of sets by their kernels
A family ${\displaystyle {\mathcal {B}}}$ of sets is/is an:
1. Free [7] if ker ℬ = ∅, or equivalently, if { X ∖ { x } : xX } ⊆ ℬX; this can be restated as { X ∖ { x } : xX } ≤ ℬ.
• A filter ${\displaystyle {\mathcal {F}}}$ on ${\displaystyle X}$ is free if and only if ${\displaystyle X}$ is infinite and ${\displaystyle {\mathcal {F}}}$ contains the Fréchet filter on ${\displaystyle X}$ as a subset.
2. Fixed if ker ℬ ≠ ∅ in which case, ${\displaystyle {\mathcal {B}}}$ is said to be fixed by any point x ∈ ker ℬ.
• Any fixed family is necessarily a filter subbase.
3. Principal [7] if ker ℬ ∈ ℬ.
• A proper principal family of sets is necessarily a prefilter.
4. Discrete or Principal at${\displaystyle x\in X}$ [24] if { x } = ker ℬ ∈ ℬ.
• The principal filter at ${\displaystyle x}$ on ${\displaystyle X}$ is the filter { x }X. A filter ${\displaystyle {\mathcal {F}}}$ is principal at ${\displaystyle x}$ if and only if ℱ = { x }X.

Family of examples: For any non–empty C ⊆ ℝ, the family C = { ℝ ∖ (r + C) : r ∈ ℝ } is free but it is a filter subbase if and only if no finite union of the form (r1 + C) ∪ ⋅⋅⋅ ∪ (rn + C) covers , in which case the filter that it generates will also be free. In particular, C is a filter subbase if ${\displaystyle C}$ is countable (e.g. C = ℚ, , the primes), a meager set in , a set of finite measure, or a bounded subset of . If ${\displaystyle C}$ is a singleton set then C is a subbasis for the Fréchet filter on .

Characterizations of fixed ultra prefilters

If a family of sets ${\displaystyle {\mathcal {B}}}$ is fixed (i.e. ker ℬ ≠ ∅) then ${\displaystyle {\mathcal {B}}}$ is ultra if and only if some element of ${\displaystyle {\mathcal {B}}}$ is a singleton set, in which case ${\displaystyle {\mathcal {B}}}$ will necessarily be a prefilter. Every principal prefilter is fixed, so a principal prefilter ${\displaystyle {\mathcal {B}}}$ is ultra if and only if ${\displaystyle \operatorname {ker} {\mathcal {B}}}$ is a singleton set.

Every filter on ${\displaystyle X}$ that is principal at a single point is an ultrafilter, and if in addition ${\displaystyle X}$ is finite, then there are no ultrafilters on ${\displaystyle X}$ other than these. [7]

The next theorem shows that every ultrafilter falls into one of two categories: either it is free or else it is a principal filter generated by a single point.

Proposition  If ${\displaystyle {\mathcal {F}}}$ is an ultrafilter on ${\displaystyle X}$ then the following are equivalent:

1. ${\displaystyle {\mathcal {F}}}$ is fixed, or equivalently, not free, meaning ker ℱ ≠ ∅.
2. ${\displaystyle {\mathcal {F}}}$ is principle, meaning ker ℱ ∈ ℱ.
3. Some element of ${\displaystyle {\mathcal {F}}}$ is a finite set.
4. Some element of ${\displaystyle {\mathcal {F}}}$ is a singleton set.
5. ${\displaystyle {\mathcal {F}}}$ is principle at some point of ${\displaystyle X,}$ which means ker ℱ = { x } ∈ ℱ for ${\displaystyle x\in X.}$
6. ${\displaystyle {\mathcal {F}}}$ does not contain the Fréchet filter on ${\displaystyle X.}$
Finite prefilters and finite sets

If a filter subbase ${\displaystyle {\mathcal {B}}}$ is finite then it is fixed (i.e. not free); this is because ker ℬ = B is a finite intersection and the filter subbase ${\displaystyle {\mathcal {B}}}$ has the finite intersection property. A finite prefilter is necessarily principal, although it does not have to be closed under finite intersections.

If ${\displaystyle X}$ is finite then all of the conclusions above hold for any ${\displaystyle {\mathcal {B}}\subseteq \wp (X).}$ In particular, on a finite set ${\displaystyle X,}$ there are no free filter subbases (or prefilters), all prefilters are principal, and all filters on ${\displaystyle X}$ are principal filters generated by their (non–empty) kernels.

The trivial filter ${\displaystyle \{X\}}$ is always a finite filter on ${\displaystyle X}$ and if ${\displaystyle X}$ is infinite then it is the only finite filter because a non–trivial finite filter on a set ${\displaystyle X}$ is possible if and only if ${\displaystyle X}$ is finite. However, on any infinite set there are non–trivial filter subbases and prefilters that are finite (although they cannot be filters). If ${\displaystyle X}$ is a singleton set then the trivial filter ${\displaystyle \{X\}}$ is the only proper subset of ℘(X). This set ${\displaystyle \{X\}}$ is a principal ultra prefilter and any superset ℱ ⊇ ℬ (where ℱ ⊆ ℘(Y) and ${\displaystyle X\subseteq Y}$) with the finite intersection property will also be a principal ultra prefilter (even if ${\displaystyle Y}$ is infinite).

### Finer/coarser, subordination, and meshing

Throughout ${\displaystyle {\mathcal {B}},}$${\displaystyle {\mathcal {C}},}$ and ${\displaystyle {\mathcal {F}}}$ will be any subsets of ℘(X).

The preorder ${\displaystyle \leq }$ that is defined below is of fundamental importance for the use of prefilters (and filters) in topology. For instance, this preorder is used to define the prefilter equivalent of "subsequence", [23] where "${\displaystyle {\mathcal {F}}\geq {\mathcal {C}}}$" can be interpreted as "${\displaystyle {\mathcal {F}}}$ is a subsequence of ${\displaystyle {\mathcal {C}}}$" (so "subordinate to" is the prefilter equivalent of "subsequence of"). It is also be used to define prefilter convergence in a topological space. The definition of ${\displaystyle {\mathcal {B}}}$ meshes with ${\displaystyle {\mathcal {C}},}$ which is closely related to the preorder ${\displaystyle \leq }$, is used in Topology to define cluster points.

Two families of sets ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {C}}}$mesh [8] and are compatible, indicated by writing ℬ # 𝒞, if ${\displaystyle B\cap C\neq \varnothing }$ for all ${\displaystyle B\in {\mathcal {B}}}$ and ${\displaystyle C\in {\mathcal {C}}}$. If ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle {\mathcal {C}}}$ do not mesh then they are dissociated. If ${\displaystyle S}$ is a set (but not necessarily a family of sets) then ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle S}$ are said to mesh if ${\displaystyle {\mathcal {B}}}$ and ${\displaystyle \{S\}}$ mesh, or equivalently, if the trace|S = { BS:B ∈ ℬ } of ${\displaystyle {\mathcal {B}}}$ on S does not contain the empty set.
Declare that ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}},}$${\displaystyle {\mathcal {F}}\geq {\mathcal {C}},}$ and 𝒞, stated as ${\displaystyle {\mathcal {C}}}$ is coarser than${\displaystyle {\mathcal {F}}}$ and ${\displaystyle {\mathcal {F}}}$ is finer than (or subordinate to) ${\displaystyle {\mathcal {C}},}$ [10] [11] [12] [9] if any of the following equivalent conditions hold:
1. Definition: Every ${\displaystyle C\in {\mathcal {C}}}$contains some ${\displaystyle F\in {\mathcal {F}}.}$ Explicitly, this means that for every ${\displaystyle C\in {\mathcal {C}},}$ there is some ${\displaystyle F\in {\mathcal {F}}}$ such that ${\displaystyle F\subseteq C.}$
• Said more briefly, ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}}}$ if every set in ${\displaystyle {\mathcal {C}}}$ is larger than some set in ${\displaystyle {\mathcal {F}}.}$ Here, a "larger set" means a superset.
2. ${\displaystyle \{C\}\leq {\mathcal {F}}}$ for every ${\displaystyle C\in {\mathcal {C}}.}$
• In words, ${\displaystyle \{C\}\leq {\mathcal {F}}}$ states exactly that ${\displaystyle C}$ is larger than some set in ${\displaystyle {\mathcal {F}}.}$ The equivalence of (a) and (b) follows immediately.
• From this characterization, it follows that if ${\displaystyle \left({\mathcal {C}}_{i}\right)_{i\in I}}$ are families of sets, then 𝒞i if and only if 𝒞i for all ${\displaystyle i\in I.}$
3. ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}}^{\uparrow X},}$ which is equivalent to ${\displaystyle {\mathcal {C}}\subseteq {\mathcal {F}}^{\uparrow X}}$;
4. ${\displaystyle {\mathcal {C}}^{\uparrow X}\leq {\mathcal {F}}}$;
5. ${\displaystyle {\mathcal {C}}^{\uparrow X}\leq {\mathcal {F}}^{\uparrow X},}$ which is equivalent to ${\displaystyle {\mathcal {C}}^{\uparrow X}\subseteq {\mathcal {F}}^{\uparrow X}}$;

and if in addition ${\displaystyle {\mathcal {F}}}$is upward closed, which means that =X, then this list can be extended to include:

1. ${\displaystyle {\mathcal {C}}\subseteq {\mathcal {F}}.}$ [6]
• So in this case, this definition of "${\displaystyle {\mathcal {F}}}$ is finer than ${\displaystyle {\mathcal {C}}}$" would be identical to the topological definition of "finer" had ${\displaystyle {\mathcal {C}}}$ and ${\displaystyle {\mathcal {F}}}$ been topologies on ${\displaystyle X.}$

If an upward closed family ${\displaystyle {\mathcal {F}}}$ is finer than ${\displaystyle {\mathcal {C}}}$ (i.e. ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}}}$) but ${\displaystyle {\mathcal {C}}\neq {\mathcal {F}}}$ then ${\displaystyle {\mathcal {F}}}$ is said to be strictly finer than ${\displaystyle {\mathcal {C}}}$ and ${\displaystyle {\mathcal {C}}}$ is strictly coarser than ${\displaystyle {\mathcal {F}}.}$ Two families ${\displaystyle {\mathcal {C}}}$ and ${\displaystyle {\mathcal {F}}}$ are comparable if one of these sets is finer than the other. [10]

Proof

Throughout this proof, "set" will mean "subset of ${\displaystyle X}$" unless indicated otherwise. A "larger set" means a superset. This proof is written with the aim of making the proof of each implication as intuitively clear as possible. For this reason, it is written in a more conversational style and it also tries to limit assigning symbols to sets in ${\displaystyle {\mathcal {F}}.}$ Because of characterization (b), it would not be beneficial to attempt this with sets in ${\displaystyle {\mathcal {C}}.}$

Statement (a) defines ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}},}$ where by definition, ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}}}$ if and only if

every set in ${\displaystyle {\mathcal {C}}}$ is larger than some set in ${\displaystyle {\mathcal {F}}.}$

(def)

If ${\displaystyle C}$ is a set then ${\displaystyle \{C\}\leq {\mathcal {F}}}$ if and only if ${\displaystyle C}$ is larger than some set in ${\displaystyle {\mathcal {F}}.}$ The equivalence of (b) and (def) follows immediately. The corollaries of part (b) given in the proposition's statement now hold and will be used later.

If (def) is true, then it will remain true if ${\displaystyle {\mathcal {C}}}$ is replaced by a smaller sub-family. For this reason, ${\displaystyle {\mathcal {C}}^{\uparrow X}\leq {\mathcal {F}}}$ implies ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}},}$ which is exactly (d) ⇒ (def) . Similarly, (e) ⇒ (c).

If (def) is true, then it will remain true if ${\displaystyle {\mathcal {F}}}$ is enlarged. For this reason, ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}}}$ implies ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}}^{\uparrow X},}$ which is exactly (def) ⇒ (c). Similarly, (d) ⇒ (e).

If ${\displaystyle C}$ is a set that is larger than some set in ${\displaystyle {\mathcal {F}}}$ then so is every superset of ${\displaystyle C.}$ By definition, ${\displaystyle \{C\}^{\uparrow X}}$ consists exactly of all supersets of ${\displaystyle C.}$ For this reason, by using the corollary of (b), we conclude that ${\displaystyle \{C\}\leq {\mathcal {F}}}$ implies ${\displaystyle \{C\}^{\uparrow X}\leq {\mathcal {F}}.}$ Consequently, if (def) holds then ${\displaystyle \{C\}^{\uparrow X}\leq {\mathcal {F}}}$ for every ${\displaystyle C\in {\mathcal {C}}}$ so by taking the union of these families ${\displaystyle \{C\}^{\uparrow X}}$ as ${\displaystyle C}$ ranges over ${\displaystyle {\mathcal {C}},}$ the corollary of (b) gives

${\displaystyle {\mathcal {C}}^{\uparrow X}=\bigcup _{C\in {\mathcal {C}}}\{C\}^{\uparrow X}\leq {\mathcal {F}}}$

This proves that (def) ⇒ (d). Applying (def) ⇒ (d) with ${\displaystyle {\mathcal {F}}^{\uparrow X}}$ in place of ${\displaystyle {\mathcal {F}}}$ proves (c) ⇒ (e). We have so far established that (d) ⇔ (a) ⇔ (b) and (c) ⇔ (e) as well as (a) ⇒ (c). It remains to show (c) ⇒ (a) and to justify why ${\displaystyle \leq }$ can be replaced with ${\displaystyle \subseteq }$ in statements (c) and (e).

By definition, the upward closure ${\displaystyle {\mathcal {F}}^{\uparrow X}}$ consists of all sets larger than some set in ${\displaystyle {\mathcal {F}}.}$ Said differently, if ${\displaystyle C}$ is a set then

C ∈ ℱX${\displaystyle C}$ is larger than some set in ${\displaystyle {\mathcal {F}}.}$

(↑X def)

Restricting ${\displaystyle C}$ to range over ${\displaystyle {\mathcal {C}},}$ it follows from (↑X def) that 𝒞 X (def) holds, where the left hand side of this equivalence is statement (c). We have just shown that

𝒞 X${\displaystyle {\mathcal {C}}\leq {\mathcal {F}}}$.

By definition, ${\displaystyle {\mathcal {F}}}$ is upward closed if and only if =X, in which case the above equivalence becomes: (f) ⇔ (a). In particular, because the family ${\displaystyle {\mathcal {F}}^{\uparrow X}}$ is always upward closed, this immediately gives:

𝒞 X𝒞 X,       and also that      ${\displaystyle {\mathcal {C}}^{\uparrow X}\subseteq {\mathcal {F}}^{\uparrow X}}$𝒞XX

It remains to show (c) ⇒ (a). By (↑X def) , if a set S is in ${\displaystyle {\mathcal {F}}^{\uparrow X}}$ then S is larger than some set in ${\displaystyle {\mathcal {F}}.}$ So in particular, if some set ${\displaystyle C}$ is larger than some set in ${\displaystyle {\mathcal {F}}^{\uparrow X}}$ (call it S) then ${\displaystyle C}$ will necessarily be larger than some set in ${\displaystyle {\mathcal {F}}.}$ In short, { C } X implies { C } . The corollary of (b) allows us to conclude that 𝒞 X implies ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}},}$ which is (c) ⇒ (a). ∎

Assume that ${\displaystyle {\mathcal {C}}}$ and ${\displaystyle {\mathcal {F}}}$ are families of sets that satisfy ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}}.}$ Then ker ℱ ⊆ ker 𝒞, and ${\displaystyle {\mathcal {C}}\neq \varnothing }$ implies ${\displaystyle {\mathcal {F}}\neq \varnothing ,}$ and also ${\displaystyle \varnothing \in {\mathcal {C}}}$ implies ${\displaystyle \varnothing \in {\mathcal {F}}.}$ If in addition to ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}},}$${\displaystyle {\mathcal {F}}}$ is a filter subbase and ${\displaystyle {\mathcal {C}}\neq \varnothing ,}$ then ${\displaystyle {\mathcal {C}}}$ is a filter subbase [9] and also ${\displaystyle {\mathcal {C}}}$ and ${\displaystyle {\mathcal {F}}}$ mesh. [18] [proof 2] Every filter subbase is coarser than both the π-system that it generates and the filter that it generates. [9]

If ${\displaystyle {\mathcal {C}}}$ and ${\displaystyle {\mathcal {F}}}$ are families such that ${\displaystyle {\mathcal {C}}\leq {\mathcal {F}},}$ the family ${\displaystyle {\mathcal {C}}}$ is ultra, and ${\displaystyle \varnothing \not \in {\mathcal {F}},}$ then