The ring of integers of a quadratic field
Statement
Let be a squarefree integer, , and . Then if , and if .
Why is it true?
Knowing exactly what the integers of are is the mandatory first step for doing arithmetic in : factoring elements or ideals, computing class groups, or deciding which primes ramify all require an honest description of , not the naive guess , which is wrong exactly half the time.
Proof sketch
Write with . If , is an algebraic integer iff (rational root theorem), which is the case of . If , the minimal polynomial of over is (its trace is , its norm ), so is integral iff both and .
Write . From , multiplying by gives , so . Write in lowest terms (); then forces , and since this forces . Because is squarefree, the largest perfect square dividing is at most , so , i.e. ; either way .
Now substitute , (both integers) into : this becomes , i.e. . Squares mod are only (even) or (odd). If is even, forces even too (since odd would give ); so both even, meaning — the "trivial" solution, always available, giving always.
If is odd, (since ), so we need . If (i.e. ), no square can equal or , so this case is impossible — only the trivial both even survives, giving exactly . If instead (), we need , satisfied whenever is odd — and since is already odd, is exactly the condition for with both odd, which is precisely (check: itself has , both odd), so in this case , strictly larger than (index ).
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- J. Neukirch (1999). Algebraic Number Theory · DOI:10.1007/978-3-662-03983-0
- M. Bhargava (2005). The density of discriminants of quartic rings and fields · DOI:10.4007/annals.2005.162.1031
- The LMFDB Collaboration (2026). The L-functions and modular forms database (LMFDB)