## Back!

August 3, 2011 at 21:36 | Posted in Uncategorized | Leave a commentWell, I found a little time to work on the blog. The plan is to keep working through the 3rd section of the last chapter of The Book ([Sh:400] in Shelah’s nomenclature). Our last substantive postings had to do with Conclusion 3.2A, so I guess it’s time to move on to Claim 3.3. We’ll give a direct quote of the result from The Book, and then formulate what we’ll actually prove.

Proposition 1 (Claim 3.3)If then

We’ve been concentrating on arithmetic at singular cardinals, so I’m going to restrict myself to this case. I’m also going to switch some notation around to remain consistent with previous postings. Taking all this into account, we will therefore give a proof of the following:

Proposition 2Suppose is singular, andThen

Recalling what these things mean:

The left side is the minimum cardinality of a family such that every member of can be covered by a union of fewer than sets from .

The right side is the minimum cardinality of a family of functions in whose restrictions are -cofinal in any “subproduct” concentrating on sets of size less than .

For a particular instance of this result, we have for example the following:

Now the above is an equation only a mother would love, but it fits in nicely with Shelah’s project: recall that the goal of the “cov vs. pp” material is to show that much of cardinal arithmetic can be expressed in “pcf language”. The covering number is question is a bit obscure, but it certainly falls under the purview of cardinal arithmetic, while the cofinality number on the other side of the equation is certainly something defined in “pcf language”.

## Leave a Comment »

Create a free website or blog at WordPress.com.

Entries and comments feeds.

## Leave a Reply