Binary relations between binary operations
Loading...
Date
2021
Authors
Bilyi, Illia
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Let Bin(X) be a collection of all groupoids on some non-empty set X. De ne the operation : Bin2(X) ! Bin(X) so that x( )y = (x y) (y x) for all x; y 2 X and (X; ); (X; ) 2 Bin(X). Let lz denote left-zero operation (8x; y 2 X : x lz y = x) on X. Then, (X; lz) is an identity of (Bin(X); ). Similarly, de ne right-zero rz 2 Bin(X) (8x; y 2 X : x rz y = y). We consider the center of (Bin(X); ) and represent its elements as graphs. Furthermore, we investigate distributivity from the left in Bin(X) and its
interaction with -product. We show that the only operation that is left- distributive over all possible 2 Bin(X) is rz 2 Bin(X) and that any 2 Bin(X) is left-distributive over lz; rz 2 Bin(X).
Description
Keywords
Groupoid, Bin(X), left-distributivity, graph of groupoid, bachelor's thesis