arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2606.12466math.GM
收藏

超越标量可观测量的犹豫模糊凸性的格论框架

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

University of Granada(格拉纳达大学);University of Oviedo(奥维耶多大学);Slovak Academy of Sciences(斯洛伐克科学院)

Carlos Salvatierra, Pedro Huidobro, Raquel Fernandez-Peralta

AI总结:

提出一种格论框架,通过分离定义域与值域的格结构,定义内在凸性、关系凸性和可观测凸性,并证明对称序无法由有限族标量可观测量表示,导致对称犹豫凸性不可重构。

摘要:

在模糊集理论中,凸性的概念通常通过标量约简来表述,典型地通过得分和聚合函数。尽管有用,这种约简可能会掩盖余域中相关的序理论信息,尤其是在复杂的集值设定中。本文针对点凸线段生成的抽象凸性空间上的格值映射,发展了一个格论框架用于凸性。该框架将定义域的线段结构与余域的格结构分离,区分了通过格交定义的内在凸性,以及由预序或标量映射诱导的关系凸性和可观测凸性。文章刻画了标量可观测量何时保持或重构内在凸性,以及哪些余域算子通过其逐点扩展保持内在凸性。然后,它将框架特化到具有对称格的犹豫模糊集,将经典模糊凸性和区间值凸性恢复为自然限制。结构结果表明,对称序不能由任何有限族标量可观测量表示。即使在两点典型犹豫模糊元素上也出现这种障碍。因此,对称犹豫凸性通常不能由任何有限族标量可观测量重构。此外,每个有限族单调标量可观测量都承认一个三点犹豫轮廓,该轮廓对于所有选定的描述是标量凸的,但不是对称凸的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