Re: Subsets of cardinals in a well-ordering
- From: Justin Palumbo <justinpa84@xxxxxxxxx>
- Date: Fri, 01 Jun 2007 16:15:49 -0700
Much thanks for the suggestion! Although for this step
Now apply the result for regular cardinals to get a subset B_n of
A(n,g(n)) such that |B_n| = aleph_n, and f|B_n is order-preserving.
f isn't a permutation on A(n,g(n)) - in fact A(n,g(n)) is a subset of
aleph_n but the image of f in that set is aleph_g(n). So it looks like
you need to prove a slightly stronger statement for the regulars
(although that's pretty easy)
Anyway very clever. What was your intuition?
.
- Follow-Ups:
- Re: Subsets of cardinals in a well-ordering
- From: Justin Palumbo
- Re: Subsets of cardinals in a well-ordering
- Prev by Date: Re: Answer "how to prove ~(P <--> Q) |- ~P <-->Q "
- Next by Date: Re: Subsets of cardinals in a well-ordering
- Previous by thread: Re: Cantor's circular "proof" that evens = integers
- Next by thread: Re: Subsets of cardinals in a well-ordering
- Index(es):
Relevant Pages
|
