Skip to Content
AxiomsAxioms
  • Article
  • Open Access

27 August 2026

12 Pages

A Fuzzy-Equality-Based Index of T-Transitivity for Fuzzy Relations

School of Data Science, Chengdu Technological University, Chengdu 611730, China
This article belongs to the Special Issue Advances in Fuzzy Mathematics

Abstract

In this paper, we introduce a novel index of transitivity for fuzzy relations based on fuzzy equality. The proposed index evaluates the supremal uniform fuzzy-equality proximity between a given relation and the family of exactly transitive relations induced by a continuous triangular norm. We establish several fundamental properties of the proposed index, including faithfulness, stability with respect to fuzzy equality, invariance under inverse relations, monotonicity under restriction, and bounds derived from transitive closures. Furthermore, we prove that the proposed index is attainable on finite universes. A detailed comparison with the traditional degree of transitivity demonstrates that the new index always provides an evaluation no smaller than the classical measure and can distinguish different aspects of approximate transitivity. Finally, we characterize the special case in which the two indices coincide for all fuzzy relations and show that this occurs precisely for the Gödel triangular norm.

1. Introduction

Fuzzy relations provide a standard framework for representing graded interactions, similarities, preferences, and dependencies in systems involving uncertainty or imprecision. Since the foundational work of Zadeh on fuzzy sets and similarity relations [1,2], fuzzy relational structures have been widely used in approximate reasoning, classification, clustering, decision making, information retrieval, and knowledge representation. Among their structural properties, transitivity is particularly important because it underlies fuzzy preorders, fuzzy equivalence relations, fuzzy orderings, and indistinguishability operators [3,4,5,6].
Let T be a triangular norm (t-norm). A fuzzy relation R on a universe X is T-transitive if T R ( x , y ) , R ( y , z ) ≤ R ( x , z ) ( x , y , z ∈ X ) . Recent work continues to show the relevance of such conditions. He et al. [7] studied T L -transitivity of fuzzy similarity measures and its connection with triangle-type inequalities. Armengol et al. [8] investigated T-generable indistinguishability operators and their use in feature selection and classification. Recasens [9] surveyed the development and applications of similarity relations more broadly.
In applications, however, fuzzy relations obtained from subjective assessments, incomplete information, or noisy observations need not satisfy transitivity exactly. This motivates graded evaluations of relational properties. Related approaches include extensional graded properties of fuzzy relations [10], similarity-based treatments of approximate fuzzy preorders and equivalences [3,4,6], and the degree of symmetry studied by Dan et al. [11].
For a left-continuous t-norm T, the traditional degree of T-transitivity is
α T ( R ) = ⋀ x , y , z ∈ X T R ( x , y ) , R ( y , z ) → T R ( x , z ) ,
where → T is the residual implication associated with T [12]. Boixader and Recasens [13] revisited this degree and characterized it through transformations that produce T-transitive relations below the original relation. Because α T ( R ) is an infimum over all triples, it is a worst-constraint measure: its value records the least satisfied transitivity condition. This is appropriate when the aim is to detect the most serious local violation, but it does not directly quantify how uniformly close the entire relation is to the class of exactly T-transitive relations. The class of T-transitive relations itself has a rich structure. Aggregation of indistinguishability operators and transitive fuzzy relations has been studied in [14,15]; connections between fuzzy preorders and generalized distances were developed in [16]; and localization relations were introduced in [17]. These results motivate studying approximation to the whole class of transitive relations rather than evaluating only separate pointwise inequalities.
In this paper, we define a fuzzy-equality-based index of T-transitivity. Let T ( X ) denote the family of all T-transitive fuzzy relations on X, and let
E X 2 ( R , S ) = ⋀ x , y ∈ X R ( x , y ) ↔ T S ( x , y ) ,
where ↔ T is the bi-implication associated with T. For a continuous t-norm T, set
d T ( R ) = ⋁ S ∈ T ( X ) E X 2 ( S , R ) .
The quantity d T ( R ) is therefore the supremal uniform fuzzy-equality level between R and the exact class T ( X ) . The optimization is global in the sense that it ranges over the whole class of T-transitive relations, but the criterion E X 2 is itself maximin: it is determined by the least coordinatewise similarity. Hence d T is a uniform-approximation index, not an average or total measure of all entrywise modifications. In particular, a supremum need not be attained on an arbitrary universe.
The generic principle of measuring a property by similarity to objects satisfying it exactly is mathematically natural. The contribution claimed here is therefore not that approximation principle by itself, but its specific implementation for T-transitive fuzzy relations and the structural results that follow from it. We prove that d T is faithful to exact transitivity, establish its stability and behavior under natural relational operations, and show that the defining supremum is attained when X is finite. We then compare d T with the traditional degree α T . Although α T ( R ) ≤ d T ( R ) always holds for continuous T, strict inequality can occur. Finally, we characterize the exceptional continuous t-norm for which the two indices coincide for every fuzzy relation on every universe: this happens exactly for the Gödel t-norm.
The remainder of the paper is organized as follows. Section 2 recalls only the t-norm, residual, and fuzzy-relation facts used later. Section 3 introduces d T and studies faithfulness, finite-universe attainment, stability, inverse invariance, restriction, and transitive closure. Section 4 compares d T with α T , gives strict-inequality examples, and proves the Gödel characterization. Section 5 summarizes the conclusions and indicates directions for future research.

