Identifying Non-Sublattice Equivalence Classes Induced by an Attribute Reduction in FCA

: The detection of redundant or irrelevant variables (attributes) in datasets becomes essential in different frameworks, such as in Formal Concept Analysis (FCA). However, removing such variables can have some impact on the concept lattice, which is closely related to the algebraic structure of the obtained quotient set and their classes. This paper studies the algebraic structure of the induced equivalence classes and characterizes those classes that are convex sublattices of the original concept lattice. Particular attention is given to the reductions removing FCA’s unnecessary attributes. The obtained results will be useful to other complementary reduction techniques, such as the recently introduced procedure based on local congruences.


Introduction
Redundant data hinder the efficient acquisition of information from datasets. Obviously, the elimination of redundant data should not modify the information contained in a dataset. The most common redundant data consist of repeated entries, which can be removed without cost, or dependent variables, which can be derived from the independent variables, whose detection is an appealing research topic in many areas dealing with data analysis, such as Formal Concept Analysis (FCA). This mathematical theory was original developed in the 1980s by R. Wille and B. Ganter [1], and it has intensively been studied from a theoretical and applied point of view [2][3][4][5][6][7][8][9][10][11][12]. Two important features of FCA, in which the notion of Galois connection is fundamental [13][14][15][16], is that the information contained in a relational dataset can be described in a hierarchic manner by means of a complete lattice [17] and that dependencies between attributes can be determined [18][19][20][21], which is fundamental to applications. In both features, the removal of redundant data has a great impact.
The detection of (ir)relevant attributes or objects of a given formal context in FCA has been studied from different points of view, for example: in order to obtain a concept lattice isomorphic to the original one [22][23][24][25][26], to efficiently reduce the size of the concept lattice [8,[27][28][29][30][31][32], to extensional stability [33], to consider contexts with positive and negative attributes [34], to apply the rough set philosophy [35][36][37], etc. Notice that the different mechanisms focused on attribute reduction can dually be adapted to object reduction.
In [36], it was demonstrated that attribute reductions of formal contexts induce equivalence relations whose equivalence classes have the structure of join-semilattices. In addition, in [38], local congruences were introduced as equivalence relations defined on lattices whose equivalence classes are sublattices of the original lattice. Therefore, local congruences were intended to complement the attribute reductions of formal contexts in order to ensure that the equivalence classes [C] D are sublattices of the original concept lattice. Due to a join-semilattice with the least element being a lattice, if the infimum C m = C i ∈[C] D C i belongs to the equivalence class, we can assert that the class already is a sublattice. Obviously, in these cases, the use of local congruences, as a complementary mechanism to the attribute reduction, turns out to be unnecessary since they do not provide any modification in the classes, and so, it modifies neither the attributes nor the objects generating the concepts of these classes. Therefore, it is very interesting to characterize the required conditions in which these cases hold, which was precisely the main issue addressed in [39].
In this paper, we continue with the research line initiated in [39], improving the results introduced in that work. Specifically, in this paper, we show an enhanced version of Proposition 4 and Corollary 1 in [39], which characterize the infimum of the elements belonging to a non-singleton classes. In addition, due to the attribute reductions usually carried out in FCA tending to discard the set of unnecessary attributes from the formal context, we also analyze the characterization of the infimum of the induced equivalence classes when the considered attribute reduction does not contain unnecessary attributes. The fact of considering attribute reductions that do not contain unnecessary attributes allows us also to prove some interesting results. For example, we establish a sufficient condition to ensure an equivalence between meet-irreducible concepts in the reduced context and in the original one. Furthermore, under this consideration, we also prove that when the original concept lattice is isomorphic to a distributive lattice, the induced equivalence classes by the reduction are always sublattices. Finally, all the results presented in this work are accompanied by illustrative examples whose objective is to clarify all the introduced ideas.
The paper is structured as follows: Section 2 reviews some preliminary notions related to formal concept analysis and attribute reduction. In Section 3, the contributions of this paper are presented, the study on the equivalence classes induced by an attribute reduction.This section is divided into two parts: first, we study sufficient conditions to characterize the infimum of equivalence classes, and second, we carry out an analysis of the characterization when the considered subset of attributes in the reduction does not contain unnecessary attributes. Finally, Section 4 presents some conclusions and provides some prospects for future work.

Preliminaries
First of all, we recall some basic notions about formal concept analysis and attribute reduction. A context in FCA is a triple (A, B, R) where A is a set of attributes, B is a set of objects, and R ⊆ A × B is a relation, such that (a, x) ∈ R, if the object x ∈ B possesses the attribute a ∈ A, and (a, x) ∈ R, otherwise. The derivation operators are the mappings ↑ : 2 B → 2 A and ↓ : 2 A → 2 B defined for each X ⊆ B and Y ⊆ A as: The subset X is called the extent of the concept, and the subset Y is called the intent; they are denoted by E(C) and I(C), respectively. Furthermore, a concept generated by an attribute a ∈ A, that is (a ↓ , a ↓↑ ), is called an attribute concept.
In addition, the set of concepts is denoted by C(A, B, R) and is a complete lattice with the inclusion order on the left argument, that is for each (X 1 , is called the concept lattice of the context (A, B, R). The meet ∧ and join ∨ operators are defined by: Considering a subset of attributes Y ⊆ A and the restriction relation R |Y×B = R ∩ (Y × B), the triple (Y, B, R |Y×B ) is also a formal context. There are two relevant notions regarding subsets of attributes in FCA that we recall below. Definition 1. Given a context (A, B, R), if there exists a subset of attribute Y ⊆ A such that C(A, B, R) ∼ = C(Y, B, R |Y×B ), then Y is called a consistent set of (A, B, R). Moreover, if C(Y\{y}, B, R |Y\{y}×B ) ∼ = C(A, B, R), for all y ∈ Y, then Y is called a reduct of (A, B, R).
Then, we can recall the definition of the three types of attributes considering the Proposition 2 ([36]). Given a context (A, B, R), a subset D ⊆ A, and a class [(X, Y)] D of the quotient set C(A, B, R)/ρ D , the class [(X, Y)] D is a join-semilattice with maximum element (X ↑ D ↓ , X ↑ D ↓↑ ).
In addition, an ordering relation on the set of equivalence classes given by the relation ρ D was defined in [41].
The quotient set C(A, B, R)/ρ D with the ordering relation D is closely related to the reduced concept lattice as shown in the following result presented in [41].
. Given a context (A, B, R) and a subset of attributes D ⊆ A, we have that the quotient set given by ρ D and the reduced concept lattice by D are isomorphic, that is: where ≤ D is the ordering in the original concept lattice restricted to the reduced one.
Next, the notation of the infimum of an equivalence class is given to simplify the expressions in which it is involved.
The following result was presented in [39], and it establishes preliminary consequences whenever a class, of the equivalence relation induced by an attribute reduction, contains its infimum.

Proposition 4 ([39]
). Let (A, B, R) be a context, D ⊆ A a subset of attributes, and [C] D an equivalence class of the induced equivalence relation, with C ∈ C(A, B, R), which is not a convex sublattice, then we have that one of the following statements is satisfied:

•
There exists at least one attribute a ∈ D such that C m = (a ↓ , a ↓↑ ).
We continue, in the following sections, this study exploring characterizations of the infimum of equivalence classes. Lastly, distributive lattices play an important role at the end of the paper. We recall their definition below.
Distributive lattices offer interesting properties such as the uniqueness of meet and join-irreducible decompositions and the following result.
Proposition 5 ([17]). Given a distributive lattice (L, ) and a meet-irreducible element p, if ∧ i∈I x i p, then there exists i 0 ∈ I, such that x i 0 p.

Characterizing the Infimum of Classes
In this section, we continue with the study on the equivalence classes induced by a reduction of attributes presented in [39], improving the results introduced in it. From this point forward, a formal context (A, B, R) is fixed, and the maximum element of an equivalence class , and therefore, X M = X ↑ D ↓ is also the extent of a concept of the reduced concept lattice C(D, B, R |D×B ).
First of all, different technical results are introduced. Given a context (A, B, R) and any two concepts of its corresponding concept lattice This attribute is completely determined when attribute concepts are considered. Proposition 6. Given a context (A, B, R), C 1 ∈ C(A, B, R), D ⊆ A, a ∈ D, and a concept C 2 = (a ↓ , a ↓↑ ), we have that: Proof. If a ∈ I(C 1 ), then by the properties of the concept-forming operators, we obtain that a ↓↑ ⊆ I(C 1 ) ↓↑ = I(C 1 ), which leads us to a contradiction with the hypothesis C 1 ≤ C 2 . Thus, a ∈ I(C 1 ).
By reduction ad absurdum, we assume that Hence, we obtain a contradiction with the hypothesis a ∈ I(C 1 ).
In a similar way, the following proposition arises for equivalence classes induced by an attribute reduction. Proposition 7. Given a context (A, B, R), C 1 , C 2 ∈ C(A, B, R) with C 1 ≤ C 2 , and D ⊆ A, we have that C 1 ∈ [C 2 ] D if and only if there exists a ∈ D, such that a ∈ I(C 1 ) and a ∈ I(C 2 ).
Proof. We consider a context (A, B, R) and a subset of attribute D ⊆ A. Let us assume any two concepts C 1 , then we obtain straightforwardly that C 1 < C 2 , and hence, there exists a ∈ D, such that a ∈ I(C 1 ) and a ∈ I(C 2 ). On the other hand, if there exists an attribute a ∈ D such that a ∈ I(C 1 ) and a ∈ I(C 2 ), then C 1 ∈ [C 2 ] D by the definition of ρ D in Proposition 1.
In Proposition 7, we chose the concept C 2 to represent the equivalence class [C 2 ] D , but this class univocally determines a concept in the reduced concept lattice C(D, B, R |D×B ) by Theorem 2. In order to differentiate between classes and associated concepts in the reduced concept lattice, we denote the latter with a line over the concept, that is C 2 .

Characterizing the Infimum of Classes
The following property determines a sufficient condition to ensure that the equivalence class of the infimum element is generated by an attribute concept.
Proof. Since C m is not in [C] D , by Proposition 7, there exists a 1 ∈ D, such that a 1 ∈ I(C m ) and a 1 ∈ I(C).
= I(C) ↓↑ D , and we obtain that: which leads us to a contradiction. Therefore, we have that C 1 ∈ [C] D . Hence, in particular, C 1 cannot be meet-irreducible, since by hypothesis, in this case, Thus, there exists a 2 ∈ D\{a 1 }, such that a 2 ∈ I(C m ) and a 2 ∈ I(C). This process can be repeated, and due to D being finite, it must finish in an attribute a ∈ D such that Note that Theorem 3 arises from the restriction of the hypotheses of Proposition 4. The following example is useful to illustrate the previous result. This example also inspects Corollary 1 presented in [39], and as a consequence, it also argues that Theorem 3 must be considered instead of this corollary. Table 1, which has the concepts listed on Table 2. The associated concept lattice is given on the left side of Figure 1.

Example 1. We consider a context composed of the set of attributes
From this context, we obtain the attribute concepts listed below, together with the induced equivalence classes obtained by removing attributes a 2 and a 3 , that is considering only the subset of attributes D = {a 1 , a 4 }.
The partition induced by such a reduction is shown on the right side of Figure 1. Notice that two of the obtained equivalence classes are not convex sublattices of the original concept lattice. The first one contains the concepts C 1 , C 2 , C 4 , and the other one contains the concepts C 5 , C 6 , C 7 . However, the reasons for which these classes are not convex sublattices are well differentiated. On the one hand, if we consider the equivalence class [C 7 ] D , we have that the infimum of the concepts of this class is the concept C 3 . Notice that the meet-irreducible decomposition of C 3 is C 3 = C 5 ∧ C 6 , and both concepts C 5 and C 6 belong to [C 7 ] D ; this means that we are under the conditions given in Theorem 3. Since C 3 ∈ [C 7 ] D , we have that [C 3 ] D = [(a ↓ , a ↓↑ )] D , with a ∈ D. Specifically, in this case, we have that the concept C 3 is just generated by the attribute a 4 ∈ D. Notice that C m is not always an attribute concept. For example, if we consider D = {a 4 }, then we obtain two classes: [C 7 ] D = {C 7 , C 6 , C 5 , C 4 , C 2 , C 1 } and [C 3 ] D = {C 3 , C 0 }, where C 0 = C 4 ∧ C 5 ∧ C 6 and satisfying that C 4 , C 5 , C 6 belong to [C 7 ] D . Therefore, the hypotheses of Theorem 3 hold; indeed, [C 0 ] D = [(a ↓ 4 , a ↓↑ 4 )] D ; however, C 0 is not an attribute concept. On the other hand, if we consider the equivalence class [C 4 ] D , we have that the infimum of the equivalence class [C 4 ] D is the concept C 0 . In this case, the decomposition of C 0 is C 0 = C 4 ∧ C 5 ∧ C 6 , we observe that there are two meet-irreducible concepts, C 5 and C 6 , such that C 5 , C 6 / ∈ [C 4 ] D . Therefore, we cannot apply Theorem 3 since the hypothesis are not satisfied. Moreover, since the concept lattice C(A, B, R) is distributive, the condition that the meet-irreducible concepts of the decomposition are in the class is a required hypothesis in [39], Corollary 1. In addition, this corollary must also be corrected in its conclusion, since [C m ] D = [(a ↓ , a ↓↑ )] D can only be ensured. Thus, Theorem 3 presents an improved version of Corollary 1 given in [39].
Next, we present one of the main results of this paper, which characterizes the infimum of the elements of non-singleton classes. • There exists at least one attribute a ∈ D such that C m = (a ↓ , a ↓↑ ). Therefore, if C m ∈ [C] D , then we can distinguish two cases: • If there exists a 0 ∈ D such that C m = (a ↓ 0 , a ↓↑ 0 ), the first statement holds. • Otherwise, C m is not generated by any attribute of D. On the one hand, since C m ∈ [C] D , we have that C m < C and C = C i for all C i ∈ [C] D ; applying Proposition 7 to the reduced context, we can assert that there exists at least one attribute a * ∈ D such that a * ∈ I(C m ) and a * ∈ I(C i ) for all C i ∈ [C] D . On the other hand, there exists an attribute concept C * ∈ C(A, B, R) such that C * = (a * ↓ , a * ↓↑ ), which implies that C m ≤ C * . Moreover, , then the concept C * is the required concept, and the second statement holds. If C * ∈ M F (A, B, R), we consider a meet-decomposition of C * in the reduced concept lattice C(D, B, R |D×B ), that is C * = j∈J C j , where C j ∈ M F (D, B, R |D×B ) for all j ∈ J. Since C * = (a * ↓ , a * ↓↑ ) and a * ∈ I(C M ), then by Proposition 6, we have that C M ≤ C * . If C M ≤ C j , for all j ∈ J, then, by the infimum property, we obtain that C M ≤ C j ∈J C j = C * , which leads us to a contradiction. Therefore, there exists j 0 ∈ J, such that C j 0 is in a meet-decomposition in the reduced context of C * , with C M ≤ C j 0 . This last property implies that C j 0 ∈ [C M ] D (since, otherwise, C M = C j 0 ) and C M ≤ C j 0 . Moreover, since C j 0 is a meet-irreducible concept of the reduced context, then there exists a ∈ D, such that C j 0 = (a ↓ , a ↓↑ D ). Thus, C j 0 is the required concept in the second statement. Now, we assume that one of the statements is satisfied, and we again consider two cases:

•
There exists a 0 ∈ D such that C m = (a ↓ 0 , a ↓↑ 0 ), then since [C] D is not a singleton, we have that C m = C i ∈[C] D C i < C, and so, a 0 ∈ I(C m ) and a 0 ∈ I(C). Therefore, by Proposition 7, we obtain that C m ∈ [C] D . • There exists a concept C * ∈ C(A, B, R), such that C * = (a * ↓ , a * ↓↑ ) with a * ∈ D, C M ≤ C * , and C * is in a meet-irreducible decomposition {C j ∈ M F (D, B, R |D×B ) | j ∈ J} of C m . Hence, by Proposition 6, we have that a * ∈ I(C * ) and a * ∈ I(C M ). Due to C * being in a meet-irreducible decomposition of C m , in particular, we have that C m ≤ C * , which implies that a * ∈ I(C * ) ⊆ I(C m ). Thus, since a * ∈ I(C m ) and a * ∈ I(C M ), by Proposition 7, we obtain that Notice that, given C * = (a * ↓ , a * ↓↑ ) with a * ∈ D, if C ≤ C * , then a * cannot belong to I(C), and so, C * ∈ [C] D . Hence, the hypothesis C * ∈ [C] D is not considered in the implication to prove C m ∈ [C] D . Moreover, from the hypothesis that C * is in a meetirreducible decomposition {C j ∈ M F (D, B, R |D×B ) | j ∈ J} of C m , only C m ≤ C * is used. These hypotheses are included in the characterization in order to collect as much as possible the consequences of C m ∈ [C] D . The following corollary presents the reduced version. • There exists at least one attribute a ∈ D such that C m = (a ↓ , a ↓↑ ). • There exists a concept C * ∈ C(A, B, R), such that C * = (a * ↓ , a * ↓↑ ) with a * ∈ D, C m ≤ C * , and C M ≤ C * .
Notice that the previous corollary improves Proposition 4, since the concept C * must be generated by an attribute of the reduced attribute subset D, and it does not need to be a meet-irreducible concept in order to obtain the equivalence. An application of Theorem 4 is illustrated in the following example.

Example 2.
We consider a context (A, B, R) whose Hasse diagram of its concept lattice C(A, B, R) is on the left side of Figure 2. Labels in the concept lattice indicate the mappings γ and µ of the fundamental theorem, that is the node labeled as a represents the concept (a ↓ , a ↓↑ ) for a ∈ A, and similarly, the node labeled as b represents the concept Now, if we consider a subset of attributes D = {a 1 , a 4 , a 5 }, we obtain an induced partition, which is illustrated in the middle of Figure 2. We choose the class [C 4 ] D = {C 2 , C 3 , C 4 }, which is not a singleton, and therefore, we are under the conditions of Theorem 4. Thus, C m = C 0 ∈ [C 4 ] D if and only if one of the statements of Theorem 4 is satisfied. In this case, we have that C m ∈ [C 4 ] D , and the second statement holds, as we show next.
We have that the concept C 5 ∈ C(A, B, R) is the attribute concept generated by a 5 , C 5 = (a ↓ 5 , a ↓↑ 5 ), where a 5 ∈ D, and it satisfies that C 5 ∈ [C 4 ] D and C M = C 4 C 5 . Moreover, the meet-irreducible decomposition of C m in the reduced concept lattice, shown on the right side of Figure 2, is the set {C 4 , C 5 }. Since C 5 is in the meet-irreducible decomposition of C m , we can conclude that the second statement is satisfied.

Attribute Reduction without Unnecessary Attributes
Attribute reduction in FCA usually removes unnecessary attributes. Hence, this section analyzes the characterization when the set D does not contain unnecessary attributes. This study is interesting, for example, for any attribute reduction strategy merging FCA and other frameworks, such as rough set theory [35,42,43]. The first result shows that Statement 1 in Proposition 4 only arises when the context contains unnecessary attributes. Proof. Since [C] D is not a singleton, C m = C i ∈[C] D C i and C m = (a ↓ , a ↓↑ ) with a ∈ D, we have that C m is not a ∧-irreducible concept. Therefore, a ∈ A generates a non-irreducible concept, and by Theorem 1, we obtain that a ∈ I f .
As a consequence of this result, Statement 1 in Theorem 4 and Statement 1in Corollary 1 cannot be satisfied when D does not contain any unnecessary attribute of A. Hence, according to this consideration, Theorem 4 can be written as follows. (A, B, R), a subset of attributes D ⊆ A, such that D ⊆ A\I f , and a concept C ∈ C(A, B, R), where [C] D is not a singleton, then, C m ∈ [C] D if and only if there exists C * ∈ C(A, B, R), such that C * = (a * ↓ , a * ↓↑ ) with a * ∈ D, C * ∈ [C] D , C M ≤ C * , and C * is in a meet-irreducible decomposition {C j ∈ M F (D, B, R |D×B ) | j ∈ J} of C m .

Corollary 2. Given a context
In general, a meet-irreducible C * in the reduced concept lattice does not have an associated meet-irreducible concept in the original concept lattice as the following example shows. Figure 3, which is associated with a context C (A, B, R). If we select the subset of attributes D = {a 1 , a 2 , a 6 }, then we obtain the induced partition illustrated in the middle of Figure 3. As we can see in the figure, there is a class, [C 4 ] D = {C 1 , C 2 , C 4 }, such that the concept C m = C 0 ∈ [C 4 ] D . Therefore, by Theorem 4, there exists a concept satisfying the second statement of this theorem (the first statement is not satisfied since C 0 is not generated by any attribute). Moreover, we have that the meet-irreducible decomposition of C m is the set {C 3 , C 4 , C 5 }, as we can see in the reduced concept lattice induced by the attribute reduction depicted on the right side of Figure 3. In this case, the concept C 3 , which satisfies the conditions of the second statement of Theorem 4, is a meet-irreducible concept in the reduced concept lattice C(D, B, R |D×B ); however, the concept C 3 = (a ↓ 1 , a ↓↑ 1 ) is not a meet-irreducible concept in C(A, B, R).

Example 3. Let us consider the concept lattice on the left side of
The following result shows that removing unnecessary attributes provides a sufficient condition to ensure the equivalence between meet-irreducible concepts in the reduced context and in the original one. Proposition 9. Given a context (A, B, R), a subset of attributes D ⊆ A\I f , and a concept C ∈ C(A, B, R), such that C = (a ↓ , a ↓↑ ), with a ∈ D, the following equivalence holds: Proof. On the one hand, if we assume the concept C is a meet-irreducible concept in the original concept lattice, C ∈ M F (A, B, R), then taking into account that a ∈ D, the set of extents of the reduced concept lattice is included in the set of extents of the original, and if C 1 ≤ C 2 , then C 1 ≤ C 2 holds too; we have that C = (a ↓ , a ↓↑ D ) is also a meet-irreducible concept in the reduced concept lattice, C ∈ M F (D, B, R |D×B ).
On the other hand, if we assume that C ∈ M F (D, B, R |D×B ), then there exists a ∈ D such that C = (a ↓ , a ↓↑ D ). Furthermore, since a ∈ I f , we have that C = (a ↓ , a ↓↑ ) ∈ M F (A, B, R) by Theorem 1.
Notice that a 1 in Example 3 is an unnecessary attribute, which is the reason why C 3 is not a meet-irreducible element of the original concept lattice. Hence, as a consequence of the previous results, Theorem 4 can be rewritten as follows. Therefore, if the subset D ⊆ A contains no unnecessary attribute, which is the case of the reducts in FCA [1,26], the characterization is mainly based on the concepts of the original concept lattice instead of Theorem 4. This fact simplifies the detection of lattices whose equivalence classes of an attribute reduction are not convex sublattices of the original concept lattice. Moreover, this result also improves Proposition 4, showing that D ⊆ A\I f must be included in the hypothesis of this proposition in order to obtain the equivalence.
Thus, the previous results and examples have a relevant interest for the application of local congruences, since they characterize the cases when the classes are not sublattices [36,39] and, so, what classes are affected when a local congruence is applied after an attribute reduction mechanism. In particular, we can determine the kind of lattices for which, after applying any attribute reduction, we obtain equivalence classes that are convex sublattices, that is for any class of any attribute reduction, the concept C m belongs to the class. Based on these results, different particular cases are analyzed next.   The concatenation of this lattice (right side of Figure 4) also satisfies this statement as the following result shows. Proposition 10. Given a context (A, B, R), whose concept lattice is isomorphic to D n , with n ∈ N, D ⊆ A\I f , and a class [C] D , we have that C m ∈ [C] D .
Proof. Let us consider a context (A, B, R) whose associated concept lattice is isomorphic to D n , with n ∈ N. In addition, let us consider a subset of attributes D ⊆ A, a concept C ∈ C(A, B, R), and the equivalence class [C] D of the induced equivalence relation.
If [C] D is a singleton, then clearly, C m ∈ [C] D . Hence, we assume that [C] D is not a singleton. Since, by Proposition 8, C m cannot be a meet-irreducible concept, we have that all meet-irreducible concepts in the decomposition of C m belong to the class [C] D , because of the shape of this lattice. Therefore, by Theorem 3, we have that [C m ] D = [(a ↓ , a ↓↑ )] D , with a ∈ D and a ∈ I(C). If C m = (a ↓ , a ↓↑ ), then by Proposition 8, we obtain that a ∈ I f , which leads us to a contradiction. Otherwise, there exists a concept C * such that C m < C * = (a ↓ , a ↓↑ ) and C * ∈ [C] D . As a consequence, by the shape of D n , C * must be a meet-irreducible concept in the meet-irreducible decomposition of C m . Thus, we obtain a contradiction with the fact that all meet-irreducible concepts in the decomposition of C m belong to the class [C] D .
The following example shows that the basic non-distributive lattices M 3 and N 5 do not satisfy the previous property.

Example 5.
We consider a context (A, B, R), where the Hasse diagram of its concept lattice C(A, B, R) is depicted on the left side of Figure 5, which is isomorphic to M 3 , and it has no unnecessary attribute. If we carry out any attribute reduction on this particular context, we cannot ensure that every induced equivalence class obtained by the reduction is a convex sublattice. For instance, we consider the subset of attributes D M 3 = {a 3 }, and therefore, the induced partition obtained by this attribute reduction is the Venn diagram depicted on the right side of Figure 5. We can notice that the infimum concept C 0 of the class [C 4 ] D = {C 1 , C 2 , C 4 } does not belong to the class since there is a concept C 3 such that C 3 = (a ↓ 3 , a ↓↑ 3 ), with a 3 ∈ D, C m ≤ C 3 and C M C 3 , that is Statement 2 of Corollary 1 is satisfied.
A similar case arises when a context (A, B, R), with concept lattice C(A, B, R) isomorphic to N 5 (left side of Figure 6) and without unnecessary attributes, is considered. If we consider the singleton D N 5 = {a 1 }, we obtain the partition shown on the right side of Figure 6. In this case, Statement 2 of Corollary 1 also holds, because there is a concept C 1 , such that C 1 = (a ↓ 1 , a ↓↑ 1 ) with a 1 ∈ D, C m ≤ C 1 , and C M C 1 . Thus, Finally, we prove that, in general, every distributive lattice satisfies the property.
Theorem 6. Given a context (A, B, R), whose concept lattice is isomorphic to a distributive lattice, D ⊆ A\I f , and a class [C] D , we have that C m ∈ [C] D .

Proof.
We proceed by reduction ad absurdum. Hence, we assume that C m ∈ [C] D , and we get a contradiction.
From C m ∈ [C] D , by Proposition 7, we have that there exists a ∈ D, such that a ∈ I(C m ) and a ∈ I(C). Since a ∈ I f , by Proposition 8, there exists a concept C * such that C m ≤ C * = (a ↓ , a ↓↑ ) and C * ∈ [C] D , which must be meet-irreducible, because otherwise, a ∈ I f .
Moreover, by the definition of C m , we have that: The uniqueness arises because the concept lattice is distributive. Hence, in particular, the concept C * belongs to this decomposition. Therefore, by Proposition 5, there exists C i ∈ [C] D , such that C i ≤ C * , which implies that: a ∈ I(C * ) ↓↑ D ⊆ I(C i ) ↓↑ D = I(C) ↓↑ D which contradicts that a ∈ I(C).
This result and the previous example are very interesting since they characterize the concept lattices providing convex sublattices for every attribute reduction. In addition, when the concept lattice is not distributive, we highlighted that many possibilities exist such that an attribute reduction provides equivalent classes, which are not sublattices of the original one. Moreover, Theorem 6 holds when the attribute reduction does not contain unnecessary attributes, as in FCA. If the reduction is given by another mechanism, such as based on the rough set theory philosophy [35,42,43], we can obtain classes that are not sublattices, as Example 3 shows. These facts also reinforce the necessity of studying mechanisms to lightly modify the equivalence relation given by the reduction in order to ensure that the classes are convex sublattices, as the new notion of local congruence [38,45] does.

Conclusions and Future Work
In this paper, we improve the results presented in [39], giving a characterization of the infimum of the elements belonging to a non-singleton class induced by an attribute reduction. Furthermore, we also found the characterization of these infimum elements when the considered attribute reduction does not contain unnecessary attributes, which is of special interest in FCA since attribute reductions usually discard this kind of attribute. We also introduced other interesting results in this framework. For example, we proved that the equivalence classes, induced by an attribute reduction on a distributive concept lattice, always have the structure of a convex sublattice. All the theoretical development carried out in this paper has a direct impact on the theory of local congruences [38].
In the future, we will study sufficient conditions on a (fuzzy) context in order to ensure that its concept lattice is distributive. This is an interesting problem, which has already attracted the attention of other researchers [46]. Moreover, the introduced results will be applied to real cases, such as the ones obtained from the COST Action DigForASP, which is focused on the application of artificial intelligence and automatic reasoning tools to digital forensics.
Author Contributions: All authors contributed equally to this work. All authors read and agreed to the published version of the manuscript.