IMAGE (MATHEMATICS)
(Redirected from Preimage)
In mathematics, the 'image' of a function is the set of all possible values (i.e. outputs) of the function.
Let ''X'' and ''Y'' be sets, ''f'' be the function ''f'' : ''X'' → ''Y'', and ''x'' be some member of ''X''. Then the 'image' of ''x'' under ''f'', denoted ''f''(''x''), is the unique member ''y'' of ''Y'' that ''f'' associates with ''x''. The image of a function ''f'' is denoted im(''f'') and is the range of ''f'', or more precisely, the image of its domain.
The 'image' of a subset ''A'' ⊆ ''X'' under ''f'' is the subset of ''Y'' defined by
:''f''[ ''A''] = {''y'' ∈ ''Y'' | ''y'' = ''f''(''x'') for some ''x'' ∈ ''A''}.
When there is no risk of confusion, ''f''[ ''A''] is sometimes simply written ''f''(''A''). An alternative notation for ''f''[ ''A''] , common in the older literature on mathematical logic and still preferred by some set theorists, is ''f'' "''A''.
Given this definition, the image of ''f'' becomes a function whose domain is the power set of ''X'' (the set of all subsets of ''X''), and whose codomain is the power set of ''Y''. The same notation can denote either the function ''f'' or its image. This convention is a common one; the intended meaning must be inferred from the context.
The 'preimage' or 'inverse image' of a set ''B'' ⊆ ''Y'' under ''f'' is the subset of ''X'' defined by
:''f'' −1[ ''B''] = {''x'' ∈ ''X'' | ''f''(''x'') ∈ ''B''}.
The inverse image of a singleton, ''f'' −1[ {''y''}] , is a 'fiber' (also spelled 'fibre') or a level set.
Again, if there is no risk of confusion, we may denote ''f'' −1[ ''B''] by ''f'' −1(''B''), and think of ''f'' −1 as a function from the power set of ''Y'' to the power set of ''X''. The notation ''f'' −1 should not be confused with that for inverse function. The two coincide only if ''f'' is a bijection.
''f'' can also be seen as a family of sets indexed by ''Y'', which leads to the notion of a fibred category.
1. ''f'': {1,2,3} → {''a,b,c,d''} defined by
The ''image'' of {2,3} under ''f'' is ''f''({2,3}) = {''d,c''}, and the ''range'' of ''f'' is {''a,d,c''}. The ''preimage'' of {''a,c''} is ''f'' −1({''a,c''}) = {1,3}.
2. ''f'': 'R' → 'R' defined by ''f''(''x'') = ''x''2.
The ''image'' of {-2,3} under ''f'' is ''f''({-2,3}) = {4,9}, and the ''range'' of ''f'' is 'R+'. The ''preimage'' of {4,9} under ''f'' is ''f'' −1({4,9}) = {-3,-2,2,3}.
3. ''f'': 'R'2 → 'R' defined by ''f''(''x'', ''y'') = ''x''2 + ''y''2.
The ''fibres'' ''f'' −1({''a''}) are concentric circles about the origin, the origin, and the empty set, depending on whether ''a''>0, ''a''=0, or ''a''<0, respectively.
4. If ''M'' is a manifold and ''π'' :''TM''→''M'' is the canonical projection from the tangent bundle ''TM'' to ''M'', then the ''fibres'' of ''π'' are the tangent spaces ''T''''x''(''M'') for ''x''∈''M''. This is also an example of a fiber bundle.
Given a function ''f'' : ''X'' → ''Y'', for all subsets ''A'', ''A''1, and ''A''2 of ''X'' and all subsets ''B'', ''B''1, and ''B''2 of ''Y'' we have:
★ ''f''(''A''1 ∪ ''A''2) = ''f''(''A''1) ∪ ''f''(''A''2)
★ ''f''(''A''1 ∩ ''A''2) ⊆ ''f''(''A''1) ∩ ''f''(''A''2)
★ ''f'' −1(''B''1 ∪ ''B''2) = ''f'' −1(''B''1) ∪ ''f'' −1(''B''2)
★ ''f'' −1(''B''1 ∩ ''B''2) = ''f'' −1(''B''1) ∩ ''f'' −1(''B''2)
★ ''f''(''f'' −1(''B'')) ⊆ ''B''
★ ''f'' −1(''f''(''A'')) ⊇ ''A''
★ ''A''1 ⊆ ''A''2 → ''f''(''A''1) ⊆ ''f''(''A''2)
★ ''B''1 ⊆ ''B''2 → ''f'' −1(''B''1) ⊆ ''f'' −1(''B''2)
★ ''f'' −1(''B''C) = (''f'' −1(''B''))C
★ (''f'' |''A'')−1(''B'') = ''A'' ∩ ''f'' −1(''B'').
The results relating images and preimages to the (Boolean) algebra of intersection and union work for any collection of subsets, not just for pairs of subsets.
With respect to the algebra of subsets, by the above we see that the inverse image function is a lattice homomorphism while the image function is only a semilattice homomorphism (it does not always preserve intersections).
★ range (mathematics)
★ domain (mathematics)
★ function (mathematics)
★ bijection, injection and surjection
★ kernel of a function
★ image (category theory)
★ preimage attack (cryptography)
★
In mathematics, the 'image' of a function is the set of all possible values (i.e. outputs) of the function.
| Contents |
| Definition |
| Examples |
| Consequences |
| See also |
| References |
Definition
Let ''X'' and ''Y'' be sets, ''f'' be the function ''f'' : ''X'' → ''Y'', and ''x'' be some member of ''X''. Then the 'image' of ''x'' under ''f'', denoted ''f''(''x''), is the unique member ''y'' of ''Y'' that ''f'' associates with ''x''. The image of a function ''f'' is denoted im(''f'') and is the range of ''f'', or more precisely, the image of its domain.
The 'image' of a subset ''A'' ⊆ ''X'' under ''f'' is the subset of ''Y'' defined by
:''f''
When there is no risk of confusion, ''f''
Given this definition, the image of ''f'' becomes a function whose domain is the power set of ''X'' (the set of all subsets of ''X''), and whose codomain is the power set of ''Y''. The same notation can denote either the function ''f'' or its image. This convention is a common one; the intended meaning must be inferred from the context.
The 'preimage' or 'inverse image' of a set ''B'' ⊆ ''Y'' under ''f'' is the subset of ''X'' defined by
:''f'' −1
The inverse image of a singleton, ''f'' −1
Again, if there is no risk of confusion, we may denote ''f'' −1
''f'' can also be seen as a family of sets indexed by ''Y'', which leads to the notion of a fibred category.
Examples
1. ''f'': {1,2,3} → {''a,b,c,d''} defined by
The ''image'' of {2,3} under ''f'' is ''f''({2,3}) = {''d,c''}, and the ''range'' of ''f'' is {''a,d,c''}. The ''preimage'' of {''a,c''} is ''f'' −1({''a,c''}) = {1,3}.
2. ''f'': 'R' → 'R' defined by ''f''(''x'') = ''x''2.
The ''image'' of {-2,3} under ''f'' is ''f''({-2,3}) = {4,9}, and the ''range'' of ''f'' is 'R+'. The ''preimage'' of {4,9} under ''f'' is ''f'' −1({4,9}) = {-3,-2,2,3}.
3. ''f'': 'R'2 → 'R' defined by ''f''(''x'', ''y'') = ''x''2 + ''y''2.
The ''fibres'' ''f'' −1({''a''}) are concentric circles about the origin, the origin, and the empty set, depending on whether ''a''>0, ''a''=0, or ''a''<0, respectively.
4. If ''M'' is a manifold and ''π'' :''TM''→''M'' is the canonical projection from the tangent bundle ''TM'' to ''M'', then the ''fibres'' of ''π'' are the tangent spaces ''T''''x''(''M'') for ''x''∈''M''. This is also an example of a fiber bundle.
Consequences
Given a function ''f'' : ''X'' → ''Y'', for all subsets ''A'', ''A''1, and ''A''2 of ''X'' and all subsets ''B'', ''B''1, and ''B''2 of ''Y'' we have:
★ ''f''(''A''1 ∪ ''A''2) = ''f''(''A''1) ∪ ''f''(''A''2)
★ ''f''(''A''1 ∩ ''A''2) ⊆ ''f''(''A''1) ∩ ''f''(''A''2)
★ ''f'' −1(''B''1 ∪ ''B''2) = ''f'' −1(''B''1) ∪ ''f'' −1(''B''2)
★ ''f'' −1(''B''1 ∩ ''B''2) = ''f'' −1(''B''1) ∩ ''f'' −1(''B''2)
★ ''f''(''f'' −1(''B'')) ⊆ ''B''
★ ''f'' −1(''f''(''A'')) ⊇ ''A''
★ ''A''1 ⊆ ''A''2 → ''f''(''A''1) ⊆ ''f''(''A''2)
★ ''B''1 ⊆ ''B''2 → ''f'' −1(''B''1) ⊆ ''f'' −1(''B''2)
★ ''f'' −1(''B''C) = (''f'' −1(''B''))C
★ (''f'' |''A'')−1(''B'') = ''A'' ∩ ''f'' −1(''B'').
The results relating images and preimages to the (Boolean) algebra of intersection and union work for any collection of subsets, not just for pairs of subsets.
With respect to the algebra of subsets, by the above we see that the inverse image function is a lattice homomorphism while the image function is only a semilattice homomorphism (it does not always preserve intersections).
See also
★ range (mathematics)
★ domain (mathematics)
★ function (mathematics)
★ bijection, injection and surjection
★ kernel of a function
★ image (category theory)
★ preimage attack (cryptography)
★
References
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves

العربية
中国
Français
Deutsch
Ελληνική
हिन्दी
Italiano
日本語
Português
Русский
Español