TheoremBase

The epsilon-delta condition for a complex derivative is written as a predicative formula through the graphs of the sum and product of the complex numbers and of the distance, combined with predicative formulas for openness and for maps, moved to arbitrary variable positions, and fed to class comprehension.

Proof

Facts about maps and predicative formulas carried by Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (vi) are used without comment. Throughout, formulas are written with abbreviations as in Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (vi), a formula being predicative when it is so with its abbreviations eliminated, and the given x0,…,xnβˆ’1x_{0},\dots,x_{n-1} are the first of distinct set variables x0,x1,…x_{0},x_{1},\dots as in Renaming and Substituting Variables in Predicative Formulas, so that x0,x1,x2x_{0},x_{1},x_{2} are distinct also when n<3n<3. The parameters are those of the statement, at their fixed values as in Conditions Expressed by a Predicative Formula, and Guards (i); they are variables other than x0,x1,…x_{0},x_{1},\dots and other than the bound variables below, and C\mathbb{C}, dCd_{\mathbb{C}}, R\mathbb{R} and its element 00 are sets (dCd_{\mathbb{C}}, a map CΓ—Cβ†’R\mathbb{C}\times\mathbb{C}\to\mathbb{R}, lies in RCΓ—C\mathbb{R}^{\mathbb{C}\times\mathbb{C}} by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii) and The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i)). In formulas, βŠ•\oplus and βŠ™\odot denote the sum and product operations of C\mathbb{C}, which are binary operations on C\mathbb{C} (The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit (iii)), and for set variables rr and rβ€²r', r≀rβ€²r\le r' and r<rβ€²r<r' stand for (r,rβ€²)βˆˆβ‰€(r,r')\in{\le} and (r,rβ€²)∈<(r,r')\in{<}. Formulas of the forms (β‹…,β‹…)βˆˆβ‹…(\cdot,\cdot)\in\cdot and ((β‹…,β‹…),β‹…)βˆˆβ‹…((\cdot,\cdot),\cdot)\in\cdot are those of Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iii) and Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iv): they are predicative and, when sets are assigned to the variables inside the pairs, hold exactly when the corresponding membership of ordered pairs does. The letters Ξ΅,Ξ΄,a,b,c,h,m,q,s,t,v,y\varepsilon,\delta,a,b,c,h,m,q,s,t,v,y denote further set variables, distinct from one another, from x0,x1,…x_{0},x_{1},\dots and from the parameters.

Openness and maps. Write UU, ff and WW for x0x_{0}, x1x_{1} and x2x_{2}. By Kit for def:open-subset-metric-space (i), with its number of variables equal to 33 and its ii, jj, kk equal to 00, 11, 22, there is a predicative formula Ο‰\omega in x0,x1,x2x_{0},x_{1},x_{2}, with parameters among R\mathbb{R}, ++, 00 and ≀\le, that holds exactly when (x0,x1)(x_{0},x_{1}) is a metric space, x2βŠ†x0x_{2}\subseteq x_{0} and x2x_{2} is open in (x0,x1)(x_{0},x_{1}). By Renaming and Substituting Variables in Predicative Formulas (iii), with Ο„0=C\tau_{0}=\mathbb{C}, Ο„1=dC\tau_{1}=d_{\mathbb{C}} and Ο„2=x0\tau_{2}=x_{0}, respectively Ο„2=x2\tau_{2}=x_{2}, it yields predicative formulas Ο‰U\omega_{U} and Ο‰W\omega_{W} in x0,x1,x2x_{0},x_{1},x_{2}; as (C,dC)(\mathbb{C},d_{\mathbb{C}}) is a metric space (Metric Spaces: Balls, the Metric Topology, and the Real and Complex Numbers as Metric Spaces (v)), Ο‰U\omega_{U} holds exactly when UβŠ†CU\subseteq\mathbb{C} and UU is open in (C,dC)(\mathbb{C},d_{\mathbb{C}}), and Ο‰W\omega_{W} exactly when WβŠ†CW\subseteq\mathbb{C} and WW is open in (C,dC)(\mathbb{C},d_{\mathbb{C}}). Let ΞΌf\mu_{f} be the formula ΞΌ(F,A,B)\mu(F,A,B) of Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (vii) with x1x_{1}, x0x_{0} and C\mathbb{C} as its FF, AA and BB, its auxiliary set variables chosen pairwise distinct and distinct from the letters above and from the parameters; it is predicative and holds exactly when ff is a map f:Uβ†’Cf:U\to\mathbb{C}.

The formulas. Let

Ξ²(v,t,Ξ΄)=t∈Uβˆ§βˆƒm (((t,v),m)∈dC∧0<m∧m<Ξ΄),\beta(v,t,\delta)=t\in U\wedge\exists m\,\bigl(((t,v),m)\in d_{\mathbb{C}}\wedge0<m\wedge m<\delta\bigr), Ξ»(v,y,t,Ξ΅)=βˆƒaβ€‰βˆƒbβ€‰βˆƒcβ€‰βˆƒhβ€‰βˆƒqβ€‰βˆƒs ((t,a)∈f∧(v,b)∈f∧((c,b),a)βˆˆβŠ•βˆ§((h,v),t)βˆˆβŠ•βˆ§((q,h),c)βˆˆβŠ™βˆ§((q,y),s)∈dC∧s<Ξ΅),\lambda(v,y,t,\varepsilon)=\exists a\,\exists b\,\exists c\,\exists h\,\exists q\,\exists s\,\bigl((t,a)\in f\wedge(v,b)\in f\wedge((c,b),a)\in{\oplus}\wedge((h,v),t)\in{\oplus}\wedge((q,h),c)\in{\odot}\wedge((q,y),s)\in d_{\mathbb{C}}\wedge s<\varepsilon\bigr), ΞΊ(v,y)=βˆ€Ξ΅β€‰((Ρ∈R∧0<Ξ΅)β‡’βˆƒΞ΄β€‰(δ∈R∧0<Ξ΄βˆ§βˆ€t (Ξ²(v,t,Ξ΄)β‡’Ξ»(v,y,t,Ξ΅)))),\kappa(v,y)=\forall\varepsilon\,\Bigl((\varepsilon\in\mathbb{R}\wedge0<\varepsilon)\Rightarrow\exists\delta\,\bigl(\delta\in\mathbb{R}\wedge0<\delta\wedge\forall t\,(\beta(v,t,\delta)\Rightarrow\lambda(v,y,t,\varepsilon))\bigr)\Bigr), Ο†=Ο‰U∧μfβˆ§βˆ€v (v∈Wβ‡’v∈U)βˆ§Ο‰Wβˆ§βˆ€v (v∈Wβ‡’βˆƒy (y∈C∧κ(v,y))).\varphi=\omega_{U}\wedge\mu_{f}\wedge\forall v\,(v\in W\Rightarrow v\in U)\wedge\omega_{W}\wedge\forall v\,\bigl(v\in W\Rightarrow\exists y\,(y\in\mathbb{C}\wedge\kappa(v,y))\bigr).

The formulas Ο‰U\omega_{U}, Ο‰W\omega_{W}, ΞΌf\mu_{f} and the pair and operation memberships are predicative, so they contain no quantifier over a class variable, and every other quantifier above is over a set variable; so Ο†\varphi is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i). The free variables of ΞΊ(v,y)\kappa(v,y) are among x0x_{0}, x1x_{1}, vv, yy and the parameters, so those of Ο†\varphi are among x0x_{0}, x1x_{1}, x2x_{2} and the parameters.

