Definition:Mapping/Definition 2

From ProofWiki
Jump to navigation Jump to search

Definition

Let $S$ and $T$ be sets.

A mapping $f$ from $S$ to $T$, denoted $f: S \to T$, is a relation $f = \struct {S, T, G}$, where $G \subseteq S \times T$, such that:

$\forall x \in S: \forall y_1, y_2 \in T: \tuple {x, y_1} \in G \land \tuple {x, y_2} \in G \implies y_1 = y_2$

and

$\forall x \in S: \exists y \in T: \tuple {x, y} \in G$


Notation

Let $f$ be a mapping.

This is usually denoted $f: S \to T$, which is interpreted to mean:

$f$ is a mapping with domain $S$ and codomain $T$
$f$ is a mapping of (or from) $S$ to (or into) $T$
$f$ maps $S$ to (or into) $T$.

The notation $S \stackrel f {\longrightarrow} T$ is also seen.


For $x \in S, y \in T$, the usual notation is:

$f: S \to T: \map f s = y$

where $\map f s = y$ is interpreted to mean $\tuple {x, y} \in f$.

It is read $f$ of $x$ equals $y$.

This is the preferred notation on $\mathsf{Pr} \infty \mathsf{fWiki}$.


Also see

  • Results about mappings can be found here.


Sources