Unit 3

Fuzzy Relations

Module FUZ; Ulrich Bodenhofer 71

 Motivation

Fuzzy relations and operations on fuzzy relations are the key to the
thorough understanding of fuzzy inference. Their study, therefore,
is indispensable.

We start with a short overview of classical relations in order to un-

derstand the background.

Module FUZ; Ulrich Bodenhofer 72

 Classical Relations

Let X and Y be non-empty sets. A subset R of the Cartesian

product X × Y is called a relation from X to Y . If (x, y) ∈ R, for
some pair (x, y), we say that x is R-related to y.

If X = Y , i.e. R is a subset of X × X = X 2 , we say that R is a

binary relation on X.

If, for any x ∈ X, there is exactly one y ∈ Y such that (x, y) ∈ R,

we call R a function from X to Y .

Module FUZ; Ulrich Bodenhofer 73

 Example 1: “Owning Cars”

X = {Alice, Bob, Christine, Daniel, Eva, Martin, Sylvia, Thomas}

Y = {BMW 3, Chrysler Voyager, Ford Focus, Mazda 6, Mercedes C, Opel Vectra, Toyota Corolla,
Volvo V40, VW Passat}

Chrysler Voyager

Toyota Corolla
Mercedes C

Opel Vectra
Ford Focus

VW Passat
Volvo V40
Mazda 6
BMW 3

Alice 1 0 0 0 0 0 0 0 0
Bob 0 0 0 1 0 0 0 0 0
Christine 0 0 0 0 0 0 0 1 0
Daniel 0 1 1 0 0 0 0 0 0
Eva 0 0 0 1 0 0 0 0 0
Martin 1 0 0 0 0 0 0 0 0
Sylvia 0 0 1 0 0 0 0 0 1
Thomas 0 0 1 0 1 0 0 0 0

Module FUZ; Ulrich Bodenhofer 74

 Example 2: “Having a Relationship”

X = Y = {Alice, Bob, Christine, Daniel, Eva, Martin, Sylvia, Thomas}

Christine

Thomas
Daniel

Martin

Sylvia
Alice

Bob

Eva
Alice 0 0 0 0 0 0 0 1
Bob 0 0 0 0 0 0 0 0
Christine 0 0 0 1 0 1 0 0
Daniel 0 0 1 0 0 0 0 0
Eva 0 0 0 0 0 0 0 0
Martin 0 0 1 0 0 0 1 0
Sylvia 0 0 0 0 0 1 0 0
Thomas 1 0 0 0 0 0 0 0

Module FUZ; Ulrich Bodenhofer 75

 Example 3: “Close To”

X = Y = {1, . . . , 8}
1 2 3 4 5 6 7 8
1 1 1 0 0 0 0 0 0
2 1 1 1 0 0 0 0 0
3 0 1 1 1 0 0 0 0
4 0 0 1 1 1 0 0 0
5 0 0 0 1 1 1 0 0
6 0 0 0 0 1 1 1 0
7 0 0 0 0 0 1 1 1
8 0 0 0 0 0 0 1 1

Module FUZ; Ulrich Bodenhofer 76

 Example 4: “Equality”

X = Y = {1, . . . , 8}
1 2 3 4 5 6 7 8
1 1 0 0 0 0 0 0 0
2 0 1 0 0 0 0 0 0
3 0 0 1 0 0 0 0 0
4 0 0 0 1 0 0 0 0
5 0 0 0 0 1 0 0 0
6 0 0 0 0 0 1 0 0
7 0 0 0 0 0 0 1 0
8 0 0 0 0 0 0 0 1

Module FUZ; Ulrich Bodenhofer 77

 Set Operations on Relations

Let R and Q be relations from X to Y .

