Finite intersection property

In general topology, a branch of mathematics, a non-empty family A of subsets of a set ${\displaystyle X}$ is said to have the finite intersection property (FIP) if the intersection over any finite subcollection of ${\displaystyle A}$ is non-empty. It has the strong finite intersection property (SFIP) if the intersection over any finite subcollection of ${\displaystyle A}$ is infinite. Sets with the finite intersection property are also called centered systems and filter subbases. ^[1]

The finite intersection property can be used to reformulate topological compactness in terms of closed sets; this is its most prominent application. Other applications include proving that certain perfect sets are uncountable, and the construction of ultrafilters.

Definition

Let ${\textstyle X}$ be a set and ${\textstyle {\mathcal {A}}}$ a nonempty family of subsets of ${\textstyle X}$; that is, ${\textstyle {\mathcal {A}}}$ is a subset of the power set of ${\textstyle X}$. Then ${\textstyle {\mathcal {A}}}$ is said to have the finite intersection property if every nonempty finite subfamily has nonempty intersection; it is said to have the strong finite intersection property if that intersection is always infinite. ^[1]

In symbols, ${\textstyle {\mathcal {A}}}$ has the FIP if, for any choice of a finite nonempty subset ${\textstyle {\mathcal {B}}}$ of ${\textstyle {\mathcal {A}}}$, there must exist a point $${\displaystyle x\in \bigcap _{B\in {\mathcal {B}}}{B}{\text{.}}}$$ Likewise, ${\textstyle {\mathcal {A}}}$ has the SFIP if, for every choice of such ${\textstyle {\mathcal {B}}}$, there are infinitely many such ${\textstyle x}$. ^[1]

In the study of filters, the common intersection of a family of sets is called a kernel, from much the same etymology as the sunflower. Families with empty kernel are called free; those with nonempty kernel, fixed. ^[2]

Families of examples and non-examples

The empty set cannot belong to any collection with the finite intersection property.

A sufficient condition for the FIP intersection property is a nonempty kernel. The converse is generally false, but holds for finite families; that is, if ${\displaystyle {\mathcal {A}}}$ is finite, then ${\displaystyle {\mathcal {A}}}$ has the finite intersection property if and only if it is fixed.

Pairwise intersection

The finite intersection property is strictly stronger than pairwise intersection; the family ${\displaystyle \{\{1,2\},\{2,3\},\{1,3\}\}}$ has pairwise intersections, but not the FIP.

More generally, let ${\textstyle n\in \mathbb {N} \setminus \{1\}}$ be a positive integer greater than unity, ${\textstyle [n]=\{1,\dots ,n\}}$, and ${\textstyle {\mathcal {A}}=\{[n]\setminus \{j\}:j\in [n]\}}$. Then any subset of ${\displaystyle {\mathcal {A}}}$ with fewer than ${\textstyle n}$ elements has nonempty intersection, but ${\textstyle {\mathcal {A}}}$ lacks the FIP.

End-type constructions

If ${\displaystyle A_{1}\supseteq A_{2}\supseteq A_{3}\cdots }$ is a decreasing sequence of non-empty sets, then the family ${\textstyle {\mathcal {A}}=\left\{A_{1},A_{2},A_{3},\ldots \right\}}$ has the finite intersection property (and is even a π–system). If the inclusions ${\displaystyle A_{1}\supseteq A_{2}\supseteq A_{3}\cdots }$ are strict, then ${\textstyle {\mathcal {A}}}$ admits the strong finite intersection property as well.

More generally, any ${\textstyle {\mathcal {A}}}$ that is totally ordered by inclusion has the FIP.

At the same time, the kernel of ${\textstyle {\mathcal {A}}}$ may be empty: if ${\textstyle A_{j}=\{j,j+1,j+2,\dots \}}$, then the kernel of ${\displaystyle {\mathcal {A}}}$ is the empty set. Similarly, the family of intervals ${\displaystyle \left\{[r,\infty ):r\in \mathbb {R} \right\}}$ also has the (S)FIP, but empty kernel.

"Generic" sets and properties

The family of all Borel subsets of ${\displaystyle [0,1]}$ with Lebesgue measure ${\textstyle 1}$ has the FIP, as does the family of comeagre sets. If ${\textstyle X}$ is an infinite set, then the Fréchet filter (the family ${\textstyle \{X\setminus C:C{\text{ finite}}\}}$) has the FIP. All of these are free filters; they are upwards-closed and have empty infinitary intersection. ^{[3] [4]}

