Filter on a set

In mathematics, a filter on a set is a collection of nonempty subsets which is closed under taking supersets and finite intersections. An example of a filter is the collection of neighborhoods of a point in a topological space.

Filters were introduced by Henri Cartan in 1937 in the context of general topological spaces and were subsequently developed by Nicolas Bourbaki in their book Topologie Générale (first edition in 1940) as an alternative to the related notion of a net developed in 1922 by E. H. Moore and Herman L. Smith. They later found applications in many fields outside of topology, including set theory, mathematical logic, model theory (ultraproducts for example), abstract algebra, and others.

Filters on a set were later generalized to order filters. Specifically, a filter on a set $X$ is an order filter on the power set of $X$ ordered by inclusion.

The notion dual to a filter is an ideal. Ultrafilters are a particularly important subclass of filters.

Definition

Given a set $X$ , a filter ${\mathcal {F}}$ on $X$ is a set of subsets of $X$ such that:

${\mathcal {F}}$ is upwards-closed: If $A,B\subseteq X$ are such that $A\in {\mathcal {F}}$ and $A\subseteq B$ then $B\in {\mathcal {F}}$ ,
${\mathcal {F}}$ is closed under finite intersections: $X\in {\mathcal {F}}$ ,, and if $A\in {\mathcal {F}}$ and $B\in {\mathcal {F}}$ then $A\cap B\in {\mathcal {F}}$ .

A proper (or non-degenerate) filter is a filter which is proper as a subset of the powerset ${\mathcal {P}}(X)$ (i.e., the only improper filter is ${\mathcal {P}}(X)$ , consisting of all possible subsets). By upwards-closure, a filter is proper if and only if it does not contain the empty set. Many authors adopt the convention that a filter must be proper by definition.

When ${\mathcal {F}}$ and ${\mathcal {G}}$ are two filters on the same set such that ${\mathcal {F}}\subseteq {\mathcal {G}}$ holds, ${\mathcal {F}}$ is said to be coarser than ${\mathcal {G}}$ (or a subfilter of ${\mathcal {G}}$ ) while ${\mathcal {G}}$ is said to be finer than ${\mathcal {F}}$ (or subordinate to ${\mathcal {F}}$ or a superfilter of ${\mathcal {F}}$ ).

Examples

The singleton set ${\mathcal {F}}=\{X\}$ is called the trivial or indiscrete filter on $X$ .
If $Y$ is a subset of $X$ , the subsets of $X$ which are supersets of $Y$ form a principal filter.
If $X$ is a topological space and $x\in X$ , then the set of neighborhoods of $x$ is a filter on $X$ , the neighborhood filter or vicinity filter of $x$ .
Many examples arise from various "largeness" conditions:
- If $X$ is a set, the set of all cofinite subsets of $X$ (i.e., those sets whose complement in $X$ is finite) is a filter on $X$ , the Fréchet filter (or cofinite filter).
- Similarly, if $X$ is a set, the cocountable subsets of $X$ (those whose complement is countable) form a filter, the cocountable filter which is finer than the Fréchet filter. More generally, for any infinite cardinal $\kappa$ , the subsets whose complement has cardinality at most $\kappa$ form a filter.
- If $X$ is a metric space, e.g., $\mathbb {R} ^{n}$ , the co-bounded subsets of $X$ (those whose complement is bounded set) form a filter on $X$ .
- If $X$ is a complete measure space (e.g., $\mathbb {R} ^{n}$ with the Lebesgue measure), the conull subsets of $X$ , i.e., the subsets whose complement has measure zero, form a filter on $X$ . (For a non-complete measure space, one can take the subsets which, while not necessarily measurable, are contained in a measurable subset of measure zero.)
- Similarly, if $X$ is a measure space, the subsets whose complement is contained in a measurable subset of finite measure form a filter on $X$ .
- If $X$ is a topological space, the comeager subsets of $X$ , i.e., those whose complement is meager, form a filter on $X$ .
- The subsets of $\mathbb {N}$ which have a natural density of 1 form a filter on $\mathbb {N}$ .
The club filter of a regular uncountable cardinal $\kappa$ is the filter of all sets containing a club subset of $\kappa$ .
If $({\mathcal {F}}_{i})_{i\in I}$ is a family of filters on $X$ and ${\mathcal {J}}$ is a filter on $I$ then $\bigcup _{A\in {\mathcal {J}}}\bigcap _{i\in A}{\mathcal {F}}_{i}$ is a filter on $X$ called Kowalsky's filter.

