Filter (set theory)

Short description: Family of sets representing "large" sets

In mathematics, a filter on a set X is a family ℬ of subsets such that: [1]

1. X∈ℬ and ∅∉ℬ
2. if A∈ℬ and B∈ℬ, then A∩B∈ℬ
3. If A,B⊂X,A∈ℬ, and A⊂B, then B∈ℬ

A filter on a set may be thought of as representing a "collection of large subsets",[2] one intuitive example being the neighborhood filter. Filters appear in order theory, model theory, and set theory, but can also be found in topology, from which they originate. The dual notion of a filter is an ideal.

Filters were introduced by Henri Cartan in 1937[3][4] and as described in the article dedicated to filters in topology, they were subsequently used by Nicolas Bourbaki in their book Topologie Générale as an alternative to the related notion of a net developed in 1922 by E. H. Moore and Herman L. Smith. Order filters are generalizations of filters from sets to arbitrary partially ordered sets. Specifically, a filter on a set is just a proper order filter in the special case where the partially ordered set consists of the power set ordered by set inclusion.

## Contents

* 1 Preliminaries, notation, and basic notions
* 2 Filters and prefilters
* 2.1 Basic examples
* 2.2 Ultrafilters
* 2.3 Kernels
* 2.3.1 Classifying families by their kernels
* 2.3.2 Characterizing fixed ultra prefilters
* 2.4 Finer/coarser, subordination, and meshing
* 2.4.1 Equivalent families of sets
* 3 Set theoretic properties and constructions
* 3.1 Trace and meshing
* 3.2 Images and preimages under functions
* 3.2.1 Subordination is preserved by images and preimages
* 3.3 Products of prefilters
* 3.4 Set subtraction and some examples
* 4 Filters and nets
* 4.1 Nets to prefilters
* 4.2 Prefilters to nets
* 4.2.1 Partially ordered net
* 4.3 Subordinate filters and subnets
* 4.3.1 Non–equivalence of subnets and subordinate filters
* 5 See also
* 6 Notes
* 7 Citations
* 8 References

## Preliminaries, notation, and basic notions