If ${\displaystyle X=(0,1)}$ and, for each positive integer ${\displaystyle i,}$ the subset ${\displaystyle X_{i}}$ is precisely all elements of ${\displaystyle X}$ having digit ${\displaystyle 0}$ in the ${\displaystyle i}$^th decimal place, then any finite intersection of ${\displaystyle X_{i}}$ is non-empty — just take ${\displaystyle 0}$ in those finitely many places and ${\displaystyle 1}$ in the rest. But the intersection of ${\displaystyle X_{i}}$ for all ${\displaystyle i\geq 1}$ is empty, since no element of ${\displaystyle (0,1)}$ has all zero digits.

Extension of the ground set

The (strong) finite intersection property is a characteristic of the family ${\textstyle {\mathcal {A}}}$, not the ground set ${\textstyle X}$. If a family ${\textstyle {\mathcal {A}}}$ on the set ${\textstyle X}$ admits the (S)FIP and ${\textstyle X\subseteq Y}$, then ${\textstyle {\mathcal {A}}}$ is also a family on the set ${\textstyle Y}$ with the FIP (resp. SFIP).

Generated filters and topologies

See also: § Relationship to π-systems and filters

If ${\displaystyle K\subseteq X}$ are sets with ${\displaystyle K\neq \varnothing }$ then the family ${\displaystyle {\mathcal {A}}=\{S\subseteq X:K\subseteq S\}}$ has the FIP; this family is called the principal filter on ${\textstyle X}$ generated by ${\textstyle K}$. The subset ${\displaystyle {\mathcal {B}}=\{I\subseteq \mathbb {R} :K\subseteq I{\text{ and }}I{\text{ an open interval}}\}}$ has the FIP for much the same reason: the kernels contain the non-empty set ${\textstyle K}$. If ${\textstyle K}$ is an open interval, then the set ${\textstyle K}$ is in fact equal to the kernels of ${\textstyle {\mathcal {A}}}$ or ${\textstyle {\mathcal {B}}}$, and so is an element of each filter. But in general a filter's kernel need not be an element of the filter.

A proper filter on a set has the finite intersection property. Every neighbourhood subbasis at a point in a topological space has the FIP, and the same is true of every neighbourhood basis and every neighbourhood filter at a point (because each is, in particular, also a neighbourhood subbasis).

Relationship to π-systems and filters

Main articles: Pi-system and Upward closure

A π–system is a non-empty family of sets that is closed under finite intersections. The set $${\displaystyle \pi ({\mathcal {A}})=\left\{A_{1}\cap \cdots \cap A_{n}:1\leq n<\infty {\text{ and }}A_{1},\ldots ,A_{n}\in {\mathcal {A}}\right\}}$$of all finite intersections of one or more sets from ${\displaystyle {\mathcal {A}}}$ is called the π–system generated by ${\textstyle {\mathcal {A}}}$, because it is the smallest π–system having ${\textstyle {\mathcal {A}}}$ as a subset.

The upward closure of ${\displaystyle \pi ({\mathcal {A}})}$ in ${\textstyle X}$ is the set $${\displaystyle \pi ({\mathcal {A}})^{\uparrow X}=\left\{S\subseteq X:P\subseteq S{\text{ for some }}P\in \pi ({\mathcal {A}})\right\}{\text{.}}}$$

For any family ${\textstyle {\mathcal {A}}}$, the finite intersection property is equivalent to any of the following:

• The π–system generated by ${\displaystyle {\mathcal {A}}}$ does not have the empty set as an element; that is, ${\displaystyle \varnothing \notin \pi ({\mathcal {A}}).}$
• The set ${\displaystyle \pi ({\mathcal {A}})}$ has the finite intersection property.
• The set ${\displaystyle \pi ({\mathcal {A}})}$ is a (proper) ^{[note 1]} prefilter.
• The family ${\displaystyle {\mathcal {A}}}$ is a subset of some (proper) prefilter. ^[1]
• The upward closure ${\textstyle \pi ({\mathcal {A}})^{\uparrow X}}$ is a (proper) filter on ${\textstyle X}$. In this case, ${\displaystyle \pi ({\mathcal {A}})^{\uparrow X}}$ is called the filter on ${\textstyle X}$ generated by ${\textstyle {\mathcal {A}}}$, because it is the minimal (with respect to ${\displaystyle \,\subseteq \,}$) filter on ${\displaystyle X}$ that contains ${\displaystyle {\mathcal {A}}}$ as a subset.
• ${\displaystyle {\mathcal {A}}}$ is a subset of some (proper) ^{[note 1]} filter. ^[1]

Applications

Compactness

The finite intersection property is useful in formulating an alternative definition of compactness:

Theorem — A space is compact if and only if every family of closed subsets having the finite intersection property has non-empty intersection. ^{[5] [6]}

This formulation of compactness is used in some proofs of Tychonoff's theorem.

Uncountability of perfect spaces

Another common application is to prove that the real numbers are uncountable.

