SemiBase
← [5, 54][5, 56] →

[5, 55] finitely based

order 5nilpotent of class 4not self-dualfamily proof

[5, 55] is a nilpotent semigroup: every product of 4 elements is equal to the zero. It is finitely based: 4 identities in 4 variables define its variety, which 150 other semigroups of order at most six also generate.

Cayley table

·12345
111111
211113
311111
411111
513132

The product of the row element and the column element, numbered as in Smallsemi. Blue: idempotents on the diagonal; grey: the zero.

Structure

Smallsemi
SmallSemigroup(5, 55)
Idempotents
1
Zero
1
Identity
none
Nilpotent
yes, of class 4
Commutative
no
Regular
no
Group
no
𝒥-classes
5
Rank
2, generated by {4, 5}
Self-dual
no: the class also stands for the opposite semigroup, with the transposed table

Identity basis

Fewest variables: 4 identities in 4 variables

  1. x²y ≈ xy²
  2. xyz ≈ xzy
  3. xyz ≈ yxz
  4. x⁴ ≈ xyzt

No basis uses fewer variables: the semigroup of order 16 shown below satisfies every identity of V[5, 55] in 3 variables, but not x⁴ ≈ xyzt, which holds in V[5, 55]. Irredundant: none of these identities follows from the others; for each, a semigroup satisfies the others but not it. Obtained from a basis certified in Lean by removing identities that follow from the others, with the prover Vampire; the equivalence rests on Vampire's proofs, not on Lean.

The semigroup of order 16 that shows the lower bound
·12345678910111213141516
15713156696696561168
2710161496966661086116
3131611126686669661056
4151412966119666656610
56966666666666666
66666666666666666
799811666666696666
86669666666666666
96666666666666666
109666666666666666
116696666666666666
1251066669666666666
136865666666666966
14116106666666669666
1561156666666666669
1686610666666666696

Found by the finite model builder of Vampire and checked by evaluation: it is associative, satisfies the rules of a complete rewriting system of the free object of V[5, 55] on 3 generators, and so every identity of V[5, 55] in 3 variables, but not x⁴ ≈ xyzt.

Basis certified in Lean: 6 identities in 4 variables

  1. x²y ≈ xyx
  2. x²y ≈ xy²
  3. x²y ≈ yx²
  4. xyz ≈ xzy
  5. xyz ≈ yxz
  6. x⁴ ≈ xyzt

Lean proof

Theorem: SemigroupBasis.CoRoots.S5_55Family.S5_55.basis_complete

BasisFor SemigroupBasis.Generated.Catalogue.S5_55.table.semigroup SemigroupBasis.CoRoots.S5_55.basis
Table
The theorem is about the semigroup with exactly this table, with the elements numbered from 0 in Lean.
Method
family proof. One basis is proved once to derive every identity of every semigroup of a family; on each table only the identities of the basis are checked, by computation.
Size
Checking this class alone compiles 11 Lean files with 6,297 lines: the endpoint theorem and everything it imports, the shared library included. All of it is shared with the proofs of other classes.
Where
In the public repository, which builds it as part of the proofs of order six.
Transpose
SemigroupBasis.CoRoots.S5_55Family.S5_55.basis_complete.oppositeReversed: the basis read backwards is a basis of the opposite semigroup, with the transposed table.
Audit
The campaign's audit of the orders one to five checked the statement of each of the 1,309 theorems, in both orientations, with the Lean kernel; for order five, a second replay by the bases-min tools read the bases back from Lean.

Variety

[5, 55] generates the variety V[5, 55]; 152 semigroups of order at most six generate it, and 5,000 semigroups of order at most six lie in it. The transposed table, the opposite semigroup, generates the same variety: V[5, 55] is self-dual. [5, 55] lies in 27 of the 681 varieties, those whose basis it satisfies.

Directly above
Directly below

V[5, 55] in the inclusion graph, with the varieties above and below it.

Generating the same variety

All 151 on the variety page

Nearby tables

Semigroups of the same order whose Smallsemi table differs from this one in one or two entries (row, column), as the tables are listed, not up to renumbering.