Need a little help with this {f_n} converging to f(x) proof

  • Thread starter Thread starter jinsing
  • Start date Start date
  • Tags Tags
    Converging Proof
jinsing
Messages
29
Reaction score
0

Homework Statement



Suppose that f_n \stackrel{P}{\rightarrow} f on S. Given \epsilon >0 define E_{\epsilon,n}=\{x\in S \mid |f_n(x)-f(x)|<\epsilon\}.
Prove that \forall \epsilon >0 \cup_{n=1}^\infty E_{\epsilon,n}=S.

Homework Equations



Know about measurability, pointwise convergence etc.


The Attempt at a Solution



I came up with this proof, but I'm not entirely sure it's right. It's also not very formalized..but besides that it almost seems like it's missing something:

Assume {f_n} -> f pointwise on S, and given epsilon>0 define E as above. Note that E = \bigcap_{n=1}^\infty \{x \mid |f_n(x) - f(x)| < \epsilon\}.
Since each f_n is measurable and f_n -> f pointwise, then we know f_n-f is measurable for all n in N, and so \{x \mid f_n(x) - f(x)| < \epsilon\} is measurable for all n in N, thus E_{n,\epsilon} is a countable intersection of measurable sets and therefore measurable.
Note that E_{n,epsilon} is contained in E_{n+1,epsilon} for all n in N. Note also that since f_n -> f pointwise for all x in S, f_n(x) -> f(x) as n->\infty. So for all x in S there exists a k in N such that whenever N\geq k |f_N(x) - f(x)| < \epsilon. Hence for all x in S, x is in E_{n,\epsilon} for some n in N. Thus \bigcup_{n=1}^\infty E_{n, \epsilon} = S, as desired.

Thanks in advance, guys!
 
Last edited:
Physics news on Phys.org
Imo this is a bad question. There is nothing to prove just write down the definition of pointwise convergence.

let x be an element of x. By Assumption for all ε>0 there exists M s.t. if n>M |fn(x) - f(x)| <ε. Hence x is an element of En for some n.
 
Yeah, it seemed suspiciously straight-forward to me too. I guess I was wondering if there was any discrepancy between the 'given epsilon > 0' and having to prove 'for all epsilon > 0.' Is this the same thing?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top