A Fix on the Mistake August 17, 2009
Posted by putnam120 in Uncategorized.add a comment
So here is one proof for the question from the previous post. In case you forgot I shall now restate it:
Assume that in a metric space you are given 2 closed disjoint sets
and
. Prove that if one of them is compact then
with
and
.
proof: Without loss of generality (WLOG) assume that is compact. Then define
as
. Otherwise, define it to be the infimum of the distance from the point in
to a point in the set
. Now
is continuous and thus attains its infimum. But this must be positive, because if it were not we would have contradicted the fact that the sets were disjoint and closed.
This proof works, but I would also like to find one that relies on a set being compact if any open cover has a finite subcover. Sure it might be more work than necessary, but I feel that it should be good exercise.
Sum Function on Countable Set August 9, 2009
Posted by putnam120 in Uncategorized.add a comment
Here is an interesting problem that I saw a few days ago. I don’t really know why I found this more interesting that other problems/solutions I’ve seen but it just is.
Here is the problem statement (generalized). Consider a function , and
, such that
for any sequence
. Prove that the set of points where
is not zero is countable.
Proof:
Suppose for the sake of contradiction that the set is not countable, thus uncountable. Define . It should be obvious that
. So one of the
must be uncountable. Thus if we choose points from this set (one of the uncountable sets) we can make
as large as we want. Hence we must have that the set of points wehre
is at most countable.
Not that in fact we can ‘weaken’ the assumption on so that it reads
.