TheoremBase

Integrability is expressed through the predicative Darboux-sum formulas, the lower and upper integrals being characterised by bounds; integrability on a subinterval adds the restriction, described by pair membership, and definedness is the disjunction of equal endpoints with two instances of it; renaming then places the variables.

Proof

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; 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,…,x7x_{0},\dots,x_{7} are distinct also when N<8N<8; the parameters, at their fixed values as in Conditions Expressed by a Predicative Formula, and Guards (i), are distinct from x0,x1,…x_{0},x_{1},\dots, and the bound variables of ψL\psi_{L}, ψU\psi_{U} and of the formulas of the cited lemmas are chosen other than x0,…,x7x_{0},\dots,x_{7} and the parameters, while bound variables of the formulas built here are renamed where needed so that none is captured, as in Renaming and Substituting Variables in Predicative Formulas (i); and routine facts about maps and sets, among them that real numbers are sets and that a subclass of a set is a set, are used without comment (Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity).

A formula built from predicative formulas by connectives and by quantifiers over set variables is predicative (Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (v)). For a predicative formula φ\varphi in x0,…,xm−1x_{0},\dots,x_{m-1} and indices n0,…,nm−1n_{0},\dots,n_{m-1}, φ(xn0,…,xnm−1)\varphi(x_{n_{0}},\dots,x_{n_{m-1}}) is the formula of Renaming and Substituting Variables in Predicative Formulas (i): a predicative formula in x0,…,xn−1x_{0},\dots,x_{n-1}, for every nn larger than all nrn_{r}, which holds exactly when φ\varphi holds with the set assigned to xnrx_{n_{r}} assigned to xrx_{r}, r<mr<m. Pair memberships (s,t)∈w(s,t)\in w and equations p=(s,t)p=(s,t) are the predicative formulas 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 (ii); s≤ts\le t and s<ts<t stand for the memberships of the pair (s,t)(s,t) in the parameters ≤\le and << of R\mathbb{R} (The Real Line: Standing Notation and Background for Calculus on Intervals (ii)), which hold exactly when s,t∈Rs,t\in\mathbb{R} and s≤ts\le t, respectively s<ts<t; and μ(F,A,B)\mu(F,A,B) is the predicative formula 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), which holds exactly when FF is a map F:A→BF:A\to B.

The Darboux formulas. By Predicative Formulas for Upper and Lower Darboux Sums, and the Maps and Sets of Darboux Sums over All Partitions (i), with x0,…,x4x_{0},\dots,x_{4} put for its set variables aa, bb, ff, PP and zz (Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (i)), there are predicative formulas ψL\psi_{L} and ψU\psi_{U} in x0,…,x4x_{0},\dots,x_{4}, whose parameters are among those of the statement, with the following meaning. For sets aa, bb, ff, PP and ss assigned to x0,…,x4x_{0},\dots,x_{4}, ψL\psi_{L} holds if and only if a,b∈Ra,b\in\mathbb{R}, a<ba<b, ff is a bounded map f:[a,b]→Rf:[a,b]\to\mathbb{R}, P∈Πa,bP\in\Pi_{a,b} and s=L(f,P)s=L(f,P), the lower sum; and ψU\psi_{U} holds if and only if the same holds with the upper sum U(f,P)U(f,P) in place of L(f,P)L(f,P). By Partitions of a Closed Interval, the Set of Partitions, and Refinements (ii), P∈Πa,bP\in\Pi_{a,b} means that PP is a partition of [a,b][a,b].

Integrable functions. In this paragraph aa, bb, ff, zz, PP, ss and cc denote x0,…,x6x_{0},\dots,x_{6}, and ψL(a,b,f,P,s)\psi_{L}(a,b,f,P,s) and ψU(a,b,f,P,s)\psi_{U}(a,b,f,P,s) are ψL(x0,x1,x2,x4,x5)\psi_{L}(x_{0},x_{1},x_{2},x_{4},x_{5}) and ψU(x0,x1,x2,x4,x5)\psi_{U}(x_{0},x_{1},x_{2},x_{4},x_{5}). Let

