# Difference between revisions of "Algebraic number theory"

(Created page with "In mathematics, <b>Algebraic number theory</b> is the study of algebraic numbers and structures involving them, especially algebraic number fields. =Introduction...") |
Duck master (talk | contribs) (fixed links) |
||

(2 intermediate revisions by one other user not shown) | |||

Line 1: | Line 1: | ||

− | In [[mathematics]], <b> | + | In [[mathematics]], <b>algebraic number theory</b> is the study of [[algebraic number|algebraic numbers]] and structures involving them, especially [[number field|algebraic number fields]]. |

=Introduction= | =Introduction= | ||

− | Algebraic number theory is a branch of [[number theory]] that, in a nutshell, extends various properties of the [[integer|integers]] to more general [[rings]] and [[fields]]. In doing so, many questions concerning [[Diophantine equations]] are resolved, including the celebrated [[quadratic reciprocity]] theorem. More recently, the field has been linked to the theory of [[elliptic curves]], and its ideas are responsible for the successful attack on [[Fermat's Last Theorem]]. This field is extremely rich and advanced, and this article gives no more than a brief introduction. | + | Algebraic number theory is a branch of [[number theory]] that, in a nutshell, extends various properties of the [[integer|integers]] to more general [[ring|rings]] and [[field|fields]]. In doing so, many questions concerning [[Diophantine equations]] are resolved, including the celebrated [[quadratic reciprocity]] theorem. More recently, the field has been linked to the theory of [[elliptic curves|elliptic curve]], and its ideas are responsible for the successful attack on [[Fermat's Last Theorem]]. This field is extremely rich and advanced (indeed, prerequisites to courses in this topic often include first-year graduate school material), and this article gives no more than a brief introduction. |

=The basics= | =The basics= | ||

==Motivation== | ==Motivation== | ||

− | Interest in the field was largely motivated by the desire to understand numbers of the form <math>x^2+ny^2</math> for some fixed, [[squarefree]] <math>n</math> (if <math>n=x^2y</math> is not [[squarefree]], the case is equivalent to <math>n=y</math>). More specifically, the question at hand was what numbers could be expressed in that form. Since <math>k=x^2+ny^2 \implies x^2 \equiv k \pmod n</math>, there was a natural connection to [[quadratic residues]] in play. In the ring of integers, this is a difficult question to analyze, but it becomes much easier when considering the [[field]] <math>Q[-\sqrt{n}]</math> because then <math>x^2+ny^2=(x+y\sqrt{-n})(x-y\sqrt{-n})</math> is the product of two elements - and the [[norm]] of one. The case of <math>n=1</math>, in particular, leads to [[factorization]] in the [[Gaussian integers]]. | + | Interest in the field was largely motivated by the desire to understand numbers of the form <math>x^2+ny^2</math> for some fixed, [[squarefree]] <math>n</math> (if <math>n=x^2y</math> is not [[squarefree]], the case is equivalent to <math>n=y</math>). More specifically, the question at hand was what numbers could be expressed in that form. Since <math>k=x^2+ny^2 \implies x^2 \equiv k \pmod n</math>, there was a natural connection to [[quadratic residues]] in play. In the ring of integers, this is a difficult question to analyze, but it becomes much easier when considering the [[field]] <math>Q[-\sqrt{n}]</math> because then <math>x^2+ny^2=(x+y\sqrt{-n})(x-y\sqrt{-n})</math> is the product of two elements - and the [[norm]] of one. The case of <math>n=1</math>, in particular, leads to [[factorization]] in the [[Gaussian integer|Gaussian integers]]. |

