# Roughness in Lattice Ordered Effect Algebras

Authors: Xiao Long Xin; Xiu Juan Hua; Xi Zhu
Journal: The Scientific World Journal
 (2014)

---

## Abstract

Many authors have studied roughness on various algebraic systems. In this paper, we consider a lattice ordered effect algebra and discuss its roughness in this context. Moreover, we introduce the notions of the interior and the closure of a subset and give some of their properties in effect algebras. Finally, we use a Riesz ideal induced congruence and define a functione(a,b) in a lattice ordered effect algebra E and build a relationship between it and congruence classes. Then we study some properties about approximation of lattice ordered effect algebras.


---

## Body

## 1. Introduction

Quantum effects play a basic role in the foundations of quantum mechanics. In 1994, Foulis and Bennett introduced effect algebras for modeling unsharp measurement in a quantum mechanical system [1]. In the same year, Kôpka and Chovanec introduced equivalent structures called D-posets [2]. It is a generalization of many structures which arise in quantum physics [3] and in mathematical economics [4, 5], in particular, of orthomodular lattices in noncommutative measure theory and MV-algebras in fuzzy measure theory. Effect algebras were originally introduced as partial algebraic structures and after 1994, there have been a great number of papers concerning effect algebras [6–11]. They are a generalization of many structures which arise in quantum physics.The theory of rough sets was first introduced by Pawlak [12] as a tool for dealing with granularity in knowledge. Rough set theory, a new mathematical approach to deal with inexact, uncertain, or vague knowledge, has recently received wide attention on the research areas in both of the real life applications and the theory itself. Rough set theory assumes that every object in a universe of discourse is linked with some form of characterizations. Objects described using the same characterizations are indiscernible. An elementary set in a rough set theory consists of all indiscernible objects and forms the smallest piece of knowledge about the universe. All the elementary sets form a partition of the universe. Any set formed from a union of elementary sets is called an observable, definable, or crisp set. Otherwise, it is called a rough (vague) set. Due to the granularity of knowledge, rough sets cannot be characterized by using available knowledge. Therefore with every rough set we associate two crisp sets, called its lower and upper approximation. Intuitively, the lower approximation of a set consists of all elements that surely belong to the set, whereas the upper approximation of the set constitutes all elements that possibly belong to the set. The difference of the upper and the lower approximation is a boundary region. It consists of all elements that cannot be classified uniquely to the set or its complement, by employing available knowledge. Thus any rough set, in contrast to a crisp set, has a nonempty boundary region. The lower and upper approximations form the most precise approximations of the given by crisp sets. It is well known that a partition induces an equivalence relation on a universe and vice versa. The properties of rough sets can thus be examined via either partitions or equivalence classes. Rough set theory is emerging as a powerful theory dealing with imperfect data. It is an expending research area which stimulates explorations on both real world applications and on the theory itself. It has found practical applications in many areas such as knowledge discovery, data analysis, approximate classification, and conflict analysis. The reader will find in [4, 5, 8, 12–25] the deep study of rough set theory. It soon invoked a natural question concerning possible connection between rough sets and algebras. Davvaz discussed the roughness of ring [4], Hv-group [13], Hv-module [14], hyperring [15], and so on. In [26], as a generalization of ideals in BCK-algebras, the notion of rough ideals is discussed.Events of quantum logics do not describe “unsharp measurements” since unsharp measurements do not have a “yes-no” character. To include such events another algebraic structure was introduced by Foulis and Bennett (1994), called an effect algebra. Hence elements of an effect algebraE can be regarded as (possibly) unsharp experimentally testable propositions about a physical system. A subset X of E can be regarded as (possibly) some unsharp experimentally testable propositions about a physical system. We think about a rough approximation of X to be the set of propositions which is indiscernible with some propositions in X. It means that two propositions p and q are observable simultaneously in terms of quantum measurement theory that p, q∈E are indiscernible.In this paper, we discuss the roughness of lattice ordered effect algebra and introduce the notions of the interior and the closure of a subset. We give some properties of the interior and the closure of a subset in lattice ordered effect algebras.


## 2. Basic Concepts and Properties of Effect Algebras and Approximation Spaces

### 2.1. Effect Algebras