Principal and free filters

The kernel of a filter ${\mathcal {F}}$ on $X$ is the intersection of all the subsets of $X$ in ${\mathcal {F}}$ .

A filter ${\mathcal {F}}$ on $X$ is principal (or atomic) when it has a particularly simple form: it contains exactly the supersets of $Y$ , for some fixed subset $Y\subseteq X$ . When $Y=\varnothing$ , this yields the improper filter. When $Y=\{y\}$ is a singleton, this filter (which consists of all subsets that contain $y$ ) is called the fundamental filter (or discrete filter) associated with $y$ .

A filter ${\mathcal {F}}$ is principal if and only if the kernel of ${\mathcal {F}}$ is an element of ${\mathcal {F}}$ , and when this is the case, ${\mathcal {F}}$ consists of the supersets of its kernel. On a finite set, every filter is principal (since the intersection defining the kernel is finite).

A filter is said to be free when it has empty kernel, otherwise it is fixed (and if $x$ is an element of the kernel, it is fixed by $x$ ). A filter on a set $X$ is free if and only if it contains the Fréchet filter on $X$ .

Two filters ${\mathcal {F}}_{1}$ and ${\mathcal {F}}_{2}$ on $X$ mesh when every member of ${\mathcal {F}}_{1}$ intersects every member of ${\mathcal {F}}_{2}$ . For every filter ${\mathcal {F}}$ on $X$ , there exists a unique pair of filters ${\mathcal {F}}_{f}$ (the free part of ${\mathcal {F}}$ ) and ${\mathcal {F}}_{p}$ (the principal part of ${\mathcal {F}}$ ) on $X$ such that ${\mathcal {F}}_{f}$ is free, ${\mathcal {F}}_{p}$ is principal, ${\mathcal {F}}_{f}\cap {\mathcal {F}}_{p}={\mathcal {F}}$ , and ${\mathcal {F}}_{p}$ does not mesh with ${\mathcal {F}}_{f}$ . The principal part ${\mathcal {F}}_{p}$ is the principal filter generated by the kernel of ${\mathcal {F}}$ , and the free part ${\mathcal {F}}_{f}$ consists of elements of ${\mathcal {F}}$ with any number of elements from the kernel possibly removed.

A filter ${\mathcal {F}}$ is countably deep if the kernel of any countable subset of ${\mathcal {F}}$ belongs to ${\mathcal {F}}$ .

Correspondence with order filters

The concept of a filter on a set is a special case of the more general concept of a filter on a partially ordered set. By definition, a filter on a partially ordered set $P$ is a subset ${\mathcal {F}}$ of $P$ which is upwards-closed (if $x\in {\mathcal {F}}$ and $x\leq y$ then $y\in {\mathcal {F}}$ ) and downwards-directed (every finite subset of ${\mathcal {F}}$ has a lower bound in ${\mathcal {F}}$ ). A filter on a set $X$ is the same as a filter on the powerset ${\mathcal {P}}(X)$ ordered by inclusion.

Constructions of filters

Intersection of filters

If $({\mathcal {F}}_{i})_{i\in I}$ is a family of filters on $X$ , its intersection $\bigcap _{i\in I}{\mathcal {F}}_{i}$ is a filter on $X$ . The intersection is a greatest lower bound operation in the set of filters on $X$ partially ordered by inclusion, which endows the filters on $X$ with a complete lattice structure.

The intersection $\bigcap _{i\in I}{\mathcal {F}}_{i}$ consists of the subsets which can be written as $\bigcup _{i\in I}A_{i}$ where $A_{i}\in {\mathcal {F}}_{i}$ for each $i\in I$ .

Filter generated by a family of subsets