2. Preliminaries

This section collects the notation and standard results used in the sequel. Further background on t-norms and residual structures can be found in ([18], Chapters 1 and 11) and (Chapters 1–2, [19]).
Definition 1 
([18], Chapter 1). A t-norm is a binary operation T: [ 0 , 1 ] 2 → [ 0 , 1 ] that is commutative, associative, increasing in each argument, and satisfies T ( x , 1 ) = x for all x ∈ [ 0 , 1 ] . It is called left-continuous if, for each fixed x ∈ [ 0 , 1 ] ,
T x , ⋁ i ∈ I y i = ⋁ i ∈ I T ( x , y i ) ,
and continuous if it is continuous as a function on [ 0 , 1 ] 2 .
Example 1 
([18], Chapter 1). The three standard continuous t-norms used throughout the paper are
T M ( x , y ) = min { x , y } , ( G ö del ) , T P ( x , y ) = x y , ( product ) , T Ł ( x , y ) = max { x + y − 1 , 0 } , ( Ł ukasiewicz ) .
The only part of the ordinal sum representation needed later is the following consequence of the standard representation theorem.
Proposition 1 
([18], Chapter 5). Let T be a continuous t-norm. If T ≠ T M , then there exist 0 ≤ a < b ≤ 1 , an order isomorphism ϕ: [ a , b ] → [ 0 , 1 ] , and T * ∈ { T P , T Ł } such that
T ( u , v ) = ϕ − 1 T * ( ϕ ( u ) , ϕ ( v ) ) , u , v ∈ [ a , b ] .
The interval [ a , b ] is a nontrivial Archimedean component of the ordinal sum representation of T.
Definition 2 
([18], Chapter 11). Let T be a left-continuous t-norm. Its residual implication is
x → T y = ⋁ { t ∈ [ 0 , 1 ] : T ( x , t ) ≤ y } , x , y ∈ [ 0 , 1 ] .
The associated bi-implication is
x ↔ T y = ( x → T y ) ∧ ( y → T x ) .
The residual implication is characterized by the adjointness relation
T ( x , z ) ≤ y ⟺ z ≤ x → T y .
We shall also use the standard facts
x → T y = 1 ⟺ x ≤ y , T ( x → T y , y → T z ) ≤ x → T z ,
which follow from adjointness; see ([18], Chapter 11) and ([19], Chapter 2).
Example 2. 
For the t-norms in Example 1, the residual implications and bi-implications are
(i) 
T = T M ,
x → M y = 1 , x ≤ y , y , x > y , x ↔ M y = 1 , x = y , x ∧ y , x ≠ y ;
(ii) 
T = T P ,
x → P y = 1 , x ≤ y , y / x , x > y , x ↔ P y = 1 , x = y , x ∧ y x ∨ y , x ≠ y ;
(iii) 
T = T Ł ,
x → Ł y = min { 1 , 1 − x + y } , x ↔ Ł y = 1 − | x − y | .
Definition 3 
([1]). A fuzzy relation on a universe X is a mapping R: X × X → [ 0 , 1 ] . For fuzzy relations R and S, we write R ≤ S if R ( x , y ) ≤ S ( x , y ) for all x , y ∈ X .
Unless otherwise stated, fuzzy relations considered in this paper are not assumed to be reflexive or symmetric.
Definition 4 
([13]). Let T be a t-norm. A fuzzy relation R on X is T-transitive if
T ( R ( x , y ) , R ( y , z ) ) ≤ R ( x , z ) for all x , y , z ∈ X .
The family of all T-transitive fuzzy relations on X is denoted by T ( X ) .
The reflexive and symmetric form of the numerical relations used below is chosen only for convenience of illustration; neither property is assumed in the general theory.
The exact condition can be sensitive to small perturbations. For instance, with the product t-norm,
R = 1 0.4 0.801 0.4 1 0.5 0.801 0.5 1 , S = 1 0.4 0.8 0.4 1 0.5 0.8 0.5 1 .
The relation R is not product-transitive because T P ( 0.801 , 0.5 ) = 0.4005 > 0.4 , whereas S is product-transitive. This illustrates why a graded evaluation of transitivity is useful.
Definition 5 
([12]). For a fuzzy relation R on X and a left-continuous t-norm T, the degree of T-transitivity is
α T ( R ) = ⋀ x , y , z ∈ X T ( R ( x , y ) , R ( y , z ) ) → T R ( x , z ) .
Moreover, α T ( R ) = 1 if and only if R is T-transitive.
Definition 6 
(Chapter 2, [20]). Let T be a left-continuous t-norm. The fuzzy-equality degree between two fuzzy relations R and S on X is
E X 2 ( R , S ) = ⋀ x , y ∈ X R ( x , y ) ↔ T S ( x , y ) .
Thus E X 2 ( R , S ) is a uniform equality degree between the two relations.
Definition 7 
([13]). Let R be a fuzzy relation on X, let T be a t-norm, and c ∈ [ 0 , 1 ] . Then R ( T , c ) is defined for all x , y ∈ X by R ( T , c ) ( x , y ) = T ( R ( x , y ) , c ) .
Proposition 2 
([13]). Let T be a left-continuous t-norm and R a fuzzy relation on X. Then R ( T , α T ( R ) ) is T-transitive.
Proposition 3 
([13]). Let T be a left-continuous t-norm and R a fuzzy relation on X. Then E X 2 R , R ( T , α T ( R ) ) ≥ α T ( R ) .
The next elementary inequality will be used to establish stability of the new index.
Proposition 4. 
Let T be a left-continuous t-norm. For any fuzzy relations R , Q , S on X, T E X 2 ( R , Q ) , E X 2 ( Q , S ) ≤ E X 2 ( R , S ) .
Proof. 
For a , b , c ∈ [ 0 , 1 ] , Equation (2) gives T ( a → T b , b → T c ) ≤ a → T c and, symmetrically, T ( c → T b , b → T a ) ≤ c → T a . Therefore T ( a ↔ T b , b ↔ T c ) ≤ a ↔ T c .
Apply this pointwise with a = R ( x , y ) , b = Q ( x , y ) , and c = S ( x , y ) . Since E X 2 ( R , Q ) and E X 2 ( Q , S ) are bounded above by the corresponding pointwise bi-implications, monotonicity of T yields T E X 2 ( R , Q ) , E X 2 ( Q , S ) ≤ R ( x , y ) ↔ T S ( x , y ) for every ( x , y ) ∈ X 2 . Taking the infimum over X 2 proves the result.  □