In this section, we recall some definitions and results which will be used in the sequel.Definition 1 (Foulis and Bennett [1]).
An effect algebra is a partial algebraE with partial binary operation ⊕ and two nullary operations 0 and 1 satisfying the following axioms.(E1)
a⊕b=b⊕a if a⊕b is defined.(E2)
(a⊕b)⊕c=a⊕(b⊕c) if one side is defined.(E3)
For everya∈E there exists a unique b∈E such that a⊕b=1.(E4)
If1⊕a is defined then a=0.Example 2 (Gudder [27]).
(1) A simple example of an effect algebra is[0,1]⊆R, where a⊥b is defined by a+b≤1, in which case a⊕b=a+b.
(2) Another example is ann-chain, Cn={0,a,2a,…,na=1}, where ia⊥ja if and only if i+j≤n for i, j=0,1,2,…,n, in which case ia⊕ja=(i+j)a.
(3) LetH be a complex Hilbert space and let Φ(H) be the set of all bounded self-adjoint operators on H. The positive cone Φ(H)+ in Φ(H) is the set of all A∈Φ(H) that satisfy 〈Ax,x〉≥0 for all x∈H. We then write A≤B if B-A∈Φ(H)+. Letting 0 and 1 be the zero and identity operators, respectively, we have that 1∈Φ(H)+ and (Φ(H),+,0,≤) is a partially ordered Abelian group. It can be checked that ℘(H)=Φ(H)+[0,1] is an effect algebra but not a Boolean effect algebra.Having an effect algebraE, we can introduce a partial order ≤ on E: a≤b iff there exists c:a⊕c=b. We denote b⊖a=c iff a⊕c=b. It is easy to check that ⊖ is a well defined partial operation. In [7], a class of partial structures equivalent to effect algebra, so-called D-posets, was introduced independently. The axioms for D-posets are based on ⊖.As usual, we denote1⊖x by x′. Further, we denote a⊥b iff a⊕b exists iff a≤b′ iff b≤a′. If E is an effect algebra and (E,≤) is a lattice, then E is called lattice ordered and it is said to be distributive iff, as a poset, it forms a distributive lattice. Every lattice ordered effect algebra satisfies the De Morgan law: (a∨b)′=a′∧b′. Lattice ordered effect algebras are called D-lattices in [2]. If (E,≤,0,1) is a bounded lattice with the orthosupplement operation ′ satisfying the orthomodular law: for all a,b∈E, a≤b⇒b=a∨(a∨b′)′, then (E,≤) is said to be orthomodular lattice.Lemma 3 (Foulis and Bennett [1]).
LetE be an effect algebra, a, b∈E.(1)
a⊥b⇒b⊥a,(2)
a′′=a,(3)
1′=0and0′=1,(4)
a⊕a′=1,(5)
a⊥0anda⊕0=a,(6)
a⊥1⇔a=0,(7)
a⊕b=0⇒a=b=0.(8)
a⊥b⇒a⊥(a⊕b)′anda⊕(a⊕b)′=b′,(9)
a⊥b⇔a≤b′,(10)
a≤b⇒b′≤a′,(11)
a≤b⇒a⊥(a⊕b′)′ and a⊕(a⊕b′)′=b.Lemma 4 (Foulis and Bennett [1]).
LetE be an effect algebra. If a, b∈E with a≤b, then(i)
a=b⇔b⊖a=0,(ii)
a=0⇔b⊖a=b,(iii)
b⊖a≤banda=b⊖(b⊖a),(iv)
c≤b⊖a⇒a≤b⊖cand(b⊖a)⊖c=(b⊖c)⊖a,(v)
b⊖a=(a⊕b′)′,(vi)
a⊕b′=(b⊖a)′.Lemma 5 (Foulis and Bennett [1]).
LetE be an effect algebra. If p,q,r∈E and p≤q≤r, then the following statements hold:(i)
r=p⊕(q⊖p)⊕(r⊖q),(ii)
r⊖p=(q⊖p)⊕(r⊖q),(iii)
(r⊖p)⊖(r⊖q)=q⊖p,(iv)
r⊖(q⊖p)=p⊕(r⊖q).Lemma 6 (Riečanová [28]).
In an effect algebra(E,⊕,0,1), the following statements are satisfied.(i)
For alla,b,u,v∈E, ifu≤a,v≤b, anda⊥b, thenu⊕vis defined.(ii)
For alla,b,c∈E, ifb⊥c, thena≤bif and only ifa⊕c≤b⊕c.(iii)
For alla,b∈E,a≤bif and only ifb′≤a′.
Moreover, if
E
is lattice ordered, for all
a
,
b
,
c
∈
E
, we have the following.
(iv)
If
a
⊥
c
and
b
⊥
c
, then
(
a
⊕
c
)
∨
(
b
⊕
c
)
=
(
a
∨
b
)
⊕
c
.
(v)
If
a
≥
c
,
b
≥
c
, then
(
a
⊖
c
)
∨
(
b
⊖
c
)
=
(
a
∨
b
)
⊖
c
.Definition 7 (Foulis and Bennett [1]).
A subsetQ of an effect algebra (E,⊕,0,1) is called a subeffect algebra of E if and only if 0,1∈Q, Q is closed under p↦p′, and for all p,q∈Q, p⊥q⇒p⊕q∈Q.Definition 8 (Gudder [29]).
Let(E,⊕,0,1) be an effect algebra; an element a∈E is called sharp if a∧a′=0. The set of all sharp elements is denoted by ES.In [29] it has been shown that in a lattice ordered effect algebra E, ES is a subeffect algebra that is an orthomodular lattice. Obviously, in an effect algebra E, 0,1∈ES.Definition 9 (Greechie et al. [30]).
LetE be an effect algebra. If e∈E, for p,q∈E, p⊥q and p,q≤e⇒p⊕q≤e, then e is called principal.Definition 10 (Greechie et al. [30]).
An elementa of an effect algebra E is called central, if(1)
a and a′ are principal,(2)
for everyb∈E there are b1,b2∈E such that b1≤a, b2≤a′ and b=b1⊕b2.The centerC(E) of the effect algebra E is the set of all central elements of E. C(E) is a subeffect algebra of the effect algebra E and forms a Boolean algebra (see [30]).Definition 11 (Ma [10]).
Let(E,⊕,0,1) be an effect algebra. A nonempty subset I of (E,⊕,0,1) is said to be an effect algebra ideal of (E,⊕,0,1), if the following conditions are satisfied: for all a,b∈E,(i)
a∈I, b≤a implies b∈I,(ii)
a⊖b∈I, b∈I implies a∈I.Equivalently, a nonempty subsetI of the effect algebra (E,⊕,0,1) is an effect algebra ideal iff it satisfies the condition that if a⊕b is defined, then a⊕b∈I⇔a,b∈I.Definition 12 (Jenca and Pulmannová [9]).
Let(E,⊕,0,1) be an effect algebra and let I be an ideal I of E. If for any i∈I, a,b∈E, a⊥b, i≤a⊕b implies that there are a1,b1∈I, a1≤a, b1≤b with i≤a1⊕b1, one calls I a Riesz ideal.Definition 13 (Jenca and Pulmannová [9]).
Let(E,⊕,0,1) be an effect algebra and let I be an ideal I of E. Define a binary relation ~I on E by a~Ib if and only if there are i,j∈I, i≤a, j≤b such that a⊖i=b⊖j.Equivalently,a~Ib if and only if there is k∈E, k≤a,b and a⊖k, b⊖k∈I.In particular, for eacha∈E we have a~I0 if and only if a∈I.Definition 14 (Jenca and Pulmannová [9]).
A binary relation~ on an effect algebra E is called a congruence relation if the following conditions are satisfied:(i)
~ is an equivalence relation,(ii)
a~a1, b~b1, a⊥b, a1⊥b1 implies a⊕b~a1⊕b1,(iii)
ifa~b, b⊥c then there exists d∈E such that d~c and a⊥d.Lemma 15 (Jenca and Pulmannová [9]).
LetI be an ideal in an effect algebra E. Then ~I is a congruence if and only if I is a Riesz ideal.This means thata~Ib implies a⊕c~Ib⊕c. The equivalence class of a∈E is denoted by [a]I. Note that if I,J are Riesz ideals and I⊆J, then [a]I⊆[a]J.Definition 16 (Foulis and Bennett [1]).
LetE, F be effect algebras. A mapping h:E→F is said to be(i)
a morphism iffh(1)=1 and a,b∈E with a⊥b⇒h(a)⊥h(b) and h(a⊕b)=h(a)⊕h(b);(ii)
a homomorphism iffh is a morphism and a,b∈E with a∧b=0⇒h(a)∧h(b)=0;(iii)
a monomorphism iffh is a morphism and a,b∈E with h(a)≤h(b)⇒a≤b.A morphismh:E→F is called a ∧-morphism if h(a∧b)=h(a)∧h(b) whenever a∧b exists in E. A morphism h such that a⊥b iff h(a)⊥h(b) is a monomorphism. It is clear that h(0)=0 and that for a,b∈E, a≤b⇒h(a)≤h(b) with h(b⊖a)=h(b)⊖h(a). In particular, h(a′)=h(a)′ (see [1]).Lemma 17 (Ma [10]).
IfE is an effect algebra in which every element is principle, then for all x,y∈E, x⊥y implies that x⊕y=x∨y.Remark 18.
An MV-algebra is the same thing as a lattice ordered effect algebra in which disjoint pairs and a Boolean algebra is the same thing as a distributive lattice ordered effect algebra in which orthogonal pairs are disjoint pairs. Also, every MV-algebra is distributive.


### 2.2. Approximation Spaces

