On 12/31/2018 5:39 AM, WM wrote:
> Let all rational numbers q_n of the interval (0, oo) be
> covered by intervals I_n of measure |I_n| = 2^−n, such
> that q_n is the centre of I:n. Then the endpoints are
> rational numbers. The irrational numbers x of the complement
> of infinite measure, not covered by the intervals I_n,
> form particles of a totally disconnected space, so-called
> "Cantor dust" C.
>
> Every particle x of C must be separated from every particle y
> of C by at least one rational number q_n and hence by at
> least one interval I_n covering q_n. Since the end points of
> the I_n are rational numbers too, also being covered by their
> own intervals, the particles of Cantor dust can only be limits
> of infinite sequences of endpoints of overlapping intervals
> I_n. (If intervals don't overlap, then a limit must lie
> between them, but in any case infinitely many endpoints are
> required to establish a limit.)
>
> Such an infinite set of overlapping intervals is called a
> cluster. In principle, given a fixed and complete enumeration
> of the rationals, we can calculate every cluster and the
> limits of its union. Therefore, every irrational x of C can
> be put in bijection with the infinite set of intervals
> converging to it from the right-hand side, say. There are
> countably many sets I_n and therefore not more than countably
> many disjoint clusters with limits and therefore not more
> limits. Where are the other irrational numbers of the
> complement?
I'm trying to clean up your description in order to make sense
of what you are saying. Here goes:
We have a list q_n of all of the rationals in (0,oo).
We have a list of intervals I_n (which I'll say are open
intervals) of measure |I_n| = 2^-n, centered on q_n.
As you point out, the endpoints of each interval I_n are
in the interior of some other intervals.
Instead of talking about clusters, I will partition the
intervals I_n, so that all the intervals in a given
partition overlap (in a certain sense), and do not overlap
with other partitions.
Define
I_k overlap I_m
if and only if
there are points x in I_k and y in I_m such that
every point z between x and y is in some interval I_j
(that is, z is in UNION{ I_n | n e N })
The relation I_k overlap I_m is reflexive, symmetric, and
transitive, so there is some collection of sets of
intervals I_n with each interval in exactly one set
(that is, a partition of { I_n | n e N }), with the _union_
of each set of intervals being s single open interval.
By construction, for each such union, every point is in
its interior (it's open) and there are no gaps (it's
an interval).
Let [ I_n ] be the set of all intervals that overlap I_n,
in the sense I used above.
For all n, there are some a_n, b_n such that
UNION[ I_n ] = (a_n,b_n)
There are no more than countably many of these
union-of-partition intervals. We can index each one, for
example, with the index of the first I_n in a given partition.
I _think_ that what you're calling a cluster is one of
the partitions [ I_n ] of intervals, and that the limits
you are focusing on are the endpoints of the union of
a partition a_n and b_n.
Because of how we constructed the intervals I_n, we know
that a_n and b_n must be irrational. And there are no more
than countably many a_n and b_n.
However, those endpoints _are not_ the only points in
the complement C of the union of intervals I_n. The
argument you make that they _are_ the only points has really
been unchanged through this whole discussion, just given
a new coat of paint and sent out again. And again, and again.
You depend upon there being some partition of intervals
_right next_ to every point in the complement C. And it
it the (alleged) right-next-to partition that (allegedly)
gives you your bijection and so the countability of the
the reals (allegedly).
That would be fine if these partitions of intervals
(probably your "clusters") were only finitely many.
Then you would have a well-order, and everything would
work out nicely. *However* there are infinitely many
of these partitions of intervals I_n. So, there would
usually be no "right-next-to" partition of intervals.
Just as earlier there would be no "right-next-to" I_n, and
just as, before that, there would be no "right-next-to" q_n.
What you call "simple logic" is just recycling the same
old intuition about _finite_ sets that you started with.
----
The argument for missing most of the real numbers
doesn't change either. It's a variation on Cantor's
nested intervals.
We list all of the q_n or all of the I_n or all of
the UNION[ I_n ] = ( a_n, b_n ). We sort them out, all of them
either on one side of ...somewhere... or the other side --
and, by Dedekind completeness, by _what we mean by continuum_ ,
there must be something in the somewhere between the one side
and the other. These between-points are the unaccounted-for
real numbers.