Principal ideal

Last updated

In mathematics, specifically ring theory, a principal ideal is an ideal in a ring that is generated by a single element of through multiplication by every element of The term also has another, similar meaning in order theory, where it refers to an (order) ideal in a poset generated by a single element which is to say the set of all elements less than or equal to in

Contents

The remainder of this article addresses the ring-theoretic concept.

Definitions

While this definition for two-sided principal ideal may seem more complicated than the others, it is necessary to ensure that the ideal remains closed under addition.[ citation needed ]

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

Examples of non-principal ideal

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

In the ring the numbers where is even form a non-principal ideal. This ideal forms a regular hexagonal lattice in the complex plane. Consider and These numbers are elements of this ideal with the same norm (two), but because the only units in the ring are and they are not associates.

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 in which every ideal is principal. Any PID is a unique factorization domain; the normal proof of unique factorization in the integers (the so-called fundamental theorem of arithmetic) holds in any PID.

Examples of principal ideal

The principal ideals in are of the form In fact, is a principal ideal domain, which can be shown as follows. Suppose where and consider the surjective homomorphisms Since is finite, for sufficiently large we have Thus which implies is always finitely generated. Since the ideal generated by any integers and is exactly by induction on the number of generators it follows that is principal.

However, all rings have principal ideals, namely, any ideal generated by exactly one element. For example, the ideal is a principal ideal of and is a principal ideal of In fact, and are principal ideals of any ring

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 to be any generator of the ideal

For a Dedekind domain we may also ask, given a non-principal ideal of whether there is some extension of such that the ideal of generated by is principal (said more loosely, becomes principal in ). 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 (i.e. the ring of integers of some number field) is contained in a larger integer ring which has the property that every ideal of becomes a principal ideal of In this theorem we may take to be the ring of integers of the Hilbert class field of ; that is, the maximal unramified abelian extension (that is, Galois extension whose Galois group is abelian) of the fraction field of and this is uniquely determined by

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

See also

Related Research Articles

In mathematics, more specifically in ring theory, a Euclidean domain is an integral domain that can be endowed with a Euclidean function which allows a suitable generalization of the Euclidean division of integers. This generalized Euclidean algorithm can be put to many of the same uses as Euclid's original algorithm in the ring of integers: in any Euclidean domain, one can apply the Euclidean algorithm to compute the greatest common divisor of any two elements. In particular, the greatest common divisor of any two elements exists and can be written as a linear combination of them. Also every ideal in a Euclidean domain is principal, which implies a suitable generalization of the fundamental theorem of arithmetic: every Euclidean domain is a unique factorization domain.

<span class="mw-page-title-main">Inner product space</span> Generalization of the dot product; used to define Hilbert spaces

In mathematics, an inner product space is a real vector space or a complex vector space with an operation called an inner product. The inner product of two vectors in the space is a scalar, often denoted with angle brackets such as in . Inner products allow formal definitions of intuitive geometric notions, such as lengths, angles, and orthogonality of vectors. Inner product spaces generalize Euclidean vector spaces, in which the inner product is the dot product or scalar product of Cartesian coordinates. Inner product spaces of infinite dimension are widely used in functional analysis. Inner product spaces over the field of complex numbers are sometimes referred to as unitary spaces. The first usage of the concept of a vector space with an inner product is due to Giuseppe Peano, in 1898.

<span class="mw-page-title-main">Integral domain</span> Commutative ring with no zero divisors other than zero

In mathematics, specifically abstract algebra, an integral domain is a nonzero commutative ring in which the product of any two nonzero elements is nonzero. Integral domains are generalizations of the ring of integers and provide a natural setting for studying divisibility. In an integral domain, every nonzero element a has the cancellation property, that is, if a ≠ 0, an equality ab = ac implies b = c.

<span class="mw-page-title-main">Prime ideal</span> Ideal in a ring which has properties similar to prime elements

In algebra, a prime ideal is a subset of a ring that shares many important properties of a prime number in the ring of integers. The prime ideals for the integers are the sets that contain all the multiples of a given prime number, together with the zero ideal.

