huge cardinal
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, a
cardinal number In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality (size) of sets. The cardinality of a finite set is a natural number: the number of elements in the set. Th ...
κ is called huge if
there exists In predicate logic, an existential quantification is a type of quantifier, a logical constant which is interpreted as "there exists", "there is at least one", or "for some". It is usually denoted by the logical operator symbol ∃, which, wh ...
an
elementary embedding In model theory, a branch of mathematical logic, two structures ''M'' and ''N'' of the same signature ''σ'' are called elementarily equivalent if they satisfy the same first-order ''σ''-sentences. If ''N'' is a substructure of ''M'', one often ...
''j'' : ''V'' → ''M'' from ''V'' into a transitive
inner model In set theory, a branch of mathematical logic, an inner model for a theory ''T'' is a substructure of a model ''M'' of a set theory that is both a model for ''T'' and contains all the ordinals of ''M''. Definition Let L = \langle \in \rangle be ...
''M'' with critical point κ and :^M \subset M.\! Here, ''αM'' is the class of all
sequence In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is calle ...
s of length α whose elements are in M. Huge cardinals were introduced by .


Variants

In what follows, j''n'' refers to the ''n''-th iterate of the elementary embedding j, that is, j composed with itself ''n'' times, for a finite ordinal ''n''. Also, ''M'' is the class of all sequences of length less than α whose elements are in M. Notice that for the "super" versions, γ should be less than j(κ), not . κ is almost n-huge if and only if there is ''j'' : ''V'' → ''M'' with critical point κ and :^M \subset M.\! κ is super almost n-huge if and only if for every ordinal γ there is ''j'' : ''V'' → ''M'' with critical point κ, γ<j(κ), and :^M \subset M.\! κ is n-huge if and only if there is ''j'' : ''V'' → ''M'' with critical point κ and :^M \subset M.\! κ is super n-huge if and only if for every ordinal γ there is ''j'' : ''V'' → ''M'' with critical point κ, γ<j(κ), and :^M \subset M.\! Notice that 0-huge is the same as
measurable cardinal In mathematics, a measurable cardinal is a certain kind of large cardinal number. In order to define the concept, one introduces a two-valued measure on a cardinal , or more generally on any set. For a cardinal , it can be described as a subdivisio ...
; and 1-huge is the same as huge. A cardinal satisfying one of the rank into rank axioms is ''n''-huge for all finite ''n''. The existence of an almost huge cardinal implies that Vopěnka's principle is consistent; more precisely any almost huge cardinal is also a Vopěnka cardinal.


Consistency strength

The cardinals are arranged in order of increasing consistency strength as follows: *almost ''n''-huge *super almost ''n''-huge *''n''-huge *super ''n''-huge *almost ''n''+1-huge The consistency of a huge cardinal implies the consistency of a
supercompact cardinal In set theory, a supercompact cardinal is a type of large cardinal. They display a variety of reflection properties. Formal definition If ''λ'' is any ordinal, ''κ'' is ''λ''-supercompact means that there exists an elementary ...
, nevertheless, the least huge cardinal is smaller than the least supercompact cardinal (assuming both exist).


ω-huge cardinals

One can try defining an ω-huge cardinal κ as one such that an elementary embedding j : V → M from V into a transitive inner model M with critical point κ and λ''M''⊆''M'', where λ is the supremum of ''j''''n''(κ) for positive integers ''n''. However
Kunen's inconsistency theorem In set theory, a branch of mathematics, Kunen's inconsistency theorem, proved by , shows that several plausible large cardinal axioms are inconsistent with the axiom of choice. Some consequences of Kunen's theorem (or its proof) are: *There is no ...
shows that such cardinals are inconsistent in ZFC, though it is still open whether they are consistent in ZF. Instead an ω-huge cardinal κ is defined as the critical point of an elementary embedding from some rank ''V''λ+1 to itself. This is closely related to the
rank-into-rank In set theory, a branch of mathematics, a rank-into-rank embedding is a large cardinal property defined by one of the following four axioms given in order of increasing consistency strength. (A set of rank < λ is one of the elements of the set V< ...
axiom I1.


See also

*
List of large cardinal properties This page includes a list of cardinals with large cardinal properties. It is arranged roughly in order of the consistency strength of the axiom asserting the existence of cardinals with the given property. Existence of a cardinal number κ of a g ...
*The Dehornoy order on a braid group was motivated by properties of huge cardinals.


References

*. *. *{{Citation, last=Maddy, first=Penelope, authorlink=Penelope Maddy, journal=The Journal of Symbolic Logic, title=Believing the Axioms. II, year=1988, volume=53, issue=3, pages=736-764 (esp. 754-756), doi=10.2307/2274569, jstor=2274569, s2cid=16544090 , url=https://semanticscholar.org/paper/8d3d986c97fa971246dffd101c411d4e071c4155. A copy of parts I and II of this article with corrections is available at th
author's web page
Large cardinals