We need to assume that fn→f uniformly on S. Hence, ∃N∈N∀m,n⩾N:∣fn(x)−fm(x)∣<1. Also ∃C1,C2,⋯>0:∣fn(x)∣⩽Cn,x∈S,n∈N. So, for n⩾N,x∈S we have ∣fn(x)∣⩽∣fn(x)−fN(x)∣+∣fN(x)∣<1+CN. Taking C=max{C1,…,CN}+1 we have ∀n∈N:∣fn(x)∣⩽C because max{C1,…,CN} bounds ∣fn∣ for n<N.
Comments