Congruence Preserving Functions on Free Monoids
Rings and Algebras
2016-09-06 v1
Abstract
A function on an algebra is congruence preserving if, for any congruence, it maps congruent elements to congruent elements. We show that, on a free monoid generated by at least 3 letters, a function from the free monoid into itself is congruence preserving %nonmonogenic if and only if it is of the form for some finite sequence of words . We generalize this result to functions of arbitrary arity. This shows that a free monoid with at least three generators is a (noncommutative) affine complete algebra. Up to our knowledge, it is the first (nontrivial) case of a noncommutative affine complete algebra.
Keywords
Cite
@article{arxiv.1609.01144,
title = {Congruence Preserving Functions on Free Monoids},
author = {Patrick Cégielski and Serge Grigorieff and Irène Guessarian},
journal= {arXiv preprint arXiv:1609.01144},
year = {2016}
}