Fundamental discriminant

In mathematics, a fundamental discriminant D is an integer invariant in the theory of integral binary quadratic forms. If Q(x, y) = ax2 + bxy + cy2 is a quadratic form with integer coefficients, then D = b2 4ac is the discriminant of Q(x, y). Conversely, every integer D with D ≡ 0, 1 (mod 4) is the discriminant of some binary quadratic form with integer coefficients. Thus, all such integers are referred to as discriminants in this theory.

There are explicit congruence conditions that give the set of fundamental discriminants. Specifically, D is a fundamental discriminant if, and only if, one of the following statements holds

  • D ≡ 1 (mod 4) and is square-free,
  • D = 4m, where m ≡ 2 or 3 (mod 4) and m is square-free.

The first ten positive fundamental discriminants are:

1, 5, 8, 12, 13, 17, 21, 24, 28, 29, 33 (sequence A003658 in the OEIS).

The first ten negative fundamental discriminants are:

3, 4, 7, 8, 11, 15, 19, 20, 23, 24, 31 (sequence A003657 in the OEIS).

Connection with quadratic fields

There is a connection between the theory of integral binary quadratic forms and the arithmetic of quadratic number fields. A basic property of this connection is that D0 is a fundamental discriminant if, and only if, D0 = 1 or D0 is the discriminant of a quadratic number field. There is exactly one quadratic field for every fundamental discriminant D0  1, up to isomorphism.

Caution: This is the reason why some authors consider 1 not to be a fundamental discriminant. One may interpret D0 = 1 as the degenerate "quadratic" field Q (the rational numbers).

Factorization

Fundamental discriminants may also be characterized by their factorization into positive and negative prime powers. Define the set

where the prime numbers ≡ 1 (mod 4) are positive and those ≡ 3 (mod 4) are negative. Then, a number D0  1 is a fundamental discriminant if, and only if, it is the product of pairwise relatively prime members of S.

gollark: The answer is, of course, "DE comes in and BLOWS IT ALL UP".
gollark: It's one of those things like "what happens when an unstoppable force meets an immovable object".
gollark: I could *probably* fork it and tear out half the code, if you wanted, but you know.
gollark: Ah, those are also nice.
gollark: <@404656680496791554> Also flux gates and energy crystals are nice.

References

  • Henri Cohen (1993). A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics. 138. Berlin, New York: Springer-Verlag. ISBN 3-540-55640-0. MR 1228206.
  • Duncan Buell (1989). Binary quadratic forms: classical theory and modern computations. Springer-Verlag. p. 69. ISBN 0-387-97037-1.
  • Don Zagier (1981). Zetafunktionen und quadratische Körper. Berlin, New York: Springer-Verlag. ISBN 978-3-540-10603-6.

See also

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.