Finite intersection property

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

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 X {\displaystyle X} be a set and A {\displaystyle {\mathcal {A}}} a family of subsets of X {\displaystyle X} (a subset of the power set of X {\displaystyle X}). Then A {\displaystyle {\mathcal {A}}} is said to have the finite intersection property if the intersection of a finite number of subsets from A {\displaystyle {\mathcal {A}}} is always non-empty; it is said to have the strong finite intersection property if that intersection is always infinite.

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

Examples and non-examples

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

If A {\displaystyle {\mathcal {A}}} has a non-empty kernel, then it has the finite intersection property trivially. The converse is false in general (although it holds trivially when A {\displaystyle {\mathcal {A}}} is finite). For example, the family of all cofinite subsets of a fixed infinite set — the Fréchet filter — has the finite intersection property, although its kernel is empty. More generally, any proper filter has the finite intersection property.

The finite intersection property is strictly stronger than requiring pairwise intersection to be non-empty, e.g., the family { { 1 , 2 } , { 2 , 3 } , { 1 , 3 } } {\displaystyle \{\{1,2\},\{2,3\},\{1,3\}\}} has non-empty pairwise intersections, but does not possess the finite intersection property. More generally, let n {\displaystyle n} be a natural number, let X {\displaystyle X} be a set with n {\displaystyle n} elements and let A {\displaystyle {\mathcal {A}}} consists of those subsets of X {\displaystyle X} which contain all elements but one. Then the intersection of fewer than n {\displaystyle n} subsets from A {\displaystyle {\mathcal {A}}} has non-empty intersection, but A {\displaystyle {\mathcal {A}}} lacks the finite intersection property.

End-type constructions

If A 0 ⊇ A 1 ⊇ A 2 ⋯ {\displaystyle A_{0}\supseteq A_{1}\supseteq A_{2}\cdots } is a decreasing sequence of non-empty sets, then the family A = { A 0 , A 1 , A 2 , … } {\textstyle {\mathcal {A}}=\left\{A_{0},A_{1},A_{2},\ldots \right\}} has the finite intersection property (and is even a π–system). If each A i {\displaystyle A_{i}} is infinite, then A {\textstyle {\mathcal {A}}} admits the strong finite intersection property as well.

More generally, any family of non-empty sets which is totally ordered by inclusion has the finite intersection property, and any family of infinite sets which is totally ordered by inclusion has the strong finite intersection property. At the same time, the kernel may be empty: consider the family of subsets [ a , + ∞ ) {\displaystyle [a,+\infty )} for a ∈ R {\displaystyle a\in \mathbb {R} }.

"Generic" sets and properties

The family of all Borel subsets of [ 0 , 1 ] {\displaystyle [0,1]} with Lebesgue measure 1 has the finite intersection property, as does the family of comeagre sets.

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

Generated filters and topologies

