The Setting
Take a finite group and a subgroup of it, normal or not, and let be the set of left cosets . The group acts on by , and reading each element as a unary operation turns into a unary algebra. Each subgroup with groups the cosets of into the cosets of . The question is how the congruences of this algebra compare with the subgroups lying between and .
The Coset Algebra
A finite algebra on a set is the set with a finite list of total operations on it, each of finite arity; constants, of arity zero, are allowed, and so is the empty list.✦
An equivalence relation on is compatible with when every operation of , applied to two tuples whose entries are -related coordinatewise, gives -related elements.✦ A congruence of is an equivalence relation on compatible with , and the congruence lattice of is the set of its congruences, ordered by inclusion of relations.✦
The coset algebra is the finite algebra on with one unary operation for each element of , the action of : (1)✦
Subgroups and Congruences
The interval is the set of subgroups of with , ordered by inclusion.
For a congruence of , the subgroup of attached to is the set of elements of that carry the identity coset to a coset related to it by : (2)✦
For a subgroup in , the projection is the map ✦, and the congruence of attached to is its kernel: (3)✦
The Claim
Theorem 1. Let be a finite group and a subgroup of , normal or not. An equivalence relation on is a congruence of if and only if every element of preserves it: (4)✦ The map is an order isomorphism of onto with inverse : for all congruences , of and every in , (5)✦ In particular, the congruence lattice of is order isomorphic to the interval of subgroups between and : (6)✦
In the paper, the result reads: for finite groups , the full congruence lattice of the unary algebra given by the left action of on is isomorphic to .
What Is Checked
The claims (4), (5) and (6) are stated over a finite group and an arbitrary subgroup , for the coset algebra with the operations (1), its congruence lattice of compatible equivalence relations ordered by inclusion, the interval , and the two maps of (2) and of (3).
The library proves, for every congruence of , that is a subgroup of containing , and, for every in , that is a congruence of .