TheoremBase

The components, or entries, of the maps from S into RqR^q, or into the matrices, are the values of one map on pairs, built by currying; the set is then cut out of D by a predicative condition, and the map Ψ is obtained by currying the map (f, k) ↦ Φ(fk)f_k).

Proof

Vectors and matrices as functions. By Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (i) and Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (ii), Rq=R[q]\mathbb{R}^{q}=\mathbb{R}^{[q]} and zk=z(k)z_{k}=z(k) for z∈Rqz\in\mathbb{R}^{q} and k∈[q]k\in[q]. By Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (i) and Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (ii), Mp×q(R)=R[p]×[q]\mathcal{M}_{p\times q}(\mathbb{R})=\mathbb{R}^{[p]\times[q]} and Mij=M(i,j)M_{ij}=M(i,j) for M∈Mp×q(R)M\in\mathcal{M}_{p\times q}(\mathbb{R}), i∈[p]i\in[p] and j∈[q]j\in[q]. The elements of [p]×[q][p]\times[q] are exactly the pairs (i,j)(i,j) with i∈[p]i\in[p] and j∈[q]j\in[q], by The Cartesian Product of Two Classes (i) and Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i). Below, JJ is either [q][q] or [p]×[q][p]\times[q], and V=RJV=\mathbb{R}^{J}; so V=RqV=\mathbb{R}^{q} in the first case and V=Mp×q(R)V=\mathcal{M}_{p\times q}(\mathbb{R}) in the second.

The function of components. Let E=VS×JE=V^{S}\times J. For v∈Ev\in E, v=(v1,v2)v=(v_{1},v_{2}) with v1∈VSv_{1}\in V^{S} and v2∈Jv_{2}\in J, by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i); so v1v_{1} is a function S→VS\to V, by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i), and for u∈Su\in S, v1(u)v_{1}(u) is a function J→RJ\to\mathbb{R} and v1(u)(v2)∈Rv_{1}(u)(v_{2})\in\mathbb{R}. Hence there is a function g:E×S→Rg:E\times S\to\mathbb{R} with g(v,u)=v1(u)(v2)g(v,u)=v_{1}(u)(v_{2}) for all v∈Ev\in E and u∈Su\in S (Maps and Relations Given by Formulas (ii), with R\mathbb{R}, EE and SS for bb, cc and dd). By Projection, Evaluation and Currying Maps (iii), with EE, SS and R\mathbb{R} for XX, II and YY, there is a function κ:E→RS\kappa:E\to\mathbb{R}^{S} with κ(v)(u)=g(v,u)\kappa(v)(u)=g(v,u) for all v∈Ev\in E and u∈Su\in S. Every function h:S→Vh:S\to V lies in VSV^{S}, by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i); so for such hh and w∈Jw\in J, κ(h,w)\kappa(h,w) is a function S→RS\to\mathbb{R} with κ(h,w)(u)=h(u)(w)\kappa(h,w)(u)=h(u)(w) for every u∈Su\in S.

For f:S→Rqf:S\to\mathbb{R}^{q} and k∈[q]k\in[q] (the case J=[q]J=[q]), κ(f,k)(u)=f(u)(k)=f(u)k\kappa(f,k)(u)=f(u)(k)=f(u)_{k} for every u∈Su\in S, so κ(f,k)=fk\kappa(f,k)=f_{k} by the uniqueness in Component Maps of a Map into Rq\mathbb{R}^{q}, Entry Maps of a Map into Matrices, and Maps Assembled from Them (i). For F:S→Mp×q(R)F:S\to\mathcal{M}_{p\times q}(\mathbb{R}), i∈[p]i\in[p] and j∈[q]j\in[q] (the case J=[p]×[q]J=[p]\times[q]), κ(F,(i,j))(u)=F(u)(i,j)=F(u)ij\kappa(F,(i,j))(u)=F(u)(i,j)=F(u)_{ij} for every u∈Su\in S, so κ(F,(i,j))=Fij\kappa(F,(i,j))=F_{ij} by the uniqueness in Component Maps of a Map into Rq\mathbb{R}^{q}, Entry Maps of a Map into Matrices, and Maps Assembled from Them (ii).

Proof of (i) and (iii). Let DD and AA be as in (i), with J=[q]J=[q], or as in (iii), with J=[p]×[q]J=[p]\times[q]. Then D⊆VSD\subseteq V^{S}, by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i). Let

Z={h∈D:∀w (w∈J⇒κ(h,w)∈A)},Z=\{h\in D:\forall w\,(w\in J\Rightarrow\kappa(h,w)\in A)\},

a set (Sets and Maps: Ordinary Notation (iii)). By the previous paragraph, and as ww runs through the pairs (i,j)(i,j) when J=[p]×[q]J=[p]\times[q], the elements of ZZ are exactly the f∈Df\in D with fk∈Af_{k}\in A for every k∈[q]k\in[q] in the first case, and exactly the F∈DF\in D with Fij∈AF_{ij}\in A for all i∈[p]i\in[p] and j∈[q]j\in[q] in the second. A set Z′Z' with the same elements has the elements of ZZ, so Z′=ZZ'=Z by Class Theory NBG: the Axioms, Standing Conventions and Basic Notation (ii).

Proof of (ii) and (iv). Let DD, AA, ZZ, BB and Φ\Phi be as in (ii), with J=[q]J=[q], or as in (iv), with J=[p]×[q]J=[p]\times[q]. For h∈Zh\in Z and w∈Jw\in J, κ(h,w)∈A\kappa(h,w)\in A by the construction of ZZ above, so Φ(κ(h,w))∈B\Phi(\kappa(h,w))\in B. Hence there is a function ψ:Z×J→B\psi:Z\times J\to B with ψ(h,w)=Φ(κ(h,w))\psi(h,w)=\Phi(\kappa(h,w)) for all h∈Zh\in Z and w∈Jw\in J (Maps and Relations Given by Formulas (ii), with BB, ZZ and JJ for bb, cc and dd), and, by Projection, Evaluation and Currying Maps (iii) with ZZ, JJ and BB for XX, II and YY, exactly one function Ψ:Z→BJ\Psi:Z\to B^{J} with Ψ(h)(w)=ψ(h,w)\Psi(h)(w)=\psi(h,w) for all h∈Zh\in Z and w∈Jw\in J. By the identification of κ\kappa above, this says Ψ(f)(k)=Φ(fk)\Psi(f)(k)=\Phi(f_{k}) for all f∈Zf\in Z and k∈[q]k\in[q] in the first case, and Ψ(F)(i,j)=Φ(Fij)\Psi(F)(i,j)=\Phi(F_{ij}) for all F∈ZF\in Z, i∈[p]i\in[p] and j∈[q]j\in[q] in the second. Conversely, let Ψ′:Z→BJ\Psi':Z\to B^{J} be a function with the property stated in (ii), respectively (iv). As every w∈[p]×[q]w\in[p]\times[q] is a pair (i,j)(i,j) with i∈[p]i\in[p] and j∈[q]j\in[q], Ψ′(h)(w)=Φ(κ(h,w))=ψ(h,w)\Psi'(h)(w)=\Phi(\kappa(h,w))=\psi(h,w) for all h∈Zh\in Z and w∈Jw\in J, so Ψ′=Ψ\Psi'=\Psi by the uniqueness in Projection, Evaluation and Currying Maps (iii).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…