What ΞΊ\kappa says. Let sets UU, ff, zz and LL be assigned to x0x_{0}, x1x_{1}, vv and yy, where UU is an open subset of (C,dC)(\mathbb{C},d_{\mathbb{C}}), ff is a map f:Uβ†’Cf:U\to\mathbb{C}, z∈Uz\in U and L∈CL\in\mathbb{C}. Let Ξ΄,Ρ∈R\delta,\varepsilon\in\mathbb{R} and let tt be a set.

First, Ξ²(v,t,Ξ΄)\beta(v,t,\delta) holds if and only if t∈Ut\in U and 0<∣tβˆ’z∣<Ξ΄0<|t-z|<\delta: for t∈Ut\in U, the pair (t,z)(t,z) lies in CΓ—C\mathbb{C}\times\mathbb{C}, the domain of dCd_{\mathbb{C}}, so ((t,z),m)∈dC((t,z),m)\in d_{\mathbb{C}} holds exactly for m=dC(t,z)m=d_{\mathbb{C}}(t,z) (Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (x)), and dC(t,z)=∣tβˆ’z∣d_{\mathbb{C}}(t,z)=|t-z| by The Distance on the Complex Numbers (i).

Second, let t∈Ut\in U with 0<∣tβˆ’z∣0<|t-z|; then tβˆ’zβ‰ 0t-z\neq0, as ∣0∣=0|0|=0. As ff is a map Uβ†’CU\to\mathbb{C}, (t,a)∈f(t,a)\in f holds exactly for a=f(t)a=f(t) and (z,b)∈f(z,b)\in f exactly for b=f(z)b=f(z), and these are complex numbers. By Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (xi), applied to βŠ•\oplus and βŠ™\odot, the formula ((c,b),a)βˆˆβŠ•((c,b),a)\in{\oplus} then holds exactly when c∈Cc\in\mathbb{C} and c+f(z)=f(t)c+f(z)=f(t), that is, for c=f(t)βˆ’f(z)c=f(t)-f(z); ((h,z),t)βˆˆβŠ•((h,z),t)\in{\oplus} exactly for h=tβˆ’zh=t-z; and ((q,h),c)βˆˆβŠ™((q,h),c)\in{\odot} exactly when q∈Cq\in\mathbb{C} and q(tβˆ’z)=cq(t-z)=c, that is, as tβˆ’zβ‰ 0t-z\neq0 and C\mathbb{C} is a field (The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit (v)), for q=c/(tβˆ’z)q=c/(t-z) (Negatives, Differences, Reciprocals and Quotients (ii)). For such qq, ((q,L),s)∈dC((q,L),s)\in d_{\mathbb{C}} holds exactly for s=dC(q,L)=∣qβˆ’L∣s=d_{\mathbb{C}}(q,L)=|q-L|, as in the first step. So Ξ»(v,y,t,Ξ΅)\lambda(v,y,t,\varepsilon) holds if and only if

