(economics) A theorem stating that, if trade in an externality is possible and there are sufficiently low transaction costs, bargaining will lead to a Pareto efficient outcome regardless of the initial allocation of property.

plural of deduction theorem

(group theory) A theorem which proves that, given a mind swap machine that can't be used on the same pair of people more than once, it is possible to reverse any number of mind swaps by introducing two more people that did not have their minds swapped with anyone before.

(computing theory) A theorem giving a relationship between deterministic and non-deterministic space complexity.

(mathematics) A theorem used in complex analysis to establish a bound on the growth rates for an analytic function.

(geometry) A theorem stating that it is not possible to dissect a square into an odd number of triangles of equal area.

Synonym of Price equation

(set theory) A theorem that describes the largest possible families of finite sets none of which contain any other sets in the family.

(computing theory) A theorem stating that it is impossible for a distributed data store to simultaneously provide more than two of three guarantees: consistency (every read receives the most recent write or an error), availability (every request receives a non-error response, without the guarantee that it contains the most recent write), and partition tolerance (the system continues to operate despite an arbitrary number of messages being dropped or delayed between nodes).

(mathematics) A theorem in probability theory that extends some properties of algebraic operations on convergent sequences of real numbers to sequences of random variables.