Abstract
Rosenfeld defined a fuzzy subgroup of group $G$ as a fuzzy subset of $G$ with two special conditions attached. In this paper, we introduce the fuzzy $t$-norms and vague $t$-norms. The unit interval with a $t$-norm or a $t$-conorm is a special monoid, so we mainly talk about fuzzy subsets of monoids and vague monoids. Firstly, we generalize some properties of $t$-norm to fuzzy $t$-subnorm, so that we can analyze and classify the fuzzy $t$-norms. Further, we explore specific research on these properties of the vague $t$-norm. In addition, the concept of lattice is introduced, and then the present conclusions are extended to bounded lattices. Finally, we define the concept of fuzzy monoids by aggregate functions, uninorms, nullnorms and draw the relevant results.
Introduction
In classical fuzzy logic, $t$-norms and $t$-conorms serve as the fundamental "crisp" operations used to model conjunction and disjunction. While these operators are well-defined on the unit interval $[0, 1]$, real-world systems characterized by high noise or extreme imprecision often require more flexible structures.
Building on the foundational work of Rosenfeld (1971), who introduced fuzzy subgroups by applying fuzzy subsets to classical groups, this research explores the "fuzzification" of the operations themselves. By defining fuzzy and vague monoids, the paper addresses a critical gap: how algebraic properties like monotonicity and cancellation behave when the underlying operations are no longer binary or crisp, but are instead treated within a fuzzy framework.
Theoretical Framework and Methodology
The study employs a purely theoretical approach to generalize classical algebraic definitions. The methodology centers on four key transitions:
- Fuzzification of Properties: Classical properties of $t$-norms—including strict monotonicity, cancellation laws, and limit properties—are redefined to apply to fuzzy subsets $\mu$ of a monoid.
- Introduction of Vague Monoids: The authors utilize the concept of fuzzy equality ($E_X$), a relation that measures the degree of similarity between elements. This allows for the definition of "vague" versions of binary operations where the identity and associativity are satisfied relative to the fuzzy equality rather than a binary "equal or not" state.
- Lattice Generalization: To ensure the findings are not limited to the real-number unit interval $[0, 1]$, the concepts are extended to bounded lattices, which are more general partially ordered sets.
- Operator Substitution: The standard "minimum" ($\wedge$) operator is replaced with broader classes of operators, such as aggregation functions, uninorms, and nullnorms, to define and analyze new types of fuzzy submonoids.
Key Insights and Structural Properties
Fuzzy $t$-subnorms and Monotonicity
The research defines a fuzzy $t$-subnorm as a fuzzy subset that respects the structure of a $t$-norm. A significant finding is the preservation of logical consistency: if a subnorm is "fuzzy strictly monotone," it must also satisfy a "fuzzy cancellation law," mirroring results found in classical algebra. However, the paper also identifies constraints; for instance, if a $t$-norm is strictly monotone, its corresponding fuzzy $t$-subnorm cannot be strictly decreasing.
Vague vs. Fuzzy Distinctions
A critical distinction is established between "fuzzy" and "vague" structures. In this context, "fuzzy" refers to the degree of membership of elements within a set, while "vague" refers to operations defined over fuzzy equality relations. This distinction allows for a more nuanced modeling of uncertainty in algebraic systems.
Uninorms and Nullnorms
Unlike $t$-norms (which have an identity at 1) or $t$-conorms (identity at 0), uninorms allow the identity element to be any value in $[0, 1]$. The authors demonstrate that for certain "disjunctive" uninorms, a fuzzy subset can only qualify as a $U$-fuzzy subnorm if it is identically equal to 1, revealing a high level of structural rigidity in these generalized operators.
Results and Conclusions
The paper successfully generalizes strict monotonicity, cancellation laws, and Archimedean properties to both fuzzy and vague $t$-norms. Key results include:
- Core Stability: The "core" of a fuzzy submonoid (the set of elements where the membership degree is exactly 1) is proven to remain a classical submonoid, providing a mathematical bridge between fuzzy and standard algebra.
- Lattice Extension: All major conclusions regarding fuzzy $t$-norms were successfully extended to bounded lattices, confirming that these definitions are robust across different mathematical structures.
- Nullnorm Classification: The authors provide specific conditions (Propositions 6.10 and 6.11) for when a fuzzy subset qualifies as a fuzzy $t$-subnorm under a nullnorm, specifically focusing on the behavior of the "absorbing element" $k$.
While the paper provides a rigorous algebraic foundation, it focuses primarily on $t$-norms. Future research is required to provide a similarly exhaustive exploration of fuzzified $t$-conorms and to investigate the practical application of these vague structures in fuzzy control systems or decision-making algorithms.
Summary updated