Given a family of subsets ${\mathcal {S}}\subseteq {\mathcal {P}}(X)$ , there exists a minimum filter on $X$ (in the sense of inclusion) which contains ${\mathcal {S}}$ . It can be constructed as the intersection (greatest lower bound) of all filters on $X$ containing ${\mathcal {S}}$ . This filter $\langle {\mathcal {S}}\rangle$ is called the filter generated by ${\mathcal {S}}$ , and ${\mathcal {S}}$ is said to be a filter subbase of $\langle {\mathcal {S}}\rangle$ .

The generated filter can also be described more explicitly: $\langle {\mathcal {S}}\rangle$ is obtained by closing ${\mathcal {S}}$ under finite intersections, then upwards, i.e., $\langle {\mathcal {S}}\rangle$ consists of the subsets $Y\subseteq X$ such that $A_{0}\cap \dots \cap A_{n-1}\subseteq Y$ for some $A_{0},\dots ,A_{n-1}\in {\mathcal {B}}$ .

Since these operations preserve the kernel, it follows that $\langle {\mathcal {S}}\rangle$ is a proper filter if and only if ${\mathcal {S}}$ has the finite intersection property: the intersection of a finite subfamily of ${\mathcal {S}}$ is non-empty.

In the complete lattice of filters on $X$ ordered by inclusion, the least upper bound of a family of filters $({\mathcal {F}}_{i})_{i\in I}$ is the filter generated by $\bigcup _{i\in I}{\mathcal {F}}_{i}$ .

Two filters ${\mathcal {F}}_{1}$ and ${\mathcal {F}}_{2}$ on $X$ mesh if and only if $\langle {\mathcal {F}}_{1}\cup {\mathcal {F}}_{2}\rangle$ is proper.

Filter bases

Let ${\mathcal {F}}$ be a filter on $X$ . A filter base of ${\mathcal {F}}$ is a family of subsets ${\mathcal {B}}\subseteq {\mathcal {P}}(X)$ such that ${\mathcal {F}}$ is the upwards closure of ${\mathcal {B}}$ , i.e., ${\mathcal {F}}$ consists of those subsets $Y\subseteq X$ for which $A\subseteq Y$ for some $A\in {\mathcal {B}}$ .

This upwards closure is a filter if and only if ${\mathcal {B}}$ is downwards-directed, i.e., ${\mathcal {B}}$ is non-empty and for all $A,B\in {\mathcal {B}}$ there exists $C\in {\mathcal {B}}$ such that $C\subseteq A\cap B$ . When this is the case, ${\mathcal {B}}$ is also called a prefilter, and the upwards closure is also equal to the generated filter $\langle {\mathcal {B}}\rangle$ . Hence, being a filter base of ${\mathcal {F}}$ is a stronger property than being a filter subbase of ${\mathcal {F}}$ .

Examples

When $X$ is a topological space and $x\in X$ , a filter base of the neighborhood filter of $x$ is known as a neighborhood base for $x$ , and similarly, a filter subbase of the neighborhood filter of $x$ is known as a neighborhood subbase for $x$ . The open neighborhoods of $x$ always form a neighborhood base for $x$ , by definition of the neighborhood filter. In $X=\mathbb {R} ^{n}$ , the closed balls of positive radius around $x$ also form a neighborhood base for $x$ .
Let $X$ be an infinite set and let ${\mathcal {F}}$ consist of the subsets of $X$ which contain all points but one. Then ${\mathcal {F}}$ is a filter subbase of the Fréchet filter on $X$ , which consists of the cofinite subsets. Its closure under finite intersections is the entire Fréchet filter, but there are smaller bases of the Fréchet filter which contain the subbase ${\mathcal {F}}$ , such as the one formed by the subsets of $X$ which contain all points but a finite odd number. In fact, for every base of the Fréchet filter, removing any subset yields another base of the Fréchet filter.
If $X$ is a topological space, the dense open subsets of $X$ form a filter base on $X$ , because they are closed under finite intersection. The filter they generate consists of the complements of nowhere dense subsets. On $X=\mathbb {R} ^{n}$ , restricting to the null dense open subsets yields another filter base for the same filter.^{[citation needed]}
Similarly, if $X$ is a topological space, the countable intersections of dense open subsets form a filter base which generates the filter of comeager subsets.
Let $X$ be a set and let $(x_{i})_{i\in I}$ be a net with values in $X$ , i.e., a family whose domain $I$ is a directed set. The filter base of tails of $(x_{i})$ consists of the sets $\{x_{j},j\geq i\}$ for $i\in I$ ; it is downwards-closed by directedness of $I$ . The generated filter is called the eventuality filter or filter of tails of $(x_{n})$ . A sequential filter or elementary filter^{[citation needed]} is a filter which is the eventuality filter of some net. This example is fundamental in the application of filters in topology.
Every π-system is a filter base.

