Adopt the setting, hypotheses and notation of the definition of the optimal value, controls and trajectories of the mean-field problem — in particular: the affine-controlled transition-rate family (β0,β1) on l states with control set A⊆Rm, its transition-rate family β with rate bound B, aggregate state drift b and projected drift b^, the horizon T>0, the population cost data (L,G) with L convex in the control on A, the probability simplex Δl, the set UA of A-valued controls, the mean-field flow S(z0,ξ) of claim 2 of the flow stability lemma (the two-argument flow map, distinguished throughout from the trajectory S of the stationary triple below by the presence of its arguments), the mean-field cost F, and, for x∈Δl, the optimal value Jx∗, the set Mx∗ of optimal controls, and the value set written Vx in that definition, renamed Vx here because the letter V denotes the open control neighbourhood of the rate extension below. Write ∣⋅∣ for the Euclidean norm and ∫[a,b]⋅dt for the Lebesgue integral over a compact interval, taken to be 0 when a=b. All of the objects above are determined by the data (β0,β1) and (L,G) together with the horizon, and the hypotheses just listed do not involve the horizon; for a real number θ>0 we superscript by [θ] the corresponding objects of the instance with horizon θ and the same data — UA[θ], the flow S[θ](z0,ξ), the cost F[θ], the value set Vx[θ], the optimal value Jx∗[θ] and the optimal control set Mx∗[θ] — so that the unsuperscripted objects are those of the instance with horizon T. (The horizon-dependent auxiliary choices of the attainment theorem — a dense sequence in L2([0,θ];Rm) and the associated metric on UA[θ] — exist for every horizon by the provisions recorded there, and none of the objects just named depends on them.)
Let further (U,V,βˉ) be a twice continuously differentiable extension of β with derivative bound K and extended aggregate state drift bˉ, let (Uc,Lˉ,Gˉ) be a twice continuously differentiable extension of (L,G) with second-derivative bound Kc (its open set, written W in that definition, is written Uc here), and let (S,A,P) be a stationary mean-field triple for β, (L,G) and these extensions, with horizon T; in particular (S,A) is a mean-field trajectory pair and P a stationary co-state. Adopt the mean-field Hamiltonian along the triple, Ht(a)=Lˉ(St,a)−∑δ=1lPtδbˉδ(St,a) for t∈[0,T] and a∈V, of the quadratic growth lemma, and the fluctuation Hessian coefficients Hij(t) (i,j∈{1,…,l+m}) of these data.
Fix t0∈[0,T), put T♯=T−t0∈(0,T], and define S♯:[0,T♯]→Δl, A♯:[0,T♯]→A and P♯:[0,T♯]→Rl by
St♯=St0+t,At♯=At0+t,Pt♯=Pt0+t.
The shifted data are the same β, (L,G) and extensions with the horizon T♯ in place of T.
Then the following hold.
1. (The restriction is a stationary triple.) (S♯,A♯) is a mean-field trajectory pair for β with horizon T♯, and P♯ is a stationary co-state for the shifted data, so that (S♯,A♯,P♯) is a stationary mean-field triple for the shifted data. Every real CP with ∑δ=1l∣Ptδ∣≤CP for all t∈[0,T] satisfies ∑δ=1l∣Pt♯δ∣≤CP for all t∈[0,T♯]. Moreover, writing H♯ for the mean-field Hamiltonian along the shifted triple and Hij♯ for the fluctuation Hessian coefficients of the shifted data, for every t∈[0,T♯]:
Ht♯(a)=Ht0+t(a)for every a∈V,Hij♯(t)=Hij(t0+t)for all i,j∈{1,…,l+m}.
2. (Hypothesis transport.) If hypothesis (H1) of the quadratic growth lemma holds for the original data with a constant r>0, then it holds for the shifted data with the same r. If hypothesis (U) of that lemma holds for the original triple, then it holds for the shifted triple. And every real r0>0 with Ht(a)−Ht(At)≥r0∣a−At∣2 for all t∈[0,T] and a∈A satisfies Ht♯(a)−Ht♯(At♯)≥r0∣a−At♯∣2 for all t∈[0,T♯] and a∈A.
3. (Flow identification and cost splitting.) The map A is an admissible representative (in the sense of claim 2 of the flow stability lemma) of its class [A]∈UA, and likewise A♯ of [A♯]∈UA[T♯]; moreover S=S(S0,[A]) and S♯=S[T♯](St0,[A♯]). The costs satisfy
F(S0,[A])=JMF[(S),(A)],F[T♯](St0,[A♯])=JMF[(S♯),(A♯)]=∫[t0,T]L(St,At)dt+G(ST),
where JMF denotes the mean-field cost of a mean-field trajectory pair, and
F(S0,[A])=∫[0,t0]L(St,At)dt+F[T♯](St0,[A♯]).
4. (Concatenation.) Let η∈UA[T♯] and let v be an admissible representative of η. Define ζ:[0,T]→A by ζs=As for s∈[0,t0) and ζs=vs−t0 for s∈[t0,T]. Then ζ is an admissible representative of its class [ζ]∈UA; if v′ is another admissible representative of η and ζ′ the corresponding concatenation, then [ζ′]=[ζ]; and
F(S0,[ζ])=∫[0,t0]L(St,At)dt+F[T♯](St0,η).
5. (Dynamic programming principle.) Assume [A]∈MS0∗. Then [A♯]∈MSt0∗[T♯] and
JSt0∗[T♯]=∫[t0,T]L(St,At)dt+G(ST)=JS0∗−∫[0,t0]L(St,At)dt.