Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Field (mathematics)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Algebraic structure with addition, multiplication, and division}} {{About|a commutative algebraic structure|the non-commutative generalization|Skew field|vector valued functions|Vector field|other uses|Field (disambiguation)#Mathematics}} {{Good article}} [[File:Regular_polygon_7_annotated.svg|thumb|262px|The [[regular polygon|regular]] [[heptagon]] cannot be constructed using only a [[straightedge and compass construction]]; this can be proven using the field of [[constructible number]]s.]] {{Algebraic structures}} In [[mathematics]], a '''field''' is a [[set (mathematics)|set]] on which [[addition]], [[subtraction]], [[multiplication]], and [[division (mathematics)|division]] are defined and behave as the corresponding operations on [[rational number|rational]] and [[real number]]s. A field is thus a fundamental [[algebraic structure]] which is widely used in [[algebra]], [[number theory]], and many other areas of mathematics. The best known fields are the field of [[rational number]]s, the field of [[real number]]s and the field of [[complex number]]s. Many other fields, such as [[field of rational functions|fields of rational functions]], [[algebraic function field]]s, [[algebraic number field]]s, and [[p-adic number|''p''-adic fields]] are commonly used and studied in mathematics, particularly in number theory and [[algebraic geometry]]. Most [[cryptographic protocol]]s rely on [[finite field]]s, i.e., fields with finitely many [[element (set)|elements]]. The theory of fields proves that [[angle trisection]] and [[squaring the circle]] cannot be done with a [[compass and straightedge]]. [[Galois theory]], devoted to understanding the symmetries of [[field extension]]s, provides an elegant proof of the [[Abel–Ruffini theorem]] that general [[quintic equation]]s cannot be [[solution in radicals|solved in radicals]]. Fields serve as foundational notions in several mathematical domains. This includes different branches of [[mathematical analysis]], which are based on fields with additional structure. Basic theorems in analysis hinge on the structural properties of the field of real numbers. Most importantly for algebraic purposes, any field may be used as the [[scalar (mathematics)|scalars]] for a [[vector space]], which is the standard general context for [[linear algebra]]. [[Number field]]s, the siblings of the field of rational numbers, are studied in depth in [[number theory]]. [[Function field of an algebraic variety|Function fields]] can help describe properties of geometric objects. == Definition == Informally, a field is a set, along with two [[binary operation|operation]]s defined on that set: an addition operation {{math|''a'' + ''b''}} and a multiplication operation {{math|''a'' ⋅ ''b''}}, both of which behave similarly as they do for [[rational number]]s and [[real number]]s. This includes the existence of an [[additive inverse]] {{math|−''a''}} for all elements {{mvar|a}} and of a [[multiplicative inverse]] {{math|''b''<sup>−1</sup>}} for every nonzero element {{mvar|b}}. This allows the definition of the so-called ''inverse operations'', subtraction {{math|''a'' − ''b''}} and division {{math|''a'' / ''b''}}, as {{math|1=''a'' − ''b'' = ''a'' + (−''b'')}} and {{math|1=''a'' / ''b'' = ''a'' ⋅ ''b''<sup>−1</sup>}}. Often the product {{math|''a'' ⋅ ''b''}} is represented by juxtaposition, as {{mvar|ab}}. === Classic definition === Formally, a field is a [[set (mathematics)|set]] {{math|''F''}} together with two [[binary operation]]s on {{mvar|F}} called ''addition'' and ''multiplication''.<ref>{{harvp|Beachy|Blair|2006|loc=Definition 4.1.1, p. 181}}</ref> A binary operation on {{mvar|F}} is a mapping {{math|''F'' × ''F'' → ''F''}}, that is, a correspondence that associates with each ordered pair of elements of {{mvar|F}} a uniquely determined element of {{mvar|F}}.<ref>{{harvp|Fraleigh|1976|p=10}}</ref><ref>{{harvp|McCoy|1968|p=16}}</ref> The result of the addition of {{math|''a''}} and {{math|''b''}} is called the sum of {{math|''a''}} and {{math|''b''}}, and is denoted {{math|''a'' + ''b''}}. Similarly, the result of the multiplication of {{math|''a''}} and {{math|''b''}} is called the product of {{math|''a''}} and {{math|''b''}}, and is denoted {{math|''a'' ⋅ ''b''}}. These operations are required to satisfy the following properties, referred to as ''[[Axiom#Non-logical axioms|field axioms]]''. These axioms are required to hold for all [[element (mathematics)|element]]s {{mvar|a}}, {{mvar|b}}, {{mvar|c}} of the field {{mvar|F}}: * [[Associativity]] of addition and multiplication: {{math|1=''a'' + (''b'' + ''c'') = (''a'' + ''b'') + ''c''}}, and {{math|1=''a'' ⋅ (''b'' ⋅ ''c'') = (''a'' ⋅ ''b'') ⋅ ''c''}}. * [[Commutativity]] of addition and multiplication: {{math|1=''a'' + ''b'' = ''b'' + ''a''}}, and {{math|1=''a'' ⋅ ''b'' = ''b'' ⋅ ''a''}}. * [[Additive identity|Additive]] and [[multiplicative identity]]: there exist two distinct elements {{math|0}} and {{math|1}} in {{math|''F''}} such that {{math|1=''a'' + 0 = ''a''}} and {{math|1=''a'' ⋅ 1 = ''a''}}. * [[Additive inverse]]s: for every {{math|''a''}} in {{math|''F''}}, there exists an element in {{math|''F''}}, denoted {{math|−''a''}}, called the ''additive inverse'' of {{math|''a''}}, such that {{math|1=''a'' + (−''a'') = 0}}. * [[Multiplicative inverse]]s: for every {{math|''a'' ≠ 0}} in {{math|''F''}}, there exists an element in {{math|''F''}}, denoted by {{math|''a''<sup>−1</sup>}} or {{math|1/''a''}}, called the ''multiplicative inverse'' of {{math|''a''}}, such that {{math|1=''a'' ⋅ ''a''<sup>−1</sup> = 1}}. * [[Distributivity]] of multiplication over addition: {{math|1=''a'' ⋅ (''b'' + ''c'') = (''a'' ⋅ ''b'') + (''a'' ⋅ ''c'')}}. An equivalent, and more succinct, definition is: a field has two commutative operations, called addition and multiplication; it is a [[group (mathematics)|group]] under addition with {{math|0}} as the additive identity; the nonzero elements form a group under multiplication with {{math|1}} as the multiplicative identity; and multiplication distributes over addition. Even more succinctly: a field is a [[commutative ring]] where {{math|0 ≠ 1}} and all nonzero elements are [[unit (ring theory)|invertible]] under multiplication. === Alternative definition === Fields can also be defined in different, but equivalent ways. One can alternatively define a field by four binary operations (addition, subtraction, multiplication, and division) and their required properties. [[Division by zero]] is, by definition, excluded.<ref>{{harvp|Clark|1984|loc=Chapter 3}}</ref> In order to avoid [[existential quantifier]]s, fields can be defined by two binary operations (addition and multiplication), two unary operations (yielding the additive and multiplicative inverses respectively), and two [[arity#Nullary|nullary]] operations (the constants {{math|0}} and {{math|1}}). These operations are then subject to the conditions above. Avoiding existential quantifiers is important in [[constructive mathematics]] and [[computing]].<ref>{{harvp|Mines|Richman|Ruitenburg|1988|loc=§II.2}}. See also [[Heyting field]].</ref> One may equivalently define a field by the same two binary operations, one unary operation (the multiplicative inverse), and two (not necessarily distinct) constants {{math|1}} and {{math|−1}}, since {{math|1=0 = 1 + (−1)}} and {{math|1=−''a'' = (−1)''a''}}.{{efn|The a priori twofold use of the symbol "{{math|−}}" for denoting one part of a constant and for the additive inverses is justified by this latter condition.}} == Examples == === Rational numbers === {{Main|Rational number}} Rational numbers have been widely used a long time before the elaboration of the concept of field. They are numbers that can be written as [[fraction (mathematics)|fractions]] {{math|''a''/''b''}}, where {{math|''a''}} and {{math|''b''}} are [[integer]]s, and {{math|''b'' ≠ 0}}. The additive inverse of such a fraction is {{math|−''a''/''b''}}, and the multiplicative inverse (provided that {{math|''a'' ≠ 0}}) is {{math|''b''/''a''}}, which can be seen as follows: : <math> \frac b a \cdot \frac a b = \frac{ba}{ab} = 1.</math> The abstractly required field axioms reduce to standard properties of rational numbers. For example, the law of distributivity can be proven as follows:<ref>{{harvp|Beachy|Blair|2006|loc=p. 120, Ch. 3}}</ref> : <math> \begin{align} & \frac a b \cdot \left(\frac c d + \frac e f \right) \\[6pt] = {} & \frac a b \cdot \left(\frac c d \cdot \frac f f + \frac e f \cdot \frac d d \right) \\[6pt] = {} & \frac{a}{b} \cdot \left(\frac{cf}{df} + \frac{ed}{fd}\right) = \frac{a}{b} \cdot \frac{cf + ed}{df} \\[6pt] = {} & \frac{a(cf + ed)}{bdf} = \frac{acf}{bdf} + \frac{aed}{bdf} = \frac{ac}{bd} + \frac{ae}{bf} \\[6pt] = {} & \frac a b \cdot \frac c d + \frac a b \cdot \frac e f. \end{align} </math> === Real and complex numbers === [[File:Complex multi.svg|thumb|255px|The multiplication of complex numbers can be visualized geometrically by rotations and scalings.]] {{main|Real number| Complex number}} The [[real number]]s {{math|'''R'''}}, with the usual operations of addition and multiplication, also form a field. The [[complex number]]s {{math|'''C'''}} consist of expressions : {{math|''a'' + ''bi'',}} with {{math|''a'', ''b''}} real, where {{math|''i''}} is the [[imaginary unit]], i.e., a (non-real) number satisfying {{math|1=''i''<sup>2</sup> = −1}}. Addition and multiplication of real numbers are defined in such a way that expressions of this type satisfy all field axioms and thus hold for {{math|'''C'''}}. For example, the distributive law enforces : {{math|1=(''a'' + ''bi'')(''c'' + ''di'') = ''ac'' + ''bci'' + ''adi'' + ''bdi''<sup>2</sup> = (''ac'' − ''bd'') + (''bc'' + ''ad'')''i''.}} It is immediate that this is again an expression of the above type, and so the complex numbers form a field. Complex numbers can be geometrically represented as points in the [[Plane (geometry)|plane]], with [[Cartesian coordinates]] given by the real numbers of their describing expression, or as the arrows from the origin to these points, specified by their length and an angle enclosed with some distinct direction. Addition then corresponds to combining the arrows to the intuitive parallelogram (adding the Cartesian coordinates), and the multiplication is – less intuitively – combining rotating and scaling of the arrows (adding the angles and multiplying the lengths). The fields of real and complex numbers are used throughout mathematics, physics, engineering, statistics, and many other scientific disciplines. === Constructible numbers === [[File:Root_construction_geometric_mean5.svg|thumb|255px|The [[geometric mean theorem]] asserts that {{math|1=''h''<sup>2</sup> = ''pq''}}. Choosing {{math|1=''q'' = 1}} allows construction of the square root of a given constructible number {{math|''p''}}.]] {{main|Constructible numbers}} In antiquity, several geometric problems concerned the (in)feasibility of constructing certain numbers with [[compass and straightedge]]. For example, it was unknown to the Greeks that it is, in general, impossible to trisect a given angle in this way. These problems can be settled using the field of [[constructible numbers]].<ref>{{harvp|Artin|1991|loc=Chapter 13.4}}</ref> Real constructible numbers are, by definition, lengths of line segments that can be constructed from the points 0 and 1 in finitely many steps using only [[Compass (drawing tool)|compass]] and [[straightedge]]. These numbers, endowed with the field operations of real numbers, restricted to the constructible numbers, form a field, which properly includes the field {{math|'''Q'''}} of rational numbers. The illustration shows the construction of [[square root]]s of constructible numbers, not necessarily contained within {{math|'''Q'''}}. Using the labeling in the illustration, construct the segments {{math|''AB''}}, {{math|''BD''}}, and a [[semicircle]] over {{math|''AD''}} (center at the [[midpoint]] {{math|''C''}}), which intersects the [[perpendicular]] line through {{math|''B''}} in a point {{math|''F''}}, at a distance of exactly <math>h=\sqrt p</math> from {{math|''B''}} when {{math|''BD''}} has length one. Not all real numbers are constructible. It can be shown that <math>\sqrt[3] 2</math> is not a constructible number, which implies that it is impossible to construct with compass and straightedge the length of the side of a [[Doubling the cube|cube with volume 2]], another problem posed by the ancient Greeks. === A field with four elements === {{main|Finite field#Field with four elements}} {|class="wikitable floatright" |+ ! scope="col" style="float:text-align:center;"| Addition ! scope="col" style="float:text-align:center'"| Multiplication |- ! scope="row" | {| class="wikitable" |- ! style="width:20%;"| + !! style="width:20%;"| {{math|''O''}} !! style="width:20%;"| {{math|''I''}} !! style="width:20%;"| {{math|''A''}} !! style="width:20%;"| {{math|''B''}} |- ! {{math|''O''}} | style="background:#fdd;"| {{color|blue| {{math|''O''}}}} | style="background:#fdd;"| {{color|blue| {{math|''I''}}}} || {{math|''A''}} || {{math|''B''}} |- ! {{math|''I''}} | style="background:#fdd;"| {{color|blue| {{math|''I''}}}} | style="background:#fdd;"| {{color|blue| {{math|''O''}}}} || {{math|''B''}} || {{math|''A''}} |- ! {{math|''A''}} || {{math|''A''}} || {{math|''B''}} || {{math|''O''}} || {{math|''I''}} |- ! {{math|''B''}} || {{math|''B''}} || {{math|''A''}} || {{math|''I''}} || {{math|''O''}} |} ! scope="row" | {| class="wikitable" |- ! style="width:20%;"| ⋅ !! style="width:20%;"| {{math|''O''}} !! style="width:20%;"| {{math|''I''}} !! style="width:20%;"| {{math|''A''}} !! style="width:20%;"| {{math|''B''}} |- ! {{math|''O''}} | style="background:#fdd;"|{{color|blue| {{math|''O''}}}} | style="background:#fdd;"|{{color|blue| {{math|''O''}}}} || {{math|''O''}} || {{math|''O''}} |- ! {{math|''I''}} | style="background:#fdd;"|{{color|blue| {{math|''O''}}}} | style="background:#fdd;"|{{color|blue| {{math|''I''}}}} || {{math|''A''}} || {{math|''B''}} |- ! {{math|''A''}} || {{math|''O''}} || {{math|''A''}} || {{math|''B''}} || {{math|''I''}} |- ! {{math|''B''}} || {{math|''O''}} || {{math|''B''}} || {{math|''I''}} || {{math|''A''}} |} |} In addition to familiar number systems such as the rationals, there are other, less immediate examples of fields. The following example is a field consisting of four elements called {{math|''O''}}, {{math|''I''}}, {{math|''A''}}, and {{math|''B''}}. The notation is chosen such that {{math|''O''}} plays the role of the additive identity element (denoted 0 in the axioms above), and {{math|''I''}} is the multiplicative identity (denoted {{math|1}} in the axioms above). The field axioms can be verified by using some more field theory, or by direct computation. For example, : {{math|1=''A'' ⋅ (''B'' + ''A'') = ''A'' ⋅ ''I'' = ''A''}}, which equals {{nowrap|1={{math|1=''A'' ⋅ ''B'' + ''A'' ⋅ ''A'' = ''I'' + ''B'' = ''A''}}}}, as required by the distributivity. This field is called a [[finite field]] or '''Galois field''' with four elements, and is denoted {{math|'''F'''<sub>4</sub>}} or {{math|GF(4)}}.<ref>{{harvp|Lidl|Niederreiter|2008|loc=Example 1.62}}</ref> The [[subset]] consisting of {{math|''O''}} and {{math|''I''}} (highlighted in red in the tables at the right) is also a field, known as the ''[[binary field]]'' {{math|'''F'''<sub>2</sub>}} or {{math|GF(2)}}. == Elementary notions == In this section, {{math|''F''}} denotes an arbitrary field and {{math|''a''}} and {{math|''b''}} are arbitrary [[element (set theory)|elements]] of {{math|''F''}}. === Consequences of the definition === One has {{math|1=''a'' ⋅ 0 = 0}} and {{math|1=−''a'' = (−1) ⋅ ''a''}}. In particular, one may deduce the additive inverse of every element as soon as one knows {{math|−1}}.<ref>{{harvp|Beachy|Blair|2006|loc=p. 120, Ch. 3}}</ref> If {{math|1=''ab'' = 0}} then {{math|1=''a''}} or {{math|''b''}} must be {{math|0}}, since, if {{math|''a'' ≠ 0}}, then {{math|1=''b'' = (''a''<sup>−1</sup>''a'')''b'' = ''a''<sup>−1</sup>(''ab'') = ''a''<sup>−1</sup> ⋅ 0 = 0}}. This means that every field is an [[integral domain]]. In addition, the following properties are true for any elements {{math|''a''}} and {{math|''b''}}: : {{math|1=−0 = 0}} : {{math|1=1<sup>−1</sup> = 1}} : {{math|1=(−(−''a'')) = ''a''}} : {{math|1=(−''a'') ⋅ ''b'' = ''a'' ⋅ (−''b'') = −(''a'' ⋅ ''b'')}} : {{math|1=(''a''<sup>−1</sup>)<sup>−1</sup> = ''a''}} if {{math|''a'' ≠ 0}} === Additive and multiplicative groups of a field === The axioms of a field {{math|''F''}} imply that it is an [[abelian group]] under addition. This group is called the [[additive group]] of the field, and is sometimes denoted by {{math|(''F'', +)}} when denoting it simply as {{math|''F''}} could be confusing. Similarly, the ''nonzero'' elements of {{math|''F''}} form an abelian group under multiplication, called the [[multiplicative group]], and denoted by <math>(F \smallsetminus \{0\}, \cdot)</math> or just <math>F \smallsetminus \{0\}</math>, or {{math|''F''<sup>×</sup>}}. A field may thus be defined as set {{math|''F''}} equipped with two operations denoted as an addition and a multiplication such that {{math|''F''}} is an abelian group under addition, <math>F \smallsetminus \{0\}</math> is an abelian group under multiplication (where 0 is the identity element of the addition), and multiplication is [[distributive property|distributive]] over addition.{{efn|Equivalently, a field is an [[algebraic structure]] {{math|⟨''F'', +, ⋅, −, <sup>−1</sup>, 0, 1⟩}} of type {{math|{{angle bracket|2, 2, 1, 1, 0, 0}}}}, such that {{math|0<sup>−1</sup>}} is not defined, {{math|{{angle bracket|''F'', +, −, 0}}}} and <math>\left\langle F \smallsetminus \{0\}, \cdot, {}^{-1}\right\rangle</math> are abelian groups, and {{math|⋅}} is distributive over {{math|+}}.<ref>{{harvp|Wallace|1998|loc=Th. 2}}</ref>}} Some elementary statements about fields can therefore be obtained by applying general facts of [[group (mathematics)|groups]]. For example, the additive and multiplicative inverses {{math|−''a''}} and {{math|''a''<sup>−1</sup>}} are uniquely determined by {{math|''a''}}. The requirement {{math|1 ≠ 0}} is imposed by convention to exclude the [[trivial ring]], which consists of a single element; this guides any choice of the axioms that define fields. Every finite [[subgroup]] of the multiplicative group of a field is [[cyclic group|cyclic]] (see ''{{slink|Root of unity|Cyclic groups}}''). === Characteristic === In addition to the multiplication of two elements of {{math|''F''}}, it is possible to define the product {{math|''n'' ⋅ ''a''}} of an arbitrary element {{math|''a''}} of {{math|''F''}} by a positive [[integer]] {{math|''n''}} to be the {{math|''n''}}-fold sum : {{math|''a'' + ''a'' + ... + ''a''}} (which is an element of {{math|''F''}}.) If there is no positive integer such that : {{math|1=''n'' ⋅ 1 = 0}}, then {{math|''F''}} is said to have [[characteristic (algebra)|characteristic]] {{math|0}}.<ref>{{harvp|Adamson|2007|loc=§I.2, p. 10}}</ref> For example, the field of rational numbers {{math|'''Q'''}} has characteristic 0 since no positive integer {{math|''n''}} is zero. Otherwise, if there ''is'' a positive integer {{math|''n''}} satisfying this equation, the smallest such positive integer can be shown to be a [[prime number]]. It is usually denoted by {{math|''p''}} and the field is said to have characteristic {{math|''p''}} then. For example, the field {{math|'''F'''<sub>4</sub>}} has characteristic {{math|2}} since (in the notation of the above addition table) {{math|1=''I'' + ''I'' = O }}. If {{math|''F''}} has characteristic {{math|''p''}}, then {{math|1=''p'' ⋅ ''a'' = 0}} for all {{math|''a''}} in {{math|''F''}}. This implies that : {{math|1=(''a'' + ''b'')<sup>''p''</sup> = {{itco|''a''}}<sup>''p''</sup> + {{itco|''b''}}<sup>''p''</sup>}}, since all other [[binomial coefficient]]s appearing in the [[binomial formula]] are divisible by {{math|''p''}}. Here, {{math|1={{itco|''a''}}<sup>''p''</sup> := ''a'' ⋅ ''a'' ⋅ ⋯ ⋅ ''a''}} ({{math|''p''}} factors) is the {{math|''p''}}th power, i.e., the {{math|''p''}}-fold product of the element {{math|''a''}}. Therefore, the [[Frobenius map]] : {{math|''F'' → ''F'' : ''x'' ↦ {{itco|''x''}}<sup>''p''</sup>}} is compatible with the addition in {{math|''F''}} (and also with the multiplication), and is therefore a field homomorphism.<ref>{{harvp|Escofier|2012|loc=14.4.2}}</ref> The existence of this homomorphism makes fields in characteristic {{math|''p''}} quite different from fields of characteristic {{math|0}}. === Subfields and prime fields<span class="anchor" id="Prime field"></span> === A ''[[field extension|subfield]]'' {{math|''E''}} of a field {{math|''F''}} is a subset of {{math|''F''}} that is a field with respect to the field operations of {{math|''F''}}. Equivalently {{math|''E''}} is a subset of {{math|''F''}} that contains {{math|1}}, and is closed under addition, multiplication, additive inverse and multiplicative inverse of a nonzero element. This means that {{math|1 ∊ ''E''}}, that for all {{math|''a'', ''b'' ∊ ''E''}} both {{math|''a'' + ''b''}} and {{math|''a'' ⋅ ''b''}} are in {{math|''E''}}, and that for all {{math|''a'' ≠ 0}} in {{math|''E''}}, both {{math|−''a''}} and {{math|1/''a''}} are in {{math|''E''}}. [[Field homomorphism]]s are maps {{math|''φ'': ''E'' → ''F''}} between two fields such that {{math|1=''φ''(''e''<sub>1</sub> + ''e''<sub>2</sub>) = ''φ''(''e''<sub>1</sub>) + ''φ''(''e''<sub>2</sub>)}}, {{math|1=''φ''(''e''<sub>1</sub>''e''<sub>2</sub>) = ''φ''(''e''<sub>1</sub>) ''φ''(''e''<sub>2</sub>)}}, and {{math|1=''φ''(1<sub>''E''</sub>) = 1<sub>''F''</sub>}}, where {{math|''e''<sub>1</sub>}} and {{math|''e''<sub>2</sub>}} are arbitrary elements of {{math|''E''}}. All field homomorphisms are [[injective]].<ref>{{harvp|Adamson|2007|loc=§I.3}}</ref> If {{math|''φ''}} is also [[surjective]], it is called an [[isomorphism]] (or the fields {{math|''E''}} and {{math|''F''}} are called isomorphic). A field is called a '''prime field''' if it has no proper (i.e., strictly smaller) subfields. Any field {{math|''F''}} contains a prime field. If the [[Characteristic (algebra)|characteristic]] of {{math|''F''}} is {{math|''p''}} (a prime number), the prime field is isomorphic to the finite field {{math|'''F'''<sub>''p''</sub>}} introduced below. Otherwise the prime field is isomorphic to {{math|'''Q'''}}.<ref>{{harvp|Adamson|2007|loc=p. 12}}</ref> == Finite fields == {{Main|Finite field}} ''Finite fields'' (also called ''Galois fields'') are fields with finitely many elements, whose number is also referred to as the order of the field. The above introductory example {{math|'''F'''<sub>4</sub>}} is a field with four elements. Its subfield {{math|'''F'''<sub>2</sub>}} is the smallest field, because by definition a field has at least two distinct elements, {{math|0}} and {{math|1}}. [[File:Clock group.svg|thumb|In modular arithmetic modulo 12, {{math|1=9 + 4 = 1}} since {{math|1=9 + 4 = 13}} in {{math|'''Z'''}}, which divided by {{math|12}} leaves remainder {{math|1}}. However, {{math|'''Z'''/12'''Z'''}} is not a field because {{math|12}} is not a prime number.]] The simplest finite fields, with prime order, are most directly accessible using [[modular arithmetic]]. For a fixed positive integer {{math|''n''}}, arithmetic "modulo {{math|''n''}}" means to work with the numbers : {{math|1='''Z'''/''n'''''Z''' = {0, 1, ..., ''n'' − 1}.}} The addition and multiplication on this set are done by performing the operation in question in the set {{math|'''Z'''}} of integers, dividing by {{math|''n''}} and taking the remainder as result. This construction yields a field precisely if {{math|''n''}} is a [[prime number]]. For example, taking the prime {{math|1=''n'' = 2}} results in the above-mentioned field {{math|'''F'''<sub>2</sub>}}. For {{math|1=''n'' = 4}} and more generally, for any [[composite number]] (i.e., any number {{math|''n''}} which can be expressed as a product {{math|1=''n'' = ''r'' ⋅ ''s''}} of two strictly smaller natural numbers), {{math|1='''Z'''/''n'''''Z'''}} is not a field: the product of two non-zero elements is zero since {{math|1=''r'' ⋅ ''s'' = 0}} in {{math|'''Z'''/''n'''''Z'''}}, which, as was explained [[#Consequences of the definition|above]], prevents {{math|'''Z'''/''n'''''Z'''}} from being a field. The field {{math|'''Z'''/''p'''''Z'''}} with {{math|''p''}} elements ({{math|''p''}} being prime) constructed in this way is usually denoted by {{math|'''F'''<sub>''p''</sub>}}. Every finite field {{math|''F''}} has {{math|1=''q'' = ''p''<sup>''n''</sup>}} elements, where {{math|1=''p''}} is prime and {{math|''n'' ≥ 1}}. This statement holds since {{math|''F''}} may be viewed as a [[vector space]] over its prime field. The [[dimension of a vector space|dimension]] of this vector space is necessarily finite, say {{math|''n''}}, which implies the asserted statement.<ref>{{harvp|Lidl|Niederreiter|2008|loc=Lemma 2.1, Theorem 2.2}}</ref> A field with {{math|1=''q'' = ''p''<sup>''n''</sup>}} elements can be constructed as the [[splitting field]] of the [[polynomial]] : {{math|1={{itco|''f''}}(''x'') = {{itco|''x''}}<sup>''q''</sup> − ''x''}}. Such a splitting field is an extension of {{math|'''F'''<sub>''p''</sub>}} in which the polynomial {{math|''f''}} has {{math|''q''}} zeros. This means {{math|''f''}} has as many zeros as possible since the [[degree of a polynomial|degree]] of {{math|''f''}} is {{math|''q''}}. For {{math|1=''q'' = 2<sup>2</sup> = 4}}, it can be checked case by case using the above multiplication table that all four elements of {{math|'''F'''<sub>4</sub>}} satisfy the equation {{math|1=''x''<sup>4</sup> = ''x''}}, so they are zeros of {{math|''f''}}. By contrast, in {{math|'''F'''<sub>2</sub>}}, {{math|''f''}} has only two zeros (namely {{math|0}} and {{math|1}}), so {{math|''f''}} does not split into linear factors in this smaller field. Elaborating further on basic field-theoretic notions, it can be shown that two finite fields with the same order are isomorphic.<ref>{{harvp|Lidl|Niederreiter|2008|loc=Theorem 1.2.5}}</ref> It is thus customary to speak of ''the'' finite field with {{math|''q''}} elements, denoted by {{math|'''F'''<sub>''q''</sub>}} or {{math|GF(''q'')}}. == History == Historically, three algebraic disciplines led to the concept of a field: the question of solving polynomial equations, [[algebraic number theory]], and [[algebraic geometry]].<ref>{{harvp|Kleiner|2007|loc=p. 63}}</ref> A first step towards the notion of a field was made in 1770 by [[Joseph-Louis Lagrange]], who observed that permuting the zeros {{math|''x''<sub>1</sub>, ''x''<sub>2</sub>, ''x''<sub>3</sub>}} of a [[cubic polynomial]] in the expression : {{math|(''x''<sub>1</sub> + ''ωx''<sub>2</sub> + ''ω''<sup>2</sup>''x''<sub>3</sub>)<sup>3</sup>}} (with {{math|''ω''}} being a third [[root of unity]]) only yields two values. This way, Lagrange conceptually explained the classical solution method of [[Scipione del Ferro]] and [[François Viète]], which proceeds by reducing a cubic equation for an unknown {{math|''x''}} to a quadratic equation for {{math|''x''<sup>3</sup>}}.<ref>{{harvp|Kiernan|1971|loc=p. 50}}</ref> Together with a similar observation for [[quartic polynomial|equations of degree 4]], Lagrange thus linked what eventually became the concept of fields and the concept of groups.<ref>{{harvp|Bourbaki|1994|loc=pp. 75–76}}</ref> [[Alexandre-Théophile Vandermonde|Vandermonde]], also in 1770, and to a fuller extent, [[Carl Friedrich Gauss]], in his ''[[Disquisitiones Arithmeticae]]'' (1801), studied the equation : {{math|1=''x''<sup> ''p''</sup> = 1}} for a prime {{math|''p''}} and, again using modern language, the resulting cyclic [[Galois group]]. Gauss deduced that a [[regular polygon|regular {{math|''p''}}-gon]] can be constructed if {{math|1=''p'' = 2<sup>2<sup>''k''</sup></sup> + 1}}. Building on Lagrange's work, [[Paolo Ruffini (mathematician)|Paolo Ruffini]] claimed (1799) that [[quintic equation]]s (polynomial equations of degree {{math|5}}) cannot be solved algebraically; however, his arguments were flawed. These gaps were filled by [[Niels Henrik Abel]] in 1824.<ref>{{harvp|Corry|2004|loc=p. 24}}</ref> [[Évariste Galois]], in 1832, devised necessary and sufficient criteria for a polynomial equation to be algebraically solvable, thus establishing in effect what is known as [[Galois theory]] today. Both Abel and Galois worked with what is today called an [[algebraic number field]], but conceived neither an explicit notion of a field, nor of a group. In 1871 [[Richard Dedekind]] introduced, for a set of real or complex numbers that is closed under the four arithmetic operations, the [[German (language)|German]] word ''Körper'', which means "body" or "corpus" (to suggest an organically closed entity). The English term "field" was introduced by {{harvp|Moore|1893}}.<ref>{{cite web| url = http://jeff560.tripod.com/f.html| title = ''Earliest Known Uses of Some of the Words of Mathematics (F)''}}</ref> {{Blockquote|text=By a field we will mean every infinite system of real or complex numbers so closed in itself and perfect that addition, subtraction, multiplication, and division of any two of these numbers again yields a number of the system. |author=Richard Dedekind, 1871<ref>{{harvp|Dirichlet|1871|loc=p. 42}}, translation by {{harvp|Kleiner|2007|loc=p. 66}}</ref>}} In 1881 [[Leopold Kronecker]] defined what he called a ''domain of rationality'', which is a field of [[rational fraction]]s in modern terms. Kronecker's notion did not cover the field of all algebraic numbers (which is a field in Dedekind's sense), but on the other hand was more abstract than Dedekind's in that it made no specific assumption on the nature of the elements of a field. Kronecker interpreted a field such as {{math|'''Q'''(π)}} abstractly as the rational function field {{math|'''Q'''(''X'')}}. Prior to this, examples of transcendental numbers were known since [[Joseph Liouville]]'s work in 1844, until [[Charles Hermite]] (1873) and [[Ferdinand von Lindemann]] (1882) proved the transcendence of {{math|''e''}} and {{math|''π''}}, respectively.<ref>{{harvp|Bourbaki|1994|loc=p. 81}}</ref> The first clear definition of an abstract field is due to {{harvp|Weber|1893}}.<ref>{{harvp|Corry|2004|loc=p. 33}}. See also {{harvp|Fricke|Weber|1924}}.</ref> In particular, [[Heinrich Martin Weber]]'s notion included the field {{math|'''F'''<sub>''p''</sub>}}. [[Giuseppe Veronese]] (1891) studied the field of formal power series, which led {{harvp|Hensel|1904}} to introduce the field of {{math|''p''}}-adic numbers. {{harvp|Steinitz|1910}} synthesized the knowledge of abstract field theory accumulated so far. He axiomatically studied the properties of fields and defined many important field-theoretic concepts. The majority of the theorems mentioned in the sections [[#Galois theory|Galois theory]], [[#Constructing fields|Constructing fields]] and [[#Elementary notions|Elementary notions]] can be found in Steinitz's work. {{harvp|Artin|Schreier|1927}} linked the notion of [[ordered field|orderings in a field]], and thus the area of analysis, to purely algebraic properties.<ref>{{harvp|Bourbaki|1994|loc=p. 92}}</ref> [[Emil Artin]] redeveloped Galois theory from 1928 through 1942, eliminating the dependency on the [[primitive element theorem]]. == Constructing fields == === Constructing fields from rings === A [[commutative ring]] is a set that is equipped with an addition and multiplication operation and satisfies all the axioms of a field, except for the existence of multiplicative inverses {{math|''a''<sup>−1</sup>}}.<ref>{{harvp|Lang|2002|loc=§II.1}}</ref> For example, the integers {{math|'''Z'''}} form a commutative ring, but not a field: the [[Multiplicative inverse|reciprocal]] of an integer {{math|''n''}} is not itself an integer, unless {{math|1=''n'' = ±1}}. In the hierarchy of algebraic structures fields can be characterized as the commutative rings {{math|''R''}} in which every nonzero element is a [[unit (ring theory)|unit]] (which means every element is invertible). Similarly, fields are the commutative rings with precisely two distinct [[Ideal (ring theory)|ideal]]s, {{math|(0)}} and {{math|''R''}}. Fields are also precisely the commutative rings in which {{math|(0)}} is the only [[prime ideal]]. Given a commutative ring {{math|''R''}}, there are two ways to construct a field related to {{math|''R''}}, i.e., two ways of modifying {{math|''R''}} such that all nonzero elements become invertible: forming the field of fractions, and forming residue fields. The field of fractions of {{math|'''Z'''}} is {{math|'''Q'''}}, the rationals, while the residue fields of {{math|'''Z'''}} are the finite fields {{math|'''F'''<sub>''p''</sub>}}. ==== Field of fractions ==== Given an [[integral domain]] {{math|''R''}}, its [[field of fractions]] {{math|''Q''(''R'')}} is built with the fractions of two elements of {{math|''R''}} exactly as '''Q''' is constructed from the integers. More precisely, the elements of {{math|''Q''(''R'')}} are the fractions {{math|''a''/''b''}} where {{math|''a''}} and {{math|''b''}} are in {{math|''R''}}, and {{math|''b'' ≠ 0}}. Two fractions {{math|''a''/''b''}} and {{math|''c''/''d''}} are equal if and only if {{math|1=''ad'' = ''bc''}}. The operation on the fractions work exactly as for rational numbers. For example, : <math>\frac{a}{b}+\frac{c}{d} = \frac{ad+bc}{bd}.</math> It is straightforward to show that, if the ring is an integral domain, the set of the fractions form a field.<ref>{{harvp|Artin|1991|loc=§10.6}}</ref> The field {{math|''F''(''x'')}} of the [[rational fraction]]s over a field (or an integral domain) {{math|''F''}} is the field of fractions of the [[polynomial ring]] {{math|''F''[''x'']}}. The field {{math|''F''((''x''))}} of [[Laurent series]] : <math>\sum_{i=k}^\infty a_i x^i \ (k \in \Z, a_i \in F)</math> over a field {{math|''F''}} is the field of fractions of the ring {{math|''F''<nowiki>[[</nowiki>''x'']]}} of [[formal power series]] (in which {{math|''k'' ≥ 0}}). Since any Laurent series is a fraction of a power series divided by a power of {{math|''x''}} (as opposed to an arbitrary power series), the representation of fractions is less important in this situation, though. ==== Residue fields ==== In addition to the field of fractions, which embeds {{math|''R''}} [[injective map|injectively]] into a field, a field can be obtained from a commutative ring {{math|''R''}} by means of a [[surjective map]] onto a field {{math|''F''}}. Any field obtained in this way is a [[quotient ring|quotient]] {{math|{{nowrap|''R'' / ''m''}}}}, where {{math|''m''}} is a [[maximal ideal]] of {{math|''R''}}. If {{math|''R''}} [[local ring|has only one maximal ideal]] {{math|''m''}}, this field is called the [[residue field]] of {{math|''R''}}.<ref>{{harvp|Eisenbud|1995|loc=p. 60}}</ref> The [[principal ideal|ideal generated by a single polynomial]] {{math|''f''}} in the polynomial ring {{math|1=''R'' = ''E''[''X'']}} (over a field {{math|''E''}}) is maximal if and only if {{math|''f''}} is [[irreducible polynomial|irreducible]] in {{math|''E''}}, i.e., if {{math|''f''}} cannot be expressed as the product of two polynomials in {{math|''E''[''X'']}} of smaller [[degree of a polynomial|degree]]. This yields a field : {{math|1=''F'' = ''E''[''X''] / ({{itco|''f''}}(''X'')).}} This field {{math|''F''}} contains an element {{math|''x''}} (namely the [[residue class]] of {{math|''X''}}) which satisfies the equation : {{math|1={{itco|''f''}}(''x'') = 0}}. For example, {{math|'''C'''}} is obtained from {{math|'''R'''}} by [[adjunction (field theory)|adjoining]] the [[imaginary unit]] symbol {{mvar|i}}, which satisfies {{math|1={{itco|''f''}}(''i'') = 0}}, where {{math|1={{itco|''f''}}(''X'') = ''X''<sup>2</sup> + 1}}. Moreover, {{math|''f''}} is irreducible over {{math|'''R'''}}, which implies that the map that sends a polynomial {{math|{{itco|''f''}}(''X'') ∊ '''R'''[''X'']}} to {{math|{{itco|''f''}}(''i'')}} yields an isomorphism : <math>\mathbf R[X]/\left(X^2 + 1\right) \ \stackrel \cong \longrightarrow \ \mathbf C.</math> === Constructing fields within a bigger field === Fields can be constructed inside a given bigger container field. Suppose given a field {{math|''E''}}, and a field {{math|''F''}} containing {{math|''E''}} as a subfield. For any element {{math|''x''}} of {{math|''F''}}, there is a smallest subfield of {{math|''F''}} containing {{math|''E''}} and {{math|''x''}}, called the subfield of ''F'' generated by {{math|''x''}} and denoted {{math|''E''(''x'')}}.<ref>{{harvp|Jacobson|2009|loc=p. 213}}</ref> The passage from {{math|''E''}} to {{math|''E''(''x'')}} is referred to by ''[[adjunction (field theory)|adjoining]] an element'' to {{math|''E''}}. More generally, for a subset {{math|''S'' ⊂ ''F''}}, there is a minimal subfield of {{math|''F''}} containing {{math|''E''}} and {{math|''S''}}, denoted by {{math|''E''(''S'')}}. The [[compositum]] of two subfields {{math|''E''}} and {{math|''E''{{′}}}} of some field {{math|''F''}} is the smallest subfield of {{math|''F''}} containing both {{math|''E''}} and {{math|''E''{{′}}}}. The compositum can be used to construct the biggest subfield of {{math|''F''}} satisfying a certain property, for example the biggest subfield of {{math|''F''}}, which is, in the language introduced below, algebraic over {{math|''E''}}.{{efn|Further examples include the maximal [[unramified extension]] or the maximal [[abelian extension]] within {{math|''F''}}.}} === Field extensions === {{See|Glossary of field theory}} The notion of a subfield {{math|''E'' ⊂ ''F''}} can also be regarded from the opposite point of view, by referring to {{math|''F''}} being a ''[[field extension]]'' (or just extension) of {{math|''E''}}, denoted by : {{math|''F'' / ''E''}}, and read "{{math|''F''}} over {{math|''E''}}". A basic datum of a field extension is its [[degree of a field extension|degree]] {{math|[''F'' : ''E'']}}, i.e., the dimension of {{math|''F''}} as an {{math|''E''}}-vector space. It satisfies the formula<ref>{{harvp|Artin|1991|loc=Theorem 13.3.4}}</ref> : {{math|1=[''G'' : ''E''] = [''G'' : ''F''] [''F'' : ''E'']}}. Extensions whose degree is finite are referred to as finite extensions. The extensions {{math|'''C''' / '''R'''}} and {{math|'''F'''<sub>4</sub> / '''F'''<sub>2</sub>}} are of degree {{math|2}}, whereas {{math|'''R''' / '''Q'''}} is an infinite extension. ==== Algebraic extensions ==== A pivotal notion in the study of field extensions {{math|''F'' / ''E''}} are [[algebraic element]]s. An element {{math|''x'' ∈ ''F''}} is ''algebraic'' over {{mvar|E}} if it is a [[zero of a function|root]] of a [[polynomial]] with [[coefficient]]s in {{mvar|E}}, that is, if it satisfies a [[polynomial equation]] : {{math|1=''e''<sub>''n''</sub> ''x''<sup>''n''</sup> + ''e''<sub>''n''−1</sub>''x''<sup>''n''−1</sup> + ⋯ + ''e''<sub>1</sub>''x'' + ''e''<sub>0</sub> = 0}}, with {{math|''e''<sub>''n''</sub>, ..., ''e''<sub>0</sub>}} in {{mvar|E}}, and {{math|''e''<sub>''n''</sub> ≠ 0}}. For example, the [[imaginary unit]] {{math|''i''}} in {{math|'''C'''}} is algebraic over {{math|'''R'''}}, and even over {{math|'''Q'''}}, since it satisfies the equation : {{math|1=''i''<sup>2</sup> + 1 = 0}}. A field extension in which every element of {{math|''F''}} is algebraic over {{math|''E''}} is called an [[algebraic extension]]. Any finite extension is necessarily algebraic, as can be deduced from the above multiplicativity formula.<ref>{{harvp|Artin|1991|loc=Corollary 13.3.6}}</ref> The subfield {{math|''E''(''x'')}} generated by an element {{math|''x''}}, as above, is an algebraic extension of {{math|''E''}} if and only if {{math|''x''}} is an algebraic element. That is to say, if {{math|''x''}} is algebraic, all other elements of {{math|''E''(''x'')}} are necessarily algebraic as well. Moreover, the degree of the extension {{math|''E''(''x'') / ''E''}}, i.e., the dimension of {{math|''E''(''x'')}} as an {{math|''E''}}-vector space, equals the minimal degree {{math|''n''}} such that there is a polynomial equation involving {{math|''x''}}, as above. If this degree is {{math|''n''}}, then the elements of {{math|''E''(''x'')}} have the form : <math>\sum_{k=0}^{n-1} a_k x^k, \ \ a_k \in E.</math> For example, the field {{math|'''Q'''(''i'')}} of [[Gaussian rational]]s is the subfield of {{math|'''C'''}} consisting of all numbers of the form {{math|''a'' + ''bi''}} where both {{math|''a''}} and {{math|''b''}} are rational numbers: summands of the form {{math|''i''<sup>2</sup>}} (and similarly for higher exponents) do not have to be considered here, since {{math|''a'' + ''bi'' + ''ci''<sup>2</sup>}} can be simplified to {{math|''a'' − ''c'' + ''bi''}}. ==== Transcendence bases ==== The above-mentioned field of [[rational fraction]]s {{math|''E''(''X'')}}, where {{math|''X''}} is an [[indeterminate (variable)|indeterminate]], is not an algebraic extension of {{math|''E''}} since there is no polynomial equation with coefficients in {{math|''E''}} whose zero is {{math|''X''}}. Elements, such as {{math|''X''}}, which are not algebraic are called [[Algebraic element|transcendental]]. Informally speaking, the indeterminate {{math|''X''}} and its powers do not interact with elements of {{math|''E''}}. A similar construction can be carried out with a set of indeterminates, instead of just one. Once again, the field extension {{math|''E''(''x'') / ''E''}} discussed above is a key example: if {{math|''x''}} is not algebraic (i.e., {{math|''x''}} is not a [[root of a function|root]] of a polynomial with coefficients in {{math|''E''}}), then {{math|''E''(''x'')}} is isomorphic to {{math|''E''(''X'')}}. This isomorphism is obtained by substituting {{math|''x''}} to {{math|''X''}} in rational fractions. A subset {{math|''S''}} of a field {{math|''F''}} is a [[transcendence basis]] if it is [[algebraically independent]] (do not satisfy any polynomial relations) over {{math|''E''}} and if {{math|''F''}} is an algebraic extension of {{math|''E''(''S'')}}. Any field extension {{math|''F'' / ''E''}} has a transcendence basis.<ref>{{harvp|Bourbaki|1988|loc=Chapter V, §14, No. 2, Theorem 1}}</ref> Thus, field extensions can be split into ones of the form {{math|''E''(''S'') / ''E''}} ([[transcendental extension|purely transcendental extensions]]) and algebraic extensions. === Closure operations === A field is [[algebraically closed]] if it does not have any strictly bigger algebraic extensions or, equivalently, if any [[polynomial equation]] : {{math|1=''f''<sub>''n''</sub> ''x''<sup>''n''</sup> + ''f''<sub>''n''−1</sub>''x''<sup>''n''−1</sup> + ⋯ + ''f''<sub>1</sub>''x'' + ''f''<sub>0</sub> = 0}}, with coefficients {{math|''f''<sub>''n''</sub>, ..., ''f''<sub>0</sub> ∈ ''F'', ''n'' > 0}}, has a solution {{math|''x'' ∊ ''F''}}.<ref>{{harvp|Artin|1991|loc=§13.9}}</ref> By the [[fundamental theorem of algebra]], {{math|'''C'''}} is algebraically closed, i.e., ''any'' polynomial equation with complex coefficients has a complex solution. The rational and the real numbers are ''not'' algebraically closed since the equation : {{math|1=''x''<sup>2</sup> + 1 = 0}} does not have any rational or real solution. A field containing {{math|''F''}} is called an ''[[algebraic closure]]'' of {{math|''F''}} if it is [[algebraic extension|algebraic]] over {{math|''F''}} (roughly speaking, not too big compared to {{math|''F''}}) and is algebraically closed (big enough to contain solutions of all polynomial equations). By the above, {{math|'''C'''}} is an algebraic closure of {{math|'''R'''}}. The situation that the algebraic closure is a finite extension of the field {{math|''F''}} is quite special: by the [[Artin–Schreier theorem]], the degree of this extension is necessarily {{math|2}}, and {{math|''F''}} is [[elementarily equivalent]] to {{math|'''R'''}}. Such fields are also known as [[real closed field]]s. Any field {{math|''F''}} has an algebraic closure, which is moreover unique up to (non-unique) isomorphism. It is commonly referred to as ''the'' algebraic closure and denoted {{math|{{overline|''F''}}}}. For example, the algebraic closure {{math|{{Overline|'''Q'''}}}} of {{math|'''Q'''}} is called the field of [[algebraic number]]s. The field {{math|{{overline|''F''}}}} is usually rather implicit since its construction requires the [[ultrafilter lemma]], a set-theoretic axiom that is weaker than the [[axiom of choice]].<ref>{{harvp|Banaschewski|1992}}. [https://mathoverflow.net/questions/46566/is-the-statement-that-every-field-has-an-algebraic-closure-known-to-be-equivalent Mathoverflow post]</ref> In this regard, the algebraic closure of {{math|'''F'''<sub>''q''</sub>}}, is exceptionally simple. It is the union of the finite fields containing {{math|'''F'''<sub>''q''</sub>}} (the ones of order {{math|''q''<sup>''n''</sup>}}). For any algebraically closed field {{math|''F''}} of characteristic {{math|0}}, the algebraic closure of the field {{math|''F''((''t''))}} of [[Laurent series]] is the field of [[Puiseux series]], obtained by adjoining roots of {{math|''t''}}.<ref>{{harvp|Ribenboim|1999|loc=p. 186, §7.1}}</ref> == Fields with additional structure == Since fields are ubiquitous in mathematics and beyond, several refinements of the concept have been adapted to the needs of particular mathematical areas. === Ordered fields === {{Main|Ordered field}} A field ''F'' is called an ''ordered field'' if any two elements can be compared, so that {{math|''x'' + ''y'' ≥ 0}} and {{math|''xy'' ≥ 0}} whenever {{math|''x'' ≥ 0}} and {{math|''y'' ≥ 0}}. For example, the real numbers form an ordered field, with the usual ordering {{math|≥}}. The [[Artin–Schreier theorem]] states that a field can be ordered if and only if it is a [[formally real field]], which means that any quadratic equation : <math>x_1^2 + x_2^2 + \dots + x_n^2 = 0</math> only has the solution {{math|1=''x''<sub>1</sub> = ''x''<sub>2</sub> = ⋯ = ''x''<sub>''n''</sub> = 0}}.<ref>{{harvp|Bourbaki|1988|loc=Chapter VI, §2.3, Corollary 1}}</ref> The set of all possible orders on a fixed field {{math|''F''}} is isomorphic to the set of [[ring homomorphism]]s from the [[Witt ring (forms)|Witt ring]] {{math|W(''F'')}} of [[quadratic form]]s over {{math|''F''}}, to {{math|'''Z'''}}.<ref>{{harvp|Lorenz|2008|loc=§22, Theorem 1}}</ref> An [[Archimedean field]] is an ordered field such that for each element there exists a finite expression : {{math|1 + 1 + ⋯ + 1}} whose value is greater than that element, that is, there are no infinite elements. Equivalently, the field contains no [[infinitesimals]] (elements smaller than all rational numbers); or, yet equivalent, the field is isomorphic to a subfield of {{math|'''R'''}}. [[File:Illustration of supremum.svg|thumb|300px|Each bounded real set has a least upper bound.]] An ordered field is [[Dedekind-complete]] if all [[upper bound]]s, [[lower bound]]s (see ''[[Dedekind cut]]'') and limits, which should exist, do exist. More formally, each [[bounded set|bounded subset]] of {{math|''F''}} is required to have a least upper bound. Any complete field is necessarily Archimedean,<ref>{{harvp|Prestel|1984|loc=Proposition 1.22}}</ref> since in any non-Archimedean field there is neither a greatest infinitesimal nor a least positive rational, whence the sequence {{math|1/2, 1/3, 1/4, ...}}, every element of which is greater than every infinitesimal, has no limit. Since every proper subfield of the reals also contains such gaps, {{math|'''R'''}} is the unique complete ordered field, up to isomorphism.<ref>{{harvp|Prestel|1984|loc=Theorem 1.23}}</ref> Several foundational results in [[calculus]] follow directly from this characterization of the reals. The [[hyperreals]] {{math|'''R'''<sup>*</sup>}} form an ordered field that is not Archimedean. It is an extension of the reals obtained by including infinite and infinitesimal numbers. These are larger, respectively smaller than any real number. The hyperreals form the foundational basis of [[non-standard analysis]]. === Topological fields === Another refinement of the notion of a field is a '''topological field''', in which the set {{math|''F''}} is a [[topological space]], such that all operations of the field (addition, multiplication, the maps {{math|''a'' ↦ −''a''}} and {{math|''a'' ↦ ''a''<sup>−1</sup>}}) are [[continuous map]]s with respect to the topology of the space.<ref>{{harvp|Warner|1989|loc=Chapter 14}}</ref> The topology of all the fields discussed below is induced from a [[metric (mathematics)|metric]], i.e., a [[function (mathematics)|function]] : {{math|''d'' : ''F'' × ''F'' → '''R''',}} that measures a ''distance'' between any two elements of {{math|''F''}}. The [[completion (metric space)|completion]] of {{math|''F''}} is another field in which, informally speaking, the "gaps" in the original field {{math|''F''}} are filled, if there are any. For example, any [[irrational number]] {{math|''x''}}, such as {{math|1=''x'' = {{radic|2}}}}, is a "gap" in the rationals {{math|'''Q'''}} in the sense that it is a real number that can be approximated arbitrarily closely by rational numbers {{math|''p''/''q''}}, in the sense that distance of {{math|''x''}} and {{math|''p''/''q''}} given by the [[absolute value]] {{math|{{abs|''x'' − ''p''/''q''}}}} is as small as desired. The following table lists some examples of this construction. The fourth column shows an example of a zero [[sequence]], i.e., a sequence whose limit (for {{math|''n'' → ∞}}) is zero. {| class="wikitable" ! Field !! Metric !! Completion !! zero sequence |- | {{math|'''Q'''}} || {{math|{{abs|''x'' − ''y''}}}} (usual [[absolute value]]) || '''R''' || {{math|1/''n''}} |- | {{math|'''Q'''}} || obtained using the [[p-adic valuation|''p''-adic valuation]], for a prime number {{math|''p''}} || {{math|'''Q'''<sub>''p''</sub>}} ([[p-adic number|{{math|''p''}}-adic numbers]]) || {{math|''p''<sup>''n''</sup>}} |- | {{math|''F''(''t'')}}<br /> ({{math|''F''}} any field) || obtained using the {{math|''t''}}-adic valuation || {{math|''F''((''t''))}} || {{math|''t''<sup>''n''</sup>}} |} The field {{math|'''Q'''<sub>''p''</sub>}} is used in number theory and [[p-adic analysis|{{math|''p''}}-adic analysis]]. The algebraic closure {{math|{{overline|'''Q'''}}<sub>''p''</sub>}} carries a unique norm extending the one on {{math|'''Q'''<sub>''p''</sub>}}, but is not complete. The completion of this algebraic closure, however, is algebraically closed. Because of its rough analogy to the complex numbers, it is sometimes called the field of [[Metric completions and algebraic closures|complex ''p''-adic number]]s and is denoted by {{math|'''C'''<sub>''p''</sub>}}.<ref>{{harvp|Gouvêa|1997|loc=§5.7}}</ref> ==== Local fields ==== The following topological fields are called ''[[local field]]s'':<ref>{{harvp|Serre|1979}}</ref>{{efn|Some authors also consider the fields {{math|'''R'''}} and {{math|'''C'''}} to be local fields. On the other hand, these two fields, also called Archimedean local fields, share little similarity with the local fields considered here, to a point that {{harvtxt|Cassels|1986|loc=p. vi}} calls them "completely anomalous".}} * finite extensions of {{math|'''Q'''<sub>''p''</sub>}} (local fields of characteristic zero) * finite extensions of {{math|'''F'''<sub>''p''</sub>((''t''))}}, the field of Laurent series over {{math|'''F'''<sub>''p''</sub>}} (local fields of characteristic {{math|''p''}}). These two types of local fields share some fundamental similarities. In this relation, the elements {{math|''p'' ∈ '''Q'''<sub>''p''</sub>}} and {{math|''t'' ∈ '''F'''<sub>''p''</sub>((''t''))}} (referred to as [[uniformizer]]) correspond to each other. The first manifestation of this is at an elementary level: the elements of both fields can be expressed as power series in the uniformizer, with coefficients in {{math|'''F'''<sub>''p''</sub>}}. (However, since the addition in {{math|'''Q'''<sub>''p''</sub>}} is done using [[carry (arithmetic)|carry]]ing, which is not the case in {{math|'''F'''<sub>''p''</sub>((''t''))}}, these fields are not isomorphic.) The following facts show that this superficial similarity goes much deeper: * Any [[first-order logic|first-order]] statement that is true for almost all {{math|'''Q'''<sub>''p''</sub>}} is also true for almost all {{math|'''F'''<sub>''p''</sub>((''t''))}}. An application of this is the [[Ax–Kochen theorem]] describing zeros of homogeneous polynomials in {{math|'''Q'''<sub>''p''</sub>}}. * [[Splitting of prime ideals in Galois extensions|Tamely ramified extension]]s of both fields are in bijection to one another. * Adjoining arbitrary {{math|''p''}}-power roots of {{math|''p''}} (in {{math|'''Q'''<sub>''p''</sub>}}), respectively of {{math|''t''}} (in {{math|'''F'''<sub>''p''</sub>((''t''))}}), yields (infinite) extensions of these fields known as [[perfectoid field]]s. Strikingly, the Galois groups of these two fields are isomorphic, which is the first glimpse of a remarkable parallel between these two fields:<ref>{{harvp|Scholze|2014}}</ref> <math display="block">\operatorname {Gal}\left(\mathbf Q_p \left(p^{1/p^\infty} \right) \right) \cong \operatorname {Gal}\left(\mathbf F_p((t))\left(t^{1/p^\infty}\right)\right).</math> === Differential fields === [[Differential field]]s are fields equipped with a [[derivation (abstract algebra)|derivation]], i.e., allow to take derivatives of elements in the field.<ref>{{harvp|van der Put|Singer|2003|loc=§1}}</ref> For example, the field {{math|'''R'''(''X'')}}, together with the standard derivative of polynomials forms a differential field. These fields are central to [[differential Galois theory]], a variant of Galois theory dealing with [[linear differential equation]]s. == Galois theory == {{Main|Galois theory}} Galois theory studies [[algebraic extension]]s of a field by studying the [[Symmetry group#Symmetry groups in general|symmetry]] in the arithmetic operations of addition and multiplication. An important notion in this area is that of [[finite extension|finite]] [[Galois extension]]s {{math|''F'' / ''E''}}, which are, by definition, those that are [[separable extension|separable]] and [[normal extension|normal]]. The [[primitive element theorem]] shows that finite separable extensions are necessarily [[simple extension|simple]], i.e., of the form : {{math|1=''F'' = ''E''[''X''] / {{itco|''f''}}(''X'')}}, where {{math|''f''}} is an irreducible polynomial (as above).<ref>{{harvp|Lang|2002|loc=Theorem V.4.6}}</ref> For such an extension, being normal and separable means that all zeros of {{math|''f''}} are contained in {{math|''F''}} and that {{math|''f''}} has only simple zeros. The latter condition is always satisfied if {{math|''E''}} has characteristic {{math|0}}. For a finite Galois extension, the [[Galois group]] {{math|Gal(''F''/''E'')}} is the group of [[field automorphism]]s of {{math|''F''}} that are trivial on {{math|''E''}} (i.e., the [[bijection]]s {{math|''σ'' : ''F'' → ''F''}} that preserve addition and multiplication and that send elements of {{math|''E''}} to themselves). The importance of this group stems from the [[fundamental theorem of Galois theory]], which constructs an explicit [[one-to-one correspondence]] between the set of [[subgroup]]s of {{math|Gal(''F''/''E'')}} and the set of intermediate extensions of the extension {{math|''F''/''E''}}.<ref>{{harvp|Lang|2002|loc=§VI.1}}</ref> By means of this correspondence, group-theoretic properties translate into facts about fields. For example, if the Galois group of a Galois extension as above is not [[solvable group|solvable]] (cannot be built from [[abelian group]]s), then the zeros of {{math|''f''}} ''cannot'' be expressed in terms of addition, multiplication, and radicals, i.e., expressions involving <math>\sqrt[n]{~}</math>. For example, the [[symmetric group]]s {{math|S<sub>''n''</sub>}} is not solvable for {{math|''n'' ≥ 5}}. Consequently, as can be shown, the zeros of the following polynomials are not expressible by sums, products, and radicals. For the latter polynomial, this fact is known as the [[Abel–Ruffini theorem]]: : {{math|1=''f''(''X'') = ''X''<sup>5</sup> − 4''X'' + 2}} (and {{math|1=''E'' = '''Q'''}}),<ref>{{harvp|Lang|2002|loc=Example VI.2.6}}</ref> : {{math|1=''f''(''X'') = {{itco|''X''}}<sup>''n''</sup> + ''a''<sub>''n''−1</sub>{{itco|''X''}}<sup>''n''−1</sup> + ⋯ + ''a''<sub>0</sub>}} (where {{math|''f''}} is regarded as a polynomial in {{math|''E''(''a''<sub>0</sub>, ..., ''a''<sub>''n''−1</sub>)}}, for some indeterminates {{math|''a''<sub>''i''</sub>}}, {{math|''E''}} is any field, and {{math|''n'' ≥ 5}}). The [[tensor product of fields]] is not usually a field. For example, a finite extension {{math|''F'' / ''E''}} of degree {{math|''n''}} is a Galois extension if and only if there is an isomorphism of {{math|''F''}}-algebras : {{math|''F'' ⊗<sub>''E''</sub> ''F'' ≅ ''F''<sup>''n''</sup>}}. This fact is the beginning of [[Grothendieck's Galois theory]], a far-reaching extension of Galois theory applicable to algebro-geometric objects.<ref>{{harvp|Borceux|Janelidze|2001}}. See also [[Étale fundamental group]].</ref> == Invariants of fields == Basic invariants of a field {{math|''F''}} include the characteristic and the [[transcendence degree]] of {{math|''F''}} over its prime field. The latter is defined as the maximal number of elements in {{math|''F''}} that are algebraically independent over the prime field. Two algebraically closed fields {{math|''E''}} and {{math|''F''}} are isomorphic precisely if these two data agree.<ref>{{harvp|Gouvêa|2012|loc=Theorem 6.4.8}}</ref> This implies that any two [[uncountable]] algebraically closed fields of the same [[cardinality]] and the same characteristic are isomorphic. For example, {{math|{{overline|'''Q'''}}<sub>''p''</sub>, '''C'''<sub>''p''</sub>}} and {{math|'''C'''}} are isomorphic (but ''not'' isomorphic as topological fields). === Model theory of fields === In [[model theory]], a branch of [[mathematical logic]], two fields {{math|''E''}} and {{math|''F''}} are called [[elementarily equivalent]] if every mathematical statement that is true for {{math|''E''}} is also true for {{math|''F''}} and conversely. The mathematical statements in question are required to be [[first-order logic|first-order]] sentences (involving {{math|0}}, {{math|1}}, the addition and multiplication). A typical example, for {{math|''n'' > 0}}, {{math|''n''}} an integer, is : {{math|''φ''(''E'')}} = "any polynomial of degree {{math|''n''}} in {{math|''E''}} has a zero in {{math|''E''}}" The set of such formulas for all {{math|''n''}} expresses that {{math|''E''}} is algebraically closed. The [[Lefschetz principle]] states that {{math|'''C'''}} is elementarily equivalent to any algebraically closed field {{math|''F''}} of characteristic zero. Moreover, any fixed statement {{math|''φ''}} holds in {{math|'''C'''}} if and only if it holds in any algebraically closed field of sufficiently high characteristic.<ref>{{harvp|Marker|Messmer|Pillay|2006|loc=Corollary 1.2}}</ref> If {{math|''U''}} is an [[ultrafilter]] on a set {{math|''I''}}, and {{math|''F''<sub>''i''</sub>}} is a field for every {{math|''i''}} in {{math|''I''}}, the [[ultraproduct]] of the {{math|''F''<sub>''i''</sub>}} with respect to {{math|''U''}} is a field.<ref>{{harvp|Schoutens|2002|loc=§2}}</ref> It is denoted by : {{math|ulim<sub>''i''→∞</sub> ''F''<sub>''i''</sub>}}, since it behaves in several ways as a limit of the fields {{math|''F''<sub>''i''</sub>}}: [[Łoś's theorem]] states that any first order statement that holds for all but finitely many {{math|''F''<sub>''i''</sub>}}, also holds for the ultraproduct. Applied to the above sentence {{math|φ}}, this shows that there is an isomorphism{{efn|Both {{math|'''C'''}} and {{math|ulim<sub>''p''</sub> {{overline|'''F'''}}<sub>''p''</sub>}} are algebraically closed by Łoś's theorem. For the same reason, they both have characteristic zero. Finally, they are both uncountable, so that they are isomorphic.}} : <math>\operatorname{ulim}_{p \to \infty} \overline \mathbf F_p \cong \mathbf C.</math> The Ax–Kochen theorem mentioned above also follows from this and an isomorphism of the ultraproducts (in both cases over all primes {{math|''p''}}) : {{math|ulim<sub>''p''</sub> '''Q'''<sub>''p''</sub> ≅ ulim<sub>''p''</sub> '''F'''<sub>''p''</sub>((''t''))}}. In addition, model theory also studies the logical properties of various other types of fields, such as [[real closed field]]s or [[exponential field]]s (which are equipped with an exponential function {{math|exp : ''F'' → ''F''<sup>×</sup>}}).<ref>{{harvp|Kuhlmann|2000}}</ref> === Absolute Galois group === For fields that are not algebraically closed (or not separably closed), the [[absolute Galois group]] {{math|Gal(''F'')}} is fundamentally important: extending the case of finite Galois extensions outlined above, this group governs ''all'' finite separable extensions of {{math|''F''}}. By elementary means, the group {{math|Gal('''F'''<sub>''q''</sub>)}} can be shown to be the [[Prüfer group]], the [[profinite completion]] of {{math|'''Z'''}}. This statement subsumes the fact that the only algebraic extensions of {{math|Gal('''F'''<sub>''q''</sub>)}} are the fields {{math|Gal('''F'''<sub>''q''<sup>''n''</sup></sub>)}} for {{math|''n'' > 0}}, and that the Galois groups of these finite extensions are given by : {{math|1=Gal('''F'''<sub>''q''<sup>''n''</sup></sub> / '''F'''<sub>''q''</sub>) = '''Z'''/''n'''''Z'''}}. A description in terms of generators and relations is also known for the Galois groups of {{math|''p''}}-adic number fields (finite extensions of {{math|'''Q'''<sub>''p''</sub>}}).<ref>{{harvp|Jannsen|Wingberg|1982}}</ref> [[Galois representation|Representations of Galois groups]] and of related groups such as the [[Weil group]] are fundamental in many branches of arithmetic, such as the [[Langlands program]]. The cohomological study of such representations is done using [[Galois cohomology]].<ref>{{harvp|Serre|2002}}</ref> For example, the [[Brauer group]], which is classically defined as the group of [[central simple algebra|central simple {{math|''F''}}-algebras]], can be reinterpreted as a Galois cohomology group, namely : {{math|1=Br(''F'') = H<sup>2</sup>(''F'', '''G'''<sub>m</sub>)}}. === K-theory === [[Milnor K-theory]] is defined as : <math>K_n^M(F) = F^\times \otimes \cdots \otimes F^\times / \left\langle x \otimes (1-x) \mid x \in F \smallsetminus \{0, 1\} \right\rangle.</math> The [[norm residue isomorphism theorem]], proved around 2000 by [[Vladimir Voevodsky]], relates this to Galois cohomology by means of an isomorphism : <math>K_n^M(F) / p = H^n(F, \mu_l^{\otimes n}).</math> [[Algebraic K-theory]] is related to the group of [[invertible matrix|invertible matrices]] with coefficients the given field. For example, the process of taking the [[determinant (mathematics)|determinant]] of an invertible matrix leads to an isomorphism {{math|1=''K''<sub>1</sub>(''F'') = ''F''<sup>×</sup>}}. [[Matsumoto's theorem (K-theory)|Matsumoto's theorem]] shows that {{math|''K''<sub>2</sub>(''F'')}} agrees with {{math|''K''<sub>2</sub><sup>''M''</sup>(''F'')}}. In higher degrees, K-theory diverges from Milnor K-theory and remains hard to compute in general. == Applications == === Linear algebra and commutative algebra === If {{math|''a'' ≠ 0}}, then the [[equation]] : {{math|1=''ax'' = ''b''}} has a unique solution {{math|''x''}} in a field {{math|''F''}}, namely <math>x=a^{-1}b.</math> This immediate consequence of the definition of a field is fundamental in [[linear algebra]]. For example, it is an essential ingredient of [[Gaussian elimination]] and of the proof that any [[vector space]] has a [[basis (linear algebra)|basis]].<ref>{{harvp|Artin|1991|loc=§3.3}}</ref> The theory of [[module (mathematics)|modules]] (the analogue of vector spaces over [[ring (mathematics)|ring]]s instead of fields) is much more complicated, because the above equation may have several or no solutions. In particular [[linear equation over a ring|systems of linear equations over a ring]] are much more difficult to solve than in the case of fields, even in the specially simple case of the ring {{math|'''Z'''}} of the integers. === Finite fields: cryptography and coding theory === [[File:ECClines.svg|thumb|The sum of three points {{math|''P''}}, {{math|''Q''}}, and {{math|''R''}} on an elliptic curve {{math|''E''}} (red) is zero if there is a line (blue) passing through these points.]] A widely applied cryptographic routine uses the fact that discrete exponentiation, i.e., computing : {{math|1=''a''<sup>''n''</sup> = ''a'' ⋅ ''a'' ⋅ ⋯ ⋅ ''a''}} ({{math|''n''}} factors, for an integer {{math|''n'' ≥ 1}}) in a (large) finite field {{math|'''F'''<sub>''q''</sub>}} can be performed much more efficiently than the [[discrete logarithm]], which is the inverse operation, i.e., determining the solution {{math|''n''}} to an equation : {{math|1=''a''<sup>''n''</sup> = ''b''}}. In [[elliptic curve cryptography]], the multiplication in a finite field is replaced by the operation of adding points on an [[elliptic curve]], i.e., the solutions of an equation of the form : {{math|1=''y''<sup>2</sup> = ''x''<sup>3</sup> + ''ax'' + ''b''}}. Finite fields are also used in [[coding theory]] and [[combinatorics]]. === Geometry: field of functions === [[File:Double torus illustration.png|thumb|A compact Riemann surface of [[genus (mathematics)|genus]] two (two handles). The genus can be read off the field of meromorphic functions on the surface.]] [[function (mathematics)|Functions]] on a suitable [[topological space]] {{math|''X''}} into a field {{mvar|F}} can be added and multiplied pointwise, e.g., the product of two functions is defined by the product of their values within the domain: : {{math|1={{nowrap|1=(''f'' ⋅ ''g'')(''x'') = ''f''(''x'') ⋅ ''g''(''x'')}}}}. This makes these functions a {{math|''F''}}-[[associative algebra|commutative algebra]]. For having a ''field'' of functions, one must consider algebras of functions that are [[integral domains]]. In this case the ratios of two functions, i.e., expressions of the form : <math>\frac{f(x)}{g(x)},</math> form a field, called field of functions. This occurs in two main cases. When {{math|''X''}} is a [[complex manifold]] {{math|''X''}}. In this case, one considers the algebra of [[holomorphic functions]], i.e., complex differentiable functions. Their ratios form the field of [[meromorphic function]]s on {{math|''X''}}. The [[function field of an algebraic variety]] {{math|''X''}} (a geometric object defined as the common zeros of polynomial equations) consists of ratios of [[regular function]]s, i.e., ratios of polynomial functions on the variety. The function field of the {{math|''n''}}-dimensional [[affine space|space]] over a field {{math|''F''}} is {{math|''F''(''x''<sub>1</sub>, ..., ''x''<sub>''n''</sub>)}}, i.e., the field consisting of ratios of polynomials in {{math|''n''}} indeterminates. The function field of {{math|''X''}} is the same as the one of any [[Zariski topology|open]] dense subvariety. In other words, the function field is insensitive to replacing {{math|''X''}} by a (slightly) smaller subvariety. The function field is invariant under [[isomorphism]] and [[birational equivalence]] of varieties. It is therefore an important tool for the study of [[abstract algebraic variety|abstract algebraic varieties]] and for the classification of algebraic varieties. For example, the [[dimension of an algebraic variety|dimension]], which equals the transcendence degree of {{math|''F''(''X'')}}, is invariant under birational equivalence.<ref>{{harvp|Eisenbud|1995|loc=§13, Theorem A}}</ref> For [[algebraic curve|curves]] (i.e., the dimension is one), the function field {{math|''F''(''X'')}} is very close to {{math|''X''}}: if {{math|''X''}} is [[smooth variety|smooth]] and [[proper map|proper]] (the analogue of being [[compact topological space|compact]]), {{math|''X''}} can be reconstructed, up to isomorphism, from its field of functions.{{efn|More precisely, there is an [[equivalence of categories]] between smooth proper algebraic curves over an algebraically closed field {{math|''F''}} and finite field extensions of {{math|''F''(''T'')}}.}} In higher dimension the function field remembers less, but still decisive information about {{math|''X''}}. The study of function fields and their geometric meaning in higher dimensions is referred to as [[birational geometry]]. The [[minimal model program]] attempts to identify the simplest (in a certain precise sense) algebraic varieties with a prescribed function field. === Number theory: global fields === [[Global field]]s are in the limelight in [[algebraic number theory]] and [[arithmetic geometry]]. They are, by definition, [[number field]]s (finite extensions of {{math|'''Q'''}}) or function fields over {{math|'''F'''<sub>''q''</sub>}} (finite extensions of {{math|'''F'''<sub>''q''</sub>(''t'')}}). As for local fields, these two types of fields share several similar features, even though they are of characteristic {{math|0}} and positive characteristic, respectively. This [[function field analogy]] can help to shape mathematical expectations, often first by understanding questions about function fields, and later treating the number field case. The latter is often more difficult. For example, the [[Riemann hypothesis]] concerning the zeros of the [[Riemann zeta function]] (open as of 2017) can be regarded as being parallel to the [[Weil conjectures]] (proven in 1974 by [[Pierre Deligne]]). [[File:One5Root.svg|thumb|The fifth roots of unity form a [[regular pentagon]].]] [[Cyclotomic field]]s are among the most intensely studied number fields. They are of the form {{math|'''Q'''(''ζ''<sub>''n''</sub>)}}, where {{math|''ζ''<sub>''n''</sub>}} is a primitive {{math|''n''}}th [[root of unity]], i.e., a complex number {{math|''ζ''}} that satisfies {{math|1={{itco|''ζ''}}<sup>''n''</sup> = 1}} and {{math|{{itco|''ζ''}}<sup>''m''</sup> ≠ 1}} for all {{math|0 < ''m'' < ''n''}}.<ref>{{harvp|Washington|1997}}</ref> For {{math|''n''}} being a [[regular prime]], [[Ernst Kummer|Kummer]] used cyclotomic fields to prove [[Fermat's Last Theorem]], which asserts the non-existence of rational nonzero solutions to the equation : {{math|1=''x''<sup>''n''</sup> + ''y''<sup>''n''</sup> = ''z''<sup>''n''</sup>}}. Local fields are completions of global fields. [[Ostrowski's theorem]] asserts that the only completions of {{math|'''Q'''}}, a global field, are the local fields {{math|'''Q'''<sub>''p''</sub>}} and {{math|'''R'''}}. Studying arithmetic questions in global fields may sometimes be done by looking at the corresponding questions locally. This technique is called the [[local–global principle]]. For example, the [[Hasse–Minkowski theorem]] reduces the problem of finding rational solutions of quadratic equations to solving these equations in {{math|'''R'''}} and {{math|'''Q'''<sub>''p''</sub>}}, whose solutions can easily be described.<ref>{{harvp|Serre|1996|loc=Chapter IV}}</ref> Unlike for local fields, the Galois groups of global fields are not known. [[Inverse Galois theory]] studies the (unsolved) problem whether any finite group is the Galois group {{math|Gal(''F''/'''Q''')}} for some number field {{math|''F''}}.<ref>{{harvp|Serre|1992}}</ref> [[Class field theory]] describes the [[abelian extension]]s, i.e., ones with abelian Galois group, or equivalently the abelianized Galois groups of global fields. A classical statement, the [[Kronecker–Weber theorem]], describes the maximal abelian {{math|'''Q'''<sup>ab</sup>}} extension of {{math|'''Q'''}}: it is the field : {{math|'''Q'''(''ζ''<sub>''n''</sub>, ''n'' ≥ 2)}} obtained by adjoining all primitive {{math|''n''}}th roots of unity. [[Kronecker Jugendtraum|Kronecker's Jugendtraum]] asks for a similarly explicit description of {{math|''F''<sup>ab</sup>}} of general number fields {{math|''F''}}. For [[imaginary quadratic field]]s, <math>F=\mathbf Q(\sqrt{-d})</math>, {{math|''d'' > 0}}, the theory of [[complex multiplication]] describes {{math|''F''<sup>ab</sup>}} using [[elliptic curves]]. For general number fields, no such explicit description is known. == Related notions == In addition to the additional structure that fields may enjoy, fields admit various other related notions. Since in any field {{math|0 ≠ 1}}, any field has at least two elements. Nonetheless, there is a concept of [[field with one element]], which is suggested to be a limit of the finite fields {{math|'''F'''<sub>''p''</sub>}}, as {{math|''p''}} tends to {{math|1}}.<ref>{{harvp|Tits|1957}}</ref> In addition to division rings, there are various other weaker algebraic structures related to fields such as [[quasifield]]s, [[Near-field (mathematics)|near-field]]s and [[semifield]]s. There are also [[proper class]]es with field structure, which are sometimes called '''Field'''s, with a capital 'F'. The [[surreal number]]s form a Field containing the reals, and would be a field except for the fact that they are a proper class, not a set. The [[nimber]]s, a concept from [[game theory]], form such a Field as well.<ref>{{harvp|Conway|1976}}</ref> === Division rings === Dropping one or several axioms in the definition of a field leads to other algebraic structures. As was mentioned above, commutative rings satisfy all field axioms except for the existence of multiplicative inverses. Dropping instead commutativity of multiplication leads to the concept of a ''[[division ring]]'' or ''skew field''; sometimes associativity is weakened as well. Historically, division rings were sometimes referred to as fields, while fields were called "commutative fields". The only division rings that are finite-dimensional {{math|'''R'''}}-vector spaces are {{math|'''R'''}} itself, {{math|'''C'''}} (which is a field), and the [[quaternion]]s {{math|'''H'''}} (in which multiplication is non-commutative). This result is known as the [[Frobenius_theorem_(real_division_algebras)|Frobenius theorem]]. The [[octonion]]s {{math|'''O'''}}, for which multiplication is neither commutative nor associative, is a normed [[Alternative_algebra|alternative]] division algebra, but is not a division ring. This fact was proved using methods of [[algebraic topology]] in 1958 by [[Michel Kervaire]], [[Raoul Bott]], and [[John Milnor]].<ref>{{harvp|Baez|2002}}</ref> [[Wedderburn's little theorem]] states that all finite [[Division ring|division rings]] are fields. == Notes == {{notelist}} == Citations == {{reflist|30em}} == References == {{refbegin|30em}} * {{citation |title=Introduction to Field Theory| last=Adamson|first=I. T.|isbn=978-0-486-46266-0|year=2007|publisher=Dover Publications}} * {{citation | last1=Allenby | first1=R. B. J. T. | title=Rings, Fields and Groups | publisher=Butterworth-Heinemann | isbn=978-0-340-54440-2 | year=1991}} * {{citation | last1=Artin | first1=Michael | author1-link=Michael Artin | title=Algebra | publisher=[[Prentice Hall]] | isbn=978-0-13-004763-2 | year=1991}}, especially Chapter 13 * {{citation |last1=Artin|first1=Emil|last2=Schreier|first2=Otto|author1-link=Emil Artin|author2-link=Otto Schreier|title=Eine Kennzeichnung der reell abgeschlossenen Körper|journal=Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg|issn=0025-5858| volume=5|pages=225–231|year=1927|language=de|doi=10.1007/BF02952522|jfm=53.0144.01|s2cid=121547404}} * {{citation | last=Ax |first=James|author-link=James Ax|year=1968|title=The elementary theory of finite fields|journal=Ann. of Math. |series= 2|volume=88|issue=2|pages=239–271|doi=10.2307/1970573|jstor=1970573}} * {{citation |last=Baez|first=John C.|author-link=John C. Baez|title=The octonions|journal=[[Bulletin of the American Mathematical Society]] |volume=39|issue=2|year=2002|pages=145–205|doi=10.1090/S0273-0979-01-00934-X|arxiv=math/0105155|s2cid=586512}} * {{citation | last=Banaschewski|first=Bernhard|title=Algebraic closure without choice.|year=1992|journal=Z. Math. Logik Grundlagen Math.|volume=38|issue=4|pages=383–385|zbl=0739.03027|doi=10.1002/malq.19920380136}} * {{citation |last1=Beachy|first1=John. A|last2=Blair|first2=William D.|title=Abstract Algebra|edition=3|publisher=Waveland Press|isbn=1-57766-443-4|year=2006}} * {{citation | last1=Blyth | first1=T. S. | last2=Robertson | first2=E. F. |author2-link=Edmund F. Robertson| title=Groups, rings and fields: Algebra through practice| publisher=[[Cambridge University Press]] | year=1985}}. See especially Book 3 ({{ISBN|0-521-27288-2}}) and Book 6 ({{ISBN|0-521-27291-2}}). * {{citation |last1=Borceux|first1=Francis|last2=Janelidze|first2=George|title=Galois theories| isbn=0-521-80309-8|year=2001|publisher=Cambridge University Press|zbl=0978.12004}} * {{citation |last1=Bourbaki|first1=Nicolas|author-link=Nicolas Bourbaki|title=Elements of the history of mathematics|publisher=Springer|year=1994|isbn=3-540-19376-6|mr=1290116|doi=10.1007/978-3-642-61693-8}} * {{citation |title=Algebra II. Chapters 4–7|last=Bourbaki|first=Nicolas|author-link=Nicolas Bourbaki|isbn=0-387-19375-8|year=1988|publisher=Springer}} * {{citation |last=Cassels|first=J. W. S.|author-link=J. W. S. Cassels|title=Local fields|series=London Mathematical Society Student Texts|volume=3|publisher=Cambridge University Press|year=1986|isbn=0-521-30484-9|mr=861410|doi=10.1017/CBO9781139171885}} * {{citation |title=Elements of Abstract Algebra|last=Clark|first=A.|isbn=978-0-486-64725-8|series=Dover Books on Mathematics Series|year=1984|publisher=Dover |url=https://books.google.com/books?id=bj1kOY8gOfcC }} * {{citation |last1=Conway |first1=John Horton |year=1976 |author-link1=John Horton Conway |title=On Numbers and Games |publisher=[[Academic Press]] |title-link=On Numbers and Games }} * {{citation |last=Corry|first=Leo|author-link=Leo Corry|title=Modern algebra and the rise of mathematical structures|edition=2nd|isbn=3-7643-7002-5|year=2004|publisher=Birkhäuser|zbl=1044.01008}} * {{citation |last1=Dirichlet|first1=Peter Gustav Lejeune|author-link=Peter Gustav Lejeune Dirichlet|editor-last=Dedekind|editor-first=Richard|editor-link=Richard Dedekind|year=1871|edition=2nd|language=de|volume=1|location=Braunschweig, Germany|publisher=Friedrich Vieweg und Sohn|title=Vorlesungen über Zahlentheorie (Lectures on Number Theory)|url=https://books.google.com/books?id=SRJTAAAAcAAJ&pg=PA424}} * {{citation | last=Eisenbud|first=David|author-link=David Eisenbud | title=Commutative algebra with a view toward algebraic geometry | location=New York | publisher=[[Springer-Verlag]] | series=[[Graduate Texts in Mathematics]] | volume=150 | year=1995 | mr=1322960 | isbn=0-387-94268-8 | doi=10.1007/978-1-4612-5350-1}} * {{citation |last=Escofier|first=J. P.|isbn=978-1-4613-0191-2|title=Galois Theory|publisher=Springer|year=2012}} * {{citation | last1 = Fraleigh | first1 = John B. | year = 1976 | isbn = 0-201-01984-1 | title = A First Course In Abstract Algebra | edition = 2nd | publisher = [[Addison-Wesley]] | location = Reading }} * {{citation | last1= Fricke | first1= Robert|author1-link=Robert Fricke | last2= Weber | first2= Heinrich Martin | author2-link= Heinrich Martin Weber | title= Lehrbuch der Algebra | language=de|url= http://resolver.sub.uni-goettingen.de/purl?PPN234788267 | publisher= Vieweg | year= 1924 | jfm= 50.0042.03}} * {{citation |title=''p''-adic numbers| last=Gouvêa|first=Fernando Q.|author-link=Fernando Q. Gouvêa|edition=2nd|year=1997|publisher=Springer|series=Universitext}} * {{citation |title=A Guide to Groups, Rings, and Fields| last=Gouvêa|first=Fernando Q.|author-link=Fernando Q. Gouvêa|isbn=978-0-88385-355-9|year=2012|publisher=Mathematical Association of America}} * {{springer|title=Field|id=p/f040090}} * {{citation |last1=Hensel|first1=Kurt|author1-link=Kurt Hensel|title=Über eine neue Begründung der Theorie der algebraischen Zahlen|journal=Journal für die Reine und Angewandte Mathematik| issn=0075-4102|volume=128|pages=1–32|year=1904|language=de|jfm=35.0227.01|url=https://eudml.org/doc/149187}} * {{citation | last=Jacobson| first=Nathan| author-link=Nathan Jacobson| year=2009| title=Basic algebra| edition=2nd| volume = 1 | publisher=Dover| isbn = 978-0-486-47189-1}} * {{citation |mr=0679774|first1=Uwe|last1=Jannsen|first2=Kay|last2=Wingberg|title=Die Struktur der absoluten Galoisgruppe 𝔭-adischer Zahlkörper. [The structure of the absolute Galois group of 𝔭-adic number fields]|journal=Invent. Math.|volume=70|year=1982|issue=1|pages=71–98|url=http://epub.uni-regensburg.de/26689/|doi=10.1007/bf01393199|bibcode=1982InMat..70...71J|s2cid=119378923}} * {{citation |last=Kleiner|first=Israel|editor1-first=Israel|editor1-last=Kleiner|author-link=Israel Kleiner (mathematician)|title=A history of abstract algebra|publisher=Birkhäuser|year=2007|isbn=978-0-8176-4684-4|mr=2347309|doi=10.1007/978-0-8176-4685-1}} * {{citation |last=Kiernan|first=B. Melvin|title=The development of Galois theory from Lagrange to Artin|journal=Archive for History of Exact Sciences |volume=8|year=1971|number=1–2|pages=40–154|mr=1554154|doi=10.1007/BF00327219|s2cid=121442989}} * {{citation |last1=Kuhlmann|first1=Salma|title=Ordered exponential fields|series=Fields Institute Monographs|volume=12|publisher=American Mathematical Society|year=2000|isbn=0-8218-0943-1|mr=1760173}} * {{citation |first=Serge|last=Lang|author-link=Serge Lang|title=Algebra|series=Graduate Texts in Mathematics|volume=211|edition=3rd|publisher=Springer|year=2002|isbn=0-387-95385-X|doi=10.1007/978-1-4613-0041-0}} * {{citation |first1=Rudolf|last1=Lidl|first2=Harald|last2=Niederreiter|author2-link=Harald Niederreiter|title=Finite fields| edition=2nd|year=2008|isbn=978-0-521-06567-2|publisher=Cambridge University Press|zbl=1139.11053}} * {{citation |last=Lorenz|first=Falko|title=Algebra, Volume II: Fields with Structures, Algebras and Advanced Topics|year=2008|isbn=978-0-387-72487-4|publisher=Springer}} * {{citation |last1=Marker|first1=David|last2=Messmer|first2=Margit|last3=Pillay|first3=Anand|title=Model theory of fields|series=Lecture Notes in Logic|volume=5|edition=2nd|publisher=Association for Symbolic Logic|year=2006|isbn=978-1-56881-282-3|mr=2215060|citeseerx=10.1.1.36.8448|url-access=registration|url=https://archive.org/details/modeltheoryoffie0000mark}} * {{citation | last1 = McCoy | first1 = Neal H. | title = Introduction To Modern Algebra, Revised Edition | location = Boston | publisher = [[Allyn and Bacon]] | year = 1968 | lccn = 68015225 }} * {{citation |last1=Mines|first1=Ray|last2=Richman|first2=Fred|last3=Ruitenburg|first3=Wim|title=A course in constructive algebra|series=Universitext|publisher=Springer|year=1988|isbn=0-387-96640-4|mr=919949|doi=10.1007/978-1-4419-8640-5}} * {{citation | last = Moore | first = E. Hastings | author-link = E. H. Moore | year = 1893 | title = A doubly-infinite system of simple groups | journal = [[Bulletin of the American Mathematical Society]] | volume = 3 | issue = 3 | pages = 73–78 | mr = 1557275 | doi = 10.1090/S0002-9904-1893-00178-X | doi-access = free }} * {{citation |last=Prestel|first=Alexander|title=Lectures on Formally Real Fields |series=Lecture Notes in Mathematics |volume=1093|publisher=Springer|year=1984|isbn=3-540-13885-4|mr=769847|doi=10.1007/BFb0101548}} * {{citation |last=Ribenboim|first=Paulo|author-link=Paulo Ribenboim|title=The theory of classical valuations|series=Springer Monographs in Mathematics|publisher=Springer|year=1999|isbn=0-387-98525-5|mr=1677964| doi=10.1007/978-1-4612-0551-7}} * {{citation |last=Scholze|first=Peter|author-link=Peter Scholze|chapter=Perfectoid spaces and their Applications|year=2014|chapter-url=http://www.math.uni-bonn.de/people/scholze/ICM.pdf|title=Proceedings of the International Congress of Mathematicians 2014|publisher=Kyung Moon SA |url=http://www.icm2014.org/en/vod/proceedings.html|isbn=978-89-6105-804-9}} * {{citation |last=Schoutens|first=Hans|isbn=978-3-642-13367-1|title=The Use of Ultraproducts in Commutative Algebra|year=2002|publisher=Springer|series=Lecture Notes in Mathematics|volume=1999}} * {{citation |last=Serre|first=Jean-Pierre|author-link=Jean-Pierre Serre|title=A course in arithmetic. Translation of ''Cours d'arithmetique''|edition=2nd|orig-year=1978|series=Graduate Text in Mathematics|volume=7|publisher=Springer|zbl=0432.10001|isbn=9780387900407|year=1996|url-access=registration|url=https://archive.org/details/courseinarithmet00serr}} * {{citation|last=Serre|first=Jean-Pierre|author-link=Jean-Pierre Serre|title=Local fields|series=Graduate Texts in Mathematics |volume=67|publisher=Springer|year=1979|isbn=0-387-90424-7|mr=554237}} * {{citation|first=Jean-Pierre|last=Serre|author-link=Jean-Pierre Serre|title=Topics in Galois theory|isbn=0-86720-210-6|year=1992|publisher=Jones and Bartlett Publishers|zbl=0746.12001}} * {{citation | last1=Serre | first1=Jean-Pierre | author1-link= Jean-Pierre Serre | title=Galois cohomology | publisher=[[Springer-Verlag]] | location=Berlin, New York | series=Springer Monographs in Mathematics | isbn=978-3-540-42192-4 | mr=1867431 | year=2002 | zbl=1004.12003 | others=Translated from the French by [[Patrick Ion]]}} * {{citation|last=Sharpe|first=David|title=Rings and factorization|isbn=0-521-33718-6|year=1987|publisher=Cambridge University Press|zbl=0674.13008|url-access=registration|url=https://archive.org/details/ringsfactorizati0000shar}} * {{citation | last1=Steinitz | first1=Ernst | author1-link=Ernst Steinitz | year=1910 | title=Algebraische Theorie der Körper |trans-title=Algebraic Theory of Fields | url=http://resolver.sub.uni-goettingen.de/purl?GDZPPN002167042 | journal=[[Journal für die reine und angewandte Mathematik]] | volume=1910 | issue=137 | pages=167–309 | issn=0075-4102 | jfm=41.0445.03 | doi=10.1515/crll.1910.137.167 | s2cid=120807300 }} * {{citation | last1 = Tits | first1 = Jacques | author-link=Jacques Tits | chapter = Sur les analogues algébriques des groupes semi-simples complexes | title = Colloque d'algèbre supérieure, tenu à Bruxelles du 19 au 22 décembre 1956, Centre Belge de Recherches Mathématiques Établissements Ceuterick, Louvain | publisher = Librairie Gauthier-Villars | place = Paris | year = 1957 | pages = 261–289 }} * {{citation |title=Galois Theory of Linear Differential Equations|first1=M.|last1=van der Put|first2=M. F.|last2=Singer|year=2003|publisher=Springer|series=Grundlehren der mathematischen Wissenschaften|volume=328|url=http://www4.ncsu.edu/~singer/papers/dbook2.ps}} * {{citation | last=von Staudt|first=Karl Georg Christian|author-link=Karl Georg Christian von Staudt |url=https://books.google.com/books?id=XwEHAAAAcAAJ&pg=PA127|title=Beiträge zur Geometrie der Lage (Contributions to the Geometry of Position)|volume=2|location=Nürnberg (Germany)|publisher=Bauer and Raspe|year=1857}} * {{citation |last=Wallace|first=D. A. R.|year=1998|title=Groups, Rings, and Fields|series=SUMS|publisher=Springer|volume=151}} * {{citation |first=Seth|last=Warner|title=Topological fields|isbn=0-444-87429-1|year=1989|publisher=North-Holland|zbl=0683.12014}} * {{citation |first=Lawrence C.|last= Washington|author-link=Lawrence C. Washington|title=Introduction to Cyclotomic Fields|series=Graduate Texts in Mathematics|volume= 83|publisher=Springer-Verlag |year= 1997|edition=2nd |isbn=0-387-94762-0 |mr=1421575|doi=10.1007/978-1-4612-1934-7}} * {{citation |last=Weber |first=Heinrich |author-link= Heinrich Martin Weber |title=Die allgemeinen Grundlagen der Galois'schen Gleichungstheorie |journal=Mathematische Annalen |issn=0025-5831 |volume=43 |issue=4 |pages=521–549 |year=1893 |language=de |doi=10.1007/BF01446451 |jfm=25.0137.01 |s2cid=120528969 |url=https://eudml.org/doc/157689 }} {{refend}} == External links == {{Wikibooks|Abstract algebra|Fields}} {{DEFAULTSORT:Field (Mathematics)}} [[Category:Field (mathematics)| ]] [[Category:Algebraic structures]] [[Category:Abstract algebra]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:About
(
edit
)
Template:Algebraic structures
(
edit
)
Template:Blockquote
(
edit
)
Template:Citation
(
edit
)
Template:Cite web
(
edit
)
Template:Color
(
edit
)
Template:Comma separated entries
(
edit
)
Template:Efn
(
edit
)
Template:Good article
(
edit
)
Template:Harvp
(
edit
)
Template:ISBN
(
edit
)
Template:Ifsubst
(
edit
)
Template:Main
(
edit
)
Template:Main other
(
edit
)
Template:Math
(
edit
)
Template:Mvar
(
edit
)
Template:Notelist
(
edit
)
Template:Nowrap
(
edit
)
Template:Refbegin
(
edit
)
Template:Refend
(
edit
)
Template:Reflist
(
edit
)
Template:See
(
edit
)
Template:Short description
(
edit
)
Template:Sister project
(
edit
)
Template:Slink
(
edit
)
Template:Springer
(
edit
)
Template:Wikibooks
(
edit
)