3. The Index of T-Transitivity of Fuzzy Relations Based on Continuous T-Norms

The equality degree E X 2 ( S , R ) quantifies the least coordinatewise fuzzy equality between two relations. This suggests measuring the approximate transitivity of R by comparing it with the entire class of exactly T-transitive relations.
Definition 8. 
Let T be a continuous t-norm and let R be a fuzzy relation on X. The index of T-transitivity of R is
d T ( R ) = ⋁ S ∈ T ( X ) E X 2 ( S , R ) .
Definition 8 should be read as a supremal uniform-approximation index. The optimization ranges over the whole class T ( X ) , while E X 2 itself is a maximin criterion. Thus d T ( R ) does not measure the average or total number of changed entries. Moreover, on an arbitrary universe the supremum need not be attained.
Once the index is defined, several natural questions arise. First, is it faithful to exact transitivity? Second, is it stable when the underlying relation is replaced by a highly similar one? Third, how does it behave under basic operations such as inversion, restriction, and transitive closure? We answer these questions in turn, beginning with faithfulness.
Proposition 5. 
Let T be a continuous t-norm. A fuzzy relation R on X is T-transitive if and only if d T ( R ) = 1 .
Proof. 
If R is T-transitive, then R ∈ T ( X ) and E X 2 ( R , R ) = 1 , so Definition 8 gives d T ( R ) = 1 .
Conversely, suppose that d T ( R ) = 1 , and fix c ∈ [ 0 , 1 ) . There exists S c ∈ T ( X ) such that E X 2 ( S c , R ) > c .
Hence, for every u , v ∈ X , c < S c ( u , v ) ↔ T R ( u , v ) , so in particular c ≤ R ( u , v ) → T S c ( u , v ) , c ≤ S c ( u , v ) → T R ( u , v ) .
By adjointness, T ( c , R ( u , v ) ) ≤ S c ( u , v ) , T ( c , S c ( u , v ) ) ≤ R ( u , v ) .
For arbitrary x , y , z ∈ X , the transitivity of S c therefore yields
T T ( c , R ( x , y ) ) , T ( c , R ( y , z ) ) ≤ T ( S c ( x , y ) , S c ( y , z ) ) ≤ S c ( x , z ) .
Applying the increasing map T ( c , · ) gives
T c , T T ( c , R ( x , y ) ) , T ( c , R ( y , z ) ) ≤ T ( c , S c ( x , z ) ) ≤ R ( x , z ) .
By associativity and commutativity,
T T ( T ( c , c ) , c ) , T ( R ( x , y ) , R ( y , z ) ) ≤ R ( x , z ) .
Letting c → 1 − and using continuity of T, we obtain T ( R ( x , y ) , R ( y , z ) ) ≤ R ( x , z ) . Since x , y , z are arbitrary, R is T-transitive.  □
Although Definition 8 involves a supremum, the situation improves on finite universes.
Proposition 6. 
Let X be finite and let T be a continuous t-norm. For every fuzzy relation R on X, there exists S * ∈ T ( X ) such that d T ( R ) = E X 2 ( S * , R ) .
Proof. 
If | X | = n , identify all fuzzy relations on X with the compact cube [ 0 , 1 ] n 2 . For every fixed triple ( x , y , z ) , the set { S : T ( S ( x , y ) , S ( y , z ) ) ≤ S ( x , z ) } is closed because T is continuous. Since only finitely many triples are involved, T ( X ) is a closed subset of a compact cube and is therefore compact.
For a continuous t-norm, its residual implication is upper semicontinuous. Indeed, for each λ ∈ [ 0 , 1 ] , adjointness gives { ( u , v ) : u → T v ≥ λ } = { ( u , v ) : T ( u , λ ) ≤ v } , and the latter set is closed by continuity of T.
Hence u ↔ T v , being the minimum of two upper semicontinuous functions, is upper semicontinuous. Since X is finite, S ⟼ E X 2 ( S , R ) = min x , y ∈ X S ( x , y ) ↔ T R ( x , y ) is upper semicontinuous. It therefore attains its maximum on the compact set T ( X ) , proving the claim.  □
Proposition 6 justifies speaking of a maximizing transitive approximation when X is finite. It does not, however, imply that a particular candidate displayed in an example is optimal unless that optimality is separately proved.
We next turn to stability under fuzzy equality.
Proposition 7. 
For any fuzzy relations R , Q on X, T E X 2 ( R , Q ) , d T ( Q ) ≤ d T ( R ) . By symmetry, T E X 2 ( R , Q ) , d T ( R ) ≤ d T ( Q ) .
Proof. 
For any S ∈ T ( X ) , Proposition 4 gives T E X 2 ( R , Q ) , E X 2 ( Q , S ) ≤ E X 2 ( R , S ) ≤ d T ( R ) .
Taking the supremum over S ∈ T ( X ) and using continuity of T in its second argument yields T E X 2 ( R , Q ) , d T ( Q ) ≤ d T ( R ) .
The second inequality follows by interchanging R and Q.  □
Remark 1. 
If E X 2 ( R , Q ) ≥ λ and d T ( Q ) ≥ μ , then Proposition 7 implies
d T ( R ) ≥ T ( λ , μ ) .
For the three standard continuous t-norms this becomes
T Lower bound for d T ( R ) T M min { λ , μ } T P λ μ T Ł max { λ + μ − 1 , 0 } .
Thus a relation that is uniformly very similar to one with a high transitivity index must itself have a controlled lower bound on its index.
The next two propositions show that the index behaves naturally under inversion and restriction.
Proposition 8. 
For a fuzzy relation R on X, define R − 1 ( x , y ) = R ( y , x ) . Then d T ( R − 1 ) = d T ( R ) .
Proof. 
If S ∈ T ( X ) , then for all x , y , z ∈ X ,
T ( S − 1 ( x , y ) , S − 1 ( y , z ) ) = T ( S ( y , x ) , S ( z , y ) ) = T ( S ( z , y ) , S ( y , x ) ) ≤ S ( z , x ) = S − 1 ( x , z ) ,
so S − 1 ∈ T ( X ) . Moreover, E X 2 ( S − 1 , R − 1 ) = E X 2 ( S , R ) .
Since S ↦ S − 1 is a bijection of T ( X ) , d T ( R − 1 ) = ⋁ S ∈ T ( X ) E X 2 ( S , R ) = d T ( R ) .  □
Proposition 9. 
Let Y ⊆ X and denote by R | Y the restriction of R to Y × Y . Then d T ( R | Y ) ≥ d T ( R ) .
Proof. 
For S ∈ T ( X ) , the restriction S | Y is T-transitive on Y and
E Y 2 ( S | Y , R | Y ) = ⋀ x , y ∈ Y S ( x , y ) ↔ T R ( x , y ) ≥ E X 2 ( S , R ) .
Hence
d T ( R | Y ) ≥ E Y 2 ( S | Y , R | Y ) ≥ E X 2 ( S , R ) .
Taking the supremum over S ∈ T ( X ) proves the result.  □
Thus every restriction provides an upper bound for the transitivity index of the full relation.
Finally, the upper transitive closure gives a concrete lower bound.
Proposition 10. 
Let cl T ( R ) = ⋀ { S ∈ T ( X ) : R ≤ S } . Then cl T ( R ) is the smallest T-transitive fuzzy relation containing R, and d T ( R ) ≥ E X 2 R , cl T ( R ) .
Proof. 
The constant-1 relation is T-transitive and contains R, so the defining family is nonempty. Let { S i } i ∈ I ⊆ T ( X ) and put S = ⋀ i S i pointwise. For every fixed j ∈ I ,
T ( S ( x , y ) , S ( y , z ) ) ≤ T ( S j ( x , y ) , S j ( y , z ) ) ≤ S j ( x , z ) .
Taking the infimum over j gives T ( S ( x , y ) , S ( y , z ) ) ≤ S ( x , z ) , so arbitrary pointwise infima of T-transitive relations remain T-transitive. Therefore cl T ( R ) is the smallest T-transitive relation above R. Since it belongs to T ( X ) ,
d T ( R ) ≥ E X 2 cl T ( R ) , R = E X 2 R , cl T ( R ) .
□
This result supplies an explicit lower bound whenever the upper T-transitive closure can be constructed or estimated.

