Editing PCF theory

'''PCF theory''' is the name of a [[mathematics|mathematical]] theory, introduced by Saharon {{harvs|txt|last=Shelah|year=1978}}, that deals with the [[cofinality]] of the [[ultraproduct]]s of [[ordered set]]s. It gives strong upper bounds on the cardinalities of [[power set]]s of [[regular cardinal|singular]] [[cardinal number|cardinals]], and has many more applications as well. The abbreviation "PCF" stands for "possible [[cofinality|cofinalities]]".

== Main definitions ==
If ''A'' is an infinite set of [[regular cardinal]]s, ''D'' is an [[ultrafilter]] on ''A'', then
we let <math>\operatorname{cf}\left(\prod A/D\right)</math> denote the cofinality of the ordered set of functions
<math>\prod A</math> where the ordering is defined as follows:
<math>f<g</math> if <math>\{x\in A:f(x)<g(x)\}\in D</math>.
pcf(''A'') is the set of cofinalities that occur if we consider all ultrafilters on ''A'', that is,
<div style="text-align: center;"><math>\operatorname{pcf}(A)=\left\{\operatorname{cf}\left(\prod A/D\right):D\,\,\mbox{is an ultrafilter on}\,\,A\right\}.</math></div>

== Main results ==
Obviously, pcf(''A'') consists of regular cardinals. Considering ultrafilters concentrated on elements of ''A'', we get that
<math>A\subseteq \operatorname{pcf}(A)</math>. Shelah proved, that if <math>|A|<\min(A)</math>, then pcf(''A'') has a largest element, and there are subsets <math>\{B_\theta:\theta\in \operatorname{pcf}(A)\}</math> of ''A'' such that for each ultrafilter ''D'' on ''A'', <math>\operatorname{cf}\left(\prod A/D\right)</math> is the least element θ of pcf(''A'') such that <math>B_\theta\in D</math>. Consequently, <math>\left|\operatorname{pcf}(A)\right|\leq2^{|A|}</math>.
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''|<sup>+4</sup>.
This implies the famous inequality
<div style="text-align: center;"><math>2^{\aleph_\omega}<\aleph_{\omega_4}</math></div>
assuming that ℵ<sub>ω</sub> is [[limit cardinal|strong limit]].

If λ is an infinite cardinal, then ''J''<sub><λ</sub> is the following ideal on ''A''. ''B''∈''J''<sub><λ</sub> if <math>\operatorname{cf}\left(\prod A/D\right)<\lambda</math> holds for every ultrafilter ''D'' with ''B''∈''D''. Then ''J''<sub><λ</sub> is the ideal generated by the sets <math>\{B_\theta:\theta\in \operatorname{pcf}(A),\theta<\lambda\}</math>. There exist ''scales'', i.e., for every λ∈pcf(''A'') there is a sequence of length λ of elements of <math>\prod B_\lambda</math> which is both increasing and cofinal mod ''J''<sub><λ</sub>. This implies that the cofinality of <math>\prod A</math> under pointwise dominance is max(pcf(''A'')).
Another consequence is that if λ is singular and no regular cardinal less than λ is [[Jónsson cardinal|Jónsson]], then also λ<sup>+</sup> is not Jónsson. In particular, there is a [[Jónsson algebra]] on ℵ<sub>ω+1</sub>, 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 ℵ<sub>ω</sub> is strong limit, then the sharp bound
<div style="text-align: center;"><math>2^{\aleph_\omega}<\aleph_{\omega_1}</math></div>
holds. The analogous bound
<div style="text-align: center;"><math>2^{\aleph_{\omega_1}}<\aleph_{\omega_2}</math></div>
follows from [[Chang's conjecture]] ([[Menachem Magidor|Magidor]]) or even from the nonexistence of a [[Kurepa tree]] ([[Saharon Shelah|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 ==
* [http://at.yorku.ca/t/a/i/c/44.htm Menachem Kojman: ''PCF Theory'']
* {{Citation | last1=Shelah | first1=Saharon | author1-link=Saharon Shelah | title=Jonsson algebras in successor cardinals | doi= 10.1007/BF02760829 | doi-access= | mr=0505434 | year=1978 | journal=[[Israel Journal of Mathematics]] | volume=30 | issue=1 | pages=57–64}}
* {{Citation | last1=Shelah | first1=Saharon | author1-link=Saharon Shelah | title=Cardinal arithmetic for skeptics | arxiv=math/9201251 | mr=1112424 | year=1992 | journal=Bulletin of the American Mathematical Society |series=New Series   | volume=26 | issue=2 | pages=197–210 | doi=10.1090/s0273-0979-1992-00261-6}}

[[Category:Set theory]]