Profinite congruences and unary algebras

03/01/2020
by   J. Almeida, et al.
0

Profinite congruences on profinite algebras determining profinite quotients are difficult to describe. In particular, no constructive description is known of the least profinite congruence containing a given binary relation on the algebra. On the other hand, closed congruences and fully invariant congruences can be described constructively. In a previous paper, we conjectured that fully invariant closed congruences on a relatively free profinite algebra are always profinite. Here, we show that our conjecture fails for unary algebras and that closed congruences on relatively free profinite semigroups are not necessarily profinite. As part of our study of unary algebras, we establish an adjunction between profinite unary algebras and profinite monoids. We also show that the Polish representation of the free profinite unary algebra is faithful.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro