Converges in Rn
A sequence is said to converge to
a
∈
R
n
if for every
ϵ
∈
R
+
there is an integer
N
such that for all
k
≥
N
we have
‖
x
k
−
a
‖
<
ϵ
and in this case we write
lim
k
→
∞
x
k
=
a
Convergence iff Limit gets arbitrarily Close to a Point
lim
k
→
∞
x
k
=
a
⟺
lim
k
→
∞
‖
x
k
−
a
‖
=
0
A Sequence in Rn Converges to a Point iff Each Component Converges
Suppose that we have the sequence
(
x
k
)
:
N
1
→
R
n
, then
lim
k
→
∞
x
k
=
a
⟺
lim
k
→
∞
x
k
,
i
=
a
i
for
i
∈
[
1
,
…
,
n
]
Cauchy in Rn
We say that a sequence
(
x
k
)
:
N
1
→
R
n
is cauchy if for every
ϵ
∈
R
+
there is an
N
∈
N
1
such that for all
k
,
l
≥
n
we have
‖
x
l
−
x
k
‖
<
ϵ
Complete Set in
R
n
Given
S
⊆
R
n
is complete if every cauchy sequence of points in
S
converges to a point in
S
.
Less Than or Equal to Iff Less Than Or Equal to With Epsilon
For any
x
,
y
∈
R
the statement
x
≤
y
is equivalent to
∀
ϵ
∈
R
+
,
x
<
y
+
ϵ
⟹
Suppose that
x
≤
y
then let
ϵ
∈
R
+
thus we know that
x
≤
y
<
y
+
ϵ
so then
x
<
y
+
ϵ
.
⟸
Suppose the latter, we'll prove the former, but for the sake of contradiction, assume that
x
>
y
, but then we know that
y
≤
y
+
(
x
−
y
2
)
≤
x
but on the other hand by considering
ϵ
=
x
−
y
2
we see that
x
<
y
+
(
x
−
y
2
)
this is a contradiction because we cannot have
α
≤
x
and
α
>
x
at the same time. Thus we must have
x
≤
y
Note that the same holds for strict inequalities because
x
<
y
⟹
x
≤
y
Closed Balls are Complete
Show that for any
p
∈
R
n
and
r
∈
R
+
, that
B
(
p
,
r
)
¯
is complete.
Suppose that
(
a
n
)
:
N
1
→
B
(
p
,
r
)
¯
converges to some point
c
, we'll prove that
c
∈
B
(
p
,
r
)
¯
. To show that
c
∈
B
(
p
,
r
)
¯
one has to prove that
‖
p
−
c
‖
≤
r
.
Since
(
a
n
)
→
c
, we know:
∀
ϵ
∈
R
+
,
∃
N
∈
N
1
,
st
∀
n
∈
N
1
,
n
≥
N
⟹
‖
a
n
−
c
‖
<
ϵ
Focusing on the last inequality we also have that
‖
p
−
c
‖
≤
‖
p
−
c
‖
+
‖
a
n
−
c
‖
<
ϵ
+
r
Thus we can conclude that for any
ϵ
∈
R
+
we have
‖
p
−
c
‖
<
ϵ
+
r
, therefore we have
‖
p
−
c
‖
<
r
as needed.
R
n
is Complete
Every cauchy sequence in
R
n
converges to a point in
R
n
If a Sequence in
R
n
Converges, Then their Norms Converge
lim
n
→
∞
x
n
=
a
⟹
lim
n
→
∞
‖
x
n
‖
=
‖
a
‖
Suppose the former, let
ϵ
∈
R
+
therefore we obtain an
N
′
∈
N
1
such that
‖
x
n
−
a
‖
<
ϵ
for any
n
≥
N
′
, take
N
=
N
′
recall that we need to show that for any
k
≥
N
we have that
|
‖
x
n
‖
−
‖
a
‖
|
<
ϵ
, but due to the reverse triangle inequality we have
|
‖
x
n
‖
−
‖
a
‖
|
≤
‖
x
n
−
a
‖
<
ϵ
we get exactly what we needed.
We can observe that the converse is false, simply by taking
x
n
=
e
i
for all
n
∈
N
1
and then for any
e
k
where
i
≠
k
we have that
lim
n
→
∞
‖
e
i
‖
=
‖
e
k
‖
simply because the norm of the one-hot vectors is always one, but clearly
e
i
≠
e
k
.