TheoremBase

Each defining condition is written as a formula tree whose named values (the union of a sequence, the measure of a set, the composite sequence and its sum in [0,∞]) are always used properly, so it is predicative; the class of functions from the σ-algebra to [0,∞] satisfying it is a subclass of a set, hence a set.

Proof

Throughout, Φ=[0,∞]F\Phi=[0,\infty]^{\mathcal{F}} and S=[0,∞]N\mathcal{S}=[0,\infty]^{\mathbb{N}} are sets whose elements are exactly the functions F→[0,∞]\mathcal{F}\to[0,\infty] and the sequences in [0,∞][0,\infty], respectively, and every sequence in F\mathcal{F} is an element of the set FN\mathcal{F}^{\mathbb{N}} (The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i), The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (ii)); in particular sequences in F\mathcal{F} and in [0,∞][0,\infty] are sets, so quantifiers over sets reach all of them. Further, ∅,X∈F\emptyset,X\in\mathcal{F} and 0,1∈[0,∞]0,1\in[0,\infty] are as in Measure, Measure Space, and Probability Measure, and ∞\infty is as in The Extended Real Line, Its Order, and [0,∞] (i).

Consider the following formula trees in the set variable μ=x0\mu=x_0. Every further letter, bound by a quantifier or naming a value, is the next unused variable at its place; conjunctions and implications are grouped to the right, and φ⇔ψ\varphi\Leftrightarrow\psi abbreviates (φ⇒ψ)∧(ψ⇒φ)(\varphi\Rightarrow\psi)\wedge(\psi\Rightarrow\varphi). The parts

δ(A): ∀m ∀k (m∈N⇒k∈N⇒¬ m=k⇒(a=Am before b=Ak before ¬∃w (w∈a∧w∈b))),ε(μ,A,s): ∀m (m∈N⇒(t=sm before a=Am before u=μ(a) before t=u))\begin{aligned} \delta(A)&:\ \forall m\,\forall k\,\bigl(m\in\mathbb{N}\Rightarrow k\in\mathbb{N}\Rightarrow\neg\,m=k\Rightarrow(a=A_{m}\text{ before }b=A_{k}\text{ before }\neg\exists w\,(w\in a\wedge w\in b))\bigr),\\ \varepsilon(\mu,A,s)&:\ \forall m\,\bigl(m\in\mathbb{N}\Rightarrow(t=s_{m}\text{ before }a=A_{m}\text{ before }u=\mu(a)\text{ before }t=u)\bigr) \end{aligned}

say that for m≠km\neq k no ww lies in both AmA_{m} and AkA_{k}, and that sm=μ(Am)s_{m}=\mu(A_{m}) for every m∈Nm\in\mathbb{N}, with Am=A(m)A_{m}=A(m), AkA_{k}, sm=s(m)s_{m}=s(m) and μ(Am)\mu(A_{m}) as named values. With the value-free tree

θ∪(A,U): ∀w (w∈U⇔∃m (m∈N∧∃b ((m,b)∈A∧w∈b)))\theta_{\cup}(A,U):\ \forall w\,\bigl(w\in U\Leftrightarrow\exists m\,(m\in\mathbb{N}\wedge\exists b\,((m,b)\in A\wedge w\in b))\bigr)

and the condition θΣ(s,σ)\theta_{\Sigma}(s,\sigma), "s∈Ss\in\mathcal{S} and σ=∑m∈Nsm\sigma=\sum_{m\in\mathbb{N}}s_{m}", where ∑m∈Nsm\sum_{m\in\mathbb{N}}s_{m} is the sum of ss, let

Θ(μ):  μ:F→[0,∞] ∧ (c=μ(∅) before c=0) ∧ ∀A (A:N→F⇒δ(A)⇒∀s (s:N→[0,∞]⇒ε(μ,A,s)⇒(U=⋃m∈NAm with θ∪ before v=μ(U) before σ=∑m∈Nsm with θΣ before v=σ))),Θf(μ):  Θ(μ)∧(v=μ(X) before ((v,∞)∈≤∧¬ v=∞)),Θ1(μ):  Θ(μ)∧(v=μ(X) before v=1),\begin{aligned} \Theta(\mu):\ \ &\mu:\mathcal{F}\to[0,\infty]\ \wedge\ \bigl(c=\mu(\emptyset)\text{ before }c=0\bigr)\ \wedge\ \forall A\,\Bigl(A:\mathbb{N}\to\mathcal{F}\Rightarrow\delta(A)\Rightarrow\forall s\,\Bigl(s:\mathbb{N}\to[0,\infty]\Rightarrow\varepsilon(\mu,A,s)\Rightarrow\\ &\quad\bigl(U=\textstyle\bigcup_{m\in\mathbb{N}}A_{m}\text{ with }\theta_{\cup}\text{ before }v=\mu(U)\text{ before }\sigma=\textstyle\sum_{m\in\mathbb{N}}s_{m}\text{ with }\theta_{\Sigma}\text{ before }v=\sigma\bigr)\Bigr)\Bigr),\\ \Theta_{\mathrm{f}}(\mu):\ \ &\Theta(\mu)\wedge\bigl(v=\mu(X)\text{ before }((v,\infty)\in{\le}\wedge\neg\,v=\infty)\bigr),\\ \Theta_{1}(\mu):\ \ &\Theta(\mu)\wedge\bigl(v=\mu(X)\text{ before }v=1\bigr), \end{aligned}

with ≤\le the order of [−∞,∞][-\infty,\infty], as a set of pairs, of The Extended Real Line, Its Order, and [0,∞] (iii).

