TheoremBase

Proof

Unfolding dRd_{\mathbb{R}}, continuity of a map h:A→Rh:A\to\mathbb{R} at xx relative to AA says: for every ε∈R\varepsilon\in\mathbb{R} with 0<ε0<\varepsilon there is δ∈R\delta\in\mathbb{R} with 0<δ0<\delta such that every z∈Az\in A with d(x,z)<δd(x,z)<\delta satisfies ∣h(z)−h(x)∣<ε|h(z)-h(x)|<\varepsilon. We verify this form in each case. All references to numbered claims below are to Elementary Order Arithmetic in an Ordered Field unless another item is named.

Claim 1. Let b∈Rb\in\mathbb{R}, let hh be the constant map with value bb, and let 0<ε0<\varepsilon. Take δ=1\delta=1, which satisfies 0<10<1 by claim 6. For z∈Az\in A we have h(z)−h(x)=b−b=0h(z)-h(x)=b-b=0 by claim 3 of Additive Cancellation and Elementary Additive Identities in a Field, and ∣0∣=0|0|=0 by claim 1 of Properties of the Absolute Value in an Ordered Field, so ∣h(z)−h(x)∣=0<ε|h(z)-h(x)|=0<\varepsilon.

Claim 2. Let 0<ε0<\varepsilon. By claim 8 the element η=ε⋅2−1\eta=\varepsilon\cdot 2^{-1} satisfies 0<η0<\eta and η+η=ε\eta+\eta=\varepsilon. Continuity of ff and of gg at xx relative to AA gives δ1\delta_1 and δ2\delta_2, both positive, such that d(x,z)<δ1d(x,z)<\delta_1 implies ∣f(z)−f(x)∣<η|f(z)-f(x)|<\eta and d(x,z)<δ2d(x,z)<\delta_2 implies ∣g(z)−g(x)∣<η|g(z)-g(x)|<\eta, for z∈Az\in A. By claim 9 there is δ\delta with δ≤δ1\delta\le\delta_1, δ≤δ2\delta\le\delta_2 and δ\delta equal to δ1\delta_1 or to δ2\delta_2; in either case 0<δ0<\delta.

Let z∈Az\in A with d(x,z)<δd(x,z)<\delta. By claim 2 we get d(x,z)<δ1d(x,z)<\delta_1 and d(x,z)<δ2d(x,z)<\delta_2, hence ∣f(z)−f(x)∣<η|f(z)-f(x)|<\eta and ∣g(z)−g(x)∣<η|g(z)-g(x)|<\eta. By commutativity and associativity of addition together with claim 6 of Additive Cancellation and Elementary Additive Identities in a Field,

(f+g)(z)−(f+g)(x)=(f(z)−f(x))+(g(z)−g(x)),(f+g)(z)-(f+g)(x)=\bigl(f(z)-f(x)\bigr)+\bigl(g(z)-g(x)\bigr),

so claim 5 of Properties of the Absolute Value in an Ordered Field gives

∣(f+g)(z)−(f+g)(x)∣≤∣f(z)−f(x)∣+∣g(z)−g(x)∣.\bigl|(f+g)(z)-(f+g)(x)\bigr|\le|f(z)-f(x)|+|g(z)-g(x)|.

By claim 3 the right-hand side is smaller than η+η=ε\eta+\eta=\varepsilon, so claim 2 gives ∣(f+g)(z)−(f+g)(x)∣<ε|(f+g)(z)-(f+g)(x)|<\varepsilon.

Claim 3. Let 0<ε0<\varepsilon, and set M=∣g(x)∣+1M=|g(x)|+1 and N=∣f(x)∣+1N=|f(x)|+1. By claim 1 of Properties of the Absolute Value in an Ordered Field we have 0≤∣g(x)∣0\le|g(x)|, so 0+1≤∣g(x)∣+10+1\le|g(x)|+1 by compatibility of the order with addition in an ordered field; since 0<10<1 by claim 6 and 0+1=10+1=1, claim 2 gives 0<M0<M, and likewise 0<N0<N. By claim 7 the inverses M−1M^{-1} and N−1N^{-1} exist and are positive. By claim 8 the element η=ε⋅2−1\eta=\varepsilon\cdot 2^{-1} is positive with η+η=ε\eta+\eta=\varepsilon, and by claim 5 the elements η⋅M−1\eta\cdot M^{-1} and η⋅N−1\eta\cdot N^{-1} are positive.

