A field is a set together with two binary operations, written as [addition] and [multiplication], such that the following axioms hold.
- For all , one has . [Associativity of addition]
- There exists an element such that for every . [Additive identity]
- For every , there exists an element such that . [Additive inverse]
- For all , one has . [Commutativity of addition]
- For all , one has . [Associativity of multiplication]
- There exists an element with such that for every . [Multiplicative identity]
- For every with , there exists an element such that . [Multiplicative inverse]
- For all , one has . [Commutativity of multiplication]
- For all , one has . [Distributive property]
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
Authors
Loading…