4. The Relationship Between d T ( R ) and α T ( R )

The two quantities evaluate different aspects of approximate transitivity. The degree α T ( R ) is determined by the least satisfied triplewise transitivity condition, whereas d T ( R ) measures the best uniform fuzzy-equality level obtainable over the exact class T ( X ) . We first show that the latter always dominates the former.
Proposition 11. 
Let T be a continuous t-norm and let R be a fuzzy relation on X. Then α T ( R ) ≤ d T ( R ) .
Proof. 
By Propositions 2 and 3, the relation R ( T , α T ( R ) ) is T-transitive and
E X 2 R , R ( T , α T ( R ) ) ≥ α T ( R ) .
Consequently,
d T ( R ) = ⋁ S ∈ T ( X ) E X 2 ( S , R ) ≥ E X 2 R ( T , α T ( R ) ) , R ≥ α T ( R ) .
□
The inequality can be strict, as the following examples show.
Example 3. 
Let T = T Ł , X = { x , y , z } , and
S = 1 0.27 0.72 0.27 1 0.54 0.72 0.54 1 , R = 1 0.3 0.8 0.3 1 0.6 0.8 0.6 1 .
The relation S is T Ł -transitive. Direct calculation gives
α T Ł ( R ) = 0.9 , E X 2 ( S , R ) = 0.92 .
Hence
α T Ł ( R ) = 0.9 < 0.92 ≤ d T Ł ( R ) .
Example 4. 
Let T = T P , X = { x , y , z } , and
S = 1 0.2 0.52 0.2 1 0.38 0.52 0.38 1 , R = 1 0.3 0.8 0.3 1 0.6 0.8 0.6 1 .
The relation S is product-transitive, and
α T P ( R ) = 0.625 , E X 2 ( S , R ) = 19 30 .
Therefore
α T P ( R ) = 0.625 < 19 30 ≤ d T P ( R ) .
The strict inequalities in Examples 3 and 4 raise a natural structural question: does there exist a continuous t-norm for which α T ( R ) = d T ( R ) holds for every fuzzy relation? To answer this question for non-Gödel t-norms, we first record the behavior of the residual implication inside an Archimedean ordinal sum component.
Lemma 1. 
Let T be a continuous t-norm, and let [ a , b ] , ϕ, and T * ∈ { T P , T Ł } be as in Proposition 1. For u , v ∈ [ a , b ] ,
u → T v = 1 , u ≤ v , ϕ − 1 ϕ ( u ) → T * ϕ ( v ) , u > v ,
and
u ↔ T v = 1 , u = v , ϕ − 1 ϕ ( u ) ↔ T * ϕ ( v ) , u ≠ v .
Proof. 
If u ≤ v , then u → T v = 1 by Equation (2). Suppose that u > v . Put
q = ϕ − 1 ϕ ( u ) → T * ϕ ( v ) .
Because ϕ ( u ) > ϕ ( v ) , the residual value ϕ ( u ) → T * ϕ ( v ) is strictly less than 1, hence q < b . For t ∈ [ a , b ] , the ordinal sum representation and adjointness for T * give
T ( u , t ) ≤ v ⟺ T * ( ϕ ( u ) , ϕ ( t ) ) ≤ ϕ ( v ) ⟺ ϕ ( t ) ≤ ϕ ( u ) → T * ϕ ( v ) ⟺ t ≤ q .
If t < a , then T ( u , t ) = t ≤ a ≤ v , while if t > b , the ordinal sum operation gives T ( u , t ) = u > v . Thus the supremum of all t satisfying T ( u , t ) ≤ v is exactly q, proving the residual formula. The bi-implication formula follows because one of the two residuals equals 1 when u ≠ v , while both equal 1 when u = v .  □
Proposition 12. 
Let T be a continuous t-norm. The following are equivalent:
(i) 
α T ( R ) = d T ( R ) for every fuzzy relation R on every universe X;
(ii) 
T = T M .
Proof. 
(ii)⇒(i).
Assume T = T M . Proposition 11 gives α T M ( R ) ≤ d T M ( R ) .
If R is T M -transitive, both sides equal 1. Suppose that R is not T M -transitive and put a = α T M ( R ) .
For every violated triple ( x , y , z ) , min { R ( x , y ) , R ( y , z ) } > R ( x , z ) .
For the Gödel residuum, the satisfaction degree of such a triple is exactly its consequent R ( x , z ) , whereas every nonviolated triple contributes 1. Hence
a = ⋀ x , y , z ∈ X min { R ( x , y ) , R ( y , z ) } > R ( x , z ) R ( x , z ) .
Let S be any T M -transitive relation and consider an arbitrary violated triple. Set r = R ( x , z ) . We show that E X 2 ( S , R ) ≤ r .
If instead E X 2 ( S , R ) > r , then, because R ( x , y ) > r and R ( y , z ) > r , the formula for the Gödel bi-implication implies S ( x , y ) > r , S ( y , z ) > r .
At ( x , z ) , where R ( x , z ) = r , the inequality S ( x , z ) ↔ M r > r can hold only if S ( x , z ) = r : if S ( x , z ) ≠ r , the Gödel bi-implication equals min { S ( x , z ) , r } ≤ r . Consequently,
min { S ( x , y ) , S ( y , z ) } > r = S ( x , z ) ,
contradicting the T M -transitivity of S. Thus E X 2 ( S , R ) ≤ r for every violated triple, so E X 2 ( S , R ) ≤ a . Taking the supremum over all T M -transitive S gives
d T M ( R ) ≤ a = α T M ( R ) .
Together with Proposition 11, this proves equality.
(i)⇒(ii). Suppose that T ≠ T M . By Proposition 1, T has a nontrivial Archimedean component [ a , b ] isomorphic either to T P or to T Ł via an order isomorphism ϕ : [ a , b ] → [ 0 , 1 ] .
First suppose that the component is of product type. On X = { 1 , 2 , 3 } , let
R 0 = 1 0.3 0.8 0.3 1 0.6 0.8 0.6 1 , S 0 = 1 0.2 0.52 0.2 1 0.38 0.52 0.38 1 .
As in Example 4, S 0 is product-transitive and α T P ( R 0 ) = 0.625 , E X 2 T P ( S 0 , R 0 ) = 19 30 .
Define lifted relations by R ( i , j ) = ϕ − 1 ( R 0 ( i , j ) ) , S ( i , j ) = ϕ − 1 ( S 0 ( i , j ) ) .
Because all entries lie in [ a , b ] , the component formula shows that S is T-transitive. By Lemma 1, nonviolated triples of R 0 contribute residual value 1 after lifting, while violated triples contribute the image under ϕ − 1 of their product-residual values. Since the minimum product-residual value is 0.625 < 1 , α T ( R ) = ϕ − 1 ( 0.625 ) .
Similarly, equal matrix entries contribute bi-implication 1 and unequal entries are transformed by ϕ − 1 ; hence E X 2 ( S , R ) = ϕ − 1 19 30 .
Therefore
α T ( R ) = ϕ − 1 ( 0.625 ) < ϕ − 1 19 30 = E X 2 ( S , R ) ≤ d T ( R ) .
If the component is of Łukasiewicz type, use
R 0 = 1 0.3 0.8 0.3 1 0.6 0.8 0.6 1 , S 0 = 1 0.27 0.72 0.27 1 0.54 0.72 0.54 1 .
By Example 3, S 0 is T Ł -transitive and α T Ł ( R 0 ) = 0.9 , E X 2 T Ł ( S 0 , R 0 ) = 0.92 .
The same lifting argument gives
α T ( R ) = ϕ − 1 ( 0.9 ) < ϕ − 1 ( 0.92 ) = E X 2 ( S , R ) ≤ d T ( R ) .
Thus, whenever T ≠ T M , there exists a fuzzy relation for which α T ( R ) < d T ( R ) . This contradicts (i), and therefore T = T M .  □
The following numerical example illustrates what the inequality α T ( R ) < d T ( R ) can mean without claiming that a displayed transitive relation is an optimizer.
Example 5. 
Let T = T P , X = { x , y , z } , and
R = 1 0.288 0.75 0.288 1 0.75 0.75 0.75 1 .
Since R ( x , z ) R ( z , y ) = 0.75 · 0.75 = 0.5625 > 0.288 = R ( x , y ) ,
R is not product-transitive. The most severe violated constraint gives
α T P ( R ) = 0.288 0.5625 = 0.512 .
Now consider
S = 1 9 25 3 5 9 25 1 3 5 3 5 3 5 1 .
The relation S is product-transitive because ( 3 / 5 ) 2 = 9 / 25 . Moreover,
E X 2 ( S , R ) = 4 5 .
Consequently,
α T P ( R ) = 0.512 < 0.8 = E X 2 ( S , R ) ≤ d T P ( R ) .
This calculation proves a lower bound d T P ( R ) ≥ 0.8 ; it does not prove that the displayed S is a maximizing transitive relation or that d T P ( R ) = 0.8 . Its role is only to show that simultaneously modifying several entries can produce an exactly product-transitive relation with uniform fuzzy-equality level 0.8 , already higher than the traditional degree 0.512 . The example therefore illustrates the difference between a worst violated constraint and a uniform approximation to the transitive class, without interpreting E X 2 as the total amount of modification.

