| Function Composition |
Article Index for Function |
Articles about Function Composition |
Website Links For Function |
Information AboutFunction Composition |
| CATEGORIES ABOUT FUNCTION COMPOSITION | |
| functions and mappings | |
| basic concepts in set theory | |
|
In Mathematics , a composite function, formed by the '''composition''' of one Function on another, represents the application of the former to the result of the application of the latter to the argument of the composite. The functions ''f'': ''X'' → ''Y'' and ''g'': ''Y'' → ''Z'' can be ''composed'' by first applying ''f'' to an argument ''x'' and then applying ''g'' to the result. Thus one obtains a function ''g'' o ''f'': ''X'' → ''Z'' defined by (''g'' o ''f'')(''x'') = ''g''(''f''(''x'')) for all ''x'' in ''X''. The notation ''g'' o ''f'' is read as "''g'' circle ''f''" or "''g'' composed with ''f''". The composition of functions is always Associative . That is, if ''f'', ''g'', and ''h'' are three functions with suitably chosen domains and codomains, then ''f'' o (''g'' o ''h'') = (''f'' o ''g'') o ''h''. Since there is no distinction between the choices of placement of parentheses, they may be safely left off. |
|
|