Nayak et al. (2025) introduced the concept of convex subhyperlattices of a strong join hyperlattice L and demonstrated that the collection of all convex subhyperlattices, CS(L), together with empty set, forms a lattice. In particular, for P-hyperlattices and Nakano hyperlattices, they obtained a unique representation of convex subhyperlattices in terms of hyperideals and hyperfilters. In the present work, we extend these studies by proving that CS(L)∪{∅}, under set inclusion, forms an algebraic lattice. Moreover, we introduce two new orders on CS(L) and examine their properties, including conditions for equivalence of these orders. In the class of P-hyperlattices, we characterize convex subhyperlattices in terms of initial and final segments, providing a structural insight into their formation. When convexity is extended to arbitrary join hyperlattices, many results known for P-hyperlattices and Nakano hyperlattices fail to hold. To address these limitations of convexity in arbitrary hyperlattices, we introduce the notion of strongly convex sets, denoted SC(L), which naturally generalizes the concept while preserving its fundamental properties and extends the applicability of results to a wider setting. We establish several results for SC(L) that do not hold for CS(L).
Introduction and Preliminaries
Hyperoperations serve as a broad generalization of binary operations. Building on this idea, Konstantinidou and Mittas [9] extended the classical notion of lattices by replacing the binary join and meet operations with corresponding hyperoperations. In [12], the authors introduced and investigated various generalizations of prime hyperideals, such as 2-absorbing and primary 2-absorbing hyperideals, within the framework of meet hyperlattices. Bideshki et al. [4] introduced the ideas of strong meet hyperlattices, hyperideals, and hyperfilters in strong meet hyperlattices. They also studied distributivity and dual distributivity in meet hyperlattices. Ameri et al. [1] examined residual mappings in meet hyperlattices through the framework of principal downsets and established specific conditions under which a mapping between two hyperlattices corresponds to a residual mapping. They further explored the structure and properties of convex subsets in meet hyperlattices. Later, Nayak et al. [11] introduced two kinds of hyperfilters in join hyperlattices and explored their relationships within P-hyperlattices and Nakano hyperlattices. They also examined convex subhyperlattices and provided a unique representation for them in terms of hyperideals and hyperfilters within P-hyperlattices and Nakano hyperlattices. Lavanya and Parameshwara Bhatta [10] investigated the collection of all convex sublattices of a lattice L under a partial order distinct from inclusion. They showed that the lattice of convex sublattices under this new order and the lattice under consideration belong to the same equational class. Extending their ideas, Bhargava and Hegde [3] introduced the concept of strongly convex subtrellises in trellises, a generalization of lattices, and generalized several corresponding results. Since hyperlattices are also natural generalizations of lattices, it is meaningful to ask whether these developments can be extended to the framework of hyperlattices. Nayak et al. [11] established that the set CS(L) of all convex subhyperlattices of a join hyperlattice L, including the empty set, forms a lattice under inclusion. In the present study, we demonstrate that CS(L)∪{∅} is an algebraic lattice. Furthermore, we introduce a new order on CS(L), defined for X,Y∈CS(L) such that X≤bY if and only if, for every element x∈X, there exists y∈Y such that x⪯y, and for every y∈Y, there exists x∈X such that x⪯y. Under this relation, CS(L) forms a partially ordered set. We also define another order on CS(L) using hyperideals and hyperfilters, and show that these two orders are equivalent in P-hyperlattices, though not necessarily in general, as illustrated through examples. Although convexity is well defined in strong hyperlattices, its direct extension to arbitrary hyperlattices is inadequate for preserving key results. The absence of unique representation of convex subhyperlattices motivates the need for the introduction of strongly convex sets. In the last section, we introduce strongly convex sets and discuss some of their properties.
Throughout this paper we use the following notations:
∨ is the join of two elements in a lattice L.
∨⌣ is the hyperoperation join.
⋁ is the classical join of a subset of a lattice L.
⪯ is the partial order on the hyperlattice L.
≺ is the covering relation in a classical lattice.
Definition 1.1 ([5]). Let H be a non-empty set and let P∗(H) be the set of all non-empty subsets of H. A hyperoperation on H is a map ∘:H×H→P∗(H) and (H,∘) is called a hypergroupoid.
If A and B are non-empty subsets of H and ⋎ is a hyperoperation, then
A⋎B=a∈A,b∈B⋃a⋎b,A⋎x=A⋎{x}andx⋎B={x}⋎B.
Definition 1.2 ([15]). Let L be a non-empty set, ⋎:L×L→P∗(L) be a hyperoperation, and ∧:L×L→L be a binary operation. Then (L,⋎,∧) is a join hyperlattice if for all x,y,z∈L the following conditions hold:
i. x∈x⋎x and x=x∧x.
ii. x⋎(y⋎z)=(x⋎y)⋎z and x∧(y∧z)=(x∧y)∧z.
iii. x⋎y=y⋎x and x∧y=y∧x.
iv. x∈x∧(x⋎y)∩x⋎(x∧y).
We say L is a strong join hyperlattice if whenever y∈x⋎y then x=x∧y.
Throughout, L denotes a strong join hyperlattice unless otherwise specified, and ⋎ and ∨ denote the join hyperoperation and the classical join operation respectively.
Definition 1.3 ([13]). Define the relation ⪯ on L as follows:
l1⪯l2if and only ifl1∧l2=l1if and only ifl2∈l1⋎l2.
Then (L,⪯) is poset.
Henceforth, ⪯ will denote a partial order on the strong hyperlattice L.
A non-empty subset H of L is a subhyperlattice if H is closed under the hyperoperation ⋎ and the operation ∧ in L[14]. A non-empty subset J of L which is closed under ⋎ is a hyperideal if a∈L, b∈J with a⪯b implies that a∈J[15]. A non-empty subset F of L which is closed under ∧ is a hyperfilter
i. type-I, if whenever a∈F, x∈L with a⪯x implies x∈F[15].
ii. type-II if a1∈F, x∈L with a1⪯x implies a1⋎x⊆F[11].
Definition 1.4 ([13]). Let A⊆L. The intersection of all hyperideals of L containing A is called the hyperideal generated by A and it is denoted by ⟨A]. If A={a}, then we call the hyperideal generated by A a principal hyperideal and denote it by ⟨a].
Definition 1.5. The intersection of all type-III hyperfilters of L containing A is called the type-III hyperfilter generated by A (or simply, the hyperfilter generated by A).
In the sequel, we use the notation ⟨A] to denote the hyperideal generated by A and [A⟩ to denote the (type-III) hyperfilter generated by A. The set of all hyperideals of L forms a lattice I(L) under inclusion, where the meet and join operations are given as: for J1,J2∈I(L), J1∧J2=J1∩J2 and J1∨J2=⟨J1∪J2]. Similarly, the set of all type-III hyperfilters forms a lattice F(L) under reverse inclusion where the meet and join operations are given as: for J1,J2∈F(L), J1∧J2=[J1∪J2⟩ and J1∨J2=J1∩J2.
Theorem 1.6[8]. Let (L,∧,∨) be lattice and P be a non-empty subset of L. We define a hyperoperation ∨P by
l1∨Pl2=l1∨l2∨P={l1∨l2∨p∣p∈P},
for all l1,l2∈L. Then (L,∨P,∧) is a join hyperlattice if and only if for each l1∈L there exists a p∈P such that p⪯l1. In this case we call L a P-hyperlattice. Also, L is a strong hyperlattice.
Definition 1.7[14]. Let (L,∧,∨) be a modular lattice. For any a,b∈L, define the Nakano hyperoperation a⊔b={z∈L:z∨a=z∨b=a∨b}. Then (L,⊔,∧) is a strong join hyperlattice.
We call the hyperlattice (L,⊔,∧) a Nakano join hyperlattice.
Lemma 1.8[11]. Intersection of hyperfilters of one type is again a hyperfilter of the same type, provided it is non-empty.
i All three types of hyperfilters of L are convex subsets of L.
ii Every hyperideal of L is a convex subhyperlattice.
iii Every type-III hyperfilter of L is a convex subhyperlattice.
Proposition 1.12[11]. Let {Ci}i∈τ be a collection of convex subhyperlattices of L. Then Co=⋂i∈τCi is a convex subhyperlattice provided Co is non-empty.
Lemma 1.13[11]. Let CS(L) be the set of all convex subhyperlattices of L. Then (CS(L)∪{∅},⊆) forms a lattice under inclusion order.
Theorem 1.14[11]. Let I be a hyperideal and F be a type-III hyperfilter of L. Then I∩F is a convex subhyperlattice provided it is non-empty.
Theorem 1.15[11]. In a join P-hyperlattice, any convex subhyperlattice can be uniquely written as the intersection of a hyperideal and a hyperfilter.
On the lattice (CS(L)∪{∅},⊆)
The authors in [11], have established that (CS(L)∪{∅},⊆) is a lattice. In this section, we explore various properties of the lattice (CS(L)∪{∅},⊆) in detail. We derive the expression for the convex subhyperlattice generated by a non-empty subset of a join hyperlattice, and characterize the compact elements of (CS(L)∪{∅},⊆). Using these results, we show that the lattice (CS(L)∪{∅},⊆) is algebraic.
Definition 2.1. For a non-empty subset A of a join hyperlattice L, the convex subhyperlattice generated by A is denoted by ⟨A⟩ and is defined as the intersection of all convex subhyperlattices containing A.
For a non-empty subset A of a P-hyperlattice L, the convex subhyperlattice generated by A is given by ⟨A⟩=⟨A]∩[A⟩, where ⟨A] denotes the hyperideal generated by A and [A⟩ denotes the hyperfilter generated by A.
If A={a}, we write ⟨a⟩ instead of ⟨{a}⟩.
Remark 2.2. For non-empty subsets H1 and H2 of a P-hyperlattice L,
i. We observe that ⟨H1]∩[H1⟩ is the smallest convex subhyperlattice containing H1. Indeed, ⟨H1]∩[H1⟩ is itself a convex subhyperlattice containing H1. If G1 is any convex subhyperlattice containing H1, then ⟨H1]⊆⟨G1] and [H1⟩⊆[G1⟩. Hence, ⟨H1]∩[H1⟩⊆⟨G1]∩[G1⟩=G1.
ii. H1 is a convex subhyperlattice if and only if ⟨H1⟩=H1.
iii. If H1⊆H2, then ⟨H1⟩⊆⟨H2⟩.
Remark 2.3. Let (L,∨,∧) be any join hyperlattice and a∈L. Then {a} is a convex subhyperlattice if and only if a∨a={a}.
Proposition 2.4. For any L, (CS(L)∪{∅},⊆) forms a complete lattice where for X,Y∈CS(L),
X∧Y=X∩Y
X∨Y=⟨X∪Y⟩
Proof. This follows from the fact that the intersection of any collection of convex subhyperlattices of L is either empty or a convex subhyperlattice.
Lemma 2.5. Let (L,∨,∧) be a strong join hyperlattice. If {Xα} is a chain in (CS(L)∪{∅},⊆), then X=⋃αXα is a convex subhyperlattice of L.
Proof. Let x,y∈X and a∈L such that x⪯a⪯y. Since {Xα} is a chain, we get x,y∈Xβ for some β. By the convexity of Xβ we then have a∈Xβ⊆X. Hence X is a convex set. Next, let a,b∈X. Then a,b∈Xα for some α. Now, Xα is a subhyperlattice implies that a∧b∈Xα⊆X and a∨b⊆Xα⊆X. Therefore X is a subhyperlattice.
Proposition 2.6. For a non-empty subset A of L,
⟨A⟩=⋃{⟨F⟩∣F⊆A,F is finite}.
Proof. The proof is by transfinite induction on ∣A∣. If A is finite, then the result holds trivially. Now, suppose that A is infinite and the result holds for all sets of cardinality smaller than ∣A∣. We well-order the set A in the order type of its cardinal. Then for each a∈A, the initial segment S(a)={x∈A∣x<a} determined by a has cardinality strictly less than ∣A∣. Furthermore, as A is infinite, its cardinal is a limit ordinal and hence it follows that
A=a∈A⋃S(a)(1)
Let C={⟨S(a)⟩∣a∈A}. Let a,b∈A. Since A is a chain with respect to ≤, we get a≤b or b≤a. Without loss of generality, assume that a≤b. Then S(a)⊆S(b) and hence, ⟨S(a)⟩⊆⟨S(b)⟩. This shows that C is a chain with respect to ⊆. Let C=⋃C=⋃a∈A⟨S(a)⟩. Then by Lemma 2.5, C is a convex subhyperlattice. Now, for every a∈A, since S(a)⊆⟨S(a)⟩⊆C, it follows from equation (1) that A⊆C. Hence ⟨A⟩⊆⟨C⟩=C because C∈CS(L). Also for any a∈A, since S(a)⊆A, we get ⟨S(a)⟩⊆⟨A⟩ which implies C⊆⟨A⟩. Thus we get ⟨A⟩=C. By induction hypothesis, for each a∈A, we have
⟨S(a)⟩=⋃{⟨F⟩∣F⊆S(a),F is finite}
Thus, ⟨A⟩=⋃a∈A⟨S(a)⟩=⋃{⟨F⟩∣F⊆A,F is finite}, as any finite subset F of A is contained in S(a) for some a∈A.
□
Definition 2.7 ([6]). An element p of a lattice L is compact if whenever p≤⋁S for a subset S of L, then p≤⋁F for a finite subset F of S.
Definition 2.8 ([7]). A complete lattice L is said to be algebraic (compactly generated) if every element of L is a join of some compact elements of L.
Lemma 2.9. Let S={x1,x2,…,xn} be a non-empty finite subset of L. Then
⟨S⟩=i=1⋁n⟨xi⟩.
Proof. We know that xi∈⟨xi⟩ for each i, 1≤i≤n. This gives S⊆⋃i=1n⟨xi⟩ and hence ⟨S⟩⊆⟨⋃i=1n⟨xi⟩⟩=⋁i=1n⟨xi⟩. Since xi∈S, we have ⟨xi⟩⊆⟨S⟩ for each i. This implies ⋃i=1n⟨xi⟩⊆⟨S⟩. Thus ⋁i=1n⟨xi⟩=⟨⋃i=1n⟨xi⟩⟩⊆⟨S⟩. Hence
⟨S⟩=i=1⋁n⟨xi⟩.
□
Proposition 2.10. For any (L,∨,∧), the complete lattice (CS(L)∪{∅},⊆) is algebraic. The set of all compact elements of this lattice is
{⟨F⟩∣F is a finite subset of L}
Proof. Let F={f1,f2,…,fn} be a finite subset of L, for some n∈N. We show that ⟨F⟩ is compact in (CS(L)∪{∅},⊆). Suppose ⟨F⟩⊆⋁α∈IXα=⟨⋃α∈IXα⟩ for some sub collection {Xα∣α∈I} in CS(L). By Proposition 2.6, we have
⟨α∈I⋃Xα⟩=⋃{⟨S⟩∣S is finite subset of α∈I⋃Xα}.
Since fi∈F⊆⟨F⟩ for each i, there exists a finite subset Si of ⋃α∈IXα such that fi∈⟨Si⟩. Each Si is a finite subset of ⋃α∈IXα. So, there exists a finite subset Ii⊆I such that Si⊆⋃α∈IiXα. Put ΛF=⋃j=1nIj. Then ΛF is a finite subset of I. We have fj∈⟨Sj⟩, which implies
F⊆j=1⋃n⟨Sj⟩⊆⟨j=1⋃nSj⟩
⊆⟨j=1⋃nα∈Ij⋃Xα⟩=⟨α∈ΛF⋃Xα⟩.
Hence, ⟨F⟩⊆⟨⋃α∈ΛFXα⟩=⋁α∈ΛFXα. Therefore, we get ⟨F⟩ is a compact element in (CS(L)∪{∅},⊆). Now, let X∈CS(L) be any compact element. Clearly, X⊆⋃x∈X⟨x⟩⊆⟨⋃x∈X⟨x⟩⟩=⋁x∈X⟨x⟩. Since X is compact, there exist finitely many elements x1,x2,…,xn∈X such that
X⊆i=1⋁n⟨xi⟩.(2)
Let F={x1,x2,…,xn}. By Lemma 2.9, ⟨F⟩=⋁i=1n⟨xi⟩. From equation (2), we get X⊆⟨F⟩. Since F⊆X, we have ⟨F⟩⊆⟨X⟩=X. Hence X=⟨F⟩ where F is a finite subset of L. Thus the set of all compact elements of the complete lattice (CS(L)∪{∅},⊆) is {⟨F⟩∣F finite subset of L}
Finally, we show that (CS(L)∪{∅},⊆) is algebraic. Let X∈CS(L). By Proposition 2.6, we have
X=⋃{⟨F⟩∣F⊆X,F is finite}
Then,
⋁{⟨F⟩∣F⊆X,F is finite}=⟨⋃{⟨F⟩∣F⊆X,F is finite}⟩=⟨X⟩=X(because X is convex subhyperlattice)
This shows that X is a join of some compact elements in (CS(L)∪{∅},⊆). □
Example 2.11. Consider the lattice L={0,a,b,c,d,e,f,h,1} shown in Figure 1. The P-hyperlattice obtained by taking P={0,c} is given in Figure 2. In the diagrammatic representation, the meet of two elements is the lattice element occurring in the same position as their meet in the lattice. The hyperoperation join of two elements is the set occurring in the same position as their join in the lattice. For instance, 0∨0={0,c}, a∨e={1}, c∨f={f}.
In this section, we investigate the set CS(L) with respect to two new orders, ≤b and ⊑. We determine classes of hyperlattices where the two orders are equivalent and give examples to show that they do not coincide in general. We explore the relationship between CS(L) and I(L)×F(L) in P-hyperlattices.
Proposition 3.1. Let ≤b be a relation defined on CS(L) as follows: for C1,C2∈CS(L), C1≤bC2 if and only if for every a∈C1, there exists b∈C2 such that a⪯b and for every b∈C2 there exists a∈C1 such that a⪯b. Then (CS(L),≤b) forms a poset.
Figure 3. Lattice (CS(L)∪{∅},⊆) for the hyperlattice considered in Example 2.11
Proof. Clearly ≤b is reflexive and transitive. Now suppose C1≤bC2 and C2≤bC1. Let a∈C1. Then there exists b∈C2 such that a⪯b. Since C2≤bC1, there exists b′∈C2 such that b′⪯a. Hence b′⪯a⪯b where b,b′∈C2. By the convexity of C2, it follows that a∈C2. Thus C1⊆C2. A similar argument gives C2⊆C1, and hence C1=C2. Therefore ≤b is anti-symmetric. Hence, (CS(L),≤b) is a poset.
Proposition 3.2. Let L be a P-hyperlattice. The relation ⊑ defined on CS(L) by: for C1,C2∈CS(L), C1⊑C2 if and only if ⟨C1]⊆⟨C2] and [C1⟩⊇[C2⟩, is a partial order on CS(L).
Proof. By definition, ⊑ is reflexive and transitive. Now suppose C1⊑C2 and C2⊑C1. Then ⟨C1]⊆⟨C2], [C1⟩⊇[C2⟩ and ⟨C2]⊆⟨C1], [C2⟩⊇[C1⟩. Thus ⟨C1]=⟨C2] and [C1⟩=[C2⟩. Since L is a P-hyperlattice, using Theorem 1.15, we get C1=⟨C1]∩[C1⟩ and C2=⟨C2]∩[C2⟩ from which it follows that C1=C2. Therefore ⊑ is anti-symmetric.
Proposition 3.3. Let A,B∈CS(L). If A≤bB then A⊑B.
Proof. Let A,B∈CS(L). Suppose A≤bB. Let x∈A. Then, there exists z∈B such that x⪯z. Since z∈B⊆⟨B], and x⪯z, we get x∈⟨B]. Therefore, A⊆⟨B] which implies, ⟨A]⊆⟨B]. Now, let x∈B. Then, there exists y∈A such that y⪯x. Since y∈A⊆[A⟩ and y⪯x, we get that x∈[A⟩. Hence B⊆[A⟩ which implies [B⟩⊆[A⟩. Thus, A⊑B.
As illustrated in Example 3.4, the relation ⊑ is not a partial order on an arbitrary strong join hyperlattice. In addition, Example 3.4 provides a counterexample to the equivalence of ≤b and ⊑.
Example 3.4. Consider the hyperlattice (L,∨,∧) where ∨ and ∧ are given in Table 1. The hyperideals, type-III hyperfilters and convex subhyperlattices are listed in Table 2. The poset (CS(L),≤b) is given in Figure 4. The relation ⊑ is not a partial order on CS(L) because the sets {x1} and {x1,x2,1} violate antisymmetry. Further, {x1,x2,1}⊑{x1}, we have {x1,x2,1}≰b{x1} demonstrating that ⊑ does not imply ≤b.
∨
0
x1
x2
1
0
{0}
{x1,x2,1}
{x2,1}
{1}
x1
{x1,x2,1}
{x1}
{x2,1}
{1}
x2
{x2,1}
{x2,1}
{x2}
{1}
1
{1}
{1}
{1}
{1}
∧
0
x1
x2
1
0
0
0
0
0
x1
0
x1
x1
x1
x2
0
x1
x2
x2
1
0
x1
x2
1
Table 1. ∨ and ∧ on L considered in Example 3.4
Hyperideals
Type-III Hyperfilters
Convex subhyperlattices
I1={0}
F1={1}
C1={0}C6={x1,x2,1}
I2={0,x1,x2,1}
F2={x2,1}
C2={x1}C7={0,x1,x2,1}
I4=L
F3={x1,x2,1}
C3={x2}
F={0,x1,x2,1}
C4={1}
C5={x2,1}
Table 2. Hyperideals, Type-III Hyperfilters and Convex subhyperlattices of (L,∨,∧) considered in Example 3.4
Figure 4. Poset (CS(L),≤b) for the hyperlattice considered in Example 3.4
Proposition 3.5[11]. Let H⊆L be non-empty, where L is a P-hyperlattice. Then
i⟨H]={x∈L:x⪯y for some y∈h1∨Ph2∨P…∨Phn,hi∈H,n∈N,1≤i≤n}.
ii[H⟩={x∈L:h1∧h2∧⋯∧hn⪯x,hi∈H,n∈N,1≤i≤n}.
The following proposition shows that orders ≤b and ⊑ are equivalent in a P-hyperlattice.
Proposition 3.6.Let L be a P-hyperlattice. Then the orders ≤b and ⊑ are equivalent.
Proof. Assume that A⊑B where A,B∈CS(L). Let x∈A. Then since ⟨A]⊆⟨B], we get x∈⟨B]. This implies x⪯y for some y∈h1∨Ph2∨P…∨Phn where hi∈B (1≤i≤n) and n∈N. Since B is a subhyperlattice, we get y∈B. For the verification of the second condition, let z∈B. Then since B⊆[B⟩⊆[A⟩, we have g1∧g2∧⋯∧gk⪯z where gi∈A (1≤i≤k) and k∈N. Now the fact that A is a subhyperlattice gives that w=g1∧g2∧⋯∧gk∈A. Thus, we have a w∈A such that w⪯z. Therefore, A≤bB. Hence, the orders ≤b and ⊑ are equivalent by Proposition 3.3.
Example 3.7. Let L={a,b,c,d,e}. The hyperoperation ∨ and classical operation ∧ are given in Table 3. Then (L,∨,∧) forms a join hyperlattice but it is not a strong hyperlattice. In this hyperlattice, the orders ≤b and ⊑ on CS(L) are not equivalent. Here, (CS(L),≤b) is a poset (infact a lattice) which is shown in Figure 5. But ⊑ is not a partial order on CS(L). If we take A={b} and B={a,b}, then we get A⊑B and B⊑A. But A=B.
∨
a
b
c
d
e
a
{a}
{a,b}
{a,c}
{a,d}
{a,e}
b
{a,b}
{b}
{b,c,e}
{b,d,e}
{b,e}
c
{a,c}
{b,c,e}
{c}
{c,d}
{c,e}
d
{a,d}
{b,d,e}
{c,d}
{d}
{d,e}
e
{a,e}
{b,e}
{c,e}
{d,e}
{e}
∧
a
b
c
d
e
a
a
a
a
a
a
b
a
b
a
a
b
c
a
a
c
c
c
d
a
a
c
d
d
e
a
b
c
d
e
Table 3. ∨ and ∧ on L considered in Example 3.7
Remark 3.8.Let L be a P-hyperlattice. Then,
i for a non-empty subset A of L, we have D⟨A⟩=⟨A] and h⟨A⟩=[A⟩.
ii for two non-empty subsets A and B of L, suppose that for every a∈A, there is a b∈B such that a⪯b and for every b∈B, there is a a∈A such that a⪯b. Then A⊆⟨B] and B⊆[A⟩. Then by Proposition 3.6, we get ⟨A⟩≤b⟨B⟩.
Figure 5. Lattice (CS(L),≤b) for the hyperlattice considered in Example 3.7
iii for a,b∈L such that a⪯b, we have ⟨a⟩≤b⟨b⟩.
iv The map f:L→(CS(L),≤b) defined by f(a)=⟨a⟩ is order preserving.
Proposition 3.9. Let L be a P-hyperlattice. Then the poset (CS(L),⊑) forms a lattice with the following meet and join operations: For C1,C2∈CS(L),
C1∧C2=(⟨C1]∧⟨C2])∩([C1⟩∧[C2⟩)
C1∨C2=(⟨C1]∨⟨C2])∩([C1⟩∨[C2⟩)
where ⟨C1]∧⟨C2]=⟨C1]∩⟨C2], ⟨C1]∨⟨C2]=⟨⟨C1]∪⟨C2]⟩ are the meet and join operations in I(L), and [C1⟩∧[C2⟩=[C1⟩∪[C2⟩, [C1⟩∨[C2⟩=[C1⟩∩[C2⟩ are the meet and join operations in F(L).
Proof. Let M=(⟨C1]∧⟨C2])∩([C1⟩∧[C2⟩) and N=(⟨C1]∨⟨C2])∩([C1⟩∨[C2⟩). First we show that M and N are non-empty. Choose x∈C1 and y∈C2. Then x∧y∈⟨C1],⟨C2]. Also, x∈C1⊆[C1⟩⊆⟨[C1⟩∪[C2⟩. Similarly, y∈⟨[C1⟩∪[C2⟩. By the definition of hyperfilter, we get that x∧y∈⟨[C1⟩∪[C2⟩. Thus M is non-empty. To show N is non-empty, let a∈C1⊆[C1⟩ and b∈C2⊆[C2⟩. This implies a∨b⊆[C1⟩∩[C2⟩ by the definition of hyperfilter. We also have a,b∈⟨C1]∪⟨C2]⊆⟨⟨C1]∪⟨C2]⟩. Since $\langle\langle C_1]\cup\langle C_2]\rangle is a hyperideal, we get a∨Pb⊆⟨C1⟩∪⟨C2⟩. This implies that a∨b⊆N, and hence, N is non-empty. Thus by Theorem 1.14, it follows that M and N are convex subhyperlattices. Since L is a P-hyperlattice, M attains a unique representation in terms of ⟨M⟩ and [M⟩. By the uniqueness, we get that ⟨M⟩=⟨C1⟩∩⟨C2⟩ and [M⟩=[C1⟩∪[C2⟩. By a similar argument, we can show that ⟨N⟩=⟨C1⟩∪⟨C2⟩ and [N⟩=[C1⟩∩[C2⟩. Using these facts, we conclude that M and N are greatest lower bound and least upper bound of {C1,C2} respectively, in (CS(L),⊑).
Corollary 3.10.(CS(L),≤b) is a lattice for a P-hyperlattice L.
Proof. Follows by Proposition 3.6 and Proposition 3.9.
The following example shows that (CS(L),≤b) need not be a lattice for an arbitrary join hyperlattice.
Example 3.11. For L={a1,b1,c1}, let the operation ∧ and hyperoperation ∨ be as given in Table 4. Then the poset (CS(L),≤b) is given in Figure 6. Here (CS(L),≤b) is not a lattice.
Figure 6. Poset (CS(L),≤b) for the hyperlattice considered in Example 3.11
Definition 3.12. Let X be a non-empty subset of L.
i The initial segment of X with respect to ⪯ is defined by
↓⪯(X)={y∈L∣y⪯x for some x∈X}
If X={x}, we use the symbol ↓⪯(x) in place of ↓⪯({x}). ii The final segment of X with respect to ⪯ is defined by
↑⪯(X)={y∈L∣x⪯y for some x∈X}
If X={x}, we use the symbol ↑⪯(x) in place of ↑⪯({x}).
Note that X⊆↓⪯(X)⊆⟨X] and X⊆↑⪯(X)⊆[X⟩ for any non-empty subset X of L.
Example 3.13. Consider the hyperlattice shown in Figure 7. Suppose X={e,f}. Then we get ↓⪯(X)={0,a,b,c,e,f}, ↑⪯(X)={e,f,1}, [X⟩={c,e,f,1} and ⟨X]=L. This shows that ↓⪯(X)⊂⟨X] and ↑⪯(X)⊂[X⟩. The initial segment of X is shown by dotted lines and the final segment of X is shown by dashed lines in Figure 7.
Proposition 3.14 gives a characterization of those non-empty subsets of a P-hyperlattice that are convex subhyperlattices.
Proposition 3.14. A non-empty set C of a P-hyperlattice L is a convex subhyperlattice if and only if ↓⪯(C)=⟨C], ↑⪯(C)=[C⟩ and C is a convex set.
Proof. Let ∅=C⊆L be a convex subhyperlattice. Clearly, C is a convex set. Already, ↓⪯(C)⊆⟨C]. Let a∈⟨C]. Then a⪯y for some y∈h1∨h2∨…∨hn where hi∈C, n∈N and 1≤i≤n. Note that h1∨h2∨…∨hn⊆C since C is a subhyperlattice. Thus we have a⪯y where y∈C. This implies a∈↓⪯(C) and hence ⟨C]=↓⪯(C). Now, let b∈[C⟩. Then g1∧g2∧⋯∧gs⪯b for some gi∈C, s∈N. Since C is a subhyperlattice, g1∧g2∧⋯∧gs∈C, so we get b∈↑⪯(C). This shows that [C⟩⊆↑⪯(C) and hence, [C⟩=↑⪯(C). Conversely, assume that ↓⪯(C)=⟨C], ↑⪯(C)=[C⟩ and C is a convex set. To show C is a convex subhyperlattice, it remains to show that C is a subhyperlattice. Clearly C⊆⟨C]∩[C⟩. Let b∈⟨C]∩[C⟩=↓⪯(C)∩↑⪯(C). Then x⪯b⪯y for some x,y∈C. Since C is convex, we get b∈C. Thus C=⟨C]∩[C⟩ which implies C is a subhyperlattice.
Remark 3.15. The convexity of C is necessary in the converse part of Proposition 3.14. In the P-hyperlattice shown in Figure 7, consider the subhyperlattice C={0,c,f}. Then ↑⪯(C)=L=[C⟩ and ↓⪯(C)={0,b,c,f}=⟨C]. Note that C is not a convex set.
Proposition 3.16. ([15]) Let (L,∨,∧) be a strong join hyperlattice. For every a,b∈L, there exist a1,a2∈a∨b such that a⪯a1 and b⪯a2.
Proposition 3.17. Let X and Y be two non-empty subsets of (L,∨,∧), and A=X∧Y={x∧y∣x∈X,y∈Y}, B=X∨Y=⋃a∈X,b∈Ya∨b, then
i⟨A]⊆⟨X]∩⟨Y] and [B⟩⊆[X⟩∩[Y⟩,
ii[A⟩=[X⟩∪[Y⟩ and ⟨B]=⟨X]∪⟨Y],
Proof.i Let p∈A. Then p=x∧y for some x∈X,y∈Y. Since x∧y⪯x,y, we get p∈⟨X]∩⟨Y]. This gives A⊆⟨X]∩⟨Y], which implies ⟨A]⊆⟨X]∩⟨Y]. Now suppose q∈B. Then q∈a∨b for some $a\in X,b\in Y. Note that a∈X⊆[X⟩ and b∈Y⊆[Y⟩. By the definition of type-III hyperfilter, we get a∨b⊆[Y⟩ (because a∈L, b∈[Y⟩). Similarly, we get a∨b⊆[X⟩. This gives q∈[X⟩∩[Y⟩. Thus B⊆[X⟩∩[Y⟩, and so, [B⟩⊆[X⟩∩[Y⟩.
ii We first show that A⊆[X⟩∪[Y⟩. Let a∈A. Then a=x∧y for some x∈X and y∈Y. Note that x,y∈[X⟩∪[Y⟩⊆⟨[X⟩∪[Y⟩. So we get a∈⟨[X⟩∪[Y⟩. Thus A⊆⟨[X⟩∪[Y⟩, which implies [A⟩⊆⟨[X⟩∪[Y⟩.
To show ⟨[X⟩∪[Y⟩⊆[A⟩, it is enough to show that X,Y⊆[A⟩. Let x∈X. Then, if y∈Y is arbitrary, a=x∧y∈A⊆[A⟩ and since x∧y⪯x, we get x∈[A⟩. This implies X⊆[A⟩ which shows that [X⟩⊆[A⟩. By a similar argument, we get that [Y⟩⊆[A⟩. Therefore [A⟩=[X⟩∪[Y⟩.
For the second part, let b∈B. Then b∈s∨t for some s∈X and t∈Y. Note that s,t∈⟨X]∪⟨Y]⊆⟨[X⟩∪[Y⟩. Then by the definition of hyperideal, we get b∈s∨t⊆⟨[X⟩∪[Y⟩. Thus, we get ⟨B]⊆⟨[X⟩∪[Y⟩.
Now to show the reverse inclusion, we show that X,Y⊆⟨B]. Let x∈X. Then for any y∈Y, we have x∨y⊆B⊆⟨B]. By Proposition 3.16, there exists u∈x∨y such that x⪯u. Now, u∈⟨B] and x⪯u implies that x∈⟨B]. Thus X⊆⟨B]. By a similar argument, we get Y⊆⟨B]. Hence, ⟨X]∪⟨Y]⊆⟨B], which implies ⟨X]∪⟨Y]⊆⟨B]. Therefore, ⟨B]=⟨X]∪⟨Y].
Proposition 3.18. Let X and Y be subhyperlattices of a P-hyperlattice (L,∨P,∧), and A=X∧Y={x∧y∣x∈X,y∈Y}, B=X∨PY=⋃a∈X,b∈Ya∨Pb. Then ⟨A]=⟨X]∩⟨Y] and [B⟩=[X⟩∩[Y⟩.
Proof. From Proposition 3.17, we have ⟨A]⊆⟨X]∩⟨Y] and [B⟩⊆[X⟩∩[Y⟩. Let p∈⟨X]∩⟨Y]. Then p⪯s for some s∈h1∨Ph2∨P⋯∨Phn where hi∈X(1≤i≤n) and n∈N, and p⪯t for some t∈g1∨Pg2∨P⋯∨Pgm where gj∈Y, m∈N and 1≤j≤m. Since X and Y are subhyperlattices, we get s∈X and t∈Y. We have p⪯s∧t where s∧t∈A⊆⟨A]. This implies p∈⟨A]. Thus ⟨X]∩⟨Y]⊆⟨A].
Let b∈[X⟩∩[Y⟩. Then s=g1∧g2∧⋯∧gk⪯b for some gi∈X and k∈N where 1≤i≤k and t=f1∧f2∧⋯∧fl⪯b for some fj∈Y and l∈N where 1≤j≤l. Since X and Y are subhyperlattices, we get s∈X and t∈Y. Hence, we have s∨Pt⊆B⊆[B⟩. Let k1∈b∨Pb. Then k1=b∨Pb∨Pp1 for some p1∈P. Note that s∨Pt∨Pp1⪯b∨Pb∨Pp1 where k2=s∨Pt∨Pp1∈s∨Pt. Thus for any k∈b∨Pb, there exists l∈s∨Pt such that l⪯k. In particular, for b∈b∨Pb, there exists w∈s∨Pt such that w⪯b. We have w∈s∨Pt⊆[B⟩ and w⪯b. This gives b∈[B⟩. Hence [B⟩=[X⟩∩[Y⟩.
Remark 3.19. If X and Y are not subhyperlattices in Proposition 3.18, then the equality may not hold. Consider the hyperlattice given in Figure 8. Let X={0,b}, Y={c}. Clearly X and Y are not subhyperlattices. We have A=X∧Y={0} and B=X∨PY={c,1}. Note that ⟨X]={0,a,b}, ⟨Y]={0,a,b,c,1} and ⟨A]={0,a}. Here ⟨A]={0,a}⊂{0,a,b}=⟨X]∩⟨Y].
The expressions for meet and join in (CS(L),≤b) given by Lavanya and Parameshwara Bhatta [10] motivated Bhargava to develop analogous results in trellises [2]. The result below on join hyperlattices is derived from the ideas in these works.
Theorem 3.20. Let X and Y be any two convex subhyperlattices of a P-hyperlattice L, and A=X∧Y={x∧y∣x∈X,y∈Y}, B=X∨Y=⋃a∈X,b∈Ya∨b. Then X∧Y=⟨A⟩ and X∨Y=⟨B⟩ where X∧Y and X∨Y are respectively the meet and join of X and Y in (CS(L),⊑).
Proof. This follows from Proposition 3.9, Proposition 3.17 and Proposition 3.18.
Definition 3.21 ([7]). A subposet Q of a poset P is cover preserving if whenever x≺y in Q for any x,y∈Q, then x≺y in P.
Theorem 3.22. For a P-hyperlattice L, the map f:CS(L)→I(L)×F(L) defined by, for C∈CS(L), f(C)=(⟨C],[C⟩), is an injective homomorphism. Moreover, the sublattice K={(I,D):I∈I(L),D∈F(L),I∩D=∅} of I(L)×F(L) is cover preserving and is isomorphic to (CS(L),⊑).
Proof. The map f is well defined. Also, f is a one-to-one map. Note that for any X1,Y1∈CS(L), by Remark 3.8, we have ⟨X1∧Y1]=⟨X1]∧⟨Y1] and [X1∧Y1⟩=[X1⟩∪[Y1⟩=[X1⟩∧[Y1⟩. Now,
Therefore, f is a meet homomorphism of lattices. Similarly, f is a join homomorphism of lattices. Thus, f is a homomorphism. Clearly, f(CS(L))=K and hence CS(L)≅K. Now, we show that K is cover preserving. Let (I1,D1),(I2,D2)∈K such that (I1,D1)≺(I2,D2) in K. It is enough to show that I1=I2 and D1≺D2 in F(L) or I1≺I2 in I(L) and D1=D2. Suppose I1=I2 and D1=D2. Then I1⊂I2 and D1⊃D2. Let p∈I2∖I1. Take I=I1∨⟨p] and D=D1. Then (I,D)∈K and (I1,D1)<(I,D)<(I2,D2) in K. This is a contradiction to the fact that (I2,D2) covers (I1,D1) in K. Thus I1=I2 or D1=D2. Suppose I1=I2. If D1<D<D2 in F(L) for some D∈F(L), then, (I2,D)∈K and (I1,D1)<(I2,D)<(I2,D2) in K, which is a contradiction. Hence, D1≺D2 in F(L). Similarly, if D1=D2, then I1≺I2 in I(L).
Remark 3.23. The sublattice K of I(L)×F(L) in Theorem 3.22 may not be convex. For example, consider the hyperlattice L given in Example 2.11. We note that ({0,c},{c,f,h,1})≤({0,c},{h,1})≤({0,c,d,e,h},{h,1}) and ({0,c},{h,1})∈I(L)×F(L) but ({0,c},{h,1})∈/K.
Proposition 3.24. For a P-hyperlattice L, I(L) is the principal ideal of (CS(L),⊑) generated by L and F(L) is the principal filter of (CS(L),⊑) generated by L.
Proof. Let X∈CS(L) such that X⊑L. Then [X⟩⊇[L⟩=L. Thus [X⟩=L. This shows that X=⟨X]∩[X⟩=⟨X]∩L=⟨X]∈I(L). Suppose X∈I(L), then X=⟨X]∩L. Being a hyperideal, X is a convex subhyperlattice. By the uniqueness of the representation for X, we get [X⟩=L. Hence we get that X⊆L. By a similar argument, we can show that F(L) is the principal filter generated by L.
Definition 3.25 ([6]). Let pi=qi be identities for i∈I. The class κ of all lattices satisfying the identities pi=qi, for i∈I, is called a equational class of lattices.
Corollary 3.26. Let L be a P-hyperlattice and γ be an equational class of lattices. If I(L) and F(L) lie in γ, then (CS(L),⊑) lies in γ. Conversely, if (CS(L),⊑) lies in γ, then both I(L) and F(L) lie in γ.
Proof. This follows from Theorem 3.22 and Proposition 3.24.
In general, I(L) and F(L) need not be in a same equational class. For instance, in Example 2.11, I(L) is modular, whereas F(L) is non-modular. Secondly, even when I(L) and F(L) are in the same equational class, (CS(L)∪{∅},⊆) may fail to lie in the same class. In the P-hyperlattice shown in Figure 9, I(L), F(L) and (CS(L),⊑) are distributive whereas (CS(L)∪{∅},⊆) is not distributive. Moreover, the result stated in Corollary 3.26 does not hold if we consider (CS(L)∪{∅},⊆) instead of (CS(L),⊑).
Figure 9. P-hyperlattice considered in Example 3.27
Example 3.27. Let L={0,p,q,r,s,1}. The P-hyperlattice with P={0,q} is given in Figure 9.
Let P∗(L) denote the collection of all non-empty subsets of a P-hyperlattice L. For P1,P2∈P∗(L), define P1≤P2 if and only if ⟨P1]⊆⟨P2] and [P1⟩⊇[P2⟩. Then clearly ≤ is reflexive and transitive. Now, define a new relation θ on P∗(L) as follows: For P1,P2∈P∗(L), define P1≡P2(θ) if and only if P1≤P2 and P2≤P1. We note that θ is an equivalence relation on P∗(L). Note that P1≡⟨P1⟩(θ), and P1≡P2(θ) if and only if ⟨P1⟩=⟨P2⟩. Hence the relation ≤ defined on P∗(L)/θ by, for [P1],[P2]∈P∗(L)/θ, [P1]≤[P2] if and only if ⟨P1⟩≤⟨P2⟩ is a partial order on P∗(L)/θ. The map [P1]↦⟨P1⟩ defines an order isomorphism between the two posets (P∗(L)/θ,≤) and (CS(L),⊑). Since (CS(L),⊑) is a lattice, we note that (P∗(L)/θ,≤) is also a lattice. Thus we have the following proposition.
Proposition 3.28. For a P-hyperlattice L,
(CS(L),⊑)≅(P∗(L)/θ,≤)
The notion of convexity is well understood in lattices and extends naturally to some classes of strong hyperlattices, but it fails to exhibit the same structural properties in an arbitrary join hyperlattice. In particular, a convex subhyperlattice need not admit a unique representation in terms of hyperideals and hyperfilters. In addition to this, several results valid in P-hyperlattices and Nakano hyperlattices fail to extend directly. To overcome this, we introduce the concept of strongly convex sets, which refines the existing notion of convexity while preserving its properties. This concept serves as a natural generalization, ensuring that results established for P-hyperlattices remain valid in the broader setting of arbitrary hyperlattices.
Strongly convex sets in L
In this section, we introduce the notion of strongly convex sets in an arbitrary join hyperlattice and study their basic properties. We show that every strongly convex set X admits a unique representation in terms of ⟨X] and [X⟩. This characterization allows us to extend several structural results known for P-hyperlattices to a more general setting.
Definition 4.1. A non-empty set S of L is said to be strongly convex if S=I∩F for some hyperideal I and type-III hyperfilter F.
Remark 4.2. By Theorem 1.14, every strongly convex subset of L is a convex subhyperlattice, but the converse does not hold in general. This is illustrated in Example 3.4, where {x1} is a convex subhyperlattice which is not strongly convex. The example also illustrates that {1} is a convex subhyperlattice which is a strongly convex set. Furthermore, in a P-hyperlattice or a Nakano hyperlattice, every convex subhyperlattice is strongly convex.
We denote the set of all strongly convex sets of L by SC(L).
Proposition 4.3. Let X be a strongly convex set of (L,∨,∧). Then X=⟨X]∩[X⟩.
Proof. Let X=I∩F for some hyperideal I and type-III hyperfilter F. Then, clearly, ⟨X]⊆I and [X⟩⊆F. Let I1 be a hyperideal of L containing X. Suppose that a∈I and let x∈X be arbitrary. Then, a∨x⊆I. Also, x∈F,a∈L implies that a∨x⊆F since F is a type-III hyperfilter. This implies a∨x⊆I∩F=X⊆I1. Note that there exists u∈a∨x such that a⪯u. Thus, u∈I1 and a⪯u implies that a∈I1. Hence, I⊆I1. Now ⟨X] is a hyperideal containing X. By the above argument, we get that I⊆⟨X], and hence I=⟨X]. Now, let F1 be any type-III hyperfilter of L containing X. Let p∈F. Then, for any q∈X, we have p∧q∈F. Also, since q∈I, we get that p∧q∈I. Therefore p∧q∈X⊆F1. Now, p∧q∈F1 and p∧q⪯p implies that p∈F1. This shows that F⊆F1. Therefore F=[X⟩. □
The following theorems are generalizations of Proposition 3.2, Proposition 3.9 and Theorem 3.22 to arbitrary join hyperlattices. Their proofs are omitted, as they follow directly from the arguments used in the corresponding results. In the sequel, let L be such that SC(L)=CS(L).
Theorem 4.4. For a join hyperlatticeL, (SC(L),⊑) is a poset.
Theorem 4.5. The poset (SC(L),⊑) is a lattice with meet and join as given in Proposition 3.9.
Theorem 4.6. For a hyperlattice L, the map f:SC(L)⟶I(L)×F(L) defined by, for C∈SC(L), f(C)=(⟨C],[C⟩), is an injective homomorphism. Moreover, the sublattice K={(I,D):I∈I(L),D∈F(L),I∩D=∅} of I(L)×F(L) is cover preserving and is isomorphic to (SC(L),⊑).
Conclusion
It is well known that the family CS(L)∪{∅}, ordered by inclusion, forms a lattice. In this work, we have extended the study of this structure. First, we have shown that CS(L)∪{∅} is not only a lattice but an algebraic lattice, and we have characterized its compact elements. Then, we have introduced two new orders on CS(L), namely ≤b and ⊑, and have examined their properties. We have proved that for A,B∈CS(L), A≤bB implies A⊑B. However, these two orders are not generally equivalent, though they coincide for P-hyperlattices. We have shown, by example, that in an arbitrary join hyperlattice, the relation ⊑ need not be a partial order. Next, we have characterized convex subhyperlattices of P-hyperlattices using initial and final segments, and have embedded the lattice (CS(L),⊑) into the product lattice I(L)×F(L). We have introduced the notion of strongly convex sets and have shown that every such set is a convex subhyperlattice, but not vice versa. Although many results are given for P-hyperlattices, the key arguments do not rely on the P-hyperlattice condition. Consequently, these results also hold for hyperlattices satisfying SC(L)=CS(L). Finally, we have justified the use of type-III hyperfilters in defining strongly convex sets, since type-III hyperfilters, unlike other types, form subhyperlattices. We have proved that when L is a P-hyperlattice, (CS(L),≤b) is a lattice, and we have given an example of a non-strong hyperlattice where this does not hold. Based on our observations, we have conjectured that (CS(L),≤b) is a lattice for every strong hyperlattice. In conclusion, it is natural to investigate whether the operator SC preserves finite products of hyperlattices and to identify the structural conditions under which such preservation holds. Additionally, examining how homomorphisms and congruence relations on a hyperlattice L carry over to the induced structure on SC(L) offers scope for further research.
Acknowledgement(s)
The first author acknowledges the Department of Science and Technology (DST), Government of India, for the DST INSPIRE Fellowship to carry-out this research work. The first, fourth, and sixth authors acknowledge the Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal for its kind encouragement. The second author acknowledges the Department of Mathematics, Mangalore university, Mangalagangotri for its support. The third and fifth authors thank the Manipal Institute of Technology Bengaluru, Manipal Academy of Higher Education, Manipal for its encouragement and institutional support.
References
References
[1]Reza Ameri, M Amiri-Bideshki, and A Borumand Saeid. Some properties of residual mapping and convexity in Λ-hyperlattices. Ratio Math., 27(1):27–36, 2014.DOI
[2]K Bhargava, S Parameshwara Bhatta, and Chandru Hegde. On strongly-convex subtrellises of a trellis. Acta Math. Univ. Comen., 95(2):79–94, 2026.
[3]K Bhargava and Chandru Hegde. Some properties of strongly-convex subtrellises of a trellis. Palest. J. Math., 14(2), 2025.
[4]M Amiri Bideshki, Reza Ameri, and A Borumand Saeid. On prime hyperfilters (hyperideals) in Λ-hyperlattices. Eur. J. Pure Appl. Math., 11(1):169–188, 2018.
[7]George Grätzer. General lattice theory, volume 52. Birkhäuser, 2012.
[8]M Konstantinidou. On p-hyperlattices and their distributivity. Rend. Circ. Mat. Palermo, 42:391–403, 1993.
[9]M Konstantinidou and J Mittas. An introduction to the theory of hyperlattices. Math. Balkanica, 7:187–193, 1977.
[10]S Lavanya and S Parameshwara Bhatta. A new approach to the lattice of convex sublattices of a lattice. Algebra Universalis, 35(1):63–71, 1996.DOI
[11]N. Aishwarya Nayak, Pallavi Panjarike, Syam Prasad Kuncham, Tapatee Sahoo, and Harikrishnan Panackal. Hyperfilters and convex subhyperlattices in a join hyperlattice. Indian Journal of Pure and Applied Mathematics, 56(3):1036–1047, 2025.
[12]Panjarike Pallavi, Syam Prasad Kuncham, Gopadi Ramachandra Bhatta Vadiraja, and Panackal Harikrishnan. Computation of prime hyperideals in meet hyperlattices. Bull. Comput. Appl. Math., 10(1):33–58, 2022.
[14]S Rasouli and B Davvaz. Lattices derived from hyperlattices. Commun. Algebra., 38(8):2720–2737, 2010.DOI
[15]A Soltani Lashkenari and B Davvaz. Complete join hyperlattices. Indian J. Pure Appl. Math., 46:633–645, 2015.DOI