Re: is this as easy as i think? finite complement topology
- From: magidin@xxxxxxxxxxxxxxxxx (Arturo Magidin)
- Date: Fri, 9 Dec 2005 01:01:15 +0000 (UTC)
In article <dnad2m$5kp$1@xxxxxxxxxxxxxxxxxx>, Bob <Bob@xxxxxxxxxx> wrote:
>
>> So, first, if X is empty then this is easy: just pick any one U_i and
>> that will do (can you see why?)
>>
>
>no i cannot seem to see this immediately
WHAT are you trying to do? You are trying to show that there is a way
to choose a finite number of U_i so that their union contains X.
Is it REALLY that hard to find a finite number of U_i that contain the
empty set?
--
======================================================================
"It's not denial. I'm just very selective about
what I accept as reality."
--- Calvin ("Calvin and Hobbes")
======================================================================
Arturo Magidin
magidin@xxxxxxxxxxxxxxxxx
.
- Follow-Ups:
- References:
- Prev by Date: Re: collatz proof algorithm reveals e
- Next by Date: Re: problem in group theory
- Previous by thread: Re: is this as easy as i think? finite complement topology
- Next by thread: Re: is this as easy as i think? finite complement topology
- Index(es):
Relevant Pages
|