Field (mathematics)

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

Contents

Introduction

Fields are important objects of study in algebra since they provide a useful generalization of many number systems, such as the rational numbers, real numbers, and complex numbers. In particular, the usual rules of associativity, commutativity and distributivity hold. Fields also appear in many other areas of mathematics; see the examples below.

When abstract algebra was first being developed, the definition of a field usually did not include commutativity of multiplication, and what we today call a field would have been called either a commutative field or a rational domain. In contemporary usage, a field is always commutative. A structure which satisfies all the properties of a field except for commutativity, is today called a division ring or sometimes a skew field, but also non-commutative field is still widely used.

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. See field theory for more.

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).
Existence of an additive identity 
There exists an element 0 in F, such that for all a belonging to F, a + 0 = 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.
Existence of additive inverses 
For every a belonging to F, there exists an element −a in F, such that 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.

The requirement 0 ≠ 1 ensures that the set which only contains a single element is not a field. Directly from the axioms, one may show that (F, +) and (F − {0}, *) are commutative groups (abelian 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 = b−1 * a−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.

If the requirement of commutativity of the operation * is dropped, one distinguishes the above commutative fields from non-commutative fields, usually called division rings or skew fields).

Examples of fields

     +  0  1        *  0  1
      0  0  1        0  0  0
      1  1  0        1  0  1
 
This field has important uses in computer science, especially in cryptography and coding theory.

There are also proper classes with field structure, which are some times called Fields.

Some first theorems

See also

Missing image
Wikibooks.png
Wikibooks

Wikibooks Abstract algebra has more about this subject:
Fields

See also: Field (mathematics), Abelian group, Abstract algebra, Algebraic closure, Algebraic extension, Algebraic number, Algebraic number field, Algebraic structure, Algebraic variety