Prime element

Last updated February 04, 2024

In mathematics, specifically in abstract algebra, a prime element of a commutative ring is an object satisfying certain properties similar to the prime numbers in the integers and to irreducible polynomials. Care should be taken to distinguish prime elements from irreducible elements, a concept that is the same in UFDs but not the same in general.

Definition

An element $p$ of a commutative ring $R$ is said to be prime if it is not the zero element or a unit and whenever $p$ divides $ab$ for some $a$ and $b$ in $R$ , then $p$ divides $a$ or $p$ divides $b$ . With this definition, Euclid's lemma is the assertion that prime numbers are prime elements in the ring of integers. Equivalently, an element $p$ is prime if, and only if, the principal ideal $(p)$ generated by $p$ is a nonzero prime ideal.^[1] (Note that in an integral domain, the ideal $(0)$ is a prime ideal, but $0$ is an exception in the definition of 'prime element'.)

Interest in prime elements comes from the fundamental theorem of arithmetic, which asserts that each nonzero integer can be written in essentially only one way as 1 or −1 multiplied by a product of positive prime numbers. This led to the study of unique factorization domains, which generalize what was just illustrated in the integers.

Being prime is relative to which ring an element is considered to be in; for example, 2 is a prime element in $Z$ but it is not in $Z [i]$ , the ring of Gaussian integers, since $2 = (1 + i)(1 - i)$ and 2 does not divide any factor on the right.

Connection with prime ideals

An ideal $I$ in the ring $R$ (with unity) is prime if the factor ring $R / I$ is an integral domain.

In an integral domain, a nonzero principal ideal is prime if and only if it is generated by a prime element.

Irreducible elements

Prime elements should not be confused with irreducible elements. In an integral domain, every prime is irreducible^[2] but the converse is not true in general. However, in unique factorization domains,^[3] or more generally in GCD domains, primes and irreducibles are the same.

Examples

The following are examples of prime elements in rings:

The integers $\pm2$ , $\pm3$ , $\pm5$ , $\pm7$ , $\pm11$ , ... in the ring of integers $Z$
the complex numbers $(1 + i)$ , $19$ , and $(2 + 3 i)$ in the ring of Gaussian integers $Z [i]$
the polynomials $x 2 - 2$ and $x 2 + 1$ in $Z [x]$ , the ring of polynomials over $Z$ .
2 in the quotient ring $Z /6 Z$
$x 2 + (x 2 + x)$ is prime but not irreducible in the ring $Q [x]/(x 2 + x)$
In the ring $Z 2$ of pairs of integers, $(1, 0)$ is prime but not irreducible (one has $(1, 0) 2 = (1, 0)$ ).
In the ring of algebraic integers $\mathbf {Z} [{\sqrt {-5}}],$ the element $3$ is irreducible but not prime (as 3 divides $9=(2+{\sqrt {-5}})(2-{\sqrt {-5}})$ and 3 does not divide any factor on the right).

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.

In mathematics, 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.

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, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. Informally, a ring is a set equipped with two binary operations satisfying properties analogous to those of addition and multiplication of integers. Ring elements may be numbers such as integers or complex numbers, but they may also be non-numerical objects such as polynomials, square matrices, functions, and power series.

In mathematics, a Noetherian ring is a ring that satisfies the ascending chain condition on left and right ideals; if the chain condition is satisfied only for left ideals or for right ideals, then the ring is said left-Noetherian or right-Noetherian respectively. That is, every increasing sequence $of left ideals has a largest element; that is, there exists an n such that:$

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 irreducible elements, uniquely up to order and units.

In algebra, an irreducible element of an integral domain is a non-zero element that is not invertible, and is not the product of two non-invertible elements.

In mathematics, a commutative ring is a ring in which the multiplication operation is commutative. The study of commutative rings is called commutative algebra. Complementarily, noncommutative algebra is the study of ring properties that are not specific to commutative rings. This distinction results from the high number of fundamental properties of commutative rings that do not extend to noncommutative rings.

In algebraic number theory, an algebraic integer is a complex number that is integral over the integers. That is, an algebraic integer is a complex root of some monic polynomial whose coefficients are integers. The set of all algebraic integers $A$ is closed under addition, subtraction and multiplication and therefore is a commutative subring of the complex numbers.

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 number theory, the ideal class group of an algebraic number field $K$ is the quotient group $J K / P K$ where $J K$ is the group of fractional ideals of the ring of integers of $K$ , and $P K$ is its subgroup of principal ideals. The class group is a measure of the extent to which unique factorization fails in the ring of integers of $K$ . The order of the group, which is finite, is called the class number of $K$ .

In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the field to which the coefficients of the polynomial and its possible factors are supposed to belong. For example, the polynomial $x 2 - 2$ is a polynomial with integer coefficients, but, as every integer is also a real number, it is also a polynomial with real coefficients. It is irreducible if it is considered as a polynomial with integer coefficients, but it factors as $if it is considered as a polynomial with real coefficients. One says that the polynomial x 2 - 2 is irreducible over the integers but not over the reals.$

Ring theory is the branch of mathematics in which rings are studied: that is, structures supporting both an addition and a multiplication operation. This is a glossary of some terms of the subject.

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.

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 .$

In algebra, Gauss's lemma, named after Carl Friedrich Gauss, is a statement about polynomials over the integers, or, more generally, over a unique factorization domain. Gauss's lemma underlies all the theory of factorization and greatest common divisors of such polynomials.

In mathematics, a Bézout domain is a form of a Prüfer domain. It is an integral domain in which the sum of two principal ideals is again a principal ideal. This means that for every pair of elements a Bézout identity holds, and that every finitely generated ideal is principal. Any principal ideal domain (PID) is a Bézout domain, but a Bézout domain need not be a Noetherian ring, so it could have non-finitely generated ideals ; if so, it is not a unique factorization domain (UFD), but still is a GCD domain. The theory of Bézout domains retains many of the properties of PIDs, without requiring the Noetherian property. Bézout domains are named after the French mathematician Étienne Bézout.

In commutative algebra, an integrally closed domainA is an integral domain whose integral closure in its field of fractions is A itself. Spelled out, this means that if x is an element of the field of fractions of A that is a root of a monic polynomial with coefficients in A, then x is itself an element of A. Many well-studied domains are integrally closed, as shown by the following chain of class inclusions:

This is a glossary of commutative algebra.

References

Notes

↑ Hungerford 1980 , Theorem III.3.4(i), as indicated in the remark below the theorem and the proof, the result holds in full generality.
↑ Hungerford 1980 , Theorem III.3.4(iii)
↑ Hungerford 1980 , Remark after Definition III.3.5

Sources

Section III.3 of Hungerford, Thomas W. (1980), Algebra, Graduate Texts in Mathematics, vol. 73 (Reprint of 1974 ed.), New York: Springer-Verlag, ISBN 978-0-387-90518-1, MR 0600654
Jacobson, Nathan (1989), Basic algebra. II (2 ed.), New York: W. H. Freeman and Company, pp. xviii+686, ISBN 0-7167-1933-9, MR 1009787
Kaplansky, Irving (1970), Commutative rings, Boston, Mass.: Allyn and Bacon Inc., pp. x+180, MR 0254021

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Hungerford 1980 , Theorem III.3.4(i), as indicated in the remark below the theorem and the proof, the result holds in full generality.

[2] Hungerford 1980 , Theorem III.3.4(iii)

[3] Hungerford 1980 , Remark after Definition III.3.5

[1]

[2]

[3]