We first prove that for any and
ϵ
∈
R
+
there exists some integer
N
∈
N
1
and
r
∈
R
+
such that
|
x
−
x
0
|
≤
r
⟹
|
g
N
(
x
)
|
≤
ϵ
where
g
n
(
x
)
=
f
(
x
)
−
f
n
(
x
)
This follows from a few facts, we first start with continuity of
f
,
f
n
, specifically at
x
0
and therefore using
ϵ
we obtain some
δ
1
∈
R
+
such that
f
(
B
(
x
0
,
δ
1
)
)
⊆
B
(
g
n
(
x
0
)
,
ϵ
)
, similarly we have a
δ
2
∈
R
+
such that
f
(
B
(
x
0
,
δ
2
)
)
⊆
B
(
f
(
x
0
)
,
ϵ
)
, then also we know that since
f
n
→
pw
f
then since it's true at
x
0
and using
ϵ
we obtain some
K
∈
N
1
such that for all
n
∈
N
K
we have
|
f
n
(
x
0
)
|
−
f
(
x
0
)
≤
ϵ
Now we combine using the triangle inequality, so let
ϵ
∈
R
+
, then let
r
=
min
(
δ
1
,
δ
2
)
so that we obtain the inequalities mentioned in the previous paragraph, and we get some
K
∈
N
1
as mentioned in the previous paragrah, then
|
g
K
(
x
)
|
=
|
f
(
x
)
−
f
K
(
x
)
|
≤
|
f
(
x
)
−
f
(
x
0
)
|
+
|
f
(
x
0
)
−
f
K
(
x
0
)
|
+
|
f
K
(
x
0
)
−
f
K
(
x
)
|
≤
3
ϵ
With that out of the way suppose for the sake of contradiction that
f
n
doesn't convege uniformly to
f
, since
f
−
f
n
is eventually bounded then this is equivalent to
lim
n
→
∞
‖
f
−
f
n
‖
∞
=
d
∈
R
+
Since
g
n
is continuous as the sum of continuous functions and has compact domain then by EVT, we know that it attains its max and min, and therefore there exists a
x
k
∈
[
a
,
b
]
such that
‖
f
−
f
k
‖
∞
=
g
k
(
x
k
)
, so we have
lim
k
→
∞
g
k
(
x
k
)
=
d
, and note that this means that for any
ϵ
′
∈
R
+
there is some
J
∈
N
1
such that for all
j
∈
N
J
we have
|
g
j
(
x
j
)
−
d
|
<
ϵ
′
which implies that
d
−
ϵ
′
≤
g
j
(
x
j
)
.
Since
x
k
is in a compact set it has a convergent subsequence
x
n
k
→
x
∈
[
a
,
b
]
. Now recall the fact we proved initially, by using
d
−
ϵ
we know that there is some
N
∈
N
1
such that
g
N
(
x
)
<
d
−
ϵ
, now at the same time the inequality discussed in the previous paragraph also holds on the subsequence (this is because if a sequence goes somewhere, then any subsequence must also go there), namely we have some
J
∈
N
1
such that for all
j
∈
N
J
d
−
ϵ
≤
g
n
j
(
x
n
j
)
but then there is some
i
such that
n
i
>
max
(
N
,
J
)
and therefore
g
i
<
g
N
and so chaining inequalities we have
d
−
ϵ
≤
g
n
i
(
x
x
i
)
≤
g
N
(
x
)
≤
d
−
ϵ
which is a contradiction, and therefore
f
n
→
unif
f