Loading in 5 sec....

Suppose the relation R A B is a functionPowerPoint Presentation

Suppose the relation R A B is a function

- 170 Views
- Uploaded on
- Presentation posted in: General

Suppose the relation R A B is a function

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Inverse function.

Suppose the relation R A B is a function

It means that for anya A there exists a uniqueb B,

(a, b) R , or we have f (a)=b.

Then the inverse relation

R-1 = { (b, a) | bB, aA and f (a)=b} BA

also defines a function only if f : A B is a bijection.

R

R-1

R is a function

R-1is not a function. Why?

R-1

R

R is a function

R-1is not a function. Why?

Theorem. Let f : A B be a bijection. Then the inverse relation

of f , defined from B to A as g = {(b, a)| bB, aA and f (a)=b}, is

a function from B to A such that gf (a)=a for all a A and

fg (b)=b for all b B.

The function g is called the inverse function of f and is denoted f –1.

f g (b)

b

B

A

f

a

g

gf (a)

The converse of the previous Theorem is also true.

Theorem . Let f : A Band g : BAbe two functions.

If gf (a)= a for all aA , and fg (b)=b for all bB, then

both f and g are bijections, and they are inverse functions of

each other, that is f = g-1 and g = f –1 .

We can first prove that if gf (a)= a for all aA,

and fg (b)=b for all bB, then f is a bijection and g = f –1 .

?

a1= a2

g(f (a1)= a1

a1

f (a1) = f (a2)

g(f (a2)= a2

a2

Sketch of the proof that f is a bijection, given

f : A Band g : BA

a A, g f (a)= a

b B, f g (b)= b

f is bijection = injection + surjection

f is injection: f (a1) = f (a2) a1= a2

Since g is a function,f (a1) = f (a2) g(f (a1)=g(f (a2),

i. e. a1= a2 .

Proof that if gf (a)= a for all aA , and fg (b)=b for all bB, then f is an injection.

Suppose f (a1)=f (a2) for a1, a2A. We want to show that a1 = a2.

We have gf (a1) = gf (a2), since g is a function, g : BA.

But gf (a1) = a1 and gf (a2)= a2 (gf (a)= a for all aA is given).

It implies thata1 = a2 .

Sketch of the proof that f is a surjection, given

f : A Band g : BA

a A, g f (a)= a

b B, f g (b)= b

f is surjective: for any bB there exists aA such that f (a)=b

a ?

fg (b)=b

g

bB

Since g is a function, a =g(b) is defined for bB

f (a) = f (g (b))= fg (b)=b

Proof that if gf (a)= a for all aA , and fg (b)=b for all bB, then f is surjection.

To prove that f is a surjection, take any bB to show that

there always exists aA such that f (a)=b. Let a=g(b), then

f (a)=f (g (b))=b, according to fg (b)=b for all bB.

So, f is a bijection and f –1 defined as f –1 (b)=a f (a) = b,

is a function.

?

g = f -1

definition of inverse

f -1 (b)=a f (a)=b

?

g(b)=a f (a)=b

?

?

bB, g(b)=a f (a)=b and a A, f (a)=b g(b)=a

Given:bB, fg (b)=b, so a=g(b), f (a)=b

Given: aA, gf (a)=a, so b=f(a), g (b)=a

Proof that if gf (a)= a for all aA , and fg (b)=b for all bB, then g = f –1 .

To prove that g = f –1 , we need to prove that g(b)=a f (a) = b.

But fg (b)=b for any b B, that is g (b)=a f (a)=b.

In the same way,we havegf (a)= a for all aA, i. e.

f (a)=b g (b)=a .

QED.

g f (a2)

a1

f (a1)= f (a2)

g f (a1)

a2

b1

g

f

a

•

b2

Suppose f : A Band g : BA and only one condition

holds: a A, g f (a)= a .

Is it sufficient to imply any properties of g or f ?

Can f be not injective?

No. f must be injective.

Can f be not surjective?

Yes.

b1

f

g

a1

g

•b2

a1

g

b

f

a2•

Suppose f : A Band g : BA and only one condition

holds: a A, g f (a)= a .

Is it sufficient to imply any properties of g or f ?

Can g be not injective?

Yes.

No, g must be surjective.

Can g be not surjective?

The following theorem shows how to compute the inverse

of a composition.

Theorem . If f : A Band g : BC are two bijections, then

(gf )-1 = f -1 g -1.

Two functions f : A Band g : BA are inverse

of each other iff we have the relationship

gf (a)=a for allaA and f g(b)=bfor allbB.

It is equivalent to say, that gf =IA and f g(b)= IB, where

IAdenotes identity function on A ( IA(a) = a for all aA )

and similarly, IB is identity function on B.

A

B

C

g

f

g -1

f -1

gf

Theorem . If f : A Band g : BC are two bijections, then

(gf )-1 = f -1 g -1

Proof. To prove that (gf )-1 = f -1 g -1, it suffices to prove that

(f -1 g -1)(gf )=IA and (gf )(f -1 g -1) =IC

We have :

(gf )(f -1 g -1) = ((gf )f -1 )g -1

by associative property of relation composition

= (g(f f -1))g -1 ,by associative property

= (gIB)g -1, since f f -1 =IB

= gg -1, since gIB= g

= IC

Similarly we can prove that (f -1 g -1)(gf )=IA

B

f

f (C)

A

CA

Proofs involving functions.

Let f: AB be a function. Then for any subset of A, CA, we can

define the set of images for elements of C that we denote as f (C):

f (C) = {f (x) | xC }.

B

f

DB

f-1(D)

A

For any subset of B, DB, we can define the set of pre-images

of elements from D, which we denote as f-1(D):

f-1(D) = {x | xA and f (x)D }.

Pay attention that f-1(D) is just a notation for the set of pre-images,

which does not assumes the existence of inverse function for f.

B

A

a

x

b

y

c

z

Example: A = {a, b, c}, B ={x, y, z}, and f (a)=x, f (b)=y, f (c)=y.

In this example, function f is neither injective nor surjective.

So, inverse function f -1 does not exist (in other words, inverse

relation of f is not a function). But we can find a set of pre-images

for any subset of B. For example:

f -1({z})=; f -1({x, z})={a}; f -1({x, y}) = {a, b, c}.

Questions

- Is it always true, that f (A) = B?

Ans. It is true only if f is surjective. Otherwise f (A)B.

- Is it always true that f -1(B)=A?

- Ans. Yes, since f is a function, any element of A has an image
- that belongs B. As a result any element of A appears as a pre-image
- of some element of B.

- Is it true that if f(C)=f(D), where C, DA, then C=D?

Ans. This is true only if f is injective.

- Is it true that if f -1(C)=f -1(D), where C, D B, then C=D?

Ans. This is true only if f is surjective

- Example. Prove that if f is injective, then XY= implies
- f(X)f(Y)=.

f

B

A

X

f (X)

Y

f (Y)

Proof by contradiction. Assume that XY= and

f(X)f(Y), (1).

(1) implies that there exists some common element,

zf(X) and z f(Y), (2).

From the definition of the set f(X) and f (Y) (2) implies that

there exists xX, such that f(x)=z (3)

and there exists yY, such that f(y)=z (4).

So, we have f(x)= f(y)=z, (5)

and since f is injective (5) implies that

x=y, (6).

Since xX and yY , (6) implies that XY in contradiction

with assumption.

The contradiction proves the initial statement.