If K ⊆ X {\displaystyle K\subseteq X} is a non-empty set, then the family A = { S ⊆ X : K ⊆ S } {\displaystyle {\mathcal {A}}=\{S\subseteq X:K\subseteq S\}} has the FIP; this family is called the principal filter on X {\textstyle X} generated by K {\textstyle K}. The subset B = { I ⊆ R : K ⊆ I and I an open interval } {\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 K {\textstyle K}. If K {\textstyle K} is an open interval, then the set K {\textstyle K} is in fact equal to the kernels of A {\textstyle {\mathcal {A}}} or B {\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 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

A π–system is a family of sets that is closed under finite intersections of one or more of its sets. For a family of sets ⁠A {\displaystyle {\mathcal {A}}}⁠, the family of sets π ( A ) = { A 1 ∩ ⋯ ∩ A n : 1 ≤ n < ∞ and A 1 , … , A n ∈ A } , {\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\},}which is all finite intersections of one or more sets from A {\displaystyle {\mathcal {A}}}, is called the π–system generated by A {\textstyle {\mathcal {A}}}, because it is the smallest π–system having A {\textstyle {\mathcal {A}}} as a subset.

The upward closure of π ( A ) {\displaystyle \pi ({\mathcal {A}})} in X {\textstyle X} is the set π ( A ) ↑ X = { S ⊆ X : P ⊆ S for some P ∈ π ( A ) } . {\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 A {\textstyle {\mathcal {A}}}, the finite intersection property is equivalent to any of the following:

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

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.

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. Note that a subset of a topological space is perfect if it is closed and has the property that no one-point subset is open.

Theorem—Let X {\displaystyle X} be a non-empty, perfect, compact Hausdorff space. Then X {\displaystyle X} is uncountable.

Examples of failures:

The theorem can fail without the Hausdorff condition; a countable set with at least two points and with the indiscrete topology is perfect and compact, but is not uncountable.
The theorem can fail without the compactness condition, as the set of rational numbers shows.
The theorem can fail without the perfect condition, as any finite space with the discrete topology shows.

For a proof by contradiction, suppose there exists a surjection, ⁠f : N → X {\displaystyle f:\mathbb {N} \to X}⁠, where N = { 1 , 2 , 3 , … } {\displaystyle \mathbb {N} =\{1,2,3,\ldots \}} is the set of natural numbers. Let ⁠U 0 = X {\displaystyle U_{0}=X}⁠. The set U 0 {\displaystyle U_{0}} is non-empty and open. In the general step for ⁠i ∈ N {\displaystyle i\in \mathbb {N} }⁠, we will choose a non-empty, open set U i ⊆ U i − 1 {\displaystyle U_{i}\subseteq U_{i-1}} whose closure does not contain ⁠f ( i ) {\displaystyle f(i)}⁠. We note that U i − 1 {\displaystyle U_{i-1}} contains at least two points because it is non-empty and open, and X {\displaystyle X} is perfect. Choose a point y {\displaystyle y} from U i − 1 {\displaystyle U_{i-1}} that is different from ⁠f ( i ) {\displaystyle f(i)}⁠. By the Hausdorff condition, choose disjoint open sets V {\displaystyle V} and W {\displaystyle W} that contain y {\displaystyle y} and ⁠f ( i ) {\displaystyle f(i)}⁠, respectively. Then U i = U i − 1 ∩ V {\displaystyle U_{i}=U_{i-1}\cap V} satisfies the desired requirements.

The collection { U i : i ∈ N } {\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 ⁠X {\displaystyle X}⁠. Let x {\displaystyle x} be a point in this intersection. For any ⁠i ∈ N {\displaystyle i\in \mathbb {N} }⁠, it cannot be the case that x = f ( i ) {\displaystyle x=f(i)} because f ( i ) {\displaystyle f(i)} does not belong to the closure of U i {\displaystyle U_{i}} but x {\displaystyle x} does. That is, we have shown that f {\displaystyle f} is not a surjection; a contradiction. It must be that X {\displaystyle X} is uncountable.

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

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

If X {\displaystyle X} is also compact then the theorem immediately implies that X {\displaystyle X} is uncountable. If X {\displaystyle X} is not compact then the one-point compactification of X {\displaystyle X} is a perfect, compact Hausdorff space, and hence uncountable by the theorem. Since removing a single point from an uncountable set still leaves an uncountable set, X {\displaystyle X} is uncountable as well.

Ultrafilters

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

External links

. PlanetMath.

Families F {\displaystyle {\mathcal {F}}} of sets over Ω {\displaystyle \Omega } vte
Is necessarily true of F : {\displaystyle {\mathcal {F}}\colon } or, is F {\displaystyle {\mathcal {F}}} closed under:	Directed by ⊇ {\displaystyle \,\supseteq }	A ∩ B {\displaystyle A\cap B}	A ∪ B {\displaystyle A\cup B}	B ∖ A {\displaystyle B\setminus A}	Ω ∖ A {\displaystyle \Omega \setminus A}	A 1 ∩ A 2 ∩ ⋯ {\displaystyle A_{1}\cap A_{2}\cap \cdots }	A 1 ∪ A 2 ∪ ⋯ {\displaystyle A_{1}\cup A_{2}\cup \cdots }	Ω ∈ F {\displaystyle \Omega \in {\mathcal {F}}}	∅ ∈ F {\displaystyle \varnothing \in {\mathcal {F}}}	F.I.P.
π-system
Semiring										Never
Semialgebra (semifield)										Never
Monotone class						only if A i ↘ {\displaystyle A_{i}\searrow }	only if A i ↗ {\displaystyle A_{i}\nearrow }
𝜆-system (Dynkin system)				only if A ⊆ B {\displaystyle A\subseteq B}			only if A i ↗ {\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
Filter
Proper filter				Never	Never				Never
Prefilter (filter base)
Filter subbase
Open topology							(even arbitrary ∪ {\displaystyle \cup })			Never
Closed topology						(even arbitrary ∩ {\displaystyle \cap })				Never
Is necessarily true of F : {\displaystyle {\mathcal {F}}\colon } or, is F {\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 B ∖ A {\displaystyle B\setminus A} is equal to a finite disjoint union of sets in F . {\displaystyle {\mathcal {F}}.} A *semialgebra* is a semiring where every complement Ω ∖ A {\displaystyle \Omega \setminus A} is equal to a finite disjoint union of sets in F . {\displaystyle {\mathcal {F}}.} A , B , A 1 , A 2 , … {\displaystyle A,B,A_{1},A_{2},\ldots } are arbitrary elements of F {\displaystyle {\mathcal {F}}} and it is assumed that F ≠ ∅ . {\displaystyle {\mathcal {F}}\neq \varnothing .}