Search Results for ""

For a Galois extension field K of a field F, the fundamental theorem of Galois theory states that the subgroups of the Galois group G=Gal(K/F) correspond with the subfields ...

Any symmetric polynomial (respectively, symmetric rational function) can be expressed as a polynomial (respectively, rational function) in the elementary symmetric ...

There are two different statements, each separately known as the greatest common divisor theorem. 1. Given positive integers m and n, it is possible to choose integers x and ...

Let f(z) be an analytic function of z, regular in the half-strip S defined by a<x<b and y>0. If f(z) is bounded in S and tends to a limit l as y->infty for a certain fixed ...

Given an m×n matrix A, the fundamental theorem of linear algebra is a collection of results relating various properties of the four fundamental matrix subspaces of A. In ...

If f:[a,b]->[a,b] (where [a,b] denotes the closed interval from a to b on the real line) satisfies a Lipschitz condition with constant K, i.e., if |f(x)-f(y)|<=K|x-y| for all ...

If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...

The most general form of this theorem states that in a commutative unit ring R, the height of every proper ideal I generated by n elements is at most n. Equality is attained ...

Euler's 6n+1 theorem states that every prime of the form 6n+1, (i.e., 7, 13, 19, 31, 37, 43, 61, 67, ..., which are also the primes of the form 3n+1; OEIS A002476) can be ...

The theorem, originally conjectured by Berge (1960, 1961), that a graph is perfect iff neither the graph nor its graph complement contains an odd graph cycle of length at ...