Nearness Rings on Nearness Approximation Spaces*
MEHMET ALİ ÖZTÜRK
*Department of Mathematics
Faculty of Arts and Sciences
Adıyaman University
Adıyaman, Türkiye*
[email protected]
and
EBUBEKİR İNAN
*Department of Mathematics
Faculty of Arts and Sciences
Adıyaman University
Adıyaman, Türkiye*
[email protected]
Abstract.
In this paper, we consider the problem of how to establish algebraic
structures on nearness approximation spaces. Essentially, our approach is to
define the nearness ring, nearness ideal and nearness ring of all weak cosets
by considering new operations on the set of all weak cosets. Afterwards, our
aim is to study nearness homomorphism on nearness approximation spaces, and to
investigate some properties of nearness rings and ideals.
Key words and phrases:
Near set, rough set, approximation space, nearness approximation space, near group
2010 Mathematics Subject Classification:
03E75, 03E99, 20A05, 20E99
- This paper is a part of Ebubekir İnan’s PhD thesis which approved on 20.03.2015 by İnönü University Graduate School of Natural and Applied Sciences, Türkiye.
1. Introduction
Nearness approximation spaces and near sets were introduced in 2007 as a
generalization of rough set theory [12, 10]. More recent work
consider generalized approach theory in the study of the nearness of non-empty
sets that resemble each other [13] and a topological framework for
the study of nearness and apartness of sets [8]. An algebraic
approach of rough sets has been given by Iwinski [4]. Afterwards,
rough subgroups were introduced by Biswas and Nanda [1]. In 2004 Davvaz investigated the concept of roughness of rings
[3] (and other algebraic approaches of rough sets in
[17, 16]).
Near set theory begins with the selection of probe functions that provide a
basis for describing and discerning affinities between objects in distinct
perceptual granules. A probe function is a real-valued function representing a
feature of physical objects such as images or collections of artificial
organisms, e.g. robot societies.
In the concept of ordinary algebraic structures, such a structure that
consists of a nonempty set of abstract points with one or more binary
operations, which are required to satisfy certain axioms. For example, a
groupoid is an algebraic structure (A,∘) consisting of a
nonempty set A and a binary operation “∘” defined on A [2]. In a groupoid, the
binary operation “∘” must be only
closed in A, i.e., for all a,b in A, the result of the operation a∘b is also in A. As for the nearness approximation space, the sets are
composed of perceptual objects (non-abstract points) instead of abstract
points. Perceptual objects are points that have features. And these points
describable with feature vectors in nearness approximation spaces
[10]. Upper approximation of a nonempty set is obtained by using the
set of objects composed by the nearness approximation space together with
matching objects. In the algebraic structures constructed on nearness
approximation spaces, the basic tool is consideration of upper approximations
of the subsets of perceptual objects. In a groupoid A on nearness
approximation space, the binary operation “∘” may be closed in upper approximation of A, i.e., for
all a,b in A, a∘b is in upper approximation of A.
There are two important differences between ordinary algebraic structures and
nearness algebraic structures. The first one is working with non-abstract
points while the second one is considering of upper approximations of the
subsets of perceptual objects for the closeness of binary operations.
In 2012, E. İnan and M. A. Öztürk [5, 6]
investigated the concept of near groups on nearness approximation spaces.
Moreover, in 2013, M. A. Öztürk at all [9] introduced
near group of weak cosets on nearness approximation spaces. And in 2015, E. İnan and M. A. Öztürk [7]
investigated the nearness semigroups. In this paper, we
consider the problem of how to establish and improve algebraic structures of
nearness approximation spaces. Essentially, our aim is to obtain algebraic
structures such as nearness rings using sets and operations that ordinary are
not being algebraic structures. Moreover, we define the nearness ring of all
weak cosets by considering operations on the set of all weak cosets. To define
this quotient structure we don’t need to consider ideals.
2. Preliminaries
2.1. Nearness Approximation Spaces [10]
Perceptual objects are points that describable with feature vectors. Let
O be a set of perceptual objects. An object description is defined
by means of a tuple of function values Φ(x) associated
with an object x∈X⊆O. The important thing to notice is
the choice of functions φi∈B used to describe any object of
interest. Assume that B⊆F is a given set of functions representing features of sample objects
X⊆O. Let φi∈B, where φi:O⟶R. In combination, the functions representing object features provide a basis
for an object description Φ:O⟶RL, a vector containing measurements (returned values) associated with each
functional value φi(x), where the description length
is ∣Φ∣=L.
Object Description: Φ(x)=(φ1(x),φ2(x),φ3(x),...,φi(x),...,φL(x)).
Sample objects X⊆O are near to each other if and only if
the objects have similar descriptions. Recall that each φ defines a
description of an object. Then let Δφi denote
Δφi=∣φi(x′)−φi(x)∣, where x,x′∈O. The difference Δφ leads to a definition of the indiscernibility relation “∼B”.
Let x,x′∈O, B⊆F.
[TABLE]
is called the indiscernibility relation on O, where description
length i≤∣Φ∣.
[TABLE]
Table 1 : Nearness Approximation Space Symbols
A nearness approximation space is a tuple NAS=(O,F,∼Br,Nr(B),νNr) where the approximation
space NAS is defined with a set of perceived objects O, set of
probe functions F representing object features, indiscernibility relation ∼Br defined relative to Br⊆B⊆F, collection of partitions (families of neighbourhoods) Nr(B), and overlap function νNr. The subscript r
denotes the cardinality of the restricted subset Br, where we consider
(r∣B∣), i.e., ∣B∣
functions ϕi∈F taken r at a time to define the relation ∼Br . This
relation defines a partition of O into non-empty, pairwise
disjoint subsets that are equivalence classes denoted by [x]Br, where [x]Br={x′∈O∣x∼Brx′}. These classes form a new
set called the quotient set O╱∼Br, where
O╱∼Br={[x]Br∣x∈O}. In effect, each choice of probe functions Br defines a partition ξO,Br on a set of objects
O, namely, ξO,Br=O╱∼Br. Every choice of the set Br leads to a new partition of O.
Let F denote a set of features for objects in a set X, where each ϕi∈F that maps X to some value set Vϕi (range of ϕi). The
value of ϕi(x) is a measurement associated with a
feature of an object x∈X. The overlap function νNr is
defined by νNr:℘(O)×℘(O)⟶[0,1], where
℘(O) is the powerset of O. The
overlap function νNr maps a pair of sets to a number in
[0,1] representing the degree of overlap between sets of
objects with their features defined by probe functions Br⊆B
[15]. For each subset Br⊆B of probe functions, define
the binary relation ∼Br={(x,x′)∈O×O∣∀ϕi∈Br, ϕi(x)=ϕi(x′)}. Since
each ∼Br is, in fact, the usual indiscernibility relation, for
Br⊆B and x∈O, let [x]Br
denote the equivalence class containing x. If (x,x′)∈∼Br , then x and x′ are said to be
B-indiscernible with respect to all feature probe functions in Br. Then
define a collection of partitions Nr(B), where
Nr(B)={ξO,Br∣Br⊆B}.
2.2. Descriptively Near Sets
We need the notion of nearness between sets, and so we consider the concept of
the descriptively near sets. In 2007, descriptively near sets were introduced
as a means of solving classification and pattern recognition problems arising
from disjoint sets that resemble each other [10, 12].
A set of objects A⊆O is characterized by the unique
description of each object in the set.
Set Description**: [8]** Let O be a set of
perceptual objects, Φ an object description and A⊆O.
Then the set description of A is defined as
[TABLE]
Descriptive Set Intersection**: [8, 14]** Let
O be a set of perceptual objects, A and B any two subsets of
O. Then the descriptive (set) intersection of A and B is
defined as
[TABLE]
If Q(A)∩Q(B)=∅, then A is called
descriptively near B and denoted by AδΦB [11].
Descriptive Nearness Collections**:** [11] ξΦ(A)={B∈P(O)∣AδΦB}.
Let Φ be an object description, A any subset of O and
ξΦ(A) a descriptive nearness collections. Then
A∈ξΦ(A) [11].
2.3. Some Algebraic Structures on NAS
A binary operation on a set G is a mapping of G×G into G,
where G×G is the set of all ordered pairs of elements of G. A
groupoid is a system G(⋅) consisting of a
nonempty set G together with a binary operation “⋅” on G [2].
Let NAS=(O,F,∼Br,Nr(B),νNr) be a nearness approximation
space (NAS) and let “⋅” a binary
operation defined on O. A subset G of the set of perceptual
objects O is called a near group on NAS if the
following properties are satisfied:
- (NG1)
For all x,y∈G, x⋅y∈Nr(B)∗G,
2. (NG2)
For all x,y,z∈G, (x⋅y)⋅z=x⋅(y⋅z) property holds in Nr(B)∗G,
3. (NG3)
There exists e∈Nr(B)∗G such
that x⋅e=e⋅x=x for all x∈G* *(e is called the near
identity element of G),
4. (NG4)
There exists y∈G such that x⋅y=y⋅x=e for
all x∈G (y is called the near inverse of x in G and denoted as
x−1) [5].
If in addition, for all x,y∈G, x⋅y=y⋅x property holds in
Nr(B)∗G, then G is said to be an abelian near
group on NAS.
Also, a nonempty subset S⊆O is called a near
semigroup on NAS if x⋅y∈Nr(B)∗S for all
x,y∈S and (x⋅y)⋅z=x⋅(y⋅z) for all x,y,z∈S property holds in Nr(B)∗(S).
Theorem 1**.**
[5*]*Let G be a near group on NAS.
(i) There exists a unique near identity element e∈Nr(B)∗G such that x⋅e=x=e⋅x for all x∈G.
(ii) For all x∈G, there exists a unique y∈G such that x⋅y=e=y⋅x.
Theorem 2**.**
[5*]*Let G be a near group on NAS.
(i) (x−1)−1=x for all x∈G.
(ii) If x⋅y∈G, then (x⋅y)−1=y−1⋅x−1 for all x,y∈G.
(iii) If either x⋅z=y⋅z or z⋅x=z⋅y, then x=y for all
x,y,z∈G.
H is called a subnear group of near group G if H is a near group
relative to the operation in G. There is only one guaranteed trivial subnear
group of near group G, i.e., G itself. Moreover, {e} is
a trivial subnear group of near group G if and only if e∈G.
Theorem 3**.**
[6]** Let G be a near group on nearness approximation
space, H be a nonempty subset of G and Nr(B)∗H
be a groupoid. H⊆G is a subnear group of G if and only if
x−1∈H for all x∈H.
Let H1 and H2 be two near subgroups of the near group G and
Nr(B)∗H1, Nr(B)∗H2
groupoids. If (Nr(B)∗H1)∩(Nr(B)∗H2)=Nr(B)∗(H1∩H2), then H1∩H2 is a near subgroup
of near group G [6].
Let G⊂O be a near group and H be a subnear group of G.
The left weak equivalence relation (compatible relation) “∼L” defined as
[TABLE]
A weak class defined by relation “∼L” is called left weak coset. The left weak coset that contains the element a
is denoted by a~L, i.e.
[TABLE]
Let (O1,F1,∼Br1,Nr1(B),νNr1) and
(O2,F2,∼Br2,Nr2(B),νNr2) be two
nearness approximation spaces and “⋅”,
“∘” binary operations over
O1 and O2, respectively.
Let G1⊂O1, G2⊂O2 be two near
groups and σ a mapping from Nr1(B)∗G1
onto Nr2(B)∗G2. If σ(x⋅y)=σ(x)∘σ(y) for all
x,y∈G1, then σ is called a near homomorphism and also, G1
is called near homomorphic to G2.
Let G1⊂O1, G2⊂O2 be near
homomorphic groups, H1 a near subgroup and Nr1(B)∗H1 a groupoid. If σ(Nr1(B)∗H1)=Nr2(B)∗σ(H1), then σ(H1) is a near subgroup of G2
[6].
The kernel of σ is defined to be the set Kerσ={x∈G1∣σ(x)=e′}, where e′ is
the near identity element of G2.
Theorem 4**.**
[6*]*Let G1⊂O1,G2⊂O2 be near groups that are near homomorphic,
Kerσ=N be near homomorphism kernel and Nr(B)∗N be a groupoid. Then N is a near normal subgroup of G1.
Definition 1**.**
[9*]*Let O be a set of perceptual objects,
G⊂O a near group and H a subnear group of G. Let
G/∼L be a set of all left weak cosets of G by H, ξΦ(A) a descriptive nearness collections and A∈P(O). Then
[TABLE]
is called upper approximation of G/∼L.
Theorem 5**.**
[9*]*Let G be a near group, H a subnear group of
G and G/∼L a set of all left weak cosets of G by H. If
(Nr(B)∗G)/∼L⊆Nr(B)∗(G/∼L), then
G/∼L is a near group under the operation given by aH⊙bH=(a⋅b)H for all a,b∈G.
Let G be a near group and H a subnear group of G. The near group
G/∼L is called a near group of all left weak cosets of G by H
and denoted by G/wH [9].
3. Nearness Rings on Nearness Approximation Spaces
Definition 2**.**
Let NAS=(O,F,∼Br,Nr(B),νNr) be a nearness approximation
space and “+” and “⋅” binary operations defined on O. A subset R
of the set of perceptual objects O is called a nearness ring on
NAS if the following properties are satisfied:
- (NR1)
R* is an abelian near group on NAS with binary operation
“+”,*
2. (NR2)
R* is a near semigroup on NAS with binary operation
“⋅”,*
3. (NR3)
For all x,y,z∈R,
x⋅(y+z)=(x⋅y)+(x⋅z)* and*
(x+y)⋅z=(x⋅z)+(y⋅z)* properties hold in Nr(B)∗R.*
If in addition:
- (NR4)
x⋅y=y⋅x* for all x,y∈R,*
then R is said to be a commutative nearness ring.
- (NR5)
If Nr(B)∗R contains an element
1R such that 1R⋅x=x⋅1R=x for all x∈R,
then R is said to be a nearness ring with identity.
These properties have to hold in Nr(B)∗R. Sometimes
they may be hold in O╱Nr(B)∗R, then
R is not a nearness ring on NAS. Multiplying or sum of finite number of
elements in R may not always belongs to Nr(B)∗R.
Therefore always we can not say that xn∈Nr(B)∗R or nx∈Nr(B)∗R, for all x∈R and some
positive integer n. If (Nr(B)∗R,+)
and (Nr(B)∗R,⋅) are groupoids,
then we can say that xn∈Nr(B)∗R for all
positive integer n or nx∈Nr(B)∗R all integer
n, for all x∈R.
An element x in nearness ring R with identity is said to be left
(resp. right) invertible if there exists y∈Nr(B)∗R (resp. z∈Nr(B)∗R) such that
y⋅x=1R (resp. x⋅z=1R). The element y (resp. z) is
called a left (resp. right) inverse of x. If
x∈R is both left and right invertible, then x is said to be
nearness invertible or nearness unit. The set of nearness
units in a nearness ring R with identity forms is a near group on NAS with multiplication.
A nearness ring R is a nearness division ring iff (R\{0},⋅) is a near group on NAS,
i.e., every nonzero elements in R is a nearness unit. Similarly, a nearness
ring R is a nearness field iff (R\{0},⋅) is a commutative near group on NAS.
Some elementary properties of elements in nearness rings are not always
provided as in ordinary rings. If we consider Nr(B)∗R as a ordinary ring, then elementary properties of elements in nearness
ring are provided.
Lemma 1**.**
Every ordinary rings on NAS are nearness rings on NAS.
Example 1**.**
Let O={o,p,r,s,t,v,w,x} be a set of
perceptual objects and B={φ1,φ2,φ3}⊆F a set of probe functions. Values of the probe functions
[TABLE]
are given in Table 2.
[TABLE]
[TABLE]
Let “+” and “⋅” be binary operations of perceptual objects on
O as in Tables 3 and 4.
[TABLE]
[TABLE]
Since r+(s+s)=(r+s)+s, (O,+) is not a group, i.e., (O,+,⋅) is not a ring. Let R={r,t,w} be a subset of perceptual objects. Let “+” and “⋅” be
operations of perceptual objects on R⊆O as in Tables 5 and 6.
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Hence we have that ξφ1={[o]φ1,[r]φ1,[v]φ1,[w]φ1}.
[TABLE]
[TABLE]
[TABLE]
Thus we obtain that ξφ2={[o]φ2,[p]φ2,[r]φ2}.
Therefore, for r=1, a set of partitions of O is N1(B)={ξφ1,ξφ2}.
In this case, we can write
[TABLE]
From Definition 2, since
- (NR1)
R* is an abelian near group on NAS with binary operation
“+”,*
2. (NR2)
R* is a near semigroup on NAS with binary operation
“⋅” and*
3. (NR3)
For all x,y,z∈R,
x⋅(y+z)=(x⋅y)+(x⋅z)* and*
(x+y)⋅z=(x⋅z)+(y⋅z)* properties hold in Nr(B)∗R.*
conditions hold, R is a nearness ring on NAS.
Proposition 1**.**
Let R be a nearness ring on NAS and 0∈R. If 0⋅x,x⋅0∈R,
then for all x,y∈R
(i) x⋅0=0⋅x=0,
(ii) x⋅(−y)=(−x)⋅y=−(x⋅y),
(iii) (−x)⋅(−y)=x⋅y.
Definition 3**.**
Let R be a nearness ring on NAS and S a nonempty subset of
R. S is called subnearness ring of R, if S is a nearness ring with
binary operations “+” and
“⋅” on nearness ring R.
Definition 4**.**
Let we consider nearness field R and a nonempty subset S of R. S is
called subnearness field of R, if S is a nearness field.
Theorem 6**.**
Let R be a nearness ring on NAS and (Nr(B)∗S,+), (Nr(B)∗S,⋅) groupoids. A nonempty
subset S of nearness ring R is a subnearness ring of R iff −x∈S for
all x∈S.
Proof.
Suppose that S is a subnearness ring of R. Then S is a nearness ring and
−x∈S for all x∈S. Conversely, suppose −x∈S for all x∈S.
Then since (Nr(B)∗S,+) is a groupoid, from Theorem
3 (S,+) is a commutative near group on NAS. By
the hypothesis, since (Nr(B)∗S,⋅) is a groupoid
and S⊆R, then associative property holds in Nr(B)∗S. Hence (S,⋅) is a near semigroup on NAS. For
all x,y,z∈S⊆R, y+z∈Nr(B)∗S and
x⋅(y+z)∈Nr(B)∗S. Also x⋅y+x⋅z∈Nr(B)∗S. Since R is a nearness ring, x⋅(y+z)=(x⋅y)+(x⋅z) property
holds in Nr(B)∗S. Similarly we can show that
(x+y)⋅z=(x⋅z)+(y⋅z) property holds in Nr(B)∗S. Therefore S
is a subnearness ring of nearness ring R.
∎
Example 2**.**
From Example 1, let we consider the nearness ring
R={r,t,w} on NAS. Let S=\left\{r,w\right\}\be a
subset of nearness ring R. Then, “+” and
“⋅” are binary operations of
perceptual objects on S⊆R as in Tables 7 and 8.
[TABLE]
[TABLE]
We know from Example 1, for r=1, a classification of O is N1(B)={ξ(φ1),ξ(φ2)}.
Then, we can obtain N1(B)∗S={o,r,t,w}.
Hence we can observe that (Nr(B)∗S,+),
(Nr(B)∗S,⋅) are groupoids and −r=w,−w=r∈Nr(B)∗S. Therefore from Theorem 6, S is a
subnearness ring of nearness ring R.
Theorem 7**.**
Let R be a nearness ring on NAS, S1 and S2 two
subnearness rings of R and Nr(B)∗S1,
Nr(B)∗S2 groupoids with the binary operations
“+” and “⋅”. If
[TABLE]
then S1∩S2 is a subnearness ring of R.
Corollary 1**.**
Let R be a nearness ring on NAS, {Si:i∈Δ} a
nonempty family of subnearness rings of R and Nr(B)∗Si groupoids. If
[TABLE]
then i∈Δ⋂Si is a subnearness ring of R.
Definition 5**.**
Let R be a nearness ring on NAS and I be a nonempty subset of
R. I is a left (right) nearness ideal of R provided for all x,y∈I
and for all r∈R, x−y∈Nr(B)∗I, r⋅x∈Nr(B)∗I (x−y∈Nr(B)∗I,
x⋅r∈Nr(B)∗I).
A nonempty set I of a nearness ring R is called a nearness ideal of R if
I is both a left and a right nearness ideal of R.
There is only one guaranteed trivial nearness ideal of nearness ring R,
i.e., R itself. Furthermore, {0} is a trivial nearness
ideal of nearness ring R iff 0∈R.
Lemma 2**.**
Every nearness ideal is a subnearness ring of nearness ring R.
Example 3**.**
From Example 1 and 2, let we consider the nearness
ring R={r,t,w} on NAS and subnearness ring S={r,w} of R. We can observe that x−y∈Nr(B)∗S, r⋅x∈Nr(B)∗S and x⋅r∈Nr(B)∗S for all x,y∈S and for all r∈R.
Hence, from Definition 5, S is a nearness ideal of R.
Theorem 8**.**
Let R be a nearness ring on NAS, I1 and I2 two nearness ideals
of R and Nr(B)∗I1, Nr(B)∗I2 groupoids with the binary operations “+” and “⋅”. If
[TABLE]
then I1∩I2 is a nearness ideal of R.
Proof.
Suppose I1 and I2 be two nearness ideals of the nearness ring R.
It is obvious that I1∩I2⊂R. Consider x,y∈I1∩I2. Since I1 and I2 are nearness ideals, we have x−y,r⋅x∈Nr(B)∗I1 and x−y,r⋅x∈Nr(B)∗I2, i.e., x−y,r⋅x∈(Nr(B)∗I1)∩(Nr(B)∗I2)
for all x,y∈I1,I2 and r∈R. Assuming (Nr(B)∗I1)∩(Nr(B)∗I2)=Nr(B)∗(I1∩I2), we have x−y,r⋅x∈Nr(B)∗(I1∩I2). From Definition 5, I1∩I2 is a nearness
ideal of R.
∎
Corollary 2**.**
Let R be a nearness ring on NAS, {Ii:i∈Δ} a
nonempty family of nearness ideals of R and Nr(B)∗Ii groupoids with the binary operations “+” and “⋅”. If
[TABLE]
then i∈Δ⋂Ii is a nearness ideal of R.
Let R be a nearness ring and S a subnearness ring of R. The
left weak equivalence relation (compatible relation) “∼L” defined as
[TABLE]
A weak class defined by relation “∼L” is called left weak coset. The left weak coset that contains the element
x∈R is denoted by x~L, i.e.,
[TABLE]
Similarly we can define the right weak coset that contains the element x∈R is denoted by x~R, i.e.,
[TABLE]
We can easily show that x~L=x+S and x~R=S+x. Since
(R,+) is a abelian near group on NAS, x~L=x~R and so
we use only notation x~. Then
[TABLE]
is a set of all weak cosets of R by S. In this case, if we consider
Nr(B)∗R instead of nearness ring R
[TABLE]
Definition 6**.**
[9*]*Let R be a nearness ring and S be a
subnearness ring of R. For x,y∈R, let x+S and y+S be two weak
cosets that determined the elements x and y, respectively. Then sum of two
weak cosets that determined by x+y∈Nr(B)∗R can be
defined as
[TABLE]
and denoted by
[TABLE]
Definition 7**.**
Let R be a nearness ring and S be a subnearness ring of R.
For x,y∈R, let x+S and y+S be two weak cosets that determined the
elements x and y, respectively. Then product of two weak cosets that
determined by x⋅y∈Nr(B)∗R can be defined as
[TABLE]
and denoted by
[TABLE]
Definition 8**.**
Let R/∼ be a set of all weak cosets of R by S,
ξΦ(A) a descriptive nearness collections and
A∈P(O). Then
[TABLE]
is called upper approximation of R/∼.
Theorem 9**.**
Let R be a nearness ring, S a subnearness ring of R and
R/∼ be a set of all weak cosets of R by S. If (Nr(B)∗R)/∼⊆Nr(B)∗(R/∼), then R/∼ is a nearness
ring under the operations given by (x+S)⊕(y+S)=(x+y)+S and (x+S)⊙(y+S)=(x⋅y)+S for all x,y∈R.
Proof.
(NR1) Let (Nr(B)∗R)/∼⊆Nr(B)∗(R/∼). Since R is a
nearness ring from Theorem 5, (R/∼,⊕) is a
abelian near group of all weak cosets of R by S.
(NR2) Since (R,⋅) is a near semigroup;
(NS1) We have that x⋅y∈Nr(B)∗R and
(x+S)⊙(y+S)=(x⋅y)+S
∈(Nr(B)∗R)/∼ for all (x+S),(y+S)∈R/∼. From the hypothesis,
(x+S)⊙(y+S)=(x⋅y)+S
∈Nr(B)∗(R/∼) for all
(x+S),(y+S)∈R/∼.
(NS2) For all x,y,z∈R/∼, associative property hols in
Nr(B)∗R. Hence for all (x+S),(y+S),(z+S)∈R/∼
[TABLE]
holds in (Nr(B)∗R)/∼. From the
hypothesis, for all (x+S), (y+S), (z+S)∈R/∼, associative property holds in Nr(B)∗(R/∼). Therefore (R/∼,⊙) is a near semigroup of all left weak cosets of R by S.
(NR3) Since R is a nearness ring, left distributive law holds in
Nr(B)∗R. For all (x+S),(y+S),(z+S)∈R/∼,
[TABLE]
Hence left distributive law holds in (Nr(B)∗R)/∼. Similarly we can show that right distributive law holds
in (Nr(B)∗R)/∼,
((x+S)⊕(y+S))⊙(z+S)=((x+S)⊙(z+S))⊕((x+S)⊙(z+S)) for all
(x+S),(y+S),(z+S)∈R/∼.
From the hypothesis, distributive laws hold in Nr(B)∗(R/∼). Consequently, R/∼ is a nearness ring.
∎
Definition 9**.**
Let R be a nearness ring and S be a subnearness ring of R. The nearness
ring R/∼ is called a nearness ring of all weak cosets of R by S
and denoted by R/wS.
Example 4**.**
Let S={r,w} be a subset of R={r,t,w}. From Example 2, S is a subnearness ring of
nearness ring R.
Now, we can compute the all weak cosets of R by S. By using the definition
of weak coset,
[TABLE]
Thus we have that R/wS={r+S,t+S,w+S}.
Since N1(B)∗R={o,r,t,w}, we can
write the all weak cosets of N1(B)∗R by S. In this
case
o+S={r,w}∪{o}={r,w,o}.**
Then (N1(B)∗R)/∼={o+S,r+S,t+S,w+S} ⊂P(O).
Let “⊕” and “⊙ ” be operations on R/wS, by using the Definition
6 and 7, as in Tables 9 and 10.
[TABLE]
[TABLE]
It is enough to show that every element of (N1(B)∗R)/∼ is also an element of N1(B)∗(R/wS) in order to ensure (Nr(B)∗R)/∼⊆Nr(B)∗(R/wS).
[TABLE]
For r+S∈R/wS, we get that
[TABLE]
Since Q(r+S)∩Q(o+S)={(α1,β2)}=∅, it
follows that o+S∈ξΦ(r+S). Hence ξΦ(r+S)Φ∩R/wS=∅ and r+S,o+S∈N1(B)∗(R/wS) by Definition
8.
For t+S∈R/wS, w+S we get that
[TABLE]
Since Q(t+S)∩Q(t+S)={(α4,β1),(α2,β1),(α1,β2)}=∅
and Q(w+S)∩Q(w+S)={(α1,β2),(α4,β1)}=∅, it follows that t+S∈ξΦ(t+S),w+S∈ξΦ(w+S). Hence ξΦ(t+S)Φ∩R/wS=∅, ξΦ(w+S)Φ∩R/wS=∅ and
t+S,w+S∈N1(B)∗(R/wS) by
Definition 8.
Consequently, (Nr(B)∗R)/∼L⊆Nr(B)∗(R/wS).
Thus, from the Theorem 9, R/wS is a nearness ring of all weak
cosets of R by S with the operations given by Tables 9 and 10.
Definition 10**.**
Let R1,R2⊂O be two nearness rings and
η a mapping from Nr(B)∗R1 onto Nr(B)∗R2. If η(x+y)=η(x)+η(y) and η(x⋅y)=η(x)⋅η(y) for all x,y∈R1, then η is
called a nearness ring homomorphism and also, R1 is called near
homomorphic to R2, denoted by R1≃nR2.
A nearness ring homomorphism η of Nr(B)∗R1
into Nr(B)∗R2 is called
(i) a nearness momomorphism if η is one-one,
(ii) a nearness epimorphism if η is onto Nr(B)∗R2 and
(iii) a nearness isomorphism if η is one-one and maps Nr(B)∗R1 onto Nr(B)∗R2.
Theorem 10**.**
Let R1,R2 be two nearness rings and η a nearness
homomorphism of Nr(B)∗R1 into Nr(B)∗R2. Then the following properties hold.
(i) η(0R1)=0R2, where 0R2∈Nr(B)∗R2 is the nearness zero of R2.
(ii) η(−x)=−η(x) for all x∈R1.
Proof.
(i) Since η is a nearness homomorphism, η(0R1)⋅η(0R1)=η(0R1⋅0R1)=η(0R1)=η(0R1)⋅0R2. Thus we have that η(0R1)=0R2
by the Theorem 2.(iii).
(ii) Let x∈R1. Then η(x)⋅η(−x)=η(x−x)=η(0R1)=0R2. Similarly
we can obtain that η(−x)⋅η(x)=0R2 for all x∈R1. From Theorem 1.(ii), since
η(x) has a unique inverse, η(−x)=−η(x) for all x∈R1.
∎
Theorem 11**.**
Let R1,R2 be two nearness rings and η a nearness
homomorphism of Nr(B)∗R1 into Nr(B)∗R2 and Nr(B)∗S a groupoid. Then
the following properties hold.
(i) If S is a subnearness ring of nearness ring R1 and η(Nr(B)∗S)=Nr(B)∗η(S), then η(S)={η(x):x∈S} is a subnearness ring of R2.
(ii) If S is a commutative subnearness ring R1 and η(Nr(B)∗S)=Nr(B)∗η(S), then η(S) is a commutative
nearness ring of R2.
Proof.
(i) Let S be a subnearness ring of nearness ring R1. Then 0S∈Nr(B)∗S and by Theorem 10.(i), η(0S)=0R2, where 0R2∈Nr(B)∗R2. Thus, 0R2=η(0S)∈η(Nr(B)∗S)=Nr(B)∗η(S).This means that η(S)=∅.
Let η(x)∈η(S), where x∈S. Since
S is a subnearness ring of R1, −x∈Nr(B)∗S
for all x∈S. Thus −η(x)=η(−x)∈η(Nr(B)∗S)=Nr(B)∗η(S) for all η(x)∈η(S). Hence by Theorem 6, η(S) is
subnearness ring of R2.
(ii) Let S be a commutative subnearness ring and η(x),η(y)∈η(S). We have that η(S) is a subnearness ring of R2 by (i), i.e., η(S) is a nearness ring. Then η(x)⋅η(y)=η(x⋅y)=η(y⋅x)=η(y)⋅η(x) for all η(x),η(y)∈η(R1). Hence
η(S) is commutative subnearness ring of R2.
∎
Definition 11**.**
Let R1,R2 be two nearness rings and η be a nearness homomorphism
of Nr(B)∗R1 into Nr(B)∗R2. The kernel of η, denoted by Kerη, is defined to be the set
[TABLE]
Theorem 12**.**
Let R1,R2 be two nearness rings, η a nearness
homomorphism of Nr(B)∗R1 into Nr(B)∗R2 and Nr(B)∗Kerη a groupoid
with binary operations “+” and
“⋅”. Then ∅=Kerη is a
nearness ideal of R1.
Proof.
Let x,y∈Kerη. Then f(x−y)=f(x)−f(y)=0R2−0R2=0R2∈Nr(B)∗R2 and so x−y∈Nr(B)∗(Kerη). Let r∈R1. Then f(r⋅x)=f(r)⋅f(x)=f(r)⋅0R2=0R2∈Nr(B)∗R2 and so r⋅x∈Nr(B)∗(Kerη). Similarly, x⋅r∈
Nr(B)∗(Kerη). Hence, from
Definition 5, Kerη is a nearness ideal of R1.
∎
Theorem 13**.**
Let R be a nearness ring and S a subnearness ring of R. Then the mapping
Π:Nr(B)∗R→Nr(B)∗(R/wS) defined by Π(x)=x+S for all
x∈Nr(B)∗R is a nearness homomorphism.
Proof.
From the definition of Π, Π is a mapping from Nr(B)∗R into Nr(B)∗(R/wS). By
using the Definition 7,
[TABLE]
[TABLE]
for all x,y∈R. Thus Π is a nearness homomorphism from Definition
10.
∎
Definition 12**.**
The near homomorphism Π is called a nearness natural homomorphism from
Nr(B)∗R into Nr(B)∗(R/wS).
Example 5**.**
From Example 4, we consider the nearness ring of all weak cosets
R/wS. Define
[TABLE]
for all x∈Nr(B)∗R. By using the Definitions
6 and 7, we have that
[TABLE]
[TABLE]
for all x,y∈R. Hence, \Pi\is a nearness natural homomorphism from
Nr(B)∗R into Nr(B)∗(R/wS).
Definition 13**.**
Let R1,R2 be two nearness rings and S be a non-empty
subset of R1. Let
[TABLE]
be a mapping and
[TABLE]
a restricted mapping. If χ(x+y)=χS(x+y)=χS(x)+χS(y)=χ(x)+χ(y) and χ(x⋅y)=χS(x⋅y)=χS(x)⋅χS(y)=χ(x)⋅χ(y) for all x,y∈S, then χ is called a restricted nearness
homomorphism and also, R1 is called restricted nearness homomorphic to
R2, denoted by R1≃rnR2.
Theorem 14**.**
Let R1,R2 be two nearness rings and χ be a nearness homomorphism
from Nr(B)∗R1 into Nr(B)∗R2 . Let (Nr(B)∗Kerχ,+)
and (Nr(B)∗Kerχ,⋅) be
groupoids and (Nr(B)∗R1)/∼
be a set of all weak cosets of Nr(B)∗R1 by
Kerχ. If (Nr(B)∗R1)/∼⊆Nr(B)∗(R1/wKerχ)
and Nr(B)∗χ(R1)=χ(Nr(B)∗R1), then
[TABLE]
Proof.
Since (Nr(B)∗Kerχ,+) and (Nr(B)∗Kerχ,⋅) are groupoids, from
Theorem 12 Kerχ is a subnearness ring of R1. Since Kerχ
is a subnearness ring of R1 and (Nr(B)∗R1)/∼ ⊆Nr(B)∗(R1/wKerχ), then R1/wKerχ is a nearness ring of
all weak cosets of R1 by Kerχ from Theorem 9. Since
Nr(B)∗χ(R1)=χ(Nr(B)∗R1), χ(R1) is
a subnearness ring of R2. Define
[TABLE]
where
[TABLE]
for all x+Kerχ∈R1/wKerχ.
Since
[TABLE]
and the mapping χ is a nearness homomorphism,
[TABLE]
Therefore ηR1/wKerχ is well defined.
For A,B∈Nr(B)∗(R1/wKerχ),
we suppose that A=B. Since the mapping ηR1/wKerχ is well
defined,
[TABLE]
Consequently η is well defined.
For all x+Kerχ,y+Kerχ∈R1/wKerχ⊂Nr(B)∗(R1/wKerχ),
[TABLE]
and
[TABLE]
Therefore η is a restricted nearness homomorphism by Definition
13. Hence, R1/wKerχ≃rnχ(R1).
∎