In this article, upper case Roman letters like S and X denote sets (but not families unless indicated otherwise) and ℘(X) will denote the power set of X. A subset of a power set is called a family of sets (or simply, a family) where it is over X if it is a subset of ℘(X). Families of sets will be denoted by upper case calligraphy letters such as ℬ,𝒞, and ℱ. Whenever these assumptions are needed, then it should be assumed that X is non–empty and that ℬ,ℱ, etc. are families of sets over 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 as they are used. Unfortunately, not all notation related to filters is well established and some notation varies greatly across the literature (for example, 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 prefilters 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 X[5][6] of a family of sets ℬ⊆℘(X) is

> ℬ↑X:={S⊆X:B⊆S for some B∈ℬ}=⋃B∈ℬ{S:B⊆S⊆X}

and similarly the downward closure of ℬ is ℬ↓:={S⊆B:B∈ℬ}=⋃B∈ℬ℘(B).

Notation and Definition | Name

|

ker⁡ℬ=⋂B∈ℬB | Kernel of ℬ[6]
S∖ℬ:={S∖B:B∈ℬ}={S}(∖)ℬ | Dual of ℬ in S where S is a set.[7]
ℬ|S:={B∩S:B∈ℬ}=ℬ(∩){S} | Trace of ℬ on S[7] or the restriction of ℬ to S where S is a set; sometimes denoted by ℬ∩S
ℬ(∩)𝒞={B∩C:B∈ℬ and C∈𝒞}[8] | Elementwise (set) intersection (ℬ∩𝒞 will denote the usual intersection)
ℬ(∪)𝒞={B∪C:B∈ℬ and C∈𝒞}[8] | Elementwise (set) union (ℬ∪𝒞 will denote the usual union)
ℬ(∖)𝒞={B∖C:B∈ℬ and C∈𝒞} | Elementwise (set) subtraction (ℬ∖𝒞 will denote the usual set subtraction)
ℬ#X=ℬ#={S⊆X:S∩B≠∅ for all B∈ℬ} | Grill of ℬ in X[9]
℘(X)={S:S⊆X} | Power set of a set X[6]

For any two families 𝒞 and ℱ, declare that 𝒞≤ℱ if and only if for every C∈𝒞 there exists some F∈ℱ such that F⊆C, in which case it is said that 𝒞 is coarser than ℱ and that ℱ is finer than (or subordinate to) 𝒞.[10][11][12] The notation ℱ⊢𝒞 or ℱ≥𝒞 may also be used in place of 𝒞≤ℱ. Two families ℬ and 𝒞 mesh,[7] written ℬ#𝒞, if B∩C≠∅ for all B∈ℬ and C∈𝒞.

Throughout, f is a map and S is a set.

Notation and Definition | Name

|

f−1(ℬ)={f−1(B):B∈ℬ}[13] | Image of ℬ under f−1, or the preimage of ℬ under f
f−1(S)={x∈domain⁡f:f(x)∈S} | Image of S under f−1, or the preimage of S under f
f(ℬ)={f(B):B∈ℬ}[14] | Image of ℬ under f
f(S)={f(s):s∈S∩domain⁡f} | Image of S under f
image⁡f=f(domain⁡f) | Image (or range) of f

Nets and their tails

A directed set is a set I together with a preorder, which will be denoted by ≤ (unless explicitly indicated otherwise), that makes (I,≤) into an (upward) directed set;[15] this means that for all i,j∈I, there exists some k∈I such that i≤k and j≤k. For any indices i and j, the notation j≥i is defined to mean i≤j while i<j is defined to mean that i≤j holds but it is not true that j≤i (if ≤ is antisymmetric then this is equivalent to i≤j and i≠j).

A net in X[15] is a map from a non–empty directed set into X. The notation x∙=(xi)i∈I will be used to denote a net with domain I.

Notation and Definition | Name

|

I≥i={j∈I:j≥i} | Tail or section of I starting at i∈I where (I,≤) is a directed set.
x≥i={xj:j≥i and j∈I} | Tail or section of x∙=(xi)i∈I starting at i∈I
Tails⁡(x∙)={x≥i:i∈I} | Set or prefilter of tails/sections of x∙. Also called the eventuality filter base generated by (the tails of) x∙=(xi)i∈I. If x∙ is a sequence then Tails⁡(x∙) is also called the sequential filter base.[16]
TailsFilter⁡(x∙)=Tails⁡(x∙)↑X | (Eventuality) filter of/generated by (tails of) x∙=(xi)i∈I[16]
f(I≥i)={f(j):j≥i and j∈I} | Tail or section of a net f:I->X starting at i∈I[16] where (I,≤) is a directed set.

Warning about using strict comparison

If x∙=(xi)i∈I is a net and i∈I then it is possible for the set x>i={xj:j>i and j∈I}, which is called the tail of x∙ after i, to be empty (for example, this happens if i is an upper bound of the directed set I). In this case, the family {x>i:i∈I} would contain the empty set, which would prevent it from being a prefilter (defined later). This is the (important) reason for defining Tails⁡(x∙) as {x≥i:i∈I} rather than {x>i:i∈I} or even {x>i:i∈I}∪{x≥i:i∈I} 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 ≤.

## Filters and prefilters

The following is a list of properties that a family ℬ 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 ℬ⊆℘(X).

> The family of sets ℬ is:

>   1. Proper or nondegenerate if ∅∉ℬ. Otherwise, if ∅∈ℬ, then it is called improper[17] or degenerate.
>   2. Directed downward[15] if whenever A,B∈ℬ then there exists some C∈ℬ such that C⊆A∩B.
>     * This property can be characterized in terms of directedness, which explains the word "directed": A binary relation ⪯ on ℬ is called (upward) directed if for any two A and B, there is some C satisfying A⪯C and B⪯C. Using ⊇ in place of ⪯ gives the definition of directed downward whereas using ⊆ instead gives the definition of directed upward. Explicitly, ℬ is directed downward (resp. directed upward) if and only if for all A,B∈ℬ, there exists some "greater" C∈ℬ such that A⊇C and B⊇C (resp. such that A⊆C and B⊆C) − where the "greater" element is always on the right hand side,[note 1] − which can be rewritten as A∩B⊇C (resp. as A∪B⊆C).
>     * If a family ℬ has a greatest element with respect to ⊇ (for example, if ∅∈ℬ) then it is necessarily directed downward.
>   3. Closed under finite intersections (resp. unions) if the intersection (resp. union) of any two elements of ℬ is an element of ℬ.
>     * If ℬ is closed under finite intersections then ℬ is necessarily directed downward. The converse is generally false.
>   4. Upward closed or Isotone in X[5] if ℬ⊆℘(X) and ℬ=ℬ↑X, or equivalently, if whenever B∈ℬ and some set C satisfies B⊆C⊆X, then C∈ℬ. Similarly, ℬ 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 ℬ↑X, which is the upward closure of ℬ in X, is the unique smallest (with respect to ⊆) isotone family of sets over X having ℬ as a subset.

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

Filters(X)=DualIdeals(X)∖{℘(X)}⊆Prefilters(X)⊆FilterSubbases(X).

> A family ℬ is/is a(n):

>   1. Ideal[17][18] if ℬ≠∅ is downward closed and closed under finite unions.
>   2. Dual ideal on X[19] if ℬ≠∅ is upward closed in X and also closed under finite intersections. Equivalently, ℬ≠∅ is a dual ideal if for all R,S⊆X, R∩S∈ℬ if and only if R,S∈ℬ.[9]
>     * Explanation of the word "dual": A family ℬ is a dual ideal (resp. an ideal) on X if and only if the dual of ℬ in X, which is the family X∖ℬ:={X∖B:B∈ℬ}, is an ideal (resp. a dual ideal) on X. In other words, dual ideal means "dual of an ideal". The family X∖ℬ should not be confused with ℘(X)∖ℬ={S⊆X:S∉ℬ} because these two sets are not equal in general; for instance, X∖ℬ=℘(X) if and only if ℬ=℘(X). The dual of the dual is the original family, meaning X∖(X∖ℬ)=ℬ. The set X belongs to the dual of ℬ if and only if ∅∈ℬ.[17]
>   3. Filter on X[19][7] if ℬ is a proper dual ideal on X. That is, a filter on X is a non−empty subset of ℘(X)∖{∅} that is closed under finite intersections and upward closed in X. Equivalently, it is a prefilter that is upward closed in X. In words, a filter on X is a family of sets over X that (1) is not empty (or equivalently, it contains X), (2) is closed under finite intersections, (3) is upward closed in 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/non–degenerate dual ideal.[20] It is recommended that readers always check how "filter" is defined when reading mathematical literature. However, the definitions of "ultrafilter," "prefilter," and "filter subbase" always require non-degeneracy. This article uses Henri Cartan's original definition of "filter",[3][4] which required non–degeneracy.
>     * A dual filter on X is a family ℬ whose dual X∖ℬ is a filter on X. Equivalently, it is an ideal on X that does not contain X as an element.
>     * The power set ℘(X) is the one and only dual ideal on X that is not also a filter. Excluding ℘(X) from the definition of "filter" in topology has the same benefit as excluding 1 from the definition of "prime number": it obviates the need to specify "non-degenerate" (the analog of "non-unital" or "non-1") in many important results, thereby making their statements less awkward.
>   4. Prefilter or filter base[7][21] if ℬ≠∅ is proper and directed downward. Equivalently, ℬ is called a prefilter if its upward closure ℬ↑X is a filter. It can also be defined as any family that is equivalent (with respect to ≤) to some filter.[8] A proper family ℬ≠∅ is a prefilter if and only if ℬ(∩)ℬ≤ℬ.[8] A family is a prefilter if and only if the same is true of its upward closure.
>     * If ℬ is a prefilter then its upward closure ℬ↑X is the unique smallest (relative to ⊆) filter on X containing ℬ and it is called the filter generated by ℬ. A filter ℱ is said to be generated by a prefilter ℬ if ℱ=ℬ↑X, in which ℬ is called a filter base for ℱ.
>     * Unlike a filter, a prefilter is not necessarily closed under finite intersections.
>   5. π–system if ℬ≠∅ is closed under finite intersections. Every non–empty family ℬ is contained in a unique smallest π–system called the π–system generated by ℬ, which is sometimes denoted by π(ℬ). It is equal to the intersection of all π–systems containing ℬ and also to the set of all possible finite intersections of sets from ℬ: π(ℬ)={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 ≤) to the π–system generated by it and both of these families generate the same filter on X.
>   6. Filter subbase[7][22] and centered[8] if ℬ≠∅ and ℬ satisfies any of the following equivalent conditions:
>     1. ℬ has the finite intersection property, which means that the intersection of any finite family of (one or more) sets in ℬ is not empty; explicitly, this means that whenever n≥1 and B1,…,Bn∈ℬ then ∅≠B1∩⋯∩Bn.
>     2. The π–system generated by ℬ is proper; that is, ∅∉π(ℬ).
>     3. The π–system generated by ℬ is a prefilter.
>     4. ℬ is a subset of some prefilter.
>     5. ℬ is a subset of some filter.
>     * Assume that ℬ is a filter subbase. Then there is a unique smallest (relative to ⊆) filter ℱℬ on X containing ℬ called the filter generated by ℬ, and ℬ is said to be a filter subbase for this filter. This filter is equal to the intersection of all filters on X that are supersets of ℬ. The π–system generated by ℬ, denoted by π(ℬ), will be a prefilter and a subset of ℱℬ. Moreover, the filter generated by ℬ is equal to the upward closure of π(ℬ), meaning π(ℬ)↑X=ℱℬ.[8] However, ℬ↑X=ℱℬ if and only if ℬ is a prefilter (although ℬ↑X is always an upward closed filter subbase for ℱℬ).
>     * A ⊆ –smallest (meaning smallest relative to ⊆ ) prefilter containing a filter subbase ℬ will exist only under certain circumstances. It exists, for example, if the filter subbase ℬ happens to also be a prefilter. It also exists if the filter (or equivalently, the π–system) generated by ℬ is principal, in which case ℬ∪{ker⁡ℬ} is the unique smallest prefilter containing ℬ. Otherwise, in general, a ⊆ –smallest prefilter containing ℬ might not exist. For this reason, some authors may refer to the π–system generated by ℬ as the prefilter generated by ℬ. However, if a ⊆ –smallest prefilter does exist (say it is denoted by minPre⁡ℬ) then contrary to usual expectations, it is not necessarily equal to "the prefilter generated by ℬ" (that is, minPre⁡ℬ≠π(ℬ) is possible). And if the filter subbase ℬ happens to also be a prefilter but not a π-system then unfortunately, "the prefilter generated by this prefilter" (meaning π(ℬ)) will not be ℬ=minPre⁡ℬ (that is, π(ℬ)≠ℬ is possible even when ℬ is a prefilter), which is why this article will prefer the accurate and unambiguous terminology of "the π–system generated by ℬ".
>   7. Subfilter of a filter ℱ and that ℱ is a superfilter of ℬ[17][23] if ℬ is a filter and ℬ⊆ℱ where for filters, ℬ⊆ℱ if and only if ℬ≤ℱ.
>     * 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, ℬ≤ℱ can also be written ℱ⊢ℬ which is described by saying "ℱ is subordinate to ℬ." With this terminology, "is subordinate to" becomes for filters (and also for prefilters) the analog of "is a subsequence of,"[24] which makes this one situation where using the term "subordinate" and symbol ⊢ may be helpful.

There are no prefilters on X=∅ (nor are there any nets valued in ∅), which is why this article, like most authors, will automatically assume without comment that X≠∅ whenever this assumption is needed.

### Basic examples

Named examples

* The singleton set ℬ={X} is called the indiscrete or trivial filter on X.[25][10] It is the unique minimal filter on X because it is a subset of every filter on X; however, it need not be a subset of every prefilter on X.
* The dual ideal ℘(X) is also called the degenerate filter on X[9] (despite not actually being a filter). It is the only dual ideal on X that is not a filter on X.
* If (X,τ) is a topological space and x∈X, then the neighborhood filter 𝒩(x) at x is a filter on X. By definition, a family ℬ⊆℘(X) is called a neighborhood basis (resp. a neighborhood subbase) at x for (X,τ) if and only if ℬ is a prefilter (resp. ℬ is a filter subbase) and the filter on X that ℬ generates is equal to the neighborhood filter 𝒩(x). The subfamily τ(x)⊆𝒩(x) of open neighborhoods is a filter base for 𝒩(x). Both prefilters 𝒩(x) and τ(x) also form a bases for topologies on X, with the topology generated τ(x) being coarser than τ. This example immediately generalizes from neighborhoods of points to neighborhoods of non–empty subsets S⊆X.
* ℬ is an elementary prefilter[26] if ℬ=Tails⁡(x∙) for some sequence x∙=(xi)i=1∞ in X.
* ℬ is an elementary filter or a sequential filter on X[27] if ℬ is a filter on X generated by some elementary prefilter. The filter of tails generated by a sequence that is not eventually constant is necessarily not an ultrafilter.[28] Every principal filter on a countable set is sequential as is every cofinite filter on a countably infinite set.[9] The intersection of finitely many sequential filters is again sequential.[9]
* The set ℱ of all cofinite subsets of X (meaning those sets whose complement in X is finite) is proper if and only if ℱ is infinite (or equivalently, X is infinite), in which case ℱ is a filter on X known as the Fréchet filter or the cofinite filter on X.[10][25] If X is finite then ℱ is equal to the dual ideal ℘(X), which is not a filter. If X is infinite then the family {X∖{x}:x∈X} of complements of singleton sets is a filter subbase that generates the Fréchet filter on X. As with any family of sets over X that contains {X∖{x}:x∈X}, the kernel of the Fréchet filter on X is the empty set: ker⁡ℱ=∅.
* The intersection of all elements in any non–empty family 𝔽⊆Filters⁡(X) is itself a filter on X called the infimum or greatest lower bound of 𝔽 in Filters⁡(X), which is why it may be denoted by ⋀ℱ∈𝔽ℱ. Said differently, ker⁡𝔽=⋂ℱ∈𝔽ℱ∈Filters⁡(X). Because every filter on X has {X} as a subset, this intersection is never empty. By definition, the infimum is the finest/largest (relative to ⊆ and ≤) filter contained as a subset of each member of 𝔽.[10]
* If ℬ and ℱ are filters then their infimum in Filters⁡(X) is the filter ℬ(∪)ℱ.[8] If ℬ and ℱ are prefilters then ℬ(∪)ℱ is a prefilter that is coarser (with respect to ≤) than both ℬ and ℱ (that is, ℬ(∪)ℱ≤ℬ and ℬ(∪)ℱ≤ℱ); indeed, it is one of the finest such prefilters, meaning that if 𝒮 is a prefilter such that 𝒮≤ℬ and 𝒮≤ℱ then necessarily 𝒮≤ℬ(∪)ℱ.[8] More generally, if ℬ and ℱ are non−empty families and if 𝕊:={𝒮⊆℘(X):𝒮≤ℬ and 𝒮≤ℱ} then ℬ(∪)ℱ∈𝕊 and ℬ(∪)ℱ is a greatest element (with respect to ≤) of 𝕊.[8]
* Let ∅≠𝔽⊆DualIdeals⁡(X) and let ∪𝔽=⋃ℱ∈𝔽ℱ. The supremum or least upper bound of 𝔽 in DualIdeals⁡(X), denoted by ⋁ℱ∈𝔽ℱ, is the smallest (relative to ⊆) dual ideal on X containing every element of 𝔽 as a subset; that is, it is the smallest (relative to ⊆) dual ideal on X containing ∪𝔽 as a subset. This dual ideal is ⋁ℱ∈𝔽ℱ=π(∪𝔽)↑X, where π(∪𝔽):={F1∩⋯∩Fn:n∈ℕ and every Fi belongs to some ℱ∈𝔽} is the π–system generated by ∪𝔽. As with any non–empty family of sets, ∪𝔽 is contained in some filter on X if and only if it is a filter subbase, or equivalently, if and only if ⋁ℱ∈𝔽ℱ=π(∪𝔽)↑X is a filter on X, in which case this family is the smallest (relative to ⊆) filter on X containing every element of 𝔽 as a subset and necessarily 𝔽⊆Filters⁡(X).
* Let ∅≠𝔽⊆Filters⁡(X) and let ∪𝔽=⋃ℱ∈𝔽ℱ. The supremum or least upper bound of 𝔽 in Filters⁡(X), denoted by ⋁ℱ∈𝔽ℱ if it exists, is by definition the smallest (relative to ⊆) filter on X containing every element of 𝔽 as a subset. If it exists then necessarily ⋁ℱ∈𝔽ℱ=π(∪𝔽)↑X[10] (as defined above) and ⋁ℱ∈𝔽ℱ will also be equal to the intersection of all filters on X containing ∪𝔽. This supremum of 𝔽 in Filters⁡(X) exists if and only if the dual ideal π(∪𝔽)↑X is a filter on X. The least upper bound of a family of filters 𝔽 may fail to be a filter.[10] Indeed, if X contains at least 2 distinct elements then there exist filters ℬ and 𝒞 on X for which there does not exist a filter ℱ on X that contains both ℬ and 𝒞. If ∪𝔽 is not a filter subbase then the supremum of 𝔽 in Filters⁡(X) does not exist and the same is true of its supremum in Prefilters⁡(X) but their supremum in the set of all dual ideals on X will exist (it being the degenerate filter ℘(X)).[9]
* If ℬ and ℱ are prefilters (resp. filters on X) then ℬ(∩)ℱ is a prefilter (resp. a filter) if and only if it is non–degenerate (or said differently, if and only if ℬ and ℱ mesh), in which case it is one of the coarsest prefilters (resp. the coarsest filter) on X (with respect to ≤) that is finer (with respect to ≤) than both ℬ and ℱ; this means that if 𝒮 is any prefilter (resp. any filter) such that ℬ≤𝒮 and ℱ≤𝒮 then necessarily ℬ(∩)ℱ≤𝒮,[8] in which case it is denoted by ℬ∨ℱ.[9]
* Let I and X be non−empty sets and for every i∈I let 𝒟i be a dual ideal on X. If ℐ is any dual ideal on I then ⋃Ξ∈ℐ⋂i∈Ξ𝒟i is a dual ideal on X called Kowalsky's dual ideal or Kowalsky's filter.[17]
* The club filter of a regular uncountable cardinal is the filter of all sets containing a club subset of κ. It is a κ-complete filter closed under diagonal intersection.

Other examples

* Let X={p,1,2,3} and let ℬ={{p},{p,1,2},{p,1,3}}, which makes ℬ a prefilter and a filter subbase that is not closed under finite intersections. Because ℬ is a prefilter, the smallest prefilter containing ℬ is ℬ. The π–system generated by ℬ is {{p,1}}∪ℬ. In particular, the smallest prefilter containing the filter subbase ℬ is not equal to the set of all finite intersections of sets in ℬ. The filter on X generated by ℬ is ℬ↑X={S⊆X:p∈S}={{p}∪T:T⊆{1,2,3}}. All three of ℬ, the π–system ℬ generates, and ℬ↑X are examples of fixed, principal, ultra prefilters that are principal at the point p;ℬ↑X is also an ultrafilter on X.
* Let (X,τ) be a topological space, ℬ⊆℘(X), and define ℬ‾:={clXB:B∈ℬ}, where ℬ is necessarily finer than ℬ‾.[29] If ℬ is non–empty (resp. non–degenerate, a filter subbase, a prefilter, closed under finite unions) then the same is true of ℬ‾. If ℬ is a filter on X then ℬ‾ is a prefilter but not necessarily a filter on X although (ℬ‾)↑X is a filter on X equivalent to ℬ‾.
* The set ℬ of all dense open subsets of a (non–empty) topological space X is a proper π–system and so also a prefilter. If the space is a Baire space, then the set of all countable intersections of dense open subsets is a π–system and a prefilter that is finer than ℬ. If X=ℝn (with 1≤n∈ℕ) then the set ℬLebFinite of all B∈ℬ such that B has finite Lebesgue measure is a proper π–system and free prefilter that is also a proper subset of ℬ. The prefilters ℬLebFinite and ℬ are equivalent and so generate the same filter on X. The prefilter ℬLebFinite is properly contained in, and not equivalent to, the prefilter consisting of all dense subsets of ℝ. Since X is a Baire space, every countable intersection of sets in ℬLebFinite is dense in X (and also comeagre and non–meager) so the set of all countable intersections of elements of ℬLebFinite is a prefilter and π–system; it is also finer than, and not equivalent to, ℬLebFinite.
* A filter subbase with no ⊆−smallest prefilter containing it: In general, if a filter subbase 𝒮 is not a π–system then an intersection S1∩⋯∩Sn of n sets from 𝒮 will usually require a description involving n variables that cannot be reduced down to only two (consider, for instance π(𝒮) when 𝒮={(−∞,r)∪(r,∞):r∈ℝ}). This example illustrates an atypical class of a filter subbases 𝒮R where all sets in both 𝒮R and its generated π–system can be described as sets of the form Br,s, so that in particular, no more than two variables (specifically, r and s) are needed to describe the generated π–system. For all r,s∈ℝ, let Br,s=(r,0)∪(s,∞), where Br,s=Bmin⁡(r,s),s always holds so no generality is lost by adding the assumption r≤s. For all real r≤s and u≤v, if s or v is non-negative then B−r,s∩B−u,v=B−min⁡(r,u),max⁡(s,v).[note 2] For every set R of positive reals, let[note 3] 𝒮R:={B−r,r:r∈R}={(−r,0)∪(r,∞):r∈R} and ℬR:={B−r,s:r≤s with r,s∈R}={(−r,0)∪(s,∞):r≤s in R}. Let X=ℝ and suppose ∅≠R⊆(0,∞) is not a singleton set. Then 𝒮R is a filter subbase but not a prefilter and ℬR=π(𝒮R) is the π–system it generates, so that ℬR↑X is the unique smallest filter in X=ℝ containing 𝒮R. However, 𝒮R↑X is not a filter on X (nor is it a prefilter because it is not directed downward, although it is a filter subbase) and 𝒮R↑X is a proper subset of the filter ℬR↑X. If R,S⊆(0,∞) are non−empty intervals then the filter subbases 𝒮R and 𝒮S generate the same filter on X if and only if R=S. If 𝒞 is a prefilter satisfying 𝒮(0,∞)⊆𝒞⊆ℬ(0,∞)[note 4] then for any C∈𝒞∖𝒮(0,∞), the family 𝒞∖{C} is also a prefilter satisfying 𝒮(0,∞)⊆𝒞∖{C}⊆ℬ(0,∞). This shows that there cannot exist a minimal/least (with respect to ⊆) 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,∞)=π(𝒮(0,∞)) is removed; that is, (in sharp contrast to filters) there does not exist a minimal/least (with respect to ⊆) prefilter containing the filter subbase 𝒮(0,∞).

