Math Wiki
mNo edit summary
mNo edit summary
Line 7: Line 7:
 
#Additive [[Inverse|Inverses]] &mdash; For each <math>a \in F</math>, there exists a <math>b \in F</math>, called an additive inverse of <math>a</math>, such that <math>a + b = 0</math>;
 
#Additive [[Inverse|Inverses]] &mdash; For each <math>a \in F</math>, there exists a <math>b \in F</math>, called an additive inverse of <math>a</math>, such that <math>a + b = 0</math>;
 
#Multiplicative [[Identity]] &mdash; There exists a "one" element, <math>1 \in F</math>, different from 0, called a multiplicative identity, such that <math>1 \cdot a = a</math>, for all <math>a \in F</math>;
 
#Multiplicative [[Identity]] &mdash; There exists a "one" element, <math>1 \in F</math>, different from 0, called a multiplicative identity, such that <math>1 \cdot a = a</math>, for all <math>a \in F</math>;
#Multiplicative [[Inverse|Inverses]] &mdash; For each <math>a \in F</math>, except for 0, there exists a <math>c \in F</math>, called a multiplicative inverse of <math>a</math>, such that <math>a \cdot b = 1</math>;
+
#Multiplicative [[Inverse|Inverses]] &mdash; For each <math>a \in F</math>, except for 0, there exists a <math>c \in F</math>, called a multiplicative inverse of <math>a</math>, such that <math>a \cdot c = 1</math>;
 
#[[Distributive property]] &mdash; For all <math>a, b, c \in F</math>, <math>a \cdot \left(b + c\right) = a \cdot b + a \cdot c</math>;
 
#[[Distributive property]] &mdash; For all <math>a, b, c \in F</math>, <math>a \cdot \left(b + c\right) = a \cdot b + a \cdot c</math>;
 
#[[Closure]] of addition and multiplication &mdash; For all <math>a, b \in F</math>, <math>a + b \in G</math> and <math>a \cdot b \in G</math>.
 
#[[Closure]] of addition and multiplication &mdash; For all <math>a, b \in F</math>, <math>a + b \in G</math> and <math>a \cdot b \in G</math>.

Revision as of 05:36, 20 April 2007

A field is a set paired with two operations on the set, which are designated as addition () and multiplication (). As a group can be conceptualized as an ordered pair of a set and an operation, , a field can be conceptualized as an ordered triple .

A set with addition and multiplication, , is a field if and only if it satisfies the following properties:

  1. Commutativity of both addition and multiplication — For all , and ;
  2. Associativity of both addition and multiplication — For all , and ;
  3. Additive IdentityThere exists a "zero" element, , called an additive identity, such that , for all ;
  4. Additive Inverses — For each , there exists a , called an additive inverse of , such that ;
  5. Multiplicative Identity — There exists a "one" element, , different from 0, called a multiplicative identity, such that , for all ;
  6. Multiplicative Inverses — For each , except for 0, there exists a , called a multiplicative inverse of , such that ;
  7. Distributive property — For all , ;
  8. Closure of addition and multiplication — For all , and .

We will often abbreviate the multiplication of two elements, , by juxtaposition of the elements, . Also, when combining multiplication and addition in an expression, multiplication takes precedence over addition unless the addition is enclosed in parenthesis. That is, .

We can also denote and as additive and multiplicative inverses of any . Furthermore, we can define two more operations, called subtraction and division by , and provided that , .

Important Results

From the given criterion for a field, it can be shown that:

  • and are abelian groups (where is the set excluding 0), and therefore, group-theoretic properties can be applied to fields, such as uniqueness of identities and inverses, and cancellation properties;
  • , for all ;
  • , for all ;
  • , for all ;
  • , for all ;
  • , for all ;
  • Multiplication distributes over subtraction.

Optional Properties

A field is:

  • A subfield of a field if (see subset), where addition and multiplication on is a domain restriction on the addition and multiplication on . More commonly, we say that is an extension field of ;
  • An ordered field if there exists a total order on such that for all , if , then , (translation invariance), and if and , then .