Graph products of residually finite monoids are residually finite
Residual finiteness is an important concept in group theory, found in structures such as direct products of finite groups, profinite groups and free groups. A group is called residually finite if, for every element \(g\in G\), there exists a finite-index normal subgroup \(N\) of \(G\) which does not contain \(g\). The authors extend this definition of residual finiteness for an arbitrary algebra, focusing on monoid structures and graph products. They prove that a graph product of monoids is residually finite if and only if each vertex monoid has this property. As a special case, they show that any free product of residually finite monoids is also residually finite.
scientific article; zbMATH DE number 7945811