Generalized Bol-Moufang loop varietiesnot just for breakfast! J.D. - - PowerPoint PPT Presentation

generalized bol moufang loop varieties not just for
SMART_READER_LITE
LIVE PREVIEW

Generalized Bol-Moufang loop varietiesnot just for breakfast! J.D. - - PowerPoint PPT Presentation

Generalized Bol-Moufang loop varietiesnot just for breakfast! J.D. Phillips Northern Michigan University Loops 19, Budapest, 11 July 2019 Loops 19, Budapest, 11 July 2019 1 / 15 The Six Instigator Identities Loops 19, Budapest,


slide-1
SLIDE 1

Generalized Bol-Moufang loop varieties—not just for breakfast!

J.D. Phillips Northern Michigan University

Loops ’19, Budapest, 11 July 2019

Loops ’19, Budapest, 11 July 2019 1 / 15

slide-2
SLIDE 2

The Six Instigator Identities

Loops ’19, Budapest, 11 July 2019 2 / 15

slide-3
SLIDE 3

The Six Instigator Identities z(y · zx) = (z · yz)x

Loops ’19, Budapest, 11 July 2019 2 / 15

slide-4
SLIDE 4

The Six Instigator Identities z(y · zx) = (z · yz)x x(zy · z) = (xz · y)z

Loops ’19, Budapest, 11 July 2019 2 / 15

slide-5
SLIDE 5

The Six Instigator Identities z(y · zx) = (z · yz)x x(zy · z) = (xz · y)z z(x · zy) = (zx · z)y (xz · y)z = x(z · yz) (z · xy)z = zx · yz z(xy · z) = zx · yz

Loops ’19, Budapest, 11 July 2019 2 / 15

slide-6
SLIDE 6

Commonalities

Loops ’19, Budapest, 11 July 2019 3 / 15

slide-7
SLIDE 7

Commonalities

  • 1. contain only one operation—the loop product,

Loops ’19, Budapest, 11 July 2019 3 / 15

slide-8
SLIDE 8

Commonalities

  • 1. contain only one operation—the loop product,
  • 2. exactly three distinct variables appear on each

side of the equal sign, one appearing twice on each side of the equal sign, the other two appearing once each on each side of the equal sign, and

Loops ’19, Budapest, 11 July 2019 3 / 15

slide-9
SLIDE 9

Commonalities

  • 1. contain only one operation—the loop product,
  • 2. exactly three distinct variables appear on each

side of the equal sign, one appearing twice on each side of the equal sign, the other two appearing once each on each side of the equal sign, and

  • 3. the order in which the variables appear is the

same on each side of the equal sign.

Loops ’19, Budapest, 11 July 2019 3 / 15

slide-10
SLIDE 10

Commonalities

  • 1. contain only one operation—the loop product,
  • 2. exactly three distinct variables appear on each

side of the equal sign, one appearing twice on each side of the equal sign, the other two appearing once each on each side of the equal sign, and

  • 3. the order in which the variables appear is the

same on each side of the equal sign. Bol-Moufang type

Loops ’19, Budapest, 11 July 2019 3 / 15

slide-11
SLIDE 11

Algebraic Setting

Loops ’19, Budapest, 11 July 2019 4 / 15

slide-12
SLIDE 12

Algebraic Setting 60 such identities.

Loops ’19, Budapest, 11 July 2019 4 / 15

slide-13
SLIDE 13

Algebraic Setting 60 such identities. Bol-Moufang loop variety.

Loops ’19, Budapest, 11 July 2019 4 / 15

slide-14
SLIDE 14

Algebraic Setting 60 such identities. Bol-Moufang loop variety. There are 14 such loop varieties.

Loops ’19, Budapest, 11 July 2019 4 / 15

slide-15
SLIDE 15

Algebraic Setting 60 such identities. Bol-Moufang loop variety. There are 14 such loop varieties. Ferenc Fenyves.

Loops ’19, Budapest, 11 July 2019 4 / 15

slide-16
SLIDE 16

A bit more generally

Loops ’19, Budapest, 11 July 2019 5 / 15

slide-17
SLIDE 17

