TheoremBase

Induction for the modulus of a power; epsilon-delta arguments from the modulus estimates for the continuity rules, and the metric composition lemma for compositions.

Proof

Routine facts about real and complex numbers, and the values of the pointwise defined functions f+gf+g, fgfg, Ī»f\lambda f, 1/g1/g, h∘fh\circ f, Re⁔f\operatorname{Re}f, Im⁔f\operatorname{Im}f, ∣f∣|f| and f‾\overline{f}, are used without comment (Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity); the continuity results cited below, stated for the earlier definitions of metric spaces and continuity, are read in the current ones by The Earlier and the New Versions of the Definitions of Metric Spaces, Convergence, Continuity and Compactness Agree (i) and The Earlier and the New Versions of the Definitions of Metric Spaces, Convergence, Continuity and Compactness Agree (vii). Distances in C\mathbb{C} are moduli of differences (Metric Spaces: Balls, the Metric Topology, and the Real and Complex Numbers as Metric Spaces (v)) and distances in R\mathbb{R} are absolute values of differences (Metric Spaces: Balls, the Metric Topology, and the Real and Complex Numbers as Metric Spaces (iv)).

The modulus of a power. We prove (i) by induction on nn. For n=0n=0 we have z0=1z^{0}=1 and ∣z∣0=1|z|^{0}=1 (Powers with Exponents in the Natural Numbers with Zero (ii)), and the modulus of the real number 11 is its absolute value 11 (The Modulus of a Complex Number (ii)); so both sides equal 11. Suppose now that ∣zn∣=∣z∣n|z^{n}|=|z|^{n}. By the laws of exponents, zn+1=znzz^{n+1}=z^{n}z (Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (i), Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (ii)), and the modulus is multiplicative (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (iv)); hence

∣zn+1∣=∣znāˆ£ā€‰āˆ£z∣=∣z∣nā€‰āˆ£z∣=∣z∣n+1,|z^{n+1}|=|z^{n}|\,|z|=|z|^{n}\,|z|=|z|^{n+1},

which completes the induction.

Constants and the identity. We prove (ii). Let ε>0\varepsilon>0. If ff is the constant function with value cc, then for every x∈Ax\in A the distance of f(x)=cf(x)=c and f(a)=cf(a)=c is ∣cāˆ’c∣=0<ε|c-c|=0<\varepsilon, so every Ī“>0\delta>0 meets the requirement of Continuous Map Between Metric Spaces (i). If (X,d)=(C,dC)(X,d)=(\mathbb{C},d_{\mathbb{C}}) and ff is the identity w↦ww\mapsto w on AA, then the distance of the values f(w)f(w) and f(a)f(a) is dC(w,a)d_{\mathbb{C}}(w,a), the very distance of the points; so Ī“=ε\delta=\varepsilon works.

Sums, products and scalar multiples. We prove (iii); let ff and gg be continuous at aa relative to AA. For x∈Ax\in A, the triangle inequality (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (vii)) and multiplicativity of the modulus (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (iv)) give

∣(f+g)(x)āˆ’(f+g)(a)āˆ£ā‰¤āˆ£f(x)āˆ’f(a)∣+∣g(x)āˆ’g(a)∣,∣λf(x)āˆ’Ī»f(a)∣=āˆ£Ī»āˆ£ā€‰āˆ£f(x)āˆ’f(a)∣,|(f+g)(x)-(f+g)(a)|\le|f(x)-f(a)|+|g(x)-g(a)|,\qquad|\lambda f(x)-\lambda f(a)|=|\lambda|\,|f(x)-f(a)|,

and, writing f(x)g(x)āˆ’f(a)g(a)=f(x)(g(x)āˆ’g(a))+g(a)(f(x)āˆ’f(a))f(x)g(x)-f(a)g(a)=f(x)\bigl(g(x)-g(a)\bigr)+g(a)\bigl(f(x)-f(a)\bigr),

∣f(x)g(x)āˆ’f(a)g(a)āˆ£ā‰¤āˆ£f(x)āˆ£ā€‰āˆ£g(x)āˆ’g(a)∣+∣g(a)āˆ£ā€‰āˆ£f(x)āˆ’f(a)∣.|f(x)g(x)-f(a)g(a)|\le|f(x)|\,|g(x)-g(a)|+|g(a)|\,|f(x)-f(a)|.

Let ε>0\varepsilon>0. For the product we choose in this order. First, by continuity of ff, choose Ī“1>0\delta_{1}>0 such that ∣f(x)āˆ’f(a)∣<1|f(x)-f(a)|<1 whenever x∈Ax\in A and d(a,x)<Ī“1d(a,x)<\delta_{1}; for such xx the triangle inequality gives ∣f(x)∣<∣f(a)∣+1|f(x)|<|f(a)|+1. Next choose Ī“2>0\delta_{2}>0 from the continuity of ff for the tolerance ε/(2(∣g(a)∣+1))\varepsilon/(2(|g(a)|+1)), and Ī“3>0\delta_{3}>0 from the continuity of gg for the tolerance ε/(2(∣f(a)∣+1))\varepsilon/(2(|f(a)|+1)). Finally let Ī“=min⁔(Ī“1,Ī“2,Ī“3)\delta=\min(\delta_{1},\delta_{2},\delta_{3}). For x∈Ax\in A with d(a,x)<Ī“d(a,x)<\delta the second display gives

