- The First Two Lemmas Provide An Alternate Way To Prove That Two Functions Are Inverses Of Each Other If A Is A Set Def 1 (18.08 KiB) Viewed 52 times
The first two lemmas provide an alternate way to prove that two functions are inverses of each other. If A is a set, def
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
The first two lemmas provide an alternate way to prove that two functions are inverses of each other. If A is a set, def
The first two lemmas provide an alternate way to prove that two functions are inverses of each other. If A is a set, define the identity map on A by id: A → A, id,(a)= a. Then id, is clearly a bijection. Lemma 1. Suppose that f: AB and g: BA satisfy go f = id, and fog= idg. Then f and g are bijections. Proof. Hint: By symmetry you can just prove that f is a bijection. Do this directly from the definitions (don't quote any other results).