HOME

TheInfoList



OR:

In
axiomatic set theory Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concern ...
, the gimel function is the following function mapping
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. ...
s to cardinal numbers: :\gimel\colon\kappa\mapsto\kappa^ where cf denotes the
cofinality In mathematics, especially in order theory, the cofinality cf(''A'') of a partially ordered set ''A'' is the least of the cardinalities of the cofinal subsets of ''A''. This definition of cofinality relies on the axiom of choice, as it uses t ...
function; the gimel function is used for studying the continuum function and the cardinal exponentiation function. The symbol \gimel is a serif form of the Hebrew letter
gimel Gimel is the third letter of the Semitic abjads, including Phoenician Gīml , Hebrew Gimel , Aramaic Gāmal , Syriac Gāmal , and Arabic (in alphabetical order; fifth in spelling order). Its sound value in the original Phoenician and in all ...
.


Values of the gimel function

The gimel function has the property \gimel(\kappa)>\kappa for all infinite cardinals \kappa by König's theorem. For regular cardinals \kappa, \gimel(\kappa)= 2^\kappa, and Easton's theorem says we don't know much about the values of this function. For singular \kappa, upper bounds for \gimel(\kappa) can be found from
Shelah Shelah may refer to: * Shelah (son of Judah), a son of Judah according to the Bible * Shelah (name), a Hebrew personal name * Shlach, the 37th weekly Torah portion (parshah) in the annual Jewish cycle of Torah reading * Salih, a prophet described ...
's PCF theory.


The gimel hypothesis

The gimel hypothesis states that \gimel(\kappa)=\max(2^,\kappa^+). In essence, this means that \gimel(\kappa) for singular \kappa is the smallest value allowed by the axioms of Zermelo–Fraenkel set theory (assuming consistency). Under this hypothesis cardinal exponentiation is simplified, though not to the extent of the continuum hypothesis (which implies the gimel hypothesis).


Reducing the exponentiation function to the gimel function

showed that all cardinal exponentiation is determined (recursively) by the gimel function as follows. *If \kappa is an infinite regular cardinal (in particular any infinite successor) then 2^\kappa = \gimel(\kappa) *If \kappa is infinite and singular and the continuum function is eventually constant below \kappa then 2^\kappa=2^ *If \kappa is a limit and the continuum function is not eventually constant below \kappa then 2^\kappa=\gimel(2^) The remaining rules hold whenever \kappa and \lambda are both infinite: *If then *If for some then *If and for all and then *If and for all and then


See also

* Aleph number * Beth number


References

* * * Thomas Jech, ''Set Theory'', 3rd millennium ed., 2003, Springer Monographs in Mathematics, Springer, {{ISBN, 3-540-44085-2. Cardinal numbers