SemiBase
← [6, 11394][6, 11396] →

[6, 11395] finitely based

order 6monoidnot self-dualfamily proof

[6, 11395] is a monoid with 4 idempotents, a zero, 1 and an identity element, 3. It is finitely based: 6 identities in 4 variables define its variety, which no other semigroup of order at most six generates.

Cayley table

·123456
1111111
2112211
3123456
4124365
5125555
6126666

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

Identity basis

Fewest variables: 6 identities in 4 variables

  1. x² ≈ x⁴
  2. x³yx ≈ xyx
  3. xyx ≈ xyx³
  4. xyx²zx ≈ xyzx
  5. xyx²z² ≈ xyzx²z
  6. xyztxz ≈ xyztzx

Every basis uses at least 3 variables: [5, 107] satisfies every identity of V[6, 11395] in 2 variables, because its subsemigroups generated by 2 elements lie in V[6, 11395], but it is not in V[6, 11395]. Whether a basis in fewer than 4 variables exists is not known. A search with Vampire found neither a basis in fewer variables nor a semigroup that rules one out. 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.

Basis certified in Lean: 12 identities in 4 variables

  1. x² ≈ x⁴
  2. x³yx ≈ xyx
  3. xyx ≈ xyx³
  4. xyxy ≈ xy²x
  5. x³y² ≈ xyx²y
  6. xyxy² ≈ xy³x
  7. xyx²zx ≈ xyzx
  8. xyzxy ≈ xyzyx
  9. xyzxz ≈ xyz²x
  10. x³yzy ≈ xyx²zy
  11. xyx²z² ≈ xyzx²z
  12. xyztxz ≈ xyztzx

Lean proof

Endpoint theorem: SemigroupBasis.CoRoots.Order6Sunday.Msg0457S11395Completeness.representative_basis

BasisFor CoRoots.Order6Sunday.Msg0457S11395Semantics.table.semigroup CoRoots.Order6Sunday.Msg0457S11395Semantics.basis
Table
The theorem is about the semigroup with exactly this table.
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 73 Lean files with 21,163 lines: the endpoint theorem and everything it imports, the shared library included. Of these, 4,138 lines are used by the proof of this class and of no other.
Census
SemiBase.Census.S6_11395 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_11395 is the table, with the elements numbered 0 to 5.

Variety

[6, 11395] generates the variety V[6, 11395]; 1 semigroup of order at most six generates it, and 13,228 semigroups of order at most six lie in it. The transposed table, the opposite semigroup, generates the dual variety V[6, 11395]ᵒᵖ. [6, 11395] lies in 1 of the 681 varieties, those whose basis it satisfies.

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

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

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.