A bit more generally CML: xx · yz = xy · xz

Loops ’19, Budapest, 11 July 2019 5 / 15

slide-18
SLIDE 18

A bit more generally CML: xx · yz = xy · xz Left Cheban: x(xy · z) = yx · xz

Loops ’19, Budapest, 11 July 2019 5 / 15

slide-19
SLIDE 19

A bit more generally CML: xx · yz = xy · xz Left Cheban: x(xy · z) = yx · xz Right Cheban: zx · xy = (z · yx)x

Loops ’19, Budapest, 11 July 2019 5 / 15

slide-20
SLIDE 20

A bit more generally CML: xx · yz = xy · xz Left Cheban: x(xy · z) = yx · xz Right Cheban: zx · xy = (z · yx)x Cheban: x(xy · z) = (y · zx)x

Loops ’19, Budapest, 11 July 2019 5 / 15

slide-21
SLIDE 21

Commonalities

Loops ’19, Budapest, 11 July 2019 6 / 15

slide-22
SLIDE 22

Commonalities

  • 1. contain only one operation—the loop product,

and

  • 2. exactly three distinct variables appear on each

side of the equal sign, one appearing twice on each side of the equal sign, the other two appearing once each on each side of the equal sign.

Loops ’19, Budapest, 11 July 2019 6 / 15

slide-23
SLIDE 23

Commonalities

  • 1. contain only one operation—the loop product,

and

  • 2. exactly three distinct variables appear on each

side of the equal sign, one appearing twice on each side of the equal sign, the other two appearing once each on each side of the equal sign. Generalized Bol-Moufang type.

Loops ’19, Budapest, 11 July 2019 6 / 15

slide-24
SLIDE 24

Commonalities

  • 1. contain only one operation—the loop product,

and

  • 2. exactly three distinct variables appear on each

side of the equal sign, one appearing twice on each side of the equal sign, the other two appearing once each on each side of the equal sign. Generalized Bol-Moufang type. 1215 such identities.

Loops ’19, Budapest, 11 July 2019 6 / 15

slide-25
SLIDE 25

Commonalities

  • 1. contain only one operation—the loop product,

and

  • 2. exactly three distinct variables appear on each

side of the equal sign, one appearing twice on each side of the equal sign, the other two appearing once each on each side of the equal sign. Generalized Bol-Moufang type. 1215 such identities. Generalized Bol-Moufang loop variety.

Loops ’19, Budapest, 11 July 2019 6 / 15

slide-26
SLIDE 26

Mea Culpa

Loops ’19, Budapest, 11 July 2019 7 / 15

slide-27
SLIDE 27

Mea Culpa

Loops ’19, Budapest, 11 July 2019 7 / 15

slide-28
SLIDE 28

Varieties

Loops ’19, Budapest, 11 July 2019 8 / 15

slide-29
SLIDE 29

Varieties Generalized Bol-Moufang type:

  • 1. contains only one operation—the loop product,
  • 2. exactly three distinct variables appearing on

each side of the equal sign, one appearing twice

  • n each side of the equal sign, the other two

appearing once each on each side of the equal sign. 1215 such identities. Generalized Bol-Moufang loop variety.

Loops ’19, Budapest, 11 July 2019 8 / 15

slide-30
SLIDE 30

Varieties Generalized Bol-Moufang type:

  • 1. contains only one operation—the loop product,
  • 2. exactly three distinct variables appearing on

each side of the equal sign, one appearing twice

  • n each side of the equal sign, the other two

appearing once each on each side of the equal sign. 1215 such identities. Generalized Bol-Moufang loop variety. There are 48 such varieties of loops.

Loops ’19, Budapest, 11 July 2019 8 / 15

slide-31
SLIDE 31

Winnow it Down

Loops ’19, Budapest, 11 July 2019 9 / 15

slide-32
SLIDE 32

Winnow it Down

Subtract the 14 B-M varieties: 34 varieties remain.

Loops ’19, Budapest, 11 July 2019 9 / 15

slide-33
SLIDE 33

Winnow it Down

Subtract the 14 B-M varieties: 34 varieties remain. Subtract the six which are varieties of commutative loops: 28 remain.

