Web-geometric approach to models of fuzzy logic Milan Petr k Peter - - PowerPoint PPT Presentation

web geometric approach to models of fuzzy logic
SMART_READER_LITE
LIVE PREVIEW

Web-geometric approach to models of fuzzy logic Milan Petr k Peter - - PowerPoint PPT Presentation

Web-geometric approach to models of fuzzy logic Milan Petr k Peter Sarkoci Department of Mathematics and Descriptive Geometry Faculty of Civil Engineering, Slovak University of Technology Radlinsk eho 11, 813 68 Bratislava, Slovakia


slide-1
SLIDE 1

Web-geometric approach to models of fuzzy logic

Milan Petr´ ık Peter Sarkoci

Department of Mathematics and Descriptive Geometry Faculty of Civil Engineering, Slovak University of Technology Radlinsk´ eho 11, 813 68 Bratislava, Slovakia

Mathematical Structures for Non-standard Logics, Prague, Czech Republic, 2009

1 / 17

slide-2
SLIDE 2

Outline

1

Definitions

2

Rectangles and relations

3

Associativity of local togmas

4

Corollaries

2 / 17

slide-3
SLIDE 3

Definitions

magma (G, ∗) . . . a set G with an operation ∗: G × G → G togma (G, ∗, ≤) (totally ordered magma)

(G, ∗) ... magma (G, ≤) ... chain ∀x, y, z ∈ G: x ≤ y ⇒ x ∗ z ≤ y ∗ z

monoid (G, ∗, 1, ≤)

(G, ∗) ... magma ∗ ... associative 1 ... neutral element

tomonoid (G, ∗, 1, ≤) (totally ordered monoid)

(G, ∗, 1) ... monoid (G, ≤) ... chain

3 / 17

slide-4
SLIDE 4

Definitions

(A, ≤A), (B, ≤B) . . . chains f : A → B . . . non-decreasing surjection we define inverse of f: f −1 : B → P(A): y → {x ∈ A | f(x) = y} we extend f to sets: f(M) =

  • x∈M

f(x) for some M ⊆ A f(f −1(x)) = x ∀x ∈ A

4 / 17

slide-5
SLIDE 5

Definitions

(G, ∗, ≤) . . . togma left section at v ∈ G:

vg: G → G: x → x ∗ v

right section at u ∈ G: gu : G → G: y → u ∗ y local operation ⊛ at (u, v) ∈ G2: ⊛: (x, y) → vg−1(x) ∗ g−1

u (y)

⊛ is defined on H ⊆ G ⇔ ∀x, y ∈ H: x ⊛ y makes sense ⊛ is closed on H ⊆ G ⇔ ∀x, y ∈ H: x ⊛ y ⊆ H ⊛ is single-valued on H ⊆ G ⇔ ∀x, y ∈ H: x ⊛ y is a singleton

5 / 17

slide-6
SLIDE 6

Definitions

Definition of local togma (G, ∗, ≤) . . . togma (H, ⊛, ≤) . . . local togma of (G, ∗, ≤) at (u, v) ∈ G2 on H ⊆ G if ⊛ is the local operation at (u, v) and ⊛ is defined, closed, and single-valued on H

6 / 17

slide-7
SLIDE 7

Computing x ⊛ y = vg−1(x) ∗ gu−1(y):

  • G

G

7 / 17

slide-8
SLIDE 8

Computing x ⊛ y = vg−1(x) ∗ gu−1(y):

  • u

v G G

7 / 17

slide-9
SLIDE 9

Computing x ⊛ y = vg−1(x) ∗ gu−1(y):

  • u

v

vg

gu G G

7 / 17

slide-10
SLIDE 10

Computing x ⊛ y = vg−1(x) ∗ gu−1(y):

  • u

v x y

vg

gu G G

7 / 17

slide-11
SLIDE 11

Computing x ⊛ y = vg−1(x) ∗ gu−1(y):

  • u

v x y

vg

gu

vg−1(x)

gu

−1(y)

G G

7 / 17

slide-12
SLIDE 12

Computing x ⊛ y = vg−1(x) ∗ gu−1(y):

  • u

v x y x ⊛ y

vg

gu

vg−1(x)

gu

−1(y)

G G

7 / 17

slide-13
SLIDE 13

Computing x ⊛ y = vg−1(x) ∗ gu−1(y):

  • u

v x y x ⊛ y x y

vg

gu

vg−1(x)

gu

−1(y)

G G

7 / 17

slide-14
SLIDE 14

Computing x ⊛ y = vg−1(x) ∗ gu−1(y):

  • u

v x y x y x ⊛ y

vg

gu

vg−1(x)

gu

−1(y)

G G

7 / 17

slide-15
SLIDE 15

