Reason: First published version. Proof of the Gamma-liminf theorem for the N-agent cost. Three elementary devices are recorded first: passing an eventual upper bound to the limit inferior, the index domination for a strictly increasing sequence of natural numbers, and the arbitrariness-of-epsilon principle obtained by halving twice. The laws are identified as Borel probability measures on the compact product and the expected mean-field cost is rewritten as an integral against them by change of variables; the sets on which the initial coordinate is far from the fixed initial state are shown open directly from the triangle inequality, and their masses vanish, so the portmanteau inequality for open sets forces every subsequential weak limit to be carried by the fixed initial state; the lower bound then follows from extraction along the limit inferior, weak sequential compactness, and the portmanteau inequality for bounded lower semicontinuous functions; and for an asymptotically optimal sequence the exceptional level sets are shown null by an explicit comparison function, giving full mass to the optimal mean-field controls.
Proof
Throughout, an inequality a≤b between real numbers means that a<b or a=b, and we use the order arithmetic of Elementary Order Arithmetic in an Ordered Field both in the strict form stated there and in the nonstrict form obtained by adjoining the case of equality. Absolute values are those of Properties of the Absolute Value in an Ordered Field; we use its claim 6, by which ∣a∣≤c holds if and only if −c≤a and a≤c.
Step 0. Two elementary devices.
(E)Let (an)n∈N be a bounded sequence of real numbers, let M be a real number, and suppose there is a natural number N1 with an≤M for every n≥N1. Then liminfnan≤M. Indeed, let δ>0 be real. By claim 3 of the basic properties of the limit inferior and limit superior there is a natural number N2 such that liminfnan−δ<ap for every p≥N2. Choosing p at least N1 and at least N2 gives liminfnan−δ<ap≤M, hence liminfnan<M+δ. If M<liminfnan, then taking δ=liminfnan−M, which is positive, yields liminfnan<liminfnan, a contradiction. Hence liminfnan≤M.
(F)If (Nj)j∈N is a strictly increasing sequence of natural numbers, then j≤Nj for every j∈N. This follows by induction: 1≤N1 because 1 is the least natural number, and if j≤Nj then j+1≤Nj+1≤Nj+1.
(G)Let a and b be real numbers and suppose that a≤b+ε+ε for every real ε>0. Then a≤b. Suppose instead that b<a, and put δ=a−b, a positive real number. By claim 8 of Elementary Order Arithmetic in an Ordered Field the number δ1=δ⋅2−1 satisfies 0<δ1, δ1<δ and δ1+δ1=δ. Applying that claim again, now to δ1, the number ε=δ1⋅2−1 satisfies 0<ε and ε+ε=δ1. For this ε the hypothesis gives
a≤b+ε+ε=b+δ1<b+δ=a,
a contradiction. Hence a≤b. Below we write 2ε for ε+ε.
We also record, for later use, that −CF≤Jσ∗≤CF. Indeed, by claim 1 of the attainment theorem we have ∣F(σ,ξ)∣≤CF, hence −CF≤F(σ,ξ)≤CF, for every ξ∈UA. Thus −CF is a lower bound of the set Vσ={F(σ,ξ):ξ∈UA} whose infimum is Jσ∗, the infimum existing by the derivation recorded in the definition of the optimal mean-field value. By part (ii) of the definition of an infimum, which makes it a greatest lower bound, we get −CF≤Jσ∗; and by part (i), which makes it a lower bound of Vσ, we get Jσ∗≤F(σ,ξ) for every ξ∈UA. As UA is nonempty, choosing any ξ0∈UA gives Jσ∗≤F(σ,ξ0)≤CF. In particular Jσ∗≤F(σ,ξ) for every ξ∈UA, that is,
Jσ∗≤F(x)for every x∈A.(∗)
Step 1. Proof of claim 1.
Fix a natural number N. By claim 5 of the realized-control lemma the map ω↦(Σ0N(ω),α^N(ω)) is a random element of (X,dX), so its law μN is the image measure of PN under that map. By claim 1 of that lemma μN is a measure on (X,B(X)) with μN(X)=PN(ΩN)=1; being a measure on the Borel σ-algebra of (X,dX), it is a Borel measure, and it is finite.
By claim 3 of the attainment theorem the function F is lower semicontinuous on X, hence measurable with respect to B(X) and the Borel σ-algebra of the real line by claim 5 of the Borel measurability toolkit. By claim 1 of the attainment theorem ∣F(x)∣≤CF for every x∈X, so F is integrable with respect to μN by claim 6(b) of that toolkit, applied with M=CF.
By claim 2 of the comparison lemma the cost JN[hN] is a real number and JN[hN]=EN[WN], where WN is a random variable with ∣WN(ω)∣≤C(T+1) for every ω∈ΩN. Applying claim 3 of the lemma on almost sure inequalities between bounded random variables with WN in both random-variable slots of that lemma, with K=c=C(T+1), and with the event ΩN itself, which has probability 1, gives ∣JN[hN]∣≤C(T+1).
By claim 2 of the comparison lemma the map ω↦F(Σ0N(ω),α^N(ω)) is a random variable; it is the composition of F with the random element (Σ0N,α^N). Since F is integrable with respect to μN, claim 2 of the change-of-variables lemma, applied with that random element as the measurable map and with F as the integrand, gives
∫XFdμN=∫ΩNF(Σ0N,α^N)dPN=EN[F(Σ0N,α^N)],
the last equality being the definition of the expectation. This proves claim 1.
Step 2. The sets Uε are open, and A is Borel.
For a real number ε>0 put
Uε={(x0,ξ)∈X:ε<dΔ(x0,σ)}.
We check that Uε is open in (X,dX). Let (x0,ξ)∈Uε and put r=dΔ(x0,σ)−ε, a positive real number. Let (y0,η)∈X satisfy dX((x0,ξ),(y0,η))<r. Since dX is the product metric, which is the larger of the two coordinate distances, we get dΔ(x0,y0)<r. By the triangle inequality for the metricdΔ we have dΔ(x0,σ)≤dΔ(x0,y0)+dΔ(y0,σ), whence
Thus the open ball of radius r about (x0,ξ) is contained in Uε, so Uε is open, and therefore Uε∈B(X) by claim 1 of the Borel measurability toolkit.
Next, A=X∖⋃k∈NU1/k. Indeed, a point (x0,ξ)∈X lies outside every U1/k precisely when dΔ(x0,σ)≤1/k for every natural number k. If dΔ(x0,σ)>0, then by claim 3 of The Archimedean Property of the Real Numbers there is a natural number k with 1/k<dΔ(x0,σ), contradicting that bound; so the condition holds precisely when dΔ(x0,σ)=0, that is, by the metric axioms, precisely when x0=σ. Since a σ-algebra is closed under countable unions and complements, A∈B(X).
Step 3. The masses μN(Uε) tend to zero.
Fix a real ε>0 and a natural number N. Writing ΛN=(Σ0N,α^N) for the random element of Step 1, we have by the definition of the law
By hypothesis (Σ0N)N∈N converges in distribution to the constant random element Yσ, so claim 3 of that lemma shows that (PN(EN,ε))N∈Nconverges to 0. By claim 3 of the order properties of limits, the sequence (μN(Uε))N∈N therefore converges to 0 as well.
Now let (Nj)j∈N be any strictly increasing sequence of natural numbers and let μ be a Borel measure on (X,dX) with μ(X)=1 such that (μNj)j∈N converges weakly to μ. Fix a natural number k; we show μ(U1/k)=0.
the sequence on the right being bounded because each of its terms lies between 0 and 1. Let δ>0 be real. By Step 3 there is a natural number N1 with μN(U1/k)≤δ for every N≥N1; by device (F) we have j≤Nj, so μNj(U1/k)≤δ for every j≥N1. Device (E) now gives liminfjμNj(U1/k)≤δ, hence μ(U1/k)≤δ. As δ>0 was arbitrary and 0≤μ(U1/k), we conclude μ(U1/k)=0.
By Step 2 we have X∖A=⋃k∈NU1/k, so countable subadditivity, claim 4 of the basic properties of a measure, gives μ(X∖A)≤∑k∈Nμ(U1/k)=0. Since μ is finite, claim 3 of that lemma yields μ(A)=μ(X)−μ(X∖A)=1. This proves claim 2.
Step 5. A comparison valid for all large N.
Let ε>0 be real. By claim 3 of the comparison lemma there is a natural number N0, depending only on l, B, T, Λb, A, L and G, such that
JN[hN]−EN[F(Σ0N,α^N)]≤ε
for every N≥N0; the hypotheses of that claim are met because each hN is an A-valued observation-driven control policy with horizon T, control dimension m and l~ channels, and each of our solutions is a solution for the corresponding data. Combining this with claim 1 and with the two-sided bound of claim 6 of Properties of the Absolute Value in an Ordered Field, we obtain
∫XFdμN≤JN[hN]+εfor every N≥N0.(†)
Step 6. A lower bound for the integral against any limit law.
Let μ be a Borel measure on (X,dX) with μ(X)=1 and μ(A)=1. We claim that
Jσ∗≤∫XFdμ.(‡)
Regard (X,B(X),μ) as a probability space. The constant function on X with value Jσ∗ and the function F are both measurable, and both are bounded in absolute value by CF everywhere on X, by claim 1 of the attainment theorem and by Step 0. By (∗) the first is at most the second at every point of A, and μ(A)=1. Hence claim 1 of the lemma on almost sure inequalities between bounded random variables, applied on this probability space with the event A, gives ∫XJσ∗dμ≤∫XFdμ. By claim 6(a) of the Borel measurability toolkit the left-hand side equals Jσ∗μ(X)=Jσ∗, which is (‡).
Step 7. Proof of claim 3.
By claim 1 we have ∣JN[hN]∣≤C(T+1) for every N. A bound in the sense of the definition of a bounded real sequence is required to be positive, whereas C(T+1) is only known to be nonnegative; we therefore use C(T+1)+1, which is positive and satisfies ∣JN[hN]∣≤C(T+1)<C(T+1)+1. Thus (JN[hN])N∈N is bounded and its limit inferior ℓ=liminfNJN[hN] is defined.
By claim 1 each μni is a Borel measure on the compact metric space (X,dX) with total mass 1, so the weak sequential compactness theorem provides a strictly increasing sequence (ip)p∈N of natural numbers and a Borel measure μ on (X,dX) with μ(X)=1 such that (μnip)p∈N converges weakly to μ. The sequence p↦nip is strictly increasing, being a composition of strictly increasing sequences of natural numbers, so claim 2 applies and gives μ(A)=1.
The function F is bounded in absolute value by CF and lower semicontinuous on X, so claim 2 of the portmanteau theorem gives that (∫XFdμnip)p∈N is bounded and
∫XFdμ≤pliminf∫XFdμnip.
By device (F) applied twice we have p≤ip≤nip, so for every p≥N0 the index nip is at least N0, and (†) together with the choice of the ni gives
∫XFdμnip≤Jnip[hnip]+ε<ℓ+2ε.
Device (E) therefore gives liminfp∫XFdμnip≤ℓ+2ε, whence ∫XFdμ≤ℓ+2ε. Combining with (‡) of Step 6, which applies because μ(A)=1, we obtain Jσ∗≤ℓ+2ε.
This holds for every real ε>0, so device (G), applied with a=Jσ∗ and b=ℓ, gives Jσ∗≤ℓ. This is claim 3.
Step 8. Proof of claim 4.
Assume now that (JN[hN])N∈N converges to Jσ∗, let (Nj)j∈N be a strictly increasing sequence of natural numbers, and let μ be a Borel measure on (X,dX) with μ(X)=1 such that (μNj)j∈N converges weakly to μ. By claim 2 we have μ(A)=1.
(a) The integral of F against μ is at most Jσ∗. Let ε>0 be real and let N0 be as in Step 5. Since (JN[hN])N∈N converges to Jσ∗, there is a natural number N1 with JN[hN]<Jσ∗+ε for every N≥N1. Hence, by (†), for every N at least N0 and at least N1 we have ∫XFdμN<Jσ∗+2ε. By device (F), j≤Nj, so the same bound holds for ∫XFdμNj for all sufficiently large j. Claim 2 of the portmanteau theorem, applicable because F is bounded and lower semicontinuous, together with device (E), gives
∫XFdμ≤jliminf∫XFdμNj≤Jσ∗+2ε.
As this holds for every real ε>0, device (G), applied with a=∫XFdμ and b=Jσ∗, yields ∫XFdμ≤Jσ∗.
(b) The exceptional sets are null. Fix a natural number k and put
Ek=A∩{x∈X:Jσ∗+1/k≤F(x)}.
The set [Jσ∗+1/k,∞) is a closed subset of the real line and hence lies in its Borel σ-algebra by claims 4 and 5 of the lemma on Borel measurability in Euclidean space; since F is measurable by claim 1, its preimage under F lies in B(X). As A∈B(X) by Step 2 and a σ-algebra is closed under finite intersections, Ek∈B(X).
We have u(x)≤F(x) for every x∈A: if x∈Ek this is the defining inequality of Ek, and if x∈A∖Ek then u(x)=Jσ∗≤F(x) by (∗). Since μ(A)=1 and both u and F are bounded everywhere, claim 1 of the lemma on almost sure inequalities between bounded random variables, applied on the probability space (X,B(X),μ) with the event A, gives ∫Xudμ≤∫XFdμ, hence ∫Xudμ≤Jσ∗ by part (a).
On the other hand 1Ek is nonnegative, bounded by 1 and measurable, so it is integrable with respect to μ by claim 6(b) of the Borel measurability toolkit, and by claim 6(c) of that toolkit its integral coincides with its integral as a nonnegative measurable function, which equals μ(Ek) by the indicator lemma. Using linearity of the integral, Linearity and Monotonicity of the Lebesgue Integral, and claim 6(a) of the toolkit for the constant term, we get
∫Xudμ=Jσ∗μ(X)+(1/k)μ(Ek)=Jσ∗+(1/k)μ(Ek).
Combining the two displays gives (1/k)μ(Ek)≤0. Now μ(Ek)≥0, since μ takes values in [0,∞] and is finite. If μ(Ek)>0, then, 1/k being positive, claim 5 of Elementary Order Arithmetic in an Ordered Field would give (1/k)μ(Ek)>0, contradicting the previous inequality. Hence μ(Ek)=0.
(c) Identification of the remaining set. We show that
A∖k∈N⋃Ek={σ}×Mσ∗.
Let x=(σ,ξ) with ξ∈UA, so that x∈A. Then x lies outside every Ek precisely when F(σ,ξ)<Jσ∗+1/k for every natural number k. If Jσ∗<F(σ,ξ), then by claim 3 of The Archimedean Property of the Real Numbers there is a natural number k with 1/k<F(σ,ξ)−Jσ∗, that is, Jσ∗+1/k<F(σ,ξ), so x∈Ek. Conversely, if F(σ,ξ)≤Jσ∗ then F(σ,ξ)<Jσ∗+1/k for every k. Hence x lies outside every Ek precisely when F(σ,ξ)≤Jσ∗, which by (∗) holds precisely when F(σ,ξ)=Jσ∗, that is, precisely when ξ∈Mσ∗. This proves the displayed identity, and it exhibits {σ}×Mσ∗ as the difference of A∈B(X) and a countable union of members of B(X), so {σ}×Mσ∗∈B(X).