Concept

Epigroup

In abstract algebra, an epigroup is a semigroup in which every element has a power that belongs to a subgroup. Formally, for all x in a semigroup S, there exists a positive integer n and a subgroup G of S such that xn belongs to G. Epigroups are known by wide variety of other names, including quasi-periodic semigroup, group-bound semigroup, completely π-regular semigroup, strongly π-regular semigroup (sπr), or just π-regular semigroup (although the latter is ambiguous). More generally, in an arbitrary semigroup an element is called group-bound if it has a power that belongs to a subgroup. Epigroups have applications to ring theory. Many of their properties are studied in this context. Epigroups were first studied by Douglas Munn in 1961, who called them pseudoinvertible. Epigroups are a generalization of periodic semigroups, thus all finite semigroups are also epigroups. The class of epigroups also contains all completely regular semigroups and all completely 0-simple semigroups. All epigroups are also eventually regular semigroups. (also known as π-regular semigroups) A cancellative epigroup is a group. Green's relations D and J coincide for any epigroup. If S is an epigroup, any regular subsemigroup of S is also an epigroup. In an epigroup the Nambooripad order (as extended by P.R. Jones) and the natural partial order (of Mitsch) coincide. The semigroup of all square matrices of a given size over a division ring is an epigroup. The multiplicative semigroup of every semisimple Artinian ring is an epigroup. Any algebraic semigroup is an epigroup. By analogy with periodic semigroups, an epigroup S is partitioned in classes given by its idempotents, which act as identities for each subgroup. For each idempotent e of S, the set: is called a unipotency class (whereas for periodic semigroups the usual name is torsion class.) Subsemigroups of an epigroup need not be epigroups, but if they are, then they are called subepigroups. If an epigroup S has a partition in unipotent subepigroups (i.e.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.