Computing x ⊛ y = vg−1(x) ∗ gu−1(y):

  • u

v x y

vg

gu G G

8 / 17

slide-16
SLIDE 16

Computing x ⊛ y = vg−1(x) ∗ gu−1(y):

  • u

v x y

vg

gu

vg−1(x)

gu

−1(y)

G G

8 / 17

slide-17
SLIDE 17

Computing x ⊛ y = vg−1(x) ∗ gu−1(y):

  • u

v x y x ⊛ y

vg

gu

vg−1(x)

gu

−1(y)

G G

8 / 17

slide-18
SLIDE 18

Properties of local togma

Observations: (G, ∗, ≤) . . . togma (H, ⊛, ≤) . . . local togma of (G, ∗, ≤) at (u, v) ∈ G2 on H ⊆ G u ∗ v is the neutral element of ⊛ ∗ is commutative ⇒ ⊛ is commutative ∗ is associative ⇒ ⊛ is associative

9 / 17

slide-19
SLIDE 19

Outline

1

Definitions

2

Rectangles and relations

3

Associativity of local togmas

4

Corollaries

10 / 17

slide-20
SLIDE 20

Rectangles and relations

(G, ∗, ≤) . . . togma rectangle P = {a, b} × {c, d} ⊂ G2 pair of rectangles P, R is (u, v)-local if: P = {a, b} × {c, v} R = {e, u} × {g, h} (where a, b, c, e, g, h ∈ G) P, R are equivalent . . . P ≅∗ R

functional values at the corresponding pairs of vertices are equal

P, R are strongly aligned according to (u, v) ∈ G2 . . . P ≃uv

∗ R

functional values at the corresponding pairs of vertices are equal, except of the pair (a, c), (e, g)

intention: to show that P ≃uv

∗ R ⇒ P ≅∗ R is related to the

associativity of local togmas

11 / 17

slide-21
SLIDE 21

Rectangles and relations

Rectangle P = {a, b} × {c, d} ⊂ G2 a b c d P G G

11 / 17

slide-22
SLIDE 22

Rectangles and relations

(G, ∗, ≤) . . . togma rectangle P = {a, b} × {c, d} ⊂ G2 pair of rectangles P, R is (u, v)-local if: P = {a, b} × {c, v} R = {e, u} × {g, h} (where a, b, c, e, g, h ∈ G) P, R are equivalent . . . P ≅∗ R

functional values at the corresponding pairs of vertices are equal

P, R are strongly aligned according to (u, v) ∈ G2 . . . P ≃uv

∗ R

functional values at the corresponding pairs of vertices are equal, except of the pair (a, c), (e, g)

intention: to show that P ≃uv

∗ R ⇒ P ≅∗ R is related to the

associativity of local togmas

11 / 17

slide-23
SLIDE 23

Rectangles and relations

Pair of (u, v)-local rectangles P, R u v P R G G

11 / 17

slide-24
SLIDE 24

Rectangles and relations

(G, ∗, ≤) . . . togma rectangle P = {a, b} × {c, d} ⊂ G2 pair of rectangles P, R is (u, v)-local if: P = {a, b} × {c, v} R = {e, u} × {g, h} (where a, b, c, e, g, h ∈ G) P, R are equivalent . . . P ≅∗ R

functional values at the corresponding pairs of vertices are equal

P, R are strongly aligned according to (u, v) ∈ G2 . . . P ≃uv

∗ R

functional values at the corresponding pairs of vertices are equal, except of the pair (a, c), (e, g)

intention: to show that P ≃uv

∗ R ⇒ P ≅∗ R is related to the

associativity of local togmas

11 / 17

slide-25
SLIDE 25

Rectangles and relations

Equivalent rectangles P, R . . . P ≅∗ R P R G G ∗

11 / 17

slide-26
SLIDE 26

Rectangles and relations

(G, ∗, ≤) . . . togma rectangle P = {a, b} × {c, d} ⊂ G2 pair of rectangles P, R is (u, v)-local if: P = {a, b} × {c, v} R = {e, u} × {g, h} (where a, b, c, e, g, h ∈ G) P, R are equivalent . . . P ≅∗ R

functional values at the corresponding pairs of vertices are equal

P, R are strongly aligned according to (u, v) ∈ G2 . . . P ≃uv

∗ R

functional values at the corresponding pairs of vertices are equal, except of the pair (a, c), (e, g)

intention: to show that P ≃uv

∗ R ⇒ P ≅∗ R is related to the

associativity of local togmas

11 / 17

slide-27
SLIDE 27

Rectangles and relations

Rectangles P, R, strongly aligned according to (u, v) . . . P ≃uv

∗ R

u v P R G G ∗

11 / 17

slide-28
SLIDE 28

Rectangles and relations

