TheoremBase

Proof sketch: open boxes are predicative in the dimension; the Borel sets are the σ-algebra they generate; Lebesgue measure is the unique measure with the box volumes; and the integral is obtained by reflection from its defining formulas with the measure space as a variable.

Proof

Proof sketch. Throughout, the guard is n∈Nn\in\mathbb{N}; under it Rn=R[n]\mathbb{R}^{n}=\mathbb{R}^{[n]} is a typed term (Countability as a Predicative Condition, and Finite Powers of a Set as a Typed Term (ii)), [n][n] is given by a predicative formula (Induction over Finite Sets, and Predicative Formulas for the Segments [n] and for Finiteness (i)), values of maps are typed terms and equations and memberships between typed terms are predicative (Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (iii), Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (v), Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (vi)), being a map is predicative (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)), and the strict order and differences of real numbers are predicative (Predicative Formulas for Differences, Quotients, Absolute Values, Distances and the Strict Order of the Real Numbers, at Any Variable Positions (v), Predicative Formulas for Differences, Quotients, Absolute Values, Distances and the Strict Order of the Real Numbers, at Any Variable Positions (i)).

Step 1 (open boxes). The condition "n∈Nn\in\mathbb{N}, a,b∈Rna,b\in\mathbb{R}^{n} and U=R(a,b)U=R(a,b)" is predicative: by Open Boxes in ℝⁿ (i), U=R(a,b)U=R(a,b) says that for every set xx,

x∈U  ⟺  x∈R[n] and a(i)<x(i)<b(i) for every i∈[n],x\in U\iff x\in\mathbb{R}^{[n]}\ \text{and}\ a(i)<x(i)<b(i)\ \text{for every}\ i\in[n],

a formula built from the predicative pieces listed above.

Step 2 (proof of (i)). By Existence and Uniqueness of Lebesgue Measure on ℝⁿ (i), B(Rn)=σ(Rn)\mathcal{B}(\mathbb{R}^{n})=\sigma(\mathcal{R}_{n}), and by The σ-Algebra Generated by a Set of Subsets (i) and The σ-Algebra Generated by a Set of Subsets (ii) a set BB belongs to σ(Rn)\sigma(\mathcal{R}_{n}) if and only if B⊆RnB\subseteq\mathbb{R}^{n} and B∈GB\in G for every σ\sigma-algebra GG on Rn\mathbb{R}^{n} containing every open box R(a,b)R(a,b). "GG is a σ\sigma-algebra on YY", for a variable YY, is predicative by Borel Sets of a Variable Metric Space as a Predicative Condition, and the Families of σ-Algebras Generated by Random Elements and of Their Composites (iv); substituting the term R[n]\mathbb{R}^{[n]} for YY and using Step 1 for "R(a,b)∈GR(a,b)\in G", the condition "for every set BB: B∈GB\in\mathcal{G} if and only if B∈σ(Rn)B\in\sigma(\mathcal{R}_{n})" is predicative, and it is G=B(Rn)\mathcal{G}=\mathcal{B}(\mathbb{R}^{n}).

Step 3 (proof of (ii)). By Lebesgue Measure on Rn\mathbb{R}^n (i) and the uniqueness in Existence and Uniqueness of Lebesgue Measure on ℝⁿ (iii), for n∈Nn\in\mathbb{N} we have κ=λn\kappa=\lambda_{n} if and only if κ\kappa is a measure on (Rn,B(Rn))(\mathbb{R}^{n},\mathcal{B}(\mathbb{R}^{n})) and

κ(R(a,b))=∏i=1nc(i)for all a,b∈Rn with a(i)<b(i) (i∈[n]),\kappa\bigl(R(a,b)\bigr)=\prod_{i=1}^{n}c(i)\qquad\text{for all }a,b\in\mathbb{R}^{n}\text{ with }a(i)<b(i)\ (i\in[n]),

where c:[n]→Rc:[n]\to\mathbb{R} is the map with c(i)=b(i)−a(i)c(i)=b(i)-a(i). Accordingly the clause is expressed by

n∈N∧∃G (β(n,G)∧ms⁡(n,G,κ)∧∀a ∀b (χ(n,a,b)⇒∃U ∃c ∃p (ρ(n,a,b,U)∧δ(n,a,b,c)∧it(p,n,c)∧(U,p)∈κ))).n\in\mathbb{N}\wedge\exists\mathcal{G}\,\Bigl(\beta(n,\mathcal{G})\wedge\operatorname{ms}(n,\mathcal{G},\kappa)\wedge\forall a\,\forall b\,\bigl(\chi(n,a,b)\Rightarrow\exists U\,\exists c\,\exists p\,(\rho(n,a,b,U)\wedge\delta(n,a,b,c)\wedge\mathrm{it}(p,n,c)\wedge(U,p)\in\kappa)\bigr)\Bigr).

