{
  "id": "enwiki-001352600362",
  "slug": "gimel-function",
  "title": "Gimel function",
  "qid": "",
  "lead": "In axiomatic set theory, the gimel function is the following function mapping cardinal numbers to cardinal numbers: : \\gimel\\colon\\kappa\\mapsto\\kappa^{\\mathrm{cf}(\\kappa)} where cf denotes the cofinality 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.",
  "body": "In axiomatic set theory, the gimel function is the following function mapping cardinal numbers to cardinal numbers: \\gimel\\colon\\kappa\\mapsto\\kappa^{\\mathrm{cf}(\\kappa)} where cf denotes the cofinality 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. ==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 that very little about this function can be determined in ZFC without additional axioms. 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 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, .",
  "categories": [
    "20477148",
    "23603337",
    "26220375"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1352600362",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1777948868.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001352600362",
    "type": "webpage",
    "title": "Gimel function",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/gimel-function",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001352600362",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1352600362",
    "note": "Immutable snapshot enwiki-001352600362"
  }
}