Next Article in Journal
Some Root Level Modifications in Interval Valued Fuzzy Graphs and Their Generalizations Including Neutrosophic Graphs
Previous Article in Journal
A Dilation Invariance Method and the Stability of Inhomogeneous Wave Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Consistent Sets of Soft Contexts Defined by Soft Sets

Department of Mathematics, Kangwon National University, Chuncheon 24341, Korea
Mathematics 2019, 7(1), 71; https://doi.org/10.3390/math7010071
Submission received: 13 November 2018 / Revised: 4 January 2019 / Accepted: 7 January 2019 / Published: 10 January 2019

Abstract

:
We introduce the notion of consistent sets of soft contexts and investigate its characterizations. For the purpose of studying the characterizations of consistent sets, we introduce the notions of 1 0 and 2 0 classes of independent attributes. By studying the characterizations, we determined that every consistent set has to contain the special class 1 0 called the Essential Zone of consistent sets. This is very important information that we should consider when constructing consistent sets of a given soft context. Additionally, we study the fundamental theorems necessary to construct the consistent sets of a given soft context. In particular, we apply the Fundamental Theorem 2 to obtain the consistent sets of a given soft context, and show that this fundamental theorem provides a more effective way of constructing the consistent sets of a formal context.
MSC:
94D05; 94D99; 03E70; 03E72

1. Introduction

In 1982, Wille introduced formal concept analysis (FCA) [1], which is an important theory for the research of hierarchical structures induced by a binary relation between the set of objects and attributes. The three basic notions of FCA are formal context, formal concept, and concept lattice. A formal context is a kind of information system, which is a tabular form of an object–attribute value relationship [2,3,4,5]. The formal concept consists of two parts called expansion and tension. The expansion contains all objects belonging to this concept and the tension contains all attributes that are valid for all of those objects.
The subconcept–superconcept order relation between two formal concepts can be defined by the inclusion relation on objects and attributes. Furthermore, the set of all formal concepts together with the order relation forms a complete lattice called a concept lattice [5]. A formal concept analysis has been widely applied to many fields and generalized to other types for requirements of real word applications [5,6,7,8,9,10,11,12,13].
The soft set concept was introduced by Molodtsov in 1999 [14], to deal with complicated problems and uncertainties as follows: Let U be an initial universe set (simply, universe set) and A be a collection of characteristics of objects in U. A pair ( F , A ) is called a soft set over U if F is a set-valued mapping from A into the set P ( U ) of all subsets of U. In [15], Maji et al. introduced several operators (equality, subset, superset, complement, null, and absolute soft set, etc.) for soft set theory. In [16], Ali et al. introduced new operations that modified some concepts introduced by Maji.
In [17], we studied the new notions such as soft contexts, soft concepts and soft concept lattices, which are closely related to formal contexts and formal concept lattices. The main purpose of studying these new notions was to obtain a more effective method than the traditional method of constructing all formal concepts in a formal context. So, we introduced the soft context, combining the formal contexts and soft sets, and investigated the notions of soft concepts, independent soft concepts, dependent soft concepts and bases. Furthermore, we obtained important results: (1) The set of all soft concepts can be decomposed into the set of all independent soft concepts and the set of all dependent soft concepts; (2) All dependent soft concepts are generated by independent soft concepts; (3) There exists a bijective mapping between the set of all formal concepts and the set of all associated soft concepts in a given formal context.
Based on the above facts, we intend to obtain a more effective method of finding a consistent set in a formal context using soft contexts. So, in this paper, we introduce the notion of consistent sets of soft context and investigate its characterizations. For the purpose of studying the characterizations of consistent sets, we investigate the independence and dependence for attributes in a given soft context, and introduce the notions of 1 0 and 2 0 classes of independent attributes. By studying the characterizations, we determine that every consistent set has to contain a special set called the Essential Zone of Consistent Sets. In fact, this is very important information that we should consider when constructing consistent sets of a given soft context. Additionally, we study the fundamental theorems necessary to construct the consistent sets of a given soft context. Finally, we apply the above-mentioned fundamental theorem to obtain the consistent sets of a given soft context. In particular, by using an example, we show that this fundamental theorem provides a more effective way of constructing the consistent sets of a given formal context.

2. Preliminaries