LetU denote a finite set and let θ⊆U×U be an indiscernibility relation on U. Apr is defined to be the pair (U,θ) and is called an approximation space. Intuitively, elements of a θ-equivalence class are to be regarded as indiscernible from one another.Definition 19.
For an approximation space(U,θ), by a rough approximation in (U,θ) one means a mapping Apr:P(U)→P(U)×P(U) defined for every X∈P(U) by Apr(X)=(X0,X¯) where X¯={x∈U:[x]θ∩X≠∅}, X0={x∈U:[x]θ⊆X}. Here X0 is called the interior (or the lower rough approximation) of X, X¯ is called the closure (or the upper rough approximation) of X, and X¯∖X0 is called the boundary of X. Apr(X) is called the rough approximation of X (or the rough set) in (U,θ) (see [4, 5, 13–17, 19–21, 23–25, 31, 32]).For the sake of illustration, we give the following example (see [4]).Example 20.
Let(U,θ) be an approximation space, where U={x1,x2,…,x8} and let θ be an equivalence relation with the following equivalence classes:
(1)E1={x1,x4,x8},E2={x2,x5,x7},E3={x3},E4={x6}.LetX={x3,x5}; then X0={x3} and X¯={x2,x3,x5,x7} and so ({x3},{x2,x3,x5,x7})=Apr(X) is a rough set.Now, we give an example of the lower and upper approximation theory applied to effect algebras.Example 21.
LetE consist of the six distinct elements 0, p, q, p′, q′, 1, where p′ and q′ are the only nonzero elements which are orthogonal to p and q, respectively. Furthermore, let p⊕p′=q⊕q′=1. See the following table. Then E is an effect algebra. Denote by I the set {0,p,q} and by θ the equivalence relation defined as follows:∀
a
,
b
∈
E, [aθb⇔ either a,b∈I or a,b∉I],
(2)⊕0pqp′q′100pqp′q′1pp1qq1p′p′1q′q′111Clearlyθ is a congruence and [0]θ=[p]θ=[q]θ=I and [p′]θ=[q′]θ=[1]θ={p′,q′,1}. Let X={0,1}; then X0=∅ and X¯=E.Let(U,θ) be an approximation space and let X be a subset of U.(i)
IfX0=X¯, then X is called a crisp set.(ii)
IfX0=∅, then X is called having an empty interior with respect to θ.(iii)
We defineU∖X¯ to be the exterior of X. If X¯=U, then X is called having an empty exterior with respect to θ.Let(U,θ) be an approximation space. Clearly, ∅ and U are definable with respect to θ. The family of all crisp sets is denoted by Cri(Apr).Example 22.
In Example20, X is not a crisp set, has no empty interior, and has no empty exterior with respect to θ. In Example 21, X is not a crisp set, but it has empty interior and empty exterior with respect to θ.


## 2.1. Effect Algebras

In this section, we recall some definitions and results which will be used in the sequel.Definition 1 (Foulis and Bennett [1]).
An effect algebra is a partial algebraE with partial binary operation ⊕ and two nullary operations 0 and 1 satisfying the following axioms.(E1)
a⊕b=b⊕a if a⊕b is defined.(E2)
(a⊕b)⊕c=a⊕(b⊕c) if one side is defined.(E3)
For everya∈E there exists a unique b∈E such that a⊕b=1.(E4)
If1⊕a is defined then a=0.Example 2 (Gudder [27]).
(1) A simple example of an effect algebra is[0,1]⊆R, where a⊥b is defined by a+b≤1, in which case a⊕b=a+b.
(2) Another example is ann-chain, Cn={0,a,2a,…,na=1}, where ia⊥ja if and only if i+j≤n for i, j=0,1,2,…,n, in which case ia⊕ja=(i+j)a.
(3) LetH be a complex Hilbert space and let Φ(H) be the set of all bounded self-adjoint operators on H. The positive cone Φ(H)+ in Φ(H) is the set of all A∈Φ(H) that satisfy 〈Ax,x〉≥0 for all x∈H. We then write A≤B if B-A∈Φ(H)+. Letting 0 and 1 be the zero and identity operators, respectively, we have that 1∈Φ(H)+ and (Φ(H),+,0,≤) is a partially ordered Abelian group. It can be checked that ℘(H)=Φ(H)+[0,1] is an effect algebra but not a Boolean effect algebra.Having an effect algebraE, we can introduce a partial order ≤ on E: a≤b iff there exists c:a⊕c=b. We denote b⊖a=c iff a⊕c=b. It is easy to check that ⊖ is a well defined partial operation. In [7], a class of partial structures equivalent to effect algebra, so-called D-posets, was introduced independently. The axioms for D-posets are based on ⊖.As usual, we denote1⊖x by x′. Further, we denote a⊥b iff a⊕b exists iff a≤b′ iff b≤a′. If E is an effect algebra and (E,≤) is a lattice, then E is called lattice ordered and it is said to be distributive iff, as a poset, it forms a distributive lattice. Every lattice ordered effect algebra satisfies the De Morgan law: (a∨b)′=a′∧b′. Lattice ordered effect algebras are called D-lattices in [2]. If (E,≤,0,1) is a bounded lattice with the orthosupplement operation ′ satisfying the orthomodular law: for all a,b∈E, a≤b⇒b=a∨(a∨b′)′, then (E,≤) is said to be orthomodular lattice.Lemma 3 (Foulis and Bennett [1]).
LetE be an effect algebra, a, b∈E.(1)
a⊥b⇒b⊥a,(2)
a′′=a,(3)
1′=0and0′=1,(4)
a⊕a′=1,(5)
a⊥0anda⊕0=a,(6)
a⊥1⇔a=0,(7)
a⊕b=0⇒a=b=0.(8)
a⊥b⇒a⊥(a⊕b)′anda⊕(a⊕b)′=b′,(9)
a⊥b⇔a≤b′,(10)
a≤b⇒b′≤a′,(11)
a≤b⇒a⊥(a⊕b′)′ and a⊕(a⊕b′)′=b.Lemma 4 (Foulis and Bennett [1]).
LetE be an effect algebra. If a, b∈E with a≤b, then(i)
a=b⇔b⊖a=0,(ii)
a=0⇔b⊖a=b,(iii)
b⊖a≤banda=b⊖(b⊖a),(iv)
c≤b⊖a⇒a≤b⊖cand(b⊖a)⊖c=(b⊖c)⊖a,(v)
b⊖a=(a⊕b′)′,(vi)
a⊕b′=(b⊖a)′.Lemma 5 (Foulis and Bennett [1]).
LetE be an effect algebra. If p,q,r∈E and p≤q≤r, then the following statements hold:(i)
r=p⊕(q⊖p)⊕(r⊖q),(ii)
r⊖p=(q⊖p)⊕(r⊖q),(iii)
(r⊖p)⊖(r⊖q)=q⊖p,(iv)
r⊖(q⊖p)=p⊕(r⊖q).Lemma 6 (Riečanová [28]).
In an effect algebra(E,⊕,0,1), the following statements are satisfied.(i)
For alla,b,u,v∈E, ifu≤a,v≤b, anda⊥b, thenu⊕vis defined.(ii)
For alla,b,c∈E, ifb⊥c, thena≤bif and only ifa⊕c≤b⊕c.(iii)
For alla,b∈E,a≤bif and only ifb′≤a′.
Moreover, if
E
is lattice ordered, for all
a
,
b
,
c
∈
E
, we have the following.
(iv)
If
a
⊥
c
and
b
⊥
c
, then
(
a
⊕
c
)
∨
(
b
⊕
c
)
=
(
a
∨
b
)
⊕
c
.
(v)
If
a
≥
c
,
b
≥
c
, then
(
a
⊖
c
)
∨
(
b
⊖
c
)
=
(
a
∨
b
)
⊖
c
.Definition 7 (Foulis and Bennett [1]).
A subsetQ of an effect algebra (E,⊕,0,1) is called a subeffect algebra of E if and only if 0,1∈Q, Q is closed under p↦p′, and for all p,q∈Q, p⊥q⇒p⊕q∈Q.Definition 8 (Gudder [29]).
Let(E,⊕,0,1) be an effect algebra; an element a∈E is called sharp if a∧a′=0. The set of all sharp elements is denoted by ES.In [29] it has been shown that in a lattice ordered effect algebra E, ES is a subeffect algebra that is an orthomodular lattice. Obviously, in an effect algebra E, 0,1∈ES.Definition 9 (Greechie et al. [30]).
LetE be an effect algebra. If e∈E, for p,q∈E, p⊥q and p,q≤e⇒p⊕q≤e, then e is called principal.Definition 10 (Greechie et al. [30]).
An elementa of an effect algebra E is called central, if(1)
a and a′ are principal,(2)
for everyb∈E there are b1,b2∈E such that b1≤a, b2≤a′ and b=b1⊕b2.The centerC(E) of the effect algebra E is the set of all central elements of E. C(E) is a subeffect algebra of the effect algebra E and forms a Boolean algebra (see [30]).Definition 11 (Ma [10]).
Let(E,⊕,0,1) be an effect algebra. A nonempty subset I of (E,⊕,0,1) is said to be an effect algebra ideal of (E,⊕,0,1), if the following conditions are satisfied: for all a,b∈E,(i)
a∈I, b≤a implies b∈I,(ii)
a⊖b∈I, b∈I implies a∈I.Equivalently, a nonempty subsetI of the effect algebra (E,⊕,0,1) is an effect algebra ideal iff it satisfies the condition that if a⊕b is defined, then a⊕b∈I⇔a,b∈I.Definition 12 (Jenca and Pulmannová [9]).
Let(E,⊕,0,1) be an effect algebra and let I be an ideal I of E. If for any i∈I, a,b∈E, a⊥b, i≤a⊕b implies that there are a1,b1∈I, a1≤a, b1≤b with i≤a1⊕b1, one calls I a Riesz ideal.Definition 13 (Jenca and Pulmannová [9]).
Let(E,⊕,0,1) be an effect algebra and let I be an ideal I of E. Define a binary relation ~I on E by a~Ib if and only if there are i,j∈I, i≤a, j≤b such that a⊖i=b⊖j.Equivalently,a~Ib if and only if there is k∈E, k≤a,b and a⊖k, b⊖k∈I.In particular, for eacha∈E we have a~I0 if and only if a∈I.Definition 14 (Jenca and Pulmannová [9]).
A binary relation~ on an effect algebra E is called a congruence relation if the following conditions are satisfied:(i)
~ is an equivalence relation,(ii)
a~a1, b~b1, a⊥b, a1⊥b1 implies a⊕b~a1⊕b1,(iii)
ifa~b, b⊥c then there exists d∈E such that d~c and a⊥d.Lemma 15 (Jenca and Pulmannová [9]).
LetI be an ideal in an effect algebra E. Then ~I is a congruence if and only if I is a Riesz ideal.This means thata~Ib implies a⊕c~Ib⊕c. The equivalence class of a∈E is denoted by [a]I. Note that if I,J are Riesz ideals and I⊆J, then [a]I⊆[a]J.Definition 16 (Foulis and Bennett [1]).
LetE, F be effect algebras. A mapping h:E→F is said to be(i)
a morphism iffh(1)=1 and a,b∈E with a⊥b⇒h(a)⊥h(b) and h(a⊕b)=h(a)⊕h(b);(ii)
a homomorphism iffh is a morphism and a,b∈E with a∧b=0⇒h(a)∧h(b)=0;(iii)
a monomorphism iffh is a morphism and a,b∈E with h(a)≤h(b)⇒a≤b.A morphismh:E→F is called a ∧-morphism if h(a∧b)=h(a)∧h(b) whenever a∧b exists in E. A morphism h such that a⊥b iff h(a)⊥h(b) is a monomorphism. It is clear that h(0)=0 and that for a,b∈E, a≤b⇒h(a)≤h(b) with h(b⊖a)=h(b)⊖h(a). In particular, h(a′)=h(a)′ (see [1]).Lemma 17 (Ma [10]).
IfE is an effect algebra in which every element is principle, then for all x,y∈E, x⊥y implies that x⊕y=x∨y.Remark 18.
An MV-algebra is the same thing as a lattice ordered effect algebra in which disjoint pairs and a Boolean algebra is the same thing as a distributive lattice ordered effect algebra in which orthogonal pairs are disjoint pairs. Also, every MV-algebra is distributive.


