Green's relations

In mathematics, Green's relations are five equivalence relations that characterise the elements of a semigroup in terms of the principal ideals they generate. The relations are named for James Alexander Green, who introduced them in a paper of 1951. John Mackintosh Howie, a prominent semigroup theorist, described this work as "so all-pervading that, on encountering a new semigroup, almost the first question one asks is 'What are the Green relations like?'" (Howie 2002). The relations are useful for understanding the nature of divisibility in a semigroup; they are also valid for groups, but in this case tell us nothing useful, because groups always have divisibility. Instead of working directly with a semigroup S, it is convenient to define Green's relations over the monoid S1. (S1 is "S with an identity adjoined if necessary"; if S is not already a monoid, a new element is adjoined and defined to be an identity.) This ensures that principal ideals generated by some semigroup element do indeed contain that element. For an element a of S, the relevant ideals are: The principal left ideal generated by a: . This is the same as , which is . The principal right ideal generated by a: , or equivalently . The principal two-sided ideal generated by a: , or . For elements a and b of S, Green's relations L, R and J are defined by a L b if and only if S1 a = S1 b. a R b if and only if a S1 = b S1. a J b if and only if S1 a S1 = S1 b S1. That is, a and b are L-related if they generate the same left ideal; R-related if they generate the same right ideal; and J-related if they generate the same two-sided ideal. These are equivalence relations on S, so each of them yields a partition of S into equivalence classes. The L-class of a is denoted La (and similarly for the other relations). The L-classes and R-classes can be equivalently understood as the strongly connected components of the left and right Cayley graphs of S1. Further, the L, R, and J relations define three preorders ≤L, ≤R, and ≤J, where a ≤J b holds for two elements a and b of S if the ideal generated by a is included in that of b, i.

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.

Related concepts (7)

Related lectures (11)

Green's relations

Transformation semigroup

In algebra, a transformation semigroup (or composition semigroup) is a collection of transformations (functions from a set to itself) that is closed under function composition. If it includes the identity function, it is a monoid, called a transformation (or composition) monoid. This is the semigroup analogue of a permutation group. A transformation semigroup of a set has a tautological semigroup action on that set. Such actions are characterized by being faithful, i.e., if two elements of the semigroup have the same action, then they are equal.

Special classes of semigroups

In mathematics, a semigroup is a nonempty set together with an associative binary operation. A special class of semigroups is a class of semigroups satisfying additional properties or conditions. Thus the class of commutative semigroups consists of all those semigroups in which the binary operation satisfies the commutativity property that ab = ba for all elements a and b in the semigroup. The class of finite semigroups consists of those semigroups for which the underlying set has finite cardinality.

Quotients of Groups by Relations of Equivalence MATH-113: Algebraic structures

Explores quotients of groups by equivalence relations and the conditions for well-defined sets.

Lagrange Theorem: Equivalence Relations COM-102: Advanced information, computation, communication II

Explores Lagrange's theorem in commutative groups and the concept of equivalence relations, demonstrating their practical applications.

Number Theory: Operations and Equivalence MATH-101(d): Analysis I

Covers operations and equivalence relations in number theory, including addition, subtraction, multiplication, division, and properties of neutral and inverse elements.