Arian.D
- 101
- 0
Skrew said:The last part is wrong.
The statement "|x_n - y_n| ->0 does not imply |f(x_n) -f(y_n)| -> 0"
Says that for every delta > 0 there exists a i such that |x_i - y_i| < delta but |f(x_i) - f(y_i)| >= constant.
In particular your constant epsilon does not change when disproveing uniform continuity, only the delta.
Also e^x is uniformly continuous on any bounded interval.
I don't understand why the last part is wrong :(. Where did 'i' come to play?
This is what I've done step by step written down in propositional calculus:
Suppose that \forall x_n, \forall y_n:|x_n - y_n| \to 0 \implies |f(x_n)-f(y_n)| \to 0 is false:
1) Negation: \exists x_n, \exists y_n: |x_n - y_n|\to 0 \land \neg(|f(x_n)-f(y_n)| \to 0)
2) conjunction elimination: \exists x_n, \exists y_n: \neg(|f(x_n)-f(y_n)| \to 0)
3) \neg(|f(x_n)-f(y_n)| \to 0) \equiv \forall\delta>0, \exists\epsilon>0 : |x_n - y_n|<\delta \implies |f(x_n)-f(y_n)|\geq \epsilon
4) \exists x_n, \exists y_n, \forall \delta>0, \exists \epsilon>0: |x_n-y_n|<\delta \implies |f(x_n)-f(y_n)| \geq \epsilon
5) \exists x_n, \exists y_n, \forall \delta>0, \exists \epsilon>0: |x_n-y_n|<\delta \implies |f(x_n)-f(y_n)| \geq \epsilon \equiv \neg(\forall\epsilon>0, \exists \delta>0, \forall x_n, \forall y_n : |x_n - y_n|<\delta \implies |f(x_n)-f(y_n)|<\epsilon)
This is what my argument was in symbolic logic, I usually suck at propositional calculus but when I write things in that way I find it easier to argue with people.