<<Up     Contents

Field

Redirected from FielDs

In physics, a field is an assignment of a quantity to every point in space. We distinguish between scalar fields (such as the temperature at any given point) and vector fields (such as the electric or magnetic force at any given point).


A field, in abstract algebra, is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except division by zero) may be performed and the associative, commutative, and distributive rules hold, which are familiar from the arithmetic of ordinary numbers.

Fields are important objects of study in algebra since they provide the proper generalization of number domains, such as the sets of rational numbers, real numbers, or complex numbers. Fields used to be called rational domains.

The concept of a field is of use, for example, in defining vectors and matrices, two structures in linear algebra whose components can be elements of an arbitrary field. Galois theory studies the symmetry of equations by investigating the ways in which fields can be contained in each other.

Definition: A field is a commutative ring (F, +, *) such that 0 does not equal 1 and all elements of F except 0 have a multiplicative inverse.

Spelled out, this means that the following hold:

Closure of F under + and *
For all a,b belonging to F, both a + b and a * b belong to F (or more formally, + and * are binary operations on F);

Both + and * are associative
For all a,b,c in F, a + (b + c) = (a + b) + c and a * (b * c) = (a * b) * c.

Both + and * are commutative
For all a,b belonging to F, a + b = b + a and a * b = b * a.

The operation * is distributive over the operation +
For all a,b,c, belonging to F, a * (b + c) = (a * b) + (a * c) and (b + c) * a = (b * a) + (c * a).

Existence of an additive identity
There exists an element 0 in F, such that for all a belonging to F, a + 0 = a and 0 + a= a .

Existence of a multiplicative identity
There exists an element 1 in F different from 0, such that for all a belonging to F, a * 1 = a and 1 * a = a.

Existence of additive inverses
For every a belonging to F, there exists an element -a in F, such that a + (-a) = 0 and (-a) + a = 0.

Existence of multiplicative inverses
For every a ≠ 0 belonging to F, there exists an element a-1 in F, such that a * a-1 = 1 and a-1 * a = 1.

The requirement 0 ≠ 1 ensures that the set which only contains a single zero is not a field. Directly from the axioms, one may show that (F, +) and (F - {0}, *) are commutative groups and that therefore (see elementary group theory) the additive inverse -a and the multiplicative inverse a-1 are uniquely determined by a. Furthermore, the multiplicative inverse of a product is equal to the product of the inverses:

(a*b)-1 = a-1 * b-1
provided both a and b are non-zero. Other useful rules include
-a = (-1) * a
and more generally
-(a * b) = (-a) * b = a * (-b)
as well as
a * 0 = 0,
all rules familiar from elementary arithmetic.

Examples of Fields

      +  0  1        *  0  1
      0  0  1        0  0  0
      1  1  0        1  0  1

It has important uses in computer science, especially in cryptography and coding theory[?].

Further properties, definitions and facts

A field homomorphism between two fields E and F is a function f : E -> F such that f(x + y) = f(x) + f(y) and f(xy) = f(x) f(y) for all x, y in E, as well as f(1) = 1. These properties imply that f(0) = 0, f(x-1) = f(x)-1 for x in E with x ≠ 0, and that f is injective. Fields, together with these homomorphisms, form a category. Two fields E and F are called isomorphic if there exists a bijective homomorphism f : E -> F. The two fields are then identical for all practical purposes.

A subfield of a field F is a subset of F which is closed under the field operation + and * of F and which, with these operations, forms itself a field. Such a subfield automatically has the same additive and multiplicative identities as F, and the additive and multiplicative inverses of an element of the subfield are the same as those of the same element in F. In order to check that a subset E of F is a subfield of F, one only has to check three properties:

  1. E contains a non-zero element
  2. For every x and y in E, x - y is in E
  3. For every x and y in E with y ≠ 0, x / y is in E.
For example, Q is a subfield of R, which in turn is a subfield of C.

The set of non-zero elements of a field F is typically denoted by F×; it is an abelian group under multiplication. Every finite subgroup of F× is cyclic.

For every field F, there exists a (up to isomorphism) unique field G which contains F, is algebraic over F, and is algebraically closed. G is called the algebraic closure or F.

The characteristic of the field F is the smallest positive integer n such that n·1 = 0; here n·1 stands for n summands 1 + 1 + 1 + ... + 1. If no such n exists, we say the characteristic is zero. Every non-zero characteristic is a prime number. For example, the rational numbers, the real numbers and the p-adic numbers have characteristic 0, while the finite field Zp has characteristic p.

If the characteristic of the field F is equal to the prime p, then p·x = 0 for every x in F, and (x + y) p = x p + y p for all x, y in F, a consequence of the binomial theorem. The map f(x) = x p is a field homomorphism F ->F, the "Frobenius homomorphism".

Every field has a unique smallest subfield, which is called the prime subfield and is contained in every other subfield. For fields of characteristic 0, the prime subfield is isomorphic to Q (the rationals). Fields of characteristic 0 are therefore always infinite. For fields of prime characteristic p, the prime subfield is isomorphic to Zp. Fields of prime characteristic can be either infinite or finite (see Finite field).

All the fields of importance in analysis (real numbers, complex numbers, p-adic numbers, nonstandard reals) carry a valuation[?] or an order, which turns them into topological spaces; addition, subtraction, multiplication and division are then continuous operations. All these fields have characteristic zero.

wikipedia.org dumped 2003-03-17 with terodump