## Quick Finite Intersection Property Question [closed]

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

I just need a quick clarification:

Given a sequence of sets `$\{a_n\}_{n \in \mathbb{N}}$` in some field $\mathbb{K}$, is saying that it satisfies the finite intersection property equivalent to saying $(\forall n\in \mathbb{N})(\exists x\in \mathbb{K})(x \in \cap_{i=1}^n a_n)$

If the previous statement is true, then it seems almost reasonable to say that, because `$\{\cap_{i=1}^n a_n\}_{n\in\mathbb{N}}$` is a nested sequence of nonempty sets (because of the f.i.p), `$\cap_{i=1}^{\infty} a_n \neq \emptyset$`, but I know that is not necessarily true

Thanks

-

1
Think about `$A_n=\{m\in\mathbb{N}:m>n\}$`. This is really a bit too basic for MO. – Robin Chapman Jun 23 2010 at 15:51
Seconded (see also the answer below). Voting to close. – Yemon Choi Jun 23 2010 at 16:16
Closed. See wikipedia. – S. Carnahan♦ Jun 23 2010 at 16:56

1
I did look at wikipedia, I just wanted to ensure that what is stated on wikipedia is the same as the formal statement above – thedude Jun 23 2010 at 17:01
@thedude: I think everyone missed your point because the actual question was poorly emphasized. – François G. Dorais♦ Jun 23 2010 at 18:12
show 1 more comment

## 1 Answer

What you quote is the finite intersection property.

The point of confusion is in what follows. There is no reason why a nested sequence of nonempty sets can't have empty interesection. Just because we can find an $x_n\in\cap_{i=1}^n a_n$ for every $n$, there is no reason to expect that this can be done uniformly in $n$.

The intervals $[n,\infty)$ also form a nested sequence of nonempty sets with empty intersection.

-

1
But there are some reasons to expect that this can be done uniformly in $n$. Namely, when the $a_n$ are compact sets in some topological space and, in particular, when the $a_n$ are finite sets. – François G. Dorais♦ Jun 23 2010 at 16:33
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 9, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9284203052520752, "perplexity_flag": "head"}