SemiBase

Names of varieties

Each variety generated by a semigroup of order at most six has a permanent name, V[n, k] or V[n, k]ᵒᵖ, made of the Smallsemi number of its least generator. This page fixes the rule once and for all, states what it guarantees, and gives the procedure to find the name of the variety of a finite semigroup.

Version 1, 30 October 2026: 685 names, fixed in names-v1.json (SHA-256 1e95a5cfc63d501aa3648b3faafba27f9b852afaa667d64fdd071338c5d14c0f).

The rule

  1. Semigroups. For each order n up to eight, the GAP package Smallsemi lists the semigroups of order n up to isomorphism and anti-isomorphism. [n, k] is its semigroup number k, with the Cayley table MultiplicationTable(SmallSemigroup(n, k)) of Smallsemi 0.7.2, in which row i and column j hold the product of the elements i and j. [n, k]ᵒᵖ is the opposite semigroup, with the transposed table. Every semigroup of order n is isomorphic to [n, k] or to [n, k]ᵒᵖ for exactly one k, and to both when [n, k] is self-dual.
  2. Triples. The triple (n, k, 0) stands for [n, k] and (n, k, 1) for [n, k]ᵒᵖ. Triples are compared by n, then by k, then by the last entry: a smaller order first, then a smaller number, then a table before its transpose.
  3. Names. A variety generated by a semigroup of order at most eight is named after the least triple (n, k, o) whose semigroup generates it: V[n, k] when o = 0, and V[n, k]ᵒᵖ when o = 1.
  4. Order of the varieties. Varieties are ordered as the triples that name them: V[1, 1], V[2, 1], V[2, 2], V[2, 3], V[2, 4], V[2, 4]ᵒᵖ, V[3, 2], and so on. The list of names below, names-v1.json and the list of varieties follow this order.

Spaces do not matter, so V[5,540] and V[5, 540] are the same name, and in plain text V[5, 540]ᵒᵖ may be written V[5,540]^op. The square brackets set these names apart from the names V(n, i) of the database of Araújo, Araújo, Cameron, Lee and Raminhos: there, too, n is the least order of a generator, but i numbers the varieties of that order in the sequence of the database. Each variety page gives both.

What the rule guarantees

Finding the name of the variety of a semigroup

Order at most six. Enter its Cayley table, one row per line: row i and column j hold the product of the elements i and j, numbered from 1, or from 0 when an entry is 0. A table copied from GAP works as it is.

The page renumbers the table and its transpose in every way, which identifies the semigroup [n, k] of Smallsemi and the triple (n, k, o), and reads off the name of its variety. In GAP, IdSmallSemigroup(S) gives [n, k]; then S is isomorphic to SmallSemigroup(n, k), and o = 0, or only to its opposite, and o = 1. The page of [n, k] and names-v1.json give the names of the varieties of both.

Larger order. The variety V(S) of a finite semigroup S has a name in version 1 when a semigroup T of order at most six generates it, that is, when S and T satisfy the same identities. The finitely based varieties of the list that contain S are those whose basis S satisfies. If V(S) is one of them, it is the least of them under inclusion; and if they have a least one, W, then V(S) = W exactly when the generator of W satisfies every identity of S. That is decidable: a semigroup of order m satisfies every identity of S once it satisfies those in m variables, and finitely many of these, read off the free semigroup of V(S) on m generators (the functions from Sm to S that words define), imply all the others. If none of the 681 is V(S), it can still be one of the four varieties without a finite basis, V(N) for N one of L, B₂¹, A₂ᵍ and A₂¹: V(S) = V(N) exactly when each of S and N satisfies every identity of the other, which the same test decides. Otherwise no semigroup of order at most six generates V(S), and version 1 does not name it.

The names of version 1

685 names: the 681 varieties with a finite basis, which the list of varieties shows with their bases, and the four without one, V[6, 3843] of L, V[6, 8564] of B₂¹, V[6, 8878] of A₂ᵍ and V[6, 13747] of A₂¹. By generator order: 1 of order one, 5 of order two, 14 of order three, 53 of order four, 147 of order five, 465 of order six. 145 are self-dual and the other 540 form 270 dual pairs.

names-v1.json fixes them, in their order: for each name the triple and the table of its generator, its dual and whether it has a finite basis; the names of the varieties of every semigroup of order at most six and of its transpose; and the names of the first release that they replace.

Generator order one: 1

Generator order two: 5

Generator order three: 14

Generator order four: 53

Generator order five: 147

Generator order six: 465

Show all 465

How the names were found and checked

Every finitely based semigroup of order at most six has a basis certified in Lean, so a semigroup lies in its variety exactly when it satisfies that basis, and two semigroups generate the same variety exactly when each satisfies the basis of the other. Evaluating the bases in the 30,767 semigroups of order at most six, counted up to isomorphism, so that a semigroup and its opposite count twice unless they are isomorphic, gives the variety of each, and so the least triple of each variety. check_data.py repeats this by evaluation, independently of the satisfaction rows from which the site is built: each semigroup satisfies the basis of the generator of its variety, that generator satisfies the basis of the semigroup, and the 681 varieties are pairwise distinct.

Each of the four semigroups without a finite basis is self-dual, and the variety it generates has no finite basis, so it is none of the 681. Three identities tell the four apart, so each of them is the only semigroup of order at most six that generates its variety:

IdentityLB₂¹A₂ᵍA₂¹
x² ≈ x³holdsholdsfailsholds
xyx ≈ x²yxholdsfailsfailsfails
x²y² ≈ xy²xfailsholdsfailsfails

How the names stay fixed

Citing a name

For example: the variety V[5, 540] of SemiBase (names of varieties, version 1, 30 October 2026, https://nasqret.github.io/semibase-site/names.html).