Loops ’19, Budapest, 11 July 2019 9 / 15

slide-34
SLIDE 34

Winnow it Down

Subtract the 14 B-M varieties: 34 varieties remain. Subtract the six which are varieties of commutative loops: 28 remain. Subtract the three Cheban varieties: 25 remain.

Loops ’19, Budapest, 11 July 2019 9 / 15

slide-35
SLIDE 35

Winnow it Down

Subtract the 14 B-M varieties: 34 varieties remain. Subtract the six which are varieties of commutative loops: 28 remain. Subtract the three Cheban varieties: 25 remain. Subtract the one associative variety: 24 remain.

Loops ’19, Budapest, 11 July 2019 9 / 15

slide-36
SLIDE 36

Winnow it Down

Subtract the 14 B-M varieties: 34 varieties remain. Subtract the six which are varieties of commutative loops: 28 remain. Subtract the three Cheban varieties: 25 remain. Subtract the one associative variety: 24 remain. Subtract the six that can be described using only two variables, e.g., x · yx = y · xx: 18 remain.

Loops ’19, Budapest, 11 July 2019 9 / 15

slide-37
SLIDE 37

Winnow it Down

Subtract the 14 B-M varieties: 34 varieties remain. Subtract the six which are varieties of commutative loops: 28 remain. Subtract the three Cheban varieties: 25 remain. Subtract the one associative variety: 24 remain. Subtract the six that can be described using only two variables, e.g., x · yx = y · xx: 18 remain. Subtract the 15 varieties that have “very little” structure (e.g., flexible or alternative): 3 remain.

Loops ’19, Budapest, 11 July 2019 9 / 15

slide-38
SLIDE 38

FRUTE loops

Loops ’19, Budapest, 11 July 2019 10 / 15

slide-39
SLIDE 39

FRUTE loops (x · xy)z = (y · zx)x

Loops ’19, Budapest, 11 July 2019 10 / 15

slide-40
SLIDE 40

FRUTE loops (x · xy)z = (y · zx)x FRUTE loops are Moufang.

Loops ’19, Budapest, 11 July 2019 10 / 15

slide-41
SLIDE 41

FRUTE loops (x · xy)z = (y · zx)x FRUTE loops are Moufang. This variety is one of four generalized Bol-Moufang loop varieties that consist entirely of not necessarily associative, Moufang loops.

Loops ’19, Budapest, 11 July 2019 10 / 15

slide-42
SLIDE 42

FRUTE loops (x · xy)z = (y · zx)x FRUTE loops are Moufang. This variety is one of four generalized Bol-Moufang loop varieties that consist entirely of not necessarily associative, Moufang loops. (The other three are: Moufang loops, commutative Moufang loops, extra loops.)

Loops ’19, Budapest, 11 July 2019 10 / 15

slide-43
SLIDE 43

FRUTE loops (x · xy)z = (y · zx)x FRUTE loops are Moufang. This variety is one of four generalized Bol-Moufang loop varieties that consist entirely of not necessarily associative, Moufang loops. (The other three are: Moufang loops, commutative Moufang loops, extra loops.) There are no others.

Loops ’19, Budapest, 11 July 2019 10 / 15

slide-44
SLIDE 44

FRUTE loops (x · xy)z = (y · zx)x FRUTE loops are Moufang. This variety is one of four generalized Bol-Moufang loop varieties that consist entirely of not necessarily associative, Moufang loops. (The other three are: Moufang loops, commutative Moufang loops, extra loops.) There are no others. FRUTE loops; the final (Moufang) frontier!

Loops ’19, Budapest, 11 July 2019 10 / 15

slide-45
SLIDE 45

FRUTE loop properties

Loops ’19, Budapest, 11 July 2019 11 / 15

slide-46
SLIDE 46

FRUTE loop properties More properties of FRUTE loops:

Loops ’19, Budapest, 11 July 2019 11 / 15

slide-47
SLIDE 47

FRUTE loop properties More properties of FRUTE loops:

◮ Automorphic

Loops ’19, Budapest, 11 July 2019 11 / 15

