TheoremBase

Proof of Asymptotic Lower Bound for the N-Agent Cost and Concentration of the Limit Laws on the Optimal Mean-Field Controls

theoremthm:n-agent-cost-liminf-limit-laws-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
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 aba\le b between real numbers means that a<ba<b or a=ba=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 ac|a|\le c holds if and only if ca-c\le a and aca\le c.

Step 0. Two elementary devices.

(E) Let (an)nN(a_{n})_{n\in\mathbb{N}} be a bounded sequence of real numbers, let MM be a real number, and suppose there is a natural number N1N_{1} with anMa_{n}\le M for every nN1n\ge N_{1}. Then lim infnanM\liminf_{n}a_{n}\le M. Indeed, let δ>0\delta>0 be real. By claim 3 of the basic properties of the limit inferior and limit superior there is a natural number N2N_{2} such that lim infnanδ<ap\liminf_{n}a_{n}-\delta<a_{p} for every pN2p\ge N_{2}. Choosing pp at least N1N_{1} and at least N2N_{2} gives lim infnanδ<apM\liminf_{n}a_{n}-\delta<a_{p}\le M, hence lim infnan<M+δ\liminf_{n}a_{n}<M+\delta. If M<lim infnanM<\liminf_{n}a_{n}, then taking δ=lim infnanM\delta=\liminf_{n}a_{n}-M, which is positive, yields lim infnan<lim infnan\liminf_{n}a_{n}<\liminf_{n}a_{n}, a contradiction. Hence lim infnanM\liminf_{n}a_{n}\le M.

(F) If (Nj)jN(N_{j})_{j\in\mathbb{N}} is a strictly increasing sequence of natural numbers, then jNjj\le N_{j} for every jNj\in\mathbb{N}. This follows by induction: 1N11\le N_{1} because 11 is the least natural number, and if jNjj\le N_{j} then j+1Nj+1Nj+1j+1\le N_{j}+1\le N_{j+1}.

(G) Let aa and bb be real numbers and suppose that ab+ε+εa\le b+\varepsilon+\varepsilon for every real ε>0\varepsilon>0. Then aba\le b. Suppose instead that b<ab<a, and put δ=ab\delta=a-b, a positive real number. By claim 8 of Elementary Order Arithmetic in an Ordered Field the number δ1=δ21\delta_{1}=\delta\cdot 2^{-1} satisfies 0<δ10<\delta_{1}, δ1<δ\delta_{1}<\delta and δ1+δ1=δ\delta_{1}+\delta_{1}=\delta. Applying that claim again, now to δ1\delta_{1}, the number ε=δ121\varepsilon=\delta_{1}\cdot 2^{-1} satisfies 0<ε0<\varepsilon and ε+ε=δ1\varepsilon+\varepsilon=\delta_{1}. For this ε\varepsilon the hypothesis gives

ab+ε+ε=b+δ1<b+δ=a,a\le b+\varepsilon+\varepsilon=b+\delta_{1}<b+\delta=a,

a contradiction. Hence aba\le b. Below we write 2ε2\varepsilon for ε+ε\varepsilon+\varepsilon.

We also record, for later use, that CFJσCF-C_{F}\le J^{*}_{\sigma}\le C_{F}. Indeed, by claim 1 of the attainment theorem we have F(σ,ξ)CF|F(\sigma,\xi)|\le C_{F}, hence CFF(σ,ξ)CF-C_{F}\le F(\sigma,\xi)\le C_{F}, for every ξUA\xi\in\mathcal{U}_{\mathcal{A}}. Thus CF-C_{F} is a lower bound of the set Vσ={F(σ,ξ):ξUA}V_{\sigma}=\{F(\sigma,\xi):\xi\in\mathcal{U}_{\mathcal{A}}\} whose infimum is JσJ^{*}_{\sigma}, 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 CFJσ-C_{F}\le J^{*}_{\sigma}; and by part (i), which makes it a lower bound of VσV_{\sigma}, we get JσF(σ,ξ)J^{*}_{\sigma}\le F(\sigma,\xi) for every ξUA\xi\in\mathcal{U}_{\mathcal{A}}. As UA\mathcal{U}_{\mathcal{A}} is nonempty, choosing any ξ0UA\xi_{0}\in\mathcal{U}_{\mathcal{A}} gives JσF(σ,ξ0)CFJ^{*}_{\sigma}\le F(\sigma,\xi_{0})\le C_{F}. In particular JσF(σ,ξ)J^{*}_{\sigma}\le F(\sigma,\xi) for every ξUA\xi\in\mathcal{U}_{\mathcal{A}}, that is,

