Content deleted Content added
Undid revision 1255162931 by 178.138.98.223: this is distracting here; instead, consider adding a subsection on permutations in sect Examples |
→Preimages: usual approach |
||
Line 320:
If {{math|''f'': ''X'' → ''Y''}} is any function (not necessarily invertible), the '''preimage''' (or '''inverse image''') of an element {{math| ''y'' ∈ ''Y''}} is defined to be the set of all elements of {{mvar|X}} that map to {{mvar|y}}:
: <math>f^{-1}(
The preimage of {{mvar|y}} can be thought of as the [[image (mathematics)|image]] of {{mvar|y}} under the (multivalued) full inverse of the function {{mvar|f}}.
: <math>f^{-1}(S) = \left\{ x\in X : f(x) \in S \right\} . </math>
Line 332:
: <math>f^{-1}(\left\{1,4,9,16\right\}) = \left\{-4,-3,-2,-1,1,2,3,4\right\}</math>.
The original notion and its generalization are related by the identity <math>f^{-1}(y) = f^{-1}(\{y\}),</math> The preimage of a single element {{math| ''y'' ∈ ''Y''}} – a [[singleton set]] {{math|{''y''} }} – is sometimes called the ''[[fiber (mathematics)|fiber]]'' of {{mvar|y}}. When {{mvar|Y}} is the set of real numbers, it is common to refer to {{math|''f''<sup> −1</sup>({''y''})}} as a ''[[level set]]''.
==See also==
|