Trace of a filter on a subset

If ${\mathcal {F}}$ is a filter on $X$ and $Y\subseteq X$ , the trace of ${\mathcal {F}}$ on $Y$ is $\{A\cap Y,A\in {\mathcal {F}}\}$ , which is a filter.

Image of a filter by a function

Let $f:X\to Y$ be a function.

When ${\mathcal {F}}$ is a family of subsets of $X$ , its image by $f$ is defined as

$f({\mathcal {F}})=\{\{f(x),x\in A\},A\in {\mathcal {F}}\}$

The image filter by $f$ of a filter ${\mathcal {F}}$ on $X$ is defined as the generated filter $\langle f({\mathcal {F}})\rangle$ . If $f$ is surjective, then $f({\mathcal {F}})$ is already a filter. In the general case, $f({\mathcal {F}})$ is a filter base and hence $\langle f({\mathcal {F}})\rangle$ is its upwards closure. Furthermore, if ${\mathcal {B}}$ is a filter base of ${\mathcal {F}}$ then $f({\mathcal {B}})$ is a filter base of $\langle f({\mathcal {F}})\rangle$ .

The kernels of ${\mathcal {F}}$ and $\langle f({\mathcal {F}})\rangle$ are linked by $f\left(\bigcap {\mathcal {F}}\right)\subseteq \bigcap \langle f({\mathcal {F}})\rangle$ .

Product of filters

Given a family of sets $(X_{i})_{i\in I}$ and a filter ${\mathcal {F}}_{i}$ on each $X_{i}$ , the product filter $\prod _{i\in I}{\mathcal {F}}_{i}$ on the product set $\prod _{i\in I}X_{i}$ is defined as the filter generated by the sets $\pi _{i}^{-1}(A)$ for $i\in I$ and $A\in {\mathcal {F}}_{i}$ , where $\pi _{i}:\left(\prod _{j\in I}X_{j}\right)\to X_{i}$ is the projection from the product set onto the $i$ -th component. This construction is similar to the product topology.

If each ${\mathcal {B}}_{i}$ is a filter base on ${\mathcal {F}}_{i}$ , a filter base of $\prod _{i\in I}{\mathcal {F}}_{i}$ is given by the sets $\prod _{i\in I}A_{i}$ where $(A_{i})$ is a family such that $A_{i}\in {\mathcal {F}}_{i}$ for all $i\in I$ and $A_{i}=X_{i}$ for all but finitely many $i\in I$ .

Notes

↑ The intersection of zero subsets of $X$ is $X$ itself.
↑ It is immediate that a filter on $X$ is an order filter on ${\mathcal {P}}(X)$ . For the converse, let ${\mathcal {F}}$ be an order filter on ${\mathcal {P}}(X)$ . It is upwards-closed by definition. We check closure under finite intersections. If $A_{0},\dots ,A_{n-1}$ is a finite family of subsets from ${\mathcal {F}}$ , it has a lower bound in ${\mathcal {F}}$ by downwards-closure, which is some $B\in {\mathcal {F}}$ such that $B\subseteq A_{0},\dots ,B\subseteq A_{n-1}$ . Then $B\subseteq A_{0}\cap \dots \cap A_{n-1}$ , hence $A_{0}\cap \dots \cap A_{n-1}\in {\mathcal {F}}$ by upwards-closure.

Citations