Here β(n,G)\beta(n,\mathcal{G}) is the formula of (i) for "n∈Nn\in\mathbb{N} and G=B(Rn)\mathcal{G}=\mathcal{B}(\mathbb{R}^{n})". ms⁡(n,G,κ)\operatorname{ms}(n,\mathcal{G},\kappa) says that κ\kappa is a measure on (R[n],G)(\mathbb{R}^{[n]},\mathcal{G}); by Measure, Measure Space, and Probability Measure (i): κ\kappa is a map G→[0,∞]\mathcal{G}\to[0,\infty], κ(∅)=0\kappa(\emptyset)=0, and for every pairwise disjoint map A:N→GA:\mathbb{N}\to\mathcal{G}, κ(⋃mAm)\kappa(\bigcup_{m}A_{m}) equals the sum of the sequence κ∘A\kappa\circ A in [0,∞][0,\infty], a typed term by Sums of Sequences in [0,∞] as Typed Terms and as a Map (i). χ(n,a,b)\chi(n,a,b) says that a,b∈R[n]a,b\in\mathbb{R}^{[n]} and a(i)<b(i)a(i)<b(i) for every i∈[n]i\in[n]; ρ(n,a,b,U)\rho(n,a,b,U) is the formula of Step 1 for U=R(a,b)U=R(a,b); δ(n,a,b,c)\delta(n,a,b,c) says that cc is a map c:[n]→Rc:[n]\to\mathbb{R} and c(i)=b(i)−a(i)c(i)=b(i)-a(i) for every i∈[n]i\in[n], the difference by Predicative Formulas for Differences, Quotients, Absolute Values, Distances and the Strict Order of the Real Numbers, at Any Variable Positions (i), its values read after the guards a,b∈R[n]a,b\in\mathbb{R}^{[n]}, "cc is a map on [n][n]" and i∈[n]i\in[n]; and it(p,n,c)\mathrm{it}(p,n,c) is the formula of Iterated Operations Are Given by a Predicative Formula (i) for the product of R\mathbb{R}, saying p=∏i=1nc(i)p=\prod_{i=1}^{n}c(i). Each is predicative by the opening paragraph and Step 1. Where β\beta, ms⁡\operatorname{ms} and χ\chi hold, R(a,b)∈Rn⊆σ(Rn)=GR(a,b)\in\mathcal{R}_{n}\subseteq\sigma(\mathcal{R}_{n})=\mathcal{G} by Existence and Uniqueness of Lebesgue Measure on ℝⁿ (i), so κ(R(a,b))\kappa(R(a,b)) exists; UU, cc and pp exist and are unique, so the bracket says κ(R(a,b))=∏i=1nc(i)\kappa(R(a,b))=\prod_{i=1}^{n}c(i). Hence the displayed formula holds exactly when n∈Nn\in\mathbb{N} and κ=λn\kappa=\lambda_{n}.