− | This extension of the concept of [[factorization]] | + | This extension of the concept of [[factorization]] relates to many other problems as well, most notably [[Fermat's Last Theorem]]. In the <math>n=3</math> case, a simple solution exists by taking <math>y^3=z^3-x^3=(z-x)(z^2+xz+z^2)</math> and using an [[infinite descent]] argument. However, this does not extend well to larger <math>n</math> because analogous factorizations contain terms of degree larger than 2. Early attempts at proof factored <math>y^p=z^p-x^p</math> into <math>y^p=\prod_{i=0}^{p-1}(z-\omega^ix)</math>, where <math>\omega</math> is a <math>p</math>th root of unity. However, though this was not well-understood at the time, the implicit assumption was that <math>\mathbb{Z}[\omega]</math> was a [[principal ideal domain]], later shown to be false. |

==Algebraic Numbers== | ==Algebraic Numbers== | ||

An [[algebraic number]] is a number that is the root of some nonzero integer [[polynomial]] (i.e. a polynomial with integer coefficients). When that polynomial is [[monic]], the number is said to be an [[algebraic integer]]. For example, all [[rational]] numbers are algebraic integers (and thus an [[algebraic number]] as well), as the [[linear]] polynomial <math>nx-m</math> has root <math>\frac{m}{n}</math> for any [[integers]] <math>m,n</math> (with <math>n \neq 0</math>). When such a [[polynomial]] exists, it is called the <b>minimal polynomial</b> of the [[algebraic number]] in question. It can be shown that a number is an algebraic integer if and only if its minimal polynomial has integer coefficients. | An [[algebraic number]] is a number that is the root of some nonzero integer [[polynomial]] (i.e. a polynomial with integer coefficients). When that polynomial is [[monic]], the number is said to be an [[algebraic integer]]. For example, all [[rational]] numbers are algebraic integers (and thus an [[algebraic number]] as well), as the [[linear]] polynomial <math>nx-m</math> has root <math>\frac{m}{n}</math> for any [[integers]] <math>m,n</math> (with <math>n \neq 0</math>). When such a [[polynomial]] exists, it is called the <b>minimal polynomial</b> of the [[algebraic number]] in question. It can be shown that a number is an algebraic integer if and only if its minimal polynomial has integer coefficients. | ||

− | The sum, difference, product, and quotient of any two algebraic numbers is itself an [[algebraic number]]; as a result, the algebraic numbers form a [[field]]. In this article, <math>K</math> will denote an arbitrary [[algebraic number field]]; for example, <math>\mathbb{Q}[\sqrt{-5}]</math>, which consists of the numbers of the form <math>a+b\sqrt{-5}</math> where <math>a,b</math> are rational. As a sidenote, this shows that the sum of any two algebraic integers is itself an algebraic integer, and furthermore any [[rational]] algebraic integer is obviously also an [[integer]]. This gives an easy way to show that sums similar to <math>\sqrt{2}+\sqrt{3}+\sqrt{5}+\sqrt{7}</math> are [[irrational]] - as all of these terms are algebraic integers (they are roots of <math>x^2-k</math> for <math>k=2,3,5,7</math>), the sum is an algebraic integer as well, and so must be an [[integer]] if [[rational]]. But any old [[approximation]] is sufficient to determine that this sum is not an [[integer]], hence it is [[irrational]]. | + | The sum, difference, product, and quotient of any two algebraic numbers is itself an [[algebraic number]]; as a result, the algebraic numbers form a [[field]]. In this article, <math>K</math> will denote an arbitrary [[number field|algebraic number field]]; for example, <math>\mathbb{Q}[\sqrt{-5}]</math>, which consists of the numbers of the form <math>a+b\sqrt{-5}</math> where <math>a,b</math> are rational. As a sidenote, this shows that the sum of any two algebraic integers is itself an algebraic integer, and furthermore any [[rational]] algebraic integer is obviously also an [[integer]]. This gives an easy way to show that sums similar to <math>\sqrt{2}+\sqrt{3}+\sqrt{5}+\sqrt{7}</math> are [[irrational]] - as all of these terms are algebraic integers (they are roots of <math>x^2-k</math> for <math>k=2,3,5,7</math>), the sum is an algebraic integer as well, and so must be an [[integer]] if [[rational]]. But any old [[approximation]] is sufficient to determine that this sum is not an [[integer]], hence it is [[irrational]]. |

==Unique factorization== | ==Unique factorization== | ||

− | In the ring of [[integer|integers]], all numbers have unique factorizations by the [[Fundamental theorem of arithmetic]], up to multiplication by the [[unit|units]] 1 and -1. We will extend this notion to an [[integral domain]] <math>A</math>; in other words, a [[commutative ring]] in which the product of two nonzero elements is nonzero. An element <math>a \in A</math> is a [[unit]] if <math>a</math> is [[invertible]] in <math>A</math>; i.e. there exists an inverse <math>b \in A</math> such that <math>ab=ba=1</math> (where 1 is the [[ | + | In the ring of [[integer|integers]], all numbers have unique factorizations by the [[Fundamental theorem of arithmetic]], up to multiplication by the [[unit (ring theory)|units]] 1 and -1. We will extend this notion to an [[integral domain]] <math>A</math>; in other words, a [[commutative ring]] in which the product of two nonzero elements is nonzero. An element <math>a \in A</math> is a [[unit (ring theory)|unit]] if <math>a</math> is [[invertible]] in <math>A</math>; i.e. there exists an inverse <math>b \in A</math> such that <math>ab=ba=1</math> (where 1 is the multiplicative [[identity]]). An element <math>p \in A</math> is [[prime]] if it is not zero, not a unit, and <math>p \mid ab \implies p \mid a</math> or <math>p \mid b</math>. In a [[principal ideal domain]], any element <math>a \in A</math> can be unique factored as the product of primes, up to order and [[multiplication]] by [[unit (ring theory)|units]]. The first order of business is to explore when unique factorization holds. |

− | Of course, we first need to define the term <b>factorization</b>. An element <math>a \in A</math> is <b>irreducible</b> if it is not a unit and cannot be written as the product of two nonunits; obviously, [[prime]]s are irreducible (but not necessarily vice versa). A factorization of an element is its expression as a product of irreducible elements, and a ring is a | + | Of course, we first need to define the term <b>factorization</b>. An element <math>a \in A</math> is <b>irreducible</b> if it is not a unit and cannot be written as the product of two nonunits; obviously, [[prime]]s are irreducible (but not necessarily vice versa). A factorization of an element is its expression as a product of irreducible elements, and a ring is a [[Unique factorization domain|UFD]] if this factorization is unique (up to order and multiplication by units). |

− | As previously mentioned, <math>K</math> is an arbitrary [[algebraic number field]]; as a field, factorization only makes sense in the presence of a subring. Fortunately, can be shown that the algebraic integers form a subring of <math>K</math>; however, though it can be shown that algebraic integers can always be factored, they do not generally form a [[UFD]]. For example, if <math>K=\mathbb{Q}[\sqrt{-5}]</math>, we have | + | As previously mentioned, <math>K</math> is an arbitrary [[number field|algebraic number field]]; as a field, factorization only makes sense in the presence of a subring. Fortunately, can be shown that the algebraic integers form a subring of <math>K</math>; however, though it can be shown that algebraic integers can always be factored, they do not generally form a [[Unique factorization domain|UFD]]. For example, if <math>K=\mathbb{Q}[\sqrt{-5}]</math>, we have |

<cmath>6=2 \cdot 3=(1+\sqrt{-5})(1-\sqrt{-5})</cmath> | <cmath>6=2 \cdot 3=(1+\sqrt{-5})(1-\sqrt{-5})</cmath> | ||

and so the [[factorization]] is not unique. | and so the [[factorization]] is not unique. | ||

Line 27: | Line 27: | ||

It can be shown that unique factorization occurs when irreducibles are necessary primes. When this is not the case, the concept can be largely recovered through the use of [[ideal|ideals]]. The general idea is to consider entities that "divide" irreducibles, for the purpose of recovering unique factorization. This may sound contrived, but in fact it is a very important idea. In the above example, | It can be shown that unique factorization occurs when irreducibles are necessary primes. When this is not the case, the concept can be largely recovered through the use of [[ideal|ideals]]. The general idea is to consider entities that "divide" irreducibles, for the purpose of recovering unique factorization. This may sound contrived, but in fact it is a very important idea. In the above example, | ||

<cmath>6=2 \cdot 3=(1+\sqrt{-5})(1-\sqrt{-5})</cmath> | <cmath>6=2 \cdot 3=(1+\sqrt{-5})(1-\sqrt{-5})</cmath> | ||

− | we define ideals <math> | + | we define ideals <math>\mathfrak{a}, \mathfrak{b}, \mathfrak{c}, \mathfrak{d}</math> such that |

− | <cmath>6=( | + | <cmath>6=(\mathfrak{a} \cdot \mathfrak{b}) \cdot (\mathfrak{c} \cdot \mathfrak{d})=(\mathfrak{a} \cdot \mathfrak{c}) \cdot (\mathfrak{b} \cdot \mathfrak{d})</cmath> |

− | which is not unlike writing <math>210=6 \cdot 35=14 \cdot 15</math> (or <math>210=(2 \cdot 3) \cdot (5 \cdot 7)=(2 \cdot 7) \cdot (3 \cdot 5)</math>). The usual divisibility rules - namely <math> | + | which is not unlike writing <math>210=6 \cdot 35=14 \cdot 15</math> (or <math>210=(2 \cdot 3) \cdot (5 \cdot 7)=(2 \cdot 7) \cdot (3 \cdot 5)</math>). The usual divisibility rules - namely <math>\mathfrak{a} \mid a \implies \mathfrak{a} \mid ab</math>, <math>\mathfrak{a} \mid a, \mathfrak{a} \mid b \implies \mathfrak{a} \mid a+b</math>, <math>\mathfrak{a} \mid 0</math> - still hold for ideals. When we define <math>\mathfrak{a}, \mathfrak{b}</math> by the set of irreducibles they divide, we can extend the notion to multiplication as well: |

− | <cmath> | + | <cmath>\mathfrak{a}\mathfrak{b}=\{a_nb_m : \mathfrak{a}\mid a_n, \mathfrak{b} \mid b_m\}</cmath> |

− | this recovers unique factorization, as we can write <math>a= | + | this recovers unique factorization, as we can write <math>a=\mathfrak{a}\mathfrak{b}\mathfrak{c}\hdots</math> for all <math>a \in A</math>. When we have to resort to this definition, <math>K</math> is a <b>principal ideal domain</b>. |

==The norm map== | ==The norm map== | ||

− | We skated over a key detail in the above section: how do we know that <math>2, 3, 1+\sqrt{-5}</math>, and <math>1-\sqrt{-5}</math> are themselves irreducibles? To show this, we use the <b>norm map</b> <math>N:\mathbb{Q}[\sqrt{-5}] \rightarrow \mathbb{Q}</math>, <math>N(a+b\sqrt{-5})=a^2+5b^2</math>. It can be shown that the [[norm]] is [[multiplicative]], and so if <math>1+\sqrt{-5}=ab</math> for some <math>a,b \in K</math>, we have <math>N(ab)=N(a)N(b)=6</math>. We can immediately discard the cases where <math>N(a)=1</math>, as this implies <math>a\overline{a}=1 \implies a</math> is a [[unit]], and we can easily verify that the other two cases do not occur. There is one final detail to process: we must show that no two of these irreducibles are <b>associates</b>; i.e. they do not differ only by [[unit|units]]. Fortunately, it is easy to verify that <math>1+\sqrt{-5}=(a+b\sqrt{-5})(1-\sqrt{-5})</math> has no solutions in <math>a,b \in \mathbb{Z}</math>. | + | We skated over a key detail in the above section: how do we know that <math>2, 3, 1+\sqrt{-5}</math>, and <math>1-\sqrt{-5}</math> are themselves irreducibles? To show this, we use the <b>norm map</b> <math>N:\mathbb{Q}[\sqrt{-5}] \rightarrow \mathbb{Q}</math>, <math>N(a+b\sqrt{-5})=a^2+5b^2</math>. It can be shown that the [[norm]] is [[multiplicative function|multiplicative]], and so if <math>1+\sqrt{-5}=ab</math> for some <math>a,b \in K</math>, we have <math>N(ab)=N(a)N(b)=6</math>. We can immediately discard the cases where <math>N(a)=1</math>, as this implies <math>a\overline{a}=1 \implies a</math> is a [[unit (ring theory)|unit]], and we can easily verify that the other two cases do not occur. There is one final detail to process: we must show that no two of these irreducibles are <b>associates</b>; i.e. they do not differ only by [[unit (ring theory)|units]]. Fortunately, it is easy to verify that <math>1+\sqrt{-5}=(a+b\sqrt{-5})(1-\sqrt{-5})</math> has no solutions in <math>a,b \in \mathbb{Z}</math>. |

=Major results= | =Major results= | ||

Line 40: | Line 40: | ||

The discovery of [[Quadratic reciprocity]] was an early success of this research, stating the impressive formula | The discovery of [[Quadratic reciprocity]] was an early success of this research, stating the impressive formula | ||

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

− | where <math>\left(\frac{p}{q}\right)</math> is the [[Legendre symbol]], equal to 1 if <math>p</math> is a [[quadratic residue]] modulo <math>q</math> and -1 otherwise (or 0 when <math>p \equiv 0 \pmod q</math>, but this clearly does not occur for [[primes]]). In other words, unless <math>p \equiv q \equiv 3 \pmod 4</math>, <math>p</math> is a [[quadratic residue]] modulo <math>q</math> if and only if <math>q</math> is a [[quadratic residue]] modulo <math>p</math>. | + | where <math>\left(\frac{p}{q}\right)</math> is the [[Legendre symbol]], equal to 1 if <math>p</math> is a [[quadratic residue]] modulo <math>q</math> and -1 otherwise (or 0 when <math>p \equiv 0 \pmod q</math>, but this clearly does not occur for [[prime|primes]]). In other words, unless <math>p \equiv q \equiv 3 \pmod 4</math>, <math>p</math> is a [[quadratic residue]] modulo <math>q</math> if and only if <math>q</math> is a [[quadratic residue]] modulo <math>p</math>. |

==Finiteness of the class number== | ==Finiteness of the class number== | ||

==Dirichlet's unit theorem== | ==Dirichlet's unit theorem== |

## Latest revision as of 15:04, 28 May 2020

In mathematics, **algebraic number theory** is the study of algebraic numbers and structures involving them, especially algebraic number fields.

## Contents

# Introduction

Algebraic number theory is a branch of number theory that, in a nutshell, extends various properties of the integers to more general rings and fields. In doing so, many questions concerning Diophantine equations are resolved, including the celebrated quadratic reciprocity theorem. More recently, the field has been linked to the theory of elliptic curve, and its ideas are responsible for the successful attack on Fermat's Last Theorem. This field is extremely rich and advanced (indeed, prerequisites to courses in this topic often include first-year graduate school material), and this article gives no more than a brief introduction.

# The basics

## Motivation

Interest in the field was largely motivated by the desire to understand numbers of the form for some fixed, squarefree (if is not squarefree, the case is equivalent to ). More specifically, the question at hand was what numbers could be expressed in that form. Since , there was a natural connection to quadratic residues in play. In the ring of integers, this is a difficult question to analyze, but it becomes much easier when considering the field because then is the product of two elements - and the norm of one. The case of , in particular, leads to factorization in the Gaussian integers.

This extension of the concept of factorization relates to many other problems as well, most notably Fermat's Last Theorem. In the case, a simple solution exists by taking and using an infinite descent argument. However, this does not extend well to larger because analogous factorizations contain terms of degree larger than 2. Early attempts at proof factored into , where is a th root of unity. However, though this was not well-understood at the time, the implicit assumption was that was a principal ideal domain, later shown to be false.

## Algebraic Numbers

An algebraic number is a number that is the root of some nonzero integer polynomial (i.e. a polynomial with integer coefficients). When that polynomial is monic, the number is said to be an algebraic integer. For example, all rational numbers are algebraic integers (and thus an algebraic number as well), as the linear polynomial has root for any integers (with ). When such a polynomial exists, it is called the **minimal polynomial** of the algebraic number in question. It can be shown that a number is an algebraic integer if and only if its minimal polynomial has integer coefficients.

The sum, difference, product, and quotient of any two algebraic numbers is itself an algebraic number; as a result, the algebraic numbers form a field. In this article, will denote an arbitrary algebraic number field; for example, , which consists of the numbers of the form where are rational. As a sidenote, this shows that the sum of any two algebraic integers is itself an algebraic integer, and furthermore any rational algebraic integer is obviously also an integer. This gives an easy way to show that sums similar to are irrational - as all of these terms are algebraic integers (they are roots of for ), the sum is an algebraic integer as well, and so must be an integer if rational. But any old approximation is sufficient to determine that this sum is not an integer, hence it is irrational.

## Unique factorization

In the ring of integers, all numbers have unique factorizations by the Fundamental theorem of arithmetic, up to multiplication by the units 1 and -1. We will extend this notion to an integral domain ; in other words, a commutative ring in which the product of two nonzero elements is nonzero. An element is a unit if is invertible in ; i.e. there exists an inverse such that (where 1 is the multiplicative identity). An element is prime if it is not zero, not a unit, and or . In a principal ideal domain, any element can be unique factored as the product of primes, up to order and multiplication by units. The first order of business is to explore when unique factorization holds.

Of course, we first need to define the term **factorization**. An element is **irreducible** if it is not a unit and cannot be written as the product of two nonunits; obviously, primes are irreducible (but not necessarily vice versa). A factorization of an element is its expression as a product of irreducible elements, and a ring is a UFD if this factorization is unique (up to order and multiplication by units).

As previously mentioned, is an arbitrary algebraic number field; as a field, factorization only makes sense in the presence of a subring. Fortunately, can be shown that the algebraic integers form a subring of ; however, though it can be shown that algebraic integers can always be factored, they do not generally form a UFD. For example, if , we have and so the factorization is not unique.

It can be shown that unique factorization occurs when irreducibles are necessary primes. When this is not the case, the concept can be largely recovered through the use of ideals. The general idea is to consider entities that "divide" irreducibles, for the purpose of recovering unique factorization. This may sound contrived, but in fact it is a very important idea. In the above example,
we define ideals such that
which is not unlike writing (or ). The usual divisibility rules - namely , , - still hold for ideals. When we define by the set of irreducibles they divide, we can extend the notion to multiplication as well:
this recovers unique factorization, as we can write for all . When we have to resort to this definition, is a **principal ideal domain**.

## The norm map

We skated over a key detail in the above section: how do we know that , and are themselves irreducibles? To show this, we use the **norm map** , . It can be shown that the norm is multiplicative, and so if for some , we have . We can immediately discard the cases where , as this implies is a unit, and we can easily verify that the other two cases do not occur. There is one final detail to process: we must show that no two of these irreducibles are **associates**; i.e. they do not differ only by units. Fortunately, it is easy to verify that has no solutions in .

# Major results

## Quadratic reciprocity

The discovery of Quadratic reciprocity was an early success of this research, stating the impressive formula where is the Legendre symbol, equal to 1 if is a quadratic residue modulo and -1 otherwise (or 0 when , but this clearly does not occur for primes). In other words, unless , is a quadratic residue modulo if and only if is a quadratic residue modulo .