Enunciado
Sea X X X un espacio métrico y sean ( f n ) n ≥ 1 , ( g n ) n ≥ 1 : X → R (f_n)_{n \geq 1}, (g_n)_{n \geq 1} : X \to \mathbb{R} ( f n ) n ≥ 1 , ( g n ) n ≥ 1 : X → R dos sucesiones de funciones que convergen uniformemente a funciones f , g : X → R f, g : X \to \mathbb{R} f , g : X → R , respectivamente.
Probar que:
(a) La sucesión ( f n + g n ) n ≥ 1 (f_n + g_n)_{n \geq 1} ( f n + g n ) n ≥ 1 converge uniformemente a f + g f + g f + g .
(b) Si ambas sucesiones están uniformemente acotadas, entonces ( f n g n ) n ≥ 1 (f_n g_n)_{n \geq 1} ( f n g n ) n ≥ 1 converge uniformemente a f g fg f g .
a.
Dado E > 0 \mathcal{E}>0 E > 0 , quiero ver que existe n 0 ∈ N n_{0}\in \mathbb{N} n 0 ∈ N tal que:
∣ ( f n ( x ) + g n ( x ) − ( f ( x ) + g ( x ) ) ∣ < E ∀ n ≥ n 0 , ∀ x ∈ X |(f_{n}(x)+g_{n}(x)-(f(x)+g(x))|<\mathcal{E}\quad \forall n\geq n_{0},\forall x \in X ∣ ( f n ( x ) + g n ( x ) − ( f ( x ) + g ( x )) ∣ < E ∀ n ≥ n 0 , ∀ x ∈ X
En efecto:
∣ ( f n ( x ) + g n ( x ) − ( f ( x ) + g ( x ) ) ∣ = ∣ ( f n ( x ) − f ( x ) ) + ( g n ( x ) − g ( x ) ) ∣ ≤ des. triang. |(f_{n}(x)+g_{n}(x)-(f(x)+g(x))|=|(f_{n}(x)-f(x))+(g_{n}(x)-g(x))|\underset{ \text{des. triang.} }{ \leq } ∣ ( f n ( x ) + g n ( x ) − ( f ( x ) + g ( x )) ∣ = ∣ ( f n ( x ) − f ( x )) + ( g n ( x ) − g ( x )) ∣ des. triang. ≤
≤ ∣ f n ( x ) − f ( x ) ∣ + ∣ g n ( x ) − g ( x ) ∣ \leq |f_{n}(x)-f(x)|+|g_{n}(x)-g(x)| ≤ ∣ f n ( x ) − f ( x ) ∣ + ∣ g n ( x ) − g ( x ) ∣
Por convergencia uniforme
b.
Como ( f n ) n ∈ N ( f_{n} )_{n \in \mathbb{N}} ( f n ) n ∈ N y ( g n ) n ∈ N ( g_{n} )_{n \in \mathbb{N}} ( g n ) n ∈ N están acotadas uniformemente entonces:
∃ K 1 ∣ ∣ f n ( x ) ∣ < K 1 ∀ x ∈ X , n ∈ N ∃ K 2 ∣ ∣ g n ( x ) ∣ < K 2 ∀ x ∈ X , n ∈ N \begin{array}{c}
\:\exists\:K_{1}\:|\: |f_{n}(x)|<K_{1} & \forall x \in X, n \in \mathbb{N} \\
\:\exists\:K_{2}\:|\: |g_{n}(x)|<K_{2} & \forall x \in X, n \in \mathbb{N}
\end{array} ∃ K 1 ∣ ∣ f n ( x ) ∣ < K 1 ∃ K 2 ∣ ∣ g n ( x ) ∣ < K 2 ∀ x ∈ X , n ∈ N ∀ x ∈ X , n ∈ N
Dado E > 0 \mathcal{E}>0 E > 0 :
∣ f n . g n − f . g ∣ = ∣ f n . g n − f . g + f . g n − f . g n ∣ = ∣ g n . ( f n − f ) + f . ( g n − g ) ∣ ≤ ∣ g n ∣ . ∣ f n − f ∣ + ∣ f ∣ . ∣ g n − g ∣ \begin{array}{c}
|f_{n}.g_{n}-f.g|=|f_{n}.g_{n}-f.g+f.g_{n}-f.g_{n}|= \\
|g_{n}.(f_{n}-f)+f.(g_{n}-g)|\leq |g_{n}|.|f_{n}-f|+|f|.|g_{n}-g|
\end{array} ∣ f n . g n − f . g ∣ = ∣ f n . g n − f . g + f . g n − f . g n ∣ = ∣ g n . ( f n − f ) + f . ( g n − g ) ∣ ≤ ∣ g n ∣.∣ f n − f ∣ + ∣ f ∣.∣ g n − g ∣
Además:
∣ f ∣ = ∣ f + f n − f n ∣ ≤ ∣ f n − f ∣ + ∣ f n ∣ |f|=|f+f_{n}-f_{n}|\leq |f_{n}-f|+|f_{n}| ∣ f ∣ = ∣ f + f n − f n ∣ ≤ ∣ f n − f ∣ + ∣ f n ∣
Luego
∣ ( f n . g n ) − f . g ∣ < ∣ g n ∣ . ∣ f n − f ∣ + ( ∣ f n − f ∣ + ∣ f n ∣ ) . ∣ g n − g ∣ |(f_{n}.g_{n})-f.g|<|g_{n}|.|f_{n}-f|+(|f_{n}-f|+|f_{n}|).|g_{n}-g| ∣ ( f n . g n ) − f . g ∣ < ∣ g n ∣.∣ f n − f ∣ + ( ∣ f n − f ∣ + ∣ f n ∣ ) .∣ g n − g ∣
Por convergencia uniforme:
Existe N 1 N_1 N 1 tal que si n ≥ N 1 n \geq N_1 n ≥ N 1 , entonces ∣ f n − f ∣ < E 2 K 2 |f_n - f| < \frac{\mathcal{E}}{2K_2} ∣ f n − f ∣ < 2 K 2 E para todo x ∈ X x \in X x ∈ X .
Existe N 2 N_2 N 2 tal que si n ≥ N 2 n \geq N_2 n ≥ N 2 , entonces ∣ g n − g ∣ < E 2 ( K 1 + E 2. K 2 ) |g_n - g| < \frac{\mathcal{E}}{2\left( K_1 + \frac{\mathcal{E}}{2.K_{2}} \right)} ∣ g n − g ∣ < 2 ( K 1 + 2. K 2 E ) E para todo x ∈ X x \in X x ∈ X .
Sea N = max ( N 1 , N 2 ) N = \max(N_1, N_2) N = max ( N 1 , N 2 ) . Para n ≥ N n \geq N n ≥ N , tenemos:
∣ f n g n − f g ∣ = ∣ g n ∣ ⏟ < K 2 ⋅ ∣ f n − f ∣ ⏟ < E 2 K 2 + ( ∣ f n ∣ ⏟ < K 1 + ∣ f n − f ∣ ) ⋅ ∣ g n − g ∣ ⏟ < E 2 ( K 1 + E 2 K 2 ) |f_n g_n - fg|=\underset{<K_{2}}{\underbrace{|g_{n}|}} \cdot \underset{<\frac{\mathcal{E}}{2K_{2}}}{\underbrace{|f_{n}-f|}}+(\underset{<K_{1}}{\underbrace{|f_{n}|}} +|f_{n}-f|) \cdot \underset{<\frac{\mathcal{E}}{2\left( K_{1}+\frac{\mathcal{E}}{2K_{2}} \right)}}{\underbrace{|g_{n}-g|}} ∣ f n g n − f g ∣ = < K 2 ∣ g n ∣ ⋅ < 2 K 2 E ∣ f n − f ∣ + ( < K 1 ∣ f n ∣ + ∣ f n − f ∣ ) ⋅ < 2 ( K 1 + 2 K 2 E ) E ∣ g n − g ∣
∣ f n g n − f g ∣ < K 2 ⋅ E 2 K 2 + ( K 1 + E 2. K 2 ) ⋅ E 2 ( K 1 + E 2 K 2 ) = E 2 + E 2 = E . |f_n g_n - fg| < \cancel{ K_2 } \cdot \frac{\mathcal{E}}{2\cancel{ K_2 }} + \cancel{ \left( K_1 + \frac{\mathcal{E}}{2.K_{2}} \right) } \cdot \frac{\mathcal{E}}{2\cancel{ \left( K_1 + \frac{\mathcal{E}}{2K_{2}} \right) }} =\frac{\mathcal{E}}{2}+\frac{\mathcal{E}}{2}= \mathcal{E}. ∣ f n g n − f g ∣ < K 2 ⋅ 2 K 2 E + ( K 1 + 2. K 2 E ) ⋅ 2 ( K 1 + 2 K 2 E ) E = 2 E + 2 E = E .
Recapitulando me queda que
∣ f n ( x ) ⋅ g n ( x ) − f ( x ) ⋅ g ( x ) ∣ < E ∀ n ≥ N , ∀ x ∈ X |f_{n}(x)\cdot g_{n}(x)-f(x)\cdot g(x)|<\mathcal{E}\quad \forall n\geq N,\forall x \in X ∣ f n ( x ) ⋅ g n ( x ) − f ( x ) ⋅ g ( x ) ∣ < E ∀ n ≥ N , ∀ x ∈ X
E \mathcal{E} E era arbitrario. Entonces ( f n ⋅ g n ) n ≥ 1 ( f_{n}\cdot g_{n} )_{n\geq1} ( f n ⋅ g n ) n ≥ 1 converge uniformemente a f ⋅ g f\cdot g f ⋅ g .
□ \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \square □