JσF(x)for every xA.()J^{*}_{\sigma}\le F(x)\qquad\text{for every }x\in A. \tag{$\ast$}

Step 1. Proof of claim 1.

Fix a natural number NN. By claim 5 of the realized-control lemma the map ω(Σ0N(ω),α^N(ω))\omega\mapsto(\Sigma^{N}_{0}(\omega),\hat{\alpha}^{N}(\omega)) is a random element of (X,dX)(X,d_{X}), so its law μN\mu^{N} is the image measure of PNP^{N} under that map. By claim 1 of that lemma μN\mu^{N} is a measure on (X,B(X))(X,\mathcal{B}(X)) with μN(X)=PN(ΩN)=1\mu^{N}(X)=P^{N}(\Omega^{N})=1; being a measure on the Borel σ\sigma-algebra of (X,dX)(X,d_{X}), it is a Borel measure, and it is finite.

By claim 3 of the attainment theorem the function FF is lower semicontinuous on XX, hence measurable with respect to B(X)\mathcal{B}(X) and the Borel σ\sigma-algebra of the real line by claim 5 of the Borel measurability toolkit. By claim 1 of the attainment theorem F(x)CF|F(x)|\le C_{F} for every xXx\in X, so FF is integrable with respect to μN\mu^{N} by claim 6(b) of that toolkit, applied with M=CFM=C_{F}.

By claim 2 of the comparison lemma the cost JN[hN]J^{N}[h^{N}] is a real number and JN[hN]=EN[WN]J^{N}[h^{N}]=\mathbb{E}^{N}[W^{N}], where WNW^{N} is a random variable with WN(ω)C(T+1)|W^{N}(\omega)|\le C(T+1) for every ωΩN\omega\in\Omega^{N}. Applying claim 3 of the lemma on almost sure inequalities between bounded random variables with WNW^{N} in both random-variable slots of that lemma, with K=c=C(T+1)K=c=C(T+1), and with the event ΩN\Omega^{N} itself, which has probability 11, gives JN[hN]C(T+1)|J^{N}[h^{N}]|\le C(T+1).

By claim 2 of the comparison lemma the map ωF(Σ0N(ω),α^N(ω))\omega\mapsto F(\Sigma^{N}_{0}(\omega),\hat{\alpha}^{N}(\omega)) is a random variable; it is the composition of FF with the random element (Σ0N,α^N)(\Sigma^{N}_{0},\hat{\alpha}^{N}). Since FF is integrable with respect to μN\mu^{N}, claim 2 of the change-of-variables lemma, applied with that random element as the measurable map and with FF as the integrand, gives

XFdμN=ΩNF(Σ0N,α^N)dPN=EN[F(Σ0N,α^N)],\int_{X}F\,d\mu^{N}=\int_{\Omega^{N}}F\bigl(\Sigma^{N}_{0},\hat{\alpha}^{N}\bigr)\,dP^{N}=\mathbb{E}^{N}\bigl[F\bigl(\Sigma^{N}_{0},\hat{\alpha}^{N}\bigr)\bigr],

the last equality being the definition of the expectation. This proves claim 1.

Step 2. The sets UεU_{\varepsilon} are open, and AA is Borel.

For a real number ε>0\varepsilon>0 put

Uε={(x0,ξ)X  :  ε<dΔ(x0,σ)}.U_{\varepsilon}=\bigl\{(x_{0},\xi)\in X\;:\;\varepsilon<d_{\Delta}(x_{0},\sigma)\bigr\}.