↑ Cartan 1937a.
↑ Cartan 1937b.
1 2 3 4 Császár 1978, p. 56.
1 2 Schechter 1996, p. 100.
1 2 Willard 2004, p. 78.
1 2 3 Dolecki & Mynard 2016, p. 29.
↑ Joshi 1983, p. 241.
↑ Köthe 1983, p. 11.
↑ Schubert 1968, p. 48.
1 2 Schubert 1968, p. 49.
1 2 Schechter 1996, p. 102.
1 2 3 4 Bourbaki 1987, pp. 57–68.
1 2 3 4 5 Joshi 1983, p. 242.
1 2 3 4 Dolecki & Mynard 2016, p. 30.
1 2 Schechter 1996, p. 103.
1 2 3 Schechter 1996, p. 104.
↑ Jech, Thomas (2006). Set Theory: The Third Millennium Edition, Revised and Expanded. Berlin New York: Springer Science & Business Media. p. 74. ISBN 978-3-540-44085-7. OCLC 50422939.
↑ Schechter 1996, pp. 100–130.
↑ Wilansky 2013, p. 44.
1 2 Dolecki & Mynard 2016, p. 33.
↑ Schechter 1996, p. 16.
1 2 Dolecki & Mynard 2016, p. 34.
1 2 Dolecki & Mynard 2016, p. 31.
↑ Schubert 1968, p. 50.
↑ Császár 1978, p. 57.
↑ Dolecki & Mynard 2016, p. 35.
↑ Narici & Beckenstein 2011, p. 5.
↑ Joshi 1983, p. 246.
↑ Dolecki & Mynard 2016, p. 37.
↑ Dolecki & Mynard 2016, p. 39.
↑ Köthe 1983, p. 14.

References

