In algebra, an irreducible element of an integral domain is a non-zero element that is not invertible (that is, is not a unit), and is not the product of two non-invertible elements.
The irreducible elements are the terminal elements of a factorization process; that is, they are the factors that cannot be further factorized. The irreducible factors of an element are uniquely defined, up to the multiplication by a unit, if the integral domain is a unique factorization domain. It was discovered in the 19th century that the rings of integers of some number fields are not unique factorization domains, and, therefore, that some irreducible elements can appear in some factorization of an element and not in other factorizations of the same element. The ignorance of this fact is the main error in many of the wrong proofs of Fermat's Last Theorem that were given during the three centuries between Fermat's statement and Wiles's proof of Fermat's Last Theorem.
The definition can be, and usually is, extended verbatim to the elements of an arbitrary commutative ring. For a general ring , an element of is called irreducible if it is neither left-invertible nor right-invertible, and if there exists no left-invertible element together with a right-invertible element such that .
If is an integral domain, then is an irreducible element of if and only if for all , the equation implies that the ideal generated by is equal to the ideal generated by or equal to the ideal generated by . This equivalence does not hold for general commutative rings, which is why the assumption of the ring having no zero divisors is commonly made in the definition of irreducible elements.
Irreducible elements should not be confused with prime elements. (A non-zero non-unit element in a commutative ring is called prime if, whenever for some and in then or ) In an integral domain, every prime element is irreducible, but the converse is not true in general. The converse is true for unique factorization domains (or, more generally, GCD domains).
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.
En mathématiques, la théorie algébrique des nombres est la branche de la théorie des nombres utilisant des outils issus de l'algèbre. Son origine est l'étude des nombres entiers et particulièrement les équations diophantiennes. Pour en résoudre certaines, il est utile de considérer d'autres entiers, dits algébriques. Un exemple est donné par le théorème des deux carrés de Fermat utilisant les entiers de Gauss. Ces ensembles sont équipés de deux lois — une addition et une multiplication — qui vérifient les mêmes propriétés élémentaires que les entiers relatifs : on parle d'anneaux.
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 which is the same in UFDs but not the same in general. 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.
Un anneau commutatif est un anneau dans lequel la loi de multiplication est commutative. L’étude des anneaux commutatifs s’appelle l’algèbre commutative. Un anneau commutatif est un anneau (unitaire) dans lequel la loi de multiplication est commutative. Dans la mesure où les anneaux commutatifs sont des anneaux particuliers, nombre de concepts de théorie générale des anneaux conservent toute leur pertinence et leur utilité en théorie des anneaux commutatifs : ainsi ceux de morphismes d'anneaux, d'idéaux et d'anneaux quotients, de sous-anneaux, d'éléments nilpotents.
In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields define ...
A method and apparatus for efficient list decoding of Reed-Solomon error correction codes. A polynomial for a predetermined target list size combining points of an error code applied to a message and points of a received word is determined for a k dimensio ...