Category: Theorems

List of theorems
This is a list of notable theorems. Lists of theorems and similar statements include: * List of fundamental theorems * List of lemmas * List of conjectures * List of inequalities * List of mathem
Gamas's Theorem
Gamas's theorem is a result in multilinear algebra which states the necessary and sufficient conditions for a tensor symmetrized by an irreducible representation of the symmetric group to be zero. It
Disquotational principle
The disquotational principle is a philosophical principle which holds that a rational speaker will accept "p" if and only if he or she believes p. The quotes indicate that the statement p is being tre
Folk theorem (game theory)
In game theory, folk theorems are a class of theorems describing an abundance of Nash equilibrium payoff profiles in repeated games. The original Folk Theorem concerned the payoffs of all the Nash equ
Penrose–Lucas argument
The Penrose–Lucas argument is a logical argument partially based on a theory developed by mathematician and logician Kurt Gödel. In 1931, he proved that every effectively generated theory capable of p
List of incomplete proofs
This page lists notable examples of incomplete published mathematical proofs. Most of these were accepted as correct for several years but later discovered to contain gaps. There are both examples whe
In mathematics, a theorem is a statement that has been proved, or can be proved. The proof of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the
Law of squares
The law of squares is a theorem concerning transmission lines. It states that the current injected into the line by a step in voltage reaches a maximum at a time proportional to the square of the dist
Gabbay's separation theorem
In mathematical logic and computer science, Gabbay's separation theorem, named after Dov Gabbay, states that any arbitrary temporal logic formula can be rewritten in a logically equivalent "past → fut
Prigogine's theorem
No description available.
Structural holes
Structural holes is a concept from social network research, originally developed by Ronald Stuart Burt. The study of structural holes spans the fields of sociology, economics, and computer science. Bu
List of theorems called fundamental
In mathematics, a fundamental theorem is a theorem which is considered to be central and conceptually important for some topic. For example, the fundamental theorem of calculus gives the relationship
List of long mathematical proofs
This is a list of unusually long mathematical proofs. Such proofs often use computational proof methods and may be considered non-surveyable. As of 2011, the longest mathematical proof, measured by nu
In mathematics and logic, a corollary (/ˈkɒrəˌlɛri/ KORR-ə-lerr-ee, UK: /kɒˈrɒləri/ korr-OL-ər-ee) is a theorem of less importance which can be readily deduced from a previous, more notable statement.
Polar factorization theorem
In optimal transport, a branch of mathematics, polar factorization of vector fields is a basic result due to Brenier (1987), with antecedents of Knott-Smith (1984) and Rachev (1985), that generalizes
Von Neumann–Morgenstern utility theorem
In decision theory, the von Neumann–Morgenstern (VNM) utility theorem shows that, under certain axioms of rational behavior, a decision-maker faced with risky (probabilistic) outcomes of different cho
List of misnamed theorems
This is a list of misnamed theorems in mathematics. It includes theorems (and lemmas, corollaries, conjectures, laws, and perhaps even the odd object) that are well known in mathematics, but which are
Ugly duckling theorem
The ugly duckling theorem is an argument showing that classification is not really possible without some sort of bias. More particularly, it assumes finitely many properties combinable by logical conn
Double bubble theorem
In the mathematical theory of minimal surfaces, the double bubble theorem states that the shape that encloses and separates two given volumes and has the minimum possible surface area is a standard do
Purification theorem
In game theory, the purification theorem was contributed by Nobel laureate John Harsanyi in 1973. The theorem aims to justify a puzzling aspect of mixed strategy Nash equilibria: that each player is w