A
{\displaystyle A}
is a subset of
B
,
{\displaystyle B,}
and
B
{\displaystyle B}
is a superset of
A
.
{\displaystyle A.}
In mathematics , if
A
{\displaystyle A}
is a subset of
B
,
{\displaystyle B,}
then the inclusion map is the function
ι
{\displaystyle \iota }
that sends each element
x
{\displaystyle x}
of
A
{\displaystyle A}
to
x
,
{\displaystyle x,}
treated as an element of
B
:
{\displaystyle B:}
ι
:
A
→
B
,
ι
(
x
)
=
x
.
{\displaystyle \iota :A\rightarrow B,\qquad \iota (x)=x.}
An inclusion map may also referred to as an inclusion function , an insertion ,[1] or a canonical injection .
A "hooked arrow" (U+ 21AA ↪ RIGHTWARDS ARROW WITH HOOK )[2] is sometimes used in place of the function arrow above to denote an inclusion map; thus:
ι
:
A
↪
B
.
{\displaystyle \iota :A\hookrightarrow B.}
(However, some authors use this hooked arrow for any embedding .)
This and other analogous
are sometimes called
natural injections .
Given any morphism
f
{\displaystyle f}
between
objects
X
{\displaystyle X}
and
Y
{\displaystyle Y}
, if there is an inclusion map
ι
:
A
→
X
{\displaystyle \iota :A\to X}
into the
domain
X
{\displaystyle X}
, then one can form the
restriction
f
∘
ι
{\displaystyle f\circ \iota }
of
f
.
{\displaystyle f.}
In many instances, one can also construct a canonical inclusion into the
codomain
R
→
Y
{\displaystyle R\to Y}
known as the
range of
f
.
{\displaystyle f.}
Applications of inclusion maps
Inclusion maps tend to be homomorphisms of algebraic structures ; thus, such inclusion maps are embeddings . More precisely, given a substructure closed under some operations, the inclusion map will be an embedding for tautological reasons. For example, for some binary operation
⋆
,
{\displaystyle \star ,}
to require that
ι
(
x
⋆
y
)
=
ι
(
x
)
⋆
ι
(
y
)
{\displaystyle \iota (x\star y)=\iota (x)\star \iota (y)}
is simply to say that
⋆
{\displaystyle \star }
is consistently computed in the sub-structure and the large structure. The case of a
nullary operations, which pick out a
constant element. Here the point is that
closure means such constants must already be given in the substructure.
Inclusion maps are seen in algebraic topology where if
A
{\displaystyle A}
is a
strong deformation retract
of
X
,
{\displaystyle X,}
the inclusion map yields an
).
Inclusion maps in
affine schemes
, for which the inclusions
Spec
(
R
/
I
)
→
Spec
(
R
)
{\displaystyle \operatorname {Spec} \left(R/I\right)\to \operatorname {Spec} (R)}
and
Spec
(
R
/
I
2
)
→
Spec
(
R
)
{\displaystyle \operatorname {Spec} \left(R/I^{2}\right)\to \operatorname {Spec} (R)}
may be different
morphisms , where
R
{\displaystyle R}
is a
commutative ring and
I
{\displaystyle I}
is an
ideal of
R
.
{\displaystyle R.}
See also
Cofibration – continuous mapping between topological spacesPages displaying wikidata descriptions as a fallback
Identity function – In mathematics, a function that always returns the same value that was used as its argument
References
. Note that "insertion" is a function S → U and "inclusion" a relation S ⊂ U ; every inclusion relation gives rise to an insertion function.
^ "Arrows – Unicode" (PDF) . Unicode Consortium . Retrieved 2017-02-07 .
.