Hindawi

Journal of Function Spaces

Volume 2022, Article ID 6998104, 10 pages
https://doi.org/10.1155/2022/6998104

Research Article
Set-Theoretic Inequalities Based on Convex Multi-Argument
Approximate Functions via Set Inclusion

Atiqe Ur Rahman ,1 Muhammad Saeed ,1 Khuram Ali Khan ,2

and Rostin Matendo Mabela 3
1
Department of Mathematics, University of Management and Technology, Lahore 54000, Pakistan
2
Department of Mathematics, University of Sargodha, Sargodha 40100, Pakistan
3
Department of Maths and Computer Science, Faculty of Science, University of Kinshasa, Kinshasa,
Democratic Republic of the Congo

Correspondence should be addressed to Rostin Matendo Mabela; rostin.mabela@unikin.ac.cd

Received 7 December 2021; Accepted 31 January 2022; Published 9 March 2022

Academic Editor: Ganesh Ghorai

Copyright © 2022 Atiqe Ur Rahman et al. This is an open access article distributed under the Creative Commons Attribution
License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is
properly cited.
Hypersoft set is a novel area of study which is established as an extension of soft set to handle its limitations. It employs a new
approximate mapping called multi-argument approximate function which considers the Cartesian product of attribute-valued
disjoint sets as its domain and the power set of universe as its co-domain. The domain of this function is broader as compared to
the domain of soft approximate function. It is capable of handling the scenario where sub-attribute-valued sets are considered
more significant than taking merely single set of attributes. In this study, notions of set inclusion, convex (concave) sets, strongly
convex (concave) sets, strictly convex (concave) sets, convex hull, and convex cone are conceptualized for the multi-argument
approximate function. Based on these characterized notions, some set-theoretic inequalities are established with generalized
properties and results. The set-theoretic version of classical Jensen’s type inequalities is also discussed with the help of
proposed notions.

1. Introduction intuitionistic fuzzy set, and neutrosophic set were developed

In order to provide the parameterization tool to fuzzy set-
like models [1–3] for dealing with uncertain data, in 1999,
Molodtsov [4] employed the concept of soft approximate
function (sa-function) for defining a novel model soft set (s-
set). This set employs sa-function which maps single set of
parameters to power set of initial universe. Many scholars
discussed rudiments of s-sets but the contributions of Ali
et al. [5], Babitha and Sunil [6, 7], Ge and Yang [8], Li [9],
Maji et al. [10], Pei and Miao [11], and Sezgin and Atagün
[12] are considered prominent regarding the characteriza-
tion of elementary properties and set-theoretic operations of
s-sets. Abbas et al. [13] investigated the notions of soft points
and discussed their limitations, comparisons, and chal-
lenges. The hybridized structures of s-set with fuzzy set,
by the authors [14–16]. In numerous real-life situations,
parameters are to be further classified into their respective
parametric-valued disjoint sets. The existing s-set model is
deficient for dealing with such sort of partitioning of pa-
rameters. Hypersoft set (hs-set) [17] is developed to gen-
eralize s-set to manage real-life scenarios with subparametric
disjoint sets. In order to utilize hs-set in various areas of
knowledge, Abbas et al. [18] and Saeed et al. [19] investigated
the elementary properties and operations of hs-set. Ajay [20]
defined alpha open hs-sets for their further use in the
characterization of relevant topological spaces. Debnath
[21], Yolcu and Ozturk [22], Yolcu et al. [23], and Kamacı
[24, 25] discussed the applications of hs-set in decision-
making process by using its hybridized models. Martin and
Smarandache [26] developed a novel outlook called
2 Journal of Function Spaces

concentric plithogenic hypergraph based on the combina- (4) The vivid comparison is made with related existing
tion of plithogenic set and hs-set. Musa and Asaad [27] research studies to judge the distinction of the
discussed the bipolarity of hs-set and investigated some of its proposed study.
properties and aggregation operations.
The rest of the paper is organized as follows. Section 2
reviews the notions of some relevant definitions used in the
proposed work. Section 3 presents notions of strictly and
1.1. Motivation. Convexity has a vital function in optimi-
strongly convexity cum concavity on hs-set. It also presents
zation, image processing and classification, pattern recogni-
some set-theoretic inequalities based on these notions.
tion, and other sub-fields of computational geometry. In
Section 4 concludes the paper with more future directions
order to tackle optimization and other related problems for
and scope.
vague and uncertain data, notions of classical convexity and
concavity (Lara et al. [28, 29]) under s-set environment were
characterized initially by Deli [30]; then, this work was further
2. Preliminaries
extended by Ihsan et al. [31, 32], Rahman et al. [33], and Salih This section reviews few elementary definitions and results
and Sabir [34] for further investigations on certain variants of regarding s-set and hs-set. In order to deal with uncer-
convexity. But these notions are not sufficient for handling tainties, the models like Zadeh’s fuzzy set [3], Atanassov’s
information with entitlement of multi-argument approximate intuitionistic fuzzy set [1], and Smarandache’s neutrosophic
function (maa-function); therefore, Rahman et al. [35] con- set [2] are considered significant, but these models face
ceptualized the notions of convexity cum concavity under hs- inadequacy regarding parameterization modes; therefore,
set scenarios. It can be easily observed that the aforemen- Molodtsov [4] presented the concept of s-set as a new
tioned models focused on the consideration of sa-function mathematical model to equip fuzzy set-like models with
and maa-function while defining certain variants of convexity parameterization tool.
cum concavity and ignored certain other important prop-
⌣
erties and aspects of convexity cum concavity which may have Definition 1 (see [4]). Let X � 􏼈x 􏽢1, x􏽢2, . . . , x
􏽢 n 􏼉 be an initial
key role in convex optimization, computational geometry, universe and P � 􏼈p 􏽢1, p
􏽢2, . . . , p
􏽢 n 􏼉 be a set of parameters;
and other related problems. Moreover, various classical in- then, a sa-function is a mapping
equalities like Jensen’s inequalities are not discussed as par- ⌣
ticular cases. The main motive of the proposed study is to FS� : Q ⟶ ΓX , (1)
address the limitations and shortcomings of the above-
mentioned literature. and it is defined as
The major contributions of the paper are outlined as
follows: FS� 􏼈p 􏽢 k 􏼉􏼁 � Γ{􏽢x1 ,􏽢x2 ,...,􏽢xn } ,
􏽢2, . . . , p
􏽢1, p (2)
⌣ ⌣
(1) The classical notions of convex (concave) set, strictly where ΓX denotes the power set of X, Q ⊆ P with k ≤ n. The
convex (concave) set, strongly convex (concave) set, � The
pair (Q, FS� ) is known as s-set and represented by S.
convex hull, and convex cone are generalized under collection of s-sets is denoted by Ωss .
hs-set environment with entitlement of maa- ⌣
function. Example 1. Let X � 􏼈x 􏽢1, x
􏽢2, x 􏽢3, x
􏽢4, x 􏽢 6 􏼉, P � 􏼈p
􏽢5, x 􏽢 1, p
􏽢 2, . . . ,
(2) The concept of set inclusion for maa-function is 􏽢 9 }, and Q � 􏼈p
p 􏽢1, p
􏽢2, p
􏽢3, p
􏽢 4 􏼉; then, approximate elements of
sa-function for s-set S � � (Q, F � ) are given as
characterized and then some set-theoretic inequal- S
ities are established based on these set inclusions 􏽢 1 􏼁 � 􏼈x
FS� p 􏽢3, x
􏽢1, x 􏽢 6 􏼉,
along with other proposed notions. It is verified that
the classical inequalities for soft approximate func- FS� p
􏽢 2 􏼁 � 􏼈x 􏽢3, x
􏽢2, x 􏽢 5 􏼉,
(3)
tion are also valid under hs-set environment with FS� p
􏽢 3 􏼁 � 􏼈x 􏽢5, x
􏽢4, x 􏽢 6 􏼉,
entitlement of maa-function.
FS� p
􏽢 4 􏼁 � 􏼈x 􏽢2, x
􏽢1, x 􏽢 5 􏼉,
(3) Classical Jensen’s convex inequalities are generalized
for maa-function and discussed as particular cases of and s-set S � is stated as � � 􏽮F � (p
S 􏽢 1 ), FS� (p
􏽢 2 ),
S
proposed set-theoretic inequalities. 􏽢 3 ), FS� (p
FS� (p 􏽢 4 )} or

