A parastrophic equivalence in quasigroups. 1. Introduction

Similar documents
Transversals in loops. 1. Elementary properties. 1. Introduction

Quasigroups and Related Systems 9 (2002), Galina B. Belyavskaya. Abstract

Realizations of Loops and Groups defined by short identities

Semigroup, monoid and group models of groupoid identities. 1. Introduction

Homework Solution #1. Chapter 2 2.6, 2.17, 2.24, 2.30, 2.39, 2.42, Grading policy is as follows: - Total 100

arxiv: v1 [math.ra] 25 May 2013

Quasigroups and Related Systems 8 (2001), Hee Kon Park and Hee Sik Kim. Abstract. 1. Introduction

On Middle Universal Weak and Cross Inverse Property Loops With Equal Length Of Inverse Cycles

Cheban loops. 1 Introduction

ON RESTRICTED SYSTEMS OF HIGHER INDETERMINATE EQUATIONS * E. T. BELL

PALINDROMIC AND SŪDOKU QUASIGROUPS

ON DIVISION ALGEBRAS*

Homework 1/Solutions. Graded Exercises

The Essentially Equational Theory of Horn Classes

Some isotopy-isomorphy conditions for m-inverse quasigroups and loops

A GRAPH-THEORETIC APPROACH TO QUASIGROUP CYCLE NUMBERS

On groupoids with identity x(xy) = y

satisfying ( i ; j ) = ij Here ij = if i = j and 0 otherwise The idea to use lattices is the following Suppose we are given a lattice L and a point ~x

Basic Properties Of Second Smarandache Bol Loops

G METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE

On Middle Universal m-inverse Quasigroups And Their Applications To Cryptography

Pacific Journal of Mathematics

Algebraic Expressions and Identities

Special graphs and quasigroup functional equations

Octonions. Robert A. Wilson. 24/11/08, QMUL, Pure Mathematics Seminar

[3] (b) Find a reduced row-echelon matrix row-equivalent to ,1 2 2

BINARY REPRESENTATIONS OF ALGEBRAS WITH AT MOST TWO BINARY OPERATIONS. A CAYLEY THEOREM FOR DISTRIBUTIVE LATTICES

An holomorphic study of Smarandache automorphic and cross inverse property loops

MECH 5312 Solid Mechanics II. Dr. Calvin M. Stewart Department of Mechanical Engineering The University of Texas at El Paso

Seul Lee, Dong-Soo Kim and Hyeon Park

STABLE MODULE THEORY WITH KERNELS

Mutual Information for Stochastic Differential Equations*

The Adjoint Action of a Homotopy-associative H-space on its Loop Space.

On orthogonality of binary operations and squares

Standard Koszul standardly stratied algebras

On A Cryptographic Identity In Osborn Loops

Prime and Semiprime Bi-ideals in Ordered Semigroups

ON THE CONJUGACY PROBLEM AND GREENDLINGER'S EIGHTH-GROUPS

BURGESS INEQUALITY IN F p 2. Mei-Chu Chang

Left almost semigroups dened by a free algebra. 1. Introduction

Conservation laws for the geodesic equations of the canonical connection on Lie groups in dimensions two and three

Shifting Lemma and shifting lattice identities

On the uniform summability of multiple Walsh- Fourier series

Characters and triangle generation of the simple Mathieu group M 11

Algebraic Expressions

Introduction to Association Schemes

On R-Strong Jordan Ideals

Definitions and Properties of R N

Quasigroups and Related Systems 14 (2006), Kenneth W. Johnson. Abstract. 1. Introduction

Techinical Proofs for Nonlinear Learning using Local Coordinate Coding

STABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin

SOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM

Polynomials of small degree evaluated on matrices

C -algebras generated by mappings with an inverse semigroup of monomials

Kirsten Lackner Solberg. Dept. of Math. and Computer Science. Odense University, Denmark

On the centralizer and the commutator subgroup of an automorphism

Algebras inspired by the equivalential calculus

On the classication of algebras

