In mathematics, an order in the sense of ring theory is a subring of a ring , such that
is a finite-dimensional algebra over the field of rational numbers
spans over , and
is a -lattice in .
The last two conditions can be stated in less formal terms: Additively, is a free abelian group generated by a basis for over .
More generally for an integral domain contained in a field , we define to be an -order in a -algebra if it is a subring of which is a full -lattice.
When is not a commutative ring, the idea of order is still important, but the phenomena are different. For example, the Hurwitz quaternions form a maximal order in the quaternions with rational co-ordinates; they are not the quaternions with integer coordinates in the most obvious sense. Maximal orders exist in general, but need not be unique: there is in general no largest order, but a number of maximal orders. An important class of examples is that of integral group rings.
Some examples of orders are:
If is the matrix ring over , then the matrix ring over is an -order in
If is an integral domain and a finite separable extension of , then the integral closure of in is an -order in .
If in is an integral element over , then the polynomial ring is an -order in the algebra
If is the group ring of a finite group , then is an -order on
A fundamental property of -orders is that every element of an -order is integral over .
If the integral closure of in is an -order then this result shows that must be the maximal -order in . However this hypothesis is not always satisfied: indeed need not even be a ring, and even if is a ring (for example, when is commutative) then need not be an -lattice.
The leading example is the case where is a number field and is its ring of integers. In algebraic number theory there are examples for any other than the rational field of proper subrings of the ring of integers that are also orders. For example, in the field extension of Gaussian rationals over , the integral closure of is the ring of Gaussian integers and so this is the unique maximal -order: all other orders in are contained in it.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In mathematics, the interplay between the Galois group G of a Galois extension L of a number field K, and the way the prime ideals P of the ring of integers OK factorise as products of prime ideals of OL, provides one of the richest parts of algebraic number theory. The splitting of prime ideals in Galois extensions is sometimes attributed to David Hilbert by calling it Hilbert theory. There is a geometric analogue, for ramified coverings of Riemann surfaces, which is simpler in that only one kind of subgroup of G need be considered, rather than two.
In mathematics, an algebraic number field (or simply number field) is an extension field of the field of rational numbers such that the field extension has finite degree (and hence is an algebraic field extension). Thus is a field that contains and has finite dimension when considered as a vector space over . The study of algebraic number fields, and, more generally, of algebraic extensions of the field of rational numbers, is the central topic of algebraic number theory.
In mathematics, complex multiplication (CM) is the theory of elliptic curves E that have an endomorphism ring larger than the integers. Put another way, it contains the theory of elliptic functions with extra symmetries, such as are visible when the period lattice is the Gaussian integer lattice or Eisenstein integer lattice. It has an aspect belonging to the theory of special functions, because such elliptic functions, or abelian functions of several complex variables, are then 'very special' functions satisfying extra identities and taking explicitly calculable special values at particular points.
Inversion in Galois Fields is a famous primitive permutation for designing cryptographic algorithms e.g. for Rijndael because it has suitable differential and linear properties. Inputs and outputs are usually transformed by addition (e.g. XOR) to key bits. ...
This work concerns the study of Euclidean minima of maximal orders in central simple algebras. In the first part, we define the concept of ideal lattice in the non-commutative case. Let A be a semi-simple algebra over Q. An ideal lattice over A is a triple ...