SemiBase
← [6, 11551][6, 11553] →

[6, 11552] finitely based

monoidnot self-dualfamily proof

[6, 11552] is a monoid with 4 idempotents and an identity element, 3. It is finitely based: 7 identities define its variety, which no other semigroup of order six generates.

Cayley table

·123456
1111111
2112215
3123456
4124356
5555555
6666666

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

Structure

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

Identity basis

Shortest known basis: 7 identities reduced

  1. x² ≈ x⁴
  2. x³y ≈ x²yx
  3. xyx ≈ xyx³
  4. xyxy ≈ xy²x
  5. xyzxy ≈ xyzyx
  6. xyzxz ≈ xyz²x
  7. xyztxz ≈ xyztzx

Reduced as far as the search went: some identity may still follow from the others. 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. Shortest known, not known to be minimal.

Basis certified in Lean: 8 identities

  1. x² ≈ x⁴
  2. x³y ≈ x²yx
  3. xyx ≈ xyx³
  4. xyxy ≈ xy²x
  5. xyx²z ≈ xyxzx
  6. xyzxy ≈ xyzyx
  7. xyzxz ≈ xyz²x
  8. xyztxz ≈ xyztzx

Lean proof

Endpoint theorem: SemigroupBasis.CoRoots.Order6LeeLiCondition8JoinRoots.S6_11552.packetBasisFor

BasisFor CoRoots.Order6LeeLiCondition8JoinRoots.S6_11552.packetTable.semigroup CoRoots.Order6LeeLiCondition8Join.basis
Table
The theorem is about the opposite semigroup, with the transposed table; read backwards, its basis is the basis of this table shown above.
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 36 Lean files with 16,658 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_11552 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_11552 is the table, with the elements numbered 0 to 5.

Variety

[6, 11552] generates the variety V[11552]; no other semigroup of order six generates it, and 5,135 semigroups of order six lie in it. [6, 11552] lies in 1 of the 505 varieties of the census, those whose basis it satisfies.

Directly above
none: a maximal variety of the census
Directly below

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

Nearby tables

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