TheoremBase

The two clauses are proved together: the condition that a set is a preimage c_j⁻¹(B) for some index j and Borel set B is expressed by a predicative formula, built from the typed term c_j⁻¹(B), and set-builder inside the power set gives the set.

Proof

One argument serves both clauses. For (i) let Y=RnY=\mathbb{R}^{n}, J=[n]J=[n] and cj=πjc_{j}=\pi_{j} for j∈Jj\in J; for (ii) let Y=Mp×q(R)Y=\mathcal{M}_{p\times q}(\mathbb{R}), J=[p]×[q]J=[p]\times[q] and c(i,j)=Eijc_{(i,j)}=E_{ij} for (i,j)∈J(i,j)\in J. In both cases JJ is a set, [n][n], [p][p] and [q][q] being sets by Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices (v) and [p]×[q][p]\times[q] by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii). The identities idRn:Rn→Rn\mathrm{id}_{\mathbb{R}^{n}}:\mathbb{R}^{n}\to\mathbb{R}^{n} and idMp×q(R):Mp×q(R)→Mp×q(R)\mathrm{id}_{\mathcal{M}_{p\times q}(\mathbb{R})}:\mathcal{M}_{p\times q}(\mathbb{R})\to\mathcal{M}_{p\times q}(\mathbb{R}) are maps by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (iii). By Component Maps of a Map into Rq\mathbb{R}^{q}, Entry Maps of a Map into Matrices, and Maps Assembled from Them (i), applied to idRn\mathrm{id}_{\mathbb{R}^{n}}, and by Component Maps of a Map into Rq\mathbb{R}^{q}, Entry Maps of a Map into Matrices, and Maps Assembled from Them (ii), applied to idMp×q(R)\mathrm{id}_{\mathcal{M}_{p\times q}(\mathbb{R})}, j↦cjj\mapsto c_{j} is a map c:J→RYc:J\to\mathbb{R}^{Y} into the set RY\mathbb{R}^{Y} of maps Y→RY\to\mathbb{R}. By Borel Sigma-Algebra of a Metric Space (ii), Borel Sigma-Algebra of a Metric Space (i) and Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iii), B(R)\mathcal{B}(\mathbb{R}) is a σ\sigma-algebra on R\mathbb{R}, so B(R)⊆P(R)\mathcal{B}(\mathbb{R})\subseteq\mathcal{P}(\mathbb{R}) by σ-Algebra and Measurable Space (i).

The condition is predicative. Let jj and BB be distinct set variables, and let γ\gamma be the formula j∈J∧B∈B(R)j\in J\wedge B\in\mathcal{B}(\mathbb{R}), with the parameters JJ and B(R)\mathcal{B}(\mathbb{R}); it is predicative, having no quantifier, so it is a guard for the variables jj and BB. Under every assignment satisfying γ\gamma, j∈Jj\in J and B∈P(R)B\in\mathcal{P}(\mathbb{R}), so jj is a term of type JJ and BB a term of type P(R)\mathcal{P}(\mathbb{R}) under γ\gamma, by Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (i); then c(j)c(j), written with the parameter cc, is a term of type RY\mathbb{R}^{Y} under γ\gamma by Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (iii), and c(j)−1(B)c(j)^{-1}(B) is a term of type P(Y)\mathcal{P}(Y) under γ\gamma by Preimages, Unions and Intersections over an Index Set, Suprema and Infima, and Superlevel Sets as Typed Terms (i). Its value under an assignment satisfying γ\gamma is cj−1(B)c_{j}^{-1}(B), the preimage, which is the defined set symbol of Preimages under a Map: Membership, the Preimage Map, Sequences of Preimages, and the Set of Sets with Preimage in a Given Set (i). Let CC be a set variable other than jj and BB that occurs in none of the parameters. By Terms and Typed Terms under a Guard (iv), there is a predicative formula ψ\psi, with free variables among jj, BB, CC and the parameters, expressing the condition γ∧C=c(j)−1(B)\gamma\wedge C=c(j)^{-1}(B): for all sets jj, BB and CC, ψ\psi holds if and only if j∈Jj\in J, B∈B(R)B\in\mathcal{B}(\mathbb{R}) and C=cj−1(B)C=c_{j}^{-1}(B). Let φ(C)\varphi(C) be the formula ∃j ∃B ψ\exists j\,\exists B\,\psi. Its quantifiers bind set variables only, so it is predicative by Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (v), and for every set CC, φ(C)\varphi(C) holds if and only if ψ\psi holds for some sets assigned to jj and BB (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)), that is, if and only if C=cj−1(B)C=c_{j}^{-1}(B) for some j∈Jj\in J and some B∈B(R)B\in\mathcal{B}(\mathbb{R}).

The set. Let CY={C∈P(Y):φ(C)}\mathcal{C}_{Y}=\{C\in\mathcal{P}(Y):\varphi(C)\}, formed by Sets and Maps: Ordinary Notation (iii) from the predicative formula φ\varphi; it is a set and a subset of P(Y)\mathcal{P}(Y). Let CC be a set. If C∈CYC\in\mathcal{C}_{Y}, then φ(C)\varphi(C) holds, so C=cj−1(B)C=c_{j}^{-1}(B) for some j∈Jj\in J and B∈B(R)B\in\mathcal{B}(\mathbb{R}). Conversely, if C=cj−1(B)C=c_{j}^{-1}(B) for such jj and BB, then C⊆YC\subseteq Y by Preimages under a Map: Membership, the Preimage Map, Sequences of Preimages, and the Set of Sets with Preimage in a Given Set (i), so C∈P(Y)C\in\mathcal{P}(Y) by The Union Set and the Power Set of a Set (ii), and φ(C)\varphi(C) holds, so C∈CYC\in\mathcal{C}_{Y}. Hence CY\mathcal{C}_{Y} has the stated property. Two sets with this property have the same elements, so they are equal by Class Theory NBG: the Axioms, Standing Conventions and Basic Notation (ii).

In the case of (i), cj=πjc_{j}=\pi_{j} for j∈[n]j\in[n], and C=CY\mathcal{C}=\mathcal{C}_{Y} is the set required there. In the case of (ii), an element of J=[p]×[q]J=[p]\times[q] is a pair (i,j)(i,j) with i∈[p]i\in[p] and j∈[q]j\in[q], by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i), and c(i,j)=Eijc_{(i,j)}=E_{ij}; so C=cl−1(B)C=c_{l}^{-1}(B) for some l∈Jl\in J if and only if C=Eij−1(B)C=E_{ij}^{-1}(B) for some i∈[p]i\in[p] and j∈[q]j\in[q], and C′=CY\mathcal{C}'=\mathcal{C}_{Y} is the set required there.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…