This preview shows page 1. Sign up to view the full content.
Unformatted text preview: X be an injective function. Dene a sequence of functions, called g n : X X , for all n N , by the following rule: When n = 0, and x X , then we dene g ( x ) = x . If n 1, and x X , then we dene g n ( x ) = f ( g n-1 ( x )). In other words, g n is the function obtained by repeating the function f , n times. Prove that, for every n N , the function g n is injective....
View Full Document
This homework help was uploaded on 04/17/2008 for the course MATH 100 taught by Professor Weissman during the Fall '08 term at UCSC.
- Fall '08