TheoremBase

The condition defining C(A) is written as a predicative formula, using typed terms for the differences bmb_m − ama_m, their map, its sum and the intervals, so C(A) is a subset of [0,∞] by set-builder notation; the map of infima then comes from the general construction of maps defined by infima.

Proof

Proof of (i). Let A⊆RA\subseteq\mathbb{R}. For sequences (am)(a_{m}) and (bm)(b_{m}) in R\mathbb{R} with am≤bma_{m}\le b_{m} for every m∈Nm\in\mathbb{N}, m↦(am,bm)m\mapsto(a_{m},b_{m}) is a sequence in P(R)\mathcal{P}(\mathbb{R}) (Intervals of the Real Line as Defined Set Symbols, Typed Terms and Values of Maps (iii)) and the union is that of this family, so the inclusion A⊆⋃m∈N(am,bm)A\subseteq\bigcup_{m\in\mathbb{N}}(a_{m},b_{m}) says that every x∈Ax\in A lies in (am,bm)(a_{m},b_{m}) for some m∈Nm\in\mathbb{N}, by Indexed Families of Sets and Their Union, Intersection and Product (ii); and ∑m∈N(bm−am)\sum_{m\in\mathbb{N}}(b_{m}-a_{m}) lies in [0,∞][0,\infty]. So C(A)\mathcal{C}(A) is the class of all t∈[0,∞]t\in[0,\infty] satisfying the condition "there are such sequences with t=∑m∈N(bm−am)t=\sum_{m\in\mathbb{N}}(b_{m}-a_{m})". We show that this condition is expressed by a predicative formula whose parameters are AA, N\mathbb{N}, R\mathbb{R}, RN\mathbb{R}^{\mathbb{N}}, the order ≤\le, the operations ++ and ⋅\cdot and the elements 00 and 11 of R\mathbb{R}, P(R)\mathcal{P}(\mathbb{R}), [−∞,∞][-\infty,\infty] and its order ≤\le, [0,∞][0,\infty], [0,∞]N[0,\infty]^{\mathbb{N}}, the sum ++ on [0,∞][0,\infty], and the order and the addition of N0\mathbb{N}_{0}, and which quantifies over sets only, the sequences in it being elements of the set RN\mathbb{R}^{\mathbb{N}} of The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (ii). The class variables for these parameters are chosen pairwise distinct whenever their values differ: in particular the order of R\mathbb{R} and the order of [−∞,∞][-\infty,\infty] are different variables, although Intervals of the Real Line as Defined Set Symbols, Typed Terms and Values of Maps (ii) and Sums of Sequences in [0,∞] as Typed Terms and as a Map (i) both write LL for theirs, and likewise ++ of R\mathbb{R} and the sum ++ on [0,∞][0,\infty]. Then C(A)\mathcal{C}(A) is a subset of [0,∞][0,\infty] given by set-builder notation as in Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices (iv), and its elements are exactly the sets tt satisfying the condition, as stated.

The sequences are values of set variables aa and bb of the formula, not fixed maps. Let γ\gamma be the formula a∈RN∧b∈RN∧∀m (m∈N⇒∃u ∃v ((m,u)∈a∧(m,v)∈b∧u≤v))a\in\mathbb{R}^{\mathbb{N}}\wedge b\in\mathbb{R}^{\mathbb{N}}\wedge\forall m\,(m\in\mathbb{N}\Rightarrow\exists u\,\exists v\,((m,u)\in a\wedge(m,v)\in b\wedge u\le v)), a guard on aa and bb, and γm\gamma_{m} the guard γ∧m∈N\gamma\wedge m\in\mathbb{N} on aa, bb and mm; they are predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i). If aa is a map with domain N\mathbb{N} and m∈Nm\in\mathbb{N}, then for every set zz, (m,z)∈a(m,z)\in a if and only if z=amz=a_{m}, by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (x), and likewise for bb; so γ\gamma holds exactly when (am)(a_{m}) and (bm)(b_{m}) are sequences in R\mathbb{R} with am≤bma_{m}\le b_{m} for every m∈Nm\in\mathbb{N}. The formula γm∧(m,z)∈a\gamma_{m}\wedge(m,z)\in a thus expresses γm∧z=am\gamma_{m}\wedge z=a_{m}, and am∈Ra_{m}\in\mathbb{R}, so ama_{m} is a term of type R\mathbb{R} under γm\gamma_{m} by Terms and Typed Terms under a Guard (ii), and so is bmb_{m}.

