Principal ideal

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

Lua error in package.lua at line 80: module 'strict' not found.

A principal ideal is an ideal I in a ring R that is generated by a single element a of R through multiplication by every element of R.

Definitions

  • a left principal ideal of R is a subset of R of the form Ra = {ra : r in R};
  • a right principal ideal is a subset of the form aR = {ar : r in R};
  • a two-sided principal ideal is a subset of the form RaR = {r1as1 + ... + rnasn : r1,s1,...,rn,sn in R}.

If R is a commutative ring, then the above three notions are all the same. In that case, it is common to write the ideal generated by a as ⟨a⟩.

Examples of non-principal ideal

Not all ideals are principal. For example, consider the commutative ring C[x,y] of all polynomials in two variables x and y, with complex coefficients. The ideal ⟨x,y⟩ generated by x and y, which consists of all the polynomials in C[x,y] that have zero for the constant term, is not principal. To see this, suppose that p were a generator for ⟨x,y⟩; then x and y would both be divisible by p, which is impossible unless p is a nonzero constant. But zero is the only constant in ⟨x,y⟩, so we have a contradiction.

In the ring Z[\sqrt{-3}] = \{a + b\sqrt{-3}: a, b\in Z \}, numbers in which a + b is even form a non-principal ideal. This ideal forms a regular hexagonal lattice in the complex plane. Consider (a,b) = (2,0) and (1,1). These numbers are elements of this ideal with the same norm (2), but because the only units in the ring are 1 and -1, they are not associates.

Related definitions

A ring in which every ideal is principal is called principal, or a principal ideal ring. A principal ideal domain (PID) is an integral domain that is principal. Any PID must be a unique factorization domain; the normal proof of unique factorization in the integers (the so-called fundamental theorem of arithmetic) holds in any PID.

Properties

Any Euclidean domain is a PID; the algorithm used to calculate greatest common divisors may be used to find a generator of any ideal. More generally, any two principal ideals in a commutative ring have a greatest common divisor in the sense of ideal multiplication. In principal ideal domains, this allows us to calculate greatest common divisors of elements of the ring, up to multiplication by a unit; we define gcd(a,b) to be any generator of the ideal ⟨a,b⟩.

For a Dedekind domain R, we may also ask, given a non-principal ideal I of R, whether there is some extension S of R such that the ideal of S generated by I is principal (said more loosely, I becomes principal in S). This question arose in connection with the study of rings of algebraic integers (which are examples of Dedekind domains) in number theory, and led to the development of class field theory by Teiji Takagi, Emil Artin, David Hilbert, and many others.

The principal ideal theorem of class field theory states that every integer ring R (i.e. the ring of integers of some number field) is contained in a larger integer ring S which has the property that every ideal of R becomes a principal ideal of S. In this theorem we may take S to be the ring of integers of the Hilbert class field of R; that is, the maximal unramified abelian extension (that is, Galois extension whose Galois group is abelian) of the fraction field of R, and this is uniquely determined by R.

Krull's principal ideal theorem states that if R is a Noetherian ring and I is a principal, proper ideal of R, then I has height at most one.

See also

References

  • Lua error in package.lua at line 80: module 'strict' not found.