We check that UεU_{\varepsilon} is open in (X,dX)(X,d_{X}). Let (x0,ξ)Uε(x_{0},\xi)\in U_{\varepsilon} and put r=dΔ(x0,σ)εr=d_{\Delta}(x_{0},\sigma)-\varepsilon, a positive real number. Let (y0,η)X(y_{0},\eta)\in X satisfy dX((x0,ξ),(y0,η))<rd_{X}((x_{0},\xi),(y_{0},\eta))<r. Since dXd_{X} is the product metric, which is the larger of the two coordinate distances, we get dΔ(x0,y0)<rd_{\Delta}(x_{0},y_{0})<r. By the triangle inequality for the metric dΔd_{\Delta} we have dΔ(x0,σ)dΔ(x0,y0)+dΔ(y0,σ)d_{\Delta}(x_{0},\sigma)\le d_{\Delta}(x_{0},y_{0})+d_{\Delta}(y_{0},\sigma), whence

dΔ(y0,σ)dΔ(x0,σ)dΔ(x0,y0)>dΔ(x0,σ)r=ε.d_{\Delta}(y_{0},\sigma)\ge d_{\Delta}(x_{0},\sigma)-d_{\Delta}(x_{0},y_{0})>d_{\Delta}(x_{0},\sigma)-r=\varepsilon .

Thus the open ball of radius rr about (x0,ξ)(x_{0},\xi) is contained in UεU_{\varepsilon}, so UεU_{\varepsilon} is open, and therefore UεB(X)U_{\varepsilon}\in\mathcal{B}(X) by claim 1 of the Borel measurability toolkit.

Next, A=XkNU1/kA=X\setminus\bigcup_{k\in\mathbb{N}}U_{1/k}. Indeed, a point (x0,ξ)X(x_{0},\xi)\in X lies outside every U1/kU_{1/k} precisely when dΔ(x0,σ)1/kd_{\Delta}(x_{0},\sigma)\le 1/k for every natural number kk. If dΔ(x0,σ)>0d_{\Delta}(x_{0},\sigma)>0, then by claim 3 of The Archimedean Property of the Real Numbers there is a natural number kk with 1/k<dΔ(x0,σ)1/k<d_{\Delta}(x_{0},\sigma), contradicting that bound; so the condition holds precisely when dΔ(x0,σ)=0d_{\Delta}(x_{0},\sigma)=0, that is, by the metric axioms, precisely when x0=σx_{0}=\sigma. Since a σ\sigma-algebra is closed under countable unions and complements, AB(X)A\in\mathcal{B}(X).

Step 3. The masses μN(Uε)\mu^{N}(U_{\varepsilon}) tend to zero.

Fix a real ε>0\varepsilon>0 and a natural number NN. Writing ΛN=(Σ0N,α^N)\Lambda^{N}=(\Sigma^{N}_{0},\hat{\alpha}^{N}) for the random element of Step 1, we have by the definition of the law

μN(Uε)=PN((ΛN)1(Uε)),(ΛN)1(Uε)={ωΩN:ε<dΔ(Σ0N(ω),σ)},\mu^{N}(U_{\varepsilon})=P^{N}\bigl((\Lambda^{N})^{-1}(U_{\varepsilon})\bigr),\qquad (\Lambda^{N})^{-1}(U_{\varepsilon})=\bigl\{\omega\in\Omega^{N}:\varepsilon<d_{\Delta}(\Sigma^{N}_{0}(\omega),\sigma)\bigr\},

and this set lies in FN\mathcal{F}^{N} because ΛN\Lambda^{N} is measurable and UεB(X)U_{\varepsilon}\in\mathcal{B}(X). Let

EN,ε={ωΩN:εdΔ(Σ0N(ω),σ)},E_{N,\varepsilon}=\bigl\{\omega\in\Omega^{N}:\varepsilon\le d_{\Delta}(\Sigma^{N}_{0}(\omega),\sigma)\bigr\},

which lies in FN\mathcal{F}^{N} by claim 2 of the lemma on convergence in distribution to a constant, applied to the random elements Σ0N\Sigma^{N}_{0} of (Δl,dΔ)(\Delta^{l},d_{\Delta}) and to the point σ\sigma. Since (ΛN)1(Uε)EN,ε(\Lambda^{N})^{-1}(U_{\varepsilon})\subseteq E_{N,\varepsilon}, monotonicity of PNP^{N}, which is claim 2 of the basic properties of a measure, gives

0μN(Uε)PN(EN,ε).0\le\mu^{N}(U_{\varepsilon})\le P^{N}(E_{N,\varepsilon}).

