In abstract algebra, a monoid ring is a ring constructed from a ring and a monoid, just as a group ring is constructed from a ring and a group.
Let R be a ring and let G be a monoid. The monoid ring or monoid algebra of G over R, denoted R[G] or RG, is the set of formal sums ,
where for each and rg = 0 for all but finitely many g, equipped with coefficient-wise addition, and the multiplication in which the elements of R commute with the elements of G. More formally, R[G] is the set of functions φ: G → R such that {g : φ(g) ≠ 0} is finite, equipped with addition of functions, and with multiplication defined by
If G is a group, then R[G] is also called the group ring of G over R.
Given R and G, there is a ring homomorphism α: R → R[G] sending each r to r1 (where 1 is the identity element of G),
and a monoid homomorphism β: G → R[G] (where the latter is viewed as a monoid under multiplication) sending each g to 1g (where 1 is the multiplicative identity of R).
We have that α(r) commutes with β(g) for all r in R and g in G.
The universal property of the monoid ring states that given a ring S, a ring homomorphism α': R → S, and a monoid homomorphism β': G → S to the multiplicative monoid of S,
such that α'(r) commutes with β'(g) for all r in R and g in G, there is a unique ring homomorphism γ: R[G] → S such that composing α and β with γ produces α' and β
'.
The augmentation is the ring homomorphism η: R[G] → R defined by
The kernel of η is called the augmentation ideal. It is a free R-module with basis consisting of 1 – g for all g in G not equal to 1.
Given a ring R and the (additive) monoid of natural numbers N (or {xn} viewed multiplicatively), we obtain the ring R[{xn}] =: R[x] of polynomials over R.
The monoid Nn (with the addition) gives the polynomial ring with n variables: R[Nn] =: R[X1, ..., Xn].
If G is a semigroup, the same construction yields a semigroup ring R[G].
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.
Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a
In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. In other words, 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, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more indeterminates (traditionally also called variables) with coefficients in another ring, often a field. Often, the term "polynomial ring" refers implicitly to the special case of a polynomial ring in one indeterminate over a field. The importance of such polynomial rings relies on the high number of properties that they have in common with the ring of the integers.
In algebra, a group ring is a free module and at the same time a ring, constructed in a natural way from any given ring and any given group. As a free module, its ring of scalars is the given ring, and its basis is the set of elements of the given group. As a ring, its addition law is that of the free module and its multiplication extends "by linearity" the given group law on the basis. Less formally, a group ring is a generalization of a given group, by attaching to each element of the group a "weighting factor" from a given ring.
Let X be a finite set and let k be a commutative ring. We consider the k-algebra of the monoid of all relations on X, modulo the ideal generated by the relations factorizing through a set of cardinality strictly smaller than Card(X), called inessential rel ...
Walter de Gruyter2016
,
We classify all the simple modules for the algebra of relations on a finite set, give their dimension, and find the dimension of the Jacobson radical of the algebra. ...
We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence ...