![DEFINITION A function f : A B is a one-to-one correspondence (called a bijection) iff f is one-to-one and onto B. We write f : A B to indicate that. - DEFINITION A function f : A B is a one-to-one correspondence (called a bijection) iff f is one-to-one and onto B. We write f : A B to indicate that. -](https://images.slideplayer.com/11/3027476/slides/slide_2.jpg)
DEFINITION A function f : A B is a one-to-one correspondence (called a bijection) iff f is one-to-one and onto B. We write f : A B to indicate that. -
![COMPOSITE FUNCTIONS. The composite function: fg means… Apply the rule for g, then, apply the rule for f. So, if f(x) = x 2 and g(x) = 3x + 1 Then fg(2) - ppt download COMPOSITE FUNCTIONS. The composite function: fg means… Apply the rule for g, then, apply the rule for f. So, if f(x) = x 2 and g(x) = 3x + 1 Then fg(2) - ppt download](https://images.slideplayer.com/13/4047127/slides/slide_2.jpg)
COMPOSITE FUNCTIONS. The composite function: fg means… Apply the rule for g, then, apply the rule for f. So, if f(x) = x 2 and g(x) = 3x + 1 Then fg(2) - ppt download
![Each element in A must be matched with an element in B Ex– (0,3) (3,2) (9,4) (12,5) Some elements in the range may not be matched with the domain. Two. - ppt download Each element in A must be matched with an element in B Ex– (0,3) (3,2) (9,4) (12,5) Some elements in the range may not be matched with the domain. Two. - ppt download](https://images.slideplayer.com/25/7635338/slides/slide_9.jpg)