slide-48
SLIDE 48

FRUTE loop properties More properties of FRUTE loops:

◮ Automorphic ◮ Their squares are in the commutant

Loops ’19, Budapest, 11 July 2019 11 / 15

slide-49
SLIDE 49

FRUTE loop properties More properties of FRUTE loops:

◮ Automorphic ◮ Their squares are in the commutant ◮ Their cubes are nuclear

Loops ’19, Budapest, 11 July 2019 11 / 15

slide-50
SLIDE 50

FRUTE loop properties More properties of FRUTE loops:

◮ Automorphic ◮ Their squares are in the commutant ◮ Their cubes are nuclear ◮ Conjugation is automorphic

Loops ’19, Budapest, 11 July 2019 11 / 15

slide-51
SLIDE 51

FRUTE loop properties More properties of FRUTE loops:

◮ Automorphic ◮ Their squares are in the commutant ◮ Their cubes are nuclear ◮ Conjugation is automorphic ◮ Their derived subloop is a Boolean group

contained in the loop’s center

Loops ’19, Budapest, 11 July 2019 11 / 15

slide-52
SLIDE 52

Structure theorem

Loops ’19, Budapest, 11 July 2019 12 / 15

slide-53
SLIDE 53

Structure theorem

Theorem (Drapal, P., ’19)

Locally finite FRUTE loops are precisely the products O × H, where O is a commutative Moufang loop in which all elements are of odd

  • rder, and H is a 2-group such that the derived

subloop H′ is of exponent two and H′ ≤ Z(H).

Loops ’19, Budapest, 11 July 2019 12 / 15

slide-54
SLIDE 54

Left and Right C-loops

Loops ’19, Budapest, 11 July 2019 13 / 15

slide-55
SLIDE 55

Left and Right C-loops LC: xx · yz = (x · xy)z

Loops ’19, Budapest, 11 July 2019 13 / 15

slide-56
SLIDE 56

Left and Right C-loops LC: xx · yz = (x · xy)z RC: x(yz · z) = xy · zz

Loops ’19, Budapest, 11 July 2019 13 / 15

slide-57
SLIDE 57

Left and Right C-loops LC: xx · yz = (x · xy)z RC: x(yz · z) = xy · zz C: x(y · yz) = (xy · y)z

Loops ’19, Budapest, 11 July 2019 13 / 15

slide-58
SLIDE 58

Left and Right C-loops LC: xx · yz = (x · xy)z RC: x(yz · z) = xy · zz C: x(y · yz) = (xy · y)z

Theorem (Vojtˇ echovsk´ y, P. ’06)

C-loops have nuclear squares. Moreover, the modulus of a C-loop by its nucleus is a Steiner loop.

Loops ’19, Budapest, 11 July 2019 13 / 15

slide-59
SLIDE 59

The remaining two varieties

Loops ’19, Budapest, 11 July 2019 14 / 15

slide-60
SLIDE 60

The remaining two varieties C-loops with central squares have “transparent” extensions.

Loops ’19, Budapest, 11 July 2019 14 / 15

slide-61
SLIDE 61

The remaining two varieties C-loops with central squares have “transparent” extensions. (x · xy)z = (yz · x)x (subvariety of LC)

Loops ’19, Budapest, 11 July 2019 14 / 15

slide-62
SLIDE 62

The remaining two varieties C-loops with central squares have “transparent” extensions. (x · xy)z = (yz · x)x (subvariety of LC) x(x · zy) = z(yx · x) (subvariety of RC)

Loops ’19, Budapest, 11 July 2019 14 / 15

slide-63
SLIDE 63

The remaining two varieties C-loops with central squares have “transparent” extensions. (x · xy)z = (yz · x)x (subvariety of LC) x(x · zy) = z(yx · x) (subvariety of RC)

Theorem

Loops in this variety have central squares. Moreover, loops in this variety modulo their centers are Steiner loops.

Loops ’19, Budapest, 11 July 2019 14 / 15

slide-64
SLIDE 64

  • sc!

Thanks for your kind attention!

Loops ’19, Budapest, 11 July 2019 15 / 15