Resistance to Statistical Attacks of Parastrophic Quasigroup Transformation

Two questions on semigroup laws

Course 2BA1: Hilary Term 2007 Section 8: Quaternions and Rotations

De Nugis Groebnerialium 5: Noether, Macaulay, Jordan

Simple Proofs of Feuerbach s Theorem and Emelyanov s Theorem

SCTT The pqr-method august 2016

Conjugate Loops: An Introduction

Work - kinetic energy theorem for rotational motion *

Identities for algebras obtained from the Cayley- Dickson process

ON (m, n) JORDAN CENTRALIZERS IN RINGS AND ALGEBRAS. Joso Vukman University of Maribor, Slovenia

A characterization of finite soluble groups by laws in two variables

Rigid body simulation. Once we consider an object with spatial extent, particle system simulation is no longer sufficient

IDEMPOTENT ELEMENTS OF THE ENDOMORPHISM SEMIRING OF A FINITE CHAIN

P -adic root separation for quadratic and cubic polynomials

Counting and Constructing Minimal Spanning Trees. Perrin Wright. Department of Mathematics. Florida State University. Tallahassee, FL

Belousov s Theorem and the quantum Yang-Baxter equation

BY MolmS NEWMAN (1011) (11

Classical Mechanics. Luis Anchordoqui

Simple ternary semigroups. 1. Introduction

370 Y. B. Jun generate an LI-ideal by both an LI-ideal and an element. We dene a prime LI-ideal, and give an equivalent condition for a proper LI-idea

CLOSURE OPERATORS ON COMPLETE ALMOST DISTRIBUTIVE LATTICES-III

On the structure of maximal non-finitely generated ideals of ring and Cohen s theorem

Normal Automorphisms of Free Burnside Groups of Period 3

Mathematica Slovaca. Ján Jakubík On the α-completeness of pseudo MV-algebras. Terms of use: Persistent URL:

Z n -GRADED POLYNOMIAL IDENTITIES OF THE FULL MATRIX ALGEBRA OF ORDER n

Canonical inner products on C (n) and M(n,K)

On quasi-contractions in metric spaces with a graph

Iterative Convex Optimization Algorithms; Part One: Using the Baillon Haddad Theorem

On Mikheev s construction of enveloping groups

An efficient implementation of gradient and Hessian calculations of the coefficients of the characteristic polynomial of I XY

Topological groups with dense compactly generated subgroups

arxiv: v2 [math.rt] 3 Mar 2014

ON STRUCTURE OF KS-SEMIGROUPS

arxiv: v1 [math.rt] 14 Nov 2007

On the connectivity of the direct product of graphs

SOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS

17 Galois Fields Introduction Primitive Elements Roots of Polynomials... 8

GENERALIZED TWISTED FIELDS

Strongly Nil -Clean Rings

D-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.

MATH443 PARTIAL DIFFERENTIAL EQUATIONS Second Midterm Exam-Solutions. December 6, 2017, Wednesday 10:40-12:30, SA-Z02

A Note on the Real Division Algebras with Non-trivial Derivations

Transcription:

Quasigroups and Related Systems 7 (2000), 7 14 A parastrophic equivalence in quasigroups Ján Duplák Abstract In this paper there are found of "lowest" representants of classes of a parastrophic equivalence in quasigroups satisfying identities of the type w 1 1 (w 2 2... (w n n x))) x, 1 < n, where i is a parastrophe of 1 for all i n and w 1,..., w n are terms in Q( ) and its parastrophes that not contain variable x. These representants are listed for 1 < n < 5 by a personal computer. 1. Introduction With any given quasigroup (Q, ) there are associated ve operations, /, \,, (see the following part 1) that we shall call conjugates of ( ) (see [1], [4]) or parastrophes of ( ) (see [3]). If a quasigroup (Q, ) satises a given identity, say I, then in general, for example (Q, /) will satisfy a dierent conjugate identity, say II. Therefore it is in some sense true that the theory of quasigroups that satisfy the identity I is equivalent to the theory of quasigroups which satisfy the identity II, as has been remarked by Stein in [4]. In [3], Sade has given some general rules for determining the identities satised by the parastrophes of a quasigroup (Q, ) when (Q, ) satises a given identity involving some elements of the set ( ) = {,, /,, \, }. In [4], Stein has listed the conjugate identities for a 2000 Mathematics Subject Classication: 20N15 Keywords: quasigroup, parastrophic equivalence

