(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

I am trying to show that a family F {A[tex]\subseteq[/tex][tex]N[/tex]: A is finite} Show that F is countable.

I found a proof in a book but I don't understand it. Could you help me please?

2. Relevant equations

3. The attempt at a solution

If A is finite, then F is clearly also finite and the claim becomes trivially true. We therefore suppose that A is countable infinite.

To prove that F is countable it would be sufficient to show that the family of all finite subsets of "Naturals" is countable. For each n an element of "Naturals", let M_{n}denote the family of all subsets N of "Naturals" satisfying N[tex]\subseteq[/tex] {1,2,...,n}.

M_{n}is obviously finite.

If M is the family of all finite subsets of "Naturals", we see that it can be expressed as M= the union of all M_{n}from n=1 to infinity. From the theorem that "union of countable sets is countable" we see though that M is countable and hence see that the family F is also countable.

---

My first question is as follows. In the beginning, how do they know that if A is finite, then F is clearly also finite?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Family of subset of N is countable?

**Physics Forums | Science Articles, Homework Help, Discussion**