SemiBase
← [6, 2569][6, 2571] →

[6, 2570] finitely based

order 6not self-dualindividual proof

[6, 2570] is a semigroup with 1 idempotent. It is finitely based: 4 identities in 4 variables define its variety, which 4 other semigroups of order at most six also generate.

Cayley table

·123456
1111411
2111411
3111412
4444144
5111421
6112423

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

Structure

Smallsemi
SmallSemigroup(6, 2570)
Idempotents
1
Zero
none
Identity
none
Nilpotent
no
Commutative
no
Regular
no
Group
no
𝒥-classes
5
Rank
3, generated by {4, 5, 6}
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. xyz ≈ xzy
  2. xyz ≈ zyx
  3. x²yz ≈ t²yz
  4. x³yzt ≈ xyzt

Every basis uses at least 3 variables: the semigroup of order 7 shown below satisfies every identity of V[6, 910] in 2 variables, but not xyz ≈ yxz, which holds in V[6, 910]. 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. Found by a search among the identities of the variety in 4 variables: they hold in its generator, and Vampire derives from them a reduced form of a certified basis, so they are a basis. This rests on Vampire's proofs, not on Lean.

The semigroup of order 7 that shows the lower bound
·1234567
14475555
26555554
35455555
45555555
55555555
65545555
75555555

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[6, 910] on 2 generators, and so every identity of V[6, 910] in 2 variables, but not xyz ≈ yxz.

Fewest identities: 3 identities in 5 variables

  1. xyz ≈ xzy
  2. xyz ≈ yxz
  3. x²yztu ≈ yztu

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: 8 identities in 5 variables

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

Lean proof

Endpoint theorem: SemigroupBasis.Order6.S6_2570.representative_basis

BasisFor Order6.S6_2570.table.semigroup Order6.S6_2570.basis
Table
The theorem is about the semigroup with exactly this table.
Method
individual proof. A proof written for this semigroup or a few semigroups, outside the generated and the family proofs.
Size
Checking this class alone compiles 20 Lean files with 8,746 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_2570 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_2570 is the table, with the elements numbered 0 to 5.

Variety

[6, 2570] generates the variety V[6, 910]; 6 semigroups of order at most six generate it, and 5,377 semigroups of order at most six lie in it. The transposed table, the opposite semigroup, generates the same variety: V[6, 910] is self-dual. [6, 2570] 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, 910] in the inclusion graph, with the varieties above and below it.

Generating the same variety

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.