answersLogoWhite

0

We know that f:A~B is a bijection

Therefore f^-1:A~B is a unique function

To prove that f^-1 is one-one--

Let b1, b2 be any 2 different elements of B ,, i.e

b1 is unequal to b2

Now we have to prove that

f^-1(b1) is unequal to f^-1(b2)

Let f^-1(b1)=a1. And. f^-1(b2)=a2

Such that a1,a2 €A

Then b1= f(a1) and b2=f(a2)

~f^-1(b1) is unequal to f^-1(b2)

Therefore f^-1 is a one-one function

Now f^-1 has a n image a such that

b€B

Therefore f^-1 is onto function

Finally f^-1 is a bijection

Hence proved

User Avatar

Wiki User

11y ago

Still curious? Ask our experts.

Chat with our AI personalities

RafaRafa
There's no fun in playing it safe. Why not try something a little unhinged?
Chat with Rafa
SteveSteve
Knowledge is a journey, you know? We'll get there.
Chat with Steve
RossRoss
Every question is just a happy little opportunity.
Chat with Ross

Add your answer:

Earn +20 pts
Q: How do you prove that bijective function also has a bijective inverse?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Movies & Television

What is the relationship between density and surface tension?

as we know the relation between surface tension and temperature is inverse, and that of temperature and density also has inverse proportion, then it is clear that the '''surface tension is directly proportion to the density'''.


Prove that the set of all real no is a group with respect of multiplication?

There are four requirements that need to be satisfied: A. Closure: For any two elements of the group, a and b, the operation a*b is also a member of the group. B. Associativity: For any three members of the group, a*(b*c) = (a*b)*c C. Identity: There exists an element in the group, called the identity and denoted by i, such that a*i = i*a for all a in the group. For real numbers with multiplication, this element is 1. D. Inverse: For any member of the group, a, there exists a member of the group, b, such that a*b = b*a = 1 (the identity). b is called the inverse of a and denoted by a-1.


If A is an orthogonal matrix then why is it's inverse also orthogonal?

First let's be clear on the definitions.A matrix M is orthogonal if MT=M-1Or multiply both sides by M and you have1) M MT=Ior2) MTM=IWhere I is the identity matrix.So our definition tells us a matrix is orthogonal if its transpose equals its inverse or if the product ( left or right) of the the matrix and its transpose is the identity.Now we want to show why the inverse of an orthogonal matrix is also orthogonal.Let A be orthogonal. We are assuming it is square since it has an inverse.Now we want to show that A-1 is orthogonal.We need to show that the inverse is equal to the transpose.Since A is orthogonal, A=ATLet's multiply both sides by A-1A-1 A= A-1 ATOr A-1 AT =ICompare this to the definition above in 1) (M MT=I)do you see how A-1 now fits the definition of orthogonal?Or course we could have multiplied on the left and then we would have arrived at 2) above.


What function does the PlayStation 1 have?

Plays PS1 games and will also play music CDs


What is the function of a computer tower?

The tower houses the motherboard and add-on cards such as the display card and the network card, and also storage such as hard drives, and CD drives. Then it also houses the power supply, which provides power to the above mentioned components.