## 2.2. Approximation Spaces

LetU denote a finite set and let θ⊆U×U be an indiscernibility relation on U. Apr is defined to be the pair (U,θ) and is called an approximation space. Intuitively, elements of a θ-equivalence class are to be regarded as indiscernible from one another.Definition 19.
For an approximation space(U,θ), by a rough approximation in (U,θ) one means a mapping Apr:P(U)→P(U)×P(U) defined for every X∈P(U) by Apr(X)=(X0,X¯) where X¯={x∈U:[x]θ∩X≠∅}, X0={x∈U:[x]θ⊆X}. Here X0 is called the interior (or the lower rough approximation) of X, X¯ is called the closure (or the upper rough approximation) of X, and X¯∖X0 is called the boundary of X. Apr(X) is called the rough approximation of X (or the rough set) in (U,θ) (see [4, 5, 13–17, 19–21, 23–25, 31, 32]).For the sake of illustration, we give the following example (see [4]).Example 20.
Let(U,θ) be an approximation space, where U={x1,x2,…,x8} and let θ be an equivalence relation with the following equivalence classes:
(1)E1={x1,x4,x8},E2={x2,x5,x7},E3={x3},E4={x6}.LetX={x3,x5}; then X0={x3} and X¯={x2,x3,x5,x7} and so ({x3},{x2,x3,x5,x7})=Apr(X) is a rough set.Now, we give an example of the lower and upper approximation theory applied to effect algebras.Example 21.
LetE consist of the six distinct elements 0, p, q, p′, q′, 1, where p′ and q′ are the only nonzero elements which are orthogonal to p and q, respectively. Furthermore, let p⊕p′=q⊕q′=1. See the following table. Then E is an effect algebra. Denote by I the set {0,p,q} and by θ the equivalence relation defined as follows:∀
a
,
b
∈
E, [aθb⇔ either a,b∈I or a,b∉I],
(2)⊕0pqp′q′100pqp′q′1pp1qq1p′p′1q′q′111Clearlyθ is a congruence and [0]θ=[p]θ=[q]θ=I and [p′]θ=[q′]θ=[1]θ={p′,q′,1}. Let X={0,1}; then X0=∅ and X¯=E.Let(U,θ) be an approximation space and let X be a subset of U.(i)
IfX0=X¯, then X is called a crisp set.(ii)
IfX0=∅, then X is called having an empty interior with respect to θ.(iii)
We defineU∖X¯ to be the exterior of X. If X¯=U, then X is called having an empty exterior with respect to θ.Let(U,θ) be an approximation space. Clearly, ∅ and U are definable with respect to θ. The family of all crisp sets is denoted by Cri(Apr).Example 22.
In Example20, X is not a crisp set, has no empty interior, and has no empty exterior with respect to θ. In Example 21, X is not a crisp set, but it has empty interior and empty exterior with respect to θ.


