Algebraic number theory

Template:Short description Template:Ring theory sidebar

Title page of the first edition of Disquisitiones Arithmeticae, one of the founding works of modern algebraic number theory

Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic objects such as algebraic number fields and their rings of integers, finite fields, and function fields. These properties, such as whether a ring admits unique factorization, the behavior of ideals, and the Galois groups of fields, can resolve questions of primary importance in number theory, like the existence of solutions to Diophantine equations.

HistoryEdit

DiophantusEdit

The beginnings of algebraic number theory can be traced to Diophantine equations,<ref>Stark, pp. 145–146.</ref> named after the 3rd-century Alexandrian mathematician, Diophantus, who studied them and developed methods for the solution of some kinds of Diophantine equations. A typical Diophantine problem is to find two integers x and y such that their sum, and the sum of their squares, equal two given numbers A and B, respectively:

Diophantine equations have been studied for thousands of years. For example, the solutions to the quadratic Diophantine equation
x² + y² = z² are given by the Pythagorean triples, originally solved by the Babylonians (Template:Circa).<ref>Aczel, pp. 14–15.</ref> Solutions to linear Diophantine equations, such as 26x + 65y = 13, may be found using the Euclidean algorithm (c. 5th century BC).<ref>Stark, pp. 44–47.</ref>

Diophantus's major work was the Arithmetica, of which only a portion has survived.

FermatEdit

Fermat's Last Theorem was first conjectured by Pierre de Fermat in 1637, famously in the margin of a copy of Arithmetica where he claimed he had a proof that was too large to fit in the margin. No successful proof was published until 1995 despite the efforts of countless mathematicians during the 358 intervening years. The unsolved problem stimulated the development of algebraic number theory in the 19th century and the proof of the modularity theorem in the 20th century.

GaussEdit

One of the founding works of algebraic number theory, the Disquisitiones Arithmeticae (Latin: Arithmetical Investigations) is a textbook of number theory written in Latin<ref>Template:Citation</ref> by Carl Friedrich Gauss in 1798 when Gauss was 21 and first published in 1801 when he was 24. In this book Gauss brings together results in number theory obtained by mathematicians such as Fermat, Euler, Lagrange and Legendre and adds important new results of his own. Before the Disquisitiones was published, number theory consisted of a collection of isolated theorems and conjectures. Gauss brought the work of his predecessors together with his own original work into a systematic framework, filled in gaps, corrected unsound proofs, and extended the subject in numerous ways.

The Disquisitiones was the starting point for the work of other nineteenth century European mathematicians including Ernst Kummer, Peter Gustav Lejeune Dirichlet and Richard Dedekind. Many of the annotations given by Gauss are in effect announcements of further research of his own, some of which remained unpublished. They must have appeared particularly cryptic to his contemporaries; we can now read them as containing the germs of the theories of L-functions and complex multiplication, in particular.

DirichletEdit

In a couple of papers in 1838 and 1839 Peter Gustav Lejeune Dirichlet proved the first class number formula, for quadratic forms (later refined by his student Leopold Kronecker). The formula, which Jacobi called a result "touching the utmost of human acumen", opened the way for similar results regarding more general number fields.<ref name=Elstrodt>Template:Citation</ref> Based on his research of the structure of the unit group of quadratic fields, he proved the Dirichlet unit theorem, a fundamental result in algebraic number theory.<ref name=Kanemitsu>Template:Citation</ref>

He first used the pigeonhole principle, a basic counting argument, in the proof of a theorem in diophantine approximation, later named after him Dirichlet's approximation theorem. He published important contributions to Fermat's last theorem, for which he proved the cases n = 5 and n = 14, and to the biquadratic reciprocity law.<ref name=Elstrodt/> The Dirichlet divisor problem, for which he found the first results, is still an unsolved problem in number theory despite later contributions by other researchers.

DedekindEdit

Richard Dedekind's study of Lejeune Dirichlet's work was what led him to his later study of algebraic number fields and ideals. In 1863, he published Lejeune Dirichlet's lectures on number theory as Vorlesungen über Zahlentheorie ("Lectures on Number Theory") about which it has been written that:

