Composite functions

  • Thread starter Monsu
  • Start date
  • #1
38
1
If f:A -> B and g:B -> C are functions, is this true: f o g is also a function and (f o g) ^-1 = gof

I think this isn't true, but if this isn't the case, could someone please tell me a counter example?? Thanks
 

Answers and Replies

  • #2
matt grime
Science Advisor
Homework Helper
9,395
3
with that notation fog is not a function, gof is a function from A (to B thence) to C. but that is jsut the notational convention: functions read from right ot left. the inverse part *is* wrong. firstly that isn't function, never mind one that posses an inverse (which a function) may or may not do. So it's hard to find a counter example given that.
 
Last edited:
  • #3
38
1
Thanks, but what could be a counterexample for it??
 
  • #4
matt grime
Science Advisor
Homework Helper
9,395
3
erm, counter example to what? g sends an element of B to an element in C, right? You cannot then follow that with a function from A to anywhere since C is not necessarily a subset of A. counter example is any function g where its image does not lie in the domain of f.

this looks a lot like homework, so i think you should be able to find a counter example if you want to; i've given you the reason why it is not necessairly true
 
Last edited:

Related Threads on Composite functions

  • Last Post
Replies
1
Views
3K
  • Last Post
Replies
18
Views
4K
  • Last Post
Replies
1
Views
3K
  • Last Post
Replies
3
Views
3K
Replies
1
Views
2K
  • Last Post
Replies
3
Views
4K
  • Last Post
Replies
11
Views
213
  • Last Post
Replies
19
Views
2K
Replies
4
Views
3K
Replies
1
Views
1K
Top