Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://en.wikipedia.org/wiki/Image_of_a_function below:

Image (mathematics) - Wikipedia

From Wikipedia, the free encyclopedia

Set of the values of a function

In mathematics, for a function f : X → Y {\displaystyle f:X\to Y} , the image of an input value x {\displaystyle x} is the single output value produced by f {\displaystyle f} when passed x {\displaystyle x} . The preimage of an output value y {\displaystyle y} is the set of input values that produce y {\displaystyle y} .

More generally, evaluating f {\displaystyle f} at each element of a given subset A {\displaystyle A} of its domain X {\displaystyle X} produces a set, called the "image of A {\displaystyle A} under (or through) f {\displaystyle f} ". Similarly, the inverse image (or preimage) of a given subset B {\displaystyle B} of the codomain Y {\displaystyle Y} is the set of all elements of X {\displaystyle X} that map to a member of B . {\displaystyle B.}

The image of the function f {\displaystyle f} is the set of all output values it may produce, that is, the image of X {\displaystyle X} . The preimage of f {\displaystyle f} is the preimage of the codomain Y {\displaystyle Y} . Because it always equals X {\displaystyle X} (the domain of f {\displaystyle f} ), it is rarely used.

Image and inverse image may also be defined for general binary relations, not just functions.

The word "image" is used in three related ways. In these definitions, f : X → Y {\displaystyle f:X\to Y} is a function from the set X {\displaystyle X} to the set Y . {\displaystyle Y.}

If x {\displaystyle x} is a member of X , {\displaystyle X,} then the image of x {\displaystyle x} under f , {\displaystyle f,} denoted f ( x ) , {\displaystyle f(x),} is the value of f {\displaystyle f} when applied to x . {\displaystyle x.} f ( x ) {\displaystyle f(x)} is alternatively known as the output of f {\displaystyle f} for argument x . {\displaystyle x.}

Given y , {\displaystyle y,} the function f {\displaystyle f} is said to take the value y {\displaystyle y} or take y {\displaystyle y} as a value if there exists some x {\displaystyle x} in the function's domain such that f ( x ) = y . {\displaystyle f(x)=y.} Similarly, given a set S , {\displaystyle S,} f {\displaystyle f} is said to take a value in S {\displaystyle S} if there exists some x {\displaystyle x} in the function's domain such that f ( x ) ∈ S . {\displaystyle f(x)\in S.} However, f {\displaystyle f} takes [all] values in S {\displaystyle S} and f {\displaystyle f} is valued in S {\displaystyle S} means that f ( x ) ∈ S {\displaystyle f(x)\in S} for every point x {\displaystyle x} in the domain of f {\displaystyle f} .

Throughout, let f : X → Y {\displaystyle f:X\to Y} be a function. The image under f {\displaystyle f} of a subset A {\displaystyle A} of X {\displaystyle X} is the set of all f ( a ) {\displaystyle f(a)} for a ∈ A . {\displaystyle a\in A.} It is denoted by f [ A ] , {\displaystyle f[A],} or by f ( A ) {\displaystyle f(A)} when there is no risk of confusion. Using set-builder notation, this definition can be written as^[1][2] f [ A ] = { f ( a ) : a ∈ A } . {\displaystyle f[A]=\{f(a):a\in A\}.}

This induces a function f [ ⋅ ] : P ( X ) → P ( Y ) , {\displaystyle f[\,\cdot \,]:{\mathcal {P}}(X)\to {\mathcal {P}}(Y),} where P ( S ) {\displaystyle {\mathcal {P}}(S)} denotes the power set of a set S ; {\displaystyle S;} that is the set of all subsets of S . {\displaystyle S.} See § Notation below for more.

The image of a function is the image of its entire domain, also known as the range of the function.^[3] This last usage should be avoided because the word "range" is also commonly used to mean the codomain of f . {\displaystyle f.}

If R {\displaystyle R} is an arbitrary binary relation on X × Y , {\displaystyle X\times Y,} then the set { y ∈ Y : x R y  for some  x ∈ X } {\displaystyle \{y\in Y:xRy{\text{ for some }}x\in X\}} is called the image, or the range, of R . {\displaystyle R.} Dually, the set { x ∈ X : x R y  for some  y ∈ Y } {\displaystyle \{x\in X:xRy{\text{ for some }}y\in Y\}} is called the domain of R . {\displaystyle R.}

"Preimage" redirects here. For the cryptographic attack on hash functions, see

.

Let f {\displaystyle f} be a function from X {\displaystyle X} to Y . {\displaystyle Y.} The preimage or inverse image of a set B ⊆ Y {\displaystyle B\subseteq Y} under f , {\displaystyle f,} denoted by f − 1 [ B ] , {\displaystyle f^{-1}[B],} is the subset of X {\displaystyle X} defined by f − 1 [ B ] = { x ∈ X : f ( x ) ∈ B } . {\displaystyle f^{-1}[B]=\{x\in X\,:\,f(x)\in B\}.}