Lo:z∈R∧∃P ∃s ψL(a,b,f,P,s)∧∀P ∀s (ψL(a,b,f,P,s)⇒s≤z)∧∀c ((c∈R∧∀P ∀s (ψL(a,b,f,P,s)⇒s≤c))⇒z≤c),\mathrm{Lo}:\quad z\in\mathbb{R}\wedge\exists P\,\exists s\,\psi_{L}(a,b,f,P,s)\wedge\forall P\,\forall s\,\bigl(\psi_{L}(a,b,f,P,s)\Rightarrow s\le z\bigr)\wedge\forall c\,\Bigl(\bigl(c\in\mathbb{R}\wedge\forall P\,\forall s\,(\psi_{L}(a,b,f,P,s)\Rightarrow s\le c)\bigr)\Rightarrow z\le c\Bigr),

let Up\mathrm{Up} be obtained from Lo\mathrm{Lo} by putting ψU\psi_{U} for ψL\psi_{L} and z≤sz\le s, c≤sc\le s and c≤zc\le z for s≤zs\le z, s≤cs\le c and z≤cz\le c, and let

ε=∃z (Lo∧Up).\varepsilon=\exists z\,(\mathrm{Lo}\wedge\mathrm{Up}).

These formulas are predicative; the free variables of Lo\mathrm{Lo} and Up\mathrm{Up} are among a,b,f,za,b,f,z and the parameters, and those of ε\varepsilon among a,b,fa,b,f and the parameters.

Let sets aa, bb, ff and zz be assigned to x0,…,x3x_{0},\dots,x_{3}. If a,b∈Ra,b\in\mathbb{R} and a<ba<b, then [a,b][a,b] has a partition: {a,b}={a}∪{b}\{a,b\}=\{a\}\cup\{b\} is finite by Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (iii) and Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (v), contains aa and bb, and is a subset of [a,b][a,b] by Intervals of the Real Line (ii), as a≤a≤ba\le a\le b and a≤b≤ba\le b\le b, so it is a partition of [a,b][a,b] by Partitions of a Closed Interval, the Set of Partitions, and Refinements (i). Therefore ∃P ∃s ψL(a,b,f,P,s)\exists P\,\exists s\,\psi_{L}(a,b,f,P,s) holds if and only if a,b∈Ra,b\in\mathbb{R}, a<ba<b and ff is a bounded map f:[a,b]→Rf:[a,b]\to\mathbb{R}. In that case the remaining conjuncts of Lo\mathrm{Lo} say that z∈Rz\in\mathbb{R}, that L(f,R)≤zL(f,R)\le z for every partition RR of [a,b][a,b], and that z≤cz\le c for every c∈Rc\in\mathbb{R} with L(f,R)≤cL(f,R)\le c for every partition RR of [a,b][a,b]. By Bounds for Darboux Sums, Monotonicity under Refinement, the Supremum of the Lower Sums and the Infimum of the Upper Sums, and Concatenation of Partitions (iv) exactly one real number has these properties, its number λ∗\lambda_{*}, and by The Riemann Integral on a Closed Interval via Lower and Upper Integrals (iii) this number is the lower integral of ff over [a,b][a,b]. So Lo\mathrm{Lo} holds if and only if a,b∈Ra,b\in\mathbb{R}, a<ba<b, ff is a bounded map f:[a,b]→Rf:[a,b]\to\mathbb{R} and zz is its lower integral; in the same way, with the number λ∗\lambda^{*} of Bounds for Darboux Sums, Monotonicity under Refinement, the Supremum of the Lower Sums and the Infimum of the Upper Sums, and Concatenation of Partitions (iv), Up\mathrm{Up} holds if and only if the same holds with the upper integral. Hence ε\varepsilon holds if and only if a,b∈Ra,b\in\mathbb{R}, a<ba<b, ff is a bounded map f:[a,b]→Rf:[a,b]\to\mathbb{R}, and

∫ab‾f=∫ab‾f.\underline{\int_{a}^{b}}f=\overline{\int_{a}^{b}}f .

