Concept

Hopkins–Levitzki theorem

In abstract algebra, in particular ring theory, the Akizuki–Hopkins–Levitzki theorem connects the descending chain condition and ascending chain condition in modules over semiprimary rings. A ring R (with 1) is called semiprimary if R/J(R) is semisimple and J(R) is a nilpotent ideal, where J(R) denotes the Jacobson radical. The theorem states that if R is a semiprimary ring and M is an R-module, the three module conditions Noetherian, Artinian and "has a composition series" are equivalent. Without the semiprimary condition, the only true implication is that if M has a composition series, then M is both Noetherian and Artinian. The theorem takes its current form from a paper by Charles Hopkins and a paper by Jacob Levitzki, both in 1939. For this reason it is often cited as the Hopkins–Levitzki theorem. However Yasuo Akizuki is sometimes included since he proved the result for commutative rings a few years earlier, in 1935. Since it is known that right Artinian rings are semiprimary, a direct corollary of the theorem is: a right Artinian ring is also right Noetherian. The analogous statement for left Artinian rings holds as well. This is not true in general for Artinian modules, because there are examples of Artinian modules which are not Noetherian. Another direct corollary is that if R is right Artinian, then R is left Artinian if and only if it is left Noetherian. Here is the proof of the following: Let R be a semiprimary ring and M a left R-module. If M is either Artinian or Noetherian, then M has a composition series. (The converse of this is true over any ring.) Let J be the radical of R. Set . The R-module may then be viewed as an -module because J is contained in the annihilator of . Each is a semisimple -module, because is a semisimple ring. Furthermore, since J is nilpotent, only finitely many of the are nonzero. If M is Artinian (or Noetherian), then has a finite composition series. Stacking the composition series from the end to end, we obtain a composition series for M. Several generalizations and extensions of the theorem exist.

À propos de ce résultat
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.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.