SemiBase
← [6, 5372][6, 5374] →

[6, 5373] finitely based

order 6not self-dualtransfer from order ≤ 5

[6, 5373] is a semigroup with 2 idempotents and a zero, 1. It is finitely based: 2 identities in 3 variables define its variety, which 297 other semigroups of order at most six also generate.

Cayley table

·123456
1111111
2111111
3111111
4111211
5111155
6111255

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(6, 5373)
Idempotents
1, 5
Zero
1
Identity
none
Nilpotent
no
Commutative
no
Regular
no
Group
no
𝒥-classes
6
Rank
3, generated by {3, 4, 6}
Self-dual
no: the class also stands for the opposite semigroup, with the transposed table

Identity basis

Fewest variables: 2 identities in 3 variables

  1. x²y ≈ yx²
  2. x²yz ≈ xyz

No basis uses fewer variables: the semigroup of order 7 shown below satisfies every identity of V[5, 199] in 2 variables, but not x²yz ≈ xyz, which holds in V[5, 199]. 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 7 that shows the lower bound
·1234567
16456665
25676666
35566666
46656666
56666666
66666666
76666666

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, 199] on 2 generators, and so every identity of V[5, 199] in 2 variables, but not x²yz ≈ xyz.

Basis certified in Lean: 8 identities in 3 variables

  1. x³ ≈ x⁴
  2. x²y ≈ xyx
  3. x²y ≈ xy²
  4. x²y ≈ yx²
  5. x³y ≈ x²y
  6. xyz ≈ xzy
  7. xyz ≈ yxz
  8. x²yz ≈ xyz

Lean proof

Endpoint theorem: SemigroupBasis.Generated.Order6FinalL5TransferV3.S6_5373.representative_basis

BasisFor Generated.Order6FinalL5TransferV3.S6_5373.table.semigroup Generated.Order6FinalL5TransferV3.S6_5373.targetBasis
Table
The theorem is about the semigroup with exactly this table.
Method
transfer from order ≤ 5. A semigroup S with a certified basis lies in the variety of this one, as a subsemigroup; S has order at most five, and this semigroup satisfies the basis of S. Then every identity of this semigroup holds in S and follows from the basis, so the basis of S is a basis here too. This is the final sweep of such transfers.
Size
Checking this class alone compiles 34 Lean files with 25,364 lines: the endpoint theorem and everything it imports, the shared library included. All of it is shared with the proofs of other classes.
Census
SemiBase.Census.S6_5373 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_5373 is the table, with the elements numbered 0 to 5.

Variety

[6, 5373] generates the variety V[5, 199]; 299 semigroups of order at most six generate it, and 5,582 semigroups of order at most six lie in it. The transposed table, the opposite semigroup, generates the same variety: V[5, 199] is self-dual. [6, 5373] lies in 143 of the 681 varieties, those whose basis it satisfies.

Directly above
Directly below

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

Generating the same variety

All 298 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.