8 J. Duplák number well-known identities. More extensive list is given in Belousov [1]. With respect to a parastrophic equivalence, Belousov in [2] has given a classication of all quasigroups identities which are of the type x 1 ( x 2 (x 3 y) ) y, where i ( ) for all i = 1, 2, 3. In this paper we give a generalization and a simplication of methods used in [2]. 2. Preliminaries Let (Q, ) be a xed quasigroup, T = {L, R, T, L 1, R 1, T 1 }, and ( ) = {,, /,,\, }, where x y = z y x = z z/y = x y z = x x \ z = y z x = y. Further, let L a x = a x, R a x = x a, L / ax = a/x, Ra x = x a, T a x = x \ a, L a L 1 a x = x,... Then it holds the relations given by Table 1. This table we read like this: L = R 1, (R 1 ) \ = T 1,..., ϕ 2 (R 1 ) = ϕ 2 R 1 = (R 1 ) / = R, ϕ 5 R = L 1, Ra 1 = (R a ) 1, Ta 1 = (T a ) 1. Table 1 / \ L L R T 1 R 1 L 1 T R R L R 1 T 1 T L 1 T T T 1 L 1 L R R 1 L 1 L 1 R 1 T R L T 1 R 1 R 1 L 1 R T T 1 L T 1 T 1 T L L 1 R 1 R ϕ 0 ϕ 1 ϕ 2 ϕ 3 ϕ 4 ϕ 5 From this table directly follows that (ϕ i x) 1 = ϕ i (x 1 ) for all i {0, 1,..., 5} and for all x T. If (Q, ) is a quasigroup, then the mappings L a, R a,..., (Ta 1 ) are called translations of. Every operation in ( ) is named a parastrophe of ( ).

A parastrophic equivalence in quasigroups 9 If a quasigroup (Q, ) satises a given identity, for example y (x \ yz)/zx, (1) then in general each of its parastrophes will satisfy a dierent conjugate identities. Thus, for example, (1) is equivalent to y zx x \ yz; if denote zx = u, yz = v and yu = t (i.e. x = z \ u, z = y \ v, u = y \ t), then t ( (y \ v) \ (y \ t) ) \ v. (2) Hence, (Q, ) satises (1) i (Q, \) satises (2). If (2) is written with terms of (Q, ), then obtain c (ab ac)b. (3) Thus (3) is a conjugate identity to (1). Further, from (3) we have R b L ab L a 1, i.e. L a R b L ab 1. Whence c a (ab c)b and if denote a = y, ab = z, c = z \ x, then y ( x (y \ z) ) (z \ x) (4) is a conjugate identity to (1). (4) we get from (1) if all operations in (1) are substituted by Table 2, i.e. ( ) is substituted by \ = ϕ 4 ( ), by = ϕ 4 ( ),..., by = ϕ 4 ( ) (see Sade [3]). Table 2 Table 3 / \ / \ / \ / / \ \ / \ \ / / \ ϕ 0 ϕ 1 ϕ 2 ϕ 3 ϕ 4 ϕ 5 ϕ 0 ϕ 1 ϕ 2 ϕ 3 ϕ 4 ϕ 5 ϕ 0 ϕ 0 ϕ 1 ϕ 2 ϕ 3 ϕ 4 ϕ 5 ϕ 1 ϕ 1 ϕ 0 ϕ 5 ϕ 4 ϕ 3 ϕ 2 ϕ 2 ϕ 2 ϕ 3 ϕ 0 ϕ 1 ϕ 5 ϕ 4 ϕ 3 ϕ 3 ϕ 2 ϕ 4 ϕ 5 ϕ 1 ϕ 0 ϕ 4 ϕ 4 ϕ 5 ϕ 3 ϕ 2 ϕ 0 ϕ 1 ϕ 5 ϕ 5 ϕ 4 ϕ 1 ϕ 0 ϕ 2 ϕ 3 The identities (1) and (4) may be written by the way as R / zxl \ xr z 1, R z\x L xr \ z 1