A formal context is a triplet ( U , A , I ) , where X and Y are finite sets, and I U × A is a relation from U to A. In a formal context ( U , A , I ) , U is a finite set of objects, A is a finite set of attributes or properties, and if ( x , a ) I , we simply write x I a and say that x has the property a, or a is possessed by object x. The set of all attributes possessed by x U and the set of all objects having an attribute a A were represented as [1,5]:
x * = { a A | x I a } ;   a * = { x U | x I a } .
For a set of objects X U , X * is the maximal set of properties shared by all objects in X; for a set of properties B A , B * is the maximal set of objects that all have properties in B; that is,
X * = { a A | x X , x I a } ;   B * = { x U | b B , x I b } .
Let us define two operators I , I between the power sets of U and A as follows:
I : 2 U 2 A ,   I ( X ) = X * ;
I : 2 A 2 U ,   I ( B ) = B * .
Then, obviously, the pair of operators ( I , I ) is a contravariant Galois connection between the power sets of U and A.
A pair ( X , B ) , X U , B A , is called a formal concept of the context ( U , A , I ) if X = B * and B = X * [1,5]. X is called the extension of the concept, and B is called the extension of the concept.
For a formal context ( U , A , I ) , the concepts of ( U , A , I ) are ordered by the following: For two concepts ( X , B ) , ( Y , C ) ,
( X , B ) ( Y , C ) X Y ( C B ) .
The ordered set of all concepts in ( U , A , I ) is a complete lattice and the ordered set is denoted by L ( U , A , I ) and called the formal concept lattice of ( U , A , I ) .
Let U be a universe set and E be a set of parameters with respect to U. In general, parameters are properties or attributes of objects in U.
A pair ( F , A ) is called a soft set [14] over U if F is a set-valued mapping of A into 2 U , that is, F : A 2 U is a mapping defined by F ( a ) 2 U for a A .
Let U = { x 1 , x 2 , , x n } be a non-empty finite set of objects, A = { a 1 , a 2 , , a m } a non-empty finite set of attributes, and F : A 2 U a soft set. Then, the triple ( U , A , F ) is called a soft context [17].
Let ( U , A , F ) be a soft context, P ( U ) denote the power set of U and A E . Then, in [17], F + and F are defined as the following:
(1)
F + : P ( A ) P ( U ) is a mapping defined as F + ( B ) = b B F ( b ) ;
(2)
F : P ( U ) P ( A ) is a mapping defined as F ( X ) = { a A : X F ( a ) } .
Let Im ( F + ) = { F + ( B ) | B P ( A ) } and Im ( F ) = { F ( X ) | X P ( U ) } . For a A and x U , simply, F + ( { a } ) = F + ( a ) and F ( { x } ) = F ( x ) .
Then, we showed the following facts:
Theorem 1
([17]). Let ( U , A , F ) be a soft context, X , Y U and C , D A .
(1) 
If X Y , then F ( Y ) F ( X ) ; if C D , then F + ( D ) F + ( C ) ;
(2) 
X F + F ( X ) ; C F F + ( C ) ;
(3) 
F ( X Y ) = F ( X ) F ( Y ) , F + ( C D ) = F + ( C ) F + ( D ) ;
(4) 
F ( X ) = F F + F ( X ) , F + ( C ) = F + F F + ( C ) ;
(5) 
F ( X ) F ( Y ) F ( X Y ) , F + ( C ) F + ( D ) F + ( C D ) .
In a soft context ( U , A , F ) , the associated operation Ψ [17] was induced by F + , F + as follows: For each X P ( U ) ,
Ψ : P ( U ) P ( U )   is   a   mapping   defined   as   Ψ ( X ) = F + F ( X ) :
Then, X is called a soft concept in ( U , A , F ) if Ψ ( X ) = F + F ( X ) = X .
The set of all soft concepts is denoted by s C ( U , A , F ) . The important properties of soft concepts are obtained as follows:
Theorem 2
([17]). Let ( U , A , F ) be a soft context. Then
(1) 
, U, Ψ ( X ) are soft concepts.
(2) 
For each B A , F + ( B ) is a soft concept.
(3) 
For each a A , F ( a ) is a soft concept.
(4) 
X is a soft concept if and only if X = F + ( B ) for some B P ( A ) .
(5) 
Im ( F + ) = s C ( U , A , F ) .
In a soft context ( U , A , F ) , for D A , consider a set-valued mapping F | D : D P ( U ) defined by F | D ( d ) = F ( d ) for all d D . Then, obviously, ( F | D , D ) is a soft set. Since ( F | D , D ) is a soft set, ( U , D , F | D ) is also a soft context. From now on, we consider only a subset D A satisfying the soft set ( F | D , D ) which is pure.
Then, naturally, the associated operation Ψ | D , associated mappings F | D + and F | D are induced by the soft set ( F | D , D ) as follows:
  • F | D + : P ( D ) P ( U )   is   defined   by   F | D + ( B ) = b B F ( b ) for each B P ( D ) .
  • F | D : P ( U ) P ( D )   is   defined   by   F | D ( X ) = { a D : X F ( a ) } for each X P ( U ) .
  • Ψ | D : P ( U ) P ( U )   defined   as   for   each   X P ( U ) ,
    Ψ | D ( X ) = F | D + F | D ( X ) .
Then, obviously, the following were shown in [17]:
Lemma 1.
([17]) Let ( U , A , F ) be a soft context, D A and X U . Then
(1) 
F | D ( X ) F ( X ) .
(2) 
F | D ( X ) = F ( X ) D .
(3) 
s C ( U , D , F | D ) s C ( U , A , F ) .
Now, for X s C ( U , A , F ) ,
(1)
X is said to be dependent [17] on s C ( U , A , F ) if there exist X 1 , , X n s C ( U , A , F ) satisfying X X i and X = X i , i = 1 , , n ( n 2 ).
(2)
X is said to be independent of s C ( U , A , F ) if X is not dependent.
We will denote:
  • s D = { X s C ( U , A , F ) X   is   dependent   on   s C ( U , A , F ) } ;
  • s I = { X s C ( U , A , F ) X   is   independent   of   s C ( U , A , F ) } .
The basic properties of such notions are as follows:
Theorem 3
([17]). Let ( U , A , F ) be a soft context.
(1) 
Both and U are dependent.
(2) 
s D s I = ; s D s I = s C ( U , A , F ) .
(3) 
For a non-empty set X s D , there exists B P ( A ) such that F + ( B ) = X F ( b ) for b B .
(4) 
For X s I , there exists b A satisfying F ( b ) = X .

3. Consistent Sets of Soft Contexts