The difference bm−amb_{m}-a_{m} is the value of the subtraction of the ordered field R\mathbb{R} at the pair (bm,am)(b_{m},a_{m}): by Predicative Substitution of Values of Functions and Binary Operations, and Predicative Formulas for Negatives, Differences, Absolute Values, Distances, Reciprocals and Quotients in an Ordered Field (iv) there is a predicative formula δ(u,v,z)\delta(u,v,z), with R\mathbb{R}, ++, ⋅\cdot, 00, 11 and ≤\le as parameters, that holds if and only if u∈Ru\in\mathbb{R}, v∈Rv\in\mathbb{R} and z=u−vz=u-v; hence γm∧∃u ∃v ((m,u)∈b∧(m,v)∈a∧δ(u,v,z))\gamma_{m}\wedge\exists u\,\exists v\,((m,u)\in b\wedge(m,v)\in a\wedge\delta(u,v,z)), predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i), expresses γm∧z=bm−am\gamma_{m}\wedge z=b_{m}-a_{m}, since under γm\gamma_{m} the only such uu and vv are bmb_{m} and ama_{m}; and as bm−am∈[0,∞]b_{m}-a_{m}\in[0,\infty], bm−amb_{m}-a_{m} is a term of type [0,∞][0,\infty] under γm\gamma_{m}. Thus bm−amb_{m}-a_{m} is an expression built from the defined set symbols ama_{m}, bmb_{m} and u−vu-v, given by the formulas above, with no class abstraction, used properly and lying in [0,∞][0,\infty] for all aa and bb satisfying γ\gamma and every m∈Nm\in\mathbb{N}. So Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (v), with N\mathbb{N} and [0,∞][0,\infty] for its AA and BB, aa and bb for its v1v_{1} and v2v_{2}, γ\gamma for its γ\gamma, mm for its uu and bm−amb_{m}-a_{m} for its t(u,v1,v2)t(u,v_{1},v_{2}), gives a predicative formula θ(h,a,b)\theta(h,a,b) such that, for all aa and bb satisfying γ\gamma, the only set hh with θ(h,a,b)\theta(h,a,b) is the map m↦bm−amm\mapsto b_{m}-a_{m} from N\mathbb{N} to [0,∞][0,\infty]. Hence γ∧θ(h,a,b)\gamma\wedge\theta(h,a,b) expresses "γ\gamma holds and hh is the map m↦bm−amm\mapsto b_{m}-a_{m}", and this map is an element of [0,∞]N[0,\infty]^{\mathbb{N}} by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i); so m↦bm−amm\mapsto b_{m}-a_{m} is a term of type [0,∞]N[0,\infty]^{\mathbb{N}} under γ\gamma, by Terms and Typed Terms under a Guard (ii).

By Sums of Sequences in [0,∞] as Typed Terms and as a Map (i), with [−∞,∞][-\infty,\infty], its order, [0,∞][0,\infty], the sum on [0,∞][0,\infty], N\mathbb{N}, and the order and the addition of N0\mathbb{N}_{0} as the values of its EE, LL, ZZ, PP, NN, RR and QQ, the sum ∑m∈N(bm−am)\sum_{m\in\mathbb{N}}(b_{m}-a_{m}) is a term of type [0,∞][0,\infty] under γ\gamma; and by Intervals of the Real Line as Defined Set Symbols, Typed Terms and Values of Maps (ii), with R\mathbb{R} and its order as the values of its YY and LL, the interval (am,bm)(a_{m},b_{m}) is a term of type P(R)\mathcal{P}(\mathbb{R}) under γm\gamma_{m}. By Terms and Typed Terms under a Guard (iv), predicative formulas then express γ∧t=∑m∈N(bm−am)\gamma\wedge t=\sum_{m\in\mathbb{N}}(b_{m}-a_{m}) and γm∧z=(am,bm)\gamma_{m}\wedge z=(a_{m},b_{m}), for set variables tt and zz occurring in neither term; x∈(am,bm)x\in(a_{m},b_{m}) is expressed under γm\gamma_{m} by ∃z (z=(am,bm)∧x∈z)\exists z\,(z=(a_{m},b_{m})\wedge x\in z) with the latter formula; and the condition is ∃a ∃b\exists a\,\exists b applied to the conjunction of γ\gamma, ∀x (x∈A⇒∃m (m∈N∧x∈(am,bm)))\forall x\,(x\in A\Rightarrow\exists m\,(m\in\mathbb{N}\wedge x\in(a_{m},b_{m}))) and t=∑m∈N(bm−am)t=\sum_{m\in\mathbb{N}}(b_{m}-a_{m}), so expressed, which is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i). This is the predicative formula claimed above, which proves (i).

Proof of (ii). Let A⊆RA\subseteq\mathbb{R}. By (i), C(A)\mathcal{C}(A) is a subset of [0,∞][0,\infty], hence of [−∞,∞][-\infty,\infty] (The Extended Real Line, Its Order, and [0,∞] (ii)); so it has an infimum in [−∞,∞][-\infty,\infty] by Order and Suprema in the Extended Real Line (iii), and inf⁡C(A)∈[0,∞]\inf\mathcal{C}(A)\in[0,\infty] by Order and Suprema in the Extended Real Line (ix). The elements of P(R)\mathcal{P}(\mathbb{R}) are exactly the subsets of R\mathbb{R} (The Union Set and the Power Set of a Set (ii)), and C(A)\mathcal{C}(A) is the class given, with AA as its argument, by the predicative condition of the proof of (i), in which AA occurs only as a set and may be taken as a set variable. So Predicative Formulas for Suprema and Infima, and Maps Defined by Suprema and Infima (iii), with P(R)\mathcal{P}(\mathbb{R}) for its aa, [−∞,∞][-\infty,\infty] and ≤\le for its pp and ⪯\preceq (≤\le being a total order by Order and Suprema in the Extended Real Line (i), hence a partial order by Partial and Total Orders on a Set and the Associated Strict Relation (ii)), and C(A)\mathcal{C}(A) for its t(u)t(u), gives exactly one map f:P(R)→[−∞,∞]f:\mathcal{P}(\mathbb{R})\to[-\infty,\infty] with f(A)=inf⁡C(A)f(A)=\inf\mathcal{C}(A) for every A∈P(R)A\in\mathcal{P}(\mathbb{R}). Its values lie in [0,∞][0,\infty], so ff is a map into [0,∞][0,\infty] by Functions, Values of a Function, and Functions from One Class to Another (iii); and any map P(R)→[0,∞]\mathcal{P}(\mathbb{R})\to[0,\infty] with these values is also one into [−∞,∞][-\infty,\infty], hence equal to ff. This proves (ii).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…