### Ultrafilters

Main articles: Ultrafilter (set theory) and Ultrafilter

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.

Ultrafilters(X)=Filters(X)∩UltraPrefilters(X)⊆UltraPrefilters(X)=UltraFilterSubbases(X)⊆Prefilters(X)

> A non–empty family ℬ⊆℘(X) of sets is/is an:

>   8. Ultra[7][30] if ∅∉ℬ and any of the following equivalent conditions are satisfied:
>     1. For every set S⊆X there exists some set B∈ℬ such that B⊆S or B⊆X∖S (or equivalently, such that B∩S equals B or ∅).
>     2. For every set S⊆⋃B∈ℬB there exists some set B∈ℬ such that B∩S equals B or ∅.
>       * This characterization of "ℬ is ultra" does not depend on the set X, so mentioning the set X is optional when using the term "ultra."
>     3. For every set S (not necessarily even a subset of X) there exists some set B∈ℬ such that B∩S equals B or ∅.
>       * If ℬ satisfies this condition then so does every superset ℱ⊇ℬ. For example, if T is any singleton set then {T} is ultra and consequently, any non–degenerate superset of {T} (such as its upward closure) is also ultra.
>   9. Ultra prefilter[7][30] if it is a prefilter that is also ultra. Equivalently, it is a filter subbase that is ultra. A prefilter ℬ is ultra if and only if it satisfies any of the following equivalent conditions:
>     1. ℬ is maximal in Prefilters⁡(X) with respect to ≤, which means that For all 𝒞∈Prefilters⁡(X),ℬ≤𝒞 implies 𝒞≤ℬ.
>     2. For all 𝒞∈Filters⁡(X),ℬ≤𝒞 implies 𝒞≤ℬ.
>       * Although this statement is identical to that given below for ultrafilters, here ℬ is merely assumed to be a prefilter; it need not be a filter.
>     3. ℬ↑X is ultra (and thus an ultrafilter).
>     4. ℬ is equivalent (with respect to ≤) to some ultrafilter.
>     5.     * A filter subbase that is ultra is necessarily a prefilter. A filter subbase is ultra if and only if it is a maximal filter subbase with respect to ≤ (as above).[17]
>   10. Ultrafilter on X[7][30] if it is a filter on X that is ultra. Equivalently, an ultrafilter on X is a filter ℬ on X that satisfies any of the following equivalent conditions:
>     1. ℬ is generated by an ultra prefilter.
>     2. For any S⊆X,S∈ℬ or X∖S∈ℬ.[17]
>     3. ℬ∪(X∖ℬ)=℘(X). This condition can be restated as: ℘(X) is partitioned by ℬ and its dual X∖ℬ.
>       * The sets ℬ and X∖ℬ are disjoint whenever ℬ is a prefilter.
>     4. ℘(X)∖ℬ={S∈℘(X):S∉ℬ} is an ideal.[17]
>     5. For any R,S⊆X, if R∪S=X then R∈ℬ or S∈ℬ.
>     6. For any R,S⊆X, if R∪S∈ℬ then R∈ℬ or S∈ℬ (a filter with this property is called a prime filter).
>       * This property extends to any finite union of two or more sets.
>     7. For any R,S⊆X, if R∪S∈ℬ and R∩S=∅ then either R∈ℬ or S∈ℬ.
>     8. ℬ is a maximal filter on X; meaning that if 𝒞 is a filter on X such that ℬ⊆𝒞 then necessarily 𝒞=ℬ (this equality may be replaced by 𝒞⊆ℬ or by 𝒞≤ℬ).
>       * If 𝒞 is upward closed then ℬ≤𝒞 if and only if ℬ⊆𝒞. So this characterization of ultrafilters as maximal filters can be restated as: For all 𝒞∈Filters⁡(X),ℬ≤𝒞 implies 𝒞≤ℬ.
>       * Because subordination ≥ is for filters the analog of "is a subnet/subsequence of" (specifically, "subnet" should mean "AA–subnet," which is defined below), this characterization of an ultrafilter as being a "maximally subordinate filter" suggests that an ultrafilter can be interpreted as being analogous to some sort of "maximally deep net" (which could, for instance, mean that "when viewed only from X" in some sense, it is indistinguishable from its subnets, as is the case with any net valued in a singleton set for example),[note 5] which is an idea that is actually made rigorous by ultranets. The ultrafilter lemma is then the statement that every filter ("net") has some subordinate filter ("subnet") that is "maximally subordinate" ("maximally deep").

Any non–degenerate 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 {X} on X is ultra if and only if X is a singleton set.

The ultrafilter lemma

The following important theorem is due to Alfred Tarski (1930).[31]

The ultrafilter lemma/principal/theorem[10] (Tarski) -- Every filter on a set X is a subset of some ultrafilter on X.

A consequence of the ultrafilter lemma is that every filter is equal to the intersection of all ultrafilters containing it.[10][proof 1] Assuming the axioms of Zermelo–Fraenkel (ZF), the ultrafilter lemma follows from the Axiom of choice (in particular from Zorn's lemma) but is strictly weaker than it. The ultrafilter lemma implies the Axiom of choice for finite sets. If only dealing with Hausdorff spaces, then most basic results (as encountered in introductory courses) in Topology (such as Tychonoff's theorem for compact Hausdorff spaces and the Alexander subbase theorem) and in functional analysis (such as the Hahn–Banach theorem) can be proven using only the ultrafilter lemma; the full strength of the axiom of choice might not be needed.

### Kernels

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

> The kernel[5] of a family of sets ℬ is the intersection of all sets that are elements of ℬ:

> ker⁡ℬ=⋂B∈ℬB

If ℬ⊆℘(X) then for any point x,x∉ker⁡ℬ if and only if X∖{x}∈ℬ↑X.

Properties of kernels

If ℬ⊆℘(X) then ker⁡(ℬ↑X)=ker⁡ℬ and this set is also equal to the kernel of the π–system that is generated by ℬ. In particular, if ℬ is a filter subbase then the kernels of all of the following sets are equal:

(1) ℬ, (2) the π–system generated by ℬ, and (3) the filter generated by ℬ.

