Some formal relationships among soft sets,fuzzy sets,and their extensions

We prove that every hesitant fuzzy set on a set E can be considered either a soft set over the universe $[0,1]$ or a soft set over the universe E. Concerning converse relationships, for denumerable universes we prove that any soft set can be considered even a fuzzy set. Relatedly, we demonstrate that every hesitant fuzzy soft set can be identified with a soft set, thus a formal coincidence of both notions is brought to light. Coupled with known relationships, our results prove that interval type-2 fuzzy sets and interval-valued fuzzy sets can be considered as soft sets over the universe $[0,1]$. Altogether we contribute to a more complete understanding of the relationships among various theories that capture vagueness and imprecision.     

Embedding theorems for classes of convex sets

Rådström's embedding theorem states that the nonempty compact convex subsets of a normed vector space can be identified with points of another normed vector space such that the embedding map is additive, positively homogeneous, and isometric. In the present paper, extensions of Rådström's embedding theorem are proven which provide additional information on the embedding space. These results include those of Hörmander who proved a similar embedding theorem for the nonempty closed bounded convex subsets of a Hausdorff locally convex vector space. In contrast to Hörmander's approach via support functionals, all embedding theorems of the present paper are proven by a refinement of Rådström's original method which is constructive and does not rely on Zorn's lemma. This paper also includes a brief discussion of some actual or potential applications of embedding theorems for classes of convex sets in probability theory, mathematical economics, interval mathematics, and related areas.     

Poset extensions, convex sets, and semilattice presentations

The paper is devoted to an algebraic and geometric study of the feasible set of a poset, the set of finite probability distributions on the elements of the poset whose weights satisfy the order relationships specified by the poset. For a general poset, this feasible set is a barycentric algebra. The feasible sets of the order structures on a given finite set are precisely the convex unions of the primary simplices, the facets of the first barycentric subdivision of the simplex spanned by the elements of the set. As another fragment of a potential complete duality theory for barycentric algebras, a duality is established between order-preserving mappings and embeddings of feasible sets. In particular, the primary simplices constituting the feasible set of a given finite poset are the feasible sets of the linear extensions of the poset. A finite poset is connected if and only if its barycentre is an extreme point of its feasible set. The feasible set of a (general) disconnected poset is the join of the feasible sets of its components. The extreme points of the feasible set of a finite poset are specified in terms of the disjointly irreducible elements of the semilattice presented by the poset. Semilattices presented by posets are characterised in terms of various distributivity concepts.     

Norm-preserving extensions of functionals and denting points of convex sets

Let W and Z be Banach spaces, and let and be closed subspaces. Let be a subspace of , the Banach space of bounded linear operators from W* to Z**, containing . We describe, for and , all norm-preserving extensions of to the space in terms of convergence of convex combinations. We also characterize denting points of bounded convex subsets of Banach spaces in similar terms. Various applications are presented. Supported by Estonian Science Foundation Grant 5704.     

Some notes on convex sets

In [1] Tukey proves that if A and B are closed convex subsets in a Banach space, so that A is bounded and A-B is dense in the open unit ball U then A-BU. We shall give here a more general result than the former one which contains the Banach's isomorphism theorem as particular case. Other results over convex sets are also given.The author is indebted to the referee for the several very valuable comments.     

Thin and thick sets in locally convex spaces

We introduce in this work some normed space notions such as norming, thin and thick sets in general locally convex spaces. We also study some effects of thick sets on the uniform boundedness-like principles in locally convex spaces such as “weak*-bounded sets are strong*-bounded if and only if the space is a Banach–Mackey space”. It is proved that these principles occur under some weaker conditions by means of thick sets. Further, we show that the thickness is a duality invariant, that is, all compatible topologies for some locally convex space have the same thick sets.     

Asymptotics of convex sets in Euclidean and hyperbolic spaces

We study convex sets C of finite (but non-zero) volume in Hn and En. We show that the intersection C_∞ of any such set with the ideal boundary of Hn has Minkowski (and thus Hausdorff) dimension of at most (n−1)/2, and this bound is sharp, at least in some dimensions n. We also show a sharp bound when C_∞ is a smooth submanifold of _∂∞Hn. In the hyperbolic case, we show that for any k?(n−1)/2 there is a bounded section S of C through any prescribed point p, and we show an upper bound on the radius of the ball centered at p containing such a section. We show similar bounds for sections through the origin of a convex body in En, and give asymptotic estimates as 1?k?n.     

Classes of convex sets as generalized metrical spaces

The metrization of classes of convex bodies is generalized to a Minkowski space with unsymmetric metric.Translated from Matematicheskie Zametki, Vol. 4, No. 1, pp. 45–52, July, 1968.     

Rigidity of invariant convex sets in symmetric spaces

The main result implies that a proper convex subset of an irreducible higher rank symmetric space cannot have Zariski dense stabilizer.