## 3. Approximation in Effect Algebras

In this section, we present some properties of approximation spaces generally and approximation in effect algebras.LetE be an effect algebra, and let I be a Riesz ideal of E and let X be a subset of E. Then the sets XI0={x∈E:[x]I⊆X}, XI¯={x∈E:[x]I∩X≠∅} are called, respectively, the interior and closure (or the lower and upper approximations) of the set X with respect to the ideal I. When U=E and θ is the equivalence relation defined in Definition 14, then we use the pair (E,I) instead of the approximation space (U,θ). Also, in this case we use the symbols XI¯ and XI0 instead of X¯ and X0.Lemma 23.
LetE be an effect algebra, let I be a Riesz ideal of E, and let X be a subset of E. Then the following statements are equivalent:(1)
X is a crisp set;(2)
XI0=X iff XI¯=X;(3)
X is a union of some equivalence classes.Proof.
The proof is trivial.The following properties of approximation spaces are well known and obvious. They are similar to Proposition  3.1 in [4] and Proposition  3.1.1 in [22].Proposition 24.
LetE be an effect algebra and let I be a Riesz ideal of E. For the approximation space (E,I), for arbitrary subsets X,Y⊆E, and for each x∈X, one has(1)
XI0⊆X⊆XI¯,(2)
E and ∅ are crisp sets,(3)
XI0, XI¯, and [X]I are crisp sets with respect to I,(4)
ifX⊆Y, then XI0⊆YI0 and XI¯⊆YI¯,(5)
XI0=(XIc¯)c,(6)
XI¯=((Xc)I0)c,(7)
(X∩Y)I0=XI0∩YI0,(8)
(X∩Y)I¯⊆XI¯∩YI¯,(9)
(X∪Y)I0⊇XI0∪YI0,(10)
(X∪Y)I¯=XI¯∪YI¯,(11)
XE0=∅, XE¯=E,(12)
X{0}0=X, X{0}¯=X.The rough complement ofApr(X) denoted by Aprc(X) is defined by Aprc(X)=(U∖X¯,U∖X0).Proof.
The proof is similar to the [31, Theorem  2.1] and [16, Proposition  4.1].The following example shows that the equations in (8) and (9) of the Proposition24 do not hold.Example 25.
LetE={0,a,b,1}. Consider the following table:
(3)⊕0ab100ab1aa1bb111Then(E;⊕,0,1) is a Boolean effect algebra with the order given by Figure 1. So (E;⊕,0,1) is also a lattice ordered effect algebra. Now, we also can check that I={0,a} is a Riesz ideal. Let X={a,1} and Y={0,b,1} be subsets of E. Then the equivalence classes are [0]I=[a]I={0,a}, [b]I=[1]I={b,1}. Therefore, we have XI0=∅, YI0={b,1}, XI¯=E, YI¯=E, (X∪Y)I0=E, (X∩Y)I¯={b,1}, and so (X∪Y)I0⊈XI0∪YI0, XI¯∩YI¯⊈(X∩Y)I¯.Figure 1Example 26.
LetE={0,a,b,c,d,e,1}. Define a⊕b=b⊕a=c, b⊕c=c⊕b=a⊕d=d⊕a=e⊕e=1, and x⊕0=0⊕x for all x∈E. We can easily see that E is a lattice effect algebra (which is not Boolean). We also can check that I={0,a} is a Riesz ideal. Let X={a,1} and Y={0,b,c} be subsets of E. Then [0]I=[a]I={0,a}, [b]I=[c]I={b,c}, [d]I=[1]I={d,1}, [e]I={e}. Therefore, we have XI¯=∅, YI0={b,c}, XI¯={0,a,d,1}, YI¯={0,a,b,c}, (X∪Y)I0={0,a,b,c}, (X∩Y)I¯=∅, and so (X∪Y)I0⊈XI0∪YI0, XI¯∩YI¯⊈(X∩Y)I¯.LetX be a subset of an effect algebra E and let X∧ be the annihilator of X in E defined by X∧={a∈E:a∧x=0,∀x∈X}. Denote X⊥=(X′)∧, where X′={x′∈E:x∈X}.Proposition 27.
LetI be a Riesz ideal of effect algebra E and let X be a subset of E. Then(1)
(X⊥)I0⊆(XI0)⊥,(2)
XI¯⊥⊆XI⊥¯,(3)
XI¯⊥⊆(XI0)⊥,(4)
(X⊥)I0⊆(X⊥)I¯.Proof.
(1) By Proposition24, we have XI0⊆X. It is easy to see that if X⊆Y then Y⊥⊆X⊥, so we can take X⊥⊆(XI0)⊥ and again by Proposition 24, we have (X⊥)I0⊆(XI0)⊥. Similarly, we can prove (2), (3), and (4).The following example shows that inclusion symbols⊆ in Proposition 27 may not be replaced by equal sign.Example 28.
Let(E;⊕,0,1) be a lattice ordered effect algebra in Example 25. Let X={a}, Y={0,a} be subsets of E and let I={0,a} be a Riesz ideal of E. It is easy to check that X⊥={0,a}, Y⊥={0}, [0]I=[a]I=I, [1]I=[b]I={b,1}. So we have (Y⊥)I0=∅, (YI0)⊥={0}, (YI¯)⊥={0}, (Y⊥)¯I={0,a}. Hence, (YI0)⊥⊈(Y⊥)I0,(Y⊥)I¯⊈YI¯⊥,(Y⊥)I¯⊈(Y⊥)I0.Lemma 29.
LetI, J be two Riesz ideals of effect algebra E such that I⊆J and let X be a subset of E. Then (i)
XJ0⊆XI0,(ii)
XI¯⊆XJ¯.Proof.
It is straightforward.


## 4. Approximation in Lattice Ordered Effect Algebras

