TheoremBase

Field

Statement

A field is a set FF together with two binary operations, written as (x,y)↦x+y(x,y)\mapsto x+y [addition] and (x,y)↦x⋅y(x,y)\mapsto x\cdot y [multiplication], such that the following axioms hold.

  1. For all a,b,c∈Fa,b,c\in F, one has (a+b)+c=a+(b+c)(a+b)+c=a+(b+c). [Associativity of addition]
  2. There exists an element 0∈F0\in F such that a+0=aa+0=a for every a∈Fa\in F. [Additive identity]
  3. For every a∈Fa\in F, there exists an element −a∈F-a\in F such that a+(−a)=0a+(-a)=0. [Additive inverse]
  4. For all a,b∈Fa,b\in F, one has a+b=b+aa+b=b+a. [Commutativity of addition]
  5. For all a,b,c∈Fa,b,c\in F, one has (ab)c=a(bc)(ab)c=a(bc). [Associativity of multiplication]
  6. There exists an element 1∈F1\in F with 1≠01\neq 0 such that a1=aa1=a for every a∈Fa\in F. [Multiplicative identity]
  7. For every a∈Fa\in F with a≠0a\neq 0, there exists an element a−1∈Fa^{-1}\in F such that aa−1=1aa^{-1}=1. [Multiplicative inverse]
  8. For all a,b∈Fa,b\in F, one has ab=baab=ba. [Commutativity of multiplication]
  9. For all a,b,c∈Fa,b,c\in F, one has a(b+c)=ab+aca(b+c)=ab+ac. [Distributive property]

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…