By hypothesis (Σ0N)NN(\Sigma^{N}_{0})_{N\in\mathbb{N}} converges in distribution to the constant random element YσY_{\sigma}, so claim 3 of that lemma shows that (PN(EN,ε))NN(P^{N}(E_{N,\varepsilon}))_{N\in\mathbb{N}} converges to 00. By claim 3 of the order properties of limits, the sequence (μN(Uε))NN(\mu^{N}(U_{\varepsilon}))_{N\in\mathbb{N}} therefore converges to 00 as well.

Step 4. Proof of claim 2.

That AB(X)A\in\mathcal{B}(X) was shown in Step 2. By claim 4 of the compactness lemma the metric space (X,dX)(X,d_{X}) is compact, and by claim 1 each μN\mu^{N} is a Borel measure on it with μN(X)=1\mu^{N}(X)=1. Hence the weak sequential compactness theorem for Borel measures of total mass one on a compact metric space provides a strictly increasing sequence (Nj)jN(N_{j})_{j\in\mathbb{N}} of natural numbers and a Borel measure μ\mu on (X,dX)(X,d_{X}) with μ(X)=1\mu(X)=1 such that (μNj)jN(\mu^{N_{j}})_{j\in\mathbb{N}} converges weakly to μ\mu. This proves the existence assertion.

Now let (Nj)jN(N_{j})_{j\in\mathbb{N}} be any strictly increasing sequence of natural numbers and let μ\mu be a Borel measure on (X,dX)(X,d_{X}) with μ(X)=1\mu(X)=1 such that (μNj)jN(\mu^{N_{j}})_{j\in\mathbb{N}} converges weakly to μ\mu. Fix a natural number kk; we show μ(U1/k)=0\mu(U_{1/k})=0.

Since XX is nonempty and U1/kU_{1/k} is open, claim 3 of the portmanteau theorem gives

μ(U1/k)lim infjμNj(U1/k),\mu(U_{1/k})\le\liminf_{j}\mu^{N_{j}}(U_{1/k}),

the sequence on the right being bounded because each of its terms lies between 00 and 11. Let δ>0\delta>0 be real. By Step 3 there is a natural number N1N_{1} with μN(U1/k)δ\mu^{N}(U_{1/k})\le\delta for every NN1N\ge N_{1}; by device (F) we have jNjj\le N_{j}, so μNj(U1/k)δ\mu^{N_{j}}(U_{1/k})\le\delta for every jN1j\ge N_{1}. Device (E) now gives lim infjμNj(U1/k)δ\liminf_{j}\mu^{N_{j}}(U_{1/k})\le\delta, hence μ(U1/k)δ\mu(U_{1/k})\le\delta. As δ>0\delta>0 was arbitrary and 0μ(U1/k)0\le\mu(U_{1/k}), we conclude μ(U1/k)=0\mu(U_{1/k})=0.

By Step 2 we have XA=kNU1/kX\setminus A=\bigcup_{k\in\mathbb{N}}U_{1/k}, so countable subadditivity, claim 4 of the basic properties of a measure, gives μ(XA)kNμ(U1/k)=0\mu(X\setminus A)\le\sum_{k\in\mathbb{N}}\mu(U_{1/k})=0. Since μ\mu is finite, claim 3 of that lemma yields μ(A)=μ(X)μ(XA)=1\mu(A)=\mu(X)-\mu(X\setminus A)=1. This proves claim 2.

Step 5. A comparison valid for all large NN.

Let ε>0\varepsilon>0 be real. By claim 3 of the comparison lemma there is a natural number N0N_{0}, depending only on ll, BB, TT, Λb\Lambda_{b}, A\mathcal{A}, LL and GG, such that

JN[hN]EN[F(Σ0N,α^N)]ε\Bigl|J^{N}[h^{N}]-\mathbb{E}^{N}\bigl[F\bigl(\Sigma^{N}_{0},\hat{\alpha}^{N}\bigr)\bigr]\Bigr|\le\varepsilon

