properties of functions
Let be a function. Let be a family of subsets of , and let be a family of subsets of , where and are non-empty index sets.
Then, it is easy to prove, directly from definitions, that the following hold:
-
•
(i.e., the image of a union is the union of the images)
-
•
(i.e., the image of an intersection is contained in the intersection of the images)
-
•
for any (where is the inverse image of )
-
•
for any
-
•
for any
-
•
(the inverse image of a union is the union of the inverse images)
-
•
(the inverse image of an intersection is the intersection of the inverse images)
-
•
for every if and only if is surjective.
For more properties related specifically to inverse images, see the inverse image (http://planetmath.org/InverseImage) entry.
Further, the following conditions are equivalent (for more, see the entry on injective functions):
-
•
is injective
-
•
for all
-
•
for all
-
•
for all such that
-
•
for all
Title | properties of functions |
---|---|
Canonical name | PropertiesOfFunctions |
Date of creation | 2013-03-22 14:59:54 |
Last modified on | 2013-03-22 14:59:54 |
Owner | yark (2760) |
Last modified by | yark (2760) |
Numerical id | 20 |
Author | yark (2760) |
Entry type | Result |
Classification | msc 03E20 |
Related topic | PropertiesOfAFunction |