A near-field is a set <math>Q</math>, together with two binary operations, ' + ' (addition) and ' • ' (multiplication), satisfying the following axioms:
A2: <math>(a</math> • <math>b)</math> • <math>c</math> = <math>a</math> • <math>(b</math> • <math>c)</math> for all elements <math>a</math>, <math>b</math>, <math>c</math> of <math>Q</math> (The associative law for multiplication)
A3: <math>(a + b) </math> • <math> c = a </math> • <math>c + b </math> • <math> c</math> for all elements <math>a</math>, <math>b</math>, <math>c</math> of <math>Q</math> (The right distributive law)
A4: <math>Q</math> contains an element 1 such that <math>1 </math> • <math> a = a </math> • <math> 1 = a</math> for every element <math>a</math> of <math>Q</math> (Multiplicative identity)