We introduce the notion of consistent set on a given soft context, and investigate the characterizations of consistent sets. In general, in a formal context ( U , A , I ) , for x U , if x * = or x * = A , then x could be omitted from x U , and the structure of concept lattice and reduction are not affected. Dually, for a A , if a * = or a * = U , then a could be omitted from a A , and the structure of concept lattice and reduction is not affected.
Based on this fact, from now on, we assume that every soft set ( F , A ) is pure [18], which is defined as: a A F ( a ) = , a A F ( a ) = U , F ( a ) U and F ( a ) for every a A .
Definition 1.
Let ( U , A , F ) be a soft context and C A . Then, C is called a consistent set of ( U , A , F ) if s C ( U , A , F ) = s C ( U , C , F | C ) .
We recall the notion of base for s C ( U , A , F ) in a soft context ( U , A , F ) defined in [17]: Let ( U , A , F ) be a soft context. A subfamily S of s C ( U , A , F ) is called a base for s C ( U , A , F ) if it satisfies the following conditions:
(1)
S s C ( U , A , F ) ;
(2)
For each X s C ( U , A , F ) , there exists S S such that X = S .
Theorem 4
([17]). For a soft context ( U , A , F ) , the family F A = { F ( a ) a A } is a base for s C ( U , A , F ) .
Example 1.
Let U = { 1 , 2 , 3 , 4 } and A = { a , b , c , d , e , f } . Let us consider a soft context ( U , A , F ) induced by a soft set ( F , A ) where the set-valued mapping F : A P ( U ) is defined by
F ( a ) = F ( b ) = { 1 , 2 , 4 } ; F ( c ) = { 2 , 3 , 4 } ;
F ( d ) = F ( f ) = F ( g ) = { 1 , 3 } ; F ( e ) = { 2 , 4 } .
Then, by Theorem 4,
s C ( U , A , F ) = { , { 1 } , { 3 } , { 1 , 3 } , { 2 , 4 } , { 1 , 2 , 4 } , { 2 , 3 , 4 } , U } .
For C = { b , c , d , f } A , F | C : C P ( U ) is a set-valued function defined as follows:
F ( b ) = { 1 , 2 , 4 } ; F ( c ) = { 2 , 3 , 4 } ; F ( d ) = F ( f ) = { 1 , 3 } .
Then ( F | C , C ) is a soft set and ( U , C , F | C ) is a soft context. Furthermore, by Theorem 4,
s C ( U , C , F | C ) = { , { 1 } , { 3 } , { 1 , 3 } , { 2 , 4 } , { 1 , 2 , 4 } , { 2 , 3 , 4 } , U } .
So, s C ( U , C , F | C ) = s C ( U , A , F ) , and C is a consistent set of ( U , A , F ) .
Theorem 5.
Let ( U , A , F ) be a soft context, C A and C . Then, C is a consistent set of ( U , A , F ) if and only if Im ( F | C + ) = Im ( F + ) .
Proof. 
Since ( U , A , F ) and ( U , C , F | C ) are soft contexts over U, from (5) of Theorem 2, it is obviously obtained. □
Theorem 6.
Let ( U , A , F ) be a soft context, C A and C . Then, C is a consistent set of ( U , A , F ) if and only if (1) s D = s D C and (2) s I = s I C .
Proof. 
Let C be a consistent set of ( U , A , F ) . Then, by Theorem 3, s I s D = s C ( U , A , F ) = s C ( U , C , F | C ) = s I C s D C and in general, s D C s D , s I C s I , s D C s I C = and s D s I = . So, s D = s D C and s I = s I C .
The converse is obviously obtained. □
Theorem 7.
Let ( U , A , F ) be a soft context and C A . Then, the following are equivalent:
(1) 
C is a consistent set of ( U , A , F ) .
(2) 
C = { F ( d ) d C } is a base of s C ( U , A , F ) .
Proof. 
(1) ⇒ (2) Let C be a consistent set of ( U , A , F ) . Then, s C ( U , A , F ) = s C ( U , C , F | C ) and by Theorem 4, C is a base of s C ( U , C , F | C ) . So, C is also a base of s C ( U , A , F ) .
(2) ⇒ (1) For C A , it is obviously s C ( U , C , F | C ) s C ( U , A , F ) . Now, for the proof of the inclusion relation s C ( U , A , F ) s C ( U , C , F | C ) , let X s C ( U , A , F ) . Then, by hypothesis, there exists S C such that X = S . Since X = S = { F ( d ) F ( d ) S C } = F | C + ( { d F ( d ) S } ) Im ( F | C + ) = s C ( U , C , F | C ) , X s C ( U , C , F | C ) . Consequently, s C ( U , A , F ) = s C ( U , C , F | C ) and so, C is a consistent set of ( U , A , F ) . □
Corollary 1.
Let ( U , A , F ) be a soft context. Then, A is the greatest consistent set of ( U , A , F ) .
Theorem 8 (Fundamental Theorem I of consistent sets).
Let ( U , A , F ) be a soft context and C A . Then, C is a consistent set of ( U , A , F ) if and only if for each e A C , there exists a nonempty subset B of C such that F + ( B ) = b B F ( b ) = F ( e ) .
Proof. 
Suppose that C is a consistent set of ( U , A , F ) . For the proof, let e A C . Then, by (3) of Theorem 2, F ( e ) s C ( U , A , F ) . Since C = { F ( a ) a C } is a base for s C ( U , A , F ) , there exists S C such that F ( e ) = S . Set B = { b F ( b ) S C } . Then, B C and F + ( B ) = B = b B F ( b ) = S = F ( e ) . So, the condition is satisfied.
Conversely, suppose that for each e A C , there exists B C such that F + ( B ) = F ( e ) . Now, we show that C = { F ( d ) d C } is a base for s C ( U , A , F ) . It is sufficient to show that for each X s C ( U , A , F ) , there exists S C such that X = S . For the proof, let X s C ( U , A , F ) . First, since F A = { F ( a ) a A } is a base for s C ( U , A , F ) , we can take E F A such that X = E . From E F A , it follows that there exists E A such that E = { F ( e ) e E } . Now, put E 1 = E ( A C ) , E 2 = E C , E 1 = { F ( e ) e E 1 } and E 2 = { F ( e ) e E 2 } . Then, E = E 1 E 2 , E = E 1 E 2 and E 2 C . For each e E 1 A C , by hypothesis, there exists B e C such that F ( e ) = F + ( B e ) . From Theorem 1, it follows that X = E = ( E 1 ) ( E 2 ) = F + ( E 1 ) F + ( E 2 ) = ( e E 1 F ( e ) ) F + ( E 2 ) = ( e E 1 F + ( B e ) ) F + ( E 2 ) = F + ( e E 1 B e ) F + ( E 2 ) = F + ( ( e E 1 B e ) E 2 ) . Consequently, put S = { F ( e ) e ( e E 1 B e ) E 2 } ; then, from e E 1 B e E 2 C , it follows that S C and X = F + ( ( e E 1 B e ) E 2 ) = S . So, the proof is completed. □
Corollary 2.
Let ( U , A , F ) be a soft context and C A . Then, C is a consistent set of ( U , A , F ) if and only if for every nonempty subset B of A C , there exists a nonempty subset E of C such that F + ( E ) = F + ( B ) .
Proof. 
Suppose that C is a consistent set. Let B A C . Then, for each b B , there exists E b C such that F ( b ) = F + ( E b ) . So, F + ( B ) = F + ( b B { b } ) = b B F + ( E b ) = F + ( b B E b ) and b B E b C . So, the statement is obtained.
The converse is obvious. □
Theorem 9
([17]). Let ( U , A , F ) be a soft context. For D A , if a mapping φ : D s I defined by φ ( d ) = F ( d ) for d D is surjective, then F D = { F ( d ) d D } is a base for s C ( U , A , F ) .
By the above theorem, we obtain the following useful theorem in finding consistent sets:
Theorem 10.
Let ( U , A , F ) be a soft context and C A . If there exists a surjective mapping φ : C s I , then C is a consistent set.
Remark 1.
In the above theorem, the converse is not always true as shown in the next example.
Example 2.
In Example 1, s I = { { 1 , 3 } , { 1 , 2 , 4 } , { 2 , 3 , 4 } } . Consider a consistent set C 1 = { b , c , d , e } . Then, since
F C 1 = { F ( d ) d C 1 } = { { 2 , 4 } , { 1 , 3 } , { 1 , 2 , 4 } , { 2 , 3 , 4 } } ,
it is impossible that there is any surjective mapping φ : C 1 s I defined as follows φ ( d ) = F ( d ) for d C 1 . So, in Theorem 10, the converse is not true.
Let ( U , A , F ) be a soft context and G a = { g A F ( a ) F ( g ) } .
For d A , d is said to be dependent on A if there exists G d satisfying F ( d ) = F + ( G d ) = g G d F ( g ) : Otherwise, d is said to be independent on A.
We denote:
  • A D = { a A a   is   dependent   on   A } ; A I = { a A a   is   independent   on   A } .
