- Source: Isometry
In mathematics, an isometry (or congruence, or congruent transformation) is a distance-preserving transformation between metric spaces, usually assumed to be bijective. The word isometry is derived from the Ancient Greek: ἴσος isos meaning "equal", and μέτρον metron meaning "measure". If the transformation is from a metric space to itself, it is a kind of geometric transformation known as a motion.
Introduction
Given a metric space (loosely, a set and a scheme for assigning distances between elements of the set), an isometry is a transformation which maps elements to the same or another metric space such that the distance between the image elements in the new metric space is equal to the distance between the elements in the original metric space.
In a two-dimensional or three-dimensional Euclidean space, two geometric figures are congruent if they are related by an isometry;
the isometry that relates them is either a rigid motion (translation or rotation), or a composition of a rigid motion and a reflection.
Isometries are often used in constructions where one space is embedded in another space. For instance, the completion of a metric space
M
{\displaystyle M}
involves an isometry from
M
{\displaystyle M}
into
M
′
,
{\displaystyle M',}
a quotient set of the space of Cauchy sequences on
M
.
{\displaystyle M.}
The original space
M
{\displaystyle M}
is thus isometrically isomorphic to a subspace of a complete metric space, and it is usually identified with this subspace.
Other embedding constructions show that every metric space is isometrically isomorphic to a closed subset of some normed vector space and that every complete metric space is isometrically isomorphic to a closed subset of some Banach space.
An isometric surjective linear operator on a Hilbert space is called a unitary operator.
Definition
Let
X
{\displaystyle X}
and
Y
{\displaystyle Y}
be metric spaces with metrics (e.g., distances)
d
X
{\textstyle d_{X}}
and
d
Y
.
{\textstyle d_{Y}.}
A map
f
:
X
→
Y
{\textstyle f\colon X\to Y}
is called an isometry or distance-preserving map if for any
a
,
b
∈
X
{\displaystyle a,b\in X}
,
d
X
(
a
,
b
)
=
d
Y
(
f
(
a
)
,
f
(
b
)
)
.
{\displaystyle d_{X}(a,b)=d_{Y}\!\left(f(a),f(b)\right).}
An isometry is automatically injective; otherwise two distinct points, a and b, could be mapped to the same point, thereby contradicting the coincidence axiom of the metric d, i.e.,
d
(
a
,
b
)
=
0
{\displaystyle d(a,b)=0}
if and only if
a
=
b
{\displaystyle a=b}
. This proof is similar to the proof that an order embedding between partially ordered sets is injective. Clearly, every isometry between metric spaces is a topological embedding.
A global isometry, isometric isomorphism or congruence mapping is a bijective isometry. Like any other bijection, a global isometry has a function inverse.
The inverse of a global isometry is also a global isometry.
Two metric spaces X and Y are called isometric if there is a bijective isometry from X to Y.
The set of bijective isometries from a metric space to itself forms a group with respect to function composition, called the isometry group.
There is also the weaker notion of path isometry or arcwise isometry:
A path isometry or arcwise isometry is a map which preserves the lengths of curves; such a map is not necessarily an isometry in the distance preserving sense, and it need not necessarily be bijective, or even injective. This term is often abridged to simply isometry, so one should take care to determine from context which type is intended.
Examples
Any reflection, translation and rotation is a global isometry on Euclidean spaces. See also Euclidean group and Euclidean space § Isometries.
The map
x
↦
|
x
|
{\displaystyle x\mapsto |x|}
in
R
{\displaystyle \mathbb {R} }
is a path isometry but not a (general) isometry. Note that unlike an isometry, this path isometry does not need to be injective.
Isometries between normed spaces
The following theorem is due to Mazur and Ulam.
Definition: The midpoint of two elements x and y in a vector space is the vector 1/2(x + y).
= Linear isometry
=Given two normed vector spaces
V
{\displaystyle V}
and
W
,
{\displaystyle W,}
a linear isometry is a linear map
A
:
V
→
W
{\displaystyle A:V\to W}
that preserves the norms:
‖
A
v
‖
W
=
‖
v
‖
V
{\displaystyle \|Av\|_{W}=\|v\|_{V}}
for all
v
∈
V
.
{\displaystyle v\in V.}
Linear isometries are distance-preserving maps in the above sense.
They are global isometries if and only if they are surjective.
In an inner product space, the above definition reduces to
⟨
v
,
v
⟩
V
=
⟨
A
v
,
A
v
⟩
W
{\displaystyle \langle v,v\rangle _{V}=\langle Av,Av\rangle _{W}}
for all
v
∈
V
,
{\displaystyle v\in V,}
which is equivalent to saying that
A
†
A
=
Id
V
.
{\displaystyle A^{\dagger }A=\operatorname {Id} _{V}.}
This also implies that isometries preserve inner products, as
⟨
A
u
,
A
v
⟩
W
=
⟨
u
,
A
†
A
v
⟩
V
=
⟨
u
,
v
⟩
V
{\displaystyle \langle Au,Av\rangle _{W}=\langle u,A^{\dagger }Av\rangle _{V}=\langle u,v\rangle _{V}}
.
Linear isometries are not always unitary operators, though, as those require additionally that
V
=
W
{\displaystyle V=W}
and
A
A
†
=
Id
V
{\displaystyle AA^{\dagger }=\operatorname {Id} _{V}}
(i.e. the domain and codomain coincide and
A
{\displaystyle A}
defines a coisometry).
By the Mazur–Ulam theorem, any isometry of normed vector spaces over
R
{\displaystyle \mathbb {R} }
is affine.
A linear isometry also necessarily preserves angles, therefore a linear isometry transformation is a conformal linear transformation.
Examples
A linear map from
C
n
{\displaystyle \mathbb {C} ^{n}}
to itself is an isometry (for the dot product) if and only if its matrix is unitary.
Manifold
An isometry of a manifold is any (smooth) mapping of that manifold into itself, or into another manifold that preserves the notion of distance between points.
The definition of an isometry requires the notion of a metric on the manifold; a manifold with a (positive-definite) metric is a Riemannian manifold, one with an indefinite metric is a pseudo-Riemannian manifold. Thus, isometries are studied in Riemannian geometry.
A local isometry from one (pseudo-)Riemannian manifold to another is a map which pulls back the metric tensor on the second manifold to the metric tensor on the first. When such a map is also a diffeomorphism, such a map is called an isometry (or isometric isomorphism), and provides a notion of isomorphism ("sameness") in the category Rm of Riemannian manifolds.
= Definition
=Let
R
=
(
M
,
g
)
{\displaystyle R=(M,g)}
and
R
′
=
(
M
′
,
g
′
)
{\displaystyle R'=(M',g')}
be two (pseudo-)Riemannian manifolds, and let
f
:
R
→
R
′
{\displaystyle f:R\to R'}
be a diffeomorphism. Then
f
{\displaystyle f}
is called an isometry (or isometric isomorphism) if
g
=
f
∗
g
′
,
{\displaystyle g=f^{*}g',}
where
f
∗
g
′
{\displaystyle f^{*}g'}
denotes the pullback of the rank (0, 2) metric tensor
g
′
{\displaystyle g'}
by
f
{\displaystyle f}
.
Equivalently, in terms of the pushforward
f
∗
,
{\displaystyle f_{*},}
we have that for any two vector fields
v
,
w
{\displaystyle v,w}
on
M
{\displaystyle M}
(i.e. sections of the tangent bundle
T
M
{\displaystyle \mathrm {T} M}
),
g
(
v
,
w
)
=
g
′
(
f
∗
v
,
f
∗
w
)
.
{\displaystyle g(v,w)=g'\left(f_{*}v,f_{*}w\right).}
If
f
{\displaystyle f}
is a local diffeomorphism such that
g
=
f
∗
g
′
,
{\displaystyle g=f^{*}g',}
then
f
{\displaystyle f}
is called a local isometry.
= Properties
=A collection of isometries typically form a group, the isometry group. When the group is a continuous group, the infinitesimal generators of the group are the Killing vector fields.
The Myers–Steenrod theorem states that every isometry between two connected Riemannian manifolds is smooth (differentiable). A second form of this theorem states that the isometry group of a Riemannian manifold is a Lie group.
Riemannian manifolds that have isometries defined at every point are called symmetric spaces.
Generalizations
Given a positive real number ε, an ε-isometry or almost isometry (also called a Hausdorff approximation) is a map
f
:
X
→
Y
{\displaystyle f\colon X\to Y}
between metric spaces such that
for
x
,
x
′
∈
X
{\displaystyle x,x'\in X}
one has
|
d
Y
(
f
(
x
)
,
f
(
x
′
)
)
−
d
X
(
x
,
x
′
)
|
<
ε
,
{\displaystyle |d_{Y}(f(x),f(x'))-d_{X}(x,x')|<\varepsilon ,}
and
for any point
y
∈
Y
{\displaystyle y\in Y}
there exists a point
x
∈
X
{\displaystyle x\in X}
with
d
Y
(
y
,
f
(
x
)
)
<
ε
{\displaystyle d_{Y}(y,f(x))<\varepsilon }
That is, an ε-isometry preserves distances to within ε and leaves no element of the codomain further than ε away from the image of an element of the domain. Note that ε-isometries are not assumed to be continuous.
The restricted isometry property characterizes nearly isometric matrices for sparse vectors.
Quasi-isometry is yet another useful generalization.
One may also define an element in an abstract unital C*-algebra to be an isometry:
a
∈
A
{\displaystyle a\in {\mathfrak {A}}}
is an isometry if and only if
a
∗
⋅
a
=
1.
{\displaystyle a^{*}\cdot a=1.}
Note that as mentioned in the introduction this is not necessarily a unitary element because one does not in general have that left inverse is a right inverse.
On a pseudo-Euclidean space, the term isometry means a linear bijection preserving magnitude. See also Quadratic spaces.
See also
Footnotes
References
Bibliography
Kata Kunci Pencarian:
- Isometry
- Quasi-isometry
- Isometry group
- Partial isometry
- Itô isometry
- Euclidean group
- Isometry (disambiguation)
- Euclidean space
- Euclidean plane isometry
- Fixed points of isometry groups in Euclidean space