Quadratic field

In algebraic number theory, a quadratic field is an algebraic number field K of degree two over Q. It is easy to show that the map d ↦ Q(√d) is a bijection from the set of all square-free integers d ≠ 0, 1 to the set of all quadratic fields. If d > 0 the corresponding quadratic field is called a real quadratic field, and for d < 0 an imaginary quadratic field or complex quadratic field, corresponding to whether its archimedean embeddings are real or complex.

Quadratic fields have been studied in great depth, initially as part of the theory of binary quadratic forms. There remain some unsolved problems. The class number problem is particularly important.

Contents

Ring of integers

Discriminant

The discriminant of the quadratic field Q(√d) is d if d is congruent to 1 modulo 4, and otherwise 4d. For example, when d is −1 so that K is the field of so-called Gaussian rationals, the discriminant is −4. The reason for this distinction relates to general algebraic number theory. The ring of integers of K is spanned by 1 and the square root of d only in the second case, and in the first case there are such integers that lie at half the 'lattice points' (for example, when d = −3, these are the Eisenstein integers, given by the complex cube roots of unity).

The set of discriminants of quadratic fields is exactly the set of fundamental discriminants.

Prime factorization into ideals

Any prime number p gives rise to an ideal pOK in the ring of integers OK of a quadratic field K. In line with general theory of splitting of prime ideals in Galois extensions, this may be

p is inert
(p) is a prime ideal
The quotient ring is the finite field with p2 elements: OK/pOK = Fp2
p splits
(p) is a product of two distinct prime ideals of OK.
The quotient ring is the product OK/pOK = Fp × Fp.
p is ramified
(p) is the square of a prime ideal of OK.
The quotient ring contains non-zero nilpotent elements.

The third case happens if and only if p divides the discriminant D. The first and second cases occur when the Kronecker symbol (D/p) equals −1 and +1, respectively. For example, if p is an odd prime not dividing D, then p splits if and only if D is congruent to a square modulo p. The first two cases are in a certain sense equally likely to occur as p runs through the primes, see Chebotarev density theorem.[1]

The law of quadratic reciprocity implies that the splitting behaviour of a prime p in a quadratic field depends only on p modulo D, where D is the field discriminant.

Quadratic subfields of cyclotomic fields

The quadratic subfield of the prime cyclotomic field

A classical example of the construction of a quadratic field is to take the unique quadratic field inside the cyclotomic field generated by a primitive p-th root of unity, with p a prime number > 2. The uniqueness is a consequence of Galois theory, there being a unique subgroup of index 2 in the Galois group over Q. As explained at Gaussian period, the discriminant of the quadratic field is p for p = 4n + 1 and −p for p = 4n + 3. This can also be predicted from enough ramification theory. In fact p is the only prime that ramifies in the cyclotomic field, so that p is the only prime that can divide the quadratic field discriminant. That rules out the 'other' discriminants −4p and 4p in the respective cases.

Other cyclotomic fields

If one takes the other cyclotomic fields, they have Galois groups with extra 2-torsion, and so contain at least three quadratic fields. In general a quadratic field of field discriminant D can be obtained as a subfield of a cyclotomic field of D-th roots of unity. This expresses the fact that the conductor of a quadratic field is the absolute value of its discriminant.

See also

Notes

  1. ^ Samuel, pp. 76–77

References

  • Duncan Buell (1989). Binary quadratic forms: classical theory and modern computations. Springer-Verlag. ISBN 0-387-97037-1.  Chapter 6.
  • Pierre Samuel (1972). Algebraic number theory. Hermann/Kershaw. 
  • I.N. Stewart; D.O. Tall (1979). Algebraic number theory. Chapman and Hall. ISBN 0-412-13840-9.  Chapter 3.1.

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Quadratic reciprocity — The law of quadratic reciprocity is a theorem from modular arithmetic, a branch of number theory, which shows a remarkable relationship between the solvability of certain quadratic equations modulo different prime moduli.Although it allows us to… …   Wikipedia

  • Quadratic — In mathematics, the term quadratic describes something that pertains to squares, to the operation of squaring, to terms of the second degree, or equations or formulas that involve such terms. Quadratus is Latin for square . Mathematics Algebra… …   Wikipedia

  • Quadratic irrational — In mathematics, a quadratic irrational, also known as a quadratic irrationality or quadratic surd, is an irrational number that is the solution to some quadratic equation with rational coefficients. Since fractions can be cleared from a quadratic …   Wikipedia

  • Quadratic programming — (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables.The quadratic programming problem… …   Wikipedia

  • Quadratic equation — This article is about quadratic equations and solutions. For more general information about quadratic functions, see Quadratic function. For more information about quadratic polynomials, see Quadratic polynomial. In mathematics, a quadratic… …   Wikipedia

  • Quadratic form — In mathematics, a quadratic form is a homogeneous polynomial of degree two in a number of variables. For example, is a quadratic form in the variables x and y. Quadratic forms occupy a central place in various branches of mathematics, including… …   Wikipedia

  • Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… …   Wikipedia

  • Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… …   Wikipedia

  • Quadratic residue code — A quadratic residue code is a type of cyclic code.There is a quadratic residue code of length pover the finite field GF(l) whenever pand l are primes, p is odd andl is a quadratic residue modulo p.Its generator polynomial as a cyclic code is… …   Wikipedia

  • Field extension — In abstract algebra, field extensions are the main object of study in field theory. The general idea is to start with a base field and construct in some manner a larger field which contains the base field and satisfies additional properties. For… …   Wikipedia


Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.