On BP-algebras and QS-algebras



Similar documents
ON ROUGH (m, n) BI-Γ-HYPERIDEALS IN Γ-SEMIHYPERGROUPS

Full and Complete Binary Trees

Degree Hypergroupoids Associated with Hypergraphs

So let us begin our quest to find the holy grail of real analysis.

Groups with the same orders and large character degrees as PGL(2, 9) 1. Introduction and preliminary results

P. Jeyanthi and N. Angel Benseera

Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

Rough Semi Prime Ideals and Rough Bi-Ideals in Rings

0 0 such that f x L whenever x a

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

How To Factorize Of Finite Abelian Groups By A Cyclic Subset Of A Finite Group

FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS

CHAPTER 7 GENERAL PROOF SYSTEMS

Handout #1: Mathematical Reasoning

On the Algebraic Structures of Soft Sets in Logic

An inequality for the group chromatic number of a graph

Max-Min Representation of Piecewise Linear Functions

A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES

SCORE SETS IN ORIENTED GRAPHS

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Today s Topics. Primes & Greatest Common Divisors

4.5 Linear Dependence and Linear Independence

ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath

On duality of modular G-Riesz bases and G-Riesz bases in Hilbert C*-modules

THE BANACH CONTRACTION PRINCIPLE. Contents

26 Ideals and Quotient Rings

Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:

ACTA UNIVERSITATIS APULENSIS No 15/2008 PRODUCTS OF MULTIALGEBRAS AND THEIR FUNDAMENTAL ALGEBRAS. Cosmin Pelea

ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Triangle Congruence and Similarity A Common-Core-Compatible Approach

Cartesian Products and Relations

ON SUPERCYCLICITY CRITERIA. Nuha H. Hamada Business Administration College Al Ain University of Science and Technology 5-th st, Abu Dhabi, , UAE

Types of Degrees in Bipolar Fuzzy Graphs

FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM

Introduction to Automata Theory. Reading: Chapter 1

5. Linear algebra I: dimension

Basics of Polynomial Theory

A Propositional Dynamic Logic for CCS Programs

SURVEY ON DYNAMICAL YANG-BAXTER MAPS. Y. Shibukawa

Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.

Determination of the normalization level of database schemas through equivalence classes of attributes

Math 223 Abstract Algebra Lecture Notes

DEGREE OF NEGATION OF AN AXIOM

Left Jordan derivations on Banach algebras

A CHARACTERIZATION OF C k (X) FOR X NORMAL AND REALCOMPACT

NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1

Orthogonal Diagonalization of Symmetric Matrices

There is no degree invariant half-jump

The Factor Theorem and a corollary of the Fundamental Theorem of Algebra

Notes on Complexity Theory Last updated: August, Lecture 1

If n is odd, then 3n + 7 is even.

International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013

JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004

INCIDENCE-BETWEENNESS GEOMETRY

Chapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses

9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ?

Math 4310 Handout - Quotient Vector Spaces

THE PRODUCT SPAN OF A FINITE SUBSET OF A COMPLETELY BOUNDED ARTEX SPACE OVER A BI-MONOID

Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients

