0
$\begingroup$

Let $[\mathbb{N}]^2$ denote the set collection in size $2$. Now, let $f:[\mathbb{N}]^2\to \{1,2\}$.

How can one show that, if we fixing some $n\in \mathbb{N}$, then there exist infinite set $R_1\subseteq {\mathbb{N}-\{n\}}$ such that $f$ is constant on sets of the form $\{n,r_1 \}$ where $r\in R_1$ .

  • 0
    What is "set collection in size $2$"? If you mean the set of unordered pairs, then $\binom{\Bbb N}2$ (pronounced $\Bbb N$ choose $2$) would be a more understandable notation.2012-11-15

1 Answers 1

2

Fixing $n\in\Bbb N$, there are infinitely many $r\in\Bbb N\smallsetminus\{n\}$, and so infinitely many sets $\{n,r\}$ with $r\in\Bbb N\smallsetminus\{n\}$. Now, each $\{n,r\}$ is mapped to either $1$ or $2$. If there were only finitely many $\{n,r\}$ mapping to $1$ and only finitely many $\{n,r\}$ mapping to $2$, then since a union of two finite sets is finite, we would only have finitely many $\{n,r\}$ to begin with, which we've already seen is not the case. Hence, there are infinitely many $\{n,r\}$ mapping to $1$ or there are infinitely many $\{n,r\}$ mapping to $2$.

If there are infinitely many $r$ such that $f$ maps $\{n,r\}\mapsto 1$, then we let $R_1=\left\{r\in\Bbb N:\{n,r\}\in f^{-1}\bigl(\{1\}\bigr)\right\}.$ Otherwise, we let $R_1=\left\{r\in\Bbb N:\{n,r\}\in f^{-1}\bigl(\{2\}\bigr)\right\}.$

  • 0
    You're very welcome, @17SI.34SA. I'll add that explanation to my answer, as well.2012-11-16