5. Conclusions

We introduced a fuzzy-equality-based index of T-transitivity for continuous t-norms. The index is best interpreted as a supremal uniform or maximin similarity to the exact class of T-transitive relations. The optimization ranges over the whole transitive class, but the equality functional is determined by the least coordinatewise similarity; accordingly, d T is not an average or total measure of the entries that must be changed.
We proved that d T ( R ) = 1 if and only if R is T-transitive, so the index is faithful to the exact property. We also established stability under fuzzy equality, invariance under inversion, monotonicity under restriction, and a lower bound obtained from the upper T-transitive closure. In addition, when the universe is finite, compactness of the transitive class together with upper semicontinuity of the equality functional shows that the supremum defining d T ( R ) is attained. For arbitrary universes, no general attainment claim is made.
The comparison with the traditional degree α T ( R ) shows that α T ( R ) ≤ d T ( R ) for every continuous t-norm. The two quantities have different interpretations: α T records the least satisfied triplewise transitivity constraint, whereas d T measures the best uniform fuzzy-equality level over exactly transitive relations. Product and Łukasiewicz examples demonstrate that the inequality may be strict. We further proved the characterization
α T ( R ) = d T ( R ) for every fuzzy relation on every universe ⟺ T = T M .
Thus the Gödel t-norm is the unique continuous t-norm for which the local worst-constraint degree and the uniform approximation index coincide universally.
The present contribution is theoretical. Future work may develop algorithms for evaluating or approximating d T ( R ) on finite universes, study their computational complexity, investigate uniqueness and structure of maximizing transitive approximations in cases where maximizers exist, and extend the construction to broader classes of residuated operations. The index may also provide a basis for future studies of noisy preference, similarity, clustering, or recommendation relations, but such applications require separate computational and empirical analysis.

