Proof 4.3.2
Proof 4.3.2
(b) Give another proof of this theorem using the sequential characterization of continuity
(from Theorem 4.3.2 (iv)).
proof 4.3.2.
Given f : A → R and g : B → R, assume that the range f(A) = { f(x) : x ∈ A }
is containedin the domain B so that the composition g ◦ f(x) = g(f(x)) is well - defined onA.
If f is continuous at arbitrarry c ∈ A, and if g is continuous at f(c) ∈ B,
∀𝜀 > 0 ∃𝛿1 > 0 |x - c| < 𝛿1 ⟹ |f(x) - f(c)| < 𝜀
∀𝜀 > 0 ∃𝛿2 > 0 |x - f(c)| < 𝛿2 ⟹ |g(x) - g(f(c))| < 𝜀
we notice x ∈ V𝛿2 (f(c)) and f(x) ∈ V𝜀 (f(c)), because for certain 𝛿 and 𝜀, f(x) and x fal into
Vr (f(c)) so we chose 𝛿 = min(𝛿 1 , 𝛿 2 ) and for 𝜀 of the first equation being equal to 𝛿, wivh give us
∀𝜀 > 0 ∃𝛿 > 0 |f(x) - f(c)| < 𝛿 and because the range f(A) = { f(x) : x ∈ A }
is containedin the domain B, ∀x ∈ A f(x) ∈ B so if y = f(x) y ∈ B, wich mean if f is continue on
c, g is continue in f(c), and using our delta
∀𝜀 > 0 ∃𝛿 > 0 |y - f(c)| < 𝛿 ⟹ |g(y) - g(f(c))| < 𝜀 ⟹ |g(f(x)) - g(f(c))| < 𝜀,
g ◦ f(x) = g(f(x)) , so because we chose c to be arbitrary, the statement hold for continuity of f
and g.
(b)f is continue for arbitrary c ∈ A, If (xn ) → c (with xn ∈ A), then f(xn ) → f(c), so we
take f(xn ) = wn and because g is continued, ∀x ∈ A f(x) ∈ B meaning (wn ) → f(c)
(with (wn ) ∈ B), g(wn ) → g(f(c)), wich is g(f(xn )) → g(f(c)), therfore by theorem 4.3.2
g(f(x)) is continue at g(f(c)), because c arbitrary by the condition described for f and g, for any
point c f is continue at and g continue at f(c), then the composition is continue at c.