The three trees are well scoped and satisfy their side conditions. The parameters standing as arguments or inside pairs, ∅\emptyset, XX and ∞=R\infty=\mathbb{R}, are sets. The condition θ∪\theta_{\cup} is itself a well-scoped tree without values or atoms of its own, so it is the reading of a predicative formula by The Graph Reading of a Formula Tree Is Predicative and Agrees with Its Reading, So the Reading Is Predicative (i), its graph reading being itself. The condition θΣ\theta_{\Sigma} is expressed by a predicative formula: ss is a term of type S\mathcal{S} under the guard s∈Ss\in\mathcal{S} (Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (i)), so ∑m∈Nsm\sum_{m\in\mathbb{N}}s_{m} is a term of type [0,∞][0,\infty] under it (Sums of Sequences in [0,∞] as Typed Terms and as a Map (i)), and Terms and Typed Terms under a Guard (iv) applies.

Each tree also uses its values properly under every assignment of sets. Its values are read only where μ:F→[0,∞]\mu:\mathcal{F}\to[0,\infty] holds and, inside the quantifiers, only where AA is a sequence in F\mathcal{F}, ss a sequence in [0,∞][0,\infty] and m,k∈Nm,k\in\mathbb{N}. There AmA_{m}, AkA_{k} and sms_{m} exist, and so do μ(∅)\mu(\emptyset), μ(X)\mu(X) and μ(Am)\mu(A_{m}), as ∅,X,Am∈F\emptyset,X,A_{m}\in\mathcal{F}. The union ⋃m∈NAm\bigcup_{m\in\mathbb{N}}A_{m} of the family (Am)m∈N(A_{m})_{m\in\mathbb{N}} is a set by The Union and Product of a Family of Sets Indexed by a Set, and the Intersection of a Family with an Inhabited Index Class, Are Sets (i), it is the only set satisfying θ∪\theta_{\cup} by Indexed Families of Sets and Their Union, Intersection and Product (ii) and Axiom of Extensionality for Classes, and it lies in F\mathcal{F} by σ-Algebra and Measurable Space (i), so μ(U)\mu(U) exists. Finally ∑m∈Nsm∈[0,∞]\sum_{m\in\mathbb{N}}s_{m}\in[0,\infty] is a set, and the only set satisfying θΣ\theta_{\Sigma}.

By The Graph Reading of a Formula Tree Is Predicative and Agrees with Its Reading, So the Reading Is Predicative (iii), the reading of each tree is therefore the reading of a predicative formula whose free variables are μ\mu and class variables for the parameters. In the reading, quantifiers range over sets and every named variable takes its value. No set lies in both AmA_{m} and AkA_{k} if and only if Am∩Ak=∅A_{m}\cap A_{k}=\emptyset (The Boolean Operations on Classes, Disjointness, and the Universal Class (i), The Empty Set, the Unordered Pair and the Singleton (i), Axiom of Extensionality for Classes), and sequences are sets. Hence Θ(μ)\Theta(\mu) holds if and only if μ:F→[0,∞]\mu:\mathcal{F}\to[0,\infty], μ(∅)=0\mu(\emptyset)=0, and for every pairwise disjoint sequence (Am)(A_{m}) in F\mathcal{F} and every sequence ss in [0,∞][0,\infty] with sm=μ(Am)s_{m}=\mu(A_{m}) for all m∈Nm\in\mathbb{N},

μ(⋃m∈NAm)=∑m∈Nsm\mu\Bigl(\bigcup_{m\in\mathbb{N}}A_{m}\Bigr)=\sum_{m\in\mathbb{N}}s_{m}

(the sequence m↦μ(Am)m\mapsto\mu(A_{m}) is the only such ss); that is, by Measure, Measure Space, and Probability Measure (i), if and only if μ\mu is a measure on (X,F)(X,\mathcal{F}). Likewise Θf(μ)\Theta_{\mathrm{f}}(\mu) holds if and only if μ\mu is a measure with μ(X)<∞\mu(X)<\infty (The Extended Real Line, Its Order, and [0,∞] (iii)), a finite measure (Measure, Measure Space, and Probability Measure (iii)); and Θ1(μ)\Theta_{1}(\mu) if and only if μ\mu is a measure with μ(X)=1\mu(X)=1, a probability measure (Measure, Measure Space, and Probability Measure (v)).

Let ψ\psi, ψf\psi_{\mathrm{f}} and ψ1\psi_{1} be predicative formulas whose readings are those of Θ\Theta, Θf\Theta_{\mathrm{f}} and Θ1\Theta_{1}, and let

M={μ∈Φ:ψ(μ)},Mf={μ∈Φ:ψf(μ)},M1={μ∈Φ:ψ1(μ)},\mathcal{M}=\{\mu\in\Phi:\psi(\mu)\},\qquad\mathcal{M}_{\mathrm{f}}=\{\mu\in\Phi:\psi_{\mathrm{f}}(\mu)\},\qquad\mathcal{M}_{1}=\{\mu\in\Phi:\psi_{1}(\mu)\},

as in Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (ii). Each is a subclass of the set Φ\Phi, hence a set by 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). For a set μ\mu, μ∈M\mu\in\mathcal{M} if and only if μ∈Φ\mu\in\Phi and μ\mu is a measure on (X,F)(X,\mathcal{F}); since a measure is a function F→[0,∞]\mathcal{F}\to[0,\infty], it lies in Φ\Phi, so μ∈M\mu\in\mathcal{M} if and only if μ\mu is a measure on (X,F)(X,\mathcal{F}). This proves (i), and the same argument for Mf\mathcal{M}_{\mathrm{f}} and M1\mathcal{M}_{1} proves (ii) and (iii).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…