In this section, we define a functione(a,b) in a lattice ordered effect algebra E and build a relationship between it and congruence classes. Then we study some properties about approximation in lattice ordered effect algebras.We give some examples of lattice ordered effect algebras.Example 30.
(1) In Example2 (1), [0,1]⊆R is also a lattice ordered effect algebra.
(2) LetG be a partially ordered abelian group with an operator “+”. Let u∈G with u>0, and let L:=G+[0,u]={g∈G∣0≤g≤u}. Then L can be organized into a lattice ordered effect algebra (L,0,u,⊕) by defining p⊕q iff p+q≤u, in which case p⊕q=p+q. In the effect algebra L we have a′=u-a and the effect algebra partial order on L coincides with the restriction to L of the partial order on G. An effect algebra of the form G+[0,u] (or isomorphic to an effect algebra of this form) is called an interval effect algebra or, for short, an interval algebra.
(3) Effect algebraE in Example 25 is a lattice ordered effect algebra.In a lattice ordered effect algebraE, we define e(a,b)=(a⊖(a∧b))∨(b⊖(a∧b)).Proposition 31.
LetE be a lattice ordered effect algebra. Then the following properties hold for every a,b,c∈E:(i)
e(a,b)=e(b,a),(ii)
e(a,b)=0 if and only if a=b,(iii)
e(a,b)=e(a′,b′),(iv)
e(a,b)≤e(a,c)∨e(c,b), if c≤a∧b.Proof.
(i) and (ii) are obvious. (iii):e(a,b)=(a⊖(a∧b))∨(b⊖(a⊖b))=(a∨b)⊖(a∧b), e(a′,b′)=(a′∨b′)⊖(a∨b)′=(a∧b)′⊖(a∨b)′=(1⊖(a∧b))⊖(1⊖(a∨b)), by Lemma 5, we have e(a′,b′)=(a∨b)⊖(a∧b). (iv): e(a,b)=(a⊖(a∧b))∨(b⊖(a∧b))=(a∨b)⊖(a∧b), e(a,c)=(a⊖(a∧c))∨(c⊖(a∧c))=(a∨c)⊖(a∧c), e(b,c)=(b⊖(b∧c))∨(c⊖(b∧c))=(b∨c)⊖(b∧c); if c≤a∧b, we have e(a,c)∨e(c,b)≥e(a,b).Lemma 32 (Jenca and Pulmannová [9]).
LetI be a Riesz ideal in a lattice ordered effect algebra E. Then I is a lattice ideal and ~I is a lattice congruence. Moreover for all a,b∈E, a~Ib if and only if (a⊖(a∧b))∨(b⊖(a∧b))∈I.From the lemma, we have that ifI is a Riesz ideal in a lattice ordered effect algebra E, then for all a,b∈E, a~Ib if and only if e(a,b)∈I.Definition 33.
LetE be an effect algebra and let X be a subset of E. Then X is called convex if for every x,y∈X and z∈E, x≤z≤y implies z∈X.Proposition 34.
LetI be a Riesz ideal of effect algebra E. Then [a]I is convex for each a∈E.Proof.
Givena∈E, take t,s∈[a]I with t≤s and let t≤z≤s. Since z⊖t≤s⊖t~I0, we have z⊖t~I0, too. Hence, z~It. That is z∈[a]I. So [a]I is convex for each a∈E.Lemma 35.
LetI be a Riesz ideal of linear ordered effect algebra E. If a≤b and [a]I≠[b]I, then for each t∈[a]I and s∈[b]I, t≤s.Proof.
Suppose that there existt∈[a]I and s∈[b]I such that s<t. We show that it is a contradiction. First, let t≤b. So we obtain s≤t≤b and by Proposition 34, t∈[b]I which is a contradiction. Now let b≤t. Thus a≤b≤t and by Proposition 34, b∈[a]I which is a contradiction again. Therefore for each t∈[a]I and s∈[b]I, t≤s.IfX is a subset of lattice ordered effect algebra E, it is easy to check that for every X,Y⊆E if we have X⊆Y, then X′⊆Y′.Theorem 36.
LetE be a lattice ordered effect algebra and let I be a Riesz ideal of E. Let X be a subset of E. Then(i)
(XI¯)′=XI′¯,(ii)
(XI0)′=(X′)I0.Proof.
(i) Letx∈(XI¯)′, so x′∈XI¯ by Lemma 3 and X′={x′:x∈X}. Therefore, [x′]I∩X≠∅. Hence there exists y∈[x′]I∩X. By Lemma 32 we have e(y,x′)∈I and y∈X. By Proposition 31, e(y′,x)∈I and y′∈X′, so y′∈[x]I∩X′ and this implies that x∈XI′¯. Conversely, let x∈XI′¯, so [x]I∩X′≠∅. Suppose that y∈[x]I∩X′; then y′∈[x′]I∩X. Similarly, x∈(XI¯)′ and this proves part (i).
(ii) Letx∈(XI0)′, so x′∈XI0 by Lemma 3. Therefore, [x′]I⊆X. Hence for each y∈[x′]I, we have e(y,x′)∈I and hence e(y′,x)∈I by Proposition 31. This implies that y′∈[x]I⊆X′. So x∈(X′)I0. Conversely, let x∈(X′)I0, so [x]I⊆X′. Suppose that y∈[x]I⊆X′; then y′∈[x′]I⊆X by Proposition 31. Hence x′∈XI0. By Lemma 3 and X′={x′:x∈X} again, we have x∈(XI0)′ and this proves part (ii).Theorem 37.
LetE be a lattice ordered effect algebra and let X be a subeffect algebra of E. Then(i)
XI¯ is a subeffect algebra of E,(ii)
ifX is an ideal and I⊆X, then XI0 is a subeffect algebra of E.Proof.
(i) Since0,1∈X, then 0,1∈XI¯. For a∈XI¯, there exists x∈X such that x∈[a]I; then x′∈X⊆XI¯. Since x′~Ia′, so [a′]I∩X≠∅, therefore a′∈XI¯. Let a,b∈XI¯ and a⊥b, then there are x∈[a]I, y∈[b]I, such that x,y∈X and x⊥y. Since X is subeffect algebra of E, we have x⊕y∈X. Note that x~Ia and y~Ib; we have x⊕y~Ia⊕b and hence x⊕y∈[a⊕b]I∩X. That is, a⊕b∈XI¯.
(ii) LetI⊆X. First we prove 0∈XI0 and 1∈XI0. For all x∈[0]I, by Definition 13, we have x⊖i=0⊖0, i≤x, i∈I, thus x=i∈I⊆X, so [0]I⊆X, therefore 0∈XI0. Similarly, 1∈XI0 can be proved. Then we prove that x∈XI0 implies x′∈XI0. For all y∈[x′]I, we have y′~Ix. It follows that y′∈X, then y∈X. Therefore x′∈XI0. Let x,y∈XI0 and x⊥y. For all z∈[x⊕y]I, by Definition 13, we have z⊖i=(x⊕y)⊖j≤x⊕y∈X, i≤z, j≤x⊕y, i∈I. This yields that z⊖i∈X, thus z∈X. Therefore x⊕y∈XI0.By the above theorem, we note thatII¯ and II0 are subeffect algebras of E.Remark 38.
LetE be a lattice ordered effect algebra. Then(1)
(ES)I¯ is a subeffect algebra of E,(2)
C(E)I¯ is a subeffect algebra of E.We define a Boolean effect algebra to be an effect algebraE such that E=C(E) and an orthomodular effect algebra to be a lattice ordered effect algebra in which every element is principal.Proposition 39.
LetI be a Riesz ideal of a linear ordered effect algebra E and let X be a convex subset of E. Then XI0 and XI¯ are convex.Proof.
Letx,y∈XI0 and x≤z≤y. We divide the proof into three cases. First let x~Iy, we have x,y∈[a]I for some a∈E. By Proposition 34, [a]I is convex, so that z∈[a]I. It follows that [z]I=[a]I=[x]I⊆X; therefore z∈XI0. Next let [x]I≠[y]I and z∈[x]I. Then [z]I=[x]I. Since x∈XI0, [z]I=[x]I⊆X. So z∈XI0. Similarly for [x]I≠[y]I and z∈[y]I, we can prove that z∈XI0 and we omit it. Finally let [x]I≠[y]I, z∈_[x]I, and z∈_[y]I. Now we show [z]I⊆X. So let t∈[z]I. By Lemma 35, for all u∈[x]I and v∈[y]I we have u≤t≤v. Since [x]I,[y]I⊆X, we have u,v∈X. Note that X is convex; we obtain t∈X and hence [z]I⊆X. It follows that z∈XI0. This shows that XI0 is convex.
Now, letx,y∈XI¯ and x≤z≤y. We divide the proof into three cases. First let x~Iy; we have x,y∈[a]I for some a∈E. By Proposition 34, [a]I is convex, so that z∈[a]I. It follows that [z]I=[a]I=[x]I and [x]I∩X≠∅; therefore [z]I∩X≠∅. Hence z∈XI¯. Next let [x]I≠[y]I and z∈[x]I. Then [z]I=[x]I. Since x∈XI¯, then [x]I∩X≠∅ and hence [z]I∩X≠∅. Therefore z∈XI¯. Similarly for [x]I≠[y]I and z∈[y]I, we can prove that z∈XI¯. Now let [x]I≠[y]I, z∈¯[x]I, and z∈¯[y]I. We must show [z]I∩X≠∅. Since x,y∈XI¯, we have [x]I∩X≠∅ and [y]I∩X≠∅. So there exist u∈[x]I∩X and v∈[y]I∩X. By Lemma 35, we have u≤z≤v. So z∈X since X is convex. This implies that [z]I∩X≠∅ and hence XI¯ is convex.Proposition 40.
LetE be a lattice ordered effect algebra, I and J two Riesz ideals of E, and X a subset of E.(i)
IfX is an ideal of E and I,J⊆X, then XI0∩XJ0=XI∩J0,(ii)
IfX is crisp with respect to I or J, then XI∩J¯=XI¯∩XJ¯.Proof.
(i) By Lemma29, XI0∩XJ0⊆XI∩J0. Conversely, assume x∈XI∩J0. Then [x]I∩J⊆X and hence x∈X. Now, let y∈[x]I, so e(x,y)∈I⊆X. Because X is an ideal and x∈X, so x∧y∈X. Hence we have e(x,y)⊕(x∧y)∈X. On the other hand, by Lemma 6, we have e(x,y)=(x∨y)⊖(x∧y) and so y≤x∨y=e(x,y)⊕(x∧y). This means that y∈X, which implies x∈XI0. Similarly, we can obtain x∈XJ0 and so x∈XI0∩XJ0. Therefore XI0∩XJ0=XI∩J0.
(ii) First, assume thatX is crisp with respect to I, so XI¯=X. Therefore, we have XI¯∩XJ¯=X∩XI¯=X⊆XI∩J¯. Also by Lemma 29, XI∩J¯⊆XI¯∩XJ¯, and it proves the theorem.