Example 3.
In Example 1, G a = G b = G c = { e } , G d = G f = G g = and G e = { a , b , c } . For e A , F ( e ) = F ( a ) F ( b ) F ( c ) = F + ( G e ) and so, e is dependent. From G d = G f = G g = , d , f and g are obviously independent on A. a is also independent on A, since G a but F + ( G a ) = F ( e ) F ( a ) . For the same reason, b and c are independent on A.
A I = { a , b , c , d , f , g } ;   A D = { e } .
Obviously, the following are obtained:
Lemma 2.
Let ( U , A , F ) be a soft context. Then
(1) 
A I A D = A and A I A D = ;
(2) 
if a is dependent, then there exists B A such that F + ( B ) = b B F ( b ) = F ( a ) where F ( a ) F ( b ) .
Theorem 11.
Let ( U , A , F ) be a soft context. Then, A I A is a consistent set of ( U , A , F ) .
Proof. 
First, we show that the mapping φ : A I s I defined by φ ( a ) = F ( a ) for a A I is well-defined and surjective. For each a A I , suppose that F ( a ) s I for a A . Then, F ( a ) s D , by (3) of Theorem 3, there exists B P ( A ) such that | B | 2 and F + ( B ) = F ( a ) F ( b ) . Then, B G a = { g A : F ( a ) F ( g ) } and F ( a ) F + ( G a ) F + ( B ) = F ( a ) . Thus, G a and F + ( G a ) = F ( a ) . This implies that a A D , and it is a contradiction. So, the mapping φ : A I s I is well defined.
For each X s I , by (4) of Theorem 3, there exists an element a A such that F ( a ) = X . If a A I , then by Lemma 2, a A D and there exists B A such that F + ( B ) = b B F ( b ) = F ( a ) = X where X = F ( a ) F ( b ) . Then, X s D , which contradicts X s I . From this fact, we can say that a A I , and so φ is surjective.
Finally, by Theorem 10, A I is a consistent set of ( U , A , F ) . □
Definition 2.
For a soft context ( U , A , F ) , put n ( a ) = | { b A I F ( a ) = F ( b ) } | . Then,
1 ( A ) = { a A I n ( a ) = 1 } ;   2 ( A ) = { a A I n ( a ) > 1 } .
Example 4.
In Example 3, for a soft context ( U , A , F ) where U = { 1 , 2 , 3 , 4 } and A = { a , b , c , d , e , f , g } , we showed that A I = { a , b , c , d , f , g } and A D = { e } .
For A I = { a , b , c , d , f , g } ,
F ( a ) = F ( b ) = { 1 , 2 , 4 } ;   F ( c ) = { 2 , 3 , 4 } ;   F ( d ) = F ( f ) = F ( g ) = { 1 , 3 } ;
and
from { x A I F ( c ) = F ( x ) } = { c } , n ( c ) = 1 ;
from F ( a ) = F ( b ) , n ( a ) = n ( b ) = 2 ;
from F ( d ) = F ( f ) = F ( g ) , n ( d ) = n ( f ) = n ( g ) = 3 .
Consequently, 1 ( A ) = { c } ;   2 ( A ) = { a , b , d , f , g } .
The following is directly obtained:
Lemma 3.
For a soft context ( U , A , F ) ,
(1) 
A I = 1 ( A ) 2 ( A ) ;
(2) 
a 1 ( A ) if and only if a A and F ( a ) F ( e ) for every e A { a } .
Theorem 12.
Let ( U , A , F ) be a soft context and 2 ( A ) . Then, for x 2 ( A ) , A I { x } is a consistent set of ( U , A , F ) .
Proof. 
We showed that there exists a surjective mapping φ : A I s I defined by φ ( a ) = F ( a ) in the proof of Theorem 11. Now, for x 2 ( A ) , let φ ( x ) = X s I and consider the inclusion map i : A I { x } A I . Since x 2 ( A ) , there is at least one element z A I such that z x and F ( z ) = F ( x ) = X . This implies that the composition map φ i : A I { x } s I is surjective, and by Theorem 10, A I { x } is a consistent set of ( U , A , F ) . □
Theorem 13.
Let ( U , A , F ) be a soft context and C A . Let C be a consistent set of ( U , A , F ) . Then, for e C , e 1 ( C ) if and only if C { e } is not a consistent set of ( U , A , F ) .
Proof. 
Let e 1 ( C ) and suppose that C { e } is a consistent set of ( U , A , F ) . Then, S = { F ( d ) d C { e } } is a base for s C ( U , A , F ) . From this fact, for F ( e ) s C ( U , A , F ) , there exists a nonempty subset D C { e } such that F + ( D ) = d D F ( d ) = F ( e ) . This contradicts e 1 ( C ) . So, C { e } is not a consistent set of ( U , A , F ) .
Conversely, for e C , assume that e 1 ( C ) . Then, from C = C I C D = 1 ( C ) 2 ( C ) C D , e 2 ( C ) C D . In case: e 2 ( C ) . By Theorem 12, C I { e } is a consistent set of ( U , C , F | C ) , and since C I { e } C { e } , C { e } is a consistent set of ( U , C , F | C ) . By hypothesis, since C is a consistent set of ( U , A , F ) , C { e } is also a consistent set of ( U , A , F ) .
In case: e C D . Since C I is also a consistent set of ( U , A , F ) and C I C { e } , C { e } is a consistent set of ( U , A , F ) . □
Theorem 14.
Let ( U , A , F ) be a soft context and C A . If C is a consistent set of ( U , A , F ) and 2 ( A ) , then (1) 1 ( A ) 1 ( C ) : (2) 2 ( A ) C .
Proof. 
(1) It is sufficient to show that 1 ( A ) 1 ( C ) . Suppose that for x 1 ( A ) , x 1 ( C ) . Since C = 1 ( C ) 2 ( C ) C D , x 2 ( C ) C D 2 ( A ) A D . So, x 1 ( A ) , which contradicts the assumption x 1 ( A ) . Consequently, 1 ( A ) 1 ( C ) .
(2) Suppose that 2 ( A ) C = . Then, for x 2 ( A ) , since x A I , there is no subset B of C such that F + ( B ) = F ( x ) where F ( x ) F ( b ) for b B . So, C = { F ( c ) c C } is not a base for s C ( U , A , F ) , that is, C is a consistent set of ( U , A , F ) . So, the proof is completed. □
The converse of Theorem 14 is not always true as shown in the next example:
Example 5.
Let U = { 1 , 2 , 3 , 4 } and A = { a , b , c , d , e , f , g } . As in Example 1, consider a soft context ( U , A , F ) and the set-valued mapping F : A P ( U ) defined by
F ( a ) = F ( b ) = { 1 , 2 , 4 } ; F ( c ) = { 2 , 3 , 4 } ; F ( d ) = F ( f ) = F ( g ) = { 1 , 3 } ; F ( e ) = { 2 , 4 } .
Then, we showed A I = { a , b , c , d , f , g } in Example 3. For A I , in Example 4, we found that 1 0 ( A ) = { c } and 2 0 ( A ) = { a , b , d , f , g } .
Take C = { a , b , c , e } A . Then, it is easily obtained:
C I = { a , b , c } ;   C D = { e } ;   1 0 ( C ) = { c } ;   2 0 ( C ) = { a , b } .
Clearly, 1 0 ( A ) 1 0 ( C ) and 2 0 ( A ) C . However, for d A C , there is no B C such that F + ( B ) = F ( d ) . So, by Theorem 8, C is not a consistent set of ( U , A , F ) .
Remark 2 (Essential Zone of consistent sets).
For a soft context ( U , A , F ) , from Theorems 13 and 14, we found that every consistent set has to contain the set 1 ( A ) . This result is very important information that we should consider when constructing a consistent set of a soft context ( U , A , F ) . Based on this fact, the following fundamental theorem of consistent sets is obtained.
Theorem 15 (Fundamental Theorem II of consistent sets).
Let ( U , A , F ) be a soft context and C A . Then, C is a consistent set of ( U , A , F ) if and only if C satisfies that
(1) 
1 ( A ) C :
(2) 
For each a 2 ( A ) , { b A I F ( b ) = F ( a ) } C .
Proof. 
Let C be a consistent set of ( U , A , F ) . Then, obviously, (1) is satisfied by Theorem 14. For the proof of (2), suppose that there is some a 2 ( A ) such that { b A I F ( b ) = F ( a ) } C = . For a 2 ( A ) , let F ( a ) = X . Then, we know that X s C ( U , A , F ) and a A I . Now, for a A I , there is no G a = { g A F ( a ) F ( g ) } such that g G a F ( g ) = F ( a ) = X . This means that there is no C a C A such that c C a F ( c ) = X . So, C = { F ( c ) c C } is not a base for s C ( U , A , F ) , C is not a consistent set.
For the converse, assume that the two conditions (1) and (2) are satisfied. Put B a = { b A I F ( b ) = F ( a ) } for a 2 ( A ) . Then, for each a 2 ( A ) , since B a C , C 0 = ( B a C ) is a nonempty subset of C, and so 1 ( A ) C 0 C . Now, we show that the mapping φ : 1 ( A ) C 0 s I defined by φ ( d ) = F ( d ) for d 1 ( A ) C 0 is surjective. For the proof of surjection, let X s I . Then, by Theorem 11, there is an element e A I such that F ( e ) = X . From A I = 1 ( A ) 2 ( A ) , in case e 1 ( A ) , it is obviously e 1 ( A ) C 0 . In case e 2 ( A ) , by the condition (2), there exists some c C 0 such that F ( c ) = F ( e ) . So, in any case, for X s I , there exists c 1 ( A ) C 0 satisfying φ ( c ) = X . Consequently, φ is surjective and so S = { F ( c ) c 1 ( A ) C 0 C is a base for s C ( U , A , F ) , and so, C is also a base for s C ( U , A , F ) . Hence, C is a consistent set of ( U , A , F ) . □
Corollary 3.
Let ( U , A , F ) be a soft context and C A . Then, for each e A C , there exists a nonempty subset B of C such that F + ( B ) = F ( e ) if and only if C satisfies that
(1) 
1 ( A ) C ;
(2) 
For each a 2 ( A ) , { b A I F ( b ) = F ( a ) } C .
Proof. 
It follows from Theorems 8 and 15. □
Let ( U , A , F ) be a soft context. In [17], we defined an order between X 1 , X 2 s C ( U , A , F ) as follows: For X 1 , X 2 s C ( U , A , F ) ,
X 1 X 2   if   and   only   if   X 1 X 2 .
Then the infimum ⋏ and supremum ⋎ in the ordered set ( s C ( U , A , F ) , ) , are defined as follows:
X 1 X 2 = X 1 X 2 ; X 1 X 2 = Ψ ( X 1 X 2 ) = F + F ( X 1 X 2 ) .
Then, we showed that ( s C ( U , A , F ) , , , ) is a complete lattice. The complete lattice ( s C ( U , A , F ) , , , ) is called the soft concept lattice and simply, denoted by s L ( U , A , F ) .
Let s L ( U , A 1 , F 1 ) and s L ( U , A 2 , F 2 ) be two soft concept lattices. s L ( U , A 1 , F 1 ) is said to be finer than s L ( U , A 2 , F 2 ) , which is denoted by the following:
s L ( U , A 1 , F 1 ) s L ( U , A 2 , F 2 ) s C ( U , A 2 , F 2 ) s C ( U , A 1 , F 1 )
If s L ( U , A 1 , F 1 ) s L ( U , A 2 , F 2 ) and s L ( U , A 2 , F 2 ) s L ( U , A 1 , F 1 ) , then these two soft concept lattices are said to be isomorphic to each other, and denoted as follows
s L ( U , A 1 , F 1 ) s L ( U , A 2 , F 2 ) .
Theorem 16
([17]). Let ( U , A , F ) be a soft context. Then, s L ( U , A 1 , F 1 ) s L ( U , A 2 , F 2 ) if and only if Im ( F 1 + ) = Im ( F 2 + ) .
Theorem 17.
Let ( U , A , F ) be a soft context. If C is a consistent set of ( U , A , F ) , then s L ( U , A , F ) s L ( U , C , F | C ) .
Proof. 
For a consistent set C A , by Theorem 5, s C ( U , A , F ) = s C ( U , C , F | C ) if and only if Im ( F + ) = Im ( F | C + ) . So, s L ( U , A , F ) s L ( U , C , F | C ) . □
For a formal context ( U , A , I ) , let us define a soft set F I : A P ( U ) as follows F I ( a ) = { x U : ( x , a ) I } . Then, ( U , A , F I ) is a soft context. Therefore, every formal context ( U , A , I ) induces a soft context ( U , A , F I ) . We call ( U , A , F I ) the associated soft context [17] induced by a formal context ( U , A , I ) . Furthermore, for D A . Then, denote I D = I ( U × D ) . Then, ( U , D , I D ) is a formal context and ( U , A , F I D ) is also the associated soft context induced by a formal context ( U , D , I D ) .
Theorem 18
([17]). Let ( U , A , I ) be a formal context. Then,
(1) 
the formal concept lattice L ( U , A , I ) is order-isomorphic to s L ( U , A , F I ) ;
(2) 
for the formal concept lattice L ( U , A , I ) of ( U , A , I ) ,
L ( U , A , I ) = { ( X , F I ( X ) ) | X   i s   a n y   e l e m e n t   o f   s L ( U , A , F I ) } .
Corollary 4.
Let ( U , A , I ) be a formal context and D A . Then,
(1) 
the formal concept lattice L ( U , D , I D ) is order-isomorphic to s L ( U , D , F I D ) ;
(2) 
L ( U , D , I D ) = { ( X , F I ( X ) ) | X   i s   a n y   e l e m e n t   o f   s L ( U , D , F I D ) } .
Proof. 
(1) For D A , ( U , D , I D ) is a formal context and ( U , D , F I D ) is the associated soft context of ( U , D , I D ) . By Theorem 18, the formal concept lattice L ( U , D , I D ) is order-isomorphic to s L ( U , D , F I D ) .
(2) Since ( U , D , I D ) is a formal context and L ( U , D , I D ) is the formal concept lattice of ( U , D , I D ) , it follows from (2) of Theorem 18. □
Let ( U , A , I ) be a formal context. Then, D is called a consistent [7] of ( U , A , I ) if there exists a set D A such that L ( U , D , I D ) L ( U , A , I ) .
Finally, we obtain the meaningful theorem for the consistent set of a given formal context:
Theorem 19.
Let ( U , A , I ) be a formal context. Then, C is a consistent of ( U , A , I ) if and only if C is a consistent set of the associated soft context ( U , A , F I ) .
Proof. 
Let C be a consistent set of a formal context ( U , A , I ) . Then, by Theorem 18 and Corollary 4, L ( U , A , I ) L ( U , C , I C ) if and only if s L ( U , A , F I ) s L ( U , C , F I C ) if and only if s C ( U , A , F I ) = s C ( U , C , F I C ) . Hence, C is also a consistent set of the associated soft context ( U , A , F I ) . □

4. Application

In this section, we apply the Fundamental Theorem II of Consistent Sets (Theorem 15) to obtain a consistent set of a given formal context. We may write x y z instead of a set { x , y , z } .
For U = { 1 , 2 , 3 , 4 , 5 } and A = { a , b , c , d , e , f , g , h , i , j } , Table 1 shows a formal context ( U , A , I ) .
From the formal context ( U , A , I ) , naturally, we can define a set-valued mapping F I : A P ( U ) as F I ( a ) = { x U | x I a } , and from now on, the set-valued mapping F I is simply denoted by F. Then, ( F , A ) is a soft set as follows:
F ( a ) = F ( d ) = 135 ;   F ( b ) = 1245 ;   F ( c ) = F ( g ) = F ( j ) = 24 ;
F ( e ) = 13 ;   F ( f ) = 15 ;   F ( h ) = 1 ;   F ( i ) = 2 .
Therefore, we have the associated soft context ( U , A , F I ) (simply, ( U , A , F ) ) induced by a formal context ( U , A , I ) . Then, by Theorem 4 and F A = { F ( a ) | a A } , we can find the family s C ( U , A , F ) of all soft concepts as:
s C ( U , A , F ) = { S | S F A } = { , 1 , 2 , 13 , 15 , 24 , 135 , 1245 , U } .
Consequently, by Theorem 18 and s L ( U , A , F ) = ( s C ( U , A , F ) , , , ) , the formal concept lattice L ( U , A , I ) is easily obtained as the following diagram:
Mathematics 07 00071 i001
From now on, we will describe the process of obtaining a consistent set of ( U , A , I ) by using Theorem 19.
First, we explain how to obtain a consistent set of the associated soft context ( U , A , F ) through three steps by using Theorem 15.
Step 1: By using the soft set ( F , A ) defined above, we obtain the independent set A I = { a , b , c , d , e , g , i , j } on A in the following way:
(1)
From G a = { g A F ( a ) F ( g ) } ,
G a = G b = G d = ; G c = G g = G j = { b } ; G e = { a , d } ;
G f = { a , b , d } ; G h = { a , b , d , e , f } ; G i = { b , c , g } :
(2)
F + ( G f ) = { F ( a ) | a G f } = F ( a ) F ( b ) F ( d ) = 15 = F ( f ) ;
F + ( G h ) = F ( a ) F ( b ) F ( d ) F ( e ) F ( f ) = 1 = F ( h ) ;
F + ( G c ) = F + ( G g ) = F + ( G j ) F ( c ) ( F ( g ) , F ( j ) ) ;
F + ( G e ) F ( e ) ; F + ( G i ) F ( i ) .
From F + ( G f ) = F ( f ) and F + ( G h ) = F ( h ) , it follows that A D = { f , h } , and so,
A I = A A D = { a , b , c , d , e , g , i , j } .
Step 2: We find two classes 1 ( A ) = { b , e , i } and 2 ( A ) = { a , c , d , g , j } of A I in the following way: For A I = { a , b , c , d , e , g , i , j } ,
{ x A I F ( a ) = F ( x ) } = { a , d } ; { x A I F ( b ) = F ( x ) } = { b } ;
{ x A I F ( c ) = F ( x ) } = { c , g , j } ; { x A I F ( e ) = F ( x ) } = { e } ;
{ x A I F ( i ) = F ( x ) } = { i } .
So, n ( a ) = n ( d ) = 2 ; n ( c ) = n ( g ) = n ( j ) = 3 ; n ( b ) = n ( e ) = n ( i ) = 1 .
Hence, 1 ( A ) = { b , e , i } ;   2 ( A ) = { a , c , d , g , j } .
Step 3: By using Theorem 15, we construct a consistent set C of the associated soft context ( U , A , F ) as follows:
C = 1 ( A ) { a , g } = { a , b , e , g , i } .
So finally, we obtain a consistent set C = { a , b , e , g , i } of the associated soft context ( U , A , F ) .
Furthermore, by Theorem 19, C = { a , b , e , g , i } A is also a consistent set of a formal context ( U , A , I ) and L ( U , A , I ) L ( U , C , I C ) .
In fact, we can construct the formal concept lattice L ( U , C , I C ) by using the following facts: For a consistent set C = { a , b , e , g , i } of the associated soft context ( U , A , F ) ,
(1)
F | C : C P ( U ) is a set-valued mapping defined as follows:
F | C ( a ) = 135 ;   F | C ( b ) = 1245 ;   F | C ( g ) = 24 ;   F | C ( e ) = 13 ;   F | C ( i ) = 2 .
(2)
s C ( U , C , F | C ) = s C ( U , A , F ) = { , 1 , 2 , 13 , 15 , 24 , 135 , 1245 , U } .
(3)
F | C : P ( U ) P ( C ) is a mapping defined as follows: For X P ( U ) ,
F | C ( X ) = { a C : X F | C ( a ) } .
Finally, by Corollary 4 and s L ( U , C , F | C ) = ( s C ( U , C , F | C ) , , , ) ,
L ( U , C , I C )
= { ( X , F | C ( X ) ) |   X   is   any   element   of   s L ( U , C , F | C ) }
= { ( , C ) , ( 1 , a b e ) , ( 2 , b g i ) , ( 13 , a e ) , ( 15 , a b ) , ( 24 , b g ) , ( 135 , a ) , ( 1245 , b ) , ( U , ) } .
where
F | C ( U ) = ;   F | C ( ) = C ;   F | C ( 1 ) = a b e ;   F | C ( 2 ) = b g i ;   F | C ( 13 ) = a e ;
F | C ( 15 ) = a b ;   F | C ( 24 ) = b g ;   F | C ( 135 ) = a ;   F | C ( 1245 ) = b .
Mathematics 07 00071 i002

5. Conclusions

The soft context is a system proposed to study a more effective method of finding all formal concepts and reductions in a formal context, which is induced using a soft set instead of a binary relationship in formal contexts. In this paper, we investigated the notion of consistent sets of soft contexts as in the formal context. For the purpose of studying the characterizations of consistent sets, we introduced the notions of 1 0 and 2 0 classes of independent attributes, and determined that every consistent set has to contain the Essential Zone 1 0 of consistent sets. Additionally, we studied the fundamental theorems necessary to construct the consistent sets of a given soft context. In particular, we have shown that the Fundamental Theorem II provides a more efficient way of constructing a consistent set of a formal context. In a subsequent study, we intend to obtain a more effective method of finding reducts in a formal context using associated soft contexts as in this study. So, we will investigate the notion of reducts of a soft context and a method of constructing reduction of a soft context. In particular, we will look for ways to construct reduction using independent soft concepts and subsets of independent attributes of a soft context. Finally, we will apply the reduction of a soft context to the reduction of a formal context.

Funding

This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education (No. NRF-2017R1D1A1B03031399).

Acknowledgments

The author would like to thank the editors and the four anonymous reviewers for their valuable comments and suggestions which have helped immensely in improving the quality of this paper.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Wille, R. Restructuring the lattice theory: An approach based on hierarchies of concepts. In Ordered Sets; Rival, I., Ed.; D. Reidel: Dordrecht, The Netherlands; Boston, MA, USA, 1982; pp. 445–470. [Google Scholar]
  2. Chen, L.; Huang, T.; Song, Z.; Pei, Z. Formal concept analysis based on set-valued mapping. Chin. Q. J. Math. 2008, 23, 390–396. [Google Scholar]
  3. Ganter, B.; Wille, R. Formal Concept Analysis: Mathematical Foundations; Springer: Berlin, Germany, 1999. [Google Scholar]
  4. Jin, J.; Qin, K.; Pei, Z. Reduction-Based Approaches towards Constructing Galois (Concept) Lattices; Lecture Notes in Artificial Intelligence, 4062; Springer: Berlin, Germany, 2006; pp. 107–113. [Google Scholar]
  5. Wille, R. Concept lattices and conceptual knowledge systems. Comput. Math. Appl. 1992, 23, 493–515. [Google Scholar] [CrossRef] [Green Version]
  6. Belohlavek, R. Concept lattices and order in fuzzy logic. Ann. Pure Appl. Log. 2004, 128, 277–298. [Google Scholar] [CrossRef] [Green Version]
  7. Medina, J.; Ojeda-Aciego, M.; Ruiz-Calvino, J. Relating attribute reduction in formal, object-oriented and property-oriented concept latticesComput. Math. Appl. 2012, 64, 1992–2002. [Google Scholar]
  8. Shao, M.W.; Liu, M.; Zhang, W.X. Set approximations in fuzzy formal concept analysis. Fuzzy Set Syst. 2007, 158, 2627–2640. [Google Scholar] [CrossRef]
  9. Shao, M.W.; Leung, Y. Relations between granular reduct and dominance reduct in formal contexts. Knowl. Based Syst. 2014, 65, 1–11. [Google Scholar] [CrossRef]
  10. Wang, L.; Liu, X.; Cao, J. A new algebraic structure for formal concept analysis. Inf. Sci. 2010, 180, 4865–4876. [Google Scholar] [CrossRef]
  11. Wang, X.; Zhang, W.X. Relations of attribute reduction between object and property oriented concept lattices. Knowl. Based Syst. 2008, 21, 398–403. [Google Scholar] [CrossRef]
  12. Xu, W.H.; Li, W.Q. Granular computing approach to two-way learning based on formal concept analysis in fuzzy datasets. IEEE Trans. Cybern. 2016, 46, 366–379. [Google Scholar] [CrossRef] [PubMed]
  13. Zhang, W.X.; Ma, J.M.; Fan, S.Q. Variable threshold concept lattices. Inf. Sci. 2007, 177, 4883–4892. [Google Scholar] [CrossRef]
  14. Molodtsov, D. Soft set theory first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  15. Maji, P.K.; Biswas, R.; Roy, R. Soft set theory. Comput. Math. Appl. 2003, 45, 555–562. [Google Scholar] [CrossRef] [Green Version]
  16. Ali, M.I.; Feng, F.; Liu, X.Y.; Min, W.K.; Shabir, M. On some new operations in soft set theory. Comput. Math. Appl. 2009, 57, 1547–1553. [Google Scholar] [CrossRef] [Green Version]
  17. Min, W.K.; Kim, Y.K. Soft concept lattice for formal concept analysis based on soft sets: Theoretical foundations and Applications. Soft Comput. 2018. [Google Scholar] [CrossRef]
  18. Min, W.K. Soft sets over a common topological universe. J. Intell. Fuzzy Syst. 2014, 26, 2099–2106. [Google Scholar]
Table 1. A formal context.
Table 1. A formal context.
-abcdefghij
11101110100
20110001011
31001100000
40110001001
51101010000

Share and Cite

MDPI and ACS Style

Min, W.K. Consistent Sets of Soft Contexts Defined by Soft Sets. Mathematics 2019, 7, 71. https://doi.org/10.3390/math7010071

AMA Style

Min WK. Consistent Sets of Soft Contexts Defined by Soft Sets. Mathematics. 2019; 7(1):71. https://doi.org/10.3390/math7010071

Chicago/Turabian Style

Min, Won Keun. 2019. "Consistent Sets of Soft Contexts Defined by Soft Sets" Mathematics 7, no. 1: 71. https://doi.org/10.3390/math7010071

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop