ArticleslgStudy

science

Pcf theory

Pcf theory is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Pcf theory rather than just read about it. In short: Pcf theory is the name of a mathematical theory, introduced by Saharon Shelah (1978), that deals with the cofinality of the ultraproducts of ordered sets. It gives strong upper bounds on the cardinalities of power sets of singular cardinals, among other applications.

Key takeaways

  • Pcf theory belongs to science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Pcf theory to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Pcf theory from memory before moving on to harder problems.

Reference excerpt

Pcf theory is the name of a mathematical theory, introduced by Saharon Shelah (1978), that deals with the cofinality of the ultraproducts of ordered sets. It gives strong upper bounds on the cardinalities of power sets of singular cardinals, among other applications. The abbreviation "pcf" stands for "possible cofinalities".

Main definitions If A is an infinite set of regular cardinals, D is an ultrafilter on A, then we let cf ⁡ ( ∏ A / D ) {\displaystyle \operatorname {cf} \left(\prod A/D\right)} denote the cofinality of the ordered set of functions

∏ A {\displaystyle \prod A} where the ordering is defined as follows:

f < g {\displaystyle f<g} if { x ∈ A : f ( x ) < g ( x ) } ∈ D {\displaystyle \{x\in A:f(x)<g(x)\}\in D} . pcf(A) is the set of cofinalities that occur if we consider all ultrafilters on A, that is,

Main results Obviously, pcf(A) consists of regular cardinals. Considering ultrafilters concentrated on elements of A, we get that

A ⊆ pcf ⁡ ( A ) {\displaystyle A\subseteq \operatorname {pcf} (A)} . Shelah proved, that if | A | < min ( A ) {\displaystyle |A|<\min(A)} , then pcf(A) has a largest element, and there are subsets { B θ : θ ∈ pcf ⁡ ( A ) } {\displaystyle \{B_{\theta }:\theta \in \operatorname {pcf} (A)\}} of A such that for each ultrafilter D on A, cf ⁡ ( ∏ A / D ) {\displaystyle \operatorname {cf} \left(\prod A/D\right)} is the least element θ of pcf(A) such that B θ ∈ D {\displaystyle B_{\theta }\in D} . Consequently, | pcf ⁡ ( A ) | ≤ 2 | A | {\displaystyle \left|\operatorname {pcf} (A)\right|\leq 2^{|A|}} . Shelah also proved that if A is an interval of regular cardinals (i.e., A is the set of all regular cardinals between two cardinals), then pcf(A) is also an interval of regular cardinals and |pcf(A)|<|A|+4. This implies the famous inequality

assuming that ℵω is strong limit. If λ is an infinite cardinal, then J<λ is the following ideal on A. B∈J<λ if cf ⁡ ( ∏ A / D ) < λ {\displaystyle \operatorname {cf} \left(\prod A/D\right)<\lambda } holds for every ultrafilter D with B∈D. Then J<λ is the ideal generated by the sets { B θ : θ ∈ pcf ⁡ ( A ) , θ < λ } {\displaystyle \{B_{\theta }:\theta \in \operatorname {pcf} (A),\theta <\lambda \}} . There exist scales, i.e., for every λ∈pcf(A) there is a sequence of length λ of elements of ∏ B λ {\displaystyle \prod B_{\lambda }} which is both increasing and cofinal mod J<λ. This implies that the cofinality of ∏ A {\displaystyle \prod A} under pointwise dominance is max(pcf(A)). Another consequence is that if λ is singular and no regular cardinal less than λ is Jónsson, then also λ+ is not Jónsson. In particular, there is a Jónsson algebra on ℵω+1, which settles an old conjecture.

Unsolved problems The most notorious conjecture in pcf theory states that |pcf(A)|=|A| holds for every set A of regular cardinals with |A|<min(A). This would imply that if ℵω is strong limit, then the sharp bound

holds. The analogous bound

follows from Chang's conjecture (Magidor) or even from the nonexistence of a Kurepa tree (Shelah). A weaker, still unsolved conjecture states that if |A|<min(A), then pcf(A) has no inaccessible limit point. This is equivalent to the statement that pcf(pcf(A))=pcf(A).

Applications The theory has found a great deal of applications, besides cardinal arithmetic. The original survey by Shelah, Cardinal arithmetic for skeptics, includes the following topics: almost free abelian groups, partition problems, failure of preservation of chain conditions in Boolean algebras under products, existence of Jónsson algebras, existence of entangled linear orders, equivalently narrow Boolean algebras, and the existence of nonisomorphic models equivalent in certain infinitary logics. In the meantime, many further applications have been found in Set Theory, Model Theory, Algebra and Topology.

References Saharon Shelah, Cardinal Arithmetic, Oxford Logic Guides, vol. 29. Oxford University Press, 1994.

External links Menachem Kojman: PCF Theory Archived 2004-12-04 at the Wayback Machine Shelah, Saharon (1978), "Jonsson algebras in successor cardinals", Israel Journal of Mathematics, 30 (1): 57–64, doi:10.1007/BF02760829, MR 0505434 Shelah, Saharon (1992), "Cardinal arithmetic for skeptics", Bulletin of the American Mathematical Society, New Series, 26 (2): 197–210, arXiv:math/9201251, doi:10.1090/s0273-0979-1992-00261-6, MR 1112424

Worked examples

Example 1 — a first encounter with Pcf theory

Start with the simplest possible case. Write down what Pcf theory claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Pcf theory before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Pcf theory ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Pcf theory

In research
Pcf theory appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Pcf theory in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Pcf theory is common in secondary-school and first-year university syllabi. It links to neighbouring topics Set theory, so understanding it makes those chapters shorter.
In everyday life
Look for Pcf theory outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Pcf theory in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Pcf theory means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Pcf theory out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Pcf theory in simple terms?

Pcf theory is the name of a mathematical theory, introduced by Saharon Shelah (1978), that deals with the cofinality of the ultraproducts of ordered sets. It gives strong upper bounds on the cardinalities of power sets of singular cardinals, among other applications.

Why does Pcf theory matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Pcf theory?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Pcf theory.

Tags

  • Set theory

Keep exploring