By The Riemann Integral on a Closed Interval via Lower and Upper Integrals (iv) the last equation says that ff is integrable on [a,b][a,b]. So ε\varepsilon is a predicative formula in x0,x1,x2x_{0},x_{1},x_{2} expressing the condition of (i) with a=x0a=x_{0}, b=x1b=x_{1} and f=x2f=x_{2}. By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to 33, its nn equal to NN and σ(0)=i\sigma(0)=i, σ(1)=j\sigma(1)=j, σ(2)=k\sigma(2)=k, the formula ε(xi,xj,xk)\varepsilon(x_{i},x_{j},x_{k}) is a predicative formula in x0,…,xN−1x_{0},\dots,x_{N-1} expressing this condition with a=xia=x_{i}, b=xjb=x_{j} and f=xkf=x_{k}. This proves (i).

Integrability on a subinterval. In this paragraph EE, gg, uu, vv, hh, pp, tt and ww denote x0,…,x7x_{0},\dots,x_{7}, and ε(u,v,h)\varepsilon(u,v,h) is ε(x2,x3,x4)\varepsilon(x_{2},x_{3},x_{4}), which holds exactly when ε\varepsilon holds with the sets assigned to uu, vv and hh assigned to x0x_{0}, x1x_{1} and x2x_{2}. Let

θ:∀p (p∈h⇔(p∈g∧∃t ∃w (p=(t,w)∧u≤t∧t≤v))),\theta:\quad\forall p\,\Bigl(p\in h\Leftrightarrow\bigl(p\in g\wedge\exists t\,\exists w\,(p=(t,w)\wedge u\le t\wedge t\le v)\bigr)\Bigr), κ:∀t (t∈E⇒t∈R)∧μ(g,E,R)∧u∈R∧v∈R∧u<v∧∀t ((t∈R∧u≤t∧t≤v)⇒t∈E),\kappa:\quad\forall t\,(t\in E\Rightarrow t\in\mathbb{R})\wedge\mu(g,E,\mathbb{R})\wedge u\in\mathbb{R}\wedge v\in\mathbb{R}\wedge u<v\wedge\forall t\,\bigl((t\in\mathbb{R}\wedge u\le t\wedge t\le v)\Rightarrow t\in E\bigr),

and

β=κ∧∃h (θ∧ε(u,v,h)).\beta=\kappa\wedge\exists h\,\bigl(\theta\wedge\varepsilon(u,v,h)\bigr).

These formulas are predicative, and the free variables of β\beta are among E,g,u,vE,g,u,v and the parameters.

Let sets EE, gg, uu and vv be assigned to x0,…,x3x_{0},\dots,x_{3}. By Intervals of the Real Line (ii), κ\kappa holds if and only if E⊆RE\subseteq\mathbb{R}, gg is a map g:E→Rg:E\to\mathbb{R}, u,v∈Ru,v\in\mathbb{R}, u<vu<v and [u,v]⊆E[u,v]\subseteq E; if κ\kappa fails, both β\beta and the condition of (ii) fail. Suppose that κ\kappa holds. For a set hh, θ\theta holds if and only if h=g∣[u,v]h=g|_{[u,v]}: by The Restriction of a Function or Relation to a Class (i) the elements of g∣[u,v]g|_{[u,v]} are the pairs (t,w)∈g(t,w)\in g with t∈[u,v]t\in[u,v]; the first component of every pair in gg lies in E⊆RE\subseteq\mathbb{R}, so for such a pair t∈[u,v]t\in[u,v] if and only if u≤tu\le t and t≤vt\le v; and two sets with the same elements are equal (Class Theory NBG: the Axioms, Standing Conventions and Basic Notation (ii)). Hence the formula ∃h (θ∧ε(u,v,h))\exists h\,(\theta\wedge\varepsilon(u,v,h)) holds if and only if ε\varepsilon holds with uu, vv and g∣[u,v]g|_{[u,v]} assigned to x0x_{0}, x1x_{1} and x2x_{2}, that is, by the meaning of ε\varepsilon shown above, if and only if the restriction g∣[u,v]:[u,v]→Rg|_{[u,v]}:[u,v]\to\mathbb{R} is bounded and integrable on [u,v][u,v]. By The Riemann Integral on a Closed Interval via Lower and Upper Integrals (vi) this says that gg is integrable on [u,v][u,v]. So β\beta is a predicative formula in x0,…,x3x_{0},\dots,x_{3} expressing the condition of (ii) with E=x0E=x_{0}, g=x1g=x_{1}, u=x2u=x_{2} and v=x3v=x_{3}. By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to 44, its nn equal to NN and σ(0)=i\sigma(0)=i, σ(1)=j\sigma(1)=j, σ(2)=k\sigma(2)=k, σ(3)=l\sigma(3)=l, the formula β(xi,xj,xk,xl)\beta(x_{i},x_{j},x_{k},x_{l}) is a predicative formula in x0,…,xN−1x_{0},\dots,x_{N-1} expressing this condition with E=xiE=x_{i}, g=xjg=x_{j}, u=xku=x_{k} and v=xlv=x_{l}. This proves (ii).