Step 4 (proof of (iii)). We write the clause as an explicit formula, following the construction behind The Simple, Nonnegative, Integrable and Signed Integrals Are Predicative in the Measure and the Function, at Any Variable Positions (ii) with its parameters XX and F\mathcal{F} made set variables EE and G\mathcal{G}. Its atoms are: α(E,G)\alpha(E,\mathcal{G}), the formula of Borel Sets of a Variable Metric Space as a Predicative Condition, and the Families of σ-Algebras Generated by Random Elements and of Their Composites (iv) for "G\mathcal{G} is a σ\sigma-algebra on EE"; φ(D)\varphi(D) and Σ(D,h,v)\Sigma(D,h,v), the formulas of Predicative Formulas for the Vocabulary of Finite Combinatorics, at Any Variable Positions (i) and Predicative Formulas for the Vocabulary of Finite Combinatorics, at Any Variable Positions (vii) (second form, for the sum ++ of [0,∞][0,\infty], associative and commutative with neutral element 00 by the setting's background), saying that DD is finite, respectively that DD is finite, hh is a map h:D→[0,∞]h:D\to[0,\infty] and v=∑c∈Dh(c)v=\sum_{c\in D}h(c); and σ(S,r)\sigma(S,r), the formula of Predicative Formulas for Suprema and Infima, and Maps Defined by Suprema and Infima (i) for [−∞,∞][-\infty,\infty] with its order, a partial order by the setting's background. For parameters YY, a set, and C\mathcal{C}, a set of subsets of YY, let MY,C(E,G,f)M_{Y,\mathcal{C}}(E,\mathcal{G},f) be

f:E→Y ∧ ∀B (B∈C⇒∃w (∀a (a∈w⇔(a∈E∧∃y (y∈B∧(a,y)∈f)))∧w∈G)),f:E\to Y\ \wedge\ \forall B\,\Bigl(B\in\mathcal{C}\Rightarrow\exists w\,\bigl(\forall a\,(a\in w\Leftrightarrow(a\in E\wedge\exists y\,(y\in B\wedge(a,y)\in f)))\wedge w\in\mathcal{G}\bigr)\Bigr),

which says that ff is a map E→YE\to Y with f−1(B)∈Gf^{-1}(B)\in\mathcal{G} for every B∈CB\in\mathcal{C} (The Image and the Preimage of a Class under a Class (ii), Measurable Map, and the Set of Measurable Maps (i)). Let

π(E,G,s):MR,B(R)(E,G,s)∧∃D (∀c (c∈D⇔∃a (a∈E∧(a,c)∈s))∧φ(D))∧∀a ∀c ((a,c)∈s⇒0≤c),\pi(E,\mathcal{G},s):\quad M_{\mathbb{R},\mathcal{B}(\mathbb{R})}(E,\mathcal{G},s)\wedge\exists D\,\bigl(\forall c\,(c\in D\Leftrightarrow\exists a\,(a\in E\wedge(a,c)\in s))\wedge\varphi(D)\bigr)\wedge\forall a\,\forall c\,\bigl((a,c)\in s\Rightarrow0\le c\bigr), ΦS(E,κ,s,v):∃D ∃h (∀c (c∈D⇔∃a (a∈E∧(a,c)∈s))∧Σ(D,h,v)∧∀c (c∈D⇒h(c)=c⋅κ(s−1({c})))),\Phi_{S}(E,\kappa,s,v):\quad\exists D\,\exists h\,\Bigl(\forall c\,(c\in D\Leftrightarrow\exists a\,(a\in E\wedge(a,c)\in s))\wedge\Sigma(D,h,v)\wedge\forall c\,\bigl(c\in D\Rightarrow h(c)=c\cdot\kappa(s^{-1}(\{c\}))\bigr)\Bigr),

where s−1({c})s^{-1}(\{c\}) is named as the set ww with ∀a (a∈w⇔(a∈E∧(a,c)∈s))\forall a\,(a\in w\Leftrightarrow(a\in E\wedge(a,c)\in s)), and

Φ(E,G,κ,g,r):α(E,G)∧κ:G→[0,∞]∧M[0,∞],B([0,∞])(E,G,g)∧∃S (∀v (v∈S⇔∃s (π(E,G,s)∧∀x (x∈E⇒s(x)≤g(x))∧ΦS(E,κ,s,v)))∧σ(S,r)).\begin{aligned} \Phi(E,\mathcal{G},\kappa,g,r):\quad&\alpha(E,\mathcal{G})\wedge\kappa:\mathcal{G}\to[0,\infty]\wedge M_{[0,\infty],\mathcal{B}([0,\infty])}(E,\mathcal{G},g)\\ &\wedge\exists S\,\Bigl(\forall v\,\Bigl(v\in S\Leftrightarrow\exists s\,\bigl(\pi(E,\mathcal{G},s)\wedge\forall x\,(x\in E\Rightarrow s(x)\le g(x))\wedge\Phi_{S}(E,\kappa,s,v)\bigr)\Bigr)\wedge\sigma(S,r)\Bigr). \end{aligned}

Φ\Phi is predicative. Written with these abbreviations, Φ\Phi is a formula tree (Formula Trees with Values: Syntax, Two Readings, and Definedness (i)) whose atoms of their own are the predicative formulas α\alpha, φ\varphi, Σ\Sigma and σ\sigma, its other abbreviations being predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i); it is well scoped and its side conditions hold. It uses its values properly (Formula Trees with Values: Syntax, Two Readings, and Definedness (vi)) under every assignment, because each value is named only where the conjuncts before it hold, and there it exists: s(x)s(x) and g(x)g(x) where π(E,G,s)\pi(E,\mathcal{G},s), the third conjunct of Φ\Phi and x∈Ex\in E hold, which make ss and gg maps on EE; h(c)h(c) where Σ(D,h,v)\Sigma(D,h,v) and c∈Dc\in D hold; the set s−1({c})s^{-1}(\{c\}), a subset of EE and by extensionality the only set ww so described, under every assignment; κ(s−1({c}))\kappa(s^{-1}(\{c\})) where moreover α(E,G)\alpha(E,\mathcal{G}), κ:G→[0,∞]\kappa:\mathcal{G}\to[0,\infty] and π(E,G,s)\pi(E,\mathcal{G},s) hold, since then s∈S+(E,G)s\in\mathcal{S}^{+}(E,\mathcal{G}), as shown below, and s−1({c})∈Gs^{-1}(\{c\})\in\mathcal{G} by Simple Functions, Nonnegative Simple Functions, and the Simple Integral (iv); and c⋅κ(s−1({c}))c\cdot\kappa(s^{-1}(\{c\})) there too, as c∈D⊆[0,∞)⊆[0,∞]c\in D\subseteq[0,\infty)\subseteq[0,\infty]. So Φ\Phi is predicative by The Graph Reading of a Formula Tree Is Predicative and Agrees with Its Reading, So the Reading Is Predicative (iii).