� �􏼈 p
S 􏽢 1 , 􏼈x
􏽢1, x
􏽢3, x 􏽢 2 , 􏼈x
􏽢 6 􏼉 􏼁, p 􏽢2, x
􏽢3, x 􏽢 3 , 􏼈x
􏽢 5 􏼉 􏼁, p 􏽢4, x
􏽢5, x 􏽢 4 , 􏼈x
􏽢 6 􏼉 􏼁, p 􏽢1, x
􏽢2, x
􏽢5􏼉 􏼁 (4)

Many researchers investigated the basic properties, ag- Definition 2 (see [10]). If S � � (Q, F � ) and W
� �
S
gregation operations, and relations of s-set, but the con- (R, FW� ) ∈ Ω ss , then
tributions of authors [6, 11, 15] are more significant in this � 􏽦 �
(1) S ⊆ W if FS� (p 􏽢 ) ⊆ FW 􏽢 ), ∀p
� (p 􏽢 ∈ Q and Q ⊆ R.
regard. Some properties of s-set are stated below for proper
�
(2) S􏽦 �
∪ Q is stated as
understanding.
Journal of Function Spaces 3

⎪
⎧ FS� (p
􏽢 ), 􏽢 ∈ Q∖R.
p Q1 × Q2 × Q3 × · · · × Qn with Qi ∩ Qj � ∅, for i ≠ j, and
⎪
⎪
⎨ ⌣
�􏽦
S � � F � (p
∪Q 􏽢 ), 􏽢 ∈∖Q.
p (5) i, j ∈ {1, 2, 3, . . . , n} ; FH� : Q ⟶ ΓX and θ􏽢 ∈ II° .
⎪
⎪ W
⎪
⎩ F (p Considering Definition 2, Rahman et al. [35] extended
S� 􏽢 ) ∪ FW 􏽢 ),
� (p 􏽢 ∈ Q ∩ R.
p the work of Deli [30] and introduced the following notions
of convexity cum concavity with multi-argument approxi-
�􏽦
(3) S � is defined as
∩W mate settings.
􏽢 ) � FS� (p
F � 􏽥 � (p 􏽢 ) ∩ FW 􏽢 ),
� (p 􏽢 ∈ Q ∩ R.
∀p (6)
S∩ W ⌣ ⌣ ⌣
Definition 4 (see [35]). If δ 􏽦
⊆ X, then the δ − inclusion of a
� is stated as
hs-set H
In many decision-making circumstances, it is observed
⌣
that parameters need to be further partitioned into their ⌣
� δ � 􏼚κ ∈ Q: F � (κ) ⊇ δ 􏼛.
H (10)
respective parametric-valued sets. The s-set and its hybrids H
are not capable to tackle such kind of parametric classifi-
cation. So, Smarandache [17] introduced a new model called
hs-set which is capable to deal with such classification by � on Q is known as convex
Definition 5 (see [35]). A hs-set H
employing a new approximate mapping, i.e., maa-function. hs-set (Δ-set) if

⌣ FH� (􏽢aκ +(1 − a􏽢)τ) ⊇ FH� (κ) ∩ FH� (τ), (11)

Definition 3 (see [17]). Let X � 􏼈x 􏽢1, x􏽢2, . . . , x
􏽢 n 􏼉 be an initial
universe and P � 􏼈p 􏽢1, p
􏽢2, . . . , p
􏽢 n 􏼉 be a set of parameters.
The respective attribute-valued non-overlapping sets of each
element of P are
Q1 � 􏼈q􏽢11 , q􏽢12 , . . . , q􏽢1n 􏼉
Q2 � 􏼈q􏽢21 , q􏽢22 , . . . , q􏽢2n 􏼉
Q3 � 􏼈q􏽢31 , q􏽢32 , . . . , q􏽢3n 􏼉
...
...
...
Qn � 􏼈q􏽢n1 , q􏽢n2 , . . . , q􏽢nn 􏼉,
and Q � Q1 × Q2 × Q3 × · · · × Qn � 􏼈q􏽢1 , q􏽢2 , q􏽢3 , . . . , q􏽢r 􏼉 where
every q􏽢i (i � 1, 2, . . . , r) is a n-tuple element of Q with
r � 􏽑ni�1 |Qi |, | · | denotes the cardinality of Qi then a maa-
function is a mapping
⌣ Definition 7. The hs-set (FH� , Q) on Q is called a strongly
FH� : V ⟶ ΓX ,
∀κ, τ ∈ Q and a􏽢 ∈ II· . Its collection is represented as HΔ .
� on Q is known as concave
Definition 6 (see [35]). A hs-set H
hs-set (Ψ-set) if
FH� (􏽢aκ +(1 − a􏽢)τ) ⊆ FH� (κ) ∪ FH� (τ), (12)
∀κ, τ ∈ Q and a􏽢 ∈ II· .
(7) Salih and Sabir [34] discussed the properties of strongly
and strictly convexity cum concavity by using approximate
function of s-set, but in case of multi-argument approximate
function, their presented work is not sufficient; therefore, the
following generalized definitions are characterized with the
entitlement of multi-argument approximate function FH�
which considers Q (a Cartesian product of attribute-valued
disjoint sets) as its domain and maps it to power set of initial
universe.
(8) convex hs-set (Ωschss ) if

and it is defined as FH� 􏼐θ􏽢 􏽢 q 􏼑IF � q􏽢 􏼁 ∩ F � q􏽢 􏼁,

􏽢q +(1 − θ)􏽢 (13)
1 2 H 1 H 2

FH� 􏼈q􏽢1 , q􏽢2 , . . . , q􏽢k 􏼉􏼁 � Γ{􏽢x1 ,􏽢x2 ,...,􏽢xn } , (9) for every q􏽢1 , q􏽢2 ∈ Q, q􏽢1 ≠ q􏽢2 and θ􏽢 ∈ II° .
⌣ ⌣
where ΓX denotes the power set of X, V ⊆ Q with k ≤ r. The Definition 8. The hs-set (FH� , Q) on Q is called a strongly
� The
pair (V, FH� ) is known as hs-set and represented by H. concave hs-set (Ωschss ) if
collection of all hs-sets is symbolized as [hss . 􏽢 q 􏼑⊂F � q􏽢 􏼁 ∪ F � q􏽢 􏼁,
􏽢q +(1 − θ)􏽢
FH� 􏼐θ􏽢 1 2 H 1 H 2 (14)
See [18, 19] for more operational properties of hs-sets.
for every q􏽢1 , q􏽢2 ∈ Q, q􏽢1 ≠ q􏽢2 and θ􏽢 ∈ II° .
3. Notions of Convexity cum Concavity for maa-
Function with Relevant Set- Definition 9. The hs-set (FH� , Q) on Q is called a strictly
Theoretic Inequalities convex hs-set (Θschss ) if
FH� 􏼐θ􏽢 􏽢 q 􏼑IF � q􏽢 􏼁 ∩ F � q􏽢 􏼁,
􏽢q +(1 − θ)􏽢 (15)
In this section, we define Δ-sets and Ψ-sets and prove some 1 2 H 1 H 2
⌣
results. Throughout the remaining paper, Q, II· , II° , and X for every q􏽢1 , q􏽢2 ∈ Q, FH� (􏽢q1 ) ≠ FH� (􏽢q2 ) and θ􏽢 ∈ II° .
will play the role of Rn , closed unit interval, open unit in-
⌣ ⌣
terval, and universal set, respectively. Let q􏽢1 � (a1 , a2 , Definition 10. The hs-set (FH� , Q) on Q is called a strictly
⌣ ⌣ ⌣ ⌣ ⌣ ⌣
a3 , . . . , an ), q􏽢2 � (b 1 , b 2 , b 3 , . . . , b n ) ∈ Q, q􏽢1 ≠ q􏽢2 where Q � concave hs-set (Θschss ) if
4 Journal of Function Spaces

FH� 􏼐θ􏽢 􏽢 q 􏼑⊂F � q􏽢 􏼁 ∪ F � q􏽢 􏼁,

􏽢q +(1 − θ)􏽢 (16) Q1 � 􏼈11 years, 12 years, 13 years, 14 years, 15 years􏼉,
1 2 H 1 H 2
Q2 � {16, 17, 18, 19, 20},
for every q􏽢1 , q􏽢2 ∈ Q, FH� (􏽢q1 ) ≠ FH� (􏽢q2 ) and θ􏽢 ∈ II° .
Q3 � 􏼈excellent(5), very good(4), good(3), average(2), bad(1)􏼉.
Note. (i) If we replace ⊇ , ⊆ , I, ⊂, ∩ , and ∪ by (18)
≥, ≤ , > , < , ∧, and ∨, respectively, in above equations, i.e.,
For simplicity, we write
from (11) to (16), we get the same notions for fuzzy sets as
described by Zadeh [3] and Chaudhuri [36] where ∧ and ∨ Q1 � {11, 12, 13, 14, 15},
are min and max operators. (ii) Similarly, if we replace Q
Q2 � {16, 17, 18, 19, 20}, (19)
(Cartesian product of attribute-valued sets) by P (a set of
attributes) in FH� , we get simple approximate function FS� of Q3 � {5, 4, 3, 2, 1}.
s-set as given in Definition 1 and consequently the above
definitions will be treated for s-set as discussed in [30, 34]. The hs-set⌣(FH� , Q) is a function defined by the mapping
FH� : Q ⟶ ΓX where Q � Q1 × Q2 × Q3 .
Example 2. Suppose an educational institution wants to Since the Cartesian product of Q1 × Q2 × Q3 is a
recruit some teachers with the help of some defined indi- 3-tuple, we consider q􏽢1 � (12, 16, 3); then, the function
⌣ ⌣
cators. Consider there are 10 candidates who applied for the becomes FH� (􏽢q1 ) � FH� (12, 16, 3) � 􏽮 c 1 , c 5 􏽯. Also, consider
job and thus form a universe of discourse q􏽢2 � (13, 17, 4); then, the function becomes FH� (􏽢q2 ) �
⌣ ⌣ ⌣ ⌣ ⌣ ⌣ ⌣ ⌣
X � 􏽮 c 1 , c 2 , c 3 , . . . , c 10 􏽯. The candidates will be evaluated FH� (13, 17, 4) � 􏽮 c 1 , c 3 , c 4 􏽯.
with the help of the following attributes: Now,
⌣
a1 � total experience in years, FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁 � FH� ({12, 16, 3}) ∩ FH� ({13, 17, 4})
⌣ ⌣ ⌣ ⌣ ⌣ ⌣ ⌣
(20)
a2 � total number of publications, (17) � 􏽮 c 1 , c 5 􏽯 ∩ 􏽮 c 1 , c 3 , c 4 􏽯 � 􏽮 c 1 􏽯.
⌣
a3 � ability to demonstrate, Let θ􏽢 � 0.6 ∈ II° ; then, we have
and their respective attribute-valued sets are

􏽢q +(1 − θ)􏽢
θ􏽢 􏽢 q � 0.6(12, 16, 3) +(1 − 0.6)(13, 17, 4) � 0.6(12, 16, 3) + 0.4(13, 17, 4)
1 2
(21)
� (7.2, 9.6, 1.8) +(5.2, 6.8, 1.6) � (7.2 + 5.2, 9.6 + 6.8, 1.8 + 1.6) � (12.4, 16.4, 3.4),

FH� 􏼐θ􏽢 􏽢 q 􏼑 � F � (12, 16, 3) � 􏽮⌣c , ⌣c 􏽯,

􏽢q +(1 − θ)􏽢 (22)
1 2 H 1 5
which is again a 3-tuple. By using the decimal round off
property, we get (12, 16, 3). and from equations (20) and (22), we have

􏽢q +(1 − θ)􏽢
FH� 􏼐θ􏽢 􏽢 q 􏼑IF � q􏽢 􏼁 ∩ F � q􏽢 􏼁
1 2 H 1 H 2
⌣ ⌣ ⌣ ⌣ ⌣ ⌣ ⌣ ⌣ ⌣
(23)
FH� q􏽢1 􏼁 ∪ FH� q􏽢2 􏼁 � FH� ({12, 16, 3}) ∪ FH� ({13, 17, 4}) � 􏽮 c 1 , c 5 􏽯 ∪ 􏽮 c 1 , c 3 , c 4 􏽯 � 􏽮 c 1 , c 3 , c 4 , c 5 􏽯,

and from equations (22) and (23), we have If H� is a Δ-set, then H� is called convex cone hs-set
􏽢q +(1 − θ)􏽢
􏽢 q 􏼑⊂F � q􏽢 􏼁 ∪ F � q􏽢 􏼁. (cchs-set). The collection of all cchs-sets is represented by
FH� 􏼐θ􏽢 1 2 H 1 H 2 (24) Ωcchs .

Definition 13. The convex cone C � ∈ [ is the

􏽢 Δ of a hs-set H
Definition 11. The convex hull H � ∈ [ is the
􏽢 Δ of a hs-set H hss
⌣ hss � i.e.,
smallest cchs-set which contains H,
�
smallest Δ-set over X which contains H, i.e.,
􏽢Δ � ∩ 􏽮 L
C �:L � ∈ Ωcchs .
􏽢Δ � ∩ 􏽮K
H � :K� ∈ HΔ . (25)
i
� ⊇H
L � i (27)
i
� ⊇H
� i i
Ki

Definition 12. A hs-set H� ∈ [ is called a cone if for all

hss
κ ∈ Q and a􏽢 > 0, we have 3.1. Set-Theoretic Inequalities for maa-Function. In this
section, some set-theoretic inequalities are presented with
FH� (􏽢aκ) ⊇ FH� (κ). (26) discussion on their generalized results.
Journal of Function Spaces 5

Theorem 1. A hs-set H � is a Δ-set if and only if for all Now, we apply C-1 for τ, κ1 ∈ Q, i.e.,
κ1 , κ2 , . . . , κn ∈ Q and a􏽢1 , a􏽢2 , . . . , a􏽢n ∈ II · such that
FH� a􏽢κ1 +(1 − a􏽢)τ 􏼁 ⊇ FH� κ1 􏼁 ∩ FH� (τ),
􏽐ni�1 a􏽢i � 1, we have
n
n k+1 (32)
⎝􏽘 a􏽢 κ ⎞
⎠ a􏽢i
FH� ⎛ i i ⊇ ∩ FH
� κi 􏼁. (28) ⎝􏽘
FH� a􏽢κ1 +(1 − a􏽢)τ 􏼁 ⊇ FH� κ1 􏼁 ∩ FH� ⎛ κ⎞ ⎠,
i�1
i�1
i�2
1 − a􏽢1 i

which implies
Proof. Let the sufficient condition hold. In particular, for
k+1
any two elements κ1 , κ2 ∈ Q and a􏽢 ∈ II· , then we have FH� (κ) ⊇ ∩ FH� κi 􏼁. (33)
i�1
FH� (􏽢aκ1 + (1 − a􏽢)κ2 ) ⊇ FH� (κ1 ) ∩ FH� (κ2 ) which implies that □
� is a Δ-set according to Definition 5. Conversely, let H
H � be a
Δ-set; then, for any n ∈ N, define a set B(κ, n) such that Remark 1
⎨
⎧ n n ⎬
⎫
B(κ, n) � ⎩ 􏼈κ1 , κ2 , . . . , κn 􏼉⊂Q: ∃􏽢ai ∈ II• ; 􏽘 a􏽢i � 1, κ � 􏽘 a􏽢i κi ⎭ . 1. The result presented in Theorem 1 may or may not be
i�1 i�1 valid for n ⟶ ∞.
(29) (2) If, in case, the result presented in Theorem 1 is valid
for n ⟶ ∞, then this result will be considered as
By using induction on n ∈ N, we prove the necessary generalized version of countably sub-additive sets
condition as follows: under hs-set environment with entitlement of maa-
C-1: let n � 2; then, ∃􏼈κ1 , κ2 􏼉 ∈ B(κ, 2) and a􏽢 ∈ II· such function.
that κ � a􏽢κ1 + (1 − a􏽢)κ2 . As H � is a Δ-set, (3) If only equality holds for countable case, then this
2
FH� (κ) ⊇ FH� (κ1 ) ∩ FH� (κ2 ) � ∩ i�1 FH� (κi ). result will be considered as generalized version of
C-2: let the result (29) be valid for n � k which implies countably additive sets under hs-set environment
that for 􏼈κ1 , κ2 , . . . , κk 􏼉 ∈ B(κ, k) and κ � 􏽐ki�1 a􏽢i κi with with entitlement of maa-function.
􏽐ki�1 a􏽢i � 1, we have
k
FH� (κ) ⊇ ∩ FH� κi 􏼁. (30) Theorem 2. Let (FH� , Q) be Θschss . If there exists
i�1
θ􏽢 ∈ II · , ∀􏽢q1 , q􏽢2 ∈ Q such that FH� (θ􏽢 􏽢q + (1 − θ)􏽢
1
􏽢 q )⊇
2
FH� (􏽢q1 ) ∩ FH� (􏽢q2 ), then (FH� , Q) is a Δ-set.
Now prove the result (29) for n � k + 1 with conditions
􏼈 1 κ2 , . . . , κk+1 􏼉 ∈ B(κ, k + 1) and κ � 􏽐k+1
κ , 􏽢i κi with
i�1 a
k+1 ·
Proof. Assume that FH� (􏽢q1 ) ⊆ FH� (􏽢q2 ) and
􏽐i�1 a􏽢i � 1. Suppose there exists one a􏽢 ∈ II (say a􏽢1 ) such that (∃􏽢q1 , q􏽢2 ∈ Q), θ􏽢1 ∈ II· such that
a􏽢1 ≠ 1. Let τ � a€2 κ2 + a€3 κ3 + · · · + a€k+1 κk+1 where a€ � (􏽢ai / ⌣ ⌣
(1 − a􏽢1 )) ≥ 0 for ik+12 . Therefore, a€2 + a€3 + · · · + a€k+1 � ((􏽢a2 + X\FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 ⊇ X\􏽮FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏽯. (34)
a􏽢3 + · · · + a􏽢k+1 )/1− a􏽢1 ) � ((1 − a􏽢1 )/(1 − a􏽢1 )) � 1.
Hence, 􏼈κ2 , . . . , κk+1 􏼉 ∈ B(τ, k), and equation (30) im- If FH� (􏽢q1 )⊂FH� (􏽢q2 ), then (34) contradicting (FH� , Q) is a
plies that Θschss .
If FH� (􏽢q1 ) � FH� (􏽢q2 ) and θ􏽢1 ∈ [0, θ], 􏽢 let q􏽢3 �
k+1
FH� (κ) ⊇ ∩ FH� κi 􏼁. (31) 􏽢 􏽢 􏽢 􏽢
(θ1 /θ)(􏽢q1 ) + (1 − (θ1 /θ))􏽢q2 and 􏽢 􏽢 − 1)
θ2 � ((1/θ)
i�2
((1/θ􏽢1 ) − 1) . Thus, by hypothesis,
− 1

θ􏽢 θ􏽢 􏽢q􏼡
FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 � FH� 􏼠θ􏽢􏼠 1 q􏽢1 􏼁 + 􏼠1 − 1 􏼡􏽢q2 􏼡 +(1 − θ)􏽢 2
􏽢θ θ􏽢
􏽢q +(1 − θ)􏽢
􏽢q􏼑 (35)
� F � 􏼐θ􏽢
H 3 2

FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 ⊇ FH� q􏽢2 􏼁 ∩ FH� q􏽢3 􏼁.

Now

θ􏽢 θ􏽢
FH� q􏽢3 􏼁 � FH� 􏼠 1 q􏽢1 􏼁 + 􏼠1 − 1 􏼡􏽢q2 􏼡 � FH� 􏼐θ􏽢3 q􏽢1 + 􏼐1 − θ􏽢3 􏼑􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑􏼑. (36)
􏽢θ θ􏽢
6 Journal of Function Spaces

From (14), (15), and FH� (􏽢q1 ) � FH� (􏽢q2 ), it follows that If FH� (􏽢q1 ) � FH� (􏽢q2 ) and θ􏽢1 ∈ [θ,
􏽢 1], let ρ � ((θ􏽢 − θ)/
1
􏽢
􏽢 􏽢 􏽢
1 − θ)􏽢q1 + ((1 − θ1 )/1 − θ)􏽢q2 . Thus, by hypothesis,
FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 ⊇ FH� q􏽢3 􏼁. (37)
FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 � FH� 􏼐θ􏽢
􏽢q + 􏼐1 − θ􏽢 􏼑 ρ􏼑,
1 1
From (34), (36), FH� (􏽢q1 ) � FH� (􏽢q2 ), and Θschss condition, (40)
it follows that FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 ⊇ FH� q􏽢1 􏼁 ∩ FH� 􏼐ρ􏼑.
FH� q􏽢3 􏼁IFH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑, (38) From (34), (40), and FH� (􏽢q1 ) � FH� (􏽢q2 ), it follows that
or FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 ⊇ FH� 􏼐ρ􏼑. (41)
⌣ ⌣
X\FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 ⊇ X\FH� q􏽢3 􏼁. (39) On the other hand, θ􏽢1 q􏽢1 + (1 − θ􏽢1 )􏽢q2 � θ􏽢
􏽢q + (1 − θ)
1
􏽢 ρ
gives
Hence, (37) and (39) give a contradiction.

1 θ􏽢
ρ �􏼠 􏼡􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 − 􏼠 􏼡􏽢q1 ,
1 − θ􏽢 θ􏽢 − 1

1 θ􏽢 1 1 − θ􏽢1
ρ �􏼠 􏼡􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 − 􏼠 􏼡􏼠 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 − q􏽢2 􏼡, (42)
1 − θ􏽢 θ􏽢 − 1 θ􏽢1 θ􏽢1

⎝ θ􏽢1 − θ􏽢 ⎠ 􏽢 􏽢
⎝1 − θ 1 − θ ⎞
⎞􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 + ⎛ ⎠q􏽢 .
ρ �⎛ 2
􏼐1 − θ􏽢 􏽢
1 􏼑θ1 􏼐1 − θ􏽢1 􏼑θ􏽢1

From (34), (42), FH� (􏽢q1 ) � FH� (􏽢q2 ), and Θschss condition, From (44) and (46), it follows that
it follows that
FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 � 􏽮FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏽯, (47)
⌣ ⌣
X\FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 ⊇ X\FH� 􏼐ρ􏼑. (43)
which, together with FH� (􏽢q1 )IFH� (􏽢q2 ), yields
Hence, (41) and (43) give a contradiction. □ FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 � FH� q􏽢2 􏼁, (48)
Theorem 3. Let (FH� , Q) be a Θscohss . If there exists or
θ􏽢 ∈ II · , ∀􏽢q1 , q􏽢2 ∈ Q such that FH� (θ􏽢 􏽢q + (1 − θ)􏽢
1
􏽢 q )⊆
2
FH� (􏽢q1 ) ∪ FH� (􏽢q2 ), then (FH� , Q) is a Ψ-set. FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑⊂FH� q􏽢1 􏼁. (49)

Thus, from (49) and the hypothesis,

Proof. This can easily be proved by following the procedure
discussed in Theorem 2. □ 􏽢q +(1 − θ)
FH� 􏼐θ􏽢 􏽢 􏼐θ􏽢 q􏽢 + 􏼐1 − θ􏽢 􏼑􏽢q 􏼑􏼑
1 1 1 1 2
(50)
IFH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑.
Theorem 4. Let (FH� , Q) be a Δ-set. If there exists
θ􏽢 ∈ II · , ∀􏽢q1 , q􏽢2 ∈ Q, FH� (􏽢q1 ) ≠ FH� (􏽢q2 ) such that FH� (θ􏽢
􏽢q +
1 More generally, for n ∈ {1, 2, 3, . . .}, it can easily be
􏽢
(1 − θ)􏽢q )IF � (􏽢q ) ∩ F � (􏽢q ), then (F � , Q) is a Θ . shown that
2 H 1 H 2 H scohss
n n
Proof. Assume that (∃􏽢q1 , q􏽢2 ∈ Q), θ􏽢1 ∈ II· such that FH� 􏼐θ􏽢 q􏽢1 + 􏼐1 − θ􏽢 􏼑􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑􏼑
(51)
⌣ ⌣
X\FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑IX\􏽮FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏽯. (44) IFH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑.
n n
If FH� (􏽢q1 )IFH� (􏽢q2 ), then (44) gives Let q􏽢3 � θ􏽢2 q􏽢1 + (1 − θ􏽢2 )􏽢q2 where θ􏽢2 � θ􏽢1 − θ􏽢 θ􏽢1 + θ􏽢 ∈ II·
⌣ ⌣
for some n. Then, from (51), we see that
X\FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑IX\FH� q􏽢2 􏼁. (45)
FH� q􏽢3 􏼁 � FH� 􏼐θ􏽢2 q􏽢1 + 􏼐1 − θ􏽢2 􏼑􏽢q2 􏼑,
On the other hand, from the Δ-set condition, we have n n
that FH� q􏽢3 􏼁 � FH� 􏼐θ􏽢 q􏽢1 + 􏼐1 − θ􏽢 􏼑􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑􏼑, (52)

FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 ⊇ 􏽮FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏽯. (46) FH� (])IFH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑.
Journal of Function Spaces 7

n
Also, let ρn � θ􏽢3 q􏽢1 + (1 − θ􏽢3 )􏽢q2 where θ􏽢3 � θ􏽢1 − θ􏽢 + ⌣ ⌣
X\FH� q􏽢3 􏼁IX\FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑, (54)
􏽢 + (θ􏽢 θ􏽢 /(1 − θ))
(1/(1 − θ)) 􏽢 ∈ II for some n.
·
1
Then, which⌣contradicts (52).
⌣
FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 � FH� 􏼐θ􏽢
􏽢q +(1 − θ)
􏽢 ρ􏼑. (53) If X\FH� (􏽢q3 ) ⊆ X\FH� (ρ), then (53) and the hypothesis of
3
the theorem imply that
Now, if FH� (􏽢q3 ) ⊆ FH� (ρ), then (53) and (FH� , Q), which
is a Δ-set, imply that

FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑IFH� q􏽢3 􏼁 ∩ FH� 􏼐ρ􏼑,

(55)
FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 ⊇ 􏼐FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏼑 ∩ 􏼐FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏼑 � FH� q􏽢1 􏼁.

This contradicts (49). □ Proof. Assume that (∃􏽢q1 , q􏽢2 ∈ Q), θ􏽢1 ∈ II· such that
⌣ ⌣
Theorem 5. Let (FH� , Q) be a Ψ-set. If there exists X\FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 ⊇ X\􏽮FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏽯. (57)
􏽢q +
θ􏽢 ∈ II · , ∀􏽢q1 , q􏽢2 ∈ Q, FH� (􏽢q1 ) ≠ FH� (􏽢q2 ) such that FH� (θ􏽢 1 If q􏽢1 ≠ q􏽢2 , then (56) contradicts that (FH� , Q) is a Ωschss .
􏽢 q )⊂F � (􏽢q ) ∪ F � (􏽢q ), then (F � , Q) is a Θ
(1 − θ)􏽢 . If q􏽢1 � q􏽢2 , then choose θ􏽢1 ≠ θ􏽢2 ∈ II° such that θ􏽢1 �
2 H 1 H 2 H scohss
􏽢θθ􏽢 + (1 − θ) 􏽢 θ􏽢 .
2 2
Proof. This can easily be proved by following the procedure Let q􏽢1 � q􏽢2 � θ􏽢2 q􏽢1 + (1 − θ􏽢2 )􏽢q2 . Then, (56) implies that
discussed in Theorem 4. □ ⌣ ⌣
X\FH� q􏽢1 􏼁 ⊇ X\􏽮FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏽯, (58)
Theorem 6. Let (FH� , Q) be a Ωschss . If there exists
θ􏽢 ∈ II · , ∀􏽢q1 , q􏽢2 ∈ Q, such that ⌣ ⌣
X\FH� q􏽢2 􏼁 ⊇ X\􏽮FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏽯. (59)
􏽢q +(1 − θ)􏽢
FH� 􏼐θ􏽢 􏽢 q 􏼑 ⊇ F � q􏽢 􏼁 ∩ F � q􏽢 􏼁, (56)
1 2 H 1 H 2
According to (56), (58), and (59), we have
then (FH� , Q) is a Δ-set.

􏽢q +(1 − θ)􏽢
FH� 􏼐θ􏽢 􏽢 q 􏼑 ⊇ F � q􏽢 􏼁 ∩ F � q􏽢 􏼁
1 2 H 1 H 2

⊂􏼐FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏼑 ∩ 􏼐FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏼑 (60)

� FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁,

which contradicts that (FH� , Q) is a Ωschss . □ Thus, from (61) and the Δ-set condition, we get that
FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 � FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁. (62)
Theorem 7. Let (FH� , Q) be a Ωschss . If there exists
θ􏽢 ∈ II · , ∀􏽢q1 , q􏽢2 ∈ Q, such that FH� (θ􏽢 􏽢q + (1 − θ)􏽢
1
􏽢 q )⊆
2 Furthermore, it can be easily seen that
FH� (􏽢q1 ) ∪ FH� (􏽢q2 ), then (FH� , Q) is a Ψ-set.
􏽢q +(1 − θ)􏽢
θ􏽢 􏽢 q � θ􏽢 q􏽢 + 􏼐1 − θ􏽢 􏼑􏽢q , (63)
1 2 1 1 1 2
Proof. This can easily be proved by following the procedure
discussed in Theorem 6. □ where both q􏽢1 and q􏽢2 are of the forms q􏽢1 � θ􏽢1 q􏽢1 + (1 − θ􏽢1 )􏽢q2
and q􏽢2 � θ􏽢1 q􏽢1 + (1 − θ􏽢1 )􏽢q2 for choosing θ􏽢1 ∈ II° .
Theorem 8. Let (FH� , Q) be a Δ-set. If there exists On the other hand, from the Δ-set condition and our
􏽢q + (1 − θ)􏽢
θ􏽢 ∈ II · , ∀􏽢q1 , q􏽢2 ∈ Q􏽢q1 ≠ q􏽢2 , such that FH� (θ􏽢 􏽢 q )I definition of q􏽢1 and q􏽢2 , we get
1 2
FH� (􏽢q1 ) ∩ FH� (􏽢q2 ), then (FH� , Q) is a Ωschss . FH� q􏽢1 􏼁 ⊇ FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁, (64)

Proof. Assume that ∃(􏽢q1 ≠ q􏽢2 )], q􏽢1 , q􏽢2 ∈ Q), θ􏽢1 ∈ II· such FH� q􏽢2 􏼁 ⊇ FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁. (65)
that
⌣ ⌣ Therefore, from (63)–(65) and the hypothesis of the
X\FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 ⊇ X\􏽮FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏽯. (61)
theorem, we get that
8 Journal of Function Spaces

FH� 􏼐θ􏽢1 q􏽢1 + 􏼐1 − θ􏽢1 􏼑􏽢q2 􏼑 � FH� 􏼐θ􏽢

􏽢q + 􏼐1 − θ􏽢 􏼑􏽢q 􏼑IF � q􏽢 􏼁 ∩ F � q􏽢 􏼁
1 1 2 H 1 H 2
(66)
⊇ 􏼐FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏼑 ∩ 􏼐FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁􏼑 � FH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁.

FH� a􏽢1 κ1 􏼁 ⊇ FH� κ1 􏼁. (73)

This contradicts (62). □
The remaining part can be easily proved with the help of
Theorem 9. Let (FH� , Q) be a Ψ-set. If ∃θ􏽢 ∈ II · , ∀􏽢q1 , Theorem 1. □
q􏽢2 ∈ Q, q􏽢1 ≠ q􏽢2 , such that 􏽢q + (1 − θ)􏽢
FH� (θ􏽢 􏽢 q )⊂
1 2
FH� (􏽢q1 ) ∪ FH� (􏽢q2 ), then (FH� , Q) is a Ωscohss . 3.2. Jensen-Convex (Mid-Convex) Set and Its Inverse for maa-
Function. In this part of the paper, we present classical
Proof. This can easily be proved by following the procedure versions of Jensen-convex sets and their inverse for multi-
discussed in Theorem 8. □ argument approximate functions. It can be seen that the
nature of Jensen-convex set and its inverse is interchanged
� is a convex cone iff for κ, τ ∈ Q, for maa-function in set-theoretic approach.
Theorem 10. A hs-set H
a􏽢 > 0, Definition 14. A Δ-set is said to be J-convex hs-set (ΔJ -set)
(i) FH� (􏽢aκ) ⊇ FH� (κ). over Q if
(ii) FH� (κ + τ) ⊇ FH� (κ) ∩ FH� (τ). κ+τ
FH� 􏼒 􏼓 ⊇ FH� (κ) ∩ FH� (τ), (74)
2
⌣
� be a cchs-set over X
Proof. Let H ; then, part (i) is obviously ∀κ, τ ∈ Q.
verified. Consider κ, τ ∈ Q&􏽢a > 0. As H � is a cchs-set, by
using Definition 5 with a􏽢 � (1/2), we have Definition 15. A Ψ-set is said to be J-concave hs-set (ΨJ -set)
over Q if
1 1
FH� 􏼒 κ + τ 􏼓 ⊇ FH� (κ) ∩ FH� (τ), (67) κ+τ
2 2 FH� 􏼒 􏼓 ⊆ FH� (κ) ∪ FH� (τ), (75)
2
1 1 1 1
FH� 􏼒2􏼒 κ + τ 􏼓􏼓 ⊇ FH� 􏼒 κ + τ 􏼓, (68) ∀κ, τ ∈ Q.
2 2 2 2
and combining equations (67) and (68), we get Remark 2. If ⊆ is replaced with ≤ and ∪ by + in equation
(75), we get classical version of Jensen inequality.
1 1 1 1
FH� (κ + τ) � FH� 􏼒2􏼒 κ + τ 􏼓􏼓 ⊇ FH� 􏼒 κ + τ 􏼓
2 2 2 2 Definition 16. A Ωschss on Q is called a strongly J-convex hs-
(69)
set (ΩJschss ) if
⊇ FH� (κ) ∩ FH� (τ),
q􏽢1 + q􏽢2
which implies FH� 􏼠 􏼡IFH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁, (76)
2
FH� (κ + τ) ⊇ FH� (κ) ∩ FH� (τ). (70)
for every q􏽢1 , q􏽢2 ∈ Q, q􏽢1 ≠ q􏽢2 .
Conversely, let the given conditions (i) and (ii) be sat-
isfied. According to condition (i), H� is a cone. Now using Definition 17. A Ωschss on Q is called a strongly J-concave
both conditions for κ, τ ∈ Q&􏽢a > 0, we have hs-set (ΩJschss ) if

FH� (􏽢aκ +(1 − a􏽢)τ) ⊇ FH� (􏽢aκ) ∩ FH� ((1 − a􏽢)τ) q􏽢1 + q􏽢2
FH� 􏼠 􏼡⊂FH� q􏽢1 􏼁 ∪ FH� q􏽢2 􏼁, (77)
(71) 2
⊇ FH� (κ) ∩ FH� (τ),
for every q􏽢1 , q􏽢2 ∈ Q, q􏽢1 ≠ q􏽢2 .
� is a Δ-set. Hence, H
which shows that H � is cchs-set. □
Remark 3. If ⊂ is replaced with < and ∪ by + in equation
Theorem 11. A hs-set H � is a convex cone iff for (77), we obtain classical version of Jensen inequality for
κ1 , κ2 , . . . , κn ∈ Q, a􏽢 > 0, strong convexity.
n
⎝􏽘 a􏽢 κ ⎞
⎠
n Definition 18. A Θschss on Q is called a strictly J-convex hs-
FH� ⎛ i i ⊇ ∩ FH
� κi 􏼁. (72)
i�1
i�1 set (ΘJschss ) if
q􏽢1 + q􏽢2
FH� 􏼠 􏼡IFH� q􏽢1 􏼁 ∩ FH� q􏽢2 􏼁, (78)
2
� is a cone when we take n � 1,
Proof. By induction on n, H
i.e., for every q􏽢1 , q􏽢2 ∈ Q, FH� (􏽢q1 ) ≠ FH� (􏽢q2 ).
Journal of Function Spaces 9

Table 1: Comparison of the proposed approach with existing relevant approaches.

References EDOA CMAAF CSAF DCIPC DCH DCC SCSCx SCSCc
Deli [30] × × ✓ × × × ✓ ✓
Ihsan et al. [31] × × ✓ × × × × ×
Ihsan et al. [32] × × ✓ × × × × ×
Majeed [37] × × ✓ × ✓ ✓ × ×
Rahman et al. [35] ✓ ✓ ✓ × × × × ×
Salih and Sabir [34] × × ✓ × × × ✓ ✓
Proposed study ✓ ✓ ✓ ✓ ✓ ✓ ✓ ✓

Definition 19. A Θschss on Q is called a strictly J-concave hs-
set (ΘJschss ) if
q􏽢1 + q􏽢2
FH� 􏼠 􏼡⊂FH� q􏽢1 􏼁 ∪ FH� q􏽢2 􏼁, (79)
2
for every q􏽢1 , q􏽢2 ∈ Q, FH� (􏽢q1 ) ≠ FH� (􏽢q2 ).
Remark 4. If ⊂ is replaced with < and ∪ by + in equation
(79), we obtain classical version of Jensen inequality for strict
convexity.
3.3. Comparative Analysis. In this section, the proposed
study is compared professionally with some existing relevant
works in order to judge its advantageous aspects. This
comparison is based on some important evaluating features
like emphasis on deep observation of attributes (EDOA),
consideration of maa-function (CMAAF), sa-function
(CSAF), discussion on classical inequalities as particular
cases (DCIPC), discussion on convex hull (DCH), discussion
on convex cone (DCC), strictly cum strongly convexity
(SCSCx), and strictly cum strongly concavity (SCSCc) which
depict the advantages of the proposed study over the existing
approaches which are presented in Table 1.
4. Conclusion
In this paper, the classical notions of convex (concave) sets,
strictly convexity (concavity), strongly convexity (concav-
ity), convex hull, convex cone, and set inclusion, are gen-
eralized for hypersoft set environment. Some set-theoretic
inequalities based on these notions are established and
discussed by using certain aspects of set inclusion. Although
the proposed study provides a conceptual framework for
handling convex optimization problems under uncertain
scenario with deep observation of parameters, it has limi-
tations for hypersoft set environment with fuzzy, intui-
tionistic fuzzy, and neutrosophic settings in the domain as
well as in the range of maa-function. Therefore, future work
may include the following:
(1) The establishment of modular inequalities by con-
sidering the interval nature of uncertain data for
maa-function.
(2) The establishment of classical inequalities such as
Ostrowski-type inequalities, Hadamard-type in-
equalities, Minkowski’s inequalities, and others
under hs-set environment.
(3) The extension of the proposed study for hybridized
structures of hs-set like fhs-set, ifhs-set, nhs-set, and
so on.
(4) The extension of the proposed study for m-convex
and m-concave sets under hs-set environment.
(5) The implementation of the proposed framework for
solving convex optimization problems and decision-
making problems.
Data Availability
No data were used to support this study.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
References
[1] K. T. Atanassov, “Intuitionistic fuzzy sets,” Fuzzy Sets and
Systems, vol. 20, no. 1, pp. 87–96, 1986.
[2] F. Smarandache, Neutrosophy: Neutrosophic Probability, Set,
and Logic: Analytic Synthesis and Synthetic Analysis, Amer-
ican Research Press, Rehoboth, BE, USA, 1998.
[3] L. A. Zadeh, “Fuzzy sets,” Information and Control, vol. 8,
no. 3, pp. 338–353, 1965.
[4] D. Molodtsov, “Soft set theory-First results,” Computers &
Mathematics with Applications, vol. 37, no. 4-5, pp. 19–31,
1999.
[5] M. I. Ali, F. Feng, X. Liu, W. K. Min, and M. Shabir, “On some
new operations in soft set theory,” Computers & Mathematics
with Applications, vol. 57, no. 9, pp. 1547–1553, 2009.
[6] K. V. Babitha and J. J. Sunil, “Soft set relations and functions,”
Computers & Mathematics with Applications, vol. 60, no. 7,
pp. 1840–1849, 2010.
[7] K. V. Babitha and J. J. Sunil, “Transitive closures and orderings
on soft sets,” Computers & Mathematics with Applications,
vol. 62, no. 5, pp. 2235–2239, 2011.
[8] X. Ge and S. Yang, “Investigations on some operations of soft
sets,” World Academy of Science Engineering and Technology,
vol. 75, pp. 1113–1116, 2011.
[9] F. Li, “Notes on soft set operations,” ARPN Journal of systems
and softwares, vol. 1, no. 6, pp. 205–208, 2011.
[10] P. K. Maji, R. Biswas, and A. R. Roy, “Soft set theory,”
Computers & Mathematics with Applications, vol. 45, no. 4-5,
pp. 555–562, 2003.
[11] D. Pei and D. Miao, “From soft set to information system,” in
Proceedings of the International Conference of Granular
Computing, pp. 617–621, IEEE, Beijing, China, July 2005.
10 Journal of Function Spaces

[12] A. Sezgin and A. O. Atagün, “On operations of soft sets,” certain properties,” International Journal of Fuzzy Logic and
Computers & Mathematics with Applications, vol. 61, no. 5, Intelligent Systems, vol. 21, no. 3, pp. 233–242, 2021.
pp. 1457–1467, 2011. [32] M. Ihsan, M. Saeed, and A. U. Rahman, “A rudimentary
[13] M. Abbas, Y. Guo, and G. Murtaza, “A survey on different approach to develop context for convexity cum concavity on
definitions of soft points: limitations, comparisons and soft expert set with some generalized results,” Punjab Uni-
challenges,” Journal of Fuzzy Extension and Application, versity Journal of Mathematics, vol. 53, no. 9, pp. 621–629,
vol. 2, no. 4, pp. 334–343, 2021. 2021.
[14] P. K. Maji, R. Biswas, and A. R. Roy, “Fuzzy soft sets,” Journal [33] A. U. Rahman, M. Saeed, M. Arshad, M. Ihsan, and
of Fuzzy Mathematics, vol. 9, no. 3, pp. 589–602, 2001. M. R. Ahmad, “(m, n)-convexity-cum-concavity on fuzzy soft
[15] P. K. Maji, R. Biswas, and A. R. Roy, “Intuitionistic fuzzy soft set with applications in first and second sense,” Punjab
sets,” Journal of Fuzzy Mathematics, vol. 9, no. 3, pp. 677–692, University Journal of Mathematics, vol. 53, no. 1, pp. 19–33,
2001. 2021.
[16] P. K. Maji, “Neutrosophic soft set,” Annals of Fuzzy Math- [34] H. M. Salih and P. O. Sabir, “Some new properties of convex
ematics and Informatics, vol. 5, no. 1, pp. 2287–2623, 2013. and concave soft sets,” Diyala Journal for Pure Sciences,
[17] F. Smarandache, “Extension of soft set of hypersoft set, and vol. 15, no. 9, pp. 84–94, 2018.
then to plithogenic hypersoft set,” Neutrosophic Sets and [35] A. U. Rahman, M. Saeed, and F. Smarandache, “Convex and
Systems, vol. 22, pp. 168–170, 2018. concave hypersoft sets with some properties,” Neutrosophic
[18] F. Abbas, G. Murtaza, and F. Smarandache, “Basic operations Sets and Systems, vol. 38, pp. 497–508, 2020.
on hypersoft sets and hypersoft points,” Neutrosophic Sets and [36] B. B. Chaudhuri, “Concave fuzzy set: a concept comple-
Systems, vol. 35, pp. 407–421, 2020. mentary to the convex fuzzy set,” Pattern Recognition Letters,
[19] M. Saeed, A. U. Rahman, M. Ahsan, and F. Smarandache, “An vol. 13, no. 2, pp. 103–106, 1992.
inclusive study on fundamentals of hypersoft set,” in Theory [37] S. N. Majeed, “Some notions on convex soft sets,” Annals of
and Application of Hypersoft Set, F. Smarandache, M. Saeed, Fuzzy Mathematics and Informatics, vol. 12, no. 4, pp. 517–526,
M. Abdel-Baset, and M. Saqlain, Eds., pp. 1–23, Pons Pub- 2016.
lishing House, Brussels, Belgium, 1st edition, 2021.
[20] D. Ajay and J. J. Charisma, “An MCDM based on alpha open
hypersoft sets and its application,” in Proceedings of the In-
ternational Conference on Intelligent and Fuzzy Systems,
pp. 333–341, Springer, Istanbul, Turkey, August 2021.
[21] S. Debnath, “Fuzzy hypersoft sets and its weightage operator
for decision making,” Journal of Fuzzy Extension and Ap-
plications, vol. 2, no. 2, pp. 163–170, 2021.
[22] A. Yolcu and T. Y. Ozturk, “Fuzzy hypersoft sets and it’s
application to decision-making,” in Theory and Application of
Hypersoft Set, F. Smarandache, M. Saeed, M. Abdel-Baset, and
M. Saqlain, Eds., pp. 50–64, Pons Publishing House, Brussels,
Belgium, 1st edition, 2021.
[23] A. Yolcu, F. Smarandache, and T. Y. Öztürk, “Intuitionistic
fuzzy hypersoft sets,” Communications Faculty of Science
University of Ankara Series A1 Mathematics and Statistics,
vol. 70, no. 1, pp. 443–455, 2021.
[24] H. Kamacı and M. Saqlain, “n-ary Fuzzy hypersoft expert
sets,” Neutrosophic Sets and Systems, vol. 43, pp. 180–211,
2021.
[25] H. Kamacı, “On hybrid structures of hypersoft sets and rough
sets,” International Journal of Modern Science and Technology,
vol. 6, no. 4, pp. 69–82, 2021.
[26] N. Martin and F. Smarandache, “Concentric plithogenic
hypergraph based on plithogenic hypersoft sets-a novel
outlook,” Neutrosophic Sets and Systems, vol. 33, pp. 78–91,
2020.
[27] S. Y. Musa and B. A. Asaad, “Bipolar hypersoft sets,”
Mathematics, vol. 9, no. 15, p. 1826, 2021.
[28] T. Lara, E. Rosales, and J. L. Sanchez, “New properties of m-
convex functions,” International Journal of Mathematical
Analysis, vol. 9, no. 15, pp. 735–742, 2015.
[29] T. Lara, R. Quintero, and E. Rosales, “m-convexity and
functional equations,” Moroccan Journal of Pure and Applied
Analysis, vol. 3, no. 1, pp. 56–62, 2017.
[30] I. Deli, “Convex and concave sets based on soft sets and fuzzy
soft sets,” Journal of New Theory, vol. 29, pp. 101–110, 2019.
[31] M. Ihsan, A. U. Rahman, M. Saeed, and H. A. E.-W. Khalifa,
“Convexity-cum-concavity on fuzzy soft expert set with