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.
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 are the first of distinct set variables as in Renaming and Substituting Variables in Predicative Formulas, so that are distinct also when ; the parameters, at their fixed values as in Conditions Expressed by a Predicative Formula, and Guards (i), are distinct from , and the bound variables of , and of the formulas of the cited lemmas are chosen other than 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 in and indices , is the formula of Renaming and Substituting Variables in Predicative Formulas (i): a predicative formula in , for every larger than all , which holds exactly when holds with the set assigned to assigned to , . Pair memberships and equations 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); and stand for the memberships of the pair in the parameters and of (The Real Line: Standing Notation and Background for Calculus on Intervals (ii)), which hold exactly when and , respectively ; and 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 is a map .
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 put for its set variables , , , 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 (i)), there are predicative formulas and in , whose parameters are among those of the statement, with the following meaning. For sets , , , and assigned to , holds if and only if , , is a bounded map , and , the lower sum; and holds if and only if the same holds with the upper sum in place of . By Partitions of a Closed Interval, the Set of Partitions, and Refinements (ii), means that is a partition of .
Integrable functions. In this paragraph , , , , , and denote , and and are and . Let
let be obtained from by putting for and , and for , and , and let
These formulas are predicative; the free variables of and are among and the parameters, and those of among and the parameters.
Let sets , , and be assigned to . If and , then has a partition: 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 and , and is a subset of by Intervals of the Real Line (ii), as and , so it is a partition of by Partitions of a Closed Interval, the Set of Partitions, and Refinements (i). Therefore holds if and only if , and is a bounded map . In that case the remaining conjuncts of say that , that for every partition of , and that for every with for every partition of . 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 , and by The Riemann Integral on a Closed Interval via Lower and Upper Integrals (iii) this number is the lower integral of over . So holds if and only if , , is a bounded map and is its lower integral; in the same way, with the number 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), holds if and only if the same holds with the upper integral. Hence holds if and only if , , is a bounded map , and
By The Riemann Integral on a Closed Interval via Lower and Upper Integrals (iv) the last equation says that is integrable on . So is a predicative formula in expressing the condition of (i) with , and . By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to , its equal to and , , , the formula is a predicative formula in expressing this condition with , and . This proves (i).
Integrability on a subinterval. In this paragraph , , , , , , and denote , and is , which holds exactly when holds with the sets assigned to , and assigned to , and . Let
and
These formulas are predicative, and the free variables of are among and the parameters.
Let sets , , and be assigned to . By Intervals of the Real Line (ii), holds if and only if , is a map , , and ; if fails, both and the condition of (ii) fail. Suppose that holds. For a set , holds if and only if : by The Restriction of a Function or Relation to a Class (i) the elements of are the pairs with ; the first component of every pair in lies in , so for such a pair if and only if and ; and two sets with the same elements are equal (Class Theory NBG: the Axioms, Standing Conventions and Basic Notation (ii)). Hence the formula holds if and only if holds with , and assigned to , and , that is, by the meaning of shown above, if and only if the restriction is bounded and integrable on . By The Riemann Integral on a Closed Interval via Lower and Upper Integrals (vi) this says that is integrable on . So is a predicative formula in expressing the condition of (ii) with , , and . By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to , its equal to and , , , , the formula is a predicative formula in expressing this condition with , , and . This proves (ii).
Defined integrals. In this paragraph , , , and denote , and is , which holds exactly when holds with the sets assigned to , , and assigned to , , and . Let
It is predicative, with free variables among and the parameters.
Let sets , , and be assigned to . If , or is not a map , or , or , both and the condition of (iii) fail. Otherwise , and by the meaning of shown above, holds if and only if , and is integrable on , and holds if and only if , and is integrable on , in the sense of The Riemann Integral on a Closed Interval via Lower and Upper Integrals (vi). So holds if and only if , or one of these two conditions holds, which by The Riemann Integral on a Closed Interval via Lower and Upper Integrals (viii) says that is defined. So is a predicative formula in expressing the condition of (iii) with , , and . By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to , its equal to and , , , , the formula is a predicative formula in expressing this condition with , , and . This proves (iii).
Loading…