Each result cited is universally quantified over the data in its own statement. For n∈N write pk(n), k∈[n], for the block maps of Rqn (Particle Blocks of the Configuration Space: Block Maps, Configurations, Product Maps and Diagonal Points §blocks with N=n), and ρ⊗n for the tensor power in Rqn (The Tensor Power of a Probability Measure on Euclidean Space §tensor with N=n). A natural number used as a real number is its image under the canonical map, as in Properties of the Canonical Map from the Natural Numbers to an Ordered Field.
Step 1 (One particle). For n=1 we have q⋅1=q and b(1,i)=(1−1)q+i=i for i∈[q], so p1(1)(x)=(x1,…,xq)=x: the map p1(1) is the identity of Rq. Hence (p1(1))#P=P for every P∈P(Rq), and for ρ∈P(Rq) and B∈B(Rq), by The Tensor Power of a Probability Measure on Euclidean Space §tensor and Finite Product Notation, ρ⊗1(B)=ρ⊗1((p1(1))−1(B))=∏k=11ρ(B)=ρ(B); so ρ⊗1=ρ.
Step 2 (Adding a particle). Let n∈N, and write ι=ιqn,q, pr1=pr1qn,q and pr2=pr2qn,q, on Rq(n+1)=Rqn+q. Every z∈Rq(n+1) equals ι(pr1(z),pr2(z)) by Pairs of Euclidean Points: Coordinate Projections, Pairings, the Product Measure on a Euclidean Space, Borel Norm Functions and Finite Sets §projections, so Particle Blocks: Linearity, Splitting of Inner Products, Product Maps and Diagonal Shifts §concatenation gives
pk(n+1)=pk(n)∘pr1(k∈[n]),pn+1(n+1)=pr2.(1)
Consequently, for P∈P(Rq(n+1)) and Q1=(pr1)#P, the definition of the push-forward in Probability Measures on Euclidean Space and Random Vectors: Standing Notation §pushforward gives, for B∈B(Rq) and k∈[n], P((pk(n+1))−1(B))=P(pr1−1((pk(n))−1(B)))=Q1((pk(n))−1(B)); that is,
(pk(n+1))#P=(pk(n))#Q1(k∈[n]),(pn+1(n+1))#P=(pr2)#P.(2)
Now let ρ∈P(Rq); we show ρ⊗(n+1)=ρ⊗n⊠ρ. Let B1,…,Bn+1∈B(Rq) and A=⋂k=1n(pk(n))−1(Bk), which belongs to B(Rqn) since each pk(n) is Borel (Particle Blocks: Linearity, Splitting of Inner Products, Product Maps and Diagonal Shifts §linear). Every k∈[n+1] lies in [n] or equals n+1 (claim 5 of Properties of the Order on the Natural Numbers), so by (1) a point z lies in ⋂k=1n+1(pk(n+1))−1(Bk) exactly when pr1(z)∈A and pr2(z)∈Bn+1. As z=ι(pr1(z),pr2(z)) and pr1(ι(u,v))=u, pr2(ι(u,v))=v, this holds exactly when z∈ι(A×Bn+1). By Pairs of Euclidean Points: Coordinate Projections, Pairings, the Product Measure on a Euclidean Space, Borel Norm Functions and Finite Sets §product, The Tensor Power of a Probability Measure on Euclidean Space §tensor for ρ⊗n, and the recursion of Finite Product Notation (n+1≥2),
(ρ⊗n⊠ρ)(k=1⋂n+1(pk(n+1))−1(Bk))=ρ⊗n(A)ρ(Bn+1)=(k=1∏nρ(Bk))ρ(Bn+1)=k=1∏n+1ρ(Bk).
Since ρ⊗n⊠ρ∈P(Rqn+q)=P(Rq(n+1)), the uniqueness in Existence and Uniqueness of Tensor Powers, and the Average of the Block Marginals §tensor (with N=n+1) gives ρ⊗(n+1)=ρ⊗n⊠ρ.
Step 3 (Claim 1). Fix ρ∈P2Ent(Rq) and let T be the set of n∈N with ρ⊗n∈P2Ent(Rqn) and Ent(ρ⊗n)=nEnt(ρ). By Step 1, 1∈T. If n∈T, then by Step 2 and Entropy of Products, Subadditivity over Two Marginals, and Convexity of the Entropy §product (with dimensions qn and q), ρ⊗(n+1)=ρ⊗n⊠ρ∈P2Ent(Rq(n+1)) and Ent(ρ⊗(n+1))=nEnt(ρ)+Ent(ρ)=(n+1)Ent(ρ), using claim 1 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field; so n+1∈T. As n+1 is the successor of n (claim 1 of Arithmetic of Addition on the Natural Numbers), Principle of Induction for the Natural Numbers gives T=N, and in particular N∈T.
Step 4 (Claim 2). Let U be the set of n∈N such that for every P∈P2Ent(Rqn) each (pk(n))#P, k∈[n], belongs to P2Ent(Rq) and ∑k=1nEnt((pk(n))#P)≤Ent(P). By Step 1 and ∑k=11ak=a1 (claim 1 of Properties of Finite Sums), 1∈U. Let n∈U and P∈P2Ent(Rq(n+1)), and put Q1=(pr1)#P, Q2=(pr2)#P as in Step 2. By Entropy of Products, Subadditivity over Two Marginals, and Convexity of the Entropy §subadditive (with dimensions qn and q), Q1∈P2Ent(Rqn), Q2∈P2Ent(Rq) and Ent(Q1)+Ent(Q2)≤Ent(P). By (2), (pn+1(n+1))#P=Q2 and, for k∈[n], (pk(n+1))#P=(pk(n))#Q1, which belongs to P2Ent(Rq) since n∈U. Every k∈[n+1] lies in [n] or equals n+1, so all particle laws of P belong to P2Ent(Rq), and by the recursion in claim 1 of Properties of Finite Sums and n∈U,
k=1∑n+1Ent((pk(n+1))#P)=k=1∑nEnt((pk(n))#Q1)+Ent(Q2)≤Ent(Q1)+Ent(Q2)≤Ent(P).
Hence n+1∈U, and Principle of Induction for the Natural Numbers gives U=N; in particular N∈U.
Step 5 (Claim 3). Let P∈P2Ent(RqN) and μk=(pk)#P for k∈[N]; by Step 4, μk∈P2Ent(Rq) and ∑k=1NEnt(μk)≤Ent(P). Put tk=N−1, which is positive by claim 3 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field. By The One-Particle Marginal of a Probability Measure on the Configuration Space §marginal and claim 3 of Properties of Finite Sums, P[1](B)=N−1∑k=1Nμk(B)=∑k=1Ntkμk(B) for B∈B(Rq); for B=Rq, where μk(Rq)=P(RqN)=1, this reads ∑k=1Ntk=P[1](Rq)=1, P[1] being a probability measure. Hence Entropy of Products, Subadditivity over Two Marginals, and Convexity of the Entropy §convex (with n=N) applies and gives P[1]∈P2Ent(Rq) and, with claim 3 of Properties of Finite Sums and claim 5 of Elementary Arithmetic in an Ordered Field (0≤N−1),
Ent(P[1])≤k=1∑NN−1Ent(μk)=N−1k=1∑NEnt(μk)≤N−1Ent(P).
Multiplying by N≥0 (claim 5 of Elementary Arithmetic in an Ordered Field) gives NEnt(P[1])≤Ent(P).