for every NN0N\ge N_{0}; the hypotheses of that claim are met because each hNh^{N} is an A\mathcal{A}-valued observation-driven control policy with horizon TT, control dimension mm and l~\tilde{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μNJN[hN]+εfor every NN0.()\int_{X}F\,d\mu^{N}\le J^{N}[h^{N}]+\varepsilon\qquad\text{for every }N\ge N_{0}. \tag{$\dagger$}

Step 6. A lower bound for the integral against any limit law.

Let μ\mu be a Borel measure on (X,dX)(X,d_{X}) with μ(X)=1\mu(X)=1 and μ(A)=1\mu(A)=1. We claim that

JσXFdμ.()J^{*}_{\sigma}\le\int_{X}F\,d\mu. \tag{$\ddagger$}

Regard (X,B(X),μ)(X,\mathcal{B}(X),\mu) as a probability space. The constant function on XX with value JσJ^{*}_{\sigma} and the function FF are both measurable, and both are bounded in absolute value by CFC_{F} everywhere on XX, by claim 1 of the attainment theorem and by Step 0. By ()(\ast) the first is at most the second at every point of AA, and μ(A)=1\mu(A)=1. Hence claim 1 of the lemma on almost sure inequalities between bounded random variables, applied on this probability space with the event AA, gives XJσdμXFdμ\int_{X}J^{*}_{\sigma}\,d\mu\le\int_{X}F\,d\mu. By claim 6(a) of the Borel measurability toolkit the left-hand side equals Jσμ(X)=JσJ^{*}_{\sigma}\mu(X)=J^{*}_{\sigma}, which is ()(\ddagger).

Step 7. Proof of claim 3.

By claim 1 we have JN[hN]C(T+1)|J^{N}[h^{N}]|\le C(T+1) for every NN. A bound in the sense of the definition of a bounded real sequence is required to be positive, whereas C(T+1)C(T+1) is only known to be nonnegative; we therefore use C(T+1)+1C(T+1)+1, which is positive and satisfies JN[hN]C(T+1)<C(T+1)+1|J^{N}[h^{N}]|\le C(T+1)<C(T+1)+1. Thus (JN[hN])NN(J^{N}[h^{N}])_{N\in\mathbb{N}} is bounded and its limit inferior =lim infNJN[hN]\ell=\liminf_{N}J^{N}[h^{N}] is defined.

Let ε>0\varepsilon>0 be real, and let N0N_{0} be as in Step 5 for this ε\varepsilon. By claim 4 of the basic properties of the limit inferior and limit superior there are natural numbers n1<n2<n3<n_{1}<n_{2}<n_{3}<\dots with

Jni[hni]<+εfor every iN.J^{n_{i}}[h^{n_{i}}]<\ell+\varepsilon\qquad\text{for every }i\in\mathbb{N}.

By claim 1 each μni\mu^{n_{i}} is a Borel measure on the compact metric space (X,dX)(X,d_{X}) with total mass 11, so the weak sequential compactness theorem provides a strictly increasing sequence (ip)pN(i_{p})_{p\in\mathbb{N}} of natural numbers and a Borel measure μ\mu on (X,dX)(X,d_{X}) with μ(X)=1\mu(X)=1 such that (μnip)pN(\mu^{n_{i_{p}}})_{p\in\mathbb{N}} converges weakly to μ\mu. The sequence pnipp\mapsto n_{i_{p}} is strictly increasing, being a composition of strictly increasing sequences of natural numbers, so claim 2 applies and gives μ(A)=1\mu(A)=1.

The function FF is bounded in absolute value by CFC_{F} and lower semicontinuous on XX, so claim 2 of the portmanteau theorem gives that (XFdμnip)pN(\int_{X}F\,d\mu^{n_{i_{p}}})_{p\in\mathbb{N}} is bounded and

XFdμlim infpXFdμnip.\int_{X}F\,d\mu\le\liminf_{p}\int_{X}F\,d\mu^{n_{i_{p}}}.

By device (F) applied twice we have pipnipp\le i_{p}\le n_{i_{p}}, so for every pN0p\ge N_{0} the index nipn_{i_{p}} is at least N0N_{0}, and ()(\dagger) together with the choice of the nin_{i} gives

XFdμnipJnip[hnip]+ε<+2ε.\int_{X}F\,d\mu^{n_{i_{p}}}\le J^{n_{i_{p}}}[h^{n_{i_{p}}}]+\varepsilon<\ell+2\varepsilon .

Device (E) therefore gives lim infpXFdμnip+2ε\liminf_{p}\int_{X}F\,d\mu^{n_{i_{p}}}\le\ell+2\varepsilon, whence XFdμ+2ε\int_{X}F\,d\mu\le\ell+2\varepsilon. Combining with ()(\ddagger) of Step 6, which applies because μ(A)=1\mu(A)=1, we obtain Jσ+2εJ^{*}_{\sigma}\le\ell+2\varepsilon.

This holds for every real ε>0\varepsilon>0, so device (G), applied with a=Jσa=J^{*}_{\sigma} and b=b=\ell, gives JσJ^{*}_{\sigma}\le\ell. This is claim 3.

Step 8. Proof of claim 4.

Assume now that (JN[hN])NN(J^{N}[h^{N}])_{N\in\mathbb{N}} converges to JσJ^{*}_{\sigma}, let (Nj)jN(N_{j})_{j\in\mathbb{N}} be a strictly increasing sequence of natural numbers, and let μ\mu be a Borel measure on (X,dX)(X,d_{X}) with μ(X)=1\mu(X)=1 such that (μNj)jN(\mu^{N_{j}})_{j\in\mathbb{N}} converges weakly to μ\mu. By claim 2 we have μ(A)=1\mu(A)=1.

(a) The integral of FF against μ\mu is at most JσJ^{*}_{\sigma}. Let ε>0\varepsilon>0 be real and let N0N_{0} be as in Step 5. Since (JN[hN])NN(J^{N}[h^{N}])_{N\in\mathbb{N}} converges to JσJ^{*}_{\sigma}, there is a natural number N1N_{1} with JN[hN]<Jσ+εJ^{N}[h^{N}]<J^{*}_{\sigma}+\varepsilon for every NN1N\ge N_{1}. Hence, by ()(\dagger), for every NN at least N0N_{0} and at least N1N_{1} we have XFdμN<Jσ+2ε\int_{X}F\,d\mu^{N}<J^{*}_{\sigma}+2\varepsilon. By device (F), jNjj\le N_{j}, so the same bound holds for XFdμNj\int_{X}F\,d\mu^{N_{j}} for all sufficiently large jj. Claim 2 of the portmanteau theorem, applicable because FF is bounded and lower semicontinuous, together with device (E), gives

XFdμlim infjXFdμNjJσ+2ε.\int_{X}F\,d\mu\le\liminf_{j}\int_{X}F\,d\mu^{N_{j}}\le J^{*}_{\sigma}+2\varepsilon .

As this holds for every real ε>0\varepsilon>0, device (G), applied with a=XFdμa=\int_{X}F\,d\mu and b=Jσb=J^{*}_{\sigma}, yields XFdμJσ\int_{X}F\,d\mu\le J^{*}_{\sigma}.

(b) The exceptional sets are null. Fix a natural number kk and put

Ek=A{xX  :  Jσ+1/kF(x)}.E_{k}=A\cap\bigl\{x\in X\;:\;J^{*}_{\sigma}+1/k\le F(x)\bigr\}.

The set [Jσ+1/k,)[J^{*}_{\sigma}+1/k,\infty) is a closed subset of the real line and hence lies in its Borel σ\sigma-algebra by claims 4 and 5 of the lemma on Borel measurability in Euclidean space; since FF is measurable by claim 1, its preimage under FF lies in B(X)\mathcal{B}(X). As AB(X)A\in\mathcal{B}(X) by Step 2 and a σ\sigma-algebra is closed under finite intersections, EkB(X)E_{k}\in\mathcal{B}(X).

Let 1Ek\mathbf{1}_{E_{k}} be the indicator function of EkE_{k}, which is measurable by the lemma identifying the integral of an indicator function with the measure of the set, and define u:XRu:X\to\mathbb{R} by u(x)=Jσ+(1/k)1Ek(x)u(x)=J^{*}_{\sigma}+(1/k)\mathbf{1}_{E_{k}}(x). The map sending a real ss to Jσ+(1/k)sJ^{*}_{\sigma}+(1/k)s is continuous, so uu is measurable by the lemma on compositions of a continuous map with a measurable map, and u(x)Jσ+1/k|u(x)|\le|J^{*}_{\sigma}|+1/k for every xx.

We have u(x)F(x)u(x)\le F(x) for every xAx\in A: if xEkx\in E_{k} this is the defining inequality of EkE_{k}, and if xAEkx\in A\setminus E_{k} then u(x)=JσF(x)u(x)=J^{*}_{\sigma}\le F(x) by ()(\ast). Since μ(A)=1\mu(A)=1 and both uu and FF are bounded everywhere, claim 1 of the lemma on almost sure inequalities between bounded random variables, applied on the probability space (X,B(X),μ)(X,\mathcal{B}(X),\mu) with the event AA, gives XudμXFdμ\int_{X}u\,d\mu\le\int_{X}F\,d\mu, hence XudμJσ\int_{X}u\,d\mu\le J^{*}_{\sigma} by part (a).

On the other hand 1Ek\mathbf{1}_{E_{k}} is nonnegative, bounded by 11 and measurable, so it is integrable with respect to μ\mu 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)\mu(E_{k}) 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).\int_{X}u\,d\mu=J^{*}_{\sigma}\mu(X)+(1/k)\mu(E_{k})=J^{*}_{\sigma}+(1/k)\mu(E_{k}).

