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,
is remarkable if and only if for every
there is
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