In mathematics, a principal ideal domain, or PID, is an integral domain in which every ideal is principal, i.e., can be generated by a single element. More generally, a principal ideal ring is a nonzero commutative ring whose ideals are principal, although some authors refer to PIDs as principal rings. The distinction is that a principal ideal ring may have zero divisors whereas a principal ideal domain cannot.

In mathematics, a unique factorization domain (UFD) is a ring in which a statement analogous to the fundamental theorem of arithmetic holds. Specifically, a UFD is an integral domain in which every non-zero non-unit element can be written as a product of prime elements, uniquely up to order and units.

In mathematics, in particular abstract algebra, a graded ring is a ring such that the underlying additive group is a direct sum of abelian groups such that . The index set is usually the set of nonnegative integers or the set of integers, but can be any monoid. The direct sum decomposition is usually referred to as gradation or grading.

In abstract algebra, a Dedekind domain or Dedekind ring, named after Richard Dedekind, is an integral domain in which every nonzero proper ideal factors into a product of prime ideals. It can be shown that such a factorization is then necessarily unique up to the order of the factors. There are at least three other characterizations of Dedekind domains that are sometimes taken as the definition: see below.

In ring theory, a branch of mathematics, the radical of an ideal of a commutative ring is another ideal defined by the property that an element is in the radical if and only if some power of is in . Taking the radical of an ideal is called radicalization. A radical ideal is an ideal that is equal to its radical. The radical of a primary ideal is a prime ideal.

<span class="mw-page-title-main">Polynomial ring</span> Algebraic structure

In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates with coefficients in another ring, often a field.

<span class="mw-page-title-main">Ring of integers</span>

In mathematics, the ring of integers of an algebraic number field is the ring of all algebraic integers contained in . An algebraic integer is a root of a monic polynomial with integer coefficients: . This ring is often denoted by or . Since any integer belongs to and is an integral element of , the ring is always a subring of .

<span class="mw-page-title-main">Fractional ideal</span>

In mathematics, in particular commutative algebra, the concept of fractional ideal is introduced in the context of integral domains and is particularly fruitful in the study of Dedekind domains. In some sense, fractional ideals of an integral domain are like ideals where denominators are allowed. In contexts where fractional ideals and ordinary ring ideals are both under discussion, the latter are sometimes termed integral ideals for clarity.

In abstract algebra, a discrete valuation ring (DVR) is a principal ideal domain (PID) with exactly one non-zero maximal ideal.

In mathematics, the Lasker–Noether theorem states that every Noetherian ring is a Lasker ring, which means that every ideal can be decomposed as an intersection, called primary decomposition, of finitely many primary ideals. The theorem was first proven by Emanuel Lasker (1905) for the special case of polynomial rings and convergent power series rings, and was proven in its full generality by Emmy Noether (1921).

In mathematics, a GCD domain is an integral domain R with the property that any two elements have a greatest common divisor (GCD); i.e., there is a unique minimal principal ideal containing the ideal generated by two given elements. Equivalently, any two elements of R have a least common multiple (LCM).

In mathematics, a principal right (left) ideal ring is a ring R in which every right (left) ideal is of the form xR (Rx) for some element x of R. When this is satisfied for both left and right ideals, such as the case when R is a commutative ring, R can be called a principal ideal ring, or simply principal ring.

In commutative algebra, an element b of a commutative ring B is said to be integral overA, a subring of B, if there are n ≥ 1 and aj in A such that

In number theory, quadratic integers are a generalization of the usual integers to quadratic fields. Quadratic integers are algebraic integers of degree two, that is, solutions of equations of the form

<span class="mw-page-title-main">Noncommutative ring</span> Algebraic structure

In mathematics, a noncommutative ring is a ring whose multiplication is not commutative; that is, there exist a and b in the ring such that ab and ba are different. Equivalently, a noncommutative ring is a ring that is not a commutative ring.

In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many parts of number theory, but also in other areas. In particular, they have a significant place in cryptography. Micciancio defined a generalization of cyclic lattices as ideal lattices. They can be used in cryptosystems to decrease by a square root the number of parameters necessary to describe a lattice, making them more efficient. Ideal lattices are a new concept, but similar lattice classes have been used for a long time. For example, cyclic lattices, a special case of ideal lattices, are used in NTRUEncrypt and NTRUSign.

References