Theorem — Let ${\displaystyle X}$ be a non-empty compact Hausdorff space that satisfies the property that no one-point set is open. Then ${\displaystyle X}$ is uncountable.

All the conditions in the statement of the theorem are necessary:

1. We cannot eliminate the Hausdorff condition; a countable set (with at least two points) with the indiscrete topology is compact, has more than one point, and satisfies the property that no one point sets are open, but is not uncountable.
2. We cannot eliminate the compactness condition, as the set of rational numbers shows.
3. We cannot eliminate the condition that one point sets cannot be open, as any finite space with the discrete topology shows.

Proof

We will show that if ${\displaystyle U\subseteq X}$ is non-empty and open, and if ${\displaystyle x}$ is a point of ${\displaystyle X,}$ then there is a neighbourhood ${\displaystyle V\subset U}$ whose closure does not contain ${\displaystyle x}$ (${\displaystyle x}$' may or may not be in ${\displaystyle U}$). Choose ${\displaystyle y\in U}$ different from ${\displaystyle x}$ (if ${\displaystyle x\in U}$ then there must exist such a ${\displaystyle y}$ for otherwise ${\displaystyle U}$ would be an open one point set; if ${\displaystyle x\notin U,}$ this is possible since ${\displaystyle U}$is non-empty). Then by the Hausdorff condition, choose disjoint neighbourhoods ${\displaystyle W}$ and ${\displaystyle K}$ of ${\displaystyle x}$ and ${\displaystyle y}$ respectively. Then ${\displaystyle K\cap U}$ will be a neighbourhood of ${\displaystyle y}$ contained in ${\displaystyle U}$ whose closure doesn't contain ${\displaystyle x}$ as desired.

Now suppose ${\displaystyle f:\mathbb {N} \to X}$ is a bijection, and let ${\displaystyle \left\{x_{i}:i\in \mathbb {N} \right\}}$ denote the image of ${\displaystyle f.}$ Let ${\displaystyle X}$ be the first open set and choose a neighbourhood ${\displaystyle U_{1}\subset X}$ whose closure does not contain ${\displaystyle x_{1}.}$ Secondly, choose a neighbourhood ${\displaystyle U_{2}\subset U_{1}}$ whose closure does not contain ${\displaystyle x_{2}.}$ Continue this process whereby choosing a neighbourhood ${\displaystyle U_{n+1}\subset U_{n}}$ whose closure does not contain ${\displaystyle x_{n+1}.}$ Then the collection ${\displaystyle \left\{U_{i}:i\in \mathbb {N} \right\}}$ satisfies the finite intersection property and hence the intersection of their closures is non-empty by the compactness of ${\displaystyle X.}$ Therefore, there is a point ${\displaystyle x}$ in this intersection. No ${\displaystyle x_{i}}$ can belong to this intersection because ${\displaystyle x_{i}}$ does not belong to the closure of ${\displaystyle U_{i}.}$ This means that ${\displaystyle x}$ is not equal to ${\displaystyle x_{i}}$ for all ${\displaystyle i}$ and ${\displaystyle f}$ is not surjective; a contradiction. Therefore, ${\displaystyle X}$ is uncountable.

Corollary — Every closed interval ${\displaystyle [a,b]}$ with ${\displaystyle a<b}$ is uncountable. Therefore, ${\displaystyle \mathbb {R} }$ is uncountable.

Corollary — Every perfect, locally compact Hausdorff space is uncountable.

Proof

Let ${\displaystyle X}$ be a perfect, compact, Hausdorff space, then the theorem immediately implies that ${\displaystyle X}$ is uncountable. If ${\displaystyle X}$ is a perfect, locally compact Hausdorff space that is not compact, then the one-point compactification of ${\displaystyle X}$ is a perfect, compact Hausdorff space. Therefore, the one point compactification of ${\displaystyle X}$ is uncountable. Since removing a point from an uncountable set still leaves an uncountable set, ${\displaystyle X}$ is uncountable as well.

Ultrafilters

Let ${\displaystyle X}$ be non-empty, ${\displaystyle F\subseteq 2^{X}.}$${\displaystyle F}$ having the finite intersection property. Then there exists an ${\displaystyle U}$ ultrafilter (in ${\displaystyle 2^{X}}$) such that ${\displaystyle F\subseteq U.}$ This result is known as the ultrafilter lemma. ^[7]

See also

• Filter (set theory)  – Family of sets representing "large" sets
• Filters in topology  – Use of filters to describe and characterize all basic topological notions and results.
• Neighbourhood system  – (for a point x) collection of all neighborhoods for the point xPages displaying wikidata descriptions as a fallback
• Ultrafilter (set theory)  – Maximal proper filterPages displaying short descriptions of redirect targets

References

Notes

1. A filter or prefilter on a set is proper or non-degenerate if it does not contain the empty set as an element. Like many − but not all − authors, this article will require non-degeneracy as part of the definitions of "prefilter" and "filter".

Citations

1. Joshi 1983, pp. 242−248.
2. Dolecki & Mynard 2016, pp. 27–29, 33–35.
3. Bourbaki 1987, pp. 57–68.
4. Wilansky 2013, pp. 44–46.
5. Munkres 2000, p. 169.
6. A space is compact iff any family of closed sets having fip has non-empty intersection at PlanetMath.
7. Csirmaz, László; Hajnal, András (1994), Matematikai logika (In Hungarian), Budapest: Eötvös Loránd University .

General sources

• 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. 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.
• Comfort, William Wistar; Negrepontis, Stylianos (1974). The Theory of Ultrafilters. Vol. 211. Berlin Heidelberg New York: Springer-Verlag. ISBN   978-0-387-06604-2. OCLC   1205452.
• Császár, Ákos (1978). General topology. Translated by Császár, Klára. Bristol England: Adam Hilger Ltd. ISBN   0-85274-275-4. OCLC   4146011.
• Dolecki, Szymon; Mynard, Frédéric (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.
• Joshi, K. D. (1983). Introduction to General Topology. New York: John Wiley and Sons Ltd. ISBN   978-0-85226-444-7. OCLC   9218750.
• 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.)
• Munkres, James R. (2000). Topology (Second ed.). Upper Saddle River, NJ: Prentice Hall, Inc. ISBN   978-0-13-181629-9. OCLC   42683260.
• Narici, Lawrence; Beckenstein, Edward (2011). Topological Vector Spaces. Pure and applied mathematics (Second ed.). Boca Raton, FL: CRC Press. ISBN   978-1584888666. OCLC   144216834.
• Wilansky, Albert (2013). Modern Methods in Topological Vector Spaces. Mineola, New York: Dover Publications, Inc. ISBN   978-0-486-49353-4. OCLC   849801114.
• Wilansky, Albert (17 October 2008) [1970]. Topology for Analysis. Mineola, New York: Dover Publications, Inc. ISBN   978-0-486-46903-4. OCLC   227923899.

External links

• "Finite intersection property". PlanetMath .

Families ${\displaystyle {\mathcal {F}}}$ of sets over ${\displaystyle \Omega }$ v t e
Is necessarily true of ${\displaystyle {\mathcal {F}}\colon }$ or, is ${\displaystyle {\mathcal {F}}}$ closed under:	Directed by ${\displaystyle \,\supseteq }$	${\displaystyle A\cap B}$	${\displaystyle A\cup B}$	${\displaystyle B\setminus A}$	${\displaystyle \Omega \setminus A}$	${\displaystyle A_{1}\cap A_{2}\cap \cdots }$	${\displaystyle A_{1}\cup A_{2}\cup \cdots }$	${\displaystyle \Omega \in {\mathcal {F}}}$	${\displaystyle \varnothing \in {\mathcal {F}}}$	F.I.P.
π-system
Semiring										Never
Semialgebra(Semifield)										Never
Monotone class						only if ${\displaystyle A_{i}\searrow }$	only if ${\displaystyle A_{i}\nearrow }$
𝜆-system(Dynkin System)				only if ${\displaystyle A\subseteq B}$			only if ${\displaystyle 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
Dual ideal
Filter				Never	Never				${\displaystyle \varnothing \not \in {\mathcal {F}}}$
Prefilter(Filter base)				Never	Never				${\displaystyle \varnothing \not \in {\mathcal {F}}}$
Filter subbase				Never	Never				${\displaystyle \varnothing \not \in {\mathcal {F}}}$
Open Topology							(even arbitrary ${\displaystyle \cup }$)			Never
Closed Topology						(even arbitrary ${\displaystyle \cap }$)				Never
Is necessarily true of ${\displaystyle {\mathcal {F}}\colon }$ or, is ${\displaystyle {\mathcal {F}}}$ closed under:	directed downward	finite intersections	finite unions	relative complements	complements in ${\displaystyle \Omega }$	countable intersections	countable unions	contains ${\displaystyle \Omega }$	contains ${\displaystyle \varnothing }$	Finite Intersection Property
Additionally, a semiring is a π-system where every complement ${\displaystyle B\setminus A}$ is equal to a finite disjoint union of sets in ${\displaystyle {\mathcal {F}}.}$ A semialgebra is a semiring where every complement ${\displaystyle \Omega \setminus A}$ is equal to a finite disjoint union of sets in ${\displaystyle {\mathcal {F}}.}$ ${\displaystyle A,B,A_{1},A_{2},\ldots }$ are arbitrary elements of ${\displaystyle {\mathcal {F}}}$ and it is assumed that ${\displaystyle {\mathcal {F}}\neq \varnothing .}$