# Countability problem

• October 21st 2012, 01:46 AM
wesleybrown
Countability problem

Let T be a nonempty subset of (−1, 0)union(0, 1).
If every finite subset {x1, x2, . . . ,xn} of T (with no two of x1, x2, . . . ,xn equal) has the property that x1^2+x2^2+· · ·+xn^2 < 1, then prove that T is a countable set.
(Hint: For every positive integer k, is the set T_k = {x : x belongs to T and |x| belongs to [1/(k+1),1/k)} a finite set? What is the union of [1/(k+1), 1/k) for k = 1, 2, 3, . . ..)
• October 21st 2012, 01:53 AM
girdav
Re: Countability problem
I guess you tried to use the hint: where are you stuck?
• October 21st 2012, 02:02 AM
wesleybrown
Re: Countability problem
In fact, I'm ok with the hint part. But I can't figure out how to prove T_k as a finite set.
• October 21st 2012, 02:07 AM
girdav
Re: Countability problem
If $x\in T$, then $|x|\in (0,1)$ so $|x|\in ((k+1)^{-1},k^{-1})$ for some $k$. This gives that $x\in T_k$. Conversely, if $x$ is in a $T_k$, it's in $T$.
• October 21st 2012, 02:15 AM
wesleybrown
Re: Countability problem
First, really thanks for your kindness help.
What I need is the part that utilize #x1^2+x2^2+· · ·+xn^2 < 1# to prove T_k is finite set, I just can't link them up.
• October 21st 2012, 02:21 AM
girdav
Re: Countability problem
What if there were infinitely many elements in $T_k$ (for example, more than $k+2$)?
• October 21st 2012, 02:37 AM
wesleybrown
Re: Countability problem
Since |x| greater than or equal to 1/(k+1), there is at most (k+1)^2 elements, otherwise it'll contradict the inequality.
Is it correct?
• October 21st 2012, 02:40 AM
girdav
Re: Countability problem
Yes.
• October 21st 2012, 02:49 AM
wesleybrown
Re: Countability problem
Haha, solved. That's great. Nice to meet you, thank you very much!