Combining the two displays gives (1/k)μ(Ek)0(1/k)\mu(E_{k})\le0. Now μ(Ek)0\mu(E_{k})\ge0, since μ\mu takes values in [0,][0,\infty] and is finite. If μ(Ek)>0\mu(E_{k})>0, then, 1/k1/k being positive, claim 5 of Elementary Order Arithmetic in an Ordered Field would give (1/k)μ(Ek)>0(1/k)\mu(E_{k})>0, contradicting the previous inequality. Hence μ(Ek)=0\mu(E_{k})=0.

(c) Identification of the remaining set. We show that

AkNEk={σ}×Mσ.A\setminus\bigcup_{k\in\mathbb{N}}E_{k}=\{\sigma\}\times\mathcal{M}^{*}_{\sigma}.

Let x=(σ,ξ)x=(\sigma,\xi) with ξUA\xi\in\mathcal{U}_{\mathcal{A}}, so that xAx\in A. Then xx lies outside every EkE_{k} precisely when F(σ,ξ)<Jσ+1/kF(\sigma,\xi)<J^{*}_{\sigma}+1/k for every natural number kk. If Jσ<F(σ,ξ)J^{*}_{\sigma}<F(\sigma,\xi), then by claim 3 of The Archimedean Property of the Real Numbers there is a natural number kk with 1/k<F(σ,ξ)Jσ1/k<F(\sigma,\xi)-J^{*}_{\sigma}, that is, Jσ+1/k<F(σ,ξ)J^{*}_{\sigma}+1/k<F(\sigma,\xi), so xEkx\in E_{k}. Conversely, if F(σ,ξ)JσF(\sigma,\xi)\le J^{*}_{\sigma} then F(σ,ξ)<Jσ+1/kF(\sigma,\xi)<J^{*}_{\sigma}+1/k for every kk. Hence xx lies outside every EkE_{k} precisely when F(σ,ξ)JσF(\sigma,\xi)\le J^{*}_{\sigma}, which by ()(\ast) holds precisely when F(σ,ξ)=JσF(\sigma,\xi)=J^{*}_{\sigma}, that is, precisely when ξMσ\xi\in\mathcal{M}^{*}_{\sigma}. This proves the displayed identity, and it exhibits {σ}×Mσ\{\sigma\}\times\mathcal{M}^{*}_{\sigma} as the difference of AB(X)A\in\mathcal{B}(X) and a countable union of members of B(X)\mathcal{B}(X), so {σ}×MσB(X)\{\sigma\}\times\mathcal{M}^{*}_{\sigma}\in\mathcal{B}(X).

Finally, by countable subadditivity, claim 4 of the basic properties of a measure, and by part (b),

μ(kNEk)kNμ(Ek)=0.\mu\Bigl(\bigcup_{k\in\mathbb{N}}E_{k}\Bigr)\le\sum_{k\in\mathbb{N}}\mu(E_{k})=0 .

Since every EkE_{k} is contained in AA and μ\mu is finite, claim 3 of that lemma gives

μ({σ}×Mσ)=μ(A)μ(kNEk)=10=1.\mu\bigl(\{\sigma\}\times\mathcal{M}^{*}_{\sigma}\bigr)=\mu(A)-\mu\Bigl(\bigcup_{k\in\mathbb{N}}E_{k}\Bigr)=1-0=1 .

This proves claim 4, and with it the theorem.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…