Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Letf:BC andg:CD be bijective functions. Then the composite functiongof:BD is bijective by Exercise 27. Prove that (gof)-1=f-1og-1.

Short Answer

Expert verified

Thus, the given statement is proved (gof)-1=f-1og-1.

Step by step solution

01

The composite function  is bijective

Consider the provided statement to prove that (gof)-1=f-1og-1.

As it is given that f:BCand f:CDbe bijective function then the composite function gof:BDis also bijective.

Now, it is sufficient to prove that,

(f-1og-1)ogof=I,gofo(f10g-1)=I,

Now, the solve as follows:


localid="1660545496144" (f-1og-1)ogof=(f-1og-1)ogof=f-1og-1ogof=f-1olyof=f-1of=lHence,(f-1og-1)o(gof)=lx.........(1)

02

Proving that (g o f)-1=f-1o g-1

Now, the similarly solve as follows:

gofo(f-1og-1)=(gof)of-1og-1=gofof-1og-1=goIxog-1=gog-1(gof)o(f-1og-1)=lz.........(2)

Now, from equation (1) and equation (2),

(gof)-1=f-1og-1

Hence, the statement is proved (gof)-1=f-1og-1.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Study anywhere. Anytime. Across all devices.

Sign-up for free