Next: 6.4 Lattices and ideals Up: 6 Algebraic Number Fields Previous: 6.2 Algebraic Number Fields

## 6.3 Orders and Maximal orders

We now look a the subring R of K consisting of matrices with integer entries; R is called an order in K. Now, for any invertible n×n matrix g it is clear that gKg-1 is isomorphic to K; but g or g-1 may have entries with denominators. So the ring Rg consisting of matrices in gKg-1 with integer entries need not be that same as R. Thus, one can look for a maximal order. We will see below that one such exists and is unique. It is usually called the ring of integers in K and is denoted by K.

There is a natural symmetric pairing on n×n matrices given by

A, B = Trace(A . B)

We study the restriction of this to K. This pairing is non-degenerate; i. e. for any non-zero A there is a B so that < A, B > 0. For example, if in K, then , = Trace(1) = n which is non-zero! (Clearly, a different argument is required when the base field is not but a finite field). From the non-degeneracy it also follows that for any additive map from K to the rationals there is an in K so that the map is precisely ,.

Now, R is a subgroup of the finitely-generated free abelian group of n×n matrices with integer coefficients; thus R is a finitely-generated free abelian group as well. If is any element of K we can clear denominators to find an integer d so that d is a matrix with integer entries. It follows that R contains a basis of K as a vector space over . Thus R is of the form . w1 + ... + . wn; moreover, K = . w1 + ... + . wn. Let denote the collection of all elements in K so that < , > is an integer for all in R. Finding such an is clearly equivalent to solving the system of equations

 r1 . w1, w1 + ... + rn . wn, w1 = p1 r1 . w1, wn + ... + rn . wn, wn = pn

By Cramer's rule, this requires the inversion of the matrix (wi, wj)i = 1, j = 1n, n. The determinant of this matrix is called the discriminant of the order R and is denoted by DR. Note that if v1, ..., vn is another basis for R and A is the matrix that gives the change of co-ordinates'', then the determinant of (vi, vj)i = 1, j = 1n, n differs from the earlier determinant by det(A)2. Since A and A-1 have integer entries, det(A) = ±1. Hence DR is independent of the choice of basis. Clearly, R and /R is a finite group with | DR| elements.

Now suppose R S, where S is another order (i. e. an Rg for some g). We clearly have the sequence of inclusions R S . It follows that DS divides DR; by decreasing induction we see that there is a maximal order. We also note that by duality, S/R and / have the same order, so that DR is the multiple of DS by the square of an integer. Let K be the collection of all elements of K whose characteristic polynomials have integer coefficients; one can show that this is closed under addition and multiplication. It is clear that K contains R since very matrix with integer entries has a characteristic polynomial with integer coefficients. By the above, we see that K is contained in , hence it is finitely generated; let k = . u1 + ... + . un. Let v be any non-zero column vector and consider the basis ui . v of the space of column vectors. With this change of basis, each each element of K is represented by a matrix with integer entries. Thus K is an order and the unique maximal order.

An extension of the example we looked at for fields is to associate an order with an irreducible polynomial P(T) = Tn + a1Tn - 1 + ... + an where the ai are all integers. We continue the notation of the previous subsection. It follows that is a matrix with integer coefficients; with a little effort one can also show that the natural order RP in () is precisely the collection of all integer linear combinations of the powers 1, , ..., . The discriminant of this order is also the discriminant of the polynomial P(T) and is denoted as DP. Unlike the case of fields, however, it is not true that every order has the form RP for some polynomial P(T).

Next: 6.4 Lattices and ideals Up: 6 Algebraic Number Fields Previous: 6.2 Algebraic Number Fields
Kapil Hari Paranjape 2002-10-20
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9721750617027283, "perplexity": 380.33260586474455}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2014-35/segments/1408500804220.17/warc/CC-MAIN-20140820021324-00408-ip-10-180-136-8.ec2.internal.warc.gz"}