∣f(x)g(x)āˆ’f(a)g(a)∣<(∣f(a)∣+1)ε2(∣f(a)∣+1)+∣g(a)∣ε2(∣g(a)∣+1)<ε,|f(x)g(x)-f(a)g(a)|<(|f(a)|+1)\frac{\varepsilon}{2(|f(a)|+1)}+|g(a)|\frac{\varepsilon}{2(|g(a)|+1)}<\varepsilon,

so fgfg is continuous at aa relative to AA. For f+gf+g, take the minimum of the Ī“\delta's that the continuity of ff and of gg provide for ε/2\varepsilon/2; for Ī»f\lambda f, take the Ī“\delta that the continuity of ff provides for ε/(∣λ∣+1)\varepsilon/(|\lambda|+1), since āˆ£Ī»āˆ£ā€‰Īµ/(∣λ∣+1)<ε|\lambda|\,\varepsilon/(|\lambda|+1)<\varepsilon. In each case the first display gives the required bound.

Reciprocals. We prove (iv); let gg be continuous at aa relative to AA and nowhere zero on AA. Since g(a)≠0g(a)\neq0, we have ∣g(a)∣>0|g(a)|>0 (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (iii)). Let ε>0\varepsilon>0; we choose in this order. First choose Ī“1>0\delta_{1}>0 such that ∣g(x)āˆ’g(a)∣<∣g(a)∣/2|g(x)-g(a)|<|g(a)|/2 whenever x∈Ax\in A and d(a,x)<Ī“1d(a,x)<\delta_{1}; for such xx the reverse triangle inequality (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (vii)) gives ∣g(x)āˆ£ā‰„āˆ£g(a)āˆ£āˆ’āˆ£g(x)āˆ’g(a)āˆ£ā‰„āˆ£g(a)∣/2|g(x)|\ge|g(a)|-|g(x)-g(a)|\ge|g(a)|/2, and so, by multiplicativity of the modulus and the modulus of an inverse (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (iv), Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (v)),

∣1g(x)āˆ’1g(a)∣=∣g(a)āˆ’g(x)∣∣g(x)āˆ£ā€‰āˆ£g(a)āˆ£ā‰¤2ā€‰āˆ£g(x)āˆ’g(a)∣∣g(a)∣2.\Bigl|\frac{1}{g(x)}-\frac{1}{g(a)}\Bigr|=\frac{|g(a)-g(x)|}{|g(x)|\,|g(a)|}\le\frac{2\,|g(x)-g(a)|}{|g(a)|^{2}}.

Next choose Γ2>0\delta_{2}>0 from the continuity of gg for the tolerance ε∣g(a)∣2/2\varepsilon|g(a)|^{2}/2. Finally let Γ=min⁔(Γ1,Γ2)\delta=\min(\delta_{1},\delta_{2}): for x∈Ax\in A with d(a,x)<Γd(a,x)<\delta the display is less than ε\varepsilon, so 1/g1/g is continuous at aa relative to AA.

Composition. Assertion (v) is the composition rule Continuity of Identity Maps, Compositions and Reciprocals (ii) applied with (X,dX)=(X,d)(X,d_{X})=(X,d), (Y,dY)=(Z,dZ)=(C,dC)(Y,d_{Y})=(Z,d_{Z})=(\mathbb{C},d_{\mathbb{C}}), the subsets AāŠ†XA\subseteq X and BāŠ†CB\subseteq\mathbb{C}, the inner map ff and the outer map hh.

Parts, modulus and conjugate. We prove (vi). For x∈Ax\in A put u=f(x)āˆ’f(a)u=f(x)-f(a). Additivity of the real and imaginary parts (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (ii)), the component bounds (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (vi)), the reverse triangle inequality (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (vii)), additivity of conjugation (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (i)) and ∣uā€¾āˆ£=∣u∣|\overline{u}|=|u| (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (iii)) give

∣Re⁔f(x)āˆ’Re⁔f(a)∣=∣Re⁔uāˆ£ā‰¤āˆ£u∣,∣Im⁔f(x)āˆ’Im⁔f(a)āˆ£ā‰¤āˆ£u∣,∣∣f(x)āˆ£āˆ’āˆ£f(a)āˆ£āˆ£ā‰¤āˆ£u∣,∣f(x)ā€¾āˆ’f(a)ā€¾āˆ£=∣u∣.|\operatorname{Re}f(x)-\operatorname{Re}f(a)|=|\operatorname{Re}u|\le|u|,\quad|\operatorname{Im}f(x)-\operatorname{Im}f(a)|\le|u|,\quad\bigl||f(x)|-|f(a)|\bigr|\le|u|,\quad|\overline{f(x)}-\overline{f(a)}|=|u|.

Hence, if ff is continuous at aa relative to AA and ε>0\varepsilon>0, the Ī“\delta that the continuity of ff provides for ε\varepsilon serves Re⁔f\operatorname{Re}f, Im⁔f\operatorname{Im}f, ∣f∣|f| and f‾\overline{f} at once. Conversely, suppose that Re⁔f\operatorname{Re}f and Im⁔f\operatorname{Im}f are continuous at aa relative to AA. Since ∣uāˆ£ā‰¤āˆ£Re⁔u∣+∣Im⁔u∣|u|\le|\operatorname{Re}u|+|\operatorname{Im}u| (Conjugation and Modulus of Complex Numbers: Field Automorphism, Real and Imaginary Parts, Multiplicativity, Inverses, Component Bounds, Triangle Inequalities and Finite Sums (vi)), given ε>0\varepsilon>0 the minimum of the Ī“\delta's that the continuity of Re⁔f\operatorname{Re}f and of Im⁔f\operatorname{Im}f provide for ε/2\varepsilon/2 serves ff.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…