tripleC 9(2): 502-509, 2011 403
CC: Creative Commons License, 2011.
classes and applied this method to analyzing literary text. A general application of this method and
a careful explanation of the mathematical methods is made in Kitamura and Gunji (accepted).
2. Methods and Procedures
2.1. Rough Set Theory to Lattice Theory
Rough set is an approximation method to estimate a target by its upper approximation R
*
(X)={x∈
U|[x]
R
∩X≠φ} and lower approximation R
*
(X)={x∈U|[x]
R
⊆X}, where X is the target set, U is a
universal set, x is an element in U, and [x]
R
={y∈U|xRy} is an equivalence class with R being the
equivalence relation between the elements x and y. The elements in a set are assumed to be indis-
tinguishable.
A Galois connection is known to construct a complete lattice in a theory of partially ordered sets.
We get a Galois connection when a pair of maps (F, G) with F:P Q and G:QP is formed, where
P and Q are two partially ordered sets. Thus, F(x)≦y⇔x≦G(y) for any x∈P and y∈Q. Then a
closure operator C:=FG:PP can be constructed from a Galois connection such that, for any x, y∈
P, (i) x≦C(x); (ii) x≦y⇒C(x)≦C(y); (iii) CC(x)=C(x). This results in a complete lattice L
T
={x∈
P|C(x)=x}.
In terms of rough set, a Galois connection is formed with R
*
:P(U) P(U) and R
*
:P(U) P(U),
where P(U) is the power set of U. For any X, Y⊆U, R
*
(X)≦Y⇔X≦R
*
(Y). When C=R
*
R
*
is defined
as a closure operator, this also results in a complete lattice L
C
={X∈U|C(X)=X}.
If, on the other hand, two unrelated binary relations R and S are applied to a universal set U, a
pair of operations S
*
and R
*
(or S
*
and R
*
) do not form a Galois connection. When there is an op-
erator T=R
*
S
*
, T is not a closure operator but is called a pseudo-closure operator, since it satisfies
only (ii) X⊆Y⇒ T(X)⊆T(Y) and (iii) TT(X)=T(X) for X, Y⊆U. Unlike the previous closure operators,
the lattice constructed with fixed points satisfying L
T
= {X∈U|T(X)=X} with pseudo-closure is not a
set lattice. This means that any arbitrary lattice can be constructed with L
T
by choosing the right
equivalence relations S and R.
2.2. Rough Set Derived Lattices
In a lattice <L
T
; ⊆> with L
T
={X⊆U|T(X)=X} and T= R
*
S
*
, an element of L
T
is a subset of the univer-
sal set, and order is defined by inclusion ⊆. In general, L
T
≠P(U), thus join and meet are defined by
X∧Y=T(X∩Y), X∨Y= T(X∪Y) for any X, Y∈L
T
. Only if all subsets of U are collected, L
T
forms a
power set which is a set lattice, where join and meet are defined by union ∪ and intersection ∩.
For example, when a lattice is constructed of fixed points R
*
(R
*
(X))=X from one equivalence rela-
tion R, we only get a set lattice.
A set lattice has two important properties in lattice theory such as complementarity (for any X⊆
U, there exists Y⊆U such that X∨Y=U, X∧Y=φ) and distributivity (A∧(B∨C)= (A∧B)∨(A∧C)
for A, B, C⊆U). In a lattice L
T
, U and φ are the greatest and the least elements. Lattices with both
complemental and distributive property are called Boolean lattices.
When a lattice is constructed of fixed points R
*
(S
*
(X))=X with two equivalence relations R and S,
the resulting lattice can also be a non-Boolean lattice as well as a Boolean lattice. This is a result of
two equivalence classes fully or partially overlapping each other.
The difference between a lattice of L
C
= {X⊆U|C(X)=X} and L
T
={X⊆U|T(X)=X} with C=R
*
R
*
,
T=R
*
S
*
is illustrated in Figure 1. In the case of L
C
, when we denote W= {[a]
R
, [b]
R
, [d]
R
}={{a}, {b, c},
{d, e}}, L
C
=
P
(W), where all possible combinations of equivalence class of R are obtained (Figure 1
(a)). By contrast, in L
T
, although elements of L
T
are possible unions of equivalence class R, some
elements are missing (Figure 1 (b)). For example, let X={a, b, c} in interpretation R. Then R
*
S
*
({a,
b, c})=R
*
([a]
S
∪[c]
S
)= R
*
({a, b, c, d})= [a]
R
∪[b]
R
={a, b, c}. Thus {a, b, c} is an element of L
T
. On the
other hand, let X={a, b, e} in interpretation R. Since R
*
S
*
({a, d, e})=R
*
([a]
S
∪[c]
S
∪[e]
S
)=R
*
(U)=U≠