Other notations include f − 1 ( B ) {\displaystyle f^{-1}(B)} and f − ( B ) . {\displaystyle f^{-}(B).} The inverse image of a singleton set, denoted by f − 1 [ { y } ] {\displaystyle f^{-1}[\{y\}]} or by f − 1 ( y ) , {\displaystyle f^{-1}(y),} is also called the fiber or fiber over y {\displaystyle y} or the level set of y . {\displaystyle y.} The set of all the fibers over the elements of Y {\displaystyle Y} is a family of sets indexed by Y . {\displaystyle Y.}

For example, for the function f ( x ) = x 2 , {\displaystyle f(x)=x^{2},} the inverse image of { 4 } {\displaystyle \{4\}} would be { − 2 , 2 } . {\displaystyle \{-2,2\}.} Again, if there is no risk of confusion, f − 1 [ B ] {\displaystyle f^{-1}[B]} can be denoted by f − 1 ( B ) , {\displaystyle f^{-1}(B),} and f − 1 {\displaystyle f^{-1}} can also be thought of as a function from the power set of Y {\displaystyle Y} to the power set of X . {\displaystyle X.} The notation f − 1 {\displaystyle f^{-1}} should not be confused with that for inverse function, although it coincides with the usual one for bijections in that the inverse image of B {\displaystyle B} under f {\displaystyle f} is the image of B {\displaystyle B} under f − 1 . {\displaystyle f^{-1}.}

The traditional notations used in the previous section do not distinguish the original function f : X → Y {\displaystyle f:X\to Y} from the image-of-sets function f : P ( X ) → P ( Y ) {\displaystyle f:{\mathcal {P}}(X)\to {\mathcal {P}}(Y)} ; likewise they do not distinguish the inverse function (assuming one exists) from the inverse image function (which again relates the powersets). Given the right context, this keeps the notation light and usually does not cause confusion. But if needed, an alternative is to give explicit names for the image and preimage as functions between power sets:

1. f : { 1 , 2 , 3 } → { a , b , c , d } {\displaystyle f:\{1,2,3\}\to \{a,b,c,d\}} defined by { 1 ↦ a , 2 ↦ a , 3 ↦ c . {\displaystyle \left\{{\begin{matrix}1\mapsto a,\\2\mapsto a,\\3\mapsto c.\end{matrix}}\right.} The image of the set { 2 , 3 } {\displaystyle \{2,3\}} under f {\displaystyle f} is f ( { 2 , 3 } ) = { a , c } . {\displaystyle f(\{2,3\})=\{a,c\}.} The image of the function f {\displaystyle f} is { a , c } . {\displaystyle \{a,c\}.} The preimage of a {\displaystyle a} is f − 1 ( { a } ) = { 1 , 2 } . {\displaystyle f^{-1}(\{a\})=\{1,2\}.} The preimage of { a , b } {\displaystyle \{a,b\}} is also f − 1 ( { a , b } ) = { 1 , 2 } . {\displaystyle f^{-1}(\{a,b\})=\{1,2\}.} The preimage of { b , d } {\displaystyle \{b,d\}} under f {\displaystyle f} is the empty set {   } = ∅ . {\displaystyle \{\ \}=\emptyset .}
2. f : R → R {\displaystyle f:\mathbb {R} \to \mathbb {R} } defined by f ( x ) = x 2 . {\displaystyle f(x)=x^{2}.} The image of { − 2 , 3 } {\displaystyle \{-2,3\}} under f {\displaystyle f} is f ( { − 2 , 3 } ) = { 4 , 9 } , {\displaystyle f(\{-2,3\})=\{4,9\},} and the image of f {\displaystyle f} is R + {\displaystyle \mathbb {R} ^{+}} (the set of all positive real numbers and zero). The preimage of { 4 , 9 } {\displaystyle \{4,9\}} under f {\displaystyle f} is f − 1 ( { 4 , 9 } ) = { − 3 , − 2 , 2 , 3 } . {\displaystyle f^{-1}(\{4,9\})=\{-3,-2,2,3\}.} The preimage of set N = { n ∈ R : n < 0 } {\displaystyle N=\{n\in \mathbb {R} :n<0\}} under f {\displaystyle f} is the empty set, because the negative numbers do not have square roots in the set of reals.
3. f : R 2 → R {\displaystyle f:\mathbb {R} ^{2}\to \mathbb {R} } defined by f ( x , y ) = x 2 + y 2 . {\displaystyle f(x,y)=x^{2}+y^{2}.} The fibers f − 1 ( { a } ) {\displaystyle f^{-1}(\{a\})} are concentric circles about the origin, the origin itself, and the empty set (respectively), depending on whether a > 0 ,   a = 0 ,  or    a < 0 {\displaystyle a>0,\ a=0,{\text{ or }}\ a<0} (respectively). (If a ≥ 0 , {\displaystyle a\geq 0,} then the fiber f − 1 ( { a } ) {\displaystyle f^{-1}(\{a\})} is the set of all ( x , y ) ∈ R 2 {\displaystyle (x,y)\in \mathbb {R} ^{2}} satisfying the equation x 2 + y 2 = a , {\displaystyle x^{2}+y^{2}=a,} that is, the origin-centered circle with radius a . {\displaystyle {\sqrt {a}}.} )
4. If M {\displaystyle M} is a manifold and π : T M → M {\displaystyle \pi :TM\to M} is the canonical projection from the tangent bundle T M {\displaystyle TM} to M , {\displaystyle M,} then the fibers of π {\displaystyle \pi } are the tangent spaces T x ( M )  for  x ∈ M . {\displaystyle T_{x}(M){\text{ for }}x\in M.} This is also an example of a fiber bundle.
5. A quotient group is a homomorphic image.

For every function f : X → Y {\displaystyle f:X\to Y} and all subsets A ⊆ X {\displaystyle A\subseteq X} and B ⊆ Y , {\displaystyle B\subseteq Y,} the following properties hold:

Also:

• f ( A ) ∩ B = ∅  if and only if  A ∩ f − 1 ( B ) = ∅ {\displaystyle f(A)\cap B=\varnothing \,{\text{ if and only if }}\,A\cap f^{-1}(B)=\varnothing }

For functions f : X → Y {\displaystyle f:X\to Y} and g : Y → Z {\displaystyle g:Y\to Z} with subsets A ⊆ X {\displaystyle A\subseteq X} and C ⊆ Z , {\displaystyle C\subseteq Z,} the following properties hold:

For function f : X → Y {\displaystyle f:X\to Y} and subsets A , B ⊆ X {\displaystyle A,B\subseteq X} and S , T ⊆ Y , {\displaystyle S,T\subseteq Y,} the following properties hold:

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:

(Here, S {\displaystyle S} can be infinite, even uncountably infinite.)

With respect to the algebra of subsets described above, the inverse image function is a lattice homomorphism, while the image function is only a semilattice homomorphism (that is, it does not always preserve intersections).

• Bijection, injection and surjection – Properties of mathematical functions
• Fiber (mathematics) – Set of all points in a function's domain that all map to some single given point
• Image (category theory) – term in category theoryPages displaying wikidata descriptions as a fallback
• Kernel of a function – Equivalence relation expressing that two elements have the same image under a functionPages displaying short descriptions of redirect targets
• Set inversion – Mathematical problem of finding the set mapped by a specified function to a certain range

1. ^ "5.4: Onto Functions and Images/Preimages of Sets". Mathematics LibreTexts. 2019-11-05. Retrieved 2020-08-28.
2. ^ Paul R. Halmos (1968). Naive Set Theory. Princeton: Nostrand. Here: Sect.8
3. ^ Weisstein, Eric W. "Image". mathworld.wolfram.com. Retrieved 2020-08-28.
4. ^ Jean E. Rubin (1967). Set Theory for the Mathematician. Holden-Day. p. xix. ASIN B0006BQH7S.
5. ^ M. Randall Holmes: Inhomogeneity of the urelements in the usual models of NFU, December 29, 2005, on: Semantic Scholar, p. 2
6. ^ Hoffman, Kenneth (1971). Linear Algebra (2nd ed.). Prentice-Hall. p. 388.
7. ^ ^{a b c} See Halmos 1960, p. 31
8. ^ ^{a b} See Munkres 2000, p. 19
9. ^ ^{a b c d e f g h} See p.388 of Lee, John M. (2010). Introduction to Topological Manifolds, 2nd Ed.
10. ^ ^{a b} Kelley 1985, p. 85
11. ^ ^{a b} See Munkres 2000, p. 21

• Artin, Michael (1991). Algebra. Prentice Hall. ISBN 81-203-0871-9.
• Blyth, T.S. (2005). Lattices and Ordered Algebraic Structures. Springer. ISBN 1-85233-905-5..
• Dolecki, Szymon; Mynard, Frédéric (2016). Convergence Foundations Of Topology. New Jersey: World Scientific Publishing Company. ISBN 978-981-4571-52-4. OCLC 945169917.
• Halmos, Paul R. (1960). Naive set theory. The University Series in Undergraduate Mathematics. van Nostrand Company. ISBN 9780442030643. Zbl 0087.04403.
• Kelley, John L. (1985). General Topology. Graduate Texts in Mathematics. Vol. 27 (2 ed.). Birkhäuser. ISBN 978-0-387-90125-1.
• Munkres, James R. (2000). Topology (2nd ed.). Upper Saddle River, NJ: Prentice Hall, Inc. ISBN 978-0-13-181629-9. OCLC 42683260. (accessible to patrons with print disabilities)

This article incorporates material from Fibre on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4