(0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.

Invertible elements in associates and semigroups. 1

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

Smarandache Curves in Minkowski Space-time

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

Set theory as a foundation for mathematics

Continuity of the Perron Root

GROUPS ACTING ON A SET

Note on some explicit formulae for twin prime counting function

On an algorithm for classification of binary self-dual codes with minimum distance four

3. Mathematical Induction

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

1. Prove that the empty set is a subset of every set.

FIXED POINT SETS OF FIBER-PRESERVING MAPS

6.3 Conditional Probability and Independence

Classification of Cartan matrices

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

How To Prove The Dirichlet Unit Theorem

CONTENTS 1. Peter Kahn. Spring 2007

ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION

ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska

88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a

Chapter 13: Basic ring theory

COMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:

Transcription:

The Journal of Mathematics and Computer Science Available online at http://www.tjmcs.com The Journal of Mathematics and Computer Science Vol.5 No. 1 (2012) 17-21 On BP-algebras and QS-algebras S.A. Nematoalah Zadeh PayameNoor Tehran University, Tehran, Iran sanemat254@yahoo.com A. Radfar PayameNoor Boshehr University, Boshehr, Iran ateferadfar@yahoo.com A. Borumand Saied Shahid Bahonar University of Kerman, Kerman, Iran arsham@mail.uk.ac.ir Received: April 2012, Revised: December 2012 Online Publication: December 2012 Abstract In this paper we prove that the class of QS-algebras, p-semi simple algebras and BP-algebras are equivalent. Keywords: QS-algebra, BP-algebra, BCI-algebras. 2010 Mathematics Subject Classification: Primary 54A40; Secondary 46S40. 1. Introduction. In 1966, Y. Imai and K. Iseki introduced two classes of abstract algebras: BCK-algebras and BCI-algebras [5, 6]. It is known that the class of BCK-algebras is a proper subclass of BCIalgebra. P-Semisimple algebras are another special class of BCI-algebras, which were introduced by T. D. Lei in 1982 ([11]). They play a basic role in the theory of BCI-algebras and have close contacts with abelian groups. Neggers, Ahn and Kim ([12]) introduced the notion of Q-algebras in 2001 and after that Ahn and Kim introduced the notion of QSalgebras which is a generalization of Q-algebras. In 2002, Neggers and Kim [14] introduce the notion of B-algebra and obtained several results. In 2006, G. B. Kim and H.S Kim ([8]) introduced 17

the notion of a BM-algebra which is a specialization of B-algebra. The concept of a BP-algebra is introduced by S. S. Ahn and J. S. Han [9], which is another generalization of B-algebra. In this paper, we prove that QS-algebras and BP-algebras are equal to P-Semisimple algebras and so they are equal together. 2. Preliminaries. Definition2.1. [8] A BM-algebra is a non-empty set X with a constant 0 and a binary operation " * " satisfying the following axioms: (A1) x *0= x, (A2) ( z * x)*( z * y) = y * x, Definition2.2. [17] Let X be a set with a binary operation * and a constant 0. Then ( X,*,0) is called BCI- algebra if satisfies the following conditions: (BCI-1) (( x * y)*( x * z))*( z * y ) = 0, (BCI-2) ( x *( x * y))* y = 0, (BCI-3) x * x = 0, (BCI-4) x * y = 0 and y * x = 0 imply x = y, Definition2.3.[17] A BCI-algebra X is called p-semi simple-algebra if 0*(0* x) = x, for all x X. Theorem 2.4. [17] Let X be a BCI-algebra. Then the following hold: (i) x *0 = x, (ii) (ii)( x * y)* z = ( x * z)* y, Theorem 2.5. [17] Let X be a BCI-algebra. Then the following are equivalent: (i) X is a p-semi simple algebra, (ii) every element of X is minimal, (iii) X = {0* x x X }. We note that an element x X is called minimal, if y * x = 0, implies y = x. Definition 2.6.[1] Let X be a set with a binary operation * and a constant 0. Then (X,*,0) is called a BP-algebra if satisfies (A2) and the following conditions: (BP1) x *( x * y) = y, (BP2) x * x = 0. X is called QS-algebra, if satisfies A1, A2, BP2 and 18

(Q) ( x * y)* z = ( x * z)* y, for any x, y, z X. Theorem 2.7.[1] Let X be a BP-algebra. Then x *0 = x, for all x X. Definition 2.8. [9] A BO-algebra is an algebra (X,*,0) of type (2,0) satisfying A1, BP2 and (BO) x *( y * z) = ( x * y)*(0* z), Theorem 2.9. [9] BO-algebras, BM-algebras, P-semi simple algebras are equivalent and they are logically equivalent by abelian group. 3. QS-algebras, BP-algebras and P-semi simple algebras Theorem 3.1. Let X be a set with a binary operation * and a constant 0. Then X is a p-semi simplealgebra if and only if satisfies in the following conditions: (i) ( x * y)* z = ( x * z)* y, (ii) x * y = 0 iff x = y, Proof. Let X be a p-semi simple-algebra. Then by Theorem 2.5(ii), x * y = 0 implies x = y and by BCI-3, x * x = 0. Hence ( ii ) is hold. By Theorem 2.4(ii), () i is hold. Conversely, let (i) and (ii) are hold. By (ii), (BCI-4) is hold. Also by (ii), x * x = 0 and (BCI-3) is hold. By x * x = 0 and () i we have x *( x * y))* y ( x * y)*( x * y)* y 0 x * ( x * y) = y. (1) = =, we conclude that ( x *0)* x = ( x * x)*0 = 0. Now, by (ii) and By (1), (ii) and (i) we have (( x * y)*( x * z))*( z * y) = (( x *( x * z))* y)*( z * y) = ( z * y)*( z * y) = 0. Thus, X is a BCI-algebra. By (ii), every element of X is minimal. By Theorem 2.5, X is a p-semi simplealgebra. Corollary 3.2. Let X be a p-semi simple-algebra. Then the following hold: (i) ( x * y)*( x * z) = z * y, (ii) x *( x * y) = y, Proof. By Theorem 3.1 and definition of p-semi simple algebra the proof is clear. 19