Continuity of ff and of gg at xx relative to AA gives positive δ0,δ1,δ2\delta_0,\delta_1,\delta_2 such that, for z∈Az\in A: d(x,z)<δ0d(x,z)<\delta_0 implies ∣g(z)−g(x)∣<1|g(z)-g(x)|<1; d(x,z)<δ1d(x,z)<\delta_1 implies ∣f(z)−f(x)∣<η⋅M−1|f(z)-f(x)|<\eta\cdot M^{-1}; and d(x,z)<δ2d(x,z)<\delta_2 implies ∣g(z)−g(x)∣<η⋅N−1|g(z)-g(x)|<\eta\cdot N^{-1}. Applying claim 9 twice produces δ\delta with δ≤δ0\delta\le\delta_0, δ≤δ1\delta\le\delta_1, δ≤δ2\delta\le\delta_2 and δ\delta equal to one of them, so 0<δ0<\delta.

Let z∈Az\in A with d(x,z)<δd(x,z)<\delta, and put u=∣f(z)−f(x)∣u=|f(z)-f(x)| and v=∣g(z)−g(x)∣v=|g(z)-g(x)|; by claim 2 all three implications above apply, and 0≤u0\le u and 0≤v0\le v by claim 1 of Properties of the Absolute Value in an Ordered Field.

First, ∣g(z)∣=∣(g(z)−g(x))+g(x)∣≤v+∣g(x)∣|g(z)|=|(g(z)-g(x))+g(x)|\le v+|g(x)| by claim 5 of Properties of the Absolute Value in an Ordered Field, and v<1v<1 gives v+∣g(x)∣<1+∣g(x)∣=Mv+|g(x)|<1+|g(x)|=M by claim 1; so ∣g(z)∣<M|g(z)|<M by claim 2, and in particular ∣g(z)∣≤M|g(z)|\le M. Also ∣f(x)∣+0≤∣f(x)∣+1=N|f(x)|+0\le|f(x)|+1=N by compatibility of the order with addition applied to 0≤10\le 1, that is ∣f(x)∣≤N|f(x)|\le N.

By distributivity, commutativity and associativity in the field,

f(z)g(z)−f(x)g(x)=(f(z)−f(x))g(z)+f(x)(g(z)−g(x)),f(z)g(z)-f(x)g(x)=\bigl(f(z)-f(x)\bigr)g(z)+f(x)\bigl(g(z)-g(x)\bigr),

so claims 5 and 4 of Properties of the Absolute Value in an Ordered Field give

∣f(z)g(z)−f(x)g(x)∣≤u ∣g(z)∣+∣f(x)∣ v.\bigl|f(z)g(z)-f(x)g(x)\bigr|\le u\,|g(z)|+|f(x)|\,v.

Since 0≤u0\le u and ∣g(z)∣≤M|g(z)|\le M, claim 5 of Elementary Arithmetic in an Ordered Field gives u ∣g(z)∣≤u Mu\,|g(z)|\le u\,M. Since u<η⋅M−1u<\eta\cdot M^{-1} and 0<M0<M, claim 10 gives M u<M⋅(η⋅M−1)M\,u<M\cdot(\eta\cdot M^{-1}), and the right-hand side equals η\eta by associativity and commutativity of multiplication together with the defining property of the multiplicative inverse and of the multiplicative identity. As u M=M uu\,M=M\,u, claim 2 yields u ∣g(z)∣<ηu\,|g(z)|<\eta. The same argument with vv, ∣f(x)∣|f(x)| and NN in place of uu, ∣g(z)∣|g(z)| and MM yields ∣f(x)∣ v<η|f(x)|\,v<\eta.

By claim 3, u ∣g(z)∣+∣f(x)∣ v<η+η=εu\,|g(z)|+|f(x)|\,v<\eta+\eta=\varepsilon, and claim 2 gives ∣f(z)g(z)−f(x)g(x)∣<ε|f(z)g(z)-f(x)g(x)|<\varepsilon.

Claim 4. By claim 1 the constant map with value cc is continuous at xx relative to AA, and cfcf is its pointwise product with ff. Applying claim 3 with that constant map in place of ff and with ff in place of gg gives the assertion.

Claim 5. If ff and gg are continuous on AA, they are continuous at every point of AA relative to AA, so claims 2, 3 and 4 apply at every such point; hence f+gf+g, fgfg and cfcf are continuous at every point of AA relative to AA, that is, continuous on AA.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…