Re: Request for Review/Tutorage of Amateur Proofs
- From: G. Frege <nomail@invalid>
- Date: Thu, 06 Mar 2008 05:25:08 +0100
On Wed, 5 Mar 2008 18:31:31 -0800 (PST), MoeBlee <jazzmobe@xxxxxxxxxxx>
wrote:
Nope.
I guess there's a proof of a theorem that for x, a non-empty chain of
subsets, x has a non-empty intersection as long as 0 is not in x.
Hardly.
Do you have that proof available?
Let x = {{0,1,2,3,...}, {1,2,3,...}, {2,3,4,...}, {3,4,5,...}, ...} u
{{-1,0,1,2,3,...}, {-2, -1,0,1,2,3,...}, {-3, -2, -1,0,1,2,3,...}, ...}.
Then x is a non-empty chain of subsets:
.... c= {3,4,5,...} c= {2,3,4,...} c= {1,2,3,...} c= {0,1,2,3,...} c=
{-1,0,1,2,3,...} c= {-2, -1,0,1,2,3,...} c= {-3, -2, -1,0,1,2,3,...} c=
....
0 is not in x. But the intersection of x is empty.
F.
--
E-mail: info<at>simple-line<dot>de
.
- Follow-Ups:
- Re: Request for Review/Tutorage of Amateur Proofs
- From: Scott
- Re: Request for Review/Tutorage of Amateur Proofs
- From: MoeBlee
- Re: Request for Review/Tutorage of Amateur Proofs
- References:
- Re: Request for Review/Tutorage of Amateur Proofs
- From: Scott
- Re: Request for Review/Tutorage of Amateur Proofs
- From: MoeBlee
- Re: Request for Review/Tutorage of Amateur Proofs
- From: MoeBlee
- Re: Request for Review/Tutorage of Amateur Proofs
- From: Scott
- Re: Request for Review/Tutorage of Amateur Proofs
- From: MoeBlee
- Re: Request for Review/Tutorage of Amateur Proofs
- Prev by Date: Tag
- Next by Date: Re: Largest Set in ZFC?
- Previous by thread: Re: Request for Review/Tutorage of Amateur Proofs
- Next by thread: Re: Request for Review/Tutorage of Amateur Proofs
- Index(es):