(redirected from Theorems)
Also found in: Dictionary, Thesaurus, Medical, Legal.
Related to Theorems: Sylow theorems


in mathematics and logic, statement in words or symbols that can be established by means of deductive logic; it differs from an axiomaxiom,
in mathematics and logic, general statement accepted without proof as the basis for logically deducing other statements (theorems). Examples of axioms used widely in mathematics are those related to equality (e.g.
..... Click the link for more information.
 in that a proofproof,
in mathematics, finite sequence of propositions each of which is either an axiom or follows from preceding propositions by one of the rules of logical inference (see symbolic logic).
..... Click the link for more information.
 is required for its acceptance. A lemma is a theorem that is demonstrated as an intermediate step in the proof of another, more basic theorem. A corollary is a theorem that follows as a direct consequence of another theorem or an axiom. There are many famous theorems in mathematics, often known by the name of their discoverer, e.g., the Pythagorean Theorem, concerning right triangles. One of the most famous problems of number theory was the proof of Fermat's Last Theorem (see Fermat, Pierre deFermat, Pierre de
, 1601–65, French mathematician. A magistrate whose avocation was mathematics, Fermat is known as a founder of modern number theory and probability theory.
..... Click the link for more information.
); the theorem states that for an integer n greater than 2 the equation xn+yn=zn admits no solutions where x, y, and z are also integers.



a statement, in some deductive theory, that has been or is to be proved (seeDEDUCTION). Examples of deductive theories are provided by mathematics, logic, theoretical mechanics, and some branches of physics. Every such theory consists of theorems that are proved one after another on the basis of previously proved theorems. The first statements in the deductive process are accepted without proof and thus form the logical basis of the given area of the theory. Such primitive statements are called axioms.

In the formulation of a theorem, a distinction is made between the hypothesis and the conclusion. Consider, for example, the following two theorems: (1) If the sum of the digits in a number is divisible by 3, then the number is itself divisible by 3. (2) If one of the angles in a triangle is a right angle, then the other two angles are acute. In these examples the word “if” is followed by the hypothesis of the theorem, and the word “then” is followed by the conclusion. Every theorem can be expressed in this form. For example, the theorem “Any angle inscribed in a semicircle is a right angle” can be expressed “If an angle is inscribed in a semicircle, then the angle is a right angle.”

The converse of a theorem expressed in the form “If..., then...” is obtained by interchanging the hypothesis and the conclusion. A theorem and its converse are converses of each other. In general, the validity of a theorem does not imply the validity of its converse. For example, the converse of theorem (1) is true, but the converse of theorem (2) is false. If a theorem and its converse are both true, then the hypothesis of either theorem is a necessary and sufficient condition for the validity of the conclusion (seeNECESSARY AND SUFFICIENT CONDITIONS).

If the hypothesis and conclusion of a theorem are replaced by their negations, then the inverse of the given theorem is obtained. The inverse of a theorem is equivalent to the theorem’s converse. Moreover, the converse of the inverse of a theorem is equivalent to the original theorem. Consequently, the validity of a theorem can be demonstrated by both a direct and an indirect proof. An indirect proof, also known as reductio ad absurdum, involves showing that the negation of the hypothesis of the theorem follows from the negation of the theorem’s conclusion. This method of proof is very widely used in mathematics.


A proven mathematical statement.


Maths Logic a statement or formula that can be deduced from the axioms of a formal system by means of its rules of inference
References in periodicals archive ?
In this paper, a generalization of a theorem of Hooda and Ram on [L.
Theorem 4: a - b = c - b implies a = c (cancellation on the right).
From Caratheodory theorem [psi] can be continuously extended to a function which is an one-to-one mapping from {[absolute value of z] = 1} onto C.
FitzSimons, Reduction theorems for elliptic integrands with the square root of two quadratic factors, J.
Computers are not new to the business of proving theorems.
Erduran: Fixed point theorems for monotone mappings on partial metric spaces, Fixed Point Theory Appl.
We then provide a bijective proof that is quite similar to what we have seen in the previous two theorems.
26 ( ANI ): Two researchers have reportedly claimed that they have found the proof of God's existence by using their Apple MacBook, some mathematical calculation and an early 20th century theorem.
It is easy to check that this dominant satisfies the conditions of above theorems in following particular cases and consequently, we derive the following results.
The well-known Van Aubel theorem states that if ABC is a triangle and AD, BE, CF are concurrent cevians at P, then AP/PD = AE/EC + AF/FB (see [1, p.
Yoshida, Nonoscillation theorems for a class of quasilinear differential equations of second order, J.
We shall first establish a general theorem for triangular matrices, which also applies to factorable matrices which need not be weighted mean matrices, and then we shall specialize this result to triangular matrices with row sums one.