Dark Avorian wrote:Let f be a function defined on the reals. Let F be a function defined on the set of all sequences of reals as follows:
F(\left\{a_n\right\})=\left\{f(a_n)\right\}
And if * is an arbitrary binary operation on the reals... let us define a binary operation on sequences of reals as follows:
\left\{a_n\right\}\cdot\left\{b_n\right\}=\left\{a_n*b_n\right\}
Then are the following two statements equivalent?
F maps all Cauchy sequences to Cauchy sequences
F if two Cauchy sequences are equivalent (their difference converges to zero) then their images are equivalent (note that this merely means the difference approaches zero..not necessarily that they are Cauchy)
Yes. Suppose F maps Cauchy sequences to Cauchy sequences. Let A = {a
n} and B = {b
n} be equivalent Cauchy sequences. If F(A) and F(B) were not equivalent, then the Cauchy sequence given by interleaving terms C = a
1b
1a
2b
2… would have an image that is not Cauchy. This proves the forward implication.
Suppose instead that F sends equivalent Cauchy sequences to equivalent sequences. Let A = {a
n} be any Cauchy sequence, and let B = {b
n = b} be the unique constant sequence equivalent to A, which must exist by completeness of the reals. Clearly F(B) is Cauchy, since it is a constant sequence with every term equal to f(b). But F(A) is equivalent to F(B), so it must also be Cauchy. This proves the reverse implication, hence equivalence.
Dark Avorian wrote:And are these statements also equivalent?
* maps any pair of Cauchy sequences to another Cauchy sequence.
If {a} and {b} are equivalent and {c} and {d} are equivalent, then {a*c} is equivalent to {c*d}
Yes. Look at Cauchy sequences (A, B) in ℝ
2, whence * is just a function f:ℝ
2→ℝ. Now the previous result applies.