Gimel function

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's PCF theory.

The gimel hypothesis

The gimel hypothesis states that \gimel(\kappa)=\max(2^{\text{cf}(\kappa)},\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 generalized 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 ℵ0 ≤ κ ≤ λ then
• If μλ ≥ κ for some
• If κ λ and
• If κ λ and μλ λ then

References

• {{citation|mr=0183649
• {{citation|mr=0389593
• Thomas Jech, Set Theory, 3rd millennium ed., 2003, Springer Monographs in Mathematics, Springer, .