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 remarkable cardinal is a certain kind of
large cardinal In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large" (for example, bigger than the least � ...
number. A
cardinal Cardinal or The Cardinal may refer to: Animals * Cardinal (bird) or Cardinalidae, a family of North and South American birds **''Cardinalis'', genus of cardinal in the family Cardinalidae **''Cardinalis cardinalis'', or northern cardinal, the ...
''κ'' is called remarkable if for all
regular cardinal In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that \kappa is a regular cardinal if and only if every unbounded subset C \subseteq \kappa has cardinality \kappa. Infinite ...
s ''θ'' > ''κ'', there exist ''π'', ''M'', ''λ'', ''σ'', ''N'' and ''ρ'' such that # ''π'' : ''M'' → H''θ'' is an elementary embedding # ''M'' is countable and transitive # ''π''(''λ'') = ''κ'' # ''σ'' : ''M'' → ''N'' is an elementary embedding with critical point ''λ'' # ''N'' is countable and transitive # ''ρ'' = ''M'' ∩ Ord is a
regular cardinal In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that \kappa is a regular cardinal if and only if every unbounded subset C \subseteq \kappa has cardinality \kappa. Infinite ...
in ''N'' # ''σ''(''λ'') > ''ρ'' # ''M'' = ''H''''ρ''''N'', i.e., ''M'' ∈ ''N'' and ''N'' ⊨ "''M is the set of all sets that are hereditarily smaller than ρ''" Equivalently, \kappa is remarkable if and only if for every \lambda>\kappa there is \bar\lambda<\kappa such that in some
forcing Forcing may refer to: Mathematics and science * Forcing (mathematics), a technique for obtaining independence proofs for set theory *Forcing (recursion theory), a modification of Paul Cohen's original set theoretic technique of forcing to deal with ...
extension V /math>, there is an elementary embedding j:V_^V\rightarrow V_\lambda^V satisfying j(\operatorname(j))=\kappa. Although the definition is similar to one of the definitions of
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 ...
s, the elementary embedding here only has to exist in V /math>, not in V.


See also

*
Hereditarily countable set In set theory, a set is called hereditarily countable if it is a countable set of hereditarily countable sets. This inductive definition is well-founded and can be expressed in the language of first-order set theory. A set is hereditarily count ...


References

* * Large cardinals {{settheory-stub