Example 2/24 8 Let R be a binary relation on Z defined by Mappings - - PowerPoint PPT Presentation

example
SMART_READER_LITE
LIVE PREVIEW

Example 2/24 8 Let R be a binary relation on Z defined by Mappings - - PowerPoint PPT Presentation

Example 2/24 8 Let R be a binary relation on Z defined by Mappings x R y if y = x 2 1 . Lectures 9 and 10 (Chapter 18) 3 On every vertical line exactly 1 point. 3 2 2 3 / department of mathematics and computer science /


slide-1
SLIDE 1

/ department of mathematics and computer science

Mappings

Lectures 9 and 10 (Chapter 18)

2/24 / department of mathematics and computer science

Example

Let R be a binary relation on Z defined by x R y if y = x2 1 . On every vertical line exactly 1 point.

3 2 2 3 3 8

3/24 / department of mathematics and computer science

Mapping (1)

The relation R between A and B is a mapping (function) if 8x[x 2 A : 91

y[y 2 B : x R y]

| {z }] at least one: 9y[y 2 B : x R y] ^ at most one: 8y1,y2[y1, y2 2 B : (x R y1 ^ x R y2) ) y1 = y2]

x = y2 y1

4/24 / department of mathematics and computer science

Mapping (1)

The relation R between A and B is a mapping (function) if 8x[x 2 A : 91

y[y 2 B : x R y]

| {z }] at least one: 9y[y 2 B : x R y] ^ at most one: 8y1,y2[y1, y2 2 B : (x R y1 ^ x R y2) ) y1 = y2]

Exercise

Determine if the following relations are mappings:

  • 1. R1 ✓ R ⇥ R defined by x R1 y iff y = x2

Yes

  • 2. R2 ✓ R ⇥ R defined by x R2 y iff y2 = x

No

  • 3. R3 ✓ R+ ⇥ R+ defined by x R3 y iff y2 = x

Yes

  • 4. R4 ✓ R ⇥ R defined by x R4 y iff y = 2x _ y = 3x

No

slide-2
SLIDE 2

5/24 / department of mathematics and computer science

Mapping (2)

F : A ! B means “F ✓ A ⇥ B and F is a mapping (function)” A: domain of F B: range of F We usually write y = F(x) instead of x F y Property of mapping F : A ! B: 8x[x 2 A : 91

y[y 2 B : F(x) = y]]

  • utgoing arrows
  • r more

two arrows zero

  • utgoing

x y so

  • ne

exactly

  • utgoing arrow

6/24 / department of mathematics and computer science

Image (1)

A B F : A ! B F(A0) A0

The image F(A0) of A0 under F is the set of all end-points in B of arrows starting in A0. F(A0) def = {b 2 B | 9x[x 2 A0 : F(x) = b]}

Example:

F : Z ! Z with F(x) = x2 1 Then: F({0, 2}) = {1, 3} F(;) = ; F(Z) = {1, 0, 3, 8, 15, 24, . . . }

2 3 8 3 2 3

7/24 / department of mathematics and computer science

Image (2)

A B F : A ! B F(A0) A0

Properties of ‘image’: x 2 A0 |

val

= = F(x) 2 F(A0) y 2 F(A0)

val

= = 9x[x 2 A0 : F(x) = y] NB: x 2 A0

val

= 6= = F(x) 2 F(A0); it may happen that F(x) 2 F(A0) and at the same time x 62 A0. (Counterexample on p. 264 of the book.)

8/24 / department of mathematics and computer science

Example

Let F : A ! B be a mapping, and let S, T ✓ A. Prove that F(S)\F(T) ✓ F(S\T). [Proof on blackboard. (Also available as detailed example of the construction of the proof of a property involving sets and mappings from Course Material section of the website)]

slide-3
SLIDE 3

9/24 / department of mathematics and computer science

Example: F(S)\F(T) ✓ F(S\T)

