## You are here

Homefinite intersection property

## Primary tabs

# finite intersection property

A collection $\mathcal{A}=\{A_{\alpha}\}_{{\alpha\in I}}$ of subsets of a set $X$ is said to have the *finite intersection property*, abbreviated f.i.p., if every finite subcollection $\{A_{1},A_{2},\ldots,A_{n}\}$ of $\mathcal{A}$ satisifes $\bigcap_{{i=1}}^{n}A_{i}\neq\emptyset$.

The finite intersection property is most often used to give the following equivalent condition for the compactness of a topological space (a proof of which may be found here):

###### Proposition.

A topological space $X$ is compact if and only if for every collection $\mathcal{C}=\{C_{\alpha}\}_{{\alpha\in J}}$ of closed subsets of $X$ having the finite intersection property, $\bigcap_{{\alpha\in J}}C_{\alpha}\neq\emptyset$.

An important special case of the preceding is that in which $\mathcal{C}$ is a countable collection of non-empty nested sets, i.e., when we have

$C_{1}\supset C_{2}\supset C_{3}\supset\cdots\text{.}$ |

In this case, $\mathcal{C}$ automatically has the finite intersection property, and if each $C_{i}$ is a closed subset of a compact topological space, then, by the proposition, $\bigcap_{{i=1}}^{\infty}C_{i}\neq\emptyset$.

The f.i.p. characterization of compactness may be used to prove a general result on the uncountability of certain compact Hausdorff spaces, and is also used in a proof of Tychonoff’s Theorem.

# References

- 1
J. Munkres,
*Topology*, 2nd ed. Prentice Hall, 1975.

## Mathematics Subject Classification

54D30*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

new question: Prove a formula is part of the Gentzen System by LadyAnne

Mar 30

new question: A problem about Euler's totient function by mbhatia

new problem: Problem: Show that phi(a^n-1), (where phi is the Euler totient function), is divisible by n for any natural number n and any natural number a >1. by mbhatia

new problem: MSC browser just displays "No articles found. Up to ." by jaimeglz

Mar 26

new correction: Misspelled name by DavidSteinsaltz

Mar 21

new correction: underline-typo by Filipe

Mar 19

new correction: cocycle pro cocyle by pahio

Mar 7

new image: plot W(t) = P(waiting time <= t) (2nd attempt) by robert_dodier

new image: expected waiting time by robert_dodier

new image: plot W(t) = P(waiting time <= t) by robert_dodier