Field (mathematics) Article Index for
Field
Limousines in
Field
Website Links For
Field
 

Information About

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 Number s.

All fields are Rings , but not conversely. Fields differ from rings most importantly in the requirement that division be possible, but also, in modern definitions, by the requirement that the multiplication operation in a field be Commutative . Otherwise the structure is a so-called ''skew field'' (better known as a Division Ring ), although historically division rings were called ''fields'' and fields were ''commutative fields''.

The prototypical example of a field is Q, the field of Rational Number s. Other important examples include the field of Real Number s '''R''', the field of Complex Number s '''C''' and, for any Prime Number ''p'', the Finite Field of Integers Modulo ''p'' , denoted '''Z'''/''p'''''Z''', F''p'' or GF(''p''). For any field ''K'', the set ''K''(''X'') of Rational Functions with coefficients in ''K'' is also a field.

The mathematical discipline concerned with the study of fields is called Field Theory .


EQUIVALENT DEFINITIONS


Definition 1

A ''field'' is a commutative Division Ring .


Definition 2

  • ) such that 0 does not equal 1 and all elements of ''F'' except 0 have a multiplicative inverse. (Note that 0 and 1 here stand for the identity elements for the + and --- operations respectively, which may differ from the familiar real numbers 0 and 1 ).



Definition 3

Explicitly, a field is defined by these properties:

  • : 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'').

  • are associative : For all ''a'', ''b'', ''c'' in ''F'', ''a'' + (''b'' + ''c'') = (''a'' + ''b'') + ''c'' and ''a'' --- (''b'' --- ''c'') = (''a'' --- ''b'') --- ''c''.

  • are commutative : For all ''a'', ''b'' belonging to ''F'', ''a'' + ''b'' = ''b'' + ''a'' and ''a'' --- ''b'' = ''b'' --- ''a''.

  • 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''.

  • 1 = ''a''.

  • :; Existence of additive inverses : For every ''a'' belonging to ''F'', there exists an element −''a'' in ''F'', such that ''a'' + (−''a'') = 0.

  • ''a''−1 = 1.


  • ) are commutative Groups ( Abelian Group s) and that therefore (see Elementary Group Theory ) the additive inverse −''a'' and the multiplicative inverse ''a''−1 are uniquely determined by ''a''. Other useful rules include

  • ''a''

  • and more generally

  • b'') = (−''a'') --- b = ''a'' --- (−''b'')

  • as well as

  • 0 = 0,

  • all rules familiar from elementary Arithmetic .


  • is dropped, one distinguishes the above commutative fields from '''non-commutative fields'''. Fields which are not assumed to be commutative are usually called Division Ring s or ''skew fields''.



HISTORY


The concept of a field is due to Dedekind , who used the
word ''Körper'' "body" for this notion. He also was the first
to define rings (then called ''order'' or ''order-modul''),
but the term ''"a ring"'' (''Zahlring'') was invented by Hilbert . J J O'Connor and E F Robertson, ''The development of Ring Theory'' , September 2004.


EXAMPLES


  • The Complex Number s C, under the usual operations of addition and multiplication. The field of complex numbers contains the following ''subfields'' (a subfield of a field ''F'' is a set containing 0 and 1, closed under the operations + , - and --- of ''F'' and with its own operations defined by restriction):



  • The Real Number s R, under the usual operations of addition and multiplication. When the real numbers are given the usual ordering, they form a ''complete Ordered Field '' ; it is this structure which provides the foundation for most formal treatments of Calculus .

  • ---The real numbers contain several interesting subfields: the real Algebraic Number s, the Computable Number s.

  • There is ( Up To Isomorphism ) exactly one Finite Field with ''q'' elements, for every finite number ''q'' which is a power of a Prime Number , ''q''≠ 1. (No finite field can exist with any other number of elements.) This is usually denoted F''q'' . Such fields are often called Galois Field s.

  • ---In particular, for a given prime number ''p'', the set of integers modulo ''p'' is a finite field with ''p'' elements: Z/''p''Z = '''F'''''p'' = {0, 1, ..., ''p'' − 1} where the operations are defined by performing the operation in Z, dividing by ''p'' and taking the remainder; see Modular Arithmetic .

  • ---Taking ''p'' = 2, we obtain the smallest field, F2, which has only two elements: 0 and 1. It can be defined by the two Cayley Table s



  • 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 sometimes called Fields, with a capital F:


    SOME FIRST THEOREMS







    SEE ALSO




    REFERENCES



    EXTERNAL LINKS