Congruence modular varieties 319
Below is the chief result of P. M. Idziak, R. McKenzie [23], which will be proved in this
section.
14.2 Theorem A locally finite, congruence modular, variety has very few models if and only
if it is Abelian and polynomially equivalent to the variety of unitary modules over some finite
ring of finite representation type.
In the next two lemmas, V denotes a fixed, locally finite, congruence modular variety
with very few models. We first show that all finite algebras in V are nilpotent. Then by
Corollary 10.6, the finite algebras in V have permuting congruences. Since the free algebra
on three generators in V is finite, it follows that V has a Maltsev term. Then to prove that
V is Abelian, it suffices to show that all finite algebras in V are Abelian. Assuming that this
fails, we show by direct construction that G
V
(k) is not bounded by any polynomial function
of k, thus getting a contradiction. Our proofs will be modifications of those appearing in P.
M. Idziak, R. McKenzie [23]. As we mentioned in Section 11, all locally finite varieties with
very few models have recently been completely characterized in P. M. Idziak, R. McKenzie,
M. Valeriote [24]. Each such variety consists entirely of Abelian algebras.
Notation The following notation will be used in the next two lemmas. For any sets B ⊆ X,
and elements a, b in an algebra A, we define a member of A
X
:[a, b]
B
denotes the function
f ∈ A
X
such that f (x)=b for x ∈ B and f(x)=a for x ∈ X \B.Thenforx ∈ X,weuse
[a, b]
x
to denote [a, b]
B
with B = {x}.
14.3 Lemma Every finite algebra in V is nilpotent.
Proof Assume that this fails. By taking a quotient of a finite non-nilpotent algebra, we can
find a finite algebra A ∈Vwith a minimal congruence µ such that [1,µ]=µ.Forn>0, let
X be a set of cardinality 2
n
and let {X
i,j
:0≤ i<n,0 ≤ j<2} be a system of 2n subsets
of X so that for all x ∈ X there is a function p : {0, 1,...,n− 1}→{0, 1} such that
{x} =
i<n
X
i,p(i)
.
For example, we can take X
i,0
and X
i,1
to be B
i
and its complement, where B
0
,...,B
n−1
is
a set of generators of the Boolean algebra of all subsets of X.
Let K
n
be the subalgebra of A
X
generated by the set of all functions [a, b]
X
i,0
where a
and b are any two elements of A and 0 ≤ i ≤ n − 1. (See the note on notation above.) Thus
K
n
is generated by a set of a(a−1)n +a elements, where a = |A|.WeshallshowthatK
n
has
asetof2
n
+ 1 pairwise non-isomorphic homomorphic images. Since these are all generated
by at most a(a − 1)n + a elements, then we can conclude that G
V
(a(a − 1)n +1)≥ 2
n
.But
this conclusion is obviously incompatible with the assumption that V has very few models.
Suppose that X = {x
0
,...,x
2
n
−1
}.For0≤ i ≤ 2
n
let θ
i
be the congruence of K
n
consisting of all pairs f,g∈K
2
n
such that f (x
j
)=g(x
j
) for all 0 ≤ j<i.Thenfori<j
we have θ
j
≤ θ
i
.Weshallshowthatθ
j
<θ
i
. This will imply that |K
n
/θ
i
| < |K
n
/θ
j
| so that
the two quotient algebras are non-isomorphic, as desired.
Actually, given x ∈ X,weshallshowthatK
n
contains two distinct functions f,g such
that f (y)=g(y) for all y ∈ X \{x}.Takingx = x
i
, this certainly implies that θ
i
>θ
j
whenever i<j≤ 2
n
.