What Φ\Phi says. Where α(E,G)\alpha(E,\mathcal{G}) holds, π(E,G,s)\pi(E,\mathcal{G},s) says that ss is a measurable map E→RE\to\mathbb{R} with finite image, the only possible DD, and nonnegative values, that is, s∈S+(E,G)s\in\mathcal{S}^{+}(E,\mathcal{G}) (Simple Functions, Nonnegative Simple Functions, and the Simple Integral (ii), Simple Functions, Nonnegative Simple Functions, and the Simple Integral (iii)). Now let n∈Nn\in\mathbb{N}, E=R[n]E=\mathbb{R}^{[n]}, G=B(Rn)\mathcal{G}=\mathcal{B}(\mathbb{R}^{n}) and κ=λn\kappa=\lambda_{n}. The first two conjuncts of Φ\Phi hold, and the third says g∈M+(Rn,B(Rn))g\in\mathcal{M}^{+}(\mathbb{R}^{n},\mathcal{B}(\mathbb{R}^{n})) (Nonnegative Measurable Maps and Their Lebesgue Integral (i)). For s∈S+(Rn,B(Rn))s\in\mathcal{S}^{+}(\mathbb{R}^{n},\mathcal{B}(\mathbb{R}^{n})), ΦS\Phi_{S} forces D=s[Rn]D=s[\mathbb{R}^{n}] and hh the map c↦c⋅λn(s−1({c}))c\mapsto c\cdot\lambda_{n}(s^{-1}(\{c\})) on it, which exists, so ΦS(E,κ,s,v)\Phi_{S}(E,\kappa,s,v) says v=Iλn(s)v=I_{\lambda_{n}}(s) (Simple Functions, Nonnegative Simple Functions, and the Simple Integral (iv)). Hence the first part of the bracket says that SS is the set {Iλn(s):s∈S+, s≤g}\{I_{\lambda_{n}}(s):s\in\mathcal{S}^{+},\ s\le g\} of Nonnegative Measurable Maps and Their Lebesgue Integral (ii), and σ(S,r)\sigma(S,r) then says that rr is its supremum (Predicative Formulas for Suprema and Infima, and Maps Defined by Suprema and Infima (i)), that is, r=∫Rng dλnr=\int_{\mathbb{R}^{n}}g\,d\lambda_{n} (Nonnegative Measurable Maps and Their Lebesgue Integral (ii)).

The clause. With β(n,G)\beta(n,\mathcal{G}) as in Step 3 and Λ(n,κ)\Lambda(n,\kappa) the formula of (ii), the clause is expressed by

n∈N∧∃E ∃G ∃κ (E=R[n]∧β(n,G)∧Λ(n,κ)∧Φ(E,G,κ,g,r)),n\in\mathbb{N}\wedge\exists E\,\exists\mathcal{G}\,\exists\kappa\,\bigl(E=\mathbb{R}^{[n]}\wedge\beta(n,\mathcal{G})\wedge\Lambda(n,\kappa)\wedge\Phi(E,\mathcal{G},\kappa,g,r)\bigr),

predicative by the opening paragraph for the equation E=R[n]E=\mathbb{R}^{[n]}. For n∈Nn\in\mathbb{N} the only witnesses are E=RnE=\mathbb{R}^{n}, G=B(Rn)\mathcal{G}=\mathcal{B}(\mathbb{R}^{n}) and κ=λn\kappa=\lambda_{n}, which exist, so by the previous paragraph the formula holds exactly when g∈M+(Rn,B(Rn))g\in\mathcal{M}^{+}(\mathbb{R}^{n},\mathcal{B}(\mathbb{R}^{n})) and r=∫Rng dλnr=\int_{\mathbb{R}^{n}}g\,d\lambda_{n}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…