Loading [MathJax]/jax/output/HTML-CSS/jax.js

Wednesday, April 26, 2017

Set of subsets of naturals with inclusion order [Solution]

The goal was to find an uncountable set S such that each member of S was a subset of the naturals, and given any two elements A,BS, either AB or BA.

Solution

Consider the rationals in [0,1] which are countable, say {q1,q2,}

For each real x[0,1] let Sx={i:qix}.

S={Sx:x[0,1]} is a set with that property.

3 comments:

  1. For each natural number n and real number x in (0, 1), map (n, x) to {1,2,...,n}. The resulting sets have duplicates though.

    ReplyDelete
    Replies
    1. Yeah, the only sets you have are {1}, {1,2}, {1,2,3}, ... which is countable.

      Delete