10 J. Duplák and with respect to Table 1 and Table 2 R 1 zx L 1 x R z 1, T 1 z\x L xt z 1. The ordered tripletes R 1 L 1 R, T 1 LT may be assigned to the identities (2), (3). Therefore the triple R 1 L 1 R will be called conjugate to the triple T 1 LT. In what follows we shall denote: N = {0, 1, 2, 3,...}, T = {L, R, T, L 1, R 1, T 1 }, [0, n) = {0, 1, 2, 3,..., n 1}, n N, n > 0, T n = {α : α is a map [0, n) T } for all n N, n > 0, if α T n then α = A n 1... A 2 A 1 A 0 and α(i) = A i for all i [0, n), T = T (T T ) (T T T )..., l(α) = n α T n, ω : T T, (ωα)(i) = α((i + 1)(mod n)) for all i [0, n), it holds α T n ωα T n, σ : T T, (σα)(j) = α(n 1 j) for all j [0, n), for n = l(α) and ρ : T T, L L 1 L, R R 1 R, T T 1 T, i.e. ρ(a) = A 1 for all A T, ρ : T T, (ρα)(i) = ρ ( α(i) ) for all j [0, n), n = l(α), κ : T [0, 6), L 0, R 1, T 2, L 1 3, R 1 4, T 1 5, κ : T N, κα = n 1 10 i κ(α(i)), n = l(α), α < β for α, β T ϕ i i=0 κα < κβ, : T T, (ϕ i α)(j) = ϕ i (α(j)) for all i [0, 6) and j [0, n), n = l(α), where ϕ i : T T is given in Table 1, P 1 be the group generated by {ϕ i : T T, i [0, 6) },

A parastrophic equivalence in quasigroups 11 P the group generated by the set P 1 {ρσ, ω}, ( these maps are dened upon T ), ϕ i+6 : T T, ϕ i+6 = σρϕ i for all i [0, 6), where ϕ i : T T is given in Table 1, C(i, j, k)(α) = κ ( (ω k ϕ i α ) (j) ) for all i [0, 12), j, k [0, n), n = l(α). Lemma 1.1. Let α T, n = l(α) and let j, k [0, n). Then the following relations hold (i) (ii) σ 2 = ρ 2 = 1, ωσω = σ, ω 1 (α) = ω n 1 (α), ω k (α) = ω t (α) if k t(mod n), every two elements of the set {ω, σ, ρ, ϕ 2, ϕ 4 } commute, besides ω, σ and ϕ 2, ϕ 4, (iii) P 1 = {ϕ i : i [0, 12)}; P 1 is generated by {ϕ 2, ϕ 4 }, (iv) P = {ω k ϕ i : k N, i [0, 12)}, (v) C(i, j, 0)(α) = i + ( 1) i κα(j)(mod 6) for i = 0, 1, (vi) C(i, j, 0))(α) = 1 i + ( 1) i+1 κα(j)(mod 6) for i = 2, 3, 4, 5, (vii) C(i + 6, j, 0)(α) = C(i, n 1 j, 0) + 3(mod 6) for i [0, 6), (viii) C(i, j, k)(α) = C(i, (j k)(mod 6), 0)(κα) for i [0, 12). Proof. (i) ωσωα(j) = ωσ ( α(j+1) ) = ωα(n 1 j 1) = α(n 1 j) = σα(j). The rest of the proof is straightforward when we use Table 1 Table 3. Denition 1.2. α, β T are called parastrophic equivalent if there exists ϕ P such that ϕ(α) = β. Obviously the parastrophic equivalence is an equivalence relation; by [α] it will be denoted the class of the relation that comprises α. With respect to (iv) we have and by (v) (viii) [α] = { ω k ϕ i (α) : i [0, 12), k [0, n), n = l(α) }, [α] = { C(i, n 1, k)(α)c(i, n 2, k)(α)... C(i, 0, k)(α) : i [0, 12) },

