← LibraryQuadratic Field Discriminants and Integral BasesEngineering · MathematicsLesson 302/385← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Joginquadratic fielddiscriminantintegral basisfundamental discriminant

Quadratic Fields

Quadratic Field Discriminants and Integral Bases

Discriminants and integral bases of quadratic fields, given by closed formulas with no computation required.

Engineering / MathematicsQuadratic Fields2 min readKV-MATH-0599

Quadratic fields are the one family where every structural question has a closed-form answer. No maximal order algorithm is needed; the integral basis is given by a case split on a congruence.

Presentation

Every quadratic field is generated by the square root of a squarefree integer, positive for a real field and negative for an imaginary one.

K = Q(sqrt(m)), m squarefree, m not equal to 0 or 1Real if m is positive, imaginary if negative.

Discriminant and integral basis

Closed formulas for quadratic fields
Condition on mDiscriminantIntegral basis
m congruent to 1 modulo 4m1 and (1 + sqrt(m))/2
Otherwise4m1 and sqrt(m)

Fundamental discriminants

Fundamental discriminant
An integer that is the discriminant of some quadratic field: either one modulo four and squarefree, or four times a squarefree number that is two or three modulo four.
Non-fundamental discriminant
The discriminant of a non-maximal order. Valid for form theory but not a field discriminant.
Conductor
The factor relating a general discriminant to the fundamental one beneath it.

Signature and unit rank

The two families behave very differently
FieldSignatureUnit rankRoots of unity
Imaginary quadraticr1 = 0, r2 = 10Usually plus and minus one; more for the discriminants minus three and minus four
Real quadraticr1 = 2, r2 = 01Plus and minus one only

Why they are the right place to start

Every general phenomenon — class groups, units, regulators, reduction theory, sub-exponential methods — appears here in a setting concrete enough to compute by hand. See the quadratic pathway.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 5.1. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.

Continue learning

Class Group and Unit Computation: the Computational ProblemArticle · MathematicsNEXT LESSON →Prime Decomposition in Quadratic FieldsArticle · MathematicsMinkowski and Bach BoundsArticle · MathematicsBinary Quadratic Forms and the Ideal CorrespondenceArticle · Mathematics