(1) var y; y 2 F(S) \ F(T) (2) y 2 F(S) ^ ¬(y 2 F(T)) (3) 9x[x 2 S : F(x) = y] (Prop. image) (4) Pick an x with x 2 S and F(x) = y (5) x 2 T (6) F(x) 2 F(T) (Prop. image) (7) y 2 F(T) (8) False (9) ¬(x 2 T) (10) x 2 S ^ ¬(x 2 T) (11) x 2 S \ T (Prop. \) (12) 9x[x 2 S \ T : F(x) = y] (Prop. image) (13) y 2 F(S \ T) (14) F(S)\F(T) ✓ F(S\T) x y A B S T F(S) F(T) Properties of ‘image’: x 2 A0 |

val

= = F(x) 2 F(A0) y 2 F(A0)

val

= = 9x[x 2 A0 : F(x) = y] NB: the other direction does not hold. Exercise: give a counterexample.

10/24 / department of mathematics and computer science

Example: F(S)\F(T) ✓ F(S\T)

Proof:

According to the property of ✓, we need to prove that all elements of F(S)\F(T) are also elements of F(S\T). Let y 2 F(S)\F(T); we need to establish that y 2 F(S\T). To this end, it suffices, by the property of image, to prove the existence of x 2 S\T such that F(x) = y. Note that, from y 2 F(S)\F(T) it follows, by the property of \, that y 2 F(S) and y 62 F(T). So, by the property of image, there exists x 2 S such that F(x) = y. It therefore remains to prove that x 2 S\T, which, according to the property

  • f \ and since x 2 S, amounts to proving that x 62 T.

To prove x 62 T, we suppose that x 2 T, and derive a contradiction. From x 2 T it follows, by the property of image, that F(x) 2 F(T). Hence, since F(x) = y, we have that y 2 F(T). Since also y 62 F(T) (see above), we have thus arrived at a contradiction.

11/24 / department of mathematics and computer science

Source (1)

The source F (B0) of B0 is the set of all starting points in A of arrows with their end-point in B0.

A B F : A ! B B0 F (B0)

F (B0) def = {a 2 A | F(a) 2 B0}

Example:

F : Z ! Z with F(x) = x2 1 Then: F ({1, . . . , 10}) = {3, 2, 2, 3}

3 2 3 8 3 2

12/24 / department of mathematics and computer science

Source (2)

Property of ‘source’: x 2 F (B0)

val

= = F(x) 2 B0

Example:

