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

Abstract

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.