If f is a map then f(ker⁡ℬ)⊆ker⁡f(ℬ) and f−1(ker⁡ℬ)=ker⁡f−1(ℬ). If ℬ≤𝒞 then ker⁡𝒞⊆ker⁡ℬ while if ℬ and 𝒞 are equivalent then ker⁡ℬ=ker⁡𝒞. Equivalent families have equal kernels. Two principal families are equivalent if and only if their kernels are equal; that is, if ℬ and 𝒞 are principal then they are equivalent if and only if ker⁡ℬ=ker⁡𝒞.

#### Classifying families by their kernels

> A family ℬ of sets is:

>   1.   2. Free[6] if ker⁡ℬ=∅, or equivalently, if {X∖{x}:x∈X}⊆ℬ↑X; this can be restated as {X∖{x}:x∈X}≤ℬ.
>     * A filter ℱ on X is free if and only if X is infinite and ℱ contains the Fréchet filter on X as a subset.
>   3. Fixed if ker⁡ℬ≠∅ in which case, ℬ is said to be fixed by any point x∈ker⁡ℬ.
>     * Any fixed family is necessarily a filter subbase.
>   4. Principal[6] if ker⁡ℬ∈ℬ.
>     * A proper principal family of sets is necessarily a prefilter.
>   5. Discrete or Principal at x∈X[25] if {x}=ker⁡ℬ∈ℬ, in which case x is called its principal element.
>     * The principal filter at x on X is the filter {x}↑X. A filter ℱ is principal at x if and only if ℱ={x}↑X.
>   6. Countably deep if whenever 𝒞⊆ℱ is a countable subset then ker⁡𝒞∈ℬ.[9]

If ℬ is a principal filter on X then ∅≠ker⁡ℬ∈ℬ and ℬ={ker⁡ℬ}↑X={S∪ker⁡ℬ:S⊆X∖ker⁡ℬ}=℘(X∖ker⁡ℬ)(∪){ker⁡ℬ} where {ker⁡ℬ} is also the smallest prefilter that generates ℬ.

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 C is countable (for example, C=ℚ,ℤ, the primes), a meager set in ℝ, a set of finite measure, or a bounded subset of ℝ. If C is a singleton set then ℬC is a subbase for the Fréchet filter on ℝ.

For every filter ℱ on X there exists a unique pair of dual ideals ℱ* and ℱ∙ on X such that ℱ* is free, ℱ∙ is principal, and ℱ*∧ℱ∙=ℱ, and ℱ* and ℱ∙ do not mesh (that is, ℱ*∨ℱ∙=℘(X)). The dual ideal ℱ* is called the free part of ℱ while ℱ∙ is called the principal part[9] where at least one of these dual ideals is filter. If ℱ is principal then ℱ∙:=ℱ and ℱ*:=℘(X); otherwise, ℱ∙:={ker⁡ℱ}↑X and ℱ*:=ℱ∨{X∖(ker⁡ℱ)}↑X is a free (non–degenerate) filter.[9]

Finite prefilters and finite sets

If a filter subbase ℬ is finite then it is fixed (that is, not free); this is because ker⁡ℬ=⋂B∈ℬB is a finite intersection and the filter subbase ℬ has the finite intersection property. A finite prefilter is necessarily principal, although it does not have to be closed under finite intersections.

If X is finite then all of the conclusions above hold for any ℬ⊆℘(X). In particular, on a finite set X, there are no free filter subbases (and so no free prefilters), all prefilters are principal, and all filters on X are principal filters generated by their (non–empty) kernels.

The trivial filter {X} is always a finite filter on X and if X is infinite then it is the only finite filter because a non–trivial finite filter on a set X is possible if and only if 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 X is a singleton set then the trivial filter {X} is the only proper subset of ℘(X) and moreover, this set {X} is a principal ultra prefilter and any superset ℱ⊇ℬ (where ℱ⊆℘(Y) and X⊆Y) with the finite intersection property will also be a principal ultra prefilter (even if Y is infinite).

#### Characterizing fixed ultra prefilters

If a family of sets ℬ is fixed (that is, ker⁡ℬ≠∅) then ℬ is ultra if and only if some element of ℬ is a singleton set, in which case ℬ will necessarily be a prefilter. Every principal prefilter is fixed, so a principal prefilter ℬ is ultra if and only if ker⁡ℬ is a singleton set.

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

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 ℱ is an ultrafilter on X then the following are equivalent:

1. ℱ is fixed, or equivalently, not free, meaning ker⁡ℱ≠∅.
2. ℱ is principal, meaning ker⁡ℱ∈ℱ.
3. Some element of ℱ is a finite set.
4. Some element of ℱ is a singleton set.
5. ℱ is principal at some point of X, which means ker⁡ℱ={x}∈ℱ for some x∈X.
6. ℱ does not contain the Fréchet filter on X.
7. ℱ is sequential.[9]

### Finer/coarser, subordination, and meshing

The preorder ≤ 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",[24] where "ℱ≥𝒞" can be interpreted as "ℱ is a subsequence of 𝒞" (so "subordinate to" is the prefilter equivalent of "subsequence of"). It is also used to define prefilter convergence in a topological space. The definition of ℬ meshes with 𝒞, which is closely related to the preorder ≤, is used in Topology to define cluster points.

Two families of sets ℬ and 𝒞 mesh[7] and are compatible, indicated by writing ℬ#𝒞, if B∩C≠∅ for all B∈ℬ and C∈𝒞. If ℬ and 𝒞 do not mesh then they are dissociated. If S⊆X and ℬ⊆℘(X) then ℬ and S are said to mesh if ℬ and {S} mesh, or equivalently, if the trace of ℬ on S, which is the family ℬ|S={B∩S:B∈ℬ}, does not contain the empty set, where the trace is also called the restriction of ℬ to S.

> Declare that 𝒞≤ℱ,ℱ≥𝒞, and ℱ⊢𝒞, stated as 𝒞 is coarser than ℱ and ℱ is finer than (or subordinate to) 𝒞,[10][11][12][8][9] if any of the following equivalent conditions hold:

>   1. Definition: Every C∈𝒞 contains some F∈ℱ. Explicitly, this means that for every C∈𝒞, there is some F∈ℱ such that F⊆C.
>     * Said more briefly in plain English, 𝒞≤ℱ if every set in 𝒞 is larger than some set in ℱ. Here, a "larger set" means a superset.
>   2. {C}≤ℱ for every C∈𝒞.
>     * In words, {C}≤ℱ states exactly that C is larger than some set in ℱ. The equivalence of (a) and (b) follows immediately.
>     * From this characterization, it follows that if (𝒞i)i∈I are families of sets, then ⋃i∈I𝒞i≤ℱ if and only if 𝒞i≤ℱ for all i∈I.
>   3. 𝒞≤ℱ↑X, which is equivalent to 𝒞⊆ℱ↑X;
>   4. 𝒞↑X≤ℱ;
>   5. 𝒞↑X≤ℱ↑X, which is equivalent to 𝒞↑X⊆ℱ↑X;

> and if in addition ℱ is upward closed, which means that ℱ=ℱ↑X, then this list can be extended to include:

>   6. 𝒞⊆ℱ.[5]
>     * So in this case, this definition of "ℱ is finer than 𝒞" would be identical to the topological definition of "finer" had 𝒞 and ℱ been topologies on X.

> If an upward closed family ℱ is finer than 𝒞 (that is, 𝒞≤ℱ) but 𝒞≠ℱ then ℱ is said to be strictly finer than 𝒞 and 𝒞 is strictly coarser than ℱ. Two families are comparable if one of these sets is finer than the other.[10]

Example: If xi∙=(xin)n=1∞ is a subsequence of x∙=(xi)i=1∞ then Tails⁡(xi∙) is subordinate to Tails⁡(x∙); in symbols: Tails⁡(xi∙)⊢Tails⁡(x∙) and also Tails⁡(x∙)≤Tails⁡(xi∙). Stated in plain English, the prefilter of tails of a subsequence is always subordinate to that of the original sequence. To see this, let C:=x≥i∈Tails⁡(x∙) be arbitrary (or equivalently, let i∈ℕ be arbitrary) and it remains to show that this set contains some F:=xi≥n∈Tails⁡(xi∙). For the set x≥i={xi,xi+1,…} to contain xi≥n={xin,xin+1,…}, it is sufficient to have i≤in. Since i1<i2<⋯ are strictly increasing integers, there exists n∈ℕ such that in≥i, and so x≥i⊇xi≥n holds, as desired. Consequently, TailsFilter⁡(x∙)⊆TailsFilter⁡(xi∙). The left hand side will be a strict/proper subset of the right hand side if (for instance) every point of x∙ is unique (that is, when x∙:ℕ->X is injective) and xi∙ is the even-indexed subsequence (x2,x4,x6,…) because under these conditions, every tail xi≥n={x2n,x2n+2,x2n+4,…} (for every n∈ℕ) of the subsequence will belong to the right hand side filter but not to the left hand side filter.

For another example, if ℬ is any family then ∅≤ℬ≤ℬ≤{∅} always holds and furthermore, {∅}≤ℬ if and only if ∅∈ℬ.

Assume that 𝒞 and ℱ are families of sets that satisfy ℬ≤ℱ and 𝒞≤ℱ. Then ker⁡ℱ⊆ker⁡𝒞, and 𝒞≠∅ implies ℱ≠∅, and also ∅∈𝒞 implies ∅∈ℱ. If in addition to 𝒞≤ℱ,ℱ is a filter subbase and 𝒞≠∅, then 𝒞 is a filter subbase[8] and also 𝒞 and ℱ mesh.[19][proof 2] More generally, if both ∅≠ℬ≤ℱ and ∅≠𝒞≤ℱ and if the intersection of any two elements of ℱ is non–empty, then ℬ and 𝒞 mesh.[proof 2] Every filter subbase is coarser than both the π–system that it generates and the filter that it generates.[8]

If 𝒞 and ℱ are families such that 𝒞≤ℱ, the family 𝒞 is ultra, and ∅∉ℱ, then ℱ is necessarily ultra. It follows that any family that is equivalent to an ultra family will necessarily be ultra. In particular, if 𝒞 is a prefilter then either both 𝒞 and the filter 𝒞↑X it generates are ultra or neither one is ultra. If a filter subbase is ultra then it is necessarily a prefilter, in which case the filter that it generates will also be ultra. A filter subbase ℬ that is not a prefilter cannot be ultra; but it is nevertheless still possible for the prefilter and filter generated by ℬ to be ultra. If S⊆X and ℬ⊆℘(X) is upward closed in X then S∉ℬ if and only if (X∖S)#ℬ.[9]

Relational properties of subordination

The relation ≤ is reflexive and transitive, which makes it into a preorder on ℘(℘(X)).[32] The relation ≤ on Filters⁡(X) is antisymmetric but if X has more than one point then it is not symmetric.

Symmetry: For any ℬ⊆℘(X),ℬ≤{X} if and only if {X}=ℬ. So the set X has more than one point if and only if the relation ≤ on Filters⁡(X) is not symmetric.