(G, ∗, ≤) . . . togma rectangle P = {a, b} × {c, d} ⊂ G2 pair of rectangles P, R is (u, v)-local if: P = {a, b} × {c, v} R = {e, u} × {g, h} (where a, b, c, e, g, h ∈ G) P, R are equivalent . . . P ≅∗ R

functional values at the corresponding pairs of vertices are equal

P, R are strongly aligned according to (u, v) ∈ G2 . . . P ≃uv

∗ R

functional values at the corresponding pairs of vertices are equal, except of the pair (a, c), (e, g)

intention: to show that P ≃uv

∗ R ⇒ P ≅∗ R is related to the

associativity of local togmas

11 / 17

slide-29
SLIDE 29

Outline

1

Definitions

2

Rectangles and relations

3

Associativity of local togmas

4

Corollaries

12 / 17

slide-30
SLIDE 30

Main result

Theorem: (G, ∗, ≤) . . . togma (H, ⊛, ≤) . . . local togma of (G, ∗, ≤) at (u, v) ∈ G2 Ω = vg−1(H) × g−1

u (H)

Then the following statements are equivalent:

⊛ is associative ... and thus (H, ⊛, ≤) is a tomonoid every pair of (u, v)-local rectangles P, R satisfies P ≃uv

∗ R ⇒ P ≅∗ R

13 / 17

slide-31
SLIDE 31

(x ⊛ y) ⊛ z = x ⊛ (y ⊛ z) x ⊛ y = vg−1(x) ∗ gu−1(y) u v G G

14 / 17

slide-32
SLIDE 32

(x ⊛ y) ⊛ z = x ⊛ (y ⊛ z) x ⊛ y = vg−1(x) ∗ gu−1(y)

  • u

v

vg

gu G G

14 / 17

slide-33
SLIDE 33

(x ⊛ y) ⊛ z = x ⊛ (y ⊛ z) x ⊛ y = vg−1(x) ∗ gu−1(y)

  • u

v x y y z x y z

vg

gu G G

14 / 17

slide-34
SLIDE 34

(x ⊛ y) ⊛ z = x ⊛ (y ⊛ z) x ⊛ y = vg−1(x) ∗ gu−1(y)

  • u

v x y y z x y z

vg

gu G G

14 / 17

slide-35
SLIDE 35

(x ⊛ y) ⊛ z = x ⊛ (y ⊛ z) x ⊛ y = vg−1(x) ∗ gu−1(y)

  • u

v x y y z x ⊛ y x y z x ⊛ y

vg

gu G G

14 / 17

slide-36
SLIDE 36

(x ⊛ y) ⊛ z = x ⊛ (y ⊛ z) x ⊛ y = vg−1(x) ∗ gu−1(y)

  • u

v x y y z x ⊛ y y ⊛ z x y z x ⊛ y y ⊛ z

vg

gu G G

14 / 17

slide-37
SLIDE 37

(x ⊛ y) ⊛ z = x ⊛ (y ⊛ z) x ⊛ y = vg−1(x) ∗ gu−1(y)

  • u

v x y y z x ⊛ y y ⊛ z x y z x ⊛ y y ⊛ z

vg

gu G G

14 / 17

slide-38
SLIDE 38

(x ⊛ y) ⊛ z = x ⊛ (y ⊛ z) x ⊛ y = vg−1(x) ∗ gu−1(y)

  • u

v x y y z x ⊛ y y ⊛ z x y z x ⊛ y y ⊛ z (x ⊛ y) ⊛ z x ⊛ (y ⊛ z)

vg

gu G G

14 / 17

slide-39
SLIDE 39

Outline

1

Definitions

2

Rectangles and relations

3

Associativity of local togmas

4

Corollaries

15 / 17

slide-40
SLIDE 40

Corollaries

Proposition: (G, ∗, 1, ≤) . . . togma with neutral element 1 local togma at (1, 1) is actually the togma (G, ∗, 1, ≤) itself Corollary: (G, ∗, 1, ≤) is tomonoid if and only if: P ≃11

∗ R

⇒ P ≅∗ R for every pair of (1, 1)-local rectangles P, R

16 / 17

slide-41
SLIDE 41

Corollaries

Proposition: (G, ∗, 1, ≤) . . . integral togma (u, v) ∈ G2 . . . point

vg: x → x ∗ v is surjection to ↓{v}

gu : y → u ∗ y is surjection to ↓{u}

a local togma can be defined at (u, v) ∈ G2 on H =↓{u ∗ v} Corollary: (G, ∗, 1, ≤) is integral tomonoid if and only if: P ≃uv

∗ R

⇒ P ≅∗ R for every pair of (u, v)-local rectangles P, R ⊂ G2 in Ω = vg−1(H) × g−1

u (H) = ↓{u}×↓{v}

17 / 17