12 J. Duplák where k [0, n), n = l(α). In the following (by a personal computer) it will be found the lowest element of a class [α] for all α T n and 1 < n < 5. 2. The parastrophic equivalence in T 2 T 4 Theorem 2.1. Let n {2, 3, 4}. Then every α in T n is parastrophic equivalent to exactly one of the following elements LL LR LT LL 1 (P E2) LLL LLR LLT LLL 1 (P E3) LRT LRL 1 LRR 1 LRT 1 LT R 1 LR 1 T LLLL LLT R LRLR LT LT (P E4) LLLR LLT T LRLT LT LL 1 LLLT LLT L 1 LRLL 1 LT LR 1 LLLL 1 LLT R 1 LRLR 1 LT T 1 L 1 LLRR LLL 1 R LRLT 1 LL 1 LL 1 LLRT LLL 1 T LRT L 1 LL 1 T 1 T LLRL 1 LLL 1 L 1 LRT R 1 LLRR 1 LLR 1 R LRL 1 T LLRT 1 LLR 1 T LRL 1 R 1 LLT 1 R LRL 1 T 1 LRR 1 T LRR 1 L 1 LRT 1 T LRT 1 L 1 LRT 1 R 1 In [1] V.D. Belousov denes: A primitive quasigroup (Q,, \, /) is a Π quasigroup of type (α, β, γ) if α, β, γ ( ) and the quasigroup satises the identity L α xl β xl γ x 1.

A parastrophic equivalence in quasigroups 13 This identity is equivalent to the identity A x B x C x 1 for some A, B, C T, A 1 B, C B 1, A C 1. Therefore we can say that Q is a quasigroup of type ABC. By Belousov [2], two Π quasigroups of types ABC, DEF, respectively, are called parastrophic equivalent if ABC = ϕ(def ) for some ϕ P; it is in the view of the denition of the parastrophic equivalence given in this paper. Thus if from 10 elements of the set P E3 delete LLL 1, LRR 1, LRL 1 then obtain 7 elements that determine 7 equivalence classes of the parastrophic equivalence relation listed in [2, Table 1]. If we want to determine the equivalence class of the parastrophic equivalency (for example) of the identity (x/y) \ (y \ x) x (5) (see [2, p. 16]), then proceed like this: (5) is equivalent to i.e. y \ x (x/y)x, whence by Table 1 and also R x R x L / x T z R z T 1 z R z Tz 1 Tz 1 1, ϕ 3 (RT 1 T 1 ) = R 1 LL. Hence (5) is parastrophic equivalent to L x L x R 1 x 1, i.e. x xy yx in (Q, /). The lowest element of the set [RT 1 T 1 ] we can determine by a computer. Similarly we can proceed for arbitrary ABC T 3 ; more generally, for arbitrary x T n, n > 1. By a computer we can get card(p E5) = 148, card(p E6) = 718, card(p E7) = 3441.

14 J. Duplák References [1] V.D. Belousov: Systems of quasigroups with generalized identities, (Russian), Usp. Mat. Nauk 20 (1965), 75 146. [2] V.D. Belousov: Parastrophic orthogonal quasigroups, (Russian), Kishinev 1983. [3] A. Sade: Quasigroupes parastrophiques. Expression et identités, Math. Nachr. 20 (1959), 73 106. [4] S.K. Stein: On the foundations of quasigroups, Trans. Amer. Math. Soc. 85 (1957), 228 256. Katedra matematiky Received June 28, 2000 Pedagogická fakulta ul. 17. nov. 1 08 116 Pre²ov Slovak Republik e-mail: jduplak@unipo.sk