## 5. Approximation in Orthomodular Effect Algebras and Boolean Effect Algebras

We define a Boolean effect algebra to be an effect algebraE such that E=C(E) and an orthomodular effect algebra to be a lattice ordered effect algebra in which every element is principal.LetX and Y be subsets of E. We define X∨Y={a∨b:a∈X,b∈Y} and define the downset X↓={c∈E:∃a∈X,c≤a}.Proposition 41.
LetE be an orthomodular effect algebra and let I be a Riesz ideal of E, and let X, Y be subsets of E. Then ((X∨Y)↓)I¯⊆(XI¯∨YI¯)↓.Proof.
Leta∈((X∨Y)↓)I¯, so [a]I∩(X∨Y)↓≠∅. Thus there exists b∈[a]I∩(X∨Y)↓ and consequently there exist x∈X and y∈Y such that b≤x∨y. On the other hand, since [a]I=[b]I, by Definition 13, there are i,j∈I, i≤a, j≤b such that a=(b⊖j)⊕i≤b∨i≤x∨y∨i=(x∨i)∨y. By Lemma 32, [x∨i]I=[x]I, x∈XI¯ and y∈YI¯, hence a∈(XI¯∨YI¯)↓.Proposition 42.
LetE be an orthomodular effect algebra and let I be a Riesz ideal of E, and let X, Y be subsets of E. Then (XI0∨YI0)↓⊆((X∨Y)↓)I0.Proof.
Suppose thata∈(XI0∨YI0)↓, so there exist x∈XI0 and y∈YI0 such that a≤x∨y. Now, let b∈[a]I; thus by by Definition 13, there are i,j∈I, i≤a, j≤b such that b=(a⊖i)⊕j≤a∨j≤x∨y∨j=(x∨j)∨y. By Lemma 32, we have x∨j∈[x∨j]I=[x]I⊆X and y∈Y. Hence b∈X∨Y, this implies that a∈((X∨Y)↓)I0.The following example shows that we can not replace the inclusion symbol⊆ by equal sign in Proposition 42.Example 43.
ConsiderE={0,a,b,c,d,e,1}, as the lattice-ordered effect algebra in Example 26. Let X={0}, Y={0,b,c,1} be the subsets of E and let I={0,a} be the Riesz ideal of E. We have (X∨Y)↓=E, XI0=∅ and YI0={b,c}. Therefore ((X∨Y)↓)I0=E and (XI0∨YI0)↓=∅. This shows that (XI0∨YI0)↓≠((X∨Y)↓)I0.In what follows, that is, Propositions44, 45, 47, 49, Examples 46 and 51, and Corollary 48, E is a Boolean effect algebra.Proposition 44.
LetE be a Boolean effect algebra and let I, J be two Riesz ideals of E. Then (I∨J)↓ is also a Riesz ideal of E.Proof.
Leta,b∈(I∨J)↓ and a⊥b; then a≤x1∨y1, b≤x2∨y2, where xi∈I, yi∈J, i=1,2. Since a⊕b=a∨b, then a⊕b≤(x1∨y1)∨(x2∨y2)=(x1∨x2)∨(y1∨y2)∈(I∨J)↓. So (I∨J)↓ is an ideal. Let x∈(I∨J)↓; then x≤i∨j, where i∈I, j∈J. For a,b∈E, a⊥b and x≤a⊕b, we have x≤(a∨b)∧(i∨j). Taking a1=a∧(i∨j)=(a∧i)∨(a∧j), b1=(b∧i)∨(b∧j), we have a1,b1∈(I∨J)↓ and a1≤a, b1≤b. Since E is a distributive lattice ordered effect algebra and (E,≤) is an orthomodular lattice, it follows that a1⊕b1=(a∧(i∨j))⊕(b∧(i∨j))=(a∧(i∨j))∨(b∧(i∨j))=(a∨b)∧(i∨j). Therefore, x≤a1⊕b1. Hence, (I∨J)↓ is a Riesz ideal.Proposition 45.
LetE be a Boolean effect algebra, and let I, J be two Riesz ideals of E and let X be a subset of E. Then X(I∨J)↓¯⊆(XI¯∨XJ¯)↓.Proof.
Assume thatX is a subset of E. Let x∈X(I∨J)↓¯, so [x](I∨J)↓∩X≠∅. Thus there exists s∈[x](I∨J)↓∩X which implies e(s,x)∈(I∨J)↓ and s∈X; hence by Definition 13, there exist h,k∈(I∨J)↓, h≤s, k≤x, such that x=(s⊖h)⊕k and also there exist i∈I, j∈J such that k≤i∨j. Then x=(s⊖h)⊕k≤s∨k≤s∨(i∨j)=(s∨i)∨(s∨j). On the other hand by Lemma 32, we have [s∨i]I=[s]I and [s∨j]J=[s]J. Therefore, x∈(XI¯∨XJ¯)↓.The following example shows that the symbol inclusion in Proposition45 can be proper.Example 46.
ConsiderE={0,a,b,1} as the Boolean effect algebra in Example 25. It is easy to check that I={0,a}, J={0} are two ideals of E. And obviously, (I∨J)↓={0,a} is an ideal of E too. We have [0]I=I, [a]I=I, [b]I={1,b}, [1]I={b,1}, [0]J={0}, [a]J={a}, [b]J={b}, [1]J={1}. Assume X={b}; then X(I∨J)↓¯={0,a}, XI¯={0,a}, XJ¯={b}, (XI¯∨XJ¯)↓=E. So X(I∨J)↓¯⊂(XI¯∨XJ¯)↓.Proposition 47.
LetE be a Boolean effect algebra, I, J two Riesz ideals of E, and X a subset of E. Then X(I∨J)↓0⊆(XI0∨XJ0)↓. Furthermore, if a∈(XI0∨XJ0)↓, then one obtains [a](I∨J)↓⊆(XI0∨XJ0)↓.Proof.
Leta∈X(I∨J)↓0, so [a](I∨J)↓⊆X. Since a≤a∨a and [a]I,[a]J⊆[a](I∨J)↓, hence a∈(XI0∨XJ0)↓.
Now, suppose thata∈(XI0∨XJ0)↓. There exist x1∈XI0 and x2∈XJ0 such that a≤x1∨x2. Suppose that b∈[a](I∨J)↓, so there exist i,j∈(I∨J)↓, i≤a, j≤b such that b=(a⊖i)⊕j. Also, there are h∈I and k∈J such that j≤h∨k. Then b≤a∨j≤x1∨x2∨h∨k≤(x1∨h)∨(x2∨k). By Lemma 32, we have [x1∨h]I=[x1]I and [x2∨k]I=[x2]I. This implies that [a](I∨J)↓⊆(XI0∨XJ0)↓.From the above proposition, we have the following corollary.Corollary 48.
LetE be a Boolean effect algebra, and let I, J be two Riesz ideals of E and let X be a lattice ideal of E. Then one has X(I∨J)↓0=(XI0∨XJ0)↓.Proof.
By Proposition47, we have X(I∨J)↓0⊆(XI0∨XJ0)↓. Since X is an ideal, we can show easily, (XI0∨XJ0)↓⊆X. Assume a∈(XI0∨XJ0)↓, so [a](I∨J)↓⊆(XI0∨XJ0)↓⊆X from Proposition 47. That is, a∈X(I∨J)↓0. It yields that (XI0∨XJ0)↓⊆X(I∨J)↓0. Therefore, X(I∨J)↓0=(XI0∨XJ0)↓.Proposition 49.
LetE be a lattice ordered effect algebra and F a Boolean effect algebra. If I is a Riesz ideal of E and h:E→F is a monomorphism, then h(I) is a Riesz ideal of F.Proof.
First, we prove thath(I) is an ideal. Let h(x),h(y)∈h(I) and h(x)⊥h(y), where x,y∈I. Since h is a monomorphism, then h(x)⊕h(y)=h(x⊕y)∈h(I). So h(I) is an ideal of F. Next, we prove that h(I) is a Riesz ideal. For any h(x)∈h(I), let h(x)≤a⊕b, a,b∈F, a⊥b. Take a1=h(x)∧a, b1=h(x)∧b; then a1,b1∈h(I) and a1≤a, b1≤b. Since F is a distributive lattice ordered effect algebra, and (F,≤) is an orthomodular lattice, it follows that a1⊕b1=(h(x)∧a)⊕(h(x)∧b)=h(x)∧(a∨b). Therefore, h(x)≤a1⊕b1. Hence, h(I) is a Riesz ideal of F.Theorem 50.
LetE, F be lattice ordered effect algebras, let h:E→F be a morphism, and let Ih:={a∈E:h(a)=0} be the kernel of h.(1)
IfX is a subset of E, then h(XIh¯)=h(X).(2)
Assume thath is a monomorphism and (F,≤) is a Boolean effect algebra. If X is a subset of E and I is a Riesz ideal of E containing Ih, then h(XI¯)=h(X)h(I)¯.Proof.
(1) SinceX⊆XIh¯, it follows that h(X)⊆h(XIh¯). Conversely, let y∈h(XIh¯); then there exists x∈XIh¯ such that h(x)=y. So we have [x]Ih∩X≠∅. Let a∈[x]Ih∩X. We have a∈[x]Ih and a∈X, so there exist i,j∈Ih, i≤a, j≤x such that a=(x⊖j)⊕i. Since h is a morphism, we get that h(a)=h(x⊖j)⊕h(i)=h(x)⊖h(j)⊕h(i)=h(x). It follows that h(a)=y∈h(X), which proves the theorem.
(2) Lety∈h(XI¯). Then there exists x∈XI¯ such that y=h(x). Since [x]I∩X≠∅, suppose z∈[x]I∩X, so we have [z]I=[x]I and z∈X. Hence there exist i,j∈I, i≤z, j≤x such that z=(x⊖j)⊕i. Since h a monomorphism, then [h(z)]h(I)=[h(x)]h(I) and h(z)∈h(X). Therefore, y∈h(X)h(I)¯.
Conversely, lety∈h(X)h(I)¯, so [y]h(I)∩h(X)≠∅. Suppose z∈[y]h(I)∩h(X); it implies that [y]h(I)=[z]h(I) and z∈h(X). Since h is a monomorphism, there exists x∈E such that y=h(x) and there exist t∈X and s∈I such that z=h(t) and e(h(t),h(x))=h(s), so h(e(t,x))=h(s) and it implies that h(e(t,x)⊖s)=0. Hence e(t,x)⊖s∈I. So e(t,x)∈I and t∈[x]I by Lemma 32. Now, we conclude that [x]I∩X≠∅, so x∈XI¯. This proves the theorem.In order to well illustrate the above theorem, we give the following example.Example 51.
ConsiderE={0,a,b,1}, as the lattice ordered effect algebra in Example 25. Also, let F={0,y1,y2,1}(0<y1,y2<1). For all y∈F, define y1⊕y2=y2⊕y1=1, y⊕0=0⊕y=y; otherwise ⊕ is undefined. Then (F,⊕,0,1) is a Boolean effect algebra.
The mapϕ:E→F is given by ϕ(1)=1, ϕ(a)=y1, ϕ(b)=y2, ϕ(0)=0. We can easily check that ϕ is a monomorphism. Since ker⁡ϕ={0}, so [0]ker⁡ϕ={1}, [a]ker⁡ϕ={a}, [b]ker⁡ϕ={b}, [1]ker⁡ϕ={1}. Suppose that X={a,b}; then ϕ(X)={y1,y2} and ϕ(Xker⁡ϕ¯)=ϕ(X).


## 6. Conclusion

The earliest research on rough set theory of algebraic structures are on semigroups, groups, and modules. We set up the rough structure on partial algebraic system. The core foundation of rough set theory and application is a pair of approximation operators induced from the approximation space, namely, the closure operator and interior operator (also called upper and lower approximation set). We try to define rough approximation operators by a congruence relation on effect algebras and thus induce rough structure of effect algebras. Because effect algebras are incomplete algebras, not any two elements can compute, so we give a full operation on an effect algebra to construct a distance function. Moreover by use of Riesz ideals and distance functions we induced a congruence relation and then we obtain rough approximation operators and rough effect algebra system.



---

*Source: 542846-2014-07-24.xml*