Let F : A ! B and U, V ✓ B. Prove that F (U) [ F (V ) = F (U [ V ).

For all x 2 U: x 2 F (U) [ F (V )

val

= = { Property of [ } x 2 F (U) _ x 2 F (V )

val

= = { Property of source } F(x) 2 U _ F(x) 2 V

val

= = { Property of [ } F(x) 2 U [ V

val

= = { Property of source } x 2 F (U [ V )

F (U) V F (V ) U B A F : A ! B

slide-4
SLIDE 4

13/24 / department of mathematics and computer science

Source (3)

Lemma

If F : A ! B en A0 ✓ A, then F (F(A0)) ◆ A0. Proof: see book pp. 264–265. NB: A0 can be really smaller than F (F(A0)): F : Z ! Z with F(x) = x2 1, A0 = {2}. Then F({2}) = {3} and F (F({2})) = {2, 2} 6= {2}.

2 3 2 3 3 8

14/24 / department of mathematics and computer science

Surjection

A B F : A ! B

F is a surjection if every b 2 B has at least one incoming arrow. Property of surjection: 8y[y 2 B : 9x[x 2 A : F(x) = y]]

Examples:

I f : R ! R with f(x) = x2 is not a surjection. I f : R ! R+ [ {0} with f(x) = x2 is a surjection. 15/24 / department of mathematics and computer science

Composed mapping

Let A, B and C be sets. Let F : A ! B and G : B ! C be mappings. The composed mapping G F (pronounce: ‘G after F’) is defined by (G F)(x) = G(F(x)) for all x 2 A .

G F G F F(x) x G(F(x))

16/24 / department of mathematics and computer science

Example

Lemma

If F : A ! B and G : B ! C are both surjections, then G F is a surjection too.

Proof:

var z; z 2 C 9y[y 2 B : G(y) = z] (8-elim with z 2 C on ‘G is a surjection’) Pick a y 2 B with G(y) = z 9x[x 2 A : F(x) = y] (8-elim with y 2 B op ‘F is a surjection’) Pick an x 2 A with F(x) = y (G F)(x) = G(F(x)) = G(y) = z 9x[x 2 A : (G F)(x) = z] 8z[z 2 C : 9x[x 2 A : (G F)(x) = z]]

slide-5
SLIDE 5

17/24 / department of mathematics and computer science

Example

Lemma

If F : A ! B and G : B ! C are both surjections, then G F is a surjection too.

Proof:

To prove that G F is a surjection, according to the definition of surjection we need to establish that for all z 2 C there exists x 2 A such that (G F)(x) = z. To this end, let z 2 C. Since G is a surjection, there exists y 2 B such that G(y) = z, and hence, since F is a surjection, there exists x 2 A such that F(x) = y. It follows, using the definition of , F(x) = y and G(y) = z, that (G F)(x) = G(F(x)) = G(y) = z .

18/24 / department of mathematics and computer science

Injection

A B F : A ! B

F is an injection if every b 2 B has at most one incoming arrow. Property of injection: 8x1,x2[x1, x2 2 A : F(x1) = F(x2) ) x1 = x2]

Example:

I f : R ! R with f(x) = x2 is not an injection. I f : R+ [ {0} ! R with f(x) = x2 is an injection. 19/24 / department of mathematics and computer science

Example

Lemma

If F : A ! B and G : B ! C are both injections, then so is G F.

Proof:

var x1, x2; x1, x2 2 A (G F)(x1) = (G F)(x2) F(x1), F(x2) 2 B (8-elim+9⇤-elim on Prop. mapping+Leibniz) G(F(x1)) = G(F(x2)) (Def. of composed mapping G F) G(F(x1)) = G(F(x2)) ) F(x1) = F(x2) (8-elim on ‘G is an injection’) F(x1) = F(x2) F(x1) = F(x2) ) x1 = x2 (8-elim on ‘F is an injection’) x1 = x2 8x1,x2[x1, x2 2 A : (G F)(x1) = (G F)(x2) ) x1 = x2]

20/24 / department of mathematics and computer science

Example

Lemma

If F : A ! B and G : B ! C are both injections, then so is G F.

Proof:

To prove that (G F) is an injection, according to the definition of injection we need to establish for all x1, x2 2 A that (G F)(x1) = (G F)(x2) implies x1 = x2. So, let x1, x2 2 A and suppose that (G F)(x1) = (G F)(x2); we show that x1 = x2. From (G F)(x1) = (G F)(x2) it follows, by the definition of , that G(F(x1)) = G(F(x2)). Hence, since G is an injection, we have that F(x1) = F(x2). Therefore, since F is an injection, we have that x1 = x2.

slide-6
SLIDE 6

21/24 / department of mathematics and computer science

Bijection

B A F : A ! B

F is a bijection if every b 2 B has exactly one incoming arrow. Property of bijection: 8y[y 2 B : 91

x[x 2 A : F(x) = y]]

usually: 8y[y 2 B : 9x[x 2 A : F(x) = y]] (surjection) ^ 8x1,x2[x1, x2 2 A : F(x1) = F(x2) ) x1 = x2] (injection)

22/24 / department of mathematics and computer science

Bijection (examples)

  • 1. f : R ! R with f(x) = x2 is not a bijection.

f : R+ [ {0} ! R+ [ {0} with f(x) = x2 is a bijection.

  • 2. F : N ! {n 2 N | n is even} with F(n) = 2n is a bijection.

23/24 / department of mathematics and computer science

Inverse

Suppose F : A ! B is a bijection. Then there exists a one-to-one correspondence between elements of A and B. We can now invert all arrows.

A B

Thus, we get the inverse mapping F 1 : B ! A of F. Property of inverse F 1 : B ! A

  • f bijection F : A ! B:

F(x) = y

val

= = F 1(y) = x NB: F 1 is again a ‘true’ mapping.

24/24 / department of mathematics and computer science

Inverse (examples)

  • 1. Let f : R+ [ {0} ! R+ [ {0} be the bijection defined by

f(x) = x2 . Then f1 : R+ [ {0} ! R+ [ {0} is the bijection defined by f1(x) = px .

  • 2. If F : A ! B is a bijection, then

F 1 F : A ! A is the indentity on A (i.e., (F 1 F)(x) = x for all x 2 A); F F 1 : B ! B the identity on B