In set theory, a Laver function (or Laver diamond, named after its inventor, Richard Laver) is a function connected with supercompact cardinals.
If ú is a supercompact cardinal, a Laver function is a function ÃÂ:ú â V<sub>ú</sub> such that for every set x and every cardinal û âÂÂ¥ |TC(x)| + ú there is a supercompact measure U on [û]<sup><ú</sup> such that if j<sub> U</sub> is the associated elementary embedding then j<sub> U</sub>(ÃÂ)(ú) = x. (Here V<sub>ú</sub> denotes the ú-th level of the cumulative hierarchy, TC(x) is the transitive closure of x)
The original application of Laver functions was the following theorem of Laver. If ú is supercompact, there is a ú-c.c. forcing notion (P, â¤) such after forcing with (P, â¤) the following holds: ú is supercompact and remains supercompact after forcing with any ú-directed closed forcing.
There are many other applications, for example the proof of the consistency of the proper forcing axiom.