Definition:Image (Relation Theory)/Mapping/Element
Definition
Let $f: S \to T$ be a mapping.
Let $s \in S$.
The image of $s$ (under $f$) is defined as:
- $\Img s = \map f s = \ds \bigcup \set {t \in T: \tuple {s, t} \in f}$
That is, $\map f s$ is the element of the codomain of $f$ related to $s$ by $f$.
By the nature of a mapping, $\map f s$ is guaranteed to exist and to be unique for any given $s$ in the domain of $f$.
Also known as
The image of an element $s$ under a mapping $f$ is also called the functional value, or value, of $f$ at $s$.
The terminology:
- $f$ maps $s$ to $\map f s$
- $f$ assigns the value $\map f s$ to $s$
- $f$ carries $s$ into $\map f s$
can be found.
The modifier by $f$ can also be used for under $f$.
Thus, for example, the image of $s$ by $f$ means the same as the image of $s$ under $f$.
In the context of computability theory, the following terms are frequently found:
If $\tuple {x, y} \in f$, then $y$ is often called the output of $f$ for input $x$, or simply, the output of $f$ at $x$.
Also denoted as
The notation $\Img f$ to denote the image of a mapping $f$ is specific to $\mathsf{Pr} \infty \mathsf{fWiki}$.
The usual notation is $\map {\mathrm {Im} } f$ or a variant, but this is too easily confused with $\map \Im z$, the imaginary part of a complex number.
Hence the non-standard usage $\Img f$.
Some sources use $f \sqbrk S$, where $S$ is the domain of $f$.
Others just use $\map f S$, but that notation is deprecated on $\mathsf{Pr} \infty \mathsf{fWiki}$ so as not to confuse it with the notation for the image of an element.
Examples
Arbitrary Example
Let:
\(\ds A\) | \(=\) | \(\ds \set {a, b, c, d}\) | ||||||||||||
\(\ds B\) | \(=\) | \(\ds \set {w, x, y, z}\) |
Let $f: A \to B$ be a mapping defined such that:
- $\map f a = z$
Then $z$ is the image of $a$ under $f$.
Image of $2$ under $x \mapsto x^4 - 1$
Let $f: \R \to \R$ be the mapping defined as:
- $\forall x \in \R: \map f x = x^4 - 1$
The image of $2$ is:
- $\map f 2 = 15$
Images of Various Numbers under $x \mapsto x^2 + 2 x + 1$ in $\closedint 0 1$
Let $f: \closedint 0 1 \to \R$ be the mapping defined as:
- $\forall x \in \closedint 0 1: \map f x = x^2 + 2 x + 1$
where $\closedint 0 1$ denotes the closed real interval from $0$ to $1$.
The images of various real numbers under $f$ are:
\(\ds \map f 0\) | \(=\) | \(\ds 0^2 + 2 \times 0 + 1\) | \(\ds = 1\) | |||||||||||
\(\ds \map f 1\) | \(=\) | \(\ds 1^2 + 2 \times 1 + 1\) | \(\ds = 4\) | |||||||||||
\(\ds \map f {\dfrac 1 2}\) | \(=\) | \(\ds \paren {\dfrac 1 2}^2 + 2 \times \dfrac 1 2 + 1\) | \(\ds = 2 \tfrac 1 4\) | |||||||||||
\(\ds \map f 2\) | \(\) | \(\ds \text {is undefined}\) | \(\ds \text {as $2$ is not in the domain of $f$}\) | |||||||||||
\(\ds \map f {-1}\) | \(\) | \(\ds \text {is undefined}\) | \(\ds \text {as $-1$ is not in the domain of $f$}\) |
Also see
Sources
- 1914: G.W. Caunt: Introduction to Infinitesimal Calculus ... (previous) ... (next): Chapter $\text I$: Functions and their Graphs: $2$. Functions
- 1947: James M. Hyslop: Infinite Series (3rd ed.) ... (previous) ... (next): Chapter $\text I$: Functions and Limits: $\S 2$: Functions
- 1951: Nathan Jacobson: Lectures in Abstract Algebra: Volume $\text { I }$: Basic Concepts ... (previous) ... (next): Introduction $\S 2$: Product sets, mappings
- 1955: John L. Kelley: General Topology ... (previous) ... (next): Chapter $0$: Functions
- 1959: E.M. Patterson: Topology (2nd ed.) ... (previous) ... (next): Chapter $\text {II}$: Topological Spaces: $\S 9$. Functions
- 1964: Iain T. Adamson: Introduction to Field Theory ... (previous) ... (next): Chapter $\text {I}$: Elementary Definitions: $\S 3$. Homomorphisms
- 1964: W.E. Deskins: Abstract Algebra ... (previous) ... (next): $\S 1.3$
- 1964: Walter Rudin: Principles of Mathematical Analysis (2nd ed.) ... (previous) ... (next): Chapter $2$: Elements of Set Theory: Finite, Countable, and Uncountable Sets: $2.1$. Definition
- 1964: William K. Smith: Limits and Continuity ... (previous) ... (next): $\S 2.2$: Functions
- 1965: J.A. Green: Sets and Groups ... (previous) ... (next): $\S 3.1$. Mappings
- 1965: Seth Warner: Modern Algebra ... (previous) ... (next): Chapter $\text I$: Algebraic Structures: $\S 1$: The Language of Set Theory
- 1966: Richard A. Dean: Elements of Abstract Algebra ... (previous) ... (next): $\S 0.4$
- 1967: George McCarty: Topology: An Introduction with Application to Topological Groups ... (previous) ... (next): Chapter $\text{I}$: Sets and Functions: Functions
- 1968: A.N. Kolmogorov and S.V. Fomin: Introductory Real Analysis ... (previous) ... (next): $\S 1.3$: Functions and mappings. Images and preimages
- 1969: C.R.J. Clapham: Introduction to Abstract Algebra ... (previous) ... (next): Chapter $5$: Rings: $\S 24$. Homomorphisms
- 1970: Arne Broman: Introduction to Partial Differential Equations ... (previous) ... (next): Chapter $1$: Fourier Series: $1.1$ Basic Concepts: $1.1.2$ Definitions
- 1971: Gaisi Takeuti and Wilson M. Zaring: Introduction to Axiomatic Set Theory: $\S 6.11$
- 1972: A.G. Howson: A Handbook of Terms used in Algebra and Analysis ... (previous) ... (next): $\S 2$: Sets and functions: Graphs and functions
- 1972: Murray R. Spiegel and R.W. Boxer: Theory and Problems of Statistics (SI ed.) ... (previous) ... (next): Chapter $1$: Functions
- 1975: T.S. Blyth: Set Theory and Abstract Algebra ... (previous) ... (next): $\S 4$. Relations; functional relations; mappings
- 1977: K.G. Binmore: Mathematical Analysis: A Straightforward Approach ... (previous) ... (next): $\S 7.1$
- 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): Appendix $\text{A}.4$: Functions
- 1978: John S. Rose: A Course on Group Theory ... (previous) ... (next): $0$: Some Conventions and some Basic Facts
- 1978: Thomas A. Whitelaw: An Introduction to Abstract Algebra ... (previous) ... (next): $\S 20$: Introduction: Remarks $\text{(g)}$
- 1981: Murray R. Spiegel: Theory and Problems of Complex Variables (SI ed.) ... (previous) ... (next): $2$: Functions, Limits and Continuity: Variables and Functions
- 1982: P.M. Cohn: Algebra Volume 1 (2nd ed.) ... (previous) ... (next): Chapter $1$: Sets and mappings: $\S 1.3$: Mappings
- 1989: George S. Boolos and Richard C. Jeffrey: Computability and Logic (3rd ed.) ... (previous) ... (next): $1$ Enumerability
- 1996: H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability ... (previous) ... (next): Appendix $\text{A}.3$: Functions
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): function (map, mapping)
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): image
- 1999: András Hajnal and Peter Hamburger: Set Theory ... (previous) ... (next): $1$. Notation, Conventions: $10$: Definition $1.3$
- 2000: James R. Munkres: Topology (2nd ed.) ... (previous) ... (next): $1$: Set Theory and Logic: $\S 2$: Functions
- 2008: Paul Halmos and Steven Givant: Introduction to Boolean Algebras ... (previous) ... (next): Appendix $\text{A}$: Set Theory: Functions
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): function (map, mapping)
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): image
- 2011: Robert G. Bartle and Donald R. Sherbert: Introduction to Real Analysis (4th ed.) ... (previous) ... (next): $\S 1.1$: Sets and Functions