Defined integrals. In this paragraph EE, gg, uu, vv and tt denote x0,…,x4x_{0},\dots,x_{4}, and β(E,g,v,u)\beta(E,g,v,u) is β(x0,x1,x3,x2)\beta(x_{0},x_{1},x_{3},x_{2}), which holds exactly when β\beta holds with the sets assigned to EE, gg, vv and uu assigned to x0x_{0}, x1x_{1}, x2x_{2} and x3x_{3}. Let

δ=∀t (t∈E⇒t∈R)∧μ(g,E,R)∧u∈E∧v∈E∧(u=v∨β∨β(E,g,v,u)).\delta=\forall t\,(t\in E\Rightarrow t\in\mathbb{R})\wedge\mu(g,E,\mathbb{R})\wedge u\in E\wedge v\in E\wedge\bigl(u=v\vee\beta\vee\beta(E,g,v,u)\bigr).

It is predicative, with free variables among E,g,u,vE,g,u,v and the parameters.

Let sets EE, gg, uu and vv be assigned to x0,…,x3x_{0},\dots,x_{3}. If E⊈RE\not\subseteq\mathbb{R}, or gg is not a map g:E→Rg:E\to\mathbb{R}, or u∉Eu\notin E, or v∉Ev\notin E, both δ\delta and the condition of (iii) fail. Otherwise u,v∈Ru,v\in\mathbb{R}, and by the meaning of β\beta shown above, β\beta holds if and only if u<vu<v, [u,v]⊆E[u,v]\subseteq E and gg is integrable on [u,v][u,v], and β(E,g,v,u)\beta(E,g,v,u) holds if and only if v<uv<u, [v,u]⊆E[v,u]\subseteq E and gg is integrable on [v,u][v,u], in the sense of The Riemann Integral on a Closed Interval via Lower and Upper Integrals (vi). So δ\delta holds if and only if u=vu=v, or one of these two conditions holds, which by The Riemann Integral on a Closed Interval via Lower and Upper Integrals (viii) says that ∫uvg\int_{u}^{v}g is defined. So δ\delta is a predicative formula in x0,…,x3x_{0},\dots,x_{3} expressing the condition of (iii) with E=x0E=x_{0}, g=x1g=x_{1}, u=x2u=x_{2} and v=x3v=x_{3}. By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to 44, its nn equal to NN and σ(0)=i\sigma(0)=i, σ(1)=j\sigma(1)=j, σ(2)=k\sigma(2)=k, σ(3)=l\sigma(3)=l, the formula δ(xi,xj,xk,xl)\delta(x_{i},x_{j},x_{k},x_{l}) is a predicative formula in x0,…,xN−1x_{0},\dots,x_{N-1} expressing this condition with E=xiE=x_{i}, g=xjg=x_{j}, u=xku=x_{k} and v=xlv=x_{l}. This proves (iii).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…