Intersection R ∩ Q: x is R ∩ Q-related to y if x is R-related to y and x is
Q-related to y
Union R ∪ Q: x is R∪Q-related to y if x is R-related to y or x is Q-related
to y
Complement {R: x is {R-related to y if x is not R-related to y
Inclusion: we say R ⊆ Q if (x, y) ∈ R always implies (x, y) ∈ Q
Inversion: if R is a binary relation on X, the inverse is defined as

R−1 = {(x, y) | (y, x) ∈ R}.

Module FUZ; Ulrich Bodenhofer 78

 Composition of Relations

Let R be a relation from X to Y and Q be a relation from Y to Z.

The composition R ◦ Q is defined as a relation from X to Z in the
following way:

R ◦ Q = {(x, z) | there is a y ∈ Y such that

(x, y) ∈ R and (y, z) ∈ Q}

Module FUZ; Ulrich Bodenhofer 79

 Example

X = {a, b, c}, Y = {r, s, t, u}, Z = {x, y}

Q x y
R r s t u
r 0 0
a 1 0 1 0
s 1 0
b 1 1 0 0
t 1 1
c 0 0 0 1
u 0 1

R ◦ Q =?

Module FUZ; Ulrich Bodenhofer 80

 Properties of Binary Relations

Reflexivity: (x, x) ∈ R for all x ∈ X

Irreflexivity: (x, x) 6∈ R for all x ∈ X
Symmetry: if (x, y) ∈ R then (y, x) ∈ R for all x, y ∈ X
Asymmetry: if (x, y) ∈ R then (y, x) 6∈ R for all x, y ∈ X
Antisymmetry: if (x, y) ∈ R and (y, x) ∈ R then x = y
for all x, y ∈ X
Transitivity: if (x, y) ∈ R and (y, z) ∈ R then (x, z) ∈ R for all
x, y, z ∈ X
Completeness: for all x, y ∈ X, (x, y) ∈ R or (y, x) ∈ R

Module FUZ; Ulrich Bodenhofer 81

 Example 3: “Close To”

X = Y = {1, . . . , 8}
1 2 3 4 5 6 7 8
1 1 1 0 0 0 0 0 0
2 1 1 1 0 0 0 0 0
3 0 1 1 1 0 0 0 0
4 0 0 1 1 1 0 0 0
5 0 0 0 1 1 1 0 0
6 0 0 0 0 1 1 1 0
7 0 0 0 0 0 1 1 1
8 0 0 0 0 0 0 1 1

Which properties does this relation fulfill?

Module FUZ; Ulrich Bodenhofer 82

 Example 4: “Equality”

X = Y = {1, . . . , 8}
1 2 3 4 5 6 7 8
1 1 0 0 0 0 0 0 0
2 0 1 0 0 0 0 0 0
3 0 0 1 0 0 0 0 0
4 0 0 0 1 0 0 0 0
5 0 0 0 0 1 0 0 0
6 0 0 0 0 0 1 0 0
7 0 0 0 0 0 0 1 0
8 0 0 0 0 0 0 0 1

Which properties does this relation fulfill?

Module FUZ; Ulrich Bodenhofer 83

 Example 5: “At most as large as”

X = Y = {1, . . . , 8}
1 2 3 4 5 6 7 8
1 1 1 1 1 1 1 1 1
2 0 1 1 1 1 1 1 1
3 0 0 1 1 1 1 1 1
4 0 0 0 1 1 1 1 1
5 0 0 0 0 1 1 1 1
6 0 0 0 0 0 1 1 1
7 0 0 0 0 0 0 1 1
8 0 0 0 0 0 0 0 1

Which properties does this relation fulfill?

Module FUZ; Ulrich Bodenhofer 84

 Example 5: “Much smaller than”

X = Y = {1, . . . , 8}
1 2 3 4 5 6 7 8
1 0 0 0 0 1 1 1 1
2 0 0 0 0 0 1 1 1
3 0 0 0 0 0 0 1 1
4 0 0 0 0 0 0 0 1
5 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0
7 0 0 0 0 0 0 0 0
8 0 0 0 0 0 0 0 0

Which properties does this relation fulfill?

Module FUZ; Ulrich Bodenhofer 85

 Special Types of Binary Relations

Preordering:
reflexive and transitive
Weak Ordering:
reflexive, transitive, and complete
Equivalence Relation:
reflexive, symmetric, and transitive
Ordering:
reflexive, antisymmetric, and transitive
Linear Ordering:
reflexive, antisymmetric, transitive, and complete
Strict Ordering:
irreflexive, asymmetric, and transitive

Module FUZ; Ulrich Bodenhofer 86

 Some Basic Results

R is transitive if and only if R ◦ R ⊆ R

R ∪ {(x, x) | x ∈ X} is reflexive
R ∩ {{(x, x) | x ∈ X} is irreflexive
R ∩ R−1 and R ∪ R−1 are symmetric
R ∩ {R−1 is asymmetric
R ∪ {R−1 is complete

Module FUZ; Ulrich Bodenhofer 87

 Fuzzy Relations

Let X and Y be non-empty sets. A fuzzy subset R of the Cartesian

product X ×Y is called a fuzzy relation from X to Y . For (x, y) ∈ R,
for some pair (x, y), µR (x, y) is the degree to which x is R-related
to y.

If X = Y , i.e. R is a fuzzy subset of X × X = X 2 , we say that R is

a binary fuzzy relation on X.

Module FUZ; Ulrich Bodenhofer 88

 Set Operations on Fuzzy Relations

Let R and Q be fuzzy relations from X to Y and let (T, S, N ) be a De

Morgan triple.


T -Intersection R ∩T Q: µR∩T Q (x, y) = T µR (x, y), µQ (x, y)


S-Union R ∪S Q: µR∪S S (x, y) = S µR (x, y), µQ (x, y)


N -Complement {N R: µ{N R (x, y) = N µR (x, y)
Inclusion: we say R ⊆ Q if and only if µR (x, y) ≤ µQ (x, y) for all (x, y) ∈
X ×Y
Inversion: µR−1 (x, y) = µR (y, x)

Module FUZ; Ulrich Bodenhofer 89

 Example 6: “Likes”

X = Y = {Alice, Bob, Christine, Daniel, Eva, Martin, Sylvia, Thomas}

Christine

Thomas
Daniel

Martin

Sylvia
Alice

Bob

Eva
Alice 1.0 0.0 0.0 0.3 0.5 0.1 0.0 1.0
Bob 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0
Christine 0.5 0.3 1.0 1.0 0.0 1.0 0.7 0.3
Daniel 0.3 0.2 1.0 1.0 0.5 0.0 0.2 0.5
Eva 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
Martin 0.8 0.8 1.0 0.9 0.4 0.9 1.0 0.6
Sylvia 0.2 0.3 0.5 0.5 0.4 1.0 0.9 0.0
Thomas 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0

Module FUZ; Ulrich Bodenhofer 90

 Composition of Relations

Let R be a fuzzy relation from X to Y and Q be a fuzzy relation from

Y to Z. The T -composition R ◦T Q is defined as a fuzzy relation
from X to Z in the following way:


µR◦T Q (x, y) = sup{T µR (x, y), µQ (y, z) | y ∈ Y }

Module FUZ; Ulrich Bodenhofer 91

 Example

X = {a, b, c}, Y = {r, s, t, u}, Z = {x, y}

Q x y
R r s t u
r 0.3 0.4
a 1.0 0.2 0.9 0.2
s 1.0 0.6
b 0.8 1.0 0.0 0.2
t 0.9 0.8
c 0.0 0.3 0.2 0.9
u 0.3 1.0

R ◦TM Q =? R ◦TL Q =?

Module FUZ; Ulrich Bodenhofer 92

 Properties of Binary Fuzzy Relations

Reflexivity: µR (x, x) = 1 for all x ∈ X

Irreflexivity: µR (x, x) = 0 for all x ∈ X
Symmetry: µR (x, y) = µR (y, x) for all x, y ∈ X
T -Asymmetry: T (µR (x, y), µR (y, x)) = 0 for all x, y ∈ X
T -Transitivity: T (µR (x, y), µR (y, z)) ≤ µR (x, z) for all x, y, z ∈ X
S-Completeness: S(µR (x, y), µR (y, x)) = 1 for all x, y ∈ X
Strong Completeness: max(µR (x, y), µR (y, x)) = 1 for all x, y ∈ X

Module FUZ; Ulrich Bodenhofer 93

 Example 4: “Similarity”

X = Y = {1, . . . , 8}

1 2 3 4 5 6 7 8
1 1.0 0.5 0.0 0.0 0.0 0.0 0.0 0.0
2 0.5 1.0 0.5 0.0 0.0 0.0 0.0 0.0
3 0.0 0.5 1.0 0.5 0.0 0.0 0.0 0.0
4 0.0 0.0 0.5 1.0 0.5 0.0 0.0 0.0
5 0.0 0.0 0.0 0.5 1.0 0.5 0.0 0.0
6 0.0 0.0 0.0 0.0 0.5 1.0 0.5 0.0
7 0.0 0.0 0.0 0.0 0.0 0.5 1.0 0.5
8 0.0 0.0 0.0 0.0 0.0 0.0 0.5 1.0

Which properties does this relation fulfill?

Module FUZ; Ulrich Bodenhofer 94

 Some Basic Results

Let (T, S, N ) be a De Morgan triple and let Ē denote the classical equality.
R is T -transitive if and only if R ◦T R ⊆ R
R ∪S Ē is reflexive
R ∩T {N Ē is irreflexive
R ∩T R−1 and R ∪S R−1 are symmetric
R ∩T {N R−1 is T -asymmetric if T (x, N (x)) = 0 holds (first law of
excluded middle)
R ∪S {N R−1 is strongly complete if S(x, N (x)) = 1 holds (second law
of excluded middle)

Module FUZ; Ulrich Bodenhofer 95

 Special Types of Binary Fuzzy Relations

T -Preordering:
reflexive and T -transitive
Weak T -Ordering:
reflexive, T -transitive, and strongly complete
T -Equivalence Relation:
reflexive, symmetric, and T -transitive
Strict T -Ordering:
irreflexive, T -asymmetric, and T -transitive

Module FUZ; Ulrich Bodenhofer 96

 Other Classes: Fuzzy Orderings

Given a t-norm T and a T -equivalence E on a non-empty domain X, a

fuzzy relation L on X is called T -E-ordering if and only if it is T -transitive
and has the following two properties for all x, y, z ∈ X:
E-Reflexivity: µE (x, y) ≤ µL (x, y)


T -E-Antisymmetry: T µL (x, y), µL (y, x) ≤ µE (x, y)

Module FUZ; Ulrich Bodenhofer 97

 Other Classes: Resemblance Relations

Given a distance measure d : X 2 → R+ 0 on a non-empty domain X, a

fuzzy relation R on X is called d-resemblance relation if and only if it is
reflexive and symmetric and has the following property for all x, y, r, s ∈
X:
Compatibility: d(x, y) ≤ d(r, s) implies µR (x, y) ≥ µR (r, s)

Module FUZ; Ulrich Bodenhofer 98

 Images and Preimages of Functions

Let f : X → Y be a function and A be a subset of X. Then the

image of A w.r.t. f is defined as follows:

f (A) = {y ∈ Y | there is an x ∈ A such that y = f (x)}

Let B be a subset of Y . Then the preimage of Y w.r.t. f is defined

as

f −1 (B) = {x ∈ X | there is a y ∈ B such that y = f (x)}.

Module FUZ; Ulrich Bodenhofer 99

 Images and Preimages of Relations

Let R be a relation from X to Y and A be a subset of X. Then the

image of A w.r.t. R is defined as follows:

R(A) = {y ∈ Y | there is an x ∈ A such that (x, y) ∈ R}

Let B be a subset of Y . Then the preimage of Y w.r.t. R is defined

as

R−1 (B) = {x ∈ X | there is a y ∈ B such that (x, y) ∈ R}.

Module FUZ; Ulrich Bodenhofer 100

 Example

X = {a, b, c}, Y = {r, s, t, u}, A = {a, b}, B = {r}

R r s t u
a 1 0 1 0
b 1 1 0 0
c 0 0 0 1

R(A) =? R−1 (B) =?

Module FUZ; Ulrich Bodenhofer 101

 General Method to Compute R(A)

Suppose that R is a relation from X to Y and that A is a subset of X.

1. Cylindric Extension: Define a dummy relation R0 from X to Y as

R0 = {(x, y) | x ∈ A};

2. Intersect: Compute an intermediate relation R00 = R ∩ R0 ;

3. Project R00 onto Y : Define a set B as

B = {y ∈ Y | there is an x ∈ X such that (x, y) ∈ R00 };

The set B is then exactly R(A).

Module FUZ; Ulrich Bodenhofer 102

 General Method to Compute R−1 (B)

Suppose that R is a relation from X to Y and that B is a subset of Y .

1. Cylindric Extension: Define a dummy relation R0 from X to Y as

R0 = {(x, y) | y ∈ B};

2. Intersect: Compute an intermediate relation R00 = R ∩ R0 ;

3. Project R00 onto X: Define a set A as

A = {x ∈ X | there is a y ∈ Y such that (x, y) ∈ R00 };

The set A is then exactly R−1 (B).

Module FUZ; Ulrich Bodenhofer 103

 Example

X = Y = {1, . . . , 8}, A = {4, 5, 7}

R 1 2 3 4 5 6 7 8
1 1 1 1 1 1 1 1 1
2 0 1 1 1 1 1 1 1
3 0 0 1 1 1 1 1 1
4 0 0 0 1 1 1 1 1
5 0 0 0 0 1 1 1 1
6 0 0 0 0 0 1 1 1
7 0 0 0 0 0 0 1 1
8 0 0 0 0 0 0 0 1

R(A) =?

Module FUZ; Ulrich Bodenhofer 104

 Step 1: Cylindric Extension R0

A = {4, 5, 7}
R0 1 2 3 4 5 6 7 8
1 0 0 0 0 0 0 0 0
2 0 0 0 0 0 0 0 0
3 0 0 0 0 0 0 0 0
4 1 1 1 1 1 1 1 1
5 1 1 1 1 1 1 1 1
6 0 0 0 0 0 0 0 0
7 1 1 1 1 1 1 1 1
8 0 0 0 0 0 0 0 0

Module FUZ; Ulrich Bodenhofer 105

 Step 2: Intersection R00 = R ∩ R0

R 1 2 3 4 5 6 7 8 R0 1 2 3 4 5 6 7 8
1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0
2 0 1 1 1 1 1 1 1 2 0 0 0 0 0 0 0 0
3 0 0 1 1 1 1 1 1 3 0 0 0 0 0 0 0 0
4 0 0 0 1 1 1 1 1 4 1 1 1 1 1 1 1 1
5 0 0 0 0 1 1 1 1 5 1 1 1 1 1 1 1 1
6 0 0 0 0 0 1 1 1 6 0 0 0 0 0 0 0 0
7 0 0 0 0 0 0 1 1 7 1 1 1 1 1 1 1 1
8 0 0 0 0 0 0 0 1 8 0 0 0 0 0 0 0 0

Module FUZ; Ulrich Bodenhofer 106

 Step 3: Projection of R00 onto Y

R00 1 2 3 4 5 6 7 8
1 0 0 0 0 0 0 0 0
2 0 0 0 0 0 0 0 0
3 0 0 0 0 0 0 0 0
4 0 0 0 1 1 1 1 1
5 0 0 0 0 1 1 1 1
6 0 0 0 0 0 0 0 0
7 0 0 0 0 0 0 1 1
8 0 0 0 0 0 0 0 0

R(A) = {4, 5, 6, 7, 8}

Module FUZ; Ulrich Bodenhofer 107

 Images and Preimages of Fuzzy Relations

Let R be a fuzzy relation from X to Y and A be a fuzzy subset of

X. Then the T -image of A w.r.t. R is defined as follows:

µRT (A) (y) = sup{T (µA (x), µR (x, y)) | x ∈ X}

Let B be a fuzzy subset of Y . Then the T -preimage of Y w.r.t. R is

defined as

µR−1 (B) (x) = sup{T (µR (x, y), µB (y)) | y ∈ Y }

T

Module FUZ; Ulrich Bodenhofer 108

 General Method to Compute RT (A)

Suppose that R is a fuzzy relation from X to Y and that A is a fuzzy set

on X.
1. Cylindric Extension: Define a dummy relation R0 from X to Y as

µR0 (x, y) = µA (x);

2. Intersect: Compute intermediate relation R00 = R ∩T R0 ;

3. Project R00 onto Y : Define a fuzzy set B as

µB (y) = sup{µR00 (x, y) | x ∈ X}

The set B is then exactly RT (A).

Module FUZ; Ulrich Bodenhofer 109

 General Method to Compute RT−1 (B)

Suppose that R is a fuzzy relation from X to Y and that B is a fuzzy set

on Y .
1. Cylindric Extension: Define a dummy relation R0 from X to Y as

µR0 (x, y) = µB (y);

2. Intersect: Compute intermediate relation R00 = R ∩T R0 ;

3. Project R00 onto X: Define a fuzzy set A as

µA (x) = sup{µR00 (x, y) | y ∈ Y }

The set A is then exactly RT−1 (B).

Module FUZ; Ulrich Bodenhofer 110

 Example

X = {a, b, c}, Y = {r, s, t, u}

y µB (y)
R r s t u x µA (x)
r 0.0
a 1.0 0.2 0.9 0.2 a 1.0
s 0.3
b 0.8 1.0 0.0 0.2 b 0.4
t 0.7
c 0.0 0.3 0.2 0.9 c 0.0
u 0.1

RTL (A) =? RT−1

L
(B) =?

Module FUZ; Ulrich Bodenhofer 111

 Example

X = Y = {1, . . . , 8}

R 1 2 3 4 5 6 7 8 x µA (x)
1 0.0 0.0 0.0 0.5 1.0 1.0 1.0 1.0 1 0.0
2 0.0 0.0 0.0 0.0 0.5 1.0 1.0 1.0 2 0.4
3 0.0 0.0 0.0 0.0 0.0 0.5 1.0 1.0 3 1.0
4 0.0 0.0 0.0 0.0 0.0 0.0 0.5 1.0 4 0.5
5 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.5 5 0.0
6 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 6 0.0
7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 7 0.0
8 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 8 0.0

RTM (A) =?

Module FUZ; Ulrich Bodenhofer 112

 Step 1: Cylindric Extension R0

x µA (x) R0 1 2 3 4 5 6 7 8
1 0.0 1 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
2 0.4 2 0.4 0.4 0.4 0.4 0.4 0.4 0.4 0.4
3 1.0 3 1.0 1.0 1.0 1.0 1.0 1.0 1.0 1.0
4 0.5 4 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5
5 0.0 5 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
6 0.0 6 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
7 0.0 7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
8 0.0 8 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0

Module FUZ; Ulrich Bodenhofer 113

 Step 2: Intersection R00 = R ∩TM R0

R00 1 2 3 4 5 6 7 8
1 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
2 0.0 0.0 0.0 0.0 0.4 0.4 0.4 0.4
3 0.0 0.0 0.0 0.0 0.0 0.5 1.0 1.0
4 0.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5
5 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
6 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
8 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0

Module FUZ; Ulrich Bodenhofer 114

 Step 3: Projection of R00 onto Y

R00 1 2 3 4 5 6 7 8 x µR
TM (A)
(x)

1 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1 0.0

2 0.0 0.0 0.0 0.0 0.4 0.4 0.4 0.4 2 0.0
3 0.0 0.0 0.0 0.0 0.0 0.5 1.0 1.0 3 0.0
4 0.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5 4 0.0
5 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 5 0.4
6 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 6 0.5
7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 7 1.0
8 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 8 1.0

Module FUZ; Ulrich Bodenhofer 115

 Graphical Representation of RT (A)

1
Output

Input

Module FUZ; Ulrich Bodenhofer 116

 Example with Infinite X

X=R
µE (x, y) = max(1 − |x − y|, 0)

1 if x ≤ y
µL (x, y) =
max(1 − x + y, 0) otherwise

E is a TL -equivalence; L is a TL -E-ordering;

Module FUZ; Ulrich Bodenhofer 117

 Graphical Representation of E and L

1 1

0.75 0.75

0.5 0.5
4 4
0.25 0.25
0 0
0 0
2 2
2 2

4 4
0 0

Module FUZ; Ulrich Bodenhofer 118

 Example: Fuzzy Set A

1
0.8
0.6
0.4
0.2

1 2 3 4 5

Module FUZ; Ulrich Bodenhofer 119

 Example: ETL (A)

1
0.8
0.6
0.4
0.2

1 2 3 4 5

Module FUZ; Ulrich Bodenhofer 120

 Example: LTL (A)

1
0.8
0.6
0.4
0.2

1 2 3 4 5

Module FUZ; Ulrich Bodenhofer 121

 Example: L−1
TL (A)

1
0.8
0.6
0.4
0.2

1 2 3 4 5

Module FUZ; Ulrich Bodenhofer 122