Search Results for ""

The most common statement known as Steiner's theorem (Casey 1893, p. 329) states that the Pascal lines of the hexagons 123456, 143652, and 163254 formed by interchanging the ...

The proposition that every proper ideal of a Boolean algebra can be extended to a maximal ideal. It is equivalent to the Boolean representation theorem, which can be proved ...

There are at least two theorems known as Weierstrass's theorem. The first states that the only hypercomplex number systems with commutative multiplication and addition are ...

The permanent of an n×n integer matrix with all entries either 0 or 1 is 0 iff the matrix contains an r×s submatrix of 0s with r+s=n+1. This result follows from the ...

The Robertson-Seymour theorem, also called the graph minor theorem, is a generalization of the Kuratowski reduction theorem by Robertson and Seymour, which states that the ...

If a function f(x) is continuous on a closed interval [a,b], then f(x) has both a maximum and a minimum on [a,b]. If f(x) has an extremum on an open interval (a,b), then the ...

Let the squares square ABCD and square AB^'C^'D^' share a common polygon vertex A. The midpoints Q and S of the segments B^'D and BD^' together with the centers of the ...

The most general form of Lagrange's group theorem, also known as Lagrange's lemma, states that for a group G, a subgroup H of G, and a subgroup K of H, (G:K)=(G:H)(H:K), ...

Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...

Given any real number theta and any positive integer N, there exist integers h and k with 0<k<=N such that |ktheta-h|<1/N. A slightly weaker form of the theorem states that ...