SemiBase
← [6, 9505][6, 9507] →

[6, 9506] finitely based

order 6self-dualother generated proof

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

Cayley table

·123456
1111156
2111156
3112156
4112256
5555561
6666615

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

Structure

Smallsemi
SmallSemigroup(6, 9506)
Idempotents
1
Zero
none
Identity
none
Nilpotent
no
Commutative
no
Regular
no
Group
no
𝒥-classes
4
Rank
3, generated by {3, 4, 5}
Self-dual
yes: anti-isomorphic to itself

Identity basis

Fewest variables: 3 identities in 3 variables

  1. x³ ≈ y³
  2. xyz ≈ zyx
  3. x⁴yz ≈ xyz

No basis uses fewer variables: the semigroup of order 7 shown below satisfies every identity of V[6, 5763] in 2 variables, but not xyz ≈ yxz, which holds in V[6, 5763]. Found by a search among the identities of the variety in 3 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
14474444
25644446
36664444
44444444
54464444
64444444
74444444

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

Fewest identities: 2 identities in 4 variables

  1. xyz ≈ yxz
  2. xyz ≈ xyzt³

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: 6 identities in 4 variables

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

Lean proof

Endpoint theorem: SemigroupBasis.Generated.Order6L3RootS3_18TargetsS4_9.S6_9506.representative_basis

BasisFor Generated.Order6L3RootS3_18TargetsS4_9.S6_9506.table.semigroup
  Generated.Order6L3RootS3_18TargetsS4_9.S6_9506.basis
Table
The theorem is about the semigroup with exactly this table.
Method
other generated proof. A machine-generated proof that builds on semigroups certified earlier: an adapter or wrapper of a transfer found by the campaign's search.
Size
Checking this class alone compiles 41 Lean files with 11,090 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_9506 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_9506 is the table, with the elements numbered 0 to 5.

Variety

[6, 9506] generates the variety V[6, 5763]; 6 semigroups of order at most six generate it, and 4,846 semigroups of order at most six lie in it. The class is self-dual, so its transpose generates the same variety. [6, 9506] 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, 5763] 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.