Antisymmetry: If ℬ⊆𝒞 then ℬ≤𝒞 but while the converse does not hold in general, it does hold if 𝒞 is upward closed (such as if 𝒞 is a filter). Two filters are equivalent if and only if they are equal, which makes the restriction of ≤ to Filters⁡(X) antisymmetric. But in general, ≤ is not antisymmetric on Prefilters⁡(X) nor on ℘(℘(X)); that is, 𝒞≤ℬ and ℬ≤𝒞 does not necessarily imply ℬ=𝒞; not even if both 𝒞 and ℬ are prefilters.[12] For instance, if ℬ is a prefilter but not a filter then ℬ≤ℬ↑X and ℬ↑X≤ℬ but ℬ≠ℬ↑X.

#### Equivalent families of sets

The preorder ≤ induces its canonical equivalence relation on ℘(℘(X)), where for all ℬ,𝒞∈℘(℘(X)), ℬ is equivalent to 𝒞 if any of the following equivalent conditions hold:[8][5]

1. 𝒞≤ℬ and ℬ≤𝒞.
2. The upward closures of 𝒞 and ℬ are equal.

Two upward closed (in X) subsets of ℘(X) are equivalent if and only if they are equal.[8] If ℬ⊆℘(X) then necessarily ∅≤ℬ≤℘(X) and ℬ is equivalent to ℬ↑X. Every equivalence class other than {∅} contains a unique representative (that is, element of the equivalence class) that is upward closed in X.[8]

Properties preserved between equivalent families

Let ℬ,𝒞∈℘(℘(X)) be arbitrary and let ℱ be any family of sets. If ℬ and 𝒞 are equivalent (which implies that ker⁡ℬ=ker⁡𝒞) then for each of the statements/properties listed below, either it is true of both ℬ and 𝒞 or else it is false of both ℬ and 𝒞:[32]

1. Not empty
2. Proper (that is, ∅ is not an element)
* Moreover, any two degenerate families are necessarily equivalent.
3. Filter subbase
4. Prefilter
* In which case ℬ and 𝒞 generate the same filter on X (that is, their upward closures in X are equal).
5. Free
6. Principal
7. Ultra
8. Is equal to the trivial filter {X}
* In words, this means that the only subset of ℘(X) that is equivalent to the trivial filter is the trivial filter. In general, this conclusion of equality does not extend to non−trivial filters (one exception is when both families are filters).
9. Meshes with ℱ
10. Is finer than ℱ
11. Is coarser than ℱ
12. Is equivalent to ℱ

Missing from the above list is the word "filter" because this property is not preserved by equivalence. However, if ℬ and 𝒞 are filters on X, then they are equivalent if and only if they are equal; this characterization does not extend to prefilters.

Equivalence of prefilters and filter subbases

If ℬ is a prefilter on X then the following families are always equivalent to each other:

1. ℬ;
2. the π–system generated by ℬ;
3. the filter on X generated by ℬ;

and moreover, these three families all generate the same filter on X (that is, the upward closures in X of these families are equal).

