Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.12466

A lattice-theoretic framework for hesitant fuzzy convexity beyond scalar observables

Carlos Salvatierra·Pedro Huidobro·Raquel Fernandez-Peralta
View original source ↗Read source document ↗Export metadata ↓

Abstract

In fuzzy-set theory, the notion of convexity has often been formulated through scalar reductions, typically via scores and aggregation functions. Although useful, such reductions may obscure relevant order-theoretic information in the codomain, especially in complex set-valued settings. This article develops a lattice-theoretic framework for convexity on lattice-valued mappings over point-convex segment-generated abstract convexity spaces. The framework separates the segment structure of the domain from the lattice structure of the codomain, distinguishing intrinsic convexity, defined through the lattice meet, from relational and observable convexities induced by preorders or scalar maps. The article characterizes when scalar observables preserve or reconstruct intrinsic convexity, and which codomain operators preserve it through their pointwise extensions. It then specializes the framework to hesitant fuzzy sets endowed with the symmetric lattice, recovering classical fuzzy and interval-valued convexities as natural restrictions. The structural result shows that the symmetric order cannot be represented by any finite family of scalar observables. This obstruction appears even on two-point typical hesitant fuzzy elements. Consequently, symmetric hesitant convexity cannot, in general, be reconstructed by any finite family of scalar observables. Moreover, every finite family of monotone scalar observables admits a three-point hesitant profile that is scalar-convex for all selected descriptions but not symmetrically convex.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Carlos Salvatierra, Pedro Huidobro, Raquel Fernandez-Peralta. 2026-06-09. A lattice-theoretic framework for hesitant fuzzy convexity beyond scalar observables. https://arxiv.org/abs/2606.12466

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