Funding

This research was funded by the Introduced Talent Research Start up Funds of Chengdu Technological University (Grant No. 2023RC024).

Data Availability Statement

The original contributions presented in the study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

OpenAI’s ChatGPT 5.5 was used as an assistive tool for English-language editing and structural organization. The AI tool was mainly used to improve the clarity, readability, organization, and academic English of the manuscript. All AI-assisted material was carefully reviewed, revised, and approved by the author.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Zadeh, L.A. Similarity relations and fuzzy orderings. Inf. Sci. 1971, 3, 177–200. [Google Scholar] [CrossRef] [Scilit]
  2. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Scilit]
  3. Boixader, D.; Recasens, J. Approximate fuzzy preorders and equivalences. In Proceedings of the 2009 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2009), Jeju Island, Republic of Korea, 20–24 August 2009; pp. 564–568. [Google Scholar] [CrossRef] [Scilit]
  4. Boixader, D.; Recasens, J. Approximating fuzzy preorders and equivalences. A similarity based approach. In Proceedings of the 2010 IEEE International Conference on Fuzzy Systems, Barcelona, Spain, 18–23 July 2010; pp. 1–6. [Google Scholar] [CrossRef] [Scilit]
  5. Valverde, L. On the structure of F-indistinguishability operators. Fuzzy Sets Syst. 1985, 17, 313–328. [Google Scholar] [CrossRef] [Scilit]
  6. Boixader, D.; Recasens, J. Introducing strong T-transitivity in approximate fuzzy preorders and equivalences. In Proceedings of the 2010 Annual Meeting of the North American Fuzzy Information Processing Society, Toronto, ON, Canada, 12–14 July 2010. [Google Scholar] [CrossRef] [Scilit]
  7. He, X.; Li, Y.; Qin, K.; Meng, D. On the TL-transitivity of fuzzy similarity measures. Fuzzy Sets Syst. 2017, 322, 54–69. [Google Scholar] [CrossRef] [Scilit]
  8. Armengol, E.; Boixader, D.; García-Cerdaña, À.; Recasens, J. T-generable indistinguishability operators and their use for feature selection and classification. Fuzzy Sets Syst. 2019, 360, 33–48. [Google Scholar] [CrossRef] [Scilit]
  9. Recasens, J. Fifty years of similarity relations: A survey of foundations and applications. Int. J. Gen. Syst. 2022, 51, 126–184. [Google Scholar] [CrossRef] [Scilit]
  10. Běhounek, L. Extensionality in graded properties of fuzzy relations. In Proceedings of the 11th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2006), Paris, France, 2–7 July 2006; pp. 1604–1611. [Google Scholar]
  11. Dan, Y.; Hu, B.Q.; Qiao, J. Some results on the degree of symmetry of fuzzy relations. Fuzzy Sets Syst. 2019, 360, 1–32. [Google Scholar] [CrossRef] [Scilit]
  12. Gottwald, S. Fuzzified fuzzy relations. In Proceedings of the 4th IFSA Congress, Mathematics, Brussels, Belgium, 7–12 July 1991; pp. 82–86. [Google Scholar]
  13. Boixader, D.; Recasens, J. On the degree of transitivity of a fuzzy relation. Fuzzy Sets Syst. 2022, 440, 1–20. [Google Scholar] [CrossRef] [Scilit]
  14. Bejines, C.; Ardanza-Trevijano, S.; Chasco, M.J.; Elorza, J. Aggregation of indistinguishability operators. Fuzzy Sets Syst. 2022, 446, 53–67. [Google Scholar] [CrossRef] [Scilit]
  15. Calvo Sánchez, T.; Fuster-Parra, P.; Valero, O. The aggregation of transitive fuzzy relations revisited. Fuzzy Sets Syst. 2022, 446, 243–260. [Google Scholar] [CrossRef] [Scilit]
  16. González-Hedström, J.D.D.; Miñana, J.J.; Valero, O. Fuzzy preorders and generalized distances: The aggregation problem revisited. Fuzzy Sets Syst. 2024, 474, 108760. [Google Scholar] [CrossRef] [Scilit]
  17. Boixader, D.; Recasens, J. Localization relations. Fuzzy Sets Syst. 2024, 484, 108929. [Google Scholar] [CrossRef] [Scilit]
  18. Klement, E.P.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar] [CrossRef] [Scilit]
  19. Rosenthal, K.I. Quantales and Their Applications; Longman Scientific & Technical: Essex, UK, 1990. [Google Scholar]
  20. Recasens, J. Indistinguishability Operators: Modelling Fuzzy Equalities and Fuzzy Equivalence Relations; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2011; Volume 260. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.