Field

A field (F,+,)(F, +, ·) is a set FF with two maps +:F×FF+ : F × F → F and :F×FF· : F × F → F called addition and multiplication, such that the following conditions (field axioms) hold:

  1. (F,+)(F, +) is a commutative group, where the neutral element is denoted by 00.

    1.1 Associativity: a+(b+c)=(a+b)+ca + (b + c) = (a + b) + c

    1.2 Commutativity: a+b=b+aa + b = b + a

    1.3 Additive identity: 0F,aF:a+0=0+a=a\exists 0 \in F, \forall a \in F: a + 0 = 0 + a = a

    1.4 Additive inverses: aF,aF\forall a \in F, \exists {-a} \in F, called additive inverse of aa, such that a+(a)=0a + (-a) = 0

  2. (F\{0},)(F \backslash \{0\} , ·) is a commutative group, where the neutral element is denoted by 11.

    2.1 Associativity: a(bc)=(ab)ca ⋅ (b ⋅ c) = (a ⋅ b) ⋅ c

    2.2 Commutativity: ab=baa ⋅ b = b ⋅ a

    2.3 Multiplicative identity: 1F,aF:a1=1a=a\exists 1 \in F, \forall a \in F: a ⋅ 1 = 1 ⋅ a = a

    2.4 Multiplicative inverses: a0F,a1F\forall a \neq 0 \in F, \exists a^{-1} \in F, called multiplicative inverse of aa, such that a(a1)=1a ⋅ (a^{-1}) = 1

  3. Distributivity

    a,b,cF:a(b+c)=(ab)+(ac)\forall a, b, c \in F: a ⋅ (b + c) = (a ⋅ b) + (a ⋅ c)

This may be summarized by saying: a field has two operations, called addition and multiplication; it is an abelian group under addition with 00 as the additive identity; the nonzero elements are an abelian group under multiplication with 11 as the multiplicative identity; and multiplication distributes over addition.

Even more summarized: a field is a commutative ring where 010 \neq 1, and all nonzero elements are invertible under multiplication.

If (F,+,)(F, +, ·) is a field and FFF' ⊂ F is a subset of FF such that the restriction of addition and multiplication to FF' define a field with addition +:F×FF+ : F' × F' → F' and multiplication :F×FF· : F' × F' → F' on FF', then (F,+,)(F', +, ·) is called a subfield of (F,+,)(F, +, ·) and (F,+,)(F, +, ·) is called an extension field of (F,+,)(F', +, ·).

We call (F,+)(F, +) the additive group of the field. We use the notation F:=F\{0}F^{*} := F \backslash \{0\} for the set of all elements excluding the neutral element of addition, called (F,)(F^{*}, ·) the multiplicative group of the field.

The characteristic of a field FF, represented as char(F)char(F), is the smallest natural number n1n ≥ 1 for which the nn-fold sum of the multiplicative neutral element 11 equals zero, i.e. for which i=1n1=0\sum_{i=1}^{n}1 = 0. If such an n>0n > 0 exists, the field is said to have a finite characteristic. If, on the other hand, every finite sum of 11 is such that it is not equal to zero, then the field is defined to have characteristic 0.

Examples of fields:

  • Set of rational numbers QQ together with the usual definition of addition and multiplication. Since there is no natural number nNn ∈ N such that i=1n1=0\sum_{i=1}^{n}1 = 0 in the set of rational numbers, the characteristic of the field QQ is given by char(Q)=0char(Q) = 0.

  • The remainder class set ZpZ_pif pp is a prime numer. Moreover, since i=1p1=0\sum_{i=1}^{p}1 = 0 in ZpZ_p, we know that those fields have the finite characteristic pp. To distinguish prime fields from arbitrary modular arithmetic rings, we write (Fp,+,)(F_p, +, ·) for the ring of modular pp arithmetics and call it the prime field of characteristic pp.

Last updated