Definition: Path
Let
U
⊂
C
{\displaystyle U\subset \mathbb {C} }
be a subset. A path in
U
{\displaystyle U}
is a continuous mapping with:
γ
:
[
a
,
b
]
→
U
{\displaystyle \gamma \colon [a,b]\rightarrow U}
with
a
<
b
{\displaystyle a<b}
and
a
,
b
∈
R
{\displaystyle a,b\in \mathbb {R} }
.
Definition: Trace of a Path
The trace of a path
γ
:
[
a
,
b
]
→
U
{\displaystyle \gamma \colon [a,b]\rightarrow U}
in
U
⊂
C
{\displaystyle U\subset \mathbb {C} }
is the image or range of the function
γ
{\displaystyle \gamma }
:
T
r
a
c
e
(
γ
)
:=
γ
(
t
)
∈
C
|
t
∈
[
a
,
b
]
{\displaystyle \mathrm {Trace} (\gamma ):={\gamma (t)\in \mathbb {C} \ |\ t\in [a,b]}}
Definition: Closed Path
Let
γ
:
[
a
,
b
]
→
U
{\displaystyle \gamma \colon [a,b]\rightarrow U}
be a path in
U
⊂
C
{\displaystyle U\subset \mathbb {C} }
.
The mapping
γ
{\displaystyle \gamma }
is called a closed path if:
γ
(
a
)
=
γ
(
b
)
{\displaystyle \gamma (a)=\gamma (b)}
Definition: Region
Let
U
⊂
C
{\displaystyle U\subset \mathbb {C} }
be an open subset of
C
{\displaystyle \mathbb {C} }
. Then
U
{\displaystyle U}
is called a region.
Definition: Path-Connected
Let
U
⊂
C
{\displaystyle U\subset \mathbb {C} }
be a non-empty set.
U
{\displaystyle U}
is path-connected
:⟺
∀
z
1
,
z
2
∈
U
∃
γ
:
[
a
,
b
]
→
U
:
γ
(
a
)
=
z
1
∧
γ
(
b
)
=
z
2
∧
S
p
u
r
(
γ
)
⊆
U
{\displaystyle :\Longleftrightarrow \ \forall _{z_{1},z_{2}\in U}\exists _{\gamma \colon [a,b]\rightarrow U}:\ \gamma (a)=z_{1}\wedge \gamma (b)=z_{2}\wedge {Spur}(\gamma )\subseteq U}
Definition: Domain
Let
G
⊂
C
{\displaystyle G\subset \mathbb {C} }
be a non-empty subset of
C
{\displaystyle \mathbb {C} }
. If
G
{\displaystyle G}
is open
G
{\displaystyle G}
is path-connected
Then
G
{\displaystyle G}
is called a domain in
C
{\displaystyle \mathbb {C} }
.
Example (Circular Paths)
Let
z
o
∈
C
{\displaystyle z_{o}\in \mathbb {C} }
be a complex number, and let
r
>
0
{\displaystyle r>0}
be a radius. A circular path
γ
z
o
,
r
:
[
0
,
2
π
]
→
C
{\displaystyle \gamma _{z_{o},r}\colon [0,2\pi ]\rightarrow \mathbb {C} }
around
z
o
∈
C
{\displaystyle z_{o}\in \mathbb {C} }
is defined as:
γ
z
o
,
r
(
t
)
:=
z
o
+
r
⋅
e
i
⋅
t
{\displaystyle \gamma _{z_{o},r}(t):=z_{o}+r\cdot e^{i\cdot t}}
Example - Paths with Ellipse as Trace
Let
z
o
∈
C
{\displaystyle z_{o}\in \mathbb {C} }
be a complex number, and let
a
,
b
>
0
{\displaystyle a,b>0}
be the semi-axes of an ellipse. An elliptical path
γ
z
o
,
a
,
b
:
[
0
,
2
π
]
→
C
{\displaystyle \gamma _{z_{o},a,b}\colon [0,2\pi ]\rightarrow \mathbb {C} }
around
z
o
∈
C
{\displaystyle z_{o}\in \mathbb {C} }
is defined as:
γ
z
o
,
a
,
b
(
t
)
:=
z
o
+
a
⋅
cos
(
t
)
+
i
⋅
b
⋅
sin
(
t
)
{\displaystyle \gamma _{z_{o},a,b}(t):=z_{o}+a\cdot \cos(t)+i\cdot b\cdot \sin(t)}
Gardener's Construction of an Ellipse
Convex Combinations
Let
z
1
,
z
2
∈
C
{\displaystyle z_{1},z_{2}\in \mathbb {C} }
be complex numbers, and let
t
∈
[
0
,
1
]
{\displaystyle t\in [0,1]}
be a scalar. A path
γ
z
1
,
z
2
:
[
0
,
1
]
→
C
{\displaystyle \gamma _{z_{1},z_{2}}\colon [0,1]\rightarrow \mathbb {C} }
is defined such that its trace is the line segment connecting
z
1
,
z
2
∈
C
{\displaystyle z_{1},z_{2}\in \mathbb {C} }
:
γ
z
1
,
z
2
(
t
)
:=
(
1
−
t
)
⋅
z
1
+
t
⋅
z
2
{\displaystyle \gamma _{z_{1},z2}(t):=(1-t)\cdot z_{1}+t\cdot z_{2}}
Such a path is called a convex combination of the first order (see also Convex Combinations of higher order ).
Animation of a Convex Combination of Two Vectors as Mapping
Convex Combination as Mapping in an Animated GIF
Integration Path
Let
G
⊂
C
{\displaystyle G\subset \mathbb {C} }
be a domain. An integration path in
G
{\displaystyle G}
is a path that is piecewise continuously differentiable with
γ
:
[
a
,
b
]
→
U
{\displaystyle \gamma \colon [a,b]\rightarrow U}
with
a
<
b
{\displaystyle a<b}
and
a
,
b
∈
R
{\displaystyle a,b\in \mathbb {R} }
.
An integration path can, for example, be expressed piecewise as convex combinations between multiple points
z
1
,
…
z
n
∈
C
{\displaystyle z_{1},\ldots z_{n}\in \mathbb {C} }
. The overall path does not need to be differentiable at points
z
1
,
…
z
n
∈
C
{\displaystyle z_{1},\ldots z_{n}\in \mathbb {C} }
. The trace of such a path is also called a polygonal path.
See Also
Page Information
You can display this page as
Wiki2Reveal slides
Wiki2Reveal
TheWiki2Reveal slides were created for the Complex Analysis '
and the Link for the Wiki2Reveal Slides was created with the link generator .
Translation and Version Control
This page was translated based on the following [https://de.wikiversity.org/wiki/Kurs:Funktionentheorie/Wege
Wikiversity source page] and uses the concept of Translation and Version Control for a transparent language fork in a Wikiversity:
https://de.wikiversity.org/wiki/Kurs:Funktionentheorie/Wege