Each result cited is universally quantified over the data in its own statement.
Points of Rm are maps [m]→R by Euclidean Points as Tuples of Real Numbers, as fixed in Probability Measures on Euclidean Space and Random Vectors: Standing Notation §spaces; equality of points is tested coordinatewise by claim 1 of Euclidean Points as Tuples of Real Numbers ("extensionality"). Unfolding Particle Blocks of the Configuration Space: Block Maps, Configurations, Product Maps and Diagonal Points §blocks, for x∈RqN, k∈[N] and i∈[q],
(pk(x))i=xb(k,i),(1)
where b(k,i)∈[qN] by Block Indices: Enumerating an Initial Segment of Length qN by Blocks and Positions §range; the same holds in RpN with p in place of q, Block Indices: Enumerating an Initial Segment of Length qN by Blocks and Positions being applied with p in place of q. Every step below proved for q holds likewise for p. Field identities in R are the numbered axioms of Field.
Step 1 (Blocks determine points). Let x,x′∈RqN with pk(x)=pk(x′) for every k∈[N]. For j∈[qN], Block Indices: Enumerating an Initial Segment of Length qN by Blocks and Positions §bijection gives k∈[N] and i∈[q] with b(k,i)=j, and by (1) xj=(pk(x))i=(pk(x′))i=xj′. By extensionality x=x′.
Step 2 (Blocks of sums, multiples and differences). Let x,x′∈RqN, t∈R and k∈[N]. For i∈[q], by (1) and Sum of Points of Rn (applied in RqN and in Rq), (pk(x+x′))i=xb(k,i)+xb(k,i)′=(pk(x)+pk(x′))i; likewise by Scalar Multiple of a Point of Rn, (pk(tx))i=(tpk(x))i, and by clause 1 of Difference, Dot Product, and Orthogonality in Rn, (pk(x−x′))i=(pk(x)−pk(x′))i. By extensionality,
pk(x+x′)=pk(x)+pk(x′),pk(tx)=tpk(x),pk(x−x′)=pk(x)−pk(x′).
Step 3 (Claim 1). RqN and Rq are real vector spaces by Euclidean Space Rn is a Real Vector Space, and Step 2 gives conditions 1 and 2 of Linear Map, so pk is linear. For i∈[q] the i-th component of pk is, by (1), the coordinate projection πb(k,i):RqN→R, measurable with respect to BqN and B(R) by claim 1 of The Borel Sigma-Algebra of a Euclidean Space as a Product, and Measurability of Projections, Sequentially Continuous Maps, and Open and Closed Sets; by claim 2 there, pk is measurable with respect to BqN and Bq, which are B(RqN) and B(Rq) by claim 5 there; so pk is Borel in the sense of Probability Measures on Euclidean Space and Random Vectors: Standing Notation §borel-maps. Next, for x∈RqN, Particle Blocks of the Configuration Space: Block Maps, Configurations, Product Maps and Diagonal Points §configuration gives pk([p1(x),…,pN(x)])=pk(x) for every k∈[N], so x=[p1(x),…,pN(x)] by Step 1. Finally, for yk,yk′∈Rq and t∈R, write Y=[y1,…,yN] and Y′=[y1′,…,yN′]. For every k∈[N], Particle Blocks of the Configuration Space: Block Maps, Configurations, Product Maps and Diagonal Points §configuration gives pk([y1+ty1′,…,yN+tyN′])=yk+tyk′, while Step 2 and the same clause give pk(Y+tY′)=pk(Y)+tpk(Y′)=yk+tyk′. Step 1 gives [y1+ty1′,…,yN+tyN′]=Y+tY′.
Step 4 (Claim 2). Let x,x′∈RqN. By clause 2 of Difference, Dot Product, and Orthogonality in Rn, x⋅x′=∑j=1qNxjxj′. Applying Block Indices: Enumerating an Initial Segment of Length qN by Blocks and Positions §sums to the family aj=xjxj′, then (1) and clause 2 of Difference, Dot Product, and Orthogonality in Rn in Rq,
x⋅x′=k=1∑Ni=1∑qxb(k,i)xb(k,i)′=k=1∑Ni=1∑q(pk(x))i(pk(x′))i=k=1∑Npk(x)⋅pk(x′).
Taking x′=x and using ∥z∥2=z⋅z in RqN and in Rq (claim 1 of Elementary Properties of the Euclidean Norm on Rn) gives ∥x∥2=∑k=1N∥pk(x)∥2. Each summand is nonnegative by claim 2 of Nonnegativity of Squares in an Ordered Field, so claim 6 of Properties of Finite Sums gives ∥pk(x)∥2≤∥x∥2; as 0≤∥pk(x)∥ and 0≤∥x∥ by claim 1 of Elementary Properties of the Euclidean Norm on Rn, claim 2 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field gives ∥pk(x)∥≤∥x∥. Combined with Step 2, for x,x′∈RqN and k∈[N],
∥pk(x)−pk(x′)∥=∥pk(x−x′)∥≤∥x−x′∥.(2)
Step 5 (Claim 3: blocks of h⊕). Let h:Rq→Rp and x∈RqN. By Particle Blocks of the Configuration Space: Block Maps, Configurations, Product Maps and Diagonal Points §product-map, h⊕(x)=[h(p1(x)),…,h(pN(x))]∈RpN, so Particle Blocks of the Configuration Space: Block Maps, Configurations, Product Maps and Diagonal Points §configuration, formed in dimension p, gives pk(h⊕(x))=h(pk(x)) for every k∈[N]. With (1) in dimension p,
(h⊕(x))b(k,i)=(h(pk(x)))i(k∈[N], i∈[p]).(3)
For j∈[pN] write j=b(k,i) with k∈[N], i∈[p], which is possible by Block Indices: Enumerating an Initial Segment of Length qN by Blocks and Positions §bijection in dimension p; by (3) the j-th component of h⊕ is fj=πi∘h∘pk, where πi:Rp→R is the i-th coordinate projection.
Step 6 (Claim 3: Borel). Let h be Borel and j∈[pN], fj=πi∘h∘pk as in Step 5. The map pk is Borel by Step 3, and πi is measurable with respect to B(Rp) and B(R) by claims 1 and 5 of The Borel Sigma-Algebra of a Euclidean Space as a Product, and Measurability of Projections, Sequentially Continuous Maps, and Open and Closed Sets. Since B(Rm) is the Borel σ-algebra of the metric space (Rm,dE) by Probability Measures on Euclidean Space and Random Vectors: Standing Notation §spaces, claim 4 of Borel Measurability and Bounded Integration on a Metric Space, applied first with Y=pk and g=h and then with Y=h∘pk and g=πi, shows that fj is measurable with respect to B(RqN) and B(R). By claims 2 and 5 of The Borel Sigma-Algebra of a Euclidean Space as a Product, and Measurability of Projections, Sequentially Continuous Maps, and Open and Closed Sets, h⊕ is measurable with respect to B(RqN) and B(RpN), that is, Borel.
Step 7 (Claim 3: continuity). Let h be continuous on Rq in the sense of Continuous Map Between Metric Spaces, and fix x∈RqN. Recall that dE(z,z′)=∥z−z′∥ by claim 2 of Elementary Properties of the Euclidean Norm on Rn, that dE(z,z′)=dE(z′,z) by condition 3 of Metric Space and Euclidean Distance is a Metric on Rn, and that ∥z−z′∥2=∑l(zl−zl′)2 by claim 1 of Elementary Properties of the Euclidean Norm on Rn and clause 1 of Difference, Dot Product, and Orthogonality in Rn.
First, each component fj (j∈[pN], fj=πi∘h∘pk as in Step 5), regarded as a map into R1, is continuous at x in the sense of Continuity at a Point for Maps Between Euclidean Spaces. Let ε>0. By continuity of h at pk(x) choose, depending on ε, a real δ>0 such that every z∈Rq with dE(pk(x),z)<δ satisfies dE(h(z),h(pk(x)))<ε. Let y∈RqN with ∑l=1qN(yl−xl)2<δ2, that is, ∥y−x∥2<δ2; by the three facts just recalled, ∥x−y∥=dE(x,y)=dE(y,x)=∥y−x∥, so ∥x−y∥2<δ2. Since 0≤∥x−y∥ and 0<δ, claim 1 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field gives ∥x−y∥<δ, and by (2) and claim 2 of Elementary Order Arithmetic in an Ordered Field, dE(pk(x),pk(y))=∥pk(x)−pk(y)∥<δ. Hence w=h(pk(y))−h(pk(x)) satisfies ∥w∥<ε, so ∥w∥2<ε2 by claim 1 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field. Now ∥w∥2=∑i′=1pwi′2 with nonnegative summands (claim 2 of Nonnegativity of Squares in an Ordered Field), and wi=fj(y)−fj(x), so claim 6 of Properties of Finite Sums and claim 2 of Elementary Order Arithmetic in an Ordered Field give (fj(y)−fj(x))2<ε2, which by claim 1 of Properties of Finite Sums is ∑l=11(fj(y)−fj(x))2<ε2.
By Coordinatewise Criterion for Continuity of a Map Between Euclidean Spaces (with n=qN, m=pN, E=RqN, f=h⊕, a=x), h⊕ is continuous at x in the sense of Continuity at a Point for Maps Between Euclidean Spaces. Let ε>0 and choose, depending on ε, the δ>0 provided there. If y∈RqN and dE(x,y)<δ, then ∥y−x∥=dE(y,x)=dE(x,y)<δ, so ∑l=1qN(yl−xl)2=∥y−x∥2<δ2 by claim 1 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field; hence ∥h⊕(y)−h⊕(x)∥2=∑j=1pN(fj(y)−fj(x))2<ε2, and claim 1 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field gives dE(h⊕(y),h⊕(x))<ε. Thus h⊕ is continuous at x relative to RqN, and, x being arbitrary, continuous on RqN.
Step 8 (Claim 3: Lipschitz). Let h be Lipschitz with constant L, a nonnegative real, in the sense of Lipschitz Map Between Metric Spaces, and let x,x′∈RqN, z=h⊕(x)−h⊕(x′). By Steps 2 and 5 (in dimension p), pk(z)=h(pk(x))−h(pk(x′)), so Step 4 in RpN gives ∥z∥2=∑k=1N∥h(pk(x))−h(pk(x′))∥2. For each k, the Lipschitz bound, claim 2 of Elementary Properties of the Euclidean Norm on Rn and Step 2 give
∥h(pk(x))−h(pk(x′))∥≤L∥pk(x)−pk(x′)∥=L∥pk(x−x′)∥.
Both sides are nonnegative: the left by claim 1 of Elementary Properties of the Euclidean Norm on Rn, the right by claim 5 of Elementary Arithmetic in an Ordered Field applied to 0≤∥pk(x−x′)∥ and 0≤L, with L⋅0=0 by claim 1 of Zero Products and Elementary Identities in a Field. So claim 2 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field and axioms 5 and 8 of Field give ∥h(pk(x))−h(pk(x′))∥2≤L2∥pk(x−x′)∥2. By claim 1 of Comparison and Absolute Value Bounds for Finite Sums of Real Numbers, claim 3 of Properties of Finite Sums and Step 4 in RqN,
∥z∥2≤L2k=1∑N∥pk(x−x′)∥2=L2∥x−x′∥2=(L∥x−x′∥)2.
As 0≤∥z∥ and 0≤L∥x−x′∥ (as above), claim 2 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field gives ∥z∥≤L∥x−x′∥, that is, dE(h⊕(x),h⊕(x′))≤LdE(x,x′) by claim 2 of Elementary Properties of the Euclidean Norm on Rn. So h⊕ is Lipschitz with constant L.
Step 9 (Claim 4). Let a∈Rq and x∈RqN. By Particle Blocks of the Configuration Space: Block Maps, Configurations, Product Maps and Diagonal Points §diagonal and Particle Blocks of the Configuration Space: Block Maps, Configurations, Product Maps and Diagonal Points §configuration, pk(a⊕)=a for every k∈[N], so Step 2 gives pk(x+a⊕)=pk(x)+a. By Step 4, a⊕⋅x=∑k=1Na⋅vk with vk=pk(x). The sum ∑k=1Nvk is the finite sum of Finite Sum Notation in a Vector Space in the real vector space Rq of Euclidean Space Rn is a Real Vector Space. Let A be the set of n∈N such that n∈/[N] or a⋅∑k=1nvk=∑k=1na⋅vk. Then 1∈A, both sides being a⋅v1 by claim 1 of Properties of Finite Sums of Vectors and claim 1 of Properties of Finite Sums. Let n∈A with S(n)∈[N]; since n<S(n) by claim 5 of Properties of the Order on the Natural Numbers, claim 1 there gives n∈[N], and by claim 1 of Properties of Finite Sums of Vectors, claim 5 of Bilinearity and Symmetry of the Dot Product on Rn, n∈A, and claim 1 of Properties of Finite Sums,
a⋅k=1∑S(n)vk=a⋅k=1∑nvk+a⋅vS(n)=k=1∑na⋅vk+a⋅vS(n)=k=1∑S(n)a⋅vk;
so S(n)∈A. By Principle of Induction for the Natural Numbers, A=N; as N∈[N] by claim 1 of Basic Properties of Initial Segments of the Natural Numbers, a⊕⋅x=a⋅∑k=1Npk(x). Finally, by Step 4, axiom 6 of Field, claim 3 of Properties of Finite Sums and The Canonical Map from the Natural Numbers to a Field,
∥a⊕∥2=k=1∑N∥a∥2⋅1=∥a∥2k=1∑N1=∥a∥2ιR(N),
which is N∥a∥2 by axiom 8 of Field and clause 3 of The Real Numbers and Standard Notation.
Step 10 (Claim 5). By identities 1 and 4 of Natural Numbers, q(n+1)=qS(n)=qn+q. Let u∈Rqn, v∈Rq and w=ιqn,q(u,v). By the definition of the concatenation map in Concatenation Identifies a Product of Euclidean Spaces with a Euclidean Space (with m=qn and n=q there), fixed in Probability Measures on Euclidean Space and Random Vectors: Standing Notation §pairs, wl=ul for l∈[qn] and wqn+j=vj for j∈[q]. The number b(k,i)=(k−1)q+i does not depend on the number of blocks. For k∈[n] and i∈[q], b(k,i)∈[qn] by Block Indices: Enumerating an Initial Segment of Length qN by Blocks and Positions §range (with n in place of N), so by (1) for N=n+1 and for N=n, (pk(n+1)(w))i=wb(k,i)=ub(k,i)=(pk(n)(u))i, and extensionality gives pk(n+1)(w)=pk(n)(u). For k=n+1, which lies in [n+1] by claim 1 of Basic Properties of Initial Segments of the Natural Numbers: with ι=ιR as in clause 3 of The Real Numbers and Standard Notation, claim 1 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field and axioms 1, 3 and 2 of Field give ι(n+1)−1=ι(n), so axiom 8 of Field and claims 5 and 4 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field give b(n+1,i)=ι(q)ι(n)+ι(i)=ι(qn+i), and by claim 7 there b(n+1,i) is the natural number qn+i. Hence (pn+1(n+1)(w))i=wqn+i=vi for every i∈[q], and extensionality gives pn+1(n+1)(w)=v.