In particular, every prefilter is equivalent to the filter that it generates. By transitivity, two prefilters are equivalent if and only if they generate the same filter.[8][proof 3] Every prefilter is equivalent to exactly one filter on X, which is the filter that it generates (that is, the prefilter's upward closure). Said differently, every equivalence class of prefilters contains exactly one representative that is a filter. In this way, filters can be considered as just being distinguished elements of these equivalence classes of prefilters.[8]

A filter subbase that is not also a prefilter cannot be equivalent to the prefilter (or filter) that it generates. In contrast, every prefilter is equivalent to the filter that it generates. This is why prefilters can, by and large, be used interchangeably with the filters that they generate while filter subbases cannot. Every filter is both a π–system and a ring of sets.

Examples of determining equivalence/non–equivalence

Examples: Let X=ℝ and let E be the set ℤ of integers (or the set ℕ). Define the sets ℬ={[e,∞):e∈E} and 𝒞open={(−∞,e)∪(1+e,∞):e∈E} and 𝒞closed={(−∞,e]∪[1+e,∞):e∈E}.

All three sets are filter subbases but none are filters on X and only ℬ is prefilter (in fact, ℬ is even free and closed under finite intersections). The set 𝒞closed is fixed while 𝒞open is free (unless E=ℕ). They satisfy 𝒞closed≤𝒞open≤ℬ, but no two of these families are equivalent; moreover, no two of the filters generated by these three filter subbases are equivalent/equal. This conclusion can be reached by showing that the π–systems that they generate are not equivalent. Unlike with 𝒞open, every set in the π–system generated by 𝒞closed contains ℤ as a subset,[note 6] which is what prevents their generated π–systems (and hence their generated filters) from being equivalent. If E was instead ℚ or ℝ then all three families would be free and although the sets 𝒞closed and 𝒞open would remain not equivalent to each other, their generated π–systems would be equivalent and consequently, they would generate the same filter on X; however, this common filter would still be strictly coarser than the filter generated by ℬ.

## Set theoretic properties and constructions

### Trace and meshing

If ℬ is a prefilter (resp. filter) on X and S⊆X then the trace of ℬ on S, which is the family ℬ|S:=ℬ(∩){S}, is a prefilter (resp. a filter) if and only if ℬ and S mesh (that is, ∅∉ℬ(∩){S}[10]), in which case the trace of ℬ on S is said to be induced by S. If ℬ is ultra and if ℬ and S mesh then the trace ℬ|S is ultra. If ℬ is an ultrafilter on X then the trace of ℬ on S is a filter on S if and only if S∈ℬ.

For example, suppose that ℬ is a filter on X and S⊆X is such that S≠X and X∖S∉ℬ. Then ℬ and S mesh and ℬ∪{S} generates a filter on X that is strictly finer than ℬ.[10]

When prefilters mesh

Given non–empty families ℬ and 𝒞, the family ℬ(∩)𝒞:={B∩C:B∈ℬ and C∈𝒞} satisfies 𝒞≤ℬ(∩)𝒞 and ℬ≤ℬ(∩)𝒞. If ℬ(∩)𝒞 is proper (resp. a prefilter, a filter subbase) then this is also true of both ℬ and 𝒞. In order to make any meaningful deductions about ℬ(∩)𝒞 from ℬ and 𝒞,ℬ(∩)𝒞 needs to be proper (that is, ∅∉ℬ(∩)𝒞, which is the motivation for the definition of "mesh". In this case, ℬ(∩)𝒞 is a prefilter (resp. filter subbase) if and only if this is true of both ℬ and 𝒞. Said differently, if ℬ and 𝒞 are prefilters then they mesh if and only if ℬ(∩)𝒞 is a prefilter. Generalizing gives a well known characterization of "mesh" entirely in terms of subordination (that is, ≤):

Script error: No such module "in5".Two prefilters (resp. filter subbases) ℬ and 𝒞 mesh if and only if there exists a prefilter (resp. filter subbase) ℱ such that 𝒞≤ℱ and ℬ≤ℱ.

If the least upper bound of two filters ℬ and 𝒞 exists in Filters⁡(X) then this least upper bound is equal to ℬ(∩)𝒞.[28]

### Images and preimages under functions

Throughout, f:X->Y and g:Y->Z will be maps between non–empty sets.

Images of prefilters

Let ℬ⊆℘(Y). Many of the properties that ℬ may have are preserved under images of maps; notable exceptions include being upward closed, being closed under finite intersections, and being a filter, which are not necessarily preserved.

Explicitly, if one of the following properties is true of ℬ on Y, then it will necessarily also be true of g(ℬ) on g(Y) (although possibly not on the codomain Z unless g is surjective):[10][13][33][34][35][31]

* Filter properties: ultra, ultrafilter, filter, prefilter, filter subbase, dual ideal, upward closed, proper/non–degenerate.
* Ideal properties: ideal, closed under finite unions, downward closed, directed upward.

Moreover, if ℬ⊆℘(Y) is a prefilter then so are both g(ℬ) and g−1(g(ℬ)).[10] The image under a map f:X->Y of an ultra set ℬ⊆℘(X) is again ultra and if ℬ is an ultra prefilter then so is f(ℬ).

If ℬ is a filter then g(ℬ) is a filter on the range g(Y), but it is a filter on the codomain Z if and only if g is surjective.[33] Otherwise it is just a prefilter on Z and its upward closure must be taken in Z to obtain a filter. The upward closure of g(ℬ) in Z is g(ℬ)↑Z={S⊆Z:B⊆g−1(S) for some B∈ℬ} where if ℬ is upward closed in Y (that is, a filter) then this simplifies to: g(ℬ)↑Z={S⊆Z:g−1(S)∈ℬ}.

If X⊆Y then taking g to be the inclusion map X->Y shows that any prefilter (resp. ultra prefilter, filter subbase) on X is also a prefilter (resp. ultra prefilter, filter subbase) on Y.[10]

Preimages of prefilters

Let ℬ⊆℘(Y). Under the assumption that f:X->Y is surjective:

Script error: No such module "in5".f−1(ℬ) is a prefilter (resp. filter subbase, π–system, closed under finite unions, proper) if and only if this is true of ℬ.

However, if ℬ is an ultrafilter on Y then even if f is surjective (which would make f−1(ℬ) a prefilter), it is nevertheless still possible for the prefilter f−1(ℬ) to be neither ultra nor a filter on X [34] (see this[note 7] footnote for an example).

If f:X->Y is not surjective then denote the trace of ℬ on f(X) by ℬ|f(X), where in this case particular case the trace satisfies: ℬ|f(X)=f(f−1(ℬ)) and consequently also: f−1(ℬ)=f−1(ℬ|f(X)).

This last equality and the fact that the trace ℬ|f(X) is a family of sets over f(X) means that to draw conclusions about f−1(ℬ), the trace ℬ|f(X) can be used in place of ℬ and the surjection f:X->f(X) can be used in place of f:X->Y. For example:[13][10][35]

Script error: No such module "in5".f−1(ℬ) is a prefilter (resp. filter subbase, π–system, proper) if and only if this is true of ℬ|f(X).

In this way, the case where f is not (necessarily) surjective can be reduced down to the case of a surjective function (which is a case that was described at the start of this subsection).

Even if ℬ is an ultrafilter on Y, if f is not surjective then it is nevertheless possible that ∅∈ℬ|f(X), which would make f−1(ℬ) degenerate as well. The next characterization shows that degeneracy is the only obstacle. If ℬ is a prefilter then the following are equivalent:[13][10][35]

1. f−1(ℬ) is a prefilter;
2. ℬ|f(X) is a prefilter;
3. ∅∉ℬ|f(X);
4. ℬ meshes with f(X)

and moreover, if f−1(ℬ) is a prefilter then so is f(f−1(ℬ)).[13][10]

If S⊆Y and if In⁡:S->Y denotes the inclusion map then the trace of ℬ on S is equal to In−1(ℬ).[10] This observation allows the results in this subsection to be applied to investigating the trace on a set.

Bijections, injections, and surjections

All properties involving filters are preserved under bijections. This means that if ℬ⊆℘(Y) and g:Y->Z is a bijection, then ℬ is a prefilter (resp. ultra, ultra prefilter, filter on X, ultrafilter on X, filter subbase, π–system, ideal on X, etc.) if and only if the same is true of g(ℬ) on Z.[34]

A map g:Y->Z is injective if and only if for all prefilters ℬ on Y,ℬ is equivalent to g−1(g(ℬ)).[28] The image of an ultra family of sets under an injection is again ultra.

The map f:X->Y is a surjection if and only if whenever ℬ is a prefilter on Y then the same is true of f−1(ℬ) on X (this result does not require the ultrafilter lemma).

#### Subordination is preserved by images and preimages

The relation ≤ is preserved under both images and preimages of families of sets.[10] This means that for any families 𝒞 and ℱ,[35] 𝒞≤ℱ implies g(𝒞)≤g(ℱ) and f−1(𝒞)≤f−1(ℱ).

Moreover, the following relations always hold for any family of sets 𝒞:[35] 𝒞≤f(f−1(𝒞)) where equality will hold if f is surjective.[35] Furthermore, f−1(𝒞)=f−1(f(f−1(𝒞))) and g(𝒞)=g(g−1(g(𝒞))).

If ℬ⊆℘(X) and 𝒞⊆℘(Y) then[9] f(ℬ)≤𝒞 if and only if ℬ≤f−1(𝒞) and g−1(g(𝒞))≤𝒞[35] where equality will hold if g is injective.[35]

### Products of prefilters

Suppose X∙=(Xi)i∈I is a family of one or more non–empty sets, whose product will be denoted by ∏X∙:=∏i∈IXi, and for every index i∈I, let Pr⁡Xi:∏X∙->Xi denote the canonical projection. Let ℬ∙:=(ℬi)i∈I be non−empty families, also indexed by I, such that ℬi⊆℘(Xi) for each i∈I. The product of the families ℬ∙[10] is defined identically to how the basic open subsets of the product topology are defined (had all of these ℬi been topologies). That is, both the notations ∏ℬ∙=∏i∈Iℬi denote the family of all cylinder subsets ∏i∈ISi⊆∏X∙ such that Si=Xi for all but finitely many i∈I and where Si∈ℬi for any one of these finitely many exceptions (that is, for any i such that Si≠Xi, necessarily Si∈ℬi). When every ℬi is a filter subbase then the family ⋃i∈IPr⁡Xi−1(ℬi) is a filter subbase for the filter on ∏X∙ generated by ℬ∙.[10] If ∏ℬ∙ is a filter subbase then the filter on ∏X∙ that it generates is called the filter generated by ℬ∙.[10] If every ℬi is a prefilter on Xi then ∏ℬ∙ will be a prefilter on ∏X∙ and moreover, this prefilter is equal to the coarsest prefilter ℱ on ∏X∙ such that Pr⁡Xi(ℱ)=ℬi for every i∈I.[10] However, ∏ℬ∙ may fail to be a filter on ∏X∙ even if every ℬi is a filter on Xi.[10]

### Set subtraction and some examples

Set subtracting away a subset of the kernel

If ℬ is a prefilter on X,S⊆ker⁡ℬ, and S∉ℬ then {B∖S:B∈ℬ} is a prefilter, where this latter set is a filter if and only if ℬ is a filter and S=∅. In particular, if ℬ is a neighborhood basis at a point x in a topological space X having at least 2 points, then {B∖{x}:B∈ℬ} is a prefilter on X. This construction is used to define limx≠x0x->x0f(x)->y in terms of prefilter convergence.

Using duality between ideals and dual ideals

There is a dual relation ℬ⊲𝒞 or 𝒞⊳ℬ, which is defined to mean that every B∈ℬ is contained in some C∈𝒞. Explicitly, this means that for every B∈ℬ , there is some C∈𝒞 such that B⊆C. This relation is dual to ≤ in sense that ℬ⊲𝒞 if and only if (X∖ℬ)≤(X∖𝒞).[5] The relation ℬ⊲𝒞 is closely related to the downward closure of a family in a manner similar to how ≤ is related to the upward closure family.

For an example that uses this duality, suppose f:X->Y is a map and Ξ⊆℘(Y). Define Ξf:={I⊆X:f(I)∈Ξ} which contains the empty set if and only if Ξ does. It is possible for Ξ to be an ultrafilter and for Ξf to be empty or not closed under finite intersections (see footnote for example).[note 8] Although Ξf does not preserve properties of filters very well, if Ξ is downward closed (resp. closed under finite unions, an ideal) then this will also be true for Ξf. Using the duality between ideals and dual ideals allows for a construction of the following filter.

Script error: No such module "in5".Suppose ℬ is a filter on Y and let Ξ:=Y∖ℬ be its dual in Y. If X∉Ξf then Ξf's dual X∖Ξf will be a filter.

Other examples

Example: The set ℬ of all dense open subsets of a topological space is a proper π–system and a prefilter. If the space is a Baire space, then the set of all countable intersections of dense open subsets is a π–system and a prefilter that is finer than ℬ.

Example: The family ℬOpen of all dense open sets of X=ℝ having finite Lebesgue measure is a proper π–system and a free prefilter. The prefilter ℬOpen is properly contained in, and not equivalent to, the prefilter consisting of all dense open subsets of ℝ. Since X is a Baire space, every countable intersection of sets in ℬOpen is dense in X (and also comeagre and non–meager) so the set of all countable intersections of elements of ℬOpen is a prefilter and π–system; it is also finer than, and not equivalent to, ℬOpen.

## Filters and nets

This section will describe the relationships between prefilters and nets in great detail because of how important these details are applying filters to topology − particularly in switching from utilizing nets to utilizing filters and vice verse − and because it to make it easier to understand later why subnets (with their most commonly used definitions) are not generally equivalent with "sub–prefilters".

### Nets to prefilters

A net x∙=(xi)i∈I in X is canonically associated with its prefilter of tails Tails⁡(x∙). If f:X->Y is a map and x∙ is a net in X then Tails⁡(f(x∙))=f(Tails⁡(x∙)).[36]

### Prefilters to nets

A pointed set is a pair (S,s) consisting of a non–empty set S and an element s∈S. For any family ℬ, let PointedSets⁡(ℬ):={(B,b):B∈ℬ and b∈B}.

Define a canonical preorder ≤ on pointed sets by declaring (R,r)≤(S,s) if and only if R⊇S.

If s0,s1∈S then (S,s0)≤(S,s1) and (S,s1)≤(S,s0) even if s0≠s1, so this preorder is not antisymmetric and given any family of sets ℬ, (PointedSets⁡(ℬ),≤) is partially ordered if and only if ℬ≠∅ consists entirely of singleton sets. If {x}∈ℬ then ({x},x) is a maximal element of PointedSets⁡(ℬ); moreover, all maximal elements are of this form. If (B,b0)∈PointedSets⁡(ℬ) then (B,b0) is a greatest element if and only if B=ker⁡ℬ, in which case {(B,b):b∈B} is the set of all greatest elements. However, a greatest element (B,b) is a maximal element if and only if B={b}=ker⁡ℬ, so there is at most one element that is both maximal and greatest. There is a canonical map Pointℬ:PointedSets⁡(ℬ)->X defined by (B,b)↦b.

> If i0=(B0,b0)∈PointedSets⁡(ℬ) then the tail of the assignment Pointℬ starting at i0 is {c:(C,c)∈PointedSets⁡(ℬ) and (B0,b0)≤(C,c)}=B0.

Although (PointedSets⁡(ℬ),≤) is not, in general, a partially ordered set, it is a directed set if (and only if) ℬ is a prefilter. So the most immediate choice for the definition of "the net in X induced by a prefilter ℬ" is the assignment (B,b)↦b from PointedSets⁡(ℬ) into X.

> If ℬ is a prefilter on X then the net associated with ℬ is the map

> Netℬ:(PointedSets⁡(ℬ),≤)->X(B,b)↦b that is, Netℬ(B,b):=b.

If ℬ is a prefilter on X then Netℬ is a net in X and the prefilter associated with Netℬ is ℬ; that is:[note 9] Tails⁡(Netℬ)=ℬ.

This would not necessarily be true had Netℬ been defined on a proper subset of PointedSets⁡(ℬ). For example, suppose X has at least two distinct elements, ℬ:={X} is the indiscrete filter, and x∈X is arbitrary. Had Netℬ instead been defined on the singleton set D:={(X,x)}, where the restriction of Netℬ to D will temporarily be denote by NetD:D->X, then the prefilter of tails associated with NetD:D->X would be the principal prefilter {{x}} rather than the original filter ℬ={X}; this means that the equality Tails⁡(NetD)=ℬ is false, so unlike Netℬ, the prefilter ℬ can not be recovered from NetD. Worse still, while ℬ is the unique minimal filter on X, the prefilter Tails⁡(NetD)={{x}} instead generates a maximal filter (that is, an ultrafilter) on X.

However, if x∙=(xi)i∈I is a net in X then it is not in general true that NetTails⁡(x∙) is equal to x∙ because, for example, the domain of x∙ may be of a completely different cardinality than that of NetTails⁡(x∙) (since unlike the domain of NetTails⁡(x∙), the domain of an arbitrary net in X could have any cardinality).

Ultranets and ultra prefilters

A net x∙ in X is called an ultranet or universal net in X if for every subset S⊆X,x∙ is eventually in S or it is eventually in X∖S; this happens if and only if Tails⁡(x∙) is an ultra prefilter. A prefilter ℬ on X is an ultra prefilter if and only if Netℬ is an ultranet in X.

#### Partially ordered net

The domain of the canonical net Netℬ is in general not partially ordered. However, in 1955 Bruns and Schmidt discovered[37] a construction that allows for the canonical net to have a domain that is both partially ordered and directed; this was independently rediscovered by Albert Wilansky in 1970.[36] It begins with the construction of a strict partial order (meaning a transitive and irreflexive relation) < on a subset of ℬ×ℕ×X that is similar to the lexicographical order on ℬ×ℕ of the strict partial orders (ℬ,⊋) and (ℕ,<). For any i=(B,m,b) and j=(C,n,c) in ℬ×ℕ×X, declare that i<j if and only if B⊇C and either: (1) B≠C or else (2) B=C and m<n, or equivalently, if and only if (1) B⊇C, and (2) if B=C then m<n.

The non−strict partial order associated with <, denoted by ≤, is defined by declaring that i≤j if and only if i<j or i=j. Unwinding these definitions gives the following characterization:

> i≤j

> if and only if

> (1) B⊇C, and (2) if B=C then m≤n,

> and also

> (3) if B=C and m=n then b=c,

which shows that ≤ is just the lexicographical order on ℬ×ℕ×X induced by (ℬ,⊇),(ℕ,≤), and (X,=), where X is partially ordered by equality =.[note 10] Both < and ≤ are serial and neither possesses a greatest element or a maximal element; this remains true if they are each restricted to the subset of ℬ×ℕ×X defined by Posetℬ:={(B,m,b)∈ℬ×ℕ×X:b∈B}, where it will henceforth be assumed that they are. Denote the assignment i=(B,m,b)↦b from this subset by: PosetNetℬ : Posetℬ ->X (B,m,b) ↦b If i0=(B0,m0,b0)∈Posetℬ then just as with Netℬ before, the tail of the PosetNetℬ starting at i0 is equal to B0. If ℬ is a prefilter on X then PosetNetℬ is a net in X whose domain Posetℬ is a partially ordered set and moreover, Tails⁡(PosetNetℬ)=ℬ.[36] Because the tails of PosetNetℬ and Netℬ are identical (since both are equal to the prefilter ℬ), there is typically nothing lost by assuming that the domain of the net associated with a prefilter is both directed and partially ordered.[36] If the set ℕ is replaced with the positive rational numbers then the strict partial order < will also be a dense order.

### Subordinate filters and subnets

The notion of "ℬ is subordinate to 𝒞" (written ℬ⊢𝒞) is for filters and prefilters what "xn∙=(xni)i=1∞ is a subsequence of x∙=(xi)i=1∞" is for sequences.[24] For example, if Tails⁡(x∙)={x≥i:i∈ℕ} denotes the set of tails of x∙ and if Tails⁡(xn∙)={xn≥i:i∈ℕ} denotes the set of tails of the subsequence xn∙ (where xn≥i:={xni:i∈ℕ}) then Tails⁡(xn∙)⊢Tails⁡(x∙) (that is, Tails⁡(x∙)≤Tails⁡(xn∙)) is true but Tails⁡(x∙)⊢Tails⁡(xn∙) is in general false.

#### Non–equivalence of subnets and subordinate filters

A subset R⊆I of a preordered space (I,≤) is frequent or cofinal in I if for every i∈I there exists some r∈R such that i≤r. If R⊆I contains a tail of I then R is said to be eventual or eventually in I; explicitly, this means that there exists some i∈I such that I≥i⊆R (that is, j∈R for all j∈I satisfying i≤j). An eventual set is necessarily not empty. A subset is eventual if and only if its complement is not frequent (which is termed infrequent).[38] A map h:A->I between two preordered sets is order–preserving if whenever a,b∈A satisfy a≤b, then h(a)≤h(b).

Subnets in the sense of Willard and subnets in the sense of Kelley are the most commonly used definitions of "subnet."[38] The first definition of a subnet was introduced by John L. Kelley in 1955.[38] Stephen Willard introduced his own variant of Kelley's definition of subnet in 1970.[38] AA–subnets were introduced independently by Smiley (1957), Aarnes and Andenaes (1972), and Murdeshwar (1983); AA–subnets were studied in great detail by Aarnes and Andenaes but they are not often used.[38]

> Let S=S∙:(A,≤)->X and N=N∙:(I,≤)->X be nets. Then[38]

>   1. S∙ is a Willard–subnet of N∙ or a subnet in the sense of Willard if there exists an order–preserving map h:A->I such that S=N∘h and h(A) is cofinal in I.
>   2. S∙ is a Kelley–subnet of N∙ or a subnet in the sense of Kelley if there exists a map h:A->I such that S=N∘h and whenever E⊆I is eventually in I then h−1(E) is eventually in A.
>   3. S∙ is an AA–subnet of N∙ or a subnet in the sense of Aarnes and Andenaes if any of the following equivalent conditions are satisfied:
>     1. Tails⁡(N∙)≤Tails⁡(S∙).
>     2. TailsFilter⁡(N∙)⊆TailsFilter⁡(S∙).
>     3. If J is eventually in I then S−1(N(J)) is eventually in A.
>     4. For any subset R⊆X, if Tails⁡(S∙) and {R} mesh, then so do Tails⁡(N∙) and {R}.
>     5. For any subset R⊆X, if Tails⁡(S∙)≤{R} then Tails⁡(N∙)≤{R}.

Kelley did not require the map h to be order preserving while the definition of an AA–subnet does away entirely with any map between the two nets' domains and instead focuses entirely on X − the nets' common codomain. Every Willard–subnet is a Kelley–subnet and both are AA–subnets.[38] In particular, if y∙=(ya)a∈A is a Willard–subnet or a Kelley–subnet of x∙=(xi)i∈I then Tails⁡(x∙)≤Tails⁡(y∙).

* Example: Let I=ℕ and let x∙ be a constant sequence, say x∙=(0)i∈ℕ. Let s1=0 and A={1} so that s∙=(sa)a∈A=(s1) is a net on A. Then s∙ is an AA-subnet of x∙ because Tails⁡(x∙)={{0}}=Tails⁡(s∙). But s∙ is not a Willard-subnet of x∙ because there does not exist any map h:A->I whose image is a cofinal subset of I=ℕ. Nor is s∙ a Kelley-subnet of x∙ because if h:A->I is any map then E:=I∖{h(1)} is a cofinal subset of I=ℕ but h−1(E)=∅ is not eventually in A.

AA–subnets have a defining characterization that immediately shows that they are fully interchangeable with sub(ordinate)filters.[38][39] Explicitly, what is meant is that the following statement is true for AA–subnets:

Script error: No such module "in5".If ℬ and ℱ are prefilters then ℬ≤ℱ if and only if Netℱ is an AA–subnet of Netℬ.

If "AA–subnet" is replaced by "Willard–subnet" or "Kelley–subnet" then the above statement becomes false. In particular, the problem is that the following statement is in general false:

Script error: No such module "in5".False statement: If ℬ and ℱ are prefilters such that ℬ≤ℱ then Netℱ is a Kelley–subnet of Netℬ.

Since every Willard–subnet is a Kelley–subnet, this statement remains false if the word "Kelley–subnet" is replaced with "Willard–subnet".

* Counter example: For all n∈ℕ, let Bn={1}∪ℕ≥n. Let ℬ={Bn:n∈ℕ}, which is a proper π–system, and let ℱ={{1}}∪ℬ, where both families are prefilters on the natural numbers X:=ℕ={1,2,…}. Because ℬ≤ℱ,ℱ is to ℬ as a subsequence is to a sequence. So ideally, S=Netℱ should be a subnet of B=Netℬ. Let I:=PointedSets⁡(ℬ) be the domain of Netℬ, so I contains a cofinal subset that is order isomorphic to ℕ and consequently contains neither a maximal nor greatest element. Let A:=PointedSets⁡(ℱ)={M}∪I, where M:=(1,{1}) is both a maximal and greatest element of A. The directed set A also contains a subset that is order isomorphic to ℕ (because it contains I, which contains such a subset) but no such subset can be cofinal in A because of the maximal element M. Consequently, any order–preserving map h:A->I must be eventually constant (with value h(M)) where h(M) is then a greatest element of the range h(A). Because of this, there can be no order preserving map h:A->I that satisfies the conditions required for Netℱ to be a Willard–subnet of Netℬ (because the range of such a map h cannot be cofinal in I). Suppose for the sake of contradiction that there exists a map h:A->I such that h−1(I≥i) is eventually in A for all i∈I. Because h(M)∈I, there exist n,n0∈ℕ such that h(M)=(n0,Bn) with n0∈Bn. For every i∈I, because h−1(I≥i) is eventually in A, it is necessary that h(M)∈I≥i. In particular, if i:=(n+2,Bn+2) then h(M)≥i=(n+2,Bn+2), which by definition is equivalent to Bn⊆Bn+2, which is false. Consequently, Netℱ is not a Kelley–subnet of Netℬ.[39]

If "subnet" is defined to mean Willard–subnet or Kelley–subnet then nets and filters are not completely interchangeable because there exists a filter–sub(ordinate)filter relationships that cannot be expressed in terms of a net–subnet relationship between the two induced nets. In particular, the problem is that Kelley–subnets and Willard–subnets are not fully interchangeable with subordinate filters. If the notion of "subnet" is not used or if "subnet" is defined to mean AA–subnet, then this ceases to be a problem and so it becomes correct to say that nets and filters are interchangeable. Despite the fact that AA–subnets do not have the problem that Willard and Kelley subnets have, they are not widely used or known about.[38][39]

## See also

* Characterizations of the category of topological spaces
* Convergence space - Generalization of the notion of convergence that is found in general topology
* Filter (mathematics) - In mathematics, a special subset of a partially ordered set
* Filters in topology - Use of filters to describe and characterize all basic topological notions and results.
* Filtration (mathematics)
* Filtration (probability theory) - Model of information available at a given point of a random process
* Fréchet filter
* Generic filter
* Ideal (set theory) - Non-empty family of sets that is closed under finite unions and subsets
* Ultrafilter - Maximal proper filter
* Ultrafilter (set theory) - Maximal proper filter

## Notes

1. ↑ Indeed, in both the cases ⊇ and ⊆, appearing on the right is precisely what makes C "greater", for if A and B are related by some binary relation ⪯ (meaning that A⪯B or B⪯A) then whichever one of A and B appears on the right is said to be greater than or equal to the one that appears on the left with respect to ⪯ (or less verbosely, "⪯–greater than or equal to").
2. ↑ More generally, for any real numbers satisfying r≤s and u≤v,Br,s∩Bu,v=Bm,max⁡(s,v) where m:=min⁡(s,v,max⁡(r,u)).
3. ↑ If R,S⊆ℝ then ℬR∩ℬS=ℬR∩S. This property and the fact that ℬR is nonempty and proper if and only if R≠∅ actually allows for the construction of even more examples of prefilters, because if 𝒮⊆℘(ℝ) is any prefilter (resp. filter subbase, π–system) then so is {ℬS:S∈𝒮}.
4. ↑ It may be shown that if 𝒞 is any family such that 𝒮(0,∞)⊆𝒞⊆ℬ(0,∞) then 𝒞 is a prefilter if and only if for all real 0<r≤s there exist real 0<u≤v such that u≤r≤s≤v and B−u,v∈𝒞.
5. ↑ For instance, one sense in which a net u∙ in X could be interpreted as being "maximally deep" is if all important properties related to X (such as convergence for example) of any subnet is completely determined by u∙ in all topologies on X. In this case u∙ and its subnet become effectively indistinguishable (at least topologically) if one's information about them is limited to only that which can be described in solely in terms of X and directly related sets (such as its subsets).
6. ↑ The π–system generated by 𝒞open (resp. by 𝒞closed) is a prefilter whose elements are finite unions of open (resp. closed) intervals having endpoints in E∪{−∞,∞} with two of these intervals being of the forms (−∞,e1) and (e2,∞) (resp. (−∞,e1] and [e2,∞)) where e1≤1+e2; in the case of 𝒞closed, it is possible for one or more of these closed intervals to be singleton sets (that is, degenerate closed intervals).
7. ↑ For an example of how this failure can happen, consider the case where there exists some B∈ℬ and y∈Y∖B such that both f−1(y) and its complement in X contains at least two distinct points.
8. ↑ Suppose X has more than one point, f:X->Y is a constant map, and Ξ={f(X)} then Ξf will consist of all non–empty subsets of Y.
9. ↑ The set equality Tails⁡(Netℬ)=ℬ holds more generally: if the family of sets ℬ≠∅ satisfies ∅∉ℬ then the family of tails of the map PointedSets⁡(ℬ)->X (defined by (B,b)↦b) is equal to ℬ.
10. ↑ Explicitly, the partial order on X induced by equality = refers to the diagonal Δ:={(x,x):x∈X}, which is a homogeneous relation on X that makes (X,Δ) into a partially ordered set. If this partial order Δ is denoted by the more familiar symbol ≤ (that is, define ≤:=Δ) then for any b,c∈X, b≤c if and only if b=c, which shows that ≤ (and thus also Δ) is nothing more than a new symbol for equality on X; that is, (X,Δ) = (X,=). The notation (X,=) is used because it avoids the unnecessary introduction of a new symbol for the diagonal.

Proofs

1. ↑ Let ℱ be a filter on X that is not an ultrafilter. If S⊆X is such that S∉ℱ then {X∖S}∪ℱ has the finite intersection property (because if F∈ℱ then F∩(X∖S)=∅ if and only if F⊆S) so that by the ultrafilter lemma, there exists some ultrafilter 𝒰S on X such that {X∖S}∪ℱ⊆𝒰S (so in particular, S∉𝒰S). Intersecting all such 𝒰S proves that ℱ=⋂S⊆X,S∉ℱ𝒰S.◼
2. ↑ 2.0 2.1 To prove that ℬ and 𝒞 mesh, let B∈ℬ and C∈𝒞. Because ℬ≤ℱ (resp. because 𝒞≤ℱ), there exists some F,G∈ℱ such that F⊆B and G⊆C where by assumption F∩G≠∅ so ∅≠G∩F⊆B∩C.◼ If ℱ is a filter subbase and if ∅≠𝒞≤ℱ, then taking ℬ:=ℱ implies that 𝒞 and ℱ mesh. ◼ If C1,…,Cn∈𝒞 then there are F1,…,Fn∈ℱ such that Fi⊆Ci and now ∅≠F1∩⋯Fn⊆C1∩⋯Cn. This shows that 𝒞 is a filter subbase. ◼
3. ↑ This is because if 𝒞 and ℱ are prefilters on X then 𝒞≤ℱ if and only if 𝒞↑X⊆ℱ↑X.

## Citations

1. ↑ Jech 2006, p. 73.
2. ↑ Koutras et al. 2021.
3. ↑ 3.0 3.1 Cartan 1937a.
4. ↑ 4.0 4.1 Cartan 1937b.
5. ↑ 5.0 5.1 5.2 5.3 5.4 5.5 Dolecki & Mynard 2016, pp. 27–29.
6. ↑ 6.0 6.1 6.2 6.3 6.4 6.5 Dolecki & Mynard 2016, pp. 33–35.
7. ↑ 7.00 7.01 7.02 7.03 7.04 7.05 7.06 7.07 7.08 7.09 Narici & Beckenstein 2011, pp. 2–7.
8. ↑ 8.00 8.01 8.02 8.03 8.04 8.05 8.06 8.07 8.08 8.09 8.10 8.11 8.12 8.13 8.14 8.15 8.16 8.17 Császár 1978, pp. 53–65.
9. ↑ 9.00 9.01 9.02 9.03 9.04 9.05 9.06 9.07 9.08 9.09 9.10 9.11 9.12 9.13 Dolecki & Mynard 2016, pp. 27–54.
10. ↑ 10.00 10.01 10.02 10.03 10.04 10.05 10.06 10.07 10.08 10.09 10.10 10.11 10.12 10.13 10.14 10.15 10.16 10.17 10.18 10.19 10.20 10.21 10.22 10.23 10.24 Bourbaki 1987, pp. 57–68.
11. ↑ 11.0 11.1 Schubert 1968, pp. 48–71.
12. ↑ 12.0 12.1 12.2 Narici & Beckenstein 2011, pp. 3–4.
13. ↑ 13.0 13.1 13.2 13.3 13.4 Dugundji 1966, pp. 215–221.
14. ↑ Dugundji 1966, p. 215.
15. ↑ 15.0 15.1 15.2 Wilansky 2013, p. 5.
16. ↑ 16.0 16.1 16.2 Dolecki & Mynard 2016, p. 10.
17. ↑ 17.0 17.1 17.2 17.3 17.4 17.5 17.6 17.7 Schechter 1996, pp. 100–130.
18. ↑ Császár 1978, pp. 82–91.
19. ↑ 19.0 19.1 19.2 Dugundji 1966, pp. 211–213.
20. ↑ Schechter 1996, p. 100.
21. ↑ Császár 1978, pp. 53–65, 82–91.
22. ↑ Arkhangel'skii & Ponomarev 1984, pp. 7–8.
23. ↑ Joshi 1983, p. 244.
24. ↑ 24.0 24.1 24.2 Dugundji 1966, p. 212.
25. ↑ 25.0 25.1 25.2 Wilansky 2013, pp. 44–46.
26. ↑ Castillo, Jesus M. F.; Montalvo, Francisco (January 1990), "A Counterexample in Semimetric Spaces", Extracta Mathematicae 5 (1): 38–40, https://dialnet.unirioja.es/descarga/articulo/118277.pdf
27. ↑ Schaefer & Wolff 1999, pp. 1–11.
28. ↑ 28.0 28.1 28.2 Bourbaki 1987, pp. 129–133.
29. ↑ Wilansky 2008, pp. 32–35.
30. ↑ 30.0 30.1 30.2 Dugundji 1966, pp. 219–221.
31. ↑ 31.0 31.1 Jech 2006, pp. 73–89.
32. ↑ 32.0 32.1 Császár 1978, pp. 53–65, 82–91, 102–120.
33. ↑ 33.0 33.1 Dolecki & Mynard 2016, pp. 37–39.
34. ↑ 34.0 34.1 34.2 Arkhangel'skii & Ponomarev 1984, pp. 20–22.
35. ↑ 35.0 35.1 35.2 35.3 35.4 35.5 35.6 35.7 Császár 1978, pp. 102–120.
36. ↑ 36.0 36.1 36.2 36.3 Schechter 1996, pp. 155–171.
37. ↑ Bruns G., Schmidt J., Zur Aquivalenz von Moore-Smith-Folgen und Filtern, Math. Nachr. 13 (1955), 169-186.
38. ↑ 38.0 38.1 38.2 38.3 38.4 38.5 38.6 38.7 38.8 Schechter 1996, pp. 157–168.
39. ↑ 39.0 39.1 39.2 Clark, Pete L. (18 October 2016). "Convergence". http://math.uga.edu/~pete/convergence.pdf.

## References

* Template:Adams Franzosa Introduction to Topology Pure and Applied
* Template:Arkhangel'skii Ponomarev Fundamentals of General Topology Problems and Exercises
* Jarchow, Hans (1981). Locally convex spaces. Stuttgart: B.G. Teubner. ISBN 978-3-519-02224-4. OCLC 8210342.
* Bourbaki, Nicolas (1989). General Topology: Chapters 1–4. Éléments de mathématique. Berlin New York: Springer Science & Business Media. ISBN 978-3-540-64241-1. OCLC 18588129. https://doku.pub/documents/31425779-nicolas-bourbaki-general-topology-part-i1pdf-30j71z37920w.
* Template:Bourbaki General Topology Part II Chapters 5-10
* Bourbaki, Nicolas (1987). Topological Vector Spaces: Chapters 1–5. Éléments de mathématique. 2. Berlin New York: Springer-Verlag. ISBN 978-3-540-42338-6. OCLC 17499190. http://www.numdam.org/item?id=AIF_1950__2__5_0.
* Burris, Stanley; Sankappanavar, Hanamantagouda P. (2012). A Course in Universal Algebra. Springer-Verlag. ISBN 978-0-9880552-0-9. http://www.thoralf.uwaterloo.ca/htdocs/ualg.html.
* Cartan, Henri (1937a). "Théorie des filtres". Comptes rendus hebdomadaires des séances de l'Académie des sciences 205: 595–598. http://gallica.bnf.fr/ark:/12148/bpt6k3157c/f594.image.
* Cartan, Henri (1937b). "Filtres et ultrafiltres". Comptes rendus hebdomadaires des séances de l'Académie des sciences 205: 777–779. http://gallica.bnf.fr/ark:/12148/bpt6k3157c/f776.image.
* Template:Comfort Negrepontis The Theory of Ultrafilters 1974
* Template:Császár General Topology
* Template:Dixmier General Topology
* Dolecki, Szymon; Mynard, Frederic (2016). Convergence Foundations Of Topology. New Jersey: World Scientific Publishing Company. ISBN 978-981-4571-52-4. OCLC 945169917.
* Dugundji, James (1966). Topology. Boston: Allyn and Bacon. ISBN 978-0-697-06889-7. OCLC 395340485.
* Template:Dunford Schwartz Linear Operators Part 1 General Theory
* Edwards, Robert E. (Jan 1, 1995). Functional Analysis: Theory and Applications. New York: Dover Publications. ISBN 978-0-486-68143-6. OCLC 30593138.
* Template:Howes Modern Analysis and Topology 1995
* Jarchow, Hans (1981). Locally convex spaces. Stuttgart: B.G. Teubner. ISBN 978-3-519-02224-4. OCLC 8210342.
* Jech, Thomas (2006). Set Theory: The Third Millennium Edition, Revised and Expanded. Berlin New York: Springer Science & Business Media. ISBN 978-3-540-44085-7. OCLC 50422939.
* Template:Joshi Introduction to General Topology
* Template:Kelley General Topology
* Köthe, Gottfried (1969). Topological Vector Spaces I. Grundlehren der mathematischen Wissenschaften. 159. New York: Springer Science & Business Media. ISBN 978-3-642-64988-2. OCLC 840293704.
* Koutras, Costas D.; Moyzes, Christos; Nomikos, Christos; Tsaprounis, Konstantinos; Zikos, Yorgos (20 October 2021). "On Weak Filters and Ultrafilters: Set Theory From (and for) Knowledge Representation". Logic Journal of the IGPL. doi:10.1093/jigpal/jzab030.
* MacIver R., David (1 July 2004). "Filters in Analysis and Topology". http://www.efnet-math.org/~david/mathematics/filters.pdf. (Provides an introductory review of filters in topology and in metric spaces.)
* Narici, Lawrence; Beckenstein, Edward (2011). Topological Vector Spaces. Pure and applied mathematics (Second ed.). Boca Raton, FL: CRC Press. ISBN 978-1584888666. OCLC 144216834.
* Robertson, Alex P.; Robertson, Wendy J. (1980). Topological Vector Spaces. Cambridge Tracts in Mathematics. 53. Cambridge England: Cambridge University Press. ISBN 978-0-521-29882-7. OCLC 589250.
* Schaefer, Helmut H.; Wolff, Manfred P. (1999). Topological Vector Spaces. GTM. 8 (Second ed.). New York, NY: Springer New York Imprint Springer. ISBN 978-1-4612-7155-0. OCLC 840278135.
* Schechter, Eric (1996). Handbook of Analysis and Its Foundations. San Diego, CA: Academic Press. ISBN 978-0-12-622760-4. OCLC 175294365.
* Template:Schubert Topology
* Trèves, François (August 6, 2006). Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322.
* Wilansky, Albert (2013). Modern Methods in Topological Vector Spaces. Mineola, New York: Dover Publications, Inc. ISBN 978-0-486-49353-4. OCLC 849801114.
* Template:Wilansky Topology for Analysis 2008
* Willard, Stephen (2004). General Topology. Dover Books on Mathematics (First ed.). Mineola, N.Y.: Dover Publications. ISBN 978-0-486-43479-7. OCLC 115240.

0.00

(0 votes)

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Filter_(set_theory)&oldid=3906663"