"Although the book is assuredly based on Dirichlet's lectures, and although Dedekind himself referred to the book throughout his life as Dirichlet's, the book itself was entirely written by Dedekind, for the most part after Dirichlet's death." (Edwards 1983){{#if:|{{#if:|}}
— {{#if:|, in }}Template:Comma separated entries
}}

{{#invoke:Check for unknown parameters|check|unknown=Template:Main other|preview=Page using Template:Blockquote with unknown parameter "_VALUE_"|ignoreblank=y| 1 | 2 | 3 | 4 | 5 | author | by | char | character | cite | class | content | multiline | personquoted | publication | quote | quotesource | quotetext | sign | source | style | text | title | ts }}

1879 and 1894 editions of the Vorlesungen included supplements introducing the notion of an ideal, fundamental to ring theory. (The word "Ring", introduced later by Hilbert, does not appear in Dedekind's work.) Dedekind defined an ideal as a subset of a set of numbers, composed of algebraic integers that satisfy polynomial equations with integer coefficients. The concept underwent further development in the hands of Hilbert and, especially, of Emmy Noether. Ideals generalize Ernst Eduard Kummer's ideal numbers, devised as part of Kummer's 1843 attempt to prove Fermat's Last Theorem.

HilbertEdit

David Hilbert unified the field of algebraic number theory with his 1897 treatise Zahlbericht (literally "report on numbers"). He also resolved a significant number-theory problem formulated by Waring in 1770. As with the finiteness theorem, he used an existence proof that shows there must be solutions for the problem rather than providing a mechanism to produce the answers.<ref>Template:Citation</ref> He then had little more to publish on the subject; but the emergence of Hilbert modular forms in the dissertation of a student means his name is further attached to a major area.

He made a series of conjectures on class field theory. The concepts were highly influential, and his own contribution lives on in the names of the Hilbert class field and of the Hilbert symbol of local class field theory. Results were mostly proved by 1930, after work by Teiji Takagi.<ref>This work established Takagi as Japan's first mathematician of international stature.</ref>

ArtinEdit

Emil Artin established the Artin reciprocity law in a series of papers (1924; 1927; 1930). This law is a general theorem in number theory that forms a central part of global class field theory.<ref>Template:Citation</ref> The term "reciprocity law" refers to a long line of more concrete number theoretic statements which it generalized, from the quadratic reciprocity law and the reciprocity laws of Eisenstein and Kummer to Hilbert's product formula for the norm symbol. Artin's result provided a partial solution to Hilbert's ninth problem.

Modern theoryEdit

Around 1955, Japanese mathematicians Goro Shimura and Yutaka Taniyama observed a possible link between two apparently completely distinct, branches of mathematics, elliptic curves and modular forms. The resulting modularity theorem (at the time known as the Taniyama–Shimura conjecture) states that every elliptic curve is modular, meaning that it can be associated with a unique modular form.

It was initially dismissed as unlikely or highly speculative, but was taken more seriously when number theorist André Weil found evidence supporting it, yet no proof; as a result the "astounding"<ref name="Singh">Template:Citation</ref> conjecture was often known as the Taniyama–Shimura-Weil conjecture. It became a part of the Langlands program, a list of important conjectures needing proof or disproof.

From 1993 to 1994, Andrew Wiles provided a proof of the modularity theorem for semistable elliptic curves, which, together with Ribet's theorem, provided a proof for Fermat's Last Theorem. Almost every mathematician at the time had previously considered both Fermat's Last Theorem and the Modularity Theorem either impossible or virtually impossible to prove, even given the most cutting-edge developments. Wiles first announced his proof in June 1993<ref name=nyt>Template:Cite news</ref> in a version that was soon recognized as having a serious gap at a key point. The proof was corrected by Wiles, partly in collaboration with Richard Taylor, and the final, widely accepted version was released in September 1994, and formally published in 1995. The proof uses many techniques from algebraic geometry and number theory, and has many ramifications in these branches of mathematics. It also uses standard constructions of modern algebraic geometry, such as the category of schemes and Iwasawa theory, and other 20th-century techniques not available to Fermat.

Basic notionsEdit

Failure of unique factorizationEdit

An important property of the ring of integers is that it satisfies the fundamental theorem of arithmetic, that every (positive) integer has a factorization into a product of prime numbers, and this factorization is unique up to the ordering of the factors. This may no longer be true in the ring of integers Template:Math of an algebraic number field Template:Math.

A prime element is an element Template:Math of Template:Math such that if Template:Math divides a product Template:Math, then it divides one of the factors Template:Math or Template:Math. This property is closely related to primality in the integers, because any positive integer satisfying this property is either Template:Math or a prime number. However, it is strictly weaker. For example, Template:Math is not a prime number because it is negative, but it is a prime element. If factorizations into prime elements are permitted, then, even in the integers, there are alternative factorizations such as

In general, if Template:Math is a unit, meaning a number with a multiplicative inverse in Template:Math, and if Template:Math is a prime element, then Template:Math is also a prime element. Numbers such as Template:Math and Template:Math are said to be associate. In the integers, the primes Template:Math and Template:Math are associate, but only one of these is positive. Requiring that prime numbers be positive selects a unique element from among a set of associated prime elements. When K is not the rational numbers, however, there is no analog of positivity. For example, in the Gaussian integers Template:Math,<ref>This notation indicates the ring obtained from Z by adjoining to Z the element i.</ref> the numbers Template:Math and Template:Math are associate because the latter is the product of the former by Template:Math, but there is no way to single out one as being more canonical than the other. This leads to equations such as

which prove that in Template:Math, it is not true that factorizations are unique up to the order of the factors. For this reason, one adopts the definition of unique factorization used in unique factorization domains (UFDs). In a UFD, the prime elements occurring in a factorization are only expected to be unique up to units and their ordering.

However, even with this weaker definition, many rings of integers in algebraic number fields do not admit unique factorization. There is an algebraic obstruction called the ideal class group. When the ideal class group is trivial, the ring is a UFD. When it is not, there is a distinction between a prime element and an irreducible element. An irreducible element Template:Math is an element such that if Template:Math, then either Template:Math or Template:Math is a unit. These are the elements that cannot be factored any further. Every element in O admits a factorization into irreducible elements, but it may admit more than one. This is because, while all prime elements are irreducible, some irreducible elements may not be prime. For example, consider the ring Template:Math.<ref>This notation indicates the ring obtained from Z by adjoining to Z the element Template:Math.</ref> In this ring, the numbers Template:Math, Template:Math and Template:Math are irreducible. This means that the number Template:Math has two factorizations into irreducible elements,

This equation shows that Template:Math divides the product Template:Math. If Template:Math were a prime element, then it would divide Template:Math or Template:Math, but it does not, because all elements divisible by Template:Math are of the form Template:Math. Similarly, Template:Math and Template:Math divide the product Template:Math, but neither of these elements divides Template:Math itself, so neither of them are prime. As there is no sense in which the elements Template:Math, Template:Math and Template:Math can be made equivalent, unique factorization fails in Template:Math. Unlike the situation with units, where uniqueness could be repaired by weakening the definition, overcoming this failure requires a new perspective.

Factorization into prime idealsEdit

If Template:Math is an ideal in Template:Math, then there is always a factorization

<math>I = \mathfrak{p}_1^{e_1} \cdots \mathfrak{p}_t^{e_t},</math>

where each <math>\mathfrak{p}_i</math> is a prime ideal, and where this expression is unique up to the order of the factors. In particular, this is true if Template:Math is the principal ideal generated by a single element. This is the strongest sense in which the ring of integers of a general number field admits unique factorization. In the language of ring theory, it says that rings of integers are Dedekind domains.

When Template:Math is a UFD, every prime ideal is generated by a prime element. Otherwise, there are prime ideals which are not generated by prime elements. In Template:Math, for instance, the ideal Template:Math is a prime ideal which cannot be generated by a single element.

Historically, the idea of factoring ideals into prime ideals was preceded by Ernst Kummer's introduction of ideal numbers. These are numbers lying in an extension field Template:Math of Template:Math. This extension field is now known as the Hilbert class field. By the principal ideal theorem, every prime ideal of Template:Math generates a principal ideal of the ring of integers of Template:Math. A generator of this principal ideal is called an ideal number. Kummer used these as a substitute for the failure of unique factorization in cyclotomic fields. These eventually led Richard Dedekind to introduce a forerunner of ideals and to prove unique factorization of ideals.

An ideal which is prime in the ring of integers in one number field may fail to be prime when extended to a larger number field. Consider, for example, the prime numbers. The corresponding ideals Template:Math are prime ideals of the ring Template:Math. However, when this ideal is extended to the Gaussian integers to obtain Template:Math, it may or may not be prime. For example, the factorization Template:Math implies that

<math>2\mathbf{Z}[i] = (1 + i)\mathbf{Z}[i] \cdot (1 - i)\mathbf{Z}[i] = ((1 + i)\mathbf{Z}[i])^2;</math>

note that because Template:Math, the ideals generated by Template:Math and Template:Math are the same. A complete answer to the question of which ideals remain prime in the Gaussian integers is provided by Fermat's theorem on sums of two squares. It implies that for an odd prime number Template:Math, Template:Math is a prime ideal if Template:Math and is not a prime ideal if Template:Math. This, together with the observation that the ideal Template:Math is prime, provides a complete description of the prime ideals in the Gaussian integers. Generalizing this simple result to more general rings of integers is a basic problem in algebraic number theory. Class field theory accomplishes this goal when K is an abelian extension of Q (that is, a Galois extension with abelian Galois group).

Ideal class groupEdit

Unique factorization fails if and only if there are prime ideals that fail to be principal. The object which measures the failure of prime ideals to be principal is called the ideal class group. Defining the ideal class group requires enlarging the set of ideals in a ring of algebraic integers so that they admit a group structure. This is done by generalizing ideals to fractional ideals. A fractional ideal is an additive subgroup Template:Math of Template:Math which is closed under multiplication by elements of Template:Math, meaning that Template:Math if Template:Math. All ideals of Template:Math are also fractional ideals. If Template:Math and Template:Math are fractional ideals, then the set Template:Math of all products of an element in Template:Math and an element in Template:Math is also a fractional ideal. This operation makes the set of non-zero fractional ideals into a group. The group identity is the ideal Template:Math, and the inverse of Template:Math is a (generalized) ideal quotient:

<math>J^{-1} = (O:J) = \{x \in K: xJ \subseteq O\}.</math>

The principal fractional ideals, meaning the ones of the form Template:Math where Template:Math, form a subgroup of the group of all non-zero fractional ideals. The quotient of the group of non-zero fractional ideals by this subgroup is the ideal class group. Two fractional ideals Template:Math and Template:Math represent the same element of the ideal class group if and only if there exists an element Template:Math such that Template:Math. Therefore, the ideal class group makes two fractional ideals equivalent if one is as close to being principal as the other is. The ideal class group is generally denoted Template:Math, Template:Math, or Template:Math (with the last notation identifying it with the Picard group in algebraic geometry).

The number of elements in the class group is called the class number of K. The class number of Template:Math is 2. This means that there are only two ideal classes, the class of principal fractional ideals, and the class of a non-principal fractional ideal such as Template:Math.

The ideal class group has another description in terms of divisors. These are formal objects which represent possible factorizations of numbers. The divisor group Template:Math is defined to be the free abelian group generated by the prime ideals of Template:Math. There is a group homomorphism from Template:Math, the non-zero elements of Template:Math up to multiplication, to Template:Math. Suppose that Template:Math satisfies

<math>(x) = \mathfrak{p}_1^{e_1} \cdots \mathfrak{p}_t^{e_t}.</math>

Then Template:Math is defined to be the divisor

<math>\operatorname{div} x = \sum_{i=1}^t e_i[\mathfrak{p}_i].</math>

The kernel of Template:Math is the group of units in Template:Math, while the cokernel is the ideal class group. In the language of homological algebra, this says that there is an exact sequence of abelian groups (written multiplicatively),

<math>1 \to O^\times \to K^\times \xrightarrow{\text{div}} \operatorname{Div} K \to \operatorname{Cl} K \to 1.</math>

Real and complex embeddingsEdit

Some number fields, such as Template:Math, can be specified as subfields of the real numbers. Others, such as Template:Math, cannot. Abstractly, such a specification corresponds to a field homomorphism Template:Math or Template:Math. These are called real embeddings and complex embeddings, respectively.

A real quadratic field Template:Math, with Template:Math, and Template:Math not a perfect square, is so-called because it admits two real embeddings but no complex embeddings. These are the field homomorphisms which send Template:Math to Template:Math and to Template:Math, respectively. Dually, an imaginary quadratic field Template:Math admits no real embeddings but admits a conjugate pair of complex embeddings. One of these embeddings sends Template:Math to Template:Math, while the other sends it to its complex conjugate, Template:Math.

Conventionally, the number of real embeddings of Template:Math is denoted Template:Math, while the number of conjugate pairs of complex embeddings is denoted Template:Math. The signature of K is the pair Template:Math. It is a theorem that Template:Math, where Template:Math is the degree of Template:Math.

Considering all embeddings at once determines a function <math>M \colon K \to \mathbf{R}^{r_1} \oplus \mathbf{C}^{r_2}</math>, or equivalently <math>M \colon K \to \mathbf{R}^{r_1} \oplus \mathbf{R}^{2r_2}.</math> This is called the Minkowski embedding.

The subspace of the codomain fixed by complex conjugation is a real vector space of dimension Template:Math called Minkowski space. Because the Minkowski embedding is defined by field homomorphisms, multiplication of elements of Template:Math by an element Template:Math corresponds to multiplication by a diagonal matrix in the Minkowski embedding. The dot product on Minkowski space corresponds to the trace form <math>\langle x, y \rangle = \operatorname{Tr}(xy)</math>.

The image of Template:Math under the Minkowski embedding is a Template:Math-dimensional lattice. If Template:Math is a basis for this lattice, then Template:Math is the discriminant of Template:Math. The discriminant is denoted Template:Math or Template:Math. The covolume of the image of Template:Math is <math>\sqrt{|\Delta|}</math>.

PlacesEdit

Real and complex embeddings can be put on the same footing as prime ideals by adopting a perspective based on valuations. Consider, for example, the integers. In addition to the usual absolute value function |·| : Q → R, there are p-adic absolute value functions |·|_p : Q → R, defined for each prime number p, which measure divisibility by p. Ostrowski's theorem states that these are all possible absolute value functions on Q (up to equivalence). Therefore, absolute values are a common language to describe both the real embedding of Q and the prime numbers.

A place of an algebraic number field is an equivalence class of absolute value functions on K. There are two types of places. There is a <math>\mathfrak{p}</math>-adic absolute value for each prime ideal <math>\mathfrak{p}</math> of O, and, like the p-adic absolute values, it measures divisibility. These are called finite places. The other type of place is specified using a real or complex embedding of K and the standard absolute value function on R or C. These are infinite places. Because absolute values are unable to distinguish between a complex embedding and its conjugate, a complex embedding and its conjugate determine the same place. Therefore, there are Template:Math real places and Template:Math complex places. Because places encompass the primes, places are sometimes referred to as primes. When this is done, finite places are called finite primes and infinite places are called infinite primes. If Template:Math is a valuation corresponding to an absolute value, then one frequently writes <math>v \mid \infty</math> to mean that Template:Math is an infinite place and <math>v \nmid \infty</math> to mean that it is a finite place.

Considering all the places of the field together produces the adele ring of the number field. The adele ring allows one to simultaneously track all the data available using absolute values. This produces significant advantages in situations where the behavior at one place can affect the behavior at other places, as in the Artin reciprocity law.

Places at infinity geometricallyEdit

There is a geometric analogy for places at infinity which holds on the function fields of curves. For example, let <math>k = \mathbb{F}_q</math> and <math>X/k</math> be a smooth, projective, algebraic curve. The function field <math>F = k(X)</math> has many absolute values, or places, and each corresponds to a point on the curve. If <math>X</math> is the projective completion of an affine curve <math>\hat{X} \subset \mathbb{A}^n</math> then the points in <math>X - \hat{X}</math> correspond to the places at infinity. Then, the completion of <math>F</math> at one of these points gives an analogue of the <math>p</math>-adics.

For example, if <math>X = \mathbb{P}^1</math> then its function field is isomorphic to <math>k(t)</math> where <math>t</math> is an indeterminant and the field <math>F</math> is the field of fractions of polynomials in <math>t</math>. Then, a place <math>v_p</math> at a point <math>p \in X</math> measures the order of vanishing or the order of a pole of a fraction of polynomials <math>p(x)/q(x)</math> at the point <math>p</math>. For example, if <math>p = [2:1]</math>, so on the affine chart <math>x_1 \neq 0</math> this corresponds to the point <math>2 \in \mathbb{A}^1</math>, the valuation <math>v_2</math> measures the order of vanishing of <math>p(x)</math> minus the order of vanishing of <math>q(x)</math> at <math>2</math>. The function field of the completion at the place <math>v_2</math> is then <math>k((t-2))</math> which is the field of power series in the variable <math>t-2</math>, so an element is of the form<templatestyles src="Template:Blockquote/styles.css" />

Template:Error Template:Main other{{#if:|{{#if:|}}
— {{#if:|, in }}Template:Comma separated entries
}}

{{#invoke:Check for unknown parameters|check|unknown=Template:Main other|preview=Page using Template:Blockquote with unknown parameter "_VALUE_"|ignoreblank=y| 1 | 2 | 3 | 4 | 5 | author | by | char | character | cite | class | content | multiline | personquoted | publication | quote | quotesource | quotetext | sign | source | style | text | title | ts }}for some <math>k \in \mathbb{N}</math>. For the place at infinity, this corresponds to the function field <math>k((1/t))</math> which are power series of the form<templatestyles src="Template:Blockquote/styles.css" />

Template:Error Template:Main other{{#if:|{{#if:|}}
— {{#if:|, in }}Template:Comma separated entries
}}

{{#invoke:Check for unknown parameters|check|unknown=Template:Main other|preview=Page using Template:Blockquote with unknown parameter "_VALUE_"|ignoreblank=y| 1 | 2 | 3 | 4 | 5 | author | by | char | character | cite | class | content | multiline | personquoted | publication | quote | quotesource | quotetext | sign | source | style | text | title | ts }}

UnitsEdit

The integers have only two units, Template:Math and Template:Math. Other rings of integers may admit more units. The Gaussian integers have four units, the previous two as well as Template:Math. The Eisenstein integers Template:Math have six units. The integers in real quadratic number fields have infinitely many units. For example, in Template:Math, every power of Template:Math is a unit, and all these powers are distinct.

In general, the group of units of Template:Math, denoted Template:Math, is a finitely generated abelian group. The fundamental theorem of finitely generated abelian groups therefore implies that it is a direct sum of a torsion part and a free part. Reinterpreting this in the context of a number field, the torsion part consists of the roots of unity that lie in Template:Math. This group is cyclic. The free part is described by Dirichlet's unit theorem. This theorem says that rank of the free part is Template:Math. Thus, for example, the only fields for which the rank of the free part is zero are Template:Math and the imaginary quadratic fields. A more precise statement giving the structure of O^× ⊗_Z Q as a Galois module for the Galois group of K/Q is also possible.<ref>See proposition VIII.8.6.11 of Template:Harvnb</ref>

The free part of the unit group can be studied using the infinite places of Template:Math. Consider the function

<math>\begin{cases} L: K^\times \to \mathbf{R}^{r_1 + r_2} \\ L(x) = (\log |x|_v)_v \end{cases}</math>

where Template:Math varies over the infinite places of Template:Math and |·|_v is the absolute value associated with Template:Math. The function Template:Math is a homomorphism from Template:Math to a real vector space. It can be shown that the image of Template:Math is a lattice that spans the hyperplane defined by <math>x_1 + \cdots + x_{r_1 + r_2} = 0.</math> The covolume of this lattice is the regulator of the number field. One of the simplifications made possible by working with the adele ring is that there is a single object, the idele class group, that describes both the quotient by this lattice and the ideal class group.

Zeta functionEdit

The Dedekind zeta function of a number field, analogous to the Riemann zeta function, is an analytic object which describes the behavior of prime ideals in Template:Math. When Template:Math is an abelian extension of Template:Math, Dedekind zeta functions are products of Dirichlet L-functions, with there being one factor for each Dirichlet character. The trivial character corresponds to the Riemann zeta function. When Template:Math is a Galois extension, the Dedekind zeta function is the Artin L-function of the regular representation of the Galois group of Template:Math, and it has a factorization in terms of irreducible Artin representations of the Galois group.

The zeta function is related to the other invariants described above by the class number formula.

Local fieldsEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Completing a number field K at a place w gives a complete field. If the valuation is Archimedean, one obtains R or C, if it is non-Archimedean and lies over a prime p of the rationals, one obtains a finite extension <math>K_w/\mathbf{Q}_p:</math> a complete, discrete valued field with finite residue field. This process simplifies the arithmetic of the field and allows the local study of problems. For example, the Kronecker–Weber theorem can be deduced easily from the analogous local statement. The philosophy behind the study of local fields is largely motivated by geometric methods. In algebraic geometry, it is common to study varieties locally at a point by localizing to a maximal ideal. Global information can then be recovered by gluing together local data. This spirit is adopted in algebraic number theory. Given a prime in the ring of algebraic integers in a number field, it is desirable to study the field locally at that prime. Therefore, one localizes the ring of algebraic integers to that prime and then completes the fraction field much in the spirit of geometry.

Major resultsEdit

Finiteness of the class groupEdit

One of the classical results in algebraic number theory is that the ideal class group of an algebraic number field K is finite. This is a consequence of Minkowski's theorem since there are only finitely many Integral ideals with norm less than a fixed positive integer<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> ^{page 78}. The order of the class group is called the class number, and is often denoted by the letter h.

Dirichlet's unit theoremEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Dirichlet's unit theorem provides a description of the structure of the multiplicative group of units O^× of the ring of integers O. Specifically, it states that O^× is isomorphic to G × Z^r, where G is the finite cyclic group consisting of all the roots of unity in O, and r = r₁ + r₂ − 1 (where r₁ (respectively, r₂) denotes the number of real embeddings (respectively, pairs of conjugate non-real embeddings) of K). In other words, O^× is a finitely generated abelian group of rank r₁ + r₂ − 1 whose torsion consists of the roots of unity in O.

Reciprocity lawsEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

In terms of the Legendre symbol, the law of quadratic reciprocity for positive odd primes states

<math> \left(\frac{p}{q}\right) \left(\frac{q}{p}\right) = (-1)^{\frac{p-1}{2}\frac{q-1}{2}}.</math>

A reciprocity law is a generalization of the law of quadratic reciprocity.

There are several different ways to express reciprocity laws. The early reciprocity laws found in the 19th century were usually expressed in terms of a power residue symbol (p/q) generalizing the quadratic reciprocity symbol, that describes when a prime number is an nth power residue modulo another prime, and gave a relation between (p/q) and (q/p). Hilbert reformulated the reciprocity laws as saying that a product over p of Hilbert symbols (a,b/p), taking values in roots of unity, is equal to 1. Artin's reformulated reciprocity law states that the Artin symbol from ideals (or ideles) to elements of a Galois group is trivial on a certain subgroup. Several more recent generalizations express reciprocity laws using cohomology of groups or representations of adelic groups or algebraic K-groups, and their relationship with the original quadratic reciprocity law can be hard to see.

Class number formulaEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} The class number formula relates many important invariants of a number field to a special value of its Dedekind zeta function.

Related areasEdit

Algebraic number theory interacts with many other mathematical disciplines. It uses tools from homological algebra. Via the analogy of function fields vs. number fields, it relies on techniques and ideas from algebraic geometry. Moreover, the study of higher-dimensional schemes over Z instead of number rings is referred to as arithmetic geometry. Algebraic number theory is also used in the study of arithmetic hyperbolic 3-manifolds.

NotesEdit

Template:Reflist

Template:Neukirch et al. CNF

External linksEdit

Template:Number theory-footer Template:Authority control