(informal) The proposition that a monkey hitting typewriter keys at random is bound to produce meaningful text (such as a work by William Shakespeare), given an infinite amount of time.

Synonym of de Moivre's formula

(graph theory) A theorem stating that the undirected graphs, partially ordered by the graph-minor relationship, form a well-quasi-ordering.

(number theory) The theorem that the number of prime numbers less than n asymptotically approaches n / ln(n) as n approaches infinity.

(algebra) A theorem which states that for each element of a given set that a given group acts on, there is a natural bijection between the orbit of that element and the cosets of the stabilizer subgroup with respect to that element.

(aerodynamics) A fundamental theorem used to calculate the lift of an airfoil and any two-dimensional bodies including circular cylinders translating in a uniform fluid at a constant speed large enough so that the flow seen in the body-fixed frame is steady and unseparated.

(game theory) A theorem that describes a necessary and sufficient condition for the non-emptiness of the core of a cooperative game in characteristic function form. The game's core is non-empty if and only if the game is balanced.

(mathematics, computing theory) A theorem stating that, when applying reduction rules to terms in the lambda calculus, the ordering in which the reductions are chosen makes no difference to the eventual result.

(linear algebra) A theorem about linear transformations (or the matrices that represent them) stating that the rank plus the nullity equals the dimension of the entire vector space (which is the linear transformation’s domain).

(mathematical logic) A theorem stating that a certain combinatorial principle in Ramsey theory, namely the strengthened finite Ramsey theorem, is true, but not provable in Peano arithmetic.