Theorem3.3. X is a BP-algebra if and only if X is a p-semi simple-algebra. Proof. Let X be a p-semi simple-algebra. By Theorem 3.2(i), (ii) and BCI-2, X is a BP-algebra. Conversely, let X be a BP-algebra and x * y = 0, for some x, y x = x *0 = x *( x * y) = y. Thus by BP2, x * y = 0 if and only if x = y. X. Then by BP1 and Theorem 2.7 Let x * y = z, for some x, y, z X. Then by BP1, x * z = x *( x * y) = y. Thus x * y = z if and only if x * z = y. (2) Let ( x * y)* z = t and x * y = a. By (2), x * a = y. Thus by A2, ( x * z)* y = ( x * z)*( x * a) = a* z = ( x * y)* z. By Theorem 3.1, X is a p-semi simple-algebra. Theorem 3.4. X is a QS-algebra if and only if X is a p-semi simple-algebra. Proof. Let X be a p-semi simple-algebra. Then by Theorem 3.2, X is a QS-algebra. Conversely, let X be a QS-algebra. Then by A1 and A2, x *( x * y) = ( x *0)*( x * y) = y *0 = y. Thus X is a BP-algebra. By Theorem 3.3, X is a p-semi simple-algebra. Corollary 3.5. BM-algebras, BP-algebras, BO-algebras, QS-algebras and p-semisimple algebra are equivalent and they are logically equivalent by abelian group. Proof. By Theorems 3.3, 3.4 and Theorem 2.9 the proof is clear. 4. Conclusion. The concept of a BP-algebra introduced by S. S. Ahn and J. S. Han [8], which is another generalization of B-algebra. In this paper we show that this algebraic structure is equivalent to p- semisimple BCI-algebras. Acknowledgments: The authors would like to express their thanks to referees for their comments and suggestions which improved the paper. References [1] S. S. Ahn and J. S. Han, On BP-algebras, Submitted. [2] R. Ameri, H. Hedayati, and E. Ghasemian, Filteristic soft BCK-algebras, TJMCS Vol.2 No.1 (2011) 81-87 [3] Q. P. Hu and X. Li, On BCH-algebras, Math. Seminar Notes 11 (1983), 313-320. 20

[4] Q. P. Hu and X. Li, On proper BCH-algebras, Math. Japonica 30 (1985), 659-661. [5] K. Iseki and S. Tanaka, An introduction to theory of BCK-algebras, Math. Japonica 23 (1978), 1-26. [6] K. Iseki, On BCI-algebras, Math. Seminar Notes 8 (1980), 125-130. [7] Y. B. Jun, E. H. Roh and H. S. Kim, On BH-algebras, Sci. Math. Japonica Online 1 (1998), 347-354. [8] C. B Kim and H. S. Kim, On BM-algebras, Math. Japonica, 211-215 (2006). [9] C. B Kim and H. S. Kim, On BO-algebras, Mathematica Slovaca, 2012, Vol 62, No. 5, 855-864. [10] H. S. Kim, Y. H. Kim and J. Neggers, Coxeters and pre-coxeter algebras in Smarandache setting, Honam Math. J. 26, Vol. 4, 471-481, (2004). [11] T. D. Lei, Structure of finite associative BCI-algebras}, J. of Shaanxi Teachers Univ, 2(1982), 17-20. [12] J. Neggers, S. S. Ahn and H. S. Kim, On Q-algebras, Int. J. of Mathematics and Mathematical Sciences 27(no. 12), (2001), 749-757. [13] J. Neggers and H. S. Kim, On d-algebras, Math. Slovaca 49 (1999), 19-26. [14] J. Neggers and H. S. Kim, On B-algebras, Mate. Vesnik 54 (2002), 21-29. [15] J. Neggers and H. S. Kim, A fundamental theorem of B-homomorphism for B-algebras, Int. Math. J. 2 (2002), 215-219. [16] A. Walendziak, Some axiomatizations of B-algebras, Math. Slovaca 56(2006) 3, 301-306. [17] H. Yisheng, BCI-algebra, Science Press, (2006). 21