|
|
|
|
properties of functions
|
(Result)
|
|
|
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 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

|
"properties of functions" is owned by yark. [ full author list (3) | owner history (2) ]
|
|
(view preamble)
Cross-references: injective functions, equivalent, properties, surjective, inverse image, contained, intersection, union, image, definitions, index sets, subsets, function
There are 2 references to this entry.
This is version 17 of properties of functions, born on 2005-02-02, modified 2007-05-17.
Object id is 6705, canonical name is PropertiesOfFunctions.
Accessed 3581 times total.
Classification:
| AMS MSC: | 03E20 (Mathematical logic and foundations :: Set theory :: Other classical set theory ) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|