Bourbaki, Nicolas (1989) [1966]. General Topology: Chapters 1–4 [Topologie Générale]. Éléments de mathématique. Berlin New York: Springer Science & Business Media. doi:10.1007/978-3-642-61701-0. ISBN 978-3-540-64241-1. OCLC 18588129.
Bourbaki, Nicolas (1989) [1967]. General Topology 2: Chapters 5–10 [Topologie Générale]. Éléments de mathématique. Vol. 4. Berlin New York: Springer Science & Business Media. ISBN 978-3-540-64563-4. OCLC 246032063.
Bourbaki, Nicolas (1987) [1981]. Topological Vector Spaces: Chapters 1–5. Éléments de mathématique. Translated by Eggleston, H.G.; Madan, S. Berlin New York: Springer-Verlag. ISBN 3-540-13627-4. OCLC 17499190.
Burris, Stanley; Sankappanavar, Hanamantagouda P. (2012). A Course in Universal Algebra (PDF). Springer-Verlag. pp. 127–135. ISBN 978-0-9880552-0-9. Archived (PDF) from the original on 1 April 2022.
Cartan, Henri (1937a). "Théorie des filtres". Comptes rendus hebdomadaires des séances de l'Académie des sciences. 205: 595–598.
Cartan, Henri (1937b). "Filtres et ultrafiltres". Comptes rendus hebdomadaires des séances de l'Académie des sciences. 205: 777–779.
Császár, Ákos (1978). General topology. Translated by Császár, Klára. Bristol England: Adam Hilger Ltd. pp. 55–59. ISBN 0-85274-275-4. OCLC 4146011.
Dolecki, Szymon; Mynard, Frédéric (2016). Convergence Foundations Of Topology. New Jersey: World Scientific Publishing Company. pp. 29–39. ISBN 978-981-4571-52-4. OCLC 945169917.
Joshi, K. D. (1983). Introduction to General Topology. New York: John Wiley and Sons Ltd. pp. 241–248. ISBN 978-0-85226-444-7. OCLC 9218750.
Köthe, Gottfried (1983) [1969]. Topological Vector Spaces I. Grundlehren der mathematischen Wissenschaften. Vol. 159. Translated by Garling, D. J. H. New York: Springer Science & Business Media. pp. 11–15. ISBN 978-3-642-64988-2. MR 0248498. 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. 31: 68–95. doi:10.1093/jigpal/jzab030.
MacIver R., David (1 July 2004). "Filters in Analysis and Topology" (PDF). Archived from the original (PDF) on 2007-10-09. (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. pp. 2–5. ISBN 978-1584888666. OCLC 144216834.
Schechter, Eric (1996). Handbook of Analysis and Its Foundations. San Diego, CA: Academic Press. pp. 100–105. ISBN 978-0-12-622760-4. OCLC 175294365.
Schubert, Horst (1968). Topology. London: Macdonald & Co. pp. 48–51. ISBN 978-0-356-02077-8. OCLC 463753.
Wilansky, Albert (2013). Modern Methods in Topological Vector Spaces. Mineola, New York: Dover Publications, Inc. ISBN 978-0-486-49353-4. OCLC 849801114.
Willard, Stephen (2004) [1970]. General Topology. Mineola, N.Y.: Dover Publications. pp. 77–84. ISBN 978-0-486-43479-7. OCLC 115240.

Families ${\mathcal {F}}$ of sets over $\Omega$ v t e
Is necessarily true of ${\mathcal {F}}\colon$ or, is ${\mathcal {F}}$ closed under:	Directed by $\,\supseteq$	$A\cap B$	$A\cup B$	$B\setminus A$	$\Omega \setminus A$	$A_{1}\cap A_{2}\cap \cdots$	$A_{1}\cup A_{2}\cup \cdots$	$\Omega \in {\mathcal {F}}$	$\varnothing \in {\mathcal {F}}$	F.I.P.
$π$ -system
Semiring										Never
Semialgebra (semifield)										Never
Monotone class						only if $A_{i}\searrow$	only if $A_{i}\nearrow$
𝜆-system (Dynkin system)				only if $A\subseteq B$			only if $A_{i}\nearrow$ or they are disjoint			Never
Ring (order theory)
Ring (measure theory)										Never
δ-ring										Never
𝜎-ring										Never
Algebra (field)										Never
𝜎-algebra (𝜎-field)										Never
Filter
Proper filter				Never	Never				Never
Prefilter (filter base)
Filter subbase
Open topology							(even arbitrary $\cup$ )			Never
Closed topology						(even arbitrary $\cap$ )				Never
Is necessarily true of ${\mathcal {F}}\colon$ or, is ${\mathcal {F}}$ closed under:	directed downward	finite intersections	finite unions	relative complements	complements in $\Omega$	countable intersections	countable unions	contains $\Omega$	contains $\varnothing$	Finite intersection property
Additionally, a *semiring* is a $π$ -system where every complement $B\setminus A$ is equal to a finite disjoint union of sets in ${\mathcal {F}}.$ A *semialgebra* is a semiring where every complement $\Omega \setminus A$ is equal to a finite disjoint union of sets in ${\mathcal {F}}.$ $A,B,A_{1},A_{2},\ldots$ are arbitrary elements of ${\mathcal {F}}$ and it is assumed that ${\mathcal {F}}\neq \varnothing .$

[6] The intersection of zero subsets of $X$ is $X$ itself.

[25] It is immediate that a filter on $X$ is an order filter on ${\mathcal {P}}(X)$ . For the converse, let ${\mathcal {F}}$ be an order filter on ${\mathcal {P}}(X)$ . It is upwards-closed by definition. We check closure under finite intersections. If $A_{0},\dots ,A_{n-1}$ is a finite family of subsets from ${\mathcal {F}}$ , it has a lower bound in ${\mathcal {F}}$ by downwards-closure, which is some $B\in {\mathcal {F}}$ such that $B\subseteq A_{0},\dots ,B\subseteq A_{n-1}$ . Then $B\subseteq A_{0}\cap \dots \cap A_{n-1}$ , hence $A_{0}\cap \dots \cap A_{n-1}\in {\mathcal {F}}$ by upwards-closure.

[FOOTNOTECartan1937a-1] Cartan 1937a.

[FOOTNOTECartan1937b-2] Cartan 1937b.

[FOOTNOTECsászár197856-3] 1 2 3 4 Császár 1978, p. 56.

[FOOTNOTESchechter1996100-4] 1 2 Schechter 1996, p. 100.

[FOOTNOTEWillard200478-5] 1 2 Willard 2004, p. 78.

[FOOTNOTEDoleckiMynard201629-7] 1 2 3 Dolecki & Mynard 2016, p. 29.

[FOOTNOTEJoshi1983241-8] Joshi 1983, p. 241.

[FOOTNOTEKöthe198311-9] Köthe 1983, p. 11.

[FOOTNOTESchubert196848-10] Schubert 1968, p. 48.

[FOOTNOTESchubert196849-11] 1 2 Schubert 1968, p. 49.

[FOOTNOTESchechter1996102-12] 1 2 Schechter 1996, p. 102.

[FOOTNOTEBourbaki198757–68-13] 1 2 3 4 Bourbaki 1987, pp. 57–68.

[FOOTNOTEJoshi1983242-14] 1 2 3 4 5 Joshi 1983, p. 242.

[FOOTNOTEDoleckiMynard201630-15] 1 2 3 4 Dolecki & Mynard 2016, p. 30.

[FOOTNOTESchechter1996103-16] 1 2 Schechter 1996, p. 103.

[FOOTNOTESchechter1996104-17] 1 2 3 Schechter 1996, p. 104.

[18] Jech, Thomas (2006). Set Theory: The Third Millennium Edition, Revised and Expanded. Berlin New York: Springer Science & Business Media. p. 74. ISBN 978-3-540-44085-7. OCLC 50422939.

[FOOTNOTESchechter1996100–130-19] Schechter 1996, pp. 100–130.

[FOOTNOTEWilansky201344-20] Wilansky 2013, p. 44.

[FOOTNOTEDoleckiMynard201633-21] 1 2 Dolecki & Mynard 2016, p. 33.

[FOOTNOTESchechter199616-22] Schechter 1996, p. 16.

[FOOTNOTEDoleckiMynard201634-23] 1 2 Dolecki & Mynard 2016, p. 34.

[FOOTNOTEDoleckiMynard201631-24] 1 2 Dolecki & Mynard 2016, p. 31.

[FOOTNOTESchubert196850-26] Schubert 1968, p. 50.

[FOOTNOTECsászár197857-27] Császár 1978, p. 57.

[FOOTNOTEDoleckiMynard201635-28] Dolecki & Mynard 2016, p. 35.

[FOOTNOTENariciBeckenstein20115-29] Narici & Beckenstein 2011, p. 5.

[FOOTNOTEJoshi1983246-30] Joshi 1983, p. 246.

[FOOTNOTEDoleckiMynard201637-31] Dolecki & Mynard 2016, p. 37.

[FOOTNOTEDoleckiMynard201639-32] Dolecki & Mynard 2016, p. 39.

[FOOTNOTEKöthe198314-33] Köthe 1983, p. 14.

v t e Set theory
Overview	Set (mathematics)
Axioms	Adjunction Choice countable dependent global Constructibility (V=L) Determinacy projective Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification
Operations	Cartesian product Complement (i.e. set difference) De Morgan's laws Disjoint union Identities Intersection Power set Symmetric difference Union
Concepts Methods	Almost Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Set-builder notation Transfinite induction Venn diagram
Set types	Amorphous Countable Empty Finite (hereditarily) Filter base subbase Ultrafilter Fuzzy Infinite (Dedekind-infinite) Recursive Singleton Subset · Superset Transitive Uncountable Universal
Theories	Alternative Axiomatic Constructive Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck
Paradoxes Problems	Russell's paradox Suslin's problem Burali-Forti paradox
Set theorists	Paul Bernays Georg Cantor Paul Cohen Richard Dedekind Abraham Fraenkel Kurt Gödel Thomas Jech John von Neumann Willard Quine Bertrand Russell Thoralf Skolem Ernst Zermelo

Filter on a set

Definition

Examples

Principal and free filters

Correspondence with order filters

Constructions of filters

Intersection of filters

Filter generated by a family of subsets

Filter bases

Examples

Trace of a filter on a subset

Image of a filter by a function

Product of filters

See also

Notes

Citations

References