## Second Project: Introduction

April 8, 2011 at 12:42 | Posted in Uncategorized | Leave a comment
One of the goals I set for myself is to use this blog to work through some of the “cov vs. pp” material in Shelah’s oeuvre, so I want next to take a look at the so-called “cov vs. pp theorem”: Theorem 5.4 on page 87 of *Cardinal Arithmetic*. This proof seems to date from the era before the discovery of pcf generators, so the theorem cries out for a new proof. The argument form Lemma 3.5 on page 381 of *Cardinal Arithmetic* looks like it might do the job, so that’s what my second project will be — I will attempt to give a reasonable proof of the following:

Theorem 1Suppose where and are regular. Then

There’s a lot of notation packed into the statement of this theorem, so we’ll use the rest of this post to define everything. Roughly, the theorem pins down how cardinals determined by pcf theory correspond to some natural measures of the powerset of a singular cardinal . This connection is well-known in the case where is not a fixed point; the above theorem holds even if is a fixed point, but at the cost of assuming the cofinality of is uncountable.

Definition 2Let , , and be as above.

- is the minimum cardinality of a set such that any element of can be covered by a union of fewer than sets from .
- is defined to be the supremum of all cardinals for which there is a cardinal , a -complete ideal on , and a sequence of regular cardinals below such that

- for each , and
- Notice that the pp number is the supremum of a set of cardinals, while the cov number is defined to be the cardinality of a certain collection of sets. When we say these two cardinals are , we mean that if the covering number is regular, then it is realized as the true cofinality of some product as in the definition of the pp number.

We noted earlier that the theorem assumes the singular cardinal in question has uncountable cofinality. The question of whether this hypothesis is necessary is still open; eventually, we will look at this problem in more detail.

## Leave a Comment »

Create a free website or blog at WordPress.com.

Entries and comments feeds.

## Leave a Reply