∣f(t)βˆ’f(z)tβˆ’zβˆ’L∣<Ξ΅.\Bigl|\frac{f(t)-f(z)}{t-z}-L\Bigr|<\varepsilon .

Hence ΞΊ(v,y)\kappa(v,y) holds if and only if for every real Ξ΅>0\varepsilon>0 there is a real Ξ΄>0\delta>0 such that every t∈Ut\in U with 0<∣tβˆ’z∣<Ξ΄0<|t-z|<\delta satisfies this inequality, that is, by The Complex Derivative at a Point (i), if and only if LL is a complex derivative of ff at zz. Consequently βˆƒy (y∈C∧κ(v,y))\exists y\,(y\in\mathbb{C}\wedge\kappa(v,y)) holds, with zz assigned to vv, if and only if ff has a complex derivative at zz, that is, is complex differentiable at zz.

What Ο†\varphi says. Let sets UU, ff and WW be assigned to x0x_{0}, x1x_{1} and x2x_{2}. By the paragraph on openness and maps and by Subclasses and Subsets (i), the first four conjuncts of Ο†\varphi hold exactly when UβŠ†CU\subseteq\mathbb{C} and UU is open in (C,dC)(\mathbb{C},d_{\mathbb{C}}), ff is a map f:Uβ†’Cf:U\to\mathbb{C}, WβŠ†UW\subseteq U, and WβŠ†CW\subseteq\mathbb{C} is open in (C,dC)(\mathbb{C},d_{\mathbb{C}}); if one of them fails, Ο†\varphi fails, and so does the condition of (i). If they hold, then every z∈Wz\in W lies in UU, so by the previous paragraph, with zz assigned to vv, the last conjunct says that ff is complex differentiable at every point of WW, that is, by Holomorphic Functions and Their Derivatives (i), that ff is holomorphic on WW. So Ο†\varphi is a predicative formula in x0,x1,x2x_{0},x_{1},x_{2}, in the sense of Renaming and Substituting Variables in Predicative Formulas, expressing the condition of (i) with U=x0U=x_{0}, f=x1f=x_{1} and W=x2W=x_{2}.

Renaming to arbitrary positions. By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to 33 and Οƒ(0)=i\sigma(0)=i, Οƒ(1)=j\sigma(1)=j and Οƒ(2)=k\sigma(2)=k, the formula Ο†(xi,xj,xk)\varphi(x_{i},x_{j},x_{k}) is a predicative formula in x0,…,xnβˆ’1x_{0},\dots,x_{n-1} that holds, under every assignment of sets to x0,…,xnβˆ’1x_{0},\dots,x_{n-1}, exactly when the condition of (i) holds for U=xiU=x_{i}, f=xjf=x_{j} and W=xkW=x_{k}. This proves (i).

The class of holomorphic functions. Let UU be an open subset of (C,dC)(\mathbb{C},d_{\mathbb{C}}) and let WβŠ†UW\subseteq U be open in (C,dC)(\mathbb{C},d_{\mathbb{C}}); UU and WW are sets, being subclasses of the set C\mathbb{C} (Subclasses of Sets Are Sets, the Union and Power Set of a Set Exist Uniquely, Binary Unions of Sets Are Sets, and the Universal Class Is Proper (i)). Apply The Class Comprehension Theorem for Predicative Formulas (i) to Ο†\varphi with its abbreviations eliminated, with x1x_{1} as its single variable and x0x_{0} and x2x_{2} (assigned UU and WW) and the parameters of the statement as its parameters. It gives a class HH whose elements are exactly the sets ff for which Ο†\varphi holds with ff assigned to x1x_{1} (the one-entry tuple ⟨f⟩\langle f\rangle is ff by The Ordered Pair of Two Sets and Nested Tuples (ii)), that is, as the hypotheses on UU and WW hold, the sets ff that are maps f:Uβ†’Cf:U\to\mathbb{C} holomorphic on WW. Every element of HH is a set (Classes, Membership, Sets and Proper Classes (i)), and so is every map f:Uβ†’Cf:U\to\mathbb{C}, as an element of the class CU\mathbb{C}^{U} of functions from UU to C\mathbb{C} (The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i)), UU and C\mathbb{C} being sets. So for every class ff, f∈Hf\in H if and only if ff is a map f:Uβ†’Cf:U\to\mathbb{C} holomorphic on WW. This proves (ii).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…