Easton's theorem

Easton's theorem

In set theory, Easton's theorem is a result on the possible cardinal numbers of powersets. W. B. harvtxt|Easton|1970 (extending a result of Robert M. Solovay) showed via forcing that

: kappa < operatorname{cf}(2^kappa),

and, for kappale lambda,, that

: 2^kappale 2^lambda,

are the only constraints on permissible values for 2κ when κ is a regular cardinal.

Statement of the theorem

Easton's theorem states that if "G" is a class function whose domain consists of ordinals and whose range consists of ordinals such that
# "G" is non-decreasing,
# the cofinality of aleph_{G(alpha)} is greater than aleph_{alpha} for each α in the domain of G, and
# aleph_{alpha} is regular for each α in the domain of G,

then there is a model of ZFC such that

:2^{aleph_{alpha = aleph_{G(alpha)},

for each alpha in the domain of "G".

The proof of Easton's theorem uses forcing with a proper class of forcing conditions.

All conditions in the theorem are necessary. Condition 1 is a well known property of cardinality, while condition 2 follows from König's theorem.

No extension to singular cardinals

harvtxt|Silver|1975 proved that a singular cardinal of uncountable cofinality cannot be the smallest cardinal for which the generalized continuum hypothesis fails. This shows that Easton's theorem cannot be extended to the class of all cardinals. The program of PCF theory gives results on the possible values of2^lambda for singular cardinals lambda. PCF theory shows that the values of the continuum function on singular cardinals are strongly influenced by the values on smaller cardinals, whereas Easton's theorem shows that the values of the continuum function on regular cardinals are only weakly influenced by the values on smaller cardinals.

See also

* Singular cardinal hypothesis
* König's theorem (set theory)
* Cofinality
* Aleph number
* Beth number
* Continuum hypothesis
* Continuum function

References

*citation|first= W.|last= Easton|title= Powers of regular cardinals|journal=Ann. Math. Logic|volume=1|year=1970|pages= 139–178
doi=10.1016/0003-4843(70)90012-4

*citation|id=MR|0429564|last= Silver|first= Jack |chapter=On the singular cardinals problem|title= Proceedings of the International Congress of Mathematicians (Vancouver, B. C., 1974)|volume= 1|pages= 265-268|publisher= Canad. Math. Congress|publication-place= Montreal, Que.|year= 1975


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • König's theorem (set theory) — For other uses, see König s theorem. In set theory, König s theorem (named after the Hungarian mathematician Gyula König) colloquially states that if the axiom of choice holds, I is a set, mi and ni are cardinal numbers for every i in I , and m i …   Wikipedia

  • Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… …   Wikipedia

  • List of theorems — This is a list of theorems, by Wikipedia page. See also *list of fundamental theorems *list of lemmas *list of conjectures *list of inequalities *list of mathematical proofs *list of misnamed theorems *Existence theorem *Classification of finite… …   Wikipedia

  • List of mathematics articles (E) — NOTOC E E₇ E (mathematical constant) E function E₈ lattice E₈ manifold E∞ operad E7½ E8 investigation tool Earley parser Early stopping Earnshaw s theorem Earth mover s distance East Journal on Approximations Eastern Arabic numerals Easton s… …   Wikipedia

  • Continuum hypothesis — This article is about the hypothesis in set theory. For the assumption in fluid mechanics, see Fluid mechanics. In mathematics, the continuum hypothesis (abbreviated CH) is a hypothesis, advanced by Georg Cantor in 1877[citation needed], about… …   Wikipedia

  • Forcing — En mathématiques, et plus précisément en logique mathématique, le forcing est une technique inventée par Paul Cohen pour prouver des résultats de cohérence et d indépendance en théorie des ensembles. Elle a été utilisée pour la première fois en… …   Wikipédia en Français

  • Gimel function — In axiomatic set theory, the gimel function is the following function mapping cardinal numbers to cardinal numbers::gimelcolonkappamapstokappa^{mathrm{cf}(kappa)}where cf denotes the cofinality function; the gimel function is used for studying… …   Wikipedia

  • Nice name — In mathematics, a nice name is a set theoretical concept used in forcing to impose an upper bound on the number of subsets in the generic model. It is a technical concept used in the context of forcing to prove independence results in set theory… …   Wikipedia

  • Континуум-гипотеза — В 1877 году Георг Кантор выдвинул и впоследствии безуспешно пытался доказать так называемую континуум гипотезу, которую можно сформулировать следующим образом: Любое бесконечное подмножество континуума является либо счётным, либо континуальным.… …   Википедия

  • Liste de théorèmes — par ordre alphabétique. Pour l établissement de l ordre alphabétique, il a été convenu ce qui suit : Si le nom du théorème comprend des noms de mathématiciens ou de physiciens, on se base sur le premier nom propre cité. Si le nom du théorème …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”