Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Probability

1,628 missions · 701 completed

Missions

Open927Completed701All1628
Operations ResearchPartial Differential EquationsStochastic Systems·Captain: mikedeng1

Global C¹ Regularity of the Value Function in Optimal Stopping Problems 1: Probabilistic Regularity of the Boundary Makes the Value Function Continuously DifferentiableResearch Paper

Why boundary regularity matters

An optimal stopping rule chooses when to end a stochastic process in order to collect a terminal reward, possibly after earning or paying a running reward. The resulting value function often solves a free-boundary problem: the state space splits into a region where stopping is optimal and one where continuing is better. Smoothness inside either region does not by itself say what happens where the regions meet. This mission concerns the global first spatial derivative of that value function at the optimal stopping boundary.

De Angelis and Peskir proved that a probabilistic condition on the boundary, together with regularity of the process as a spatial flow and explicit integrability bounds, gives continuous differentiability of the value function across the boundary. Their result applies to standard Markov processes with right-continuous paths and left limits, including jump processes; it is not restricted to diffusions or to a constant discount rate. The source is De Angelis and Peskir, arXiv:1812.04564v2, Theorem 8.

The stopping problem and its boundary

Let d≥1d\ge1d≥1, let E=RdE=\mathbb R^dE=Rd, and let XtxX_t^xXtx​ be a stochastic flow: the same probability space carries a path starting from every state x∈Ex\in Ex∈E. Time is nonnegative. One right-continuous filtration makes every path adapted and is used for every stopping rule. The process is strong Markov, has right-continuous paths with left limits, is left continuous over stopping times, and starts from X0x=xX_0^x=xX0x​=x. Expectations and probabilities written ExE_xEx​ and PxP_xPx​ in the paper are the expectation and probability of the flow XxX^xXx under one measure PPP.

The continuous data are a nonnegative discount rate λ:E→[0,∞)\lambda:E\to[0,\infty)λ:E→[0,∞), a terminal reward G:E→RG:E\to\mathbb RG:E→R, and a running reward H:E→RH:E\to\mathbb RH:E→R. The discount accumulated along the path from xxx is Λtx=∫0tλ(Xsx) ds\Lambda_t^x=\int_0^t\lambda(X_s^x)\,dsΛtx​=∫0t​λ(Xsx​)ds. For every finite-valued stopping time τ\tauτ of the common filtration, define

J(x,τ)=E ⁣[e−ΛτxG(Xτx)+∫0τe−ΛtxH(Xtx) dt],V(x)=sup⁡τJ(x,τ).J(x,\tau)=E\!\left[e^{-\Lambda_\tau^x}G(X_\tau^x)+\int_0^\tau e^{-\Lambda_t^x}H(X_t^x)\,dt\right], \qquad V(x)=\sup_\tau J(x,\tau).J(x,τ)=E[e−Λτx​G(Xτx​)+∫0τ​e−Λtx​H(Xtx​)dt],V(x)=τsup​J(x,τ).

This is the infinite-horizon problem (2.1). It is well posed here when all admissible payoffs are integrable and the first entry time into the stopping set is an almost surely finite optimal stopping time. These conditions ensure that VVV is a real, attained supremum rather than a default value of Lean's real supremum or integral. Define the stopping set D={x:V(x)=G(x)}D=\{x:V(x)=G(x)\}D={x:V(x)=G(x)}, the continuation set C={x:V(x)>G(x)}C=\{x:V(x)>G(x)\}C={x:V(x)>G(x)}, and the boundary relevant to the theorem as D∩C‾D\cap\overline CD∩C. For a state set AAA, the first entry time is τAx=inf⁡{t≥0:Xtx∈A}\tau_A^x=\inf\{t\ge0:X_t^x\in A\}τAx​=inf{t≥0:Xtx​∈A} and the first strictly positive hitting time is σAx=inf⁡{t>0:Xtx∈A}\sigma_A^x=\inf\{t>0:X_t^x\in A\}σAx​=inf{t>0:Xtx​∈A}. Both may be infinite.

A boundary point zzz is probabilistically regular for AAA if Pz(σA=0)=1P_z(\sigma_A=0)=1Pz​(σA​=0)=1. It is Green regular for AAA when Px(τA≥ε)→0P_x(\tau_A\ge\varepsilon)\to0Px​(τA​≥ε)→0 as x→zx\to zx→z through CCC, for every ε>0\varepsilon>0ε>0. The paper obtains Green regularity by either strong Feller continuity with probabilistic regularity for DDD, or spatial continuity of the flow with probabilistic regularity for D∘D^\circD∘. Lemma 1 and Corollaries 2–3 give the first route; Lemma 4 and Corollaries 5–6 give the second. All six statements use an arbitrary closed DDD, as in Section 3 of the source. Source: §§2–3, pp. 3–11.

Formalization targets

The milestone results first establish the two boundary regularity routes. In particular, approaching zzz through CCC, the first route gives τDxn→0\tau_D^{x_n}\to0τDxn​​→0 in probability; the second gives τD∘xn→0\tau_{D^\circ}^{x_n}\to0τD∘xn​​→0 and τDxn→0\tau_D^{x_n}\to0τDxn​​→0 almost surely. Equations (4.16) and (4.19) then bound, respectively, the lower and upper limits of each coordinate derivative ∂iV(xn)\partial_iV(x_n)∂i​V(xn​) by ∂iG(z)\partial_iG(z)∂i​G(z). The pointwise part of Theorem 8 concludes

DV(z)=DG(z),lim⁡C∋x→zDV(x)=DG(z).D V(z)=D G(z),\qquad \lim_{C\ni x\to z}D V(x)=D G(z).DV(z)=DG(z),C∋x→zlim​DV(x)=DG(z).

The mission goal is the final sentence of Theorem 8. If the theorem's local hypotheses hold at every z∈D∩C‾z\in D\cap\overline Cz∈D∩C, then

V∈C1(Rd).V\in C^1(\mathbb R^d).V∈C1(Rd).

The hypotheses include the discounted generator representation (2.14) from the problem setup, continuity and interior C1C^1C1 regularity of VVV, global C1C^1C1 regularity of GGG, one positive Lipschitz constant for both HHH and λ\lambdaλ, a C1C^1C1 spatial flow, the four local bounds (4.4)–(4.7) with one radius at each boundary point, and one of the two probabilistic regularity alternatives. The goal retains all dimensions d≥1d\ge1d≥1, all nonnegative continuous discount rates, and the source's full class of standard Markov flows. Source: §2.5 and Theorem 8, pp. 7, 11–12.

What the result gives

The conclusion identifies the derivative of the value function on both sides of the stopping boundary. It strengthens a derivative match along a single direction or a chosen sequence into continuous differentiability on the whole state space. This is relevant to free-boundary formulations of optimal stopping, where interior regularity can be available from a Dirichlet or Poisson problem while boundary regularity remains the missing step. The authors describe that distinction in their discussion of smooth fit and global differentiability. Source: §2.5, p. 8.

The mathematical theorem is proved in the 2020 paper. In this mission, the definitions and statements compile as Lean declarations, while the theorem proofs remain to be formalized. A complete development would supply reusable arguments about hitting times, semicontinuity of hitting probabilities, stochastic flows, and limits of derivatives near a stopping boundary. Those components would also support the paper's finite-horizon spatial and temporal results.

The central difficulty

The value is a supremum over stopping rules. Differentiating the reward for a fixed stopping time does not automatically differentiate that supremum, because the optimal time depends on the initial state. Near the boundary, even continuity of the value does not control the duration of the optimal rule from neighboring states. The paper's probabilistic regularity conditions address that duration, while (4.4)–(4.7) provide the integrability needed to pass to derivative limits. A direct appeal to interior differentiability leaves the boundary itself untreated. Source: §§3–4.1, pp. 9–15.

Formalization scope

The state space is EuclideanSpace ℝ (Fin d) with d≥1d\ge1d≥1; Fin d indices are the paper's coordinates 1,…,d1,\ldots,d1,…,d shifted by one. Balls are open Euclidean balls. Time is R≥0\mathbb R_{\ge0}R≥0​, and the entry and hitting times live in R≥0∪{+∞}\mathbb R_{\ge0}\cup\{+\infty\}R≥0​∪{+∞} so an unattained hit has its intended value. The flow is the process; no separate family of measures PxP_xPx​ is introduced. One common filtration is used for all initial states and is right-continuous. Its finite stopping times are the full admissible class, not only hitting times.

The value uses Bochner expectations and real Lebesgue time integrals. Well-posedness records integrability for every admissible payoff and optimality and almost sure finiteness of τDx\tau_D^xτDx​. The generator clause acts on smooth functions in the domain of the discounted transition semigroup; it retains the paper's diffusion, drift, killing, and jump terms. The boundary is D∩C‾D\cap\overline CD∩C, and approach through continuation points is expressed by the within-set neighborhood filter. Pointwise continuous differentiability means a Fréchet derivative at zzz equal to DG(z)D G(z)DG(z) and convergence of DVD VDV along CCC; the goal uses global ContDiff. The local bounds retain all independently indexed starting states and coordinates. Their uncountable suprema are represented by integrable common majorants, with timewise measurable envelopes for the suprema inside time integrals. This convention excludes default integral values from nonmeasurable or nonintegrable expressions.

A formalization restricted to Brownian motion, one dimension, zero or constant discount, continuous paths, bounded rewards, or only one boundary regularity branch would state a different theorem. Contributions toward measurable hitting-time events, the two Section 3 regularity chains, the envelope bounds, and the derivative comparison are welcome.

Selected references

  • De Angelis, T., and Peskir, G., Global C¹ Regularity of the Value Function in Optimal Stopping Problems, Annals of Applied Probability 30(3), 2020. arXiv:1812.04564v2; DOI:10.1214/19-AAP1517.
15 thms1 active userReviewed
Functional AnalysisOptimal TransportStatistics·Captain: mikedeng1

Computational Optimal Transport XI: For p = 1, 2 the p-Wasserstein Distance on ℝ^d with d ≥ 2 Is Not HilbertianTextbook

Why ask whether a Wasserstein distance is Hilbertian

Kernel methods, multidimensional scaling and low-distortion embeddings all work best on data whose distance comes from a Hilbert space. A distance ddd on a set Z\mathcal ZZ is Hilbertian when Z\mathcal ZZ can be mapped into a Hilbert space so that ddd becomes the norm distance; for such a ddd, the kernel e−dp/te^{-d^p/t}e−dp/t is positive definite for 0≤p≤20\le p\le 20≤p≤2 and t>0t>0t>0 (Berg, Christensen and Ressel, 1984), and the classical Euclidean toolbox applies. Optimal transport distances are popular for comparing probability measures, so it is natural to ask whether they are Hilbertian. In dimension one the answer is yes for W2\mathcal W_2W2​: the map sending a measure to its quantile function is an isometry into L2([0,1])L^2([0,1])L2([0,1]), and between univariate Gaussians W2\mathcal W_2W2​ is the Euclidean distance between (mean, standard deviation). Peyré and Cuturi, Computational Optimal Transport (FnT ML 2019), §8.3, show that this does not extend to the plane: for p=1,2p=1,2p=1,2 and d≥2d\ge2d≥2 the ppp-Wasserstein distance on Rd\mathbb R^dRd is not Hilbertian (Proposition 8.2, p. 507).

The tool is a classical characterization. Schoenberg (1938) proved that a distance is Hilbertian exactly when its square is conditionally negative definite; Berg, Christensen and Ressel (1984, Prop. 3.2) give the modern form. The easy direction turns non-embeddability into a finite check, and the book's proof of Proposition 8.2 performs that check numerically on 35 measures supported on the four corners of the unit square (Figure 8.6, p. 508). Stronger, quantitative statements are known: planar W1\mathcal W_1W1​ does not even embed into L1L^1L1 with bounded distortion (Naor and Schechtman, 2007), and Andoni, Naor and Neiman (2018) study which powers of Wasserstein distances embed.

Setting

Let Z\mathcal ZZ be a set. A function φ:Z×Z→R\varphi:\mathcal Z\times\mathcal Z\to\mathbb Rφ:Z×Z→R is negative definite (Definition 8.3, p. 501, in the conditional form used in §8.3) if it is symmetric and, for every n≥0n\ge0n≥0, every x1,…,xn∈Zx_1,\dots,x_n\in\mathcal Zx1​,…,xn​∈Z and every r∈Rnr\in\mathbb R^nr∈Rn with ∑iri=0\sum_ir_i=0∑i​ri​=0,

∑i,j=1nrirj φ(xi,xj)≤0.\sum_{i,j=1}^n r_ir_j\,\varphi(x_i,x_j)\le0 .i,j=1∑n​ri​rj​φ(xi​,xj​)≤0.

A function d:Z×Z→Rd:\mathcal Z\times\mathcal Z\to\mathbb Rd:Z×Z→R is Hilbertian (Definition 8.4, p. 506) if there are a real Hilbert space H\mathcal HH and a map ϕ:Z→H\phi:\mathcal Z\to\mathcal Hϕ:Z→H with d(z,z′)=∥ϕ(z)−ϕ(z′)∥Hd(z,z')=\|\phi(z)-\phi(z')\|_{\mathcal H}d(z,z′)=∥ϕ(z)−ϕ(z′)∥H​ for all z,z′z,z'z,z′.

On Rd\mathbb R^dRd with the Euclidean norm ∥⋅∥2\|\cdot\|_2∥⋅∥2​, let Pp(Rd)\mathcal P_p(\mathbb R^d)Pp​(Rd) be the Borel probability measures μ\muμ with ∫∥x∥2p dμ<∞\int\|x\|_2^p\,d\mu<\infty∫∥x∥2p​dμ<∞. A coupling of μ\muμ and ν\nuν is a measure π\piπ on Rd×Rd\mathbb R^d\times\mathbb R^dRd×Rd whose two marginals are μ\muμ and ν\nuν, and the ppp-Wasserstein distance (2.18) is

Wp(μ,ν)=(inf⁡π∫∥x−y∥2p dπ(x,y))1/p,\mathcal W_p(\mu,\nu)=\Big(\inf_{\pi}\int\|x-y\|_2^p\,d\pi(x,y)\Big)^{1/p},Wp​(μ,ν)=(πinf​∫∥x−y∥2p​dπ(x,y))1/p,

finite on Pp(Rd)\mathcal P_p(\mathbb R^d)Pp​(Rd). For points x1,…,xnx_1,\dots,x_nx1​,…,xn​ and a histogram a∈Σna\in\Sigma_na∈Σn​ (nonnegative, summing to one) the discrete measure is ∑iaiδxi\sum_ia_i\delta_{x_i}∑i​ai​δxi​​; for two histograms a,ba,ba,b, U(a,b)U(a,b)U(a,b) is the set of nonnegative matrices with row sums aaa and column sums bbb, and LC(a,b)=min⁡P∈U(a,b)∑i,jCi,jPi,jL_C(a,b)=\min_{P\in U(a,b)}\sum_{i,j}C_{i,j}P_{i,j}LC​(a,b)=minP∈U(a,b)​∑i,j​Ci,j​Pi,j​ (2.11).

The configuration of the book's proof consists of the corners x1=[0,0]x^1=[0,0]x1=[0,0], x2=[1,0]x^2=[1,0]x2=[1,0], x3=[0,1]x^3=[0,1]x3=[0,1], x4=[1,1]x^4=[1,1]x4=[1,1] of the unit square, the 35 histograms of Σ4\Sigma_4Σ4​ with entries in {0,14,12,34,1}\{0,\tfrac14,\tfrac12,\tfrac34,1\}{0,41​,21​,43​,1}, and the centering matrix J=In−1n1n,nJ=I_n-\tfrac1n\mathbb 1_{n,n}J=In​−n1​1n,n​.

Formalization targets

Goal: Proposition 8.2

For d≥2d\ge2d≥2 and p∈{1,2}p\in\{1,2\}p∈{1,2},

Wp on Pp(Rd) is not Hilbertian.\mathcal W_p \text{ on } \mathcal P_p(\mathbb R^d) \text{ is not Hilbertian.}Wp​ on Pp​(Rd) is not Hilbertian.

Milestones

  1. Proposition 8.1, proved direction (pp. 506–507): if ddd is Hilbertian then d2d^2d2 is negative definite.
  2. Squared distance (p. 507): Wp2\mathcal W_p^2Wp2​ on Pp(Rd)\mathcal P_p(\mathbb R^d)Pp​(Rd) is not negative definite, d≥2d\ge2d≥2, p=1,2p=1,2p=1,2.
  3. Reduction to the plane (proof of Prop. 8.2): if Wp2\mathcal W_p^2Wp2​ on Pp(Rd)\mathcal P_p(\mathbb R^d)Pp​(Rd), d≥2d\ge2d≥2, were negative definite, so would be Wp2\mathcal W_p^2Wp2​ on Pp(R2)\mathcal P_p(\mathbb R^2)Pp​(R2).
  4. Discrete measures (Remark 2.13, p. 375): Wp(∑iaiδxi,∑jbjδxj)p=LC(a,b)\mathcal W_p\big(\sum_ia_i\delta_{x_i},\sum_jb_j\delta_{x_j}\big)^p=L_C(a,b)Wp​(∑i​ai​δxi​​,∑j​bj​δxj​​)p=LC​(a,b) with Ci,j=∥xi−xj∥2pC_{i,j}=\|x_i-x_j\|_2^pCi,j​=∥xi​−xj​∥2p​.
  5. Centering criterion (proof of Prop. 8.2): a matrix MMM admits a zero-sum rrr with r⊤Mr>0r^\top Mr>0r⊤Mr>0 if and only if JMJJMJJMJ has a positive eigenvalue.
  6. The grid counterexample (proof of Prop. 8.2, Figure 8.6): for p=1,2p=1,2p=1,2 there are grid histograms a1,…,ana^1,\dots,a^na1,…,an and a zero-sum rrr with
∑i,jrirj Wp2(∑kakiδxk,∑kakjδxk)>0.\sum_{i,j}r_ir_j\,\mathcal W_p^2\Big(\sum_k a^i_k\delta_{x^k},\sum_k a^j_k\delta_{x^k}\Big)>0.i,j∑​ri​rj​Wp2​(k∑​aki​δxk​,k∑​akj​δxk​)>0.

Significance

A Hilbertian distance gives positive definite Gaussian and Laplace kernels, Euclidean multidimensional scaling and Johnson–Lindenstrauss dimension reduction for free. Proposition 8.2 says none of these can be obtained for W1\mathcal W_1W1​ or W2\mathcal W_2W2​ on Rd\mathbb R^dRd, d≥2d\ge2d≥2, by an isometric embedding; this is why the literature turned to approximate embeddings, sliced distances and entropic surrogates (pp. 507–508). The negative-definiteness test of milestone 1 is a reusable certificate for non-embeddability of any finite metric.

The result is known, and the book's proof is a floating-point eigenvalue computation. The formal content of this mission is a machine-checked proof with an exact certificate: rational or algebraic Wasserstein distances between explicit discrete measures and an explicit zero-sum vector. As far as this mission is aware, no formal proof of the statement exists in Mathlib or on the platform. Schoenberg's converse is cited by the book and is not part of the mission.

Difficulty

The abstract part is short: expanding ∥ϕ(zi)−ϕ(zj)∥2\|\phi(z_i)-\phi(z_j)\|^2∥ϕ(zi​)−ϕ(zj​)∥2 and using ∑iri=0\sum_ir_i=0∑i​ri​=0 gives milestone 1. The obstacle is the certificate. The book observes that JDp2JJ\mathbf D_p^2JJDp2​J has a positive top eigenvalue (about 1.21.21.2 for p=1p=1p=1 and 0.70.70.7 for p=2p=2p=2), but a proof needs exact transport costs between the chosen measures, each the value of a small linear program whose optimality has to be established (for instance by a dual certificate), together with a vector rrr for which the quadratic form is provably positive. For p=1p=1p=1 the costs involve 2\sqrt22​, the diagonal of the square. A second, separate difficulty is connecting the measure-theoretic Wp\mathcal W_pWp​ to the discrete program (milestone 4) and transporting a counterexample from R2\mathbb R^2R2 into Rd\mathbb R^dRd (milestone 3), both of which require working with couplings as measures on a product space.

Formalization scope

  • Rd\mathbb R^dRd is EuclideanSpace ℝ (Fin d); Wp\mathcal W_pWp​ is the published definition WassersteinDRO.Duality.wassersteinDistance (an [0,∞][0,\infty][0,∞]-valued infimum over all measures with the two marginals, raised to 1/p1/p1/p), converted to a real number. The distance is considered on Pp(Rd)\mathcal P_p(\mathbb R^d)Pp​(Rd), the set where it is finite; outside it the real conversion is a junk 000. The book names no domain; since the counterexample consists of finitely supported measures, the finite computation gives non-Hilbertianity on Pp\mathcal P_pPp​ and on every smaller set containing those measures.
  • Negative definiteness is conditional. Definition 8.3 as printed quantifies over all rrr; under that reading no nonzero squared distance is negative definite, so Proposition 8.1 would be false and "not negative definite" trivially true. The zero-sum condition, used by the book in the proof of Proposition 8.1, is part of the definition; this rules out the trivial formalization.
  • Hilbert spaces are real, complete inner-product spaces in the universe of Z\mathcal ZZ. Indices are 0-based (Fin n). Histograms are real vectors; the reduction milestone is stated for every p≥1p\ge1p≥1.
  • Discrete transport objects (U(a,b)U(a,b)U(a,b), LCL_CLC​) are redefined in this mission's namespace CompOT.NotHilbertian, duplicating chunk II of the series.

Contributions welcome: the forward direction of Schoenberg's characterization, the discrete-measure bridge (reusable wherever discrete optimal transport meets measure-theoretic couplings), the isometric-embedding invariance of Wp\mathcal W_pWp​, and exact certificates for the grid computation.

Selected references

  • G. Peyré and M. Cuturi, Computational Optimal Transport, Foundations and Trends in Machine Learning 11(5–6):355–607, 2019. https://doi.org/10.1561/2200000073
  • I. J. Schoenberg, Metric spaces and positive definite functions, Transactions of the AMS 44(3):522–536, 1938. https://doi.org/10.1090/S0002-9947-1938-1501980-0
  • C. Berg, J. P. R. Christensen and P. Ressel, Harmonic Analysis on Semigroups, Graduate Texts in Mathematics 100, Springer, 1984. https://doi.org/10.1007/978-1-4612-1128-0
  • A. Naor and G. Schechtman, Planar earthmover is not in L1L_1L1​, SIAM Journal on Computing 37(3):804–826, 2007. https://doi.org/10.1137/05064206X
  • A. Andoni, A. Naor and O. Neiman, Snowflake universality of Wasserstein spaces, Annales scientifiques de l'École normale supérieure 51(3):657–700, 2018. https://arxiv.org/abs/1509.08677
10 thms1 active userReviewed
Control TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

A Mean Field Game of Optimal Portfolio Liquidation 2: The Value Functions of the Penalized Mean Field Games Converge in L¹ to the Value Function of the Liquidation-Constrained GameResearch Paper

Motivation

Optimal portfolio liquidation asks how a trader should unwind a position of X\mathcal XX shares over a horizon [0,T][0,T][0,T] when trading moves prices. Since Almgren and Chriss (2001) the standard model charges a quadratic cost ηtξt2\eta_t\xi_t^2ηt​ξt2​ for trading at rate ξt\xi_tξt​ (temporary impact) and a risk penalty λtXt2\lambda_tX_t^2λt​Xt2​ on the open position, and imposes the liquidation constraint XT=0X_T=0XT​=0. When many traders liquidate at once, each one's costs also depend on the others' aggregate trading rate μt\mu_tμt​ through a permanent impact term κtμtXt\kappa_t\mu_tX_tκt​μt​Xt​. Fu, Graewe, Horst and Popier (arXiv:1804.04911) model this as a mean field game (MFG) with common noise and prove that, under a weak-interaction condition, the game has a unique equilibrium.

The liquidation constraint makes the problem singular: the value function blows up at TTT, and the equilibrium is described by a forward-backward system whose decoupling field AAA satisfies a Riccati BSDE with terminal value AT=+∞A_T=+\inftyAT​=+∞. A natural question is whether the constraint can be replaced by a finite penalty nXT2nX_T^2nXT2​ on the unliquidated position, a non-singular problem of the type studied in the MFG literature, and whether the penalized equilibria approach the constrained one as n→∞n\to\inftyn→∞. Section 4 of the paper answers this at the level of values. In the single-agent case, singular terminal conditions of this type were studied by Ankirchner, Jeanblanc and Kruse (SIAM J. Control Optim., 2014) and Graewe, Horst and Séré (Stochastic Process. Appl., 2018), references [3] and [28] of the paper.

Setting

Fix T>0T>0T>0, an mmm-dimensional Brownian motion W~=(W0,W)\widetilde W=(W^0,W)W=(W0,W) whose first coordinate W0W^0W0 is common noise, and an initial position X∈L2\mathcal X\in L^2X∈L2 independent of W~\widetilde WW. Let F0\mathbb F^0F0 be the filtration of W0W^0W0 and F\mathbb FF that of (X,W~)(\mathcal X,\widetilde W)(X,W), both augmented. The coefficients κ,λ,η\kappa,\lambda,\etaκ,λ,η are bounded, nonnegative, F\mathbb FF-progressive processes, with λ\lambdaλ and η\etaη bounded below by positive constants. Write κmax⁡\kappa_{\max}κmax​, η⋆\eta_\starη⋆​, λ⋆\lambda_\starλ⋆​ for the essential supremum of κ\kappaκ and the essential infima of η\etaη and λ\lambdaλ, ∥η∥\|\eta\|∥η∥ for the essential supremum of ∣η∣|\eta|∣η∣, and α=η⋆/∥η∥∈(0,1]\alpha=\eta_\star/\|\eta\|\in(0,1]α=η⋆​/∥η∥∈(0,1]. Assumption 2.3 adds the weak-interaction condition: some θ>0\theta>0θ>0 satisfies κmax⁡<4η⋆θ\kappa_{\max}<4\eta_\star\thetaκmax​<4η⋆​θ and θκmax⁡<4λ⋆\theta\kappa_{\max}<4\lambda_\starθκmax​<4λ⋆​.

Given an aggregate rate μ\muμ, a trading rate ξ∈LF2\xi\in L^2_{\mathbb F}ξ∈LF2​ yields the position Xtξ=X−∫0tξs dsX^\xi_t=\mathcal X-\int_0^t\xi_s\,dsXtξ​=X−∫0t​ξs​ds. The constrained problem minimizes

J(X,ξ;μ)=E[∫0T(κsμsXsξ+ηsξs2+λs(Xsξ)2)ds ∣ X]J(\mathcal X,\xi;\mu)=\mathbb E\Big[\int_0^T\big(\kappa_s\mu_sX^\xi_s+\eta_s\xi_s^2+\lambda_s(X^\xi_s)^2\big)ds\,\Big|\,\mathcal X\Big]J(X,ξ;μ)=E[∫0T​(κs​μs​Xsξ​+ηs​ξs2​+λs​(Xsξ​)2)ds​X]

over ξ\xiξ with ∫0Tξs ds=X\int_0^T\xi_s\,ds=\mathcal X∫0T​ξs​ds=X; its value is V(X;μ)V(\mathcal X;\mu)V(X;μ). The penalized problem (4.1) drops the constraint and minimizes

Jn(ξ;μ)=E[∫0T(κtμtXtξ+ηtξt2+λt(Xtξ)2)dt+n(XTξ)2 ∣ X]J^n(\xi;\mu)=\mathbb E\Big[\int_0^T\big(\kappa_t\mu_tX^\xi_t+\eta_t\xi_t^2+\lambda_t(X^\xi_t)^2\big)dt+n(X^\xi_T)^2\,\Big|\,\mathcal X\Big]Jn(ξ;μ)=E[∫0T​(κt​μt​Xtξ​+ηt​ξt2​+λt​(Xtξ​)2)dt+n(XTξ​)2​X]

over all ξ∈LF2\xi\in L^2_{\mathbb F}ξ∈LF2​, with value Vn(X;μ)V^n(\mathcal X;\mu)Vn(X;μ). An equilibrium is a fixed point μt=E[ξt∗∣Ft0]\mu_t=\mathbb E[\xi^*_t|\mathcal F^0_t]μt​=E[ξt∗​∣Ft0​].

The constrained equilibrium is given by the FBSDE (2.3), dXt=−Yt2ηtdtdX_t=-\frac{Y_t}{2\eta_t}dtdXt​=−2ηt​Yt​​dt, −dYt=(κtE[Yt2ηt∣Ft0]+2λtXt)dt−Zt dW~t-dY_t=\big(\kappa_t\mathbb E[\frac{Y_t}{2\eta_t}|\mathcal F^0_t]+2\lambda_tX_t\big)dt-Z_t\,d\widetilde W_t−dYt​=(κt​E[2ηt​Yt​​∣Ft0​]+2λt​Xt​)dt−Zt​dWt​, X0=XX_0=\mathcal XX0​=X, XT=0X_T=0XT​=0, decoupled as Y=AX+BY=AX+BY=AX+B where

−dAt=(2λt−At22ηt)dt−ZtA dW~t,AT=+∞.-dA_t=\Big(2\lambda_t-\frac{A_t^2}{2\eta_t}\Big)dt-Z^A_t\,d\widetilde W_t,\qquad A_T=+\infty .−dAt​=(2λt​−2ηt​At2​​)dt−ZtA​dWt​,AT​=+∞.

The penalized equilibria are given by the FBSDE (4.2) with YTn=2nXTnY^n_T=2nX^n_TYTn​=2nXTn​, decoupled by AnA^nAn, the solution of the same Riccati BSDE with ATn=2nA^n_T=2nATn​=2n. The solutions live in weighted spaces: Hl\mathcal H_lHl​ with norm (Esup⁡t∣Yt/(T−t)l∣2)1/2\big(\mathbb E\sup_t|Y_t/(T-t)^l|^2\big)^{1/2}(Esupt​∣Yt​/(T−t)l∣2)1/2, and the penalized analogue Hln\mathcal H^n_lHln​ with weight (T−t+η⋆/n)−l(T-t+\eta_\star/n)^{-l}(T−t+η⋆​/n)−l. Assumption 4.1 requires a constant CCC with exp⁡(−∫rsAu2ηudu)≤CT−sT−r\exp\big(-\int_r^s\frac{A_u}{2\eta_u}du\big)\le C\frac{T-s}{T-r}exp(−∫rs​2ηu​Au​​du)≤CT−rT−s​ for all 0≤r≤s<T0\le r\le s<T0≤r≤s<T, almost surely.

Formalization targets

Goal: Theorem 4.6

Under Assumptions 2.3 and 4.1, with μ∗=E[Y/(2η)∣F0]\mu^*=\mathbb E[Y/(2\eta)|\mathcal F^0]μ∗=E[Y/(2η)∣F0] the constrained equilibrium and μn=E[Yn/(2η)∣F0]\mu^n=\mathbb E[Y^n/(2\eta)|\mathcal F^0]μn=E[Yn/(2η)∣F0] the penalized ones,

lim⁡n→∞E∣Vn(X;μn)−V(X;μ∗)∣=0.\lim_{n\to\infty}\mathbb E\big|V^n(\mathcal X;\mu^n)-V(\mathcal X;\mu^*)\big|=0 .n→∞lim​E​Vn(X;μn)−V(X;μ∗)​=0.

Milestones

  1. Lemma 4.2 (first condition). If η\etaη is deterministic, Assumption 4.1 holds.
  2. Lemma A.3. AnA^nAn exists uniquely, Atn≥(12n+E[∫tTds2ηs∣Ft])−1A^n_t\ge\big(\frac1{2n}+\mathbb E[\int_t^T\frac{ds}{2\eta_s}|\mathcal F_t]\big)^{-1}Atn​≥(2n1​+E[∫tT​2ηs​ds​∣Ft​])−1, An↑AA^n\uparrow AAn↑A, and ∥An∥M−1+∥An∥M−1n≤C\|A^n\|_{\mathcal M_{-1}}+\|A^n\|_{\mathcal M^n_{-1}}\le\mathfrak C∥An∥M−1​​+∥An∥M−1n​​≤C uniformly in nnn.
  3. Theorem 4.3. The FBSDE (4.4), with parameter p∈[0,1]\mathfrak p\in[0,1]p∈[0,1] and data f∈L2f\in L^2f∈L2, has a unique solution in Hαn×Hγn×S2×L2×L2\mathcal H^n_\alpha\times\mathcal H^n_\gamma\times S^2\times L^2\times L^2Hαn​×Hγn​×S2×L2×L2.
  4. Lemma 4.4. ∥Xn∥n,α+∥Bn∥n,γ+E∫0T∣Ytn∣2dt≤C‾\|X^n\|_{n,\alpha}+\|B^n\|_{n,\gamma}+\mathbb E\int_0^T|Y^n_t|^2dt\le\overline{\mathfrak C}∥Xn∥n,α​+∥Bn∥n,γ​+E∫0T​∣Ytn​∣2dt≤C uniformly in nnn.
  5. (4.8). Under Assumption 4.1 the constrained equilibrium position satisfies ∥X∗∥1<∞\|X^*\|_1<\infty∥X∗∥1​<∞.
  6. Lemma 4.5. (Xn,Bn,Yn)→(X,B,Y)(X^n,B^n,Y^n)\to(X,B,Y)(Xn,Bn,Yn)→(X,B,Y) in L2(dt⊗dP)L^2(dt\otimes d\mathbb P)L2(dt⊗dP).

Significance

The result is a consistency statement between two models of liquidation. Penalized models are what a numerical scheme or a standard MFG solver can handle, since their FBSDEs have finite terminal data. Theorem 4.6 says that equilibrium values computed with a large penalty approximate the value of the hard-constrained game, and Lemma 4.5 says the same for positions and trading rates. Without it, a penalized model would be an unrelated object rather than an approximation of the constrained one.

The result is proved in the paper; it is not formalized anywhere. A machine-checked development would need, beyond the paper, the theory of quadratic BSDEs with finite and singular terminal values, conditional mean-field FBSDEs with common noise, and conditional essential infima of control problems. The milestones isolate reusable pieces: the monotone approximation of a singular Riccati BSDE (Lemma A.3) and uniform estimates in nnn-dependent weighted spaces (Lemma 4.4).

Difficulty

The obvious argument compares the two problems control by control: the constrained optimizer is admissible for the penalized problem, so Vn≤VV^n\le VVn≤V up to the change of μ\muμ. The reverse inequality is where it fails. The penalized optimizer leaves a residual position XTn≠0X^n_T\neq0XTn​=0, and its cost has to be compared with the singular one, whose weight (T−t)−1(T-t)^{-1}(T−t)−1 explodes at TTT. Controlling this requires estimates uniform in nnn in spaces whose weights (T−t+η⋆/n)−l(T-t+\eta_\star/n)^{-l}(T−t+η⋆​/n)−l degenerate as n→∞n\to\inftyn→∞, and the bare exponent α=η⋆/∥η∥<1\alpha=\eta_\star/\|\eta\|<1α=η⋆​/∥η∥<1 of the constrained problem is not enough to make the boundary terms vanish. Assumption 4.1, which upgrades the state to H1\mathcal H_1H1​, is what closes the gap. In addition, the aggregate rate μn\mu^nμn changes with nnn, so both the controls and the cost functional move at once.

Formalization scope

Time is R≥0\mathbb R_{\ge0}R≥0​; processes are real-valued functions of (t,ω)(t,\omega)(t,ω); WWW is the m=k+1m=k+1m=k+1-dimensional W~\widetilde WW with coordinate 000 the common noise. Stochastic integrals and BSDEs come from the published definition Peng1990.SMP.Stochastic. BSDEs on [0,T)[0,T)[0,T) are imposed on every [0,τ][0,\tau][0,τ], τ<T\tau<Tτ<T; AT=+∞A_T=+\inftyAT​=+∞ is lim⁡t↑TAt=+∞\lim_{t\uparrow T}A_t=+\inftylimt↑T​At​=+∞ a.s. Conditional expectations inside drivers are F0\mathbb F^0F0-progressive versions of integrable processes. Weighted norms are computed in [0,∞][0,\infty][0,∞]. The explicit readings are:

  • κmax⁡,η⋆,λ⋆,∥η∥\kappa_{\max},\eta_\star,\lambda_\star,\|\eta\|κmax​,η⋆​,λ⋆​,∥η∥ are essential bounds over dt⊗dPdt\otimes d\mathbb Pdt⊗dP; (2.4) is stated without division; "1/λ,1/η∈L∞1/\lambda,1/\eta\in L^\infty1/λ,1/η∈L∞" is a positive essential lower bound.
  • Assumption 2.3 is a hypothesis of every statement, including Lemma A.3 (the appendix assumes only its boundedness part).
  • Assumption 4.1 holds almost surely with the constant chosen before ω\omegaω (as restated on p. 32).
  • The penalty index is an integer n≥1n\ge1n≥1; constants in Lemma A.3 and Lemma 4.4 are chosen before nnn.
  • The class of AnA^nAn is S2×L2S^2\times L^2S2×L2 on [0,T][0,T][0,T] (not printed in Lemma A.3).
  • The penalized control set is LF2L^2_{\mathbb F}LF2​, with no terminal constraint.
  • Values are conditional essential infima given σ(X)\sigma(\mathcal X)σ(X).
  • The equilibria μn,μ∗\mu^n,\mu^*μn,μ∗ of Theorem 4.6 are defined through the FBSDE solutions, as in the proof; uniqueness of penalized equilibria is not claimed.
  • The solution of Proposition 2.8 includes the relation Y=AX+BY=AX+BY=AX+B on [0,T)[0,T)[0,T); "Theorem 2.8" on pp. 25–29 means Proposition 2.8.
  • L1L^1L1 convergence means ∫∣Vn−V∣ dP→0\int|V^n-V|\,d\mathbb P\to0∫∣Vn−V∣dP→0, not convergence of expectations.

A trivializing formalization would quantify over all solutions of the penalized MFG (claiming a uniqueness the paper does not state) or define VVV by a pointwise infimum over all controls (which is −∞-\infty−∞ or junk); both are ruled out above. Contributions toward BSDE comparison principles and quadratic BSDE well-posedness on this stochastic-integral layer are welcome and reusable.

Selected references

  • G. Fu, P. Graewe, U. Horst, A. Popier, A Mean Field Game of Optimal Portfolio Liquidation, Math. Oper. Res. 46(4), 2021; preprint arXiv:1804.04911v3. https://arxiv.org/abs/1804.04911
  • R. Almgren, N. Chriss, Optimal execution of portfolio transactions, Journal of Risk 3, 2001. https://doi.org/10.21314/JOR.2001.041
  • S. Ankirchner, M. Jeanblanc, T. Kruse, BSDEs with singular terminal condition and a control problem with constraints, SIAM J. Control Optim. 52(2):893–913, 2014 (reference [3] of the paper).
  • P. Graewe, U. Horst, E. Séré, Smooth solutions to portfolio liquidation problems under price-sensitive market impact, Stochastic Process. Appl. 128(3):979–1006, 2018 (reference [28] of the paper).
  • S. Peng, A general stochastic maximum principle for optimal control problems, SIAM J. Control Optim. 28(4), 1990. https://doi.org/10.1137/0328054
11 thms1 active userReviewed
AnalysisFunctional Analysis·Captain: mikedeng1

Bakry–Émery Curvature-Dimension Condition and Riemannian Ricci Curvature Bounds 1: The Weak, Pointwise and Gradient Forms of the Bakry–Émery Condition BE(K,N) Are EquivalentResearch Paper

Motivation

On a Riemannian manifold, a lower bound Ric≥K\mathrm{Ric}\ge KRic≥K together with a dimension bound NNN can be read off from the heat flow alone. This is the Bakry–Émery curvature-dimension condition BE(K,N)BE(K,N)BE(K,N): Bochner's inequality Γ2(f)≥K Γ(f)+1N(Δf)2\Gamma_2(f)\ge K\,\Gamma(f)+\tfrac1N(\Delta f)^2Γ2​(f)≥KΓ(f)+N1​(Δf)2 for the iterated carré du champ. The condition makes sense for any diffusion: weighted manifolds, infinite-dimensional Gaussian spaces, and limits of manifolds where no Ricci tensor exists. For this reason it is one of the two main routes to synthetic curvature bounds, the other being the optimal-transport conditions of Lott–Villani and Sturm. Bakry–Émery 1985; Bakry–Gentil–Ledoux 2014.

Ambrosio, Gigli and Savaré prove that, on metric measure spaces, BE(K,∞)BE(K,\infty)BE(K,∞) for the Cheeger energy is equivalent to the transport condition RCD(K,∞)RCD(K,\infty)RCD(K,∞). Their first step (§2.2) is to state BE(K,N)BE(K,N)BE(K,N) for an abstract Dirichlet form, in a weak form and under minimal regularity, and to show that the usual ways of writing it are equivalent. That equivalence, Corollary 2.3, is the subject of this mission. Every later section of the paper and the remaining missions of this series use one of its forms. arXiv:1209.5786v4, §2.2, pp. 14–20.

Setting

Let (X,B)(X,\mathcal B)(X,B) be a measurable space with a σ\sigmaσ-additive measure mmm.

  • A symmetric Dirichlet form is a functional E:L2(X,m)→[0,∞]\mathcal E:L^2(X,m)\to[0,\infty]E:L2(X,m)→[0,∞] that is quadratic and L2L^2L2-lower semicontinuous, satisfies E(η∘f)≤E(f)\mathcal E(\eta\circ f)\le\mathcal E(f)E(η∘f)≤E(f) for every 1-Lipschitz η\etaη with η(0)=0\eta(0)=0η(0)=0, and has a dense domain V={f:E(f)<∞}\mathbb V=\{f:\mathcal E(f)<\infty\}V={f:E(f)<∞}.
  • Write E(f,g)\mathcal E(f,g)E(f,g) for its bilinear form and V∞=V∩L∞\mathbb V_\infty=\mathbb V\cap L^\inftyV∞​=V∩L∞.
  • E\mathcal EE is strongly local if E(f,g)=0\mathcal E(f,g)=0E(f,g)=0 whenever (f+a)g=0(f+a)g=0(f+a)g=0 a.e. for some constant aaa.
  • The generator ΔE\Delta_{\mathcal E}ΔE​ is defined by E(f,g)=−∫Xg ΔEf dm\mathcal E(f,g)=-\int_X g\,\Delta_{\mathcal E}f\,dmE(f,g)=−∫X​gΔE​fdm for all g∈Vg\in\mathbb Vg∈V, and the heat flow Pt\mathsf P_tPt​ solves ∂tPtf=ΔEPtf\partial_t\mathsf P_tf=\Delta_{\mathcal E}\mathsf P_tf∂t​Pt​f=ΔE​Pt​f with Ptf→f\mathsf P_tf\to fPt​f→f in L2L^2L2. By contraction, Pt\mathsf P_tPt​ extends to L1(X,m)L^1(X,m)L1(X,m).

For f,g,φ∈V∞f,g,\varphi\in\mathbb V_\inftyf,g,φ∈V∞​ set

Γ[f,g;φ]=12(E(f,gφ)+E(g,fφ)−E(fg,φ)),Γ[f;φ]=Γ[f,f;φ].\Gamma[f,g;\varphi]=\tfrac12\big(\mathcal E(f,g\varphi)+\mathcal E(g,f\varphi)-\mathcal E(fg,\varphi)\big),\qquad \Gamma[f;\varphi]=\Gamma[f,f;\varphi].Γ[f,g;φ]=21​(E(f,gφ)+E(g,fφ)−E(fg,φ)),Γ[f;φ]=Γ[f,f;φ].

By continuity, this extends to f,g∈Vf,g\in\mathbb Vf,g∈V, φ∈V∞\varphi\in\mathbb V_\inftyφ∈V∞​. The set G\mathbb GG consists of those f∈Vf\in\mathbb Vf∈V for which φ↦Γ[f;φ]\varphi\mapsto\Gamma[f;\varphi]φ↦Γ[f;φ] has a density Γ(f)∈L+1(X,m)\Gamma(f)\in L^1_+(X,m)Γ(f)∈L+1​(X,m), the carré du champ. The iterated form is

Γ2[f;φ]=12Γ[f;ΔEφ]−Γ[f,ΔEf;φ].\Gamma_2[f;\varphi]=\tfrac12\Gamma[f;\Delta_{\mathcal E}\varphi]-\Gamma[f,\Delta_{\mathcal E}f;\varphi].Γ2​[f;φ]=21​Γ[f;ΔE​φ]−Γ[f,ΔE​f;φ].

Along the heat flow, for t>0t>0t>0 and s∈[0,t]s\in[0,t]s∈[0,t], set

At[f;φ](s)=12 ⁣∫X(Pt−sf)2Psφ dm,AtΔ[f;φ](s)=12 ⁣∫X(ΔEPt−sf)2Psφ dm,\mathsf A_t[f;\varphi](s)=\tfrac12\!\int_X(\mathsf P_{t-s}f)^2\mathsf P_s\varphi\,dm,\qquad \mathsf A^\Delta_t[f;\varphi](s)=\tfrac12\!\int_X(\Delta_{\mathcal E}\mathsf P_{t-s}f)^2\mathsf P_s\varphi\,dm,At​[f;φ](s)=21​∫X​(Pt−s​f)2Ps​φdm,AtΔ​[f;φ](s)=21​∫X​(ΔE​Pt−s​f)2Ps​φdm,

Bt[f;φ](s)=Γ[Pt−sf;Psφ]\mathsf B_t[f;\varphi](s)=\Gamma[\mathsf P_{t-s}f;\mathsf P_s\varphi]Bt​[f;φ](s)=Γ[Pt−s​f;Ps​φ] and Ct[f;φ](s)=Γ2[Pt−sf;Psφ]\mathsf C_t[f;\varphi](s)=\Gamma_2[\mathsf P_{t-s}f;\mathsf P_s\varphi]Ct​[f;φ](s)=Γ2​[Pt−s​f;Ps​φ]. Finally IK(t)=∫0teKsdsI_K(t)=\int_0^te^{Ks}dsIK​(t)=∫0t​eKsds, IK,2(t)=∫0tIK(s)dsI_{K,2}(t)=\int_0^tI_K(s)dsIK,2​(t)=∫0t​IK​(s)ds, and ν=1/N≥0\nu=1/N\ge0ν=1/N≥0.

Formalization targets

Goal: Corollary 2.3

Let K∈RK\in\mathbb RK∈R and ν≥0\nu\ge0ν≥0. The following are equivalent:

  • (i) Γ2[f;φ]≥KΓ[f;φ]+ν∫X(ΔEf)2φ dm\Gamma_2[f;\varphi]\ge K\Gamma[f;\varphi]+\nu\int_X(\Delta_{\mathcal E}f)^2\varphi\,dmΓ2​[f;φ]≥KΓ[f;φ]+ν∫X​(ΔE​f)2φdm for every (f,φ)∈D(Γ2)(f,\varphi)\in D(\Gamma_2)(f,φ)∈D(Γ2​) with φ≥0\varphi\ge0φ≥0;
  • (ii) Ct[f;φ](s)≥KBt[f;φ](s)+2νAtΔ[f;φ](s)\mathsf C_t[f;\varphi](s)\ge K\mathsf B_t[f;\varphi](s)+2\nu\mathsf A^\Delta_t[f;\varphi](s)Ct​[f;φ](s)≥KBt​[f;φ](s)+2νAtΔ​[f;φ](s) for 0≤s<t0\le s<t0≤s<t;
  • (iii) the distributional inequality
∂s2At[f;φ]≥2K ∂sAt[f;φ]+4ν AtΔ[f;φ]in D′(0,t);\partial_s^2\mathsf A_t[f;\varphi]\ge2K\,\partial_s\mathsf A_t[f;\varphi]+4\nu\,\mathsf A^\Delta_t[f;\varphi]\quad\text{in }\mathscr D'(0,t);∂s2​At​[f;φ]≥2K∂s​At​[f;φ]+4νAtΔ​[f;φ]in D′(0,t);
  • (iv) Ptf∈G\mathsf P_tf\in\mathbb GPt​f∈G and I2K(t)Γ(Ptf)+2νI2K,2(t)(ΔEPtf)2≤12Pt(f2)−12(Ptf)2I_{2K}(t)\Gamma(\mathsf P_tf)+2\nu I_{2K,2}(t)(\Delta_{\mathcal E}\mathsf P_tf)^2\le\tfrac12\mathsf P_t(f^2)-\tfrac12(\mathsf P_tf)^2I2K​(t)Γ(Pt​f)+2νI2K,2​(t)(ΔE​Pt​f)2≤21​Pt​(f2)−21​(Pt​f)2 a.e.;
  • (v) G=V\mathbb G=\mathbb VG=V and, for f∈Vf\in\mathbb Vf∈V, t>0t>0t>0, 12Pt(f2)−12(Ptf)2+2νI−2K,2(t)(ΔEPtf)2≤I−2K(t)PtΓ(f)\tfrac12\mathsf P_t(f^2)-\tfrac12(\mathsf P_tf)^2+2\nu I_{-2K,2}(t)(\Delta_{\mathcal E}\mathsf P_tf)^2\le I_{-2K}(t)\mathsf P_t\Gamma(f)21​Pt​(f2)−21​(Pt​f)2+2νI−2K,2​(t)(ΔE​Pt​f)2≤I−2K​(t)Pt​Γ(f) a.e.;
  • (vi) G\mathbb GG is dense in L2L^2L2, and for f∈Gf\in\mathbb Gf∈G, t>0t>0t>0,
Γ(Ptf)+2νI−2K(t)(ΔEPtf)2≤e−2KtPtΓ(f)a.e.\Gamma(\mathsf P_tf)+2\nu I_{-2K}(t)(\Delta_{\mathcal E}\mathsf P_tf)^2\le e^{-2Kt}\mathsf P_t\Gamma(f)\quad\text{a.e.}Γ(Pt​f)+2νI−2K​(t)(ΔE​Pt​f)2≤e−2KtPt​Γ(f)a.e.

Any of them implies G=V\mathbb G=\mathbb VG=V. Condition (iii) is the paper's definition of BE(K,N)BE(K,N)BE(K,N) (Definition 2.4).

Milestones

  1. Lemma 2.1, in four parts:
    • A\mathsf AA is continuous, AΔ\mathsf A^\DeltaAΔ is continuous, and ∂sA=B\partial_s\mathsf A=\mathsf B∂s​A=B (2.25);
    • A\mathsf AA and AΔ\mathsf A^\DeltaAΔ are monotone for φ≥0\varphi\ge0φ≥0;
    • ∂sB=2C\partial_s\mathsf B=2\mathsf C∂s​B=2C (2.26).
  2. Lemma 2.2: four equivalent forms of the scalar inequality a′′≥2Ka′+νga''\ge2Ka'+\nu ga′′≥2Ka′+νg.
  3. Its integrated consequences (2.30) and (2.31).

Significance

The result. Condition (i) is the classical Bochner inequality. (iii) is the form that survives limits and is used as a definition. (iv), (v) and (vi) are pointwise estimates for the heat flow: the reverse and the local Poincaré inequalities, and the Bakry–Émery gradient bound Γ(Ptf)≤e−2KtPtΓ(f)\Gamma(\mathsf P_tf)\le e^{-2Kt}\mathsf P_t\Gamma(f)Γ(Pt​f)≤e−2KtPt​Γ(f). Section 3 of the paper uses (vi) to obtain Lipschitz regularization and to identify the intrinsic distance. Section 4 uses (iii) with ν=0\nu=0ν=0 to prove the RCD(K,∞)RCD(K,\infty)RCD(K,∞) property. The conclusion G=V\mathbb G=\mathbb VG=V means that a BEBEBE form automatically admits a carré du champ on its whole domain, so Γ\GammaΓ-calculus is available without extra assumptions.

Formalizing it. The equivalences are classical for smooth diffusions with an algebra of nice functions. The paper's contribution is to prove them for an arbitrary strongly local Dirichlet form, where no such algebra is assumed. The result is proved; it is not formalized. The mission produces a Lean interface for Dirichlet forms, their heat flows, the extended Γ\GammaΓ and Γ2\Gamma_2Γ2​, and the six conditions. Proofs of the milestones and of the goal are open.

Difficulty

The obvious argument differentiates s↦At[f;φ](s)s\mapsto\mathsf A_t[f;\varphi](s)s↦At​[f;φ](s) twice and reads off A′′=2Γ2\mathsf A''=2\Gamma_2A′′=2Γ2​. That requires fff, φ\varphiφ and ΔEφ\Delta_{\mathcal E}\varphiΔE​φ to be smooth enough for every term to be defined. For a general f∈L2f\in L^2f∈L2 only the first derivative exists, as Γ[⋅;⋅]\Gamma[\cdot;\cdot]Γ[⋅;⋅] on V×V∞\mathbb V\times\mathbb V_\inftyV×V∞​, and only through the continuity extension (2.20). The weak forms must therefore be reached by truncation and semigroup mollification.

The passage from the integrated inequality (iv) to the existence of the density Γ(Ptf)\Gamma(\mathsf P_tf)Γ(Pt​f) is not a computation either. It needs a Daniell-type construction of a measure from a positive functional on V∞\mathbb V_\inftyV∞​. The converse directions, from (iv) or (vi) back to (iii), require a second-order Taylor expansion in time of quantities whose regularity is only that of Lemma 2.1.

Formalization scope

  • Representation. An element of L2L^2L2 is a function with MemLp f 2 m, and every predicate is invariant under a.e. equality. E\mathcal EE takes values in [0,∞][0,\infty][0,∞], with ∞\infty∞ off L2L^2L2. The completion of B\mathcal BB is not modelled.
  • Binders. The heat flow and its L1L^1L1 extension are binders, pinned by characterizing predicates. Generator values and carré du champ densities are witnesses, which are unique a.e.
  • Γ and Γ₂. They are predicates "the value is ccc": approximating sequences exist, and along each of them Γ\GammaΓ converges to ccc. The paper defines Γ\GammaΓ only on V×V×V∞\mathbb V\times\mathbb V\times\mathbb V_\inftyV×V×V∞​, so Γ2[f;φ]\Gamma_2[f;\varphi]Γ2​[f;φ] is undefined when ΔEφ∉V\Delta_{\mathcal E}\varphi\notin\mathbb VΔE​φ∈/V, and (i)–(ii) are required wherever it is defined.
  • Weak forms. Distributional inequalities are tested against nonnegative smooth functions compactly supported in (0,t)(0,t)(0,t), after integration by parts. This avoids derivatives at points where none exists.
  • Standing assumptions and constants. The strong locality and density assumptions of (2.1) are standing binders; there is no topology and no mass preservation. K∈RK\in\mathbb RK∈R is free and ν≥0\nu\ge0ν≥0. IKI_KIK​ is defined by its integral, so K=0K=0K=0 needs no separate case.
  • Departures from the page.
    • In condition (v) the coefficient of PtΓ(f)\mathsf P_t\Gamma(f)Pt​Γ(f) is I−2K(t)I_{-2K}(t)I−2K​(t). The page prints I−2K,2(t)I_{-2K,2}(t)I−2K,2​(t), which makes (v) false for small ttt already for the heat flow on R\mathbb RR; the paper's derivation of (v) from (2.31) gives I−2K(t)I_{-2K}(t)I−2K​(t). (v) is stated for t>0t>0t>0; at t=0t=0t=0 both sides vanish.
    • In Lemma 2.2 (iii), test functions are required to be nonnegative, since (2.27) fails for −ζ-\zeta−ζ.
    • In Lemma 2.2 (iv), s2<ts_2<ts2​<t is required.
  • Not a trivialization. The admissible test classes are nonempty, the conditions are not vacuous, and the hypotheses are satisfiable: the zero form with the identity flow satisfies them and BE(K,∞)BE(K,\infty)BE(K,∞) for every KKK, verified in Lean.
  • Shared layer. The setting module carries the paper's metric-measure definitions for the series and is reusable for any Dirichlet-form development, as is the interval lemma 2.2.

Proofs of any milestone are welcome. Each proved milestone is usable independently: Lemma 2.2, (2.30) and (2.31) are real-variable statements.

Selected references

  • L. Ambrosio, N. Gigli, G. Savaré, Bakry–Émery curvature-dimension condition and Riemannian Ricci curvature bounds, Ann. Probab. 43(1), 339–404, 2015. Pinned preprint arXiv:1209.5786v4, §2, pp. 10–20.
  • D. Bakry, M. Émery, Diffusions hypercontractives, Séminaire de Probabilités XIX, Lecture Notes in Math. 1123, 1985. https://doi.org/10.1007/BFb0075847
  • D. Bakry, I. Gentil, M. Ledoux, Analysis and Geometry of Markov Diffusion Operators, Springer, 2014. https://doi.org/10.1007/978-3-319-00227-9
10 thms1 active userReviewed
Functional AnalysisPartial Differential Equations·Captain: mikedeng1

From Nonlinear Fokker-Planck Equations to Solutions of Distribution Dependent SDE: Density-Dependent McKean–Vlasov SDEs Have Weak Solutions Whose Marginals Solve the Nonlinear FPEResearch Paper

Motivation

A McKean–Vlasov stochastic differential equation, or distribution dependent SDE, is an SDE whose coefficients depend on the law of the solution itself:

dX(t)=b(t,X(t),LX(t)) dt+σ(t,X(t),LX(t)) dW(t),dX(t) = b\big(t, X(t), \mathcal L_{X(t)}\big)\,dt + \sigma\big(t, X(t), \mathcal L_{X(t)}\big)\,dW(t),dX(t)=b(t,X(t),LX(t)​)dt+σ(t,X(t),LX(t)​)dW(t),

where LX(t)\mathcal L_{X(t)}LX(t)​ is the law of X(t)X(t)X(t). Such equations describe the limit of large systems of interacting particles (mean-field limits), and they are the probabilistic side of nonlinear Fokker–Planck equations: by Itô's formula the time marginals μt=LX(t)\mu_t = \mathcal L_{X(t)}μt​=LX(t)​ solve a Fokker–Planck equation whose coefficients depend on μt\mu_tμt​.

Most existence theory for McKean–Vlasov SDEs assumes that the coefficients are continuous, often Lipschitz, in the measure argument for a Wasserstein distance. That excludes the Nemytskii-type dependence b(X(t),u(t,X(t)))b(X(t), u(t, X(t)))b(X(t),u(t,X(t))), where u(t,⋅)u(t,\cdot)u(t,⋅) is the density of LX(t)\mathcal L_{X(t)}LX(t)​ evaluated at the current position. This dependence appears in models of nonlinear diffusion and porous media, where the diffusion speed depends on the local concentration. V. Barbu and M. Röckner (arXiv:1808.10706, Ann. Probab. 2020) reverse the usual direction: they first solve the nonlinear Fokker–Planck equation in L1L^1L1 by nonlinear semigroup theory and then construct the SDE from its solution.

Earlier results covered the case aij(x,u)=δijβ(u)a_{ij}(x,u) = \delta_{ij}\beta(u)aij​(x,u)=δij​β(u), as recorded in Remark 4.2 of the paper. Benachour, Chassaing, Roynette and Vallois (Ann. Sc. Norm. Sup. Pisa, 1996) treated d=1d = 1d=1, b≡0b \equiv 0b≡0, β(r)=r∣r∣m−1\beta(r) = r|r|^{m-1}β(r)=r∣r∣m−1. Blanchard, Röckner and Russo (Ann. Probab. 38, 2010) and Barbu, Röckner and Russo (Probab. Theory Relat. Fields, 2011) treated d=1d = 1d=1, b≡0b \equiv 0b≡0 with irregular β\betaβ, the latter in the degenerate case. Barbu and Röckner (SIAM J. Math. Anal. 50, 2018) treated a maximal monotone β\betaβ with a drift b(u)b(u)b(u) satisfying (H3)′.

Setting

Let d≥1d \ge 1d≥1, x∈Rdx \in \mathbb R^dx∈Rd, and let aij,bi:Rd×R→Ra_{ij}, b_i : \mathbb R^d \times \mathbb R \to \mathbb Raij​,bi​:Rd×R→R, 1≤i,j≤d1 \le i,j \le d1≤i,j≤d. The nonlinear Fokker–Planck equation (3.1) is

∂u∂t−∑i,j=1dDij2(aij(x,u)u)+div⁡(b(x,u)u)=0,u(0,⋅)=u0.\frac{\partial u}{\partial t} - \sum_{i,j=1}^d D^2_{ij}\big(a_{ij}(x,u)u\big) + \operatorname{div}\big(b(x,u)u\big) = 0, \qquad u(0,\cdot) = u_0 .∂t∂u​−i,j=1∑d​Dij2​(aij​(x,u)u)+div(b(x,u)u)=0,u(0,⋅)=u0​.

Two sets of hypotheses are considered. (H1)–(H3) (nondegenerate): aija_{ij}aij​ is C2C^2C2, bounded, with bounded xxx-gradient, symmetric; ∑i,j(aij+u ∂uaij)ξiξj≥γ∣ξ∣2\sum_{i,j}(a_{ij} + u\,\partial_ua_{ij})\xi_i\xi_j \ge \gamma|\xi|^2∑i,j​(aij​+u∂u​aij​)ξi​ξj​≥γ∣ξ∣2 for some γ>0\gamma > 0γ>0; bib_ibi​ is bounded, C1C^1C1, and bi(x,0)=0b_i(x,0) = 0bi​(x,0)=0. (H1)′–(H3)′ (degenerate): the coefficients do not depend on xxx, and the quadratic form above is only nonnegative.

The equation is written as an evolution equation u′+Au=0u' + Au = 0u′+Au=0 in L1(Rd)L^1(\mathbb R^d)L1(Rd), with the operator Au=−∑i,jDij2(aij(x,u)u)+div⁡(b(x,u)u)Au = -\sum_{i,j}D^2_{ij}(a_{ij}(x,u)u) + \operatorname{div}(b(x,u)u)Au=−∑i,j​Dij2​(aij​(x,u)u)+div(b(x,u)u) taken in the sense of distributions and domain D(A)={u∈L1:Au∈L1}D(A) = \{u \in L^1 : Au \in L^1\}D(A)={u∈L1:Au∈L1}. An operator is m-accretive if I+λAI + \lambda AI+λA is onto with a contractive inverse for every λ>0\lambda > 0λ>0. A mild solution is the uniform limit of the implicit Euler scheme uhi+hAuhi=uhi−1u_h^i + hAu_h^i = u_h^{i-1}uhi​+hAuhi​=uhi−1​. The paper calls a mild solution a weak solution of (3.1).

The SDE of the main theorem is

dX(t)=b(X(t),u(t,X(t))) dt+2 σ(X(t),u(t,X(t))) dW(t),0≤t≤T,u(t,⋅)=dLX(t)dx,(4.1)dX(t) = b\big(X(t), u(t,X(t))\big)\,dt + \sqrt2\,\sigma\big(X(t), u(t,X(t))\big)\,dW(t), \quad 0 \le t \le T, \qquad u(t,\cdot) = \frac{d\mathcal L_{X(t)}}{dx}, \tag{4.1}dX(t)=b(X(t),u(t,X(t)))dt+2​σ(X(t),u(t,X(t)))dW(t),0≤t≤T,u(t,⋅)=dxdLX(t)​​,(4.1)

with σ:Rd×R→L(Rd;Rd)\sigma : \mathbb R^d \times \mathbb R \to L(\mathbb R^d;\mathbb R^d)σ:Rd×R→L(Rd;Rd) measurable and a=σσTa = \sigma\sigma^Ta=σσT.

Formalization targets

Goal: Theorem 4.1

If a=σσTa = \sigma\sigma^Ta=σσT and bbb satisfy (H1)–(H3) or (H1)′–(H3)′ and u0u_0u0​ is a probability density, then (3.1) has a mild solution uuu with u(0)=u0u(0) = u_0u(0)=u0​, and for every T>0T > 0T>0 there is a weak solution XXX of (4.1) on [0,T][0,T][0,T] with

P∘X(t)−1(dx)=u(t,x) dx,0≤t≤T.P \circ X(t)^{-1}(dx) = u(t,x)\,dx, \qquad 0 \le t \le T .P∘X(t)−1(dx)=u(t,x)dx,0≤t≤T.

Milestones

  • The PDE layer for (H1)–(H3): Lemmas 3.2 and 3.3 (approximate and H1H^1H1 solutions of the resolvent equation under the extra smoothness (K)), the L1L^1L1 contraction (3.22), Proposition 3.1 (the resolvent equation in L1L^1L1, with contraction, positivity and mass conservation), density of D(A)D(A)D(A), m-accretivity of AAA, and Theorem 3.4 (existence and uniqueness of the mild solution, properties (3.36)–(3.39)), including preservation of probability densities.
  • The cited Crandall–Liggett theorem: an m-accretive operator generates a contraction semigroup of mild solutions.
  • The PDE layer for (H1)′–(H3)′: Lemma 3.6, the resolvent properties (3.52)–(3.54), Theorem 3.7.
  • The general scheme of §2: a weakly continuous probability solution of a linear Fokker–Planck equation with bounded coefficients is the marginal flow of a weak solution of the corresponding SDE.

Significance

The theorem gives weak existence for a class of distribution dependent SDEs whose coefficients are not continuous in the measure for any weak or Wasserstein topology: they are defined only on measures with a density and read that density at one point. The same construction gives a probabilistic representation of the nonlinear Fokker–Planck equation, which identifies its solutions as one-dimensional time marginals of a stochastic process and is the starting point for particle approximations.

The proofs are written in the literature. This mission formalizes them: the L1L^1L1 theory of a quasilinear elliptic operator in divergence form, the Crandall–Liggett generation theorem, and the passage from a Fokker–Planck solution to an SDE through the superposition principle. None of these is in Mathlib. The m-accretive operator layer and the superposition step are reusable well beyond this paper.

Difficulty

The natural first idea, a fixed point on the measure argument as in the Lipschitz McKean–Vlasov theory, fails: the map μ↦b(x,dμdx(x))\mu \mapsto b(x, \frac{d\mu}{dx}(x))μ↦b(x,dxdμ​(x)) is not continuous in any topology for which the law map of an SDE is compact, and it is not even defined at measures without density. The paper therefore solves the PDE first. There the obstacle is that AAA is nonlinear in the highest-order term and, under (H1)′–(H3)′, degenerate. Its resolvent has to be built from H1H^1H1 solutions on balls under extra smoothness. Its L1L^1L1 contraction comes from a sign-function argument that needs the monotonicity of u↦aij(x,u)uu \mapsto a_{ij}(x,u)uu↦aij​(x,u)u. Approximation arguments then remove (K) and the nondegeneracy. On the SDE side, the superposition principle needs a solution of the linear equation that is weakly continuous and consists of probability measures. Mass conservation and positivity of the semigroup supply exactly that.

Formalization scope

Rd\mathbb R^dRd is EthierKurtz.SDEState d, with indices Fin d (0-based) and Lebesgue measure volume. L1L^1L1 is MeasureTheory.Lp ℝ 1 volume. Coefficients are functions aij(x,r)a_{ij}(x,r)aij​(x,r), bi(x,r)b_i(x,r)bi​(x,r) of the point and of a real number. The degenerate case uses coefficients constant in xxx, and the operator A1A_1A1​ of (3.42) is then literally AAA. Operators are graphs X → X → Prop, and no resolvent is ever chosen. Mild solutions require that the Euler scheme can be run for all small steps, so the notion is not vacuous. Distributional derivatives are always moved onto smooth compactly supported test functions. H1H^1H1 uses the published weak derivative HunterPDE.Shared.HasWeakDeriv, and H01(BN)H^1_0(B_N)H01​(BN​) means "in H1(Rd)H^1(\mathbb R^d)H1(Rd) and zero outside BNB_NBN​". The SDE is the published EthierKurtz.IsWeakSDESolution on [0,∞)[0,\infty)[0,∞) with coefficients switched off after TTT. Its coefficients are evaluated on a jointly measurable version u~(t,x)\tilde u(t,x)u~(t,x) of the density, which must equal the law of X(t)X(t)X(t).

Deviations from the page, all disclosed in the statements:

  • a=σσTa = \sigma\sigma^Ta=σσT, not the printed 2σσT2\sigma\sigma^T2σσT. With noise 2σ\sqrt2\sigma2​σ the printed factor makes the theorem false (for d=1d = 1d=1, σ≡1/2\sigma \equiv 1/\sqrt2σ≡1/2​, b≡0b \equiv 0b≡0 the PDE has variance 2t2t2t and the SDE variance ttt).
  • In Lemmas 3.2 and 3.3 the explicit λ0=γ(b∞2+c∞2)−1\lambda_0 = \gamma(b_\infty^2 + c_\infty^2)^{-1}λ0​=γ(b∞2​+c∞2​)−1 is replaced by the existence of some λ0>0\lambda_0 > 0λ0​>0; (3.22) keeps the printed λ0\lambda_0λ0​, read as +∞+\infty+∞ when b∞=c∞=0b_\infty = c_\infty = 0b∞​=c∞​=0.
  • In §2 the coefficients are bounded instead of satisfying the integrability Hypothesis 2.1 (ii), and any measurable σˉ\bar\sigmaσˉ with σˉσˉT=aˉ\bar\sigma\bar\sigma^T = \bar aσˉσˉT=aˉ is allowed.
  • The typos "Cb(Rd×Rd)C_b(\mathbb R^d\times\mathbb R^d)Cb​(Rd×Rd)" in (H1) and "C1(Rd)C^1(\mathbb R^d)C1(Rd)" in (H3)′ are read as Cb(Rd×R)C_b(\mathbb R^d\times\mathbb R)Cb​(Rd×R) and C1(R)C^1(\mathbb R)C1(R).

A trivializing formalization is ruled out: the goal asserts the existence of the mild solution as well as the SDE for every mild solution, a mild solution must come from a run of the scheme, and the constant CCC of Lemma 3.3 is fixed before the data. Contributions are welcome at every layer, especially general results on m-accretive operators and the Crandall–Liggett theorem, L1L^1L1 estimates for quasilinear elliptic equations, and the superposition principle.

Selected references

  • V. Barbu, M. Röckner, From nonlinear Fokker–Planck equations to solutions of distribution dependent SDE, Ann. Probab. 48(4), 2020; arXiv:1808.10706v4. https://arxiv.org/abs/1808.10706
  • V. Barbu, M. Röckner, Probabilistic representation for solutions to nonlinear Fokker–Planck equations, SIAM J. Math. Anal. 50, 2588–2607, 2018.
  • Ph. Blanchard, M. Röckner, F. Russo, Probabilistic representation for solutions of an irregular porous media type equation, Ann. Probab. 38, 1870–1900, 2010.
  • V. Barbu, Nonlinear Differential Equations of Monotone Type in Banach Spaces, Springer, 2010. https://doi.org/10.1007/978-1-4419-5542-5
  • M. G. Crandall, T. M. Liggett, Generation of semi-groups of nonlinear transformations on general Banach spaces, Amer. J. Math. 93, 1971. https://doi.org/10.2307/2373376
  • D. Trevisan, Well-posedness of multidimensional diffusion processes with weakly differentiable coefficients, Electron. J. Probab. 21, 2016. https://doi.org/10.1214/16-EJP4453
  • D. W. Stroock, S. R. S. Varadhan, Multidimensional Diffusion Processes, Springer, 1979. https://doi.org/10.1007/3-540-28999-2
22 thms1 active userReviewed
Control TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

A Mean Field Game of Optimal Portfolio Liquidation 1: Under Weak Interaction the Liquidation Mean Field Game Has a Unique Equilibrium, Given by a Singular Conditional Mean-Field FBSDEResearch Paper

Motivation

Large traders who must unwind a position by a deadline face a trade-off between trading fast, which moves prices against them, and trading slowly, which exposes them to price risk. When many traders liquidate at once, each one's execution price also depends on the aggregate selling rate of the others. Fu, Graewe, Horst and Popier (arXiv:1804.04911) model this as a mean field game (MFG) with common noise and a hard liquidation constraint: every position must be zero at the terminal time TTT. Single-player liquidation with this constraint leads to backward equations with singular terminal values (Ankirchner, Jeanblanc and Kruse, SIAM J. Control Optim. 2014; Graewe, Horst and Séré, Stoch. Proc. Appl. 2018). Earlier MFG models of execution (Cardaliaguet and Lehalle, Math. Financ. Econ. 2018; Carmona and Lacker, Ann. Appl. Probab. 2015) allow no liquidation constraint. This mission formalizes the paper's first main result: the constrained game has a unique equilibrium under a weak-interaction condition.

Setting

Fix T>0T>0T>0 and a probability space carrying an mmm-dimensional Brownian motion W~=(W0,W)\widetilde W=(W^0,W)W=(W0,W), where W0W^0W0 is the one-dimensional common noise, and an initial portfolio X∈L2\mathcal X\in L^2X∈L2 independent of W~\widetilde WW. Let F0\mathbb F^0F0 be the filtration of W0W^0W0 and F\mathbb FF that of (X,W0,W)(\mathcal X,W^0,W)(X,W0,W), both augmented by null sets. The cost coefficients are bounded nonnegative F\mathbb FF-progressive processes κ\kappaκ (interaction), λ\lambdaλ (risk aversion) and η\etaη (temporary impact), with λ,η\lambda,\etaλ,η bounded away from zero.

A player's trading rate ξ\xiξ produces the position Xtξ=X−∫0tξsdsX^\xi_t=\mathcal X-\int_0^t\xi_sdsXtξ​=X−∫0t​ξs​ds. The admissible strategies are AF(X)={ξ∈LF2:∫0Tξsds=X}\mathcal A_{\mathbb F}(\mathcal X)=\{\xi\in L^2_{\mathbb F}:\int_0^T\xi_sds=\mathcal X\}AF​(X)={ξ∈LF2​:∫0T​ξs​ds=X}. Given an F0\mathbb F^0F0-progressive aggregate rate μ\muμ, the cost is

J(X,ξ;μ)=E[∫0T(κsXsξμs+ηsξs2+λs(Xsξ)2)ds ∣ X],J(\mathcal X,\xi;\mu)=\mathbb E\Big[\int_0^T\big(\kappa_sX^\xi_s\mu_s+\eta_s\xi_s^2+\lambda_s(X^\xi_s)^2\big)ds\ \Big|\ \mathcal X\Big],J(X,ξ;μ)=E[∫0T​(κs​Xsξ​μs​+ηs​ξs2​+λs​(Xsξ​)2)ds ​ X],

and V(X;μ)V(\mathcal X;\mu)V(X;μ) is its essential infimum over AF(X)\mathcal A_{\mathbb F}(\mathcal X)AF​(X). A process μ\muμ solves the MFG (1.7) if some optimal strategy ξ∗\xi^*ξ∗ given μ\muμ satisfies μt=E[ξt∗∣Ft0]\mu_t=\mathbb E[\xi^*_t\mid\mathcal F^0_t]μt​=E[ξt∗​∣Ft0​] for a.e. ttt.

The equilibrium is described by the conditional mean-field FBSDE (2.3):

Xt=X−∫0tYs2ηsds,XT=0,−dYt=(κt E[Yt2ηt∣Ft0]+2λtXt)dt−Zt dW~t  on [0,T).X_t=\mathcal X-\int_0^t\frac{Y_s}{2\eta_s}ds,\quad X_T=0,\quad -dY_t=\Big(\kappa_t\,\mathbb E\Big[\frac{Y_t}{2\eta_t}\Big|\mathcal F^0_t\Big]+2\lambda_tX_t\Big)dt-Z_t\,d\widetilde W_t\ \ \text{on }[0,T).Xt​=X−∫0t​2ηs​Ys​​ds,XT​=0,−dYt​=(κt​E[2ηt​Yt​​​Ft0​]+2λt​Xt​)dt−Zt​dWt​  on [0,T).

Solutions are sought in weighted spaces: Y∈HlY\in\mathcal H_lY∈Hl​ if Esup⁡t≤T∣Yt/(T−t)l∣2<∞\mathbb E\sup_{t\le T}|Y_t/(T-t)^l|^2<\inftyEsupt≤T​∣Yt​/(T−t)l∣2<∞, and Y∈MlY\in\mathcal M_lY∈Ml​ if (T−t)−l∣Yt∣(T-t)^{-l}|Y_t|(T−t)−l∣Yt​∣ is essentially bounded. The weak-interaction condition (Assumption 2.3) asks for θ>0\theta>0θ>0 with κmax⁡/(4η⋆)<θ<4λ⋆/κmax⁡\kappa_{\max}/(4\eta_\star)<\theta<4\lambda_\star/\kappa_{\max}κmax​/(4η⋆​)<θ<4λ⋆​/κmax​, and α:=η⋆/∥η∥∈(0,1]\alpha:=\eta_\star/\|\eta\|\in(0,1]α:=η⋆​/∥η∥∈(0,1]. The decoupling Y=AX+BY=AX+BY=AX+B uses the solution AAA of the singular Riccati BSDE −dAt=(2λt−At2/(2ηt))dt−ZtAdW~t-dA_t=(2\lambda_t-A_t^2/(2\eta_t))dt-Z^A_td\widetilde W_t−dAt​=(2λt​−At2​/(2ηt​))dt−ZtA​dWt​, AT=+∞A_T=+\inftyAT​=+∞.

Formalization targets

Goal: Theorem 2.4

Under Assumption 2.3 the FBSDE (2.3) has a unique solution

(X,Y,Z)∈Hα×LF2([0,T])×LF2([0,T−];Rm);(X,Y,Z)\in\mathcal H_\alpha\times L^2_{\mathbb F}([0,T])\times L^2_{\mathbb F}([0,T-];\mathbb R^m);(X,Y,Z)∈Hα​×LF2​([0,T])×LF2​([0,T−];Rm);

ξ∗=Y/(2η)\xi^*=Y/(2\eta)ξ∗=Y/(2η) is optimal, XXX is the optimal position, μt∗=E[Yt/(2ηt)∣Ft0]\mu^*_t=\mathbb E[Y_t/(2\eta_t)\mid\mathcal F^0_t]μt∗​=E[Yt​/(2ηt​)∣Ft0​] is the unique solution of the MFG (1.7), and

V(X;μ∗)=12A0X2+12B0X+12E[∫0TκsXs∗μs∗ds ∣ X].V(\mathcal X;\mu^*)=\tfrac12A_0\mathcal X^2+\tfrac12B_0\mathcal X+\tfrac12\mathbb E\Big[\int_0^T\kappa_sX^*_s\mu^*_sds\ \Big|\ \mathcal X\Big].V(X;μ∗)=21​A0​X2+21​B0​X+21​E[∫0T​κs​Xs∗​μs∗​ds ​ X].

Milestones

The milestones follow the paper's proof: Fact 2.2 on the weighted spaces; Lemma A.1, existence and uniqueness of AAA with the bounds (A.1), and A∈M−1A\in\mathcal M_{-1}A∈M−1​; the decay estimate (2.9), exp⁡(−∫rsAu/(2ηu)du)≤((T−s)/(T−r))α\exp(-\int_r^sA_u/(2\eta_u)du)\le((T-s)/(T-r))^\alphaexp(−∫rs​Au​/(2ηu​)du)≤((T−s)/(T−r))α; Lemma 2.5, an a priori estimate for the decoupled system (2.11) with homotopy parameter p∈[0,1]\mathfrak p\in[0,1]p∈[0,1]; Lemma 2.6, explicit unique solvability at p=0\mathfrak p=0p=0; Lemma 2.7, the continuation step p→p+d\mathfrak p\to\mathfrak p+\mathfrak dp→p+d; Proposition 2.8, unique solvability of (2.3) with (2.10) and a norm bound; the boundary limit (2.15); and Proposition 2.9, optimality, the equilibrium property and the value formula.

Significance

The theorem gives a complete equilibrium description for constrained liquidation with many players and stochastic, partially common market data: the equilibrium rate is the conditional expectation of the decoupled feedback rate given the common noise, and its value is explicit in terms of the Riccati solution. It is the basis of the paper's other two results, the O(N−1/2)O(N^{-1/2})O(N−1/2)-Nash property of the equilibrium in the NNN-player game (Theorem 3.3) and the approximation by penalized games (Theorem 4.6), which are separate missions in this series.

The result is proved in the paper; none of it is machine-checked. A formal development would contain the first formal treatment of BSDEs with singular terminal value and of a conditional (common-noise) mean-field FBSDE. Shorter proofs of individual steps, in particular of the a priori estimate and the continuation step, are welcome.

Difficulty

The obvious approach fails at the terminal time. Standard FBSDE theory requires a terminal condition for YYY; here only XT=0X_T=0XT​=0 is known, and YTY_TYT​ is undetermined. The decoupling coefficient AAA blows up like (T−t)−1(T-t)^{-1}(T−t)−1, so the driver of the equation for BBB is singular, and the classical monotonicity method of Hu–Peng and Peng–Wu, applied to (X,B)(X,B)(X,B) in unweighted spaces, does not close. The paper works instead with weighted norms that encode the rate at which XXX and BBB vanish at TTT, and runs the continuation on the triple (X,B,Y)(X,B,Y)(X,B,Y). The mean-field term is a conditional expectation given the common-noise filtration, not an expectation, so it remains random and has to be controlled pathwise in the weighted norms.

Formalization scope

Time is ℝ≥0; processes are real valued and W~\widetilde WW has m=k+1m=k+1m=k+1 coordinates, coordinate 000 being W0W^0W0. The Itô calculus is the published definition Peng1990.SMP.Stochastic (standard Brownian motion, LF2L^2_{\mathbb F}LF2​, Itô integrals, BSDEs in integrated form). The explicit choices:

  • Filtrations are augmented by the measurable null sets, and F\mathbb FF contains σ(X)\sigma(\mathcal X)σ(X).
  • κmax⁡,η⋆,λ⋆,∥η∥\kappa_{\max},\eta_\star,\lambda_\star,\|\eta\|κmax​,η⋆​,λ⋆​,∥η∥ are essential bounds over dt⊗dPdt\otimes d\mathbb Pdt⊗dP. Condition (2.4) is written without division, and "1/λ,1/η1/\lambda,1/\eta1/λ,1/η bounded" as positive essential lower bounds.
  • Assumption 2.3 is a hypothesis of every statement of §2, as the paper's standing assumption. Lemma A.1 (appendix) assumes only what §A assumes: λ,η\lambda,\etaλ,η progressive, nonnegative and bounded, and 1/η1/\eta1/η bounded.
  • Backward equations on [0,T)[0,T)[0,T) are imposed on every [0,τ][0,\tau][0,τ], τ<T\tau<Tτ<T. AT=∞A_T=\inftyAT​=∞ means At→+∞A_t\to+\inftyAt​→+∞ as t↑Tt\uparrow Tt↑T a.s.
  • Weighted norms are computed in [0,∞][0,\infty][0,∞], with the weight (T−t)−l(T-t)^{-l}(T−t)−l in ℝ≥0∞.
  • Every conditional expectation E[⋅∣Ft0]\mathbb E[\cdot\mid\mathcal F^0_t]E[⋅∣Ft0​] in an equation is evaluated through a progressive version, and its argument is required to be integrable.
  • The value is an essential infimum of conditional costs.
  • The relation Y=AX+BY=AX+BY=AX+B is part of the solution concept of (2.11): without it, YYY is determined only up to an additive F0\mathcal F_0F0​-measurable constant.
  • The constant of Proposition 2.8 is uniform over initial portfolios in an L2L^2L2 ball, for fixed coefficients.
  • Fact 2.2's product rule assumes paths of K1K_1K1​ continuous on [0,T)[0,T)[0,T), and its claim that KT=0K_T=0KT​=0 for K∈MlK\in\mathcal M_lK∈Ml​ is not stated. Both printed versions fail under the essential-supremum norm.

The interaction term must stay conditioned on Ft0\mathcal F^0_tFt0​: conditioning on Ft\mathcal F_tFt​ makes it Yt/(2ηt)Y_t/(2\eta_t)Yt​/(2ηt​) itself and collapses the game. The constraint XT=0X_T=0XT​=0 and the admissibility condition ∫0Tξ=X\int_0^T\xi=\mathcal X∫0T​ξ=X cannot be dropped either. The degenerate instance κ≡0\kappa\equiv0κ≡0 satisfies all hypotheses but decouples the game.

A complete development needs the following, all reusable beyond this mission: martingale representation for the augmented filtration F\mathbb FF; existence of progressive versions of conditional expectation processes; Doob's inequality on [0,τ][0,\tau][0,τ]; and linear BSDE solution formulas.

Selected references

  • G. Fu, P. Graewe, U. Horst, A. Popier, A Mean Field Game of Optimal Portfolio Liquidation, arXiv:1804.04911v3, 2021; Math. Oper. Res. 46(4), 2021. https://arxiv.org/abs/1804.04911
  • S. Ankirchner, M. Jeanblanc, T. Kruse, BSDEs with singular terminal condition and a control problem with constraints, SIAM J. Control Optim. 52(2), 2014. https://doi.org/10.1137/130913411
  • P. Graewe, U. Horst, E. Séré, Smooth solutions to portfolio liquidation problems under price-sensitive market impact, Stoch. Proc. Appl. 128(3), 2018. https://doi.org/10.1016/j.spa.2017.07.002
  • P. Cardaliaguet, C.-A. Lehalle, Mean field game of controls and an application to trade crowding, Math. Financ. Econ. 12, 2018. https://doi.org/10.1007/s11579-017-0206-z
  • R. Carmona, D. Lacker, A probabilistic weak formulation of mean field games and applications, Ann. Appl. Probab. 25(3), 2015. https://doi.org/10.1214/14-AAP1020
  • Y. Hu, S. Peng, Solution of forward-backward stochastic differential equations, Probab. Theory Related Fields 103, 1995. https://doi.org/10.1007/BF01204214
15 thms1 active userReviewed
Algorithmic Game TheoryControl TheoryOperations Research+1·Captain: mikedeng1

A Mean Field Game of Optimal Portfolio Liquidation 3: The Mean-Field Equilibrium Strategies Form an O(1/√N)-Nash Equilibrium of the N-Player Liquidation GameResearch Paper

Motivation

A trader who must sell a large position within a fixed horizon faces a trade-off: selling fast moves the price against her (temporary price impact), selling slowly exposes her to price risk. Since Almgren and Chriss, this optimal liquidation problem has been studied as a stochastic control problem with a terminal state constraint: the remaining position must be zero at the horizon TTT. When many traders liquidate at the same time, each trader's sales also depress the price that the others receive (permanent price impact), and the problem becomes a game.

Fu, Graewe, Horst and Popier (arXiv:1804.04911v3) study this game in the mean-field limit. Their §2 constructs a mean-field equilibrium through a singular conditional mean-field FBSDE. Their §3, the subject of this mission, justifies the limit: the strategies computed from the mean field game are an approximate Nash equilibrium of the finite game with NNN traders, with an error of order 1/N1/\sqrt N1/N​. Without such a result, the mean-field equilibrium describes a model nobody plays; with it, the equilibrium is a usable approximation for large but finite markets.

The approximation of NNN-player games by mean field games goes back to Huang, Malhamé and Caines (2006) and Lasry and Lions (2007); Carmona and Delarue (SIAM J. Control Optim. 51, 2013) proved an εN\varepsilon_NεN​-Nash property for a McKean–Vlasov class with state interaction and a rate N−1/(d+4)N^{-1/(d+4)}N−1/(d+4). The present game differs in three respects: players interact through their controls (the average trading rate), there is a common noise observed by all, and each player's state must reach zero at time TTT.

Setting

A single probability space carries a one-dimensional Brownian motion W0W^0W0 (the common noise, which drives the benchmark price and is observed by every player), for each player iii a kkk-dimensional Brownian motion WiW^iWi (the private noise), and i.i.d. initial portfolios Xi\mathcal X^iXi with law ν\nuν; all of these are mutually independent. Player iii observes Fi\mathbb F^iFi, Fti=σ(Xi,Ws0,Wsi, s≤t)\mathcal F^i_t=\sigma(\mathcal X^i,W^0_s,W^i_s,\ s\le t)Fti​=σ(Xi,Ws0​,Wsi​, s≤t), and chooses a trading rate ξi\xi^iξi; her position is Xti=Xi−∫0tξsi dsX^i_t=\mathcal X^i-\int_0^t\xi^i_s\,dsXti​=Xi−∫0t​ξsi​ds and must satisfy XTi=0X^i_T=0XTi​=0. Given the profile ξ⃗=(ξ1,…,ξN)\vec\xi=(\xi^1,\dots,\xi^N)ξ​=(ξ1,…,ξN), her conditional cost is

JN,i(ξ⃗)=E[∫0T(κtiN∑j=1NξtjXti+ηti(ξti)2+λti(Xti)2)dt ∣ Xi],J^{N,i}(\vec\xi)=\mathbb E\Big[\int_0^T\Big(\frac{\kappa^i_t}{N}\sum_{j=1}^N\xi^j_tX^i_t+\eta^i_t(\xi^i_t)^2+\lambda^i_t(X^i_t)^2\Big)dt\ \Big|\ \mathcal X^i\Big],JN,i(ξ​)=E[∫0T​(Nκti​​j=1∑N​ξtj​Xti​+ηti​(ξti​)2+λti​(Xti​)2)dt ​ Xi],

where κi\kappa^iκi (permanent impact), ηi\eta^iηi (temporary impact) and λi\lambda^iλi (risk aversion) are nonnegative bounded processes. Under Assumption 3.1 they are the same deterministic measurable functionals κ,η,λ\kappa,\eta,\lambdaκ,η,λ of (t,Xi,W⋅∧ti,W⋅∧t0)(t,\mathcal X^i,W^i_{\cdot\wedge t},W^0_{\cdot\wedge t})(t,Xi,W⋅∧ti​,W⋅∧t0​) for every player, so the players are statistically identical.

In the mean field game, the average 1N∑jξj\frac1N\sum_j\xi^jN1​∑j​ξj is replaced by a process μ\muμ adapted to the common-noise filtration F0\mathbb F^0F0, and an equilibrium is a μ∗\mu^*μ∗ with μt∗=E[ξt∗∣Ft0]\mu^*_t=\mathbb E[\xi^*_t\mid\mathcal F^0_t]μt∗​=E[ξt∗​∣Ft0​] for the representative player's best response ξ∗\xi^*ξ∗. The paper characterizes it through the FBSDE (2.3),

dXt=−Yt2ηtdt,−dYt=(κt E[Yt2ηt∣Ft0]+2λtXt)dt−Zt dW~t,X0=X, XT=0,dX_t=-\frac{Y_t}{2\eta_t}dt,\qquad -dY_t=\Big(\kappa_t\,\mathbb E\Big[\frac{Y_t}{2\eta_t}\Big|\mathcal F^0_t\Big]+2\lambda_tX_t\Big)dt-Z_t\,d\widetilde W_t,\qquad X_0=\mathcal X,\ X_T=0,dXt​=−2ηt​Yt​​dt,−dYt​=(κt​E[2ηt​Yt​​​Ft0​]+2λt​Xt​)dt−Zt​dWt​,X0​=X, XT​=0,

with W~=(W0,W)\widetilde W=(W^0,W)W=(W0,W); the optimal rate is ξ∗=Y/(2η)\xi^*=Y/(2\eta)ξ∗=Y/(2η). Player iii's mean-field strategy ξ∗,i=Yi/(2ηi)\xi^{*,i}=Y^i/(2\eta^i)ξ∗,i=Yi/(2ηi) comes from the same FBSDE with her own data.

Formalization targets

Goal: Theorem 3.3

For a positive function MMM with ψ≤M\psi\le Mψ≤M, where ψ(Xi)=E[∫0T∣ξt∗,i∣2dt∣Xi]\psi(\mathcal X^i)=\mathbb E[\int_0^T|\xi^{*,i}_t|^2dt\mid\mathcal X^i]ψ(Xi)=E[∫0T​∣ξt∗,i​∣2dt∣Xi], and admissible sets Ai={ξ∈AFi(Xi):E[∫0T∣ξt∣2dt∣Xi]≤M(Xi)}\mathcal A^i=\{\xi\in\mathcal A_{\mathbb F^i}(\mathcal X^i):\mathbb E[\int_0^T|\xi_t|^2dt\mid\mathcal X^i]\le M(\mathcal X^i)\}Ai={ξ∈AFi​(Xi):E[∫0T​∣ξt​∣2dt∣Xi]≤M(Xi)}, there is a function ggg, independent of iii and NNN, with

JN,i(ξ⃗∗)≤JN,i(ξi,ξ∗,−i)+g(Xi)Nfor all N≥1, 1≤i≤N, ξi∈Ai.J^{N,i}(\vec\xi^*)\le J^{N,i}(\xi^i,\xi^{*,-i})+\frac{g(\mathcal X^i)}{\sqrt N}\qquad\text{for all }N\ge1,\ 1\le i\le N,\ \xi^i\in\mathcal A^i .JN,i(ξ​∗)≤JN,i(ξi,ξ∗,−i)+N​g(Xi)​for all N≥1, 1≤i≤N, ξi∈Ai.

The goal asserts only the shape of the bound, not its constant.

Milestones

  1. Lemma 3.2: one measurable map Φ\PhiΦ gives (Xi,Yi,∫0⋅Zi)=Φ(Xi,Wi,W0)(X^i,Y^i,\int_0^\cdot Z^i)=\Phi(\mathcal X^i,W^i,W^0)(Xi,Yi,∫0⋅​Zi)=Φ(Xi,Wi,W0) for every player, and ξ∗,i=ϕ(Xi,W0,Wi)\xi^{*,i}=\phi(\mathcal X^i,W^0,W^i)ξ∗,i=ϕ(Xi,W0,Wi) (3.1).
  2. (3.2): a single μ∗\mu^*μ∗ with μt∗=E[ξt∗,i∣Ft0]\mu^*_t=\mathbb E[\xi^{*,i}_t\mid\mathcal F^0_t]μt∗​=E[ξt∗,i​∣Ft0​] for every iii.
  3. (3.3): E∫0T∣ξt∗,i∣2dt≤C\mathbb E\int_0^T|\xi^{*,i}_t|^2dt\le CE∫0T​∣ξt∗,i​∣2dt≤C uniformly in iii.
  4. (3.5): E[∫0T(μt∗−1N∑jξt∗,j)2dt∣Xi]≤2(M(Xi)+(2N−1)C)/N2\mathbb E[\int_0^T(\mu^*_t-\frac1N\sum_j\xi^{*,j}_t)^2dt\mid\mathcal X^i]\le 2(M(\mathcal X^i)+(2N-1)C)/N^2E[∫0T​(μt∗​−N1​∑j​ξt∗,j​)2dt∣Xi]≤2(M(Xi)+(2N−1)C)/N2.
  5. The bounds on I1I_1I1​ and I2I_2I2​ (p. 24): the two differences of conditional costs into which the proof splits JN,i(ξ,ξ∗,−i)−JN,i(ξ⃗∗)J^{N,i}(\xi,\xi^{*,-i})-J^{N,i}(\vec\xi^*)JN,i(ξ,ξ∗,−i)−JN,i(ξ​∗) are O(1/N)O(1/\sqrt N)O(1/N​).

Significance

The result turns the mean-field equilibrium of §2 into a statement about the finite market: when all NNN traders use their mean-field strategies, a trader who deviates can save at most g(Xi)/Ng(\mathcal X^i)/\sqrt Ng(Xi)/N​ in conditional expected cost. The error bound depends on the trader's own initial position only through M(Xi)M(\mathcal X^i)M(Xi), and the rate 1/N1/\sqrt N1/N​ is dimension-free, in contrast with the N−1/(d+4)N^{-1/(d+4)}N−1/(d+4) rates of state-interaction games, because the interaction runs through the empirical mean of the controls rather than through an empirical measure.

The paper's proof of Theorem 3.3 is short but rests on several facts it states without proof: the Yamada–Watanabe-type Lemma 3.2 (whose proof is referred to other papers), the identification (3.2) of a common conditional mean, and the moment bound (3.3) attributed to Proposition 2.8. This mission makes each of these a separate machine-checkable statement. As far as we know, none of these results, nor any optimal-liquidation mean field game, has a machine-checked proof.

Difficulty

The estimate (3.5) is a law-of-large-numbers bound for the average of NNN processes that are not independent: all of them depend on the common noise W0W^0W0. The obvious argument, expanding the square and using independence, fails as stated; the cross terms vanish only conditionally on W0W^0W0, and only once one knows that every ξ∗,j\xi^{*,j}ξ∗,j is the same measurable functional of (Xj,W0,Wj)(\mathcal X^j,W^0,W^j)(Xj,W0,Wj). That is Lemma 3.2, a Yamada–Watanabe-type statement for a singular FBSDE with a conditional mean-field term, which needs strong uniqueness of the FBSDE in the class Hα×L2×L2([0,T−])\mathcal H_\alpha\times L^2\times L^2([0,T-])Hα​×L2×L2([0,T−]) and is the main technical step. The terminal constraint XT=0X_T=0XT​=0 makes the backward component singular at TTT (YYY blows up like X/(T−t)X/(T-t)X/(T−t)), so standard Lipschitz FBSDE theory does not apply. Finally, the deviation ξ\xiξ is constrained only through a conditional second-moment bound MMM, and the comparison with the mean-field cost uses the optimality of ξ∗,i\xi^{*,i}ξ∗,i (Proposition 2.9) against μ∗\mu^*μ∗.

Formalization scope

Everything is stated on one probability space carrying all players, with players indexed by N\mathbb NN; the NNN-player game uses players i<Ni<Ni<N (the paper's 1,…,N1,\dots,N1,…,N, shifted by one). Time is R≥0\mathbb R_{\ge0}R≥0​ and the processes are real valued. Choices made explicit:

  • Assumption 2.3 for every player is a hypothesis of every theorem: the paper states it "throughout" (p. 8), and the proof of Theorem 3.3 uses Propositions 2.8 and 2.9, which need it. Its constants κmax⁡,η⋆,λ⋆,∥η∥\kappa_{\max},\eta_\star,\lambda_\star,\|\eta\|κmax​,η⋆​,λ⋆​,∥η∥ are essential bounds over [0,T]×Ω[0,T]\times\Omega[0,T]×Ω; "1/λ,1/η∈L∞1/\lambda,1/\eta\in L^\infty1/λ,1/η∈L∞" is a positive essential lower bound.
  • The equilibrium processes (Xi,Yi,Zi)(X^i,Y^i,Z^i)(Xi,Yi,Zi) are hypotheses: solutions of (2.3) for player iii's data in the class of Theorem 2.4. ξ∗,i\xi^{*,i}ξ∗,i is defined as Yi/(2ηi)Y^i/(2\eta^i)Yi/(2ηi), never through ϕ\phiϕ.
  • Conditioning on Xi=xi\mathcal X^i=x^iXi=xi is conditioning on σ(Xi)\sigma(\mathcal X^i)σ(Xi); every conclusion holds almost surely, i.e. for ν\nuν-a.e. xix^ixi. "ψ≤M\psi\le Mψ≤M" is the a.s. inequality of conditional second moments, and MMM is assumed measurable.
  • ggg is quantified before NNN and iii. A statement in which ggg may depend on NNN is trivially true and is ruled out.
  • Filtrations are augmented by null sets. Each conditional expectation E[ ⋅∣Ft0]\mathbb E[\,\cdot\mid\mathcal F^0_t]E[⋅∣Ft0​] is evaluated through a progressive version of an integrable argument. BSDEs on [0,T)[0,T)[0,T) are imposed on every [0,τ][0,\tau][0,τ], τ<T\tau<Tτ<T.
  • Lemma 3.2's path spaces carry the product σ-algebra; its identities hold for each ttt almost surely.
  • The paper's bound on I2I_2I2​ is stated for ∣I2∣|I_2|∣I2​∣, which is what its Cauchy–Schwarz step gives and what the proof needs.

The development reuses the Itô-calculus definitions of Peng1990.SMP.Stochastic (standard Brownian motion, LF2L^2_{\mathbb F}LF2​, Itô integrals, BSDEs). Contributions useful beyond this mission: conditional independence given a common noise for functionals of independent inputs, a Yamada–Watanabe argument for FBSDEs, and conditional Cauchy–Schwarz bounds for time integrals. Proofs of any milestone, and of the facts from §2 they rely on, are welcome.

Selected references

  • G. Fu, P. Graewe, U. Horst, A. Popier, A Mean Field Game of Optimal Portfolio Liquidation, arXiv:1804.04911v3, 2021; Math. Oper. Res. 46(4), 2021. https://arxiv.org/abs/1804.04911
  • R. Almgren, N. Chriss, Optimal execution of portfolio transactions, J. Risk 3(2), 2001. https://doi.org/10.21314/JOR.2001.041
  • M. Huang, R. P. Malhamé, P. E. Caines, Large population stochastic dynamic games: closed-loop McKean–Vlasov systems and the Nash certainty equivalence principle, Commun. Inf. Syst. 6(3), 2006. https://doi.org/10.4310/CIS.2006.v6.n3.a5
  • J.-M. Lasry, P.-L. Lions, Mean field games, Jpn. J. Math. 2, 2007. https://doi.org/10.1007/s11537-007-0657-8
  • R. Carmona, F. Delarue, Probabilistic analysis of mean-field games, SIAM J. Control Optim. 51(4), 2013. https://doi.org/10.1137/120883499
  • S. Peng, A general stochastic maximum principle for optimal control problems, SIAM J. Control Optim. 28(4), 1990. https://doi.org/10.1137/0328054
10 thms1 active userReviewed
Partial Differential EquationsStochastic Systems·Captain: mikedeng1

On Viscosity Solutions of Path Dependent PDEs: Comparison Principle for Viscosity Sub- and Supersolutions of Semilinear PPDEs, and u^0 from the BSDE Is the Unique Viscosity SolutionResearch Paper

Motivation

Many quantities in stochastic control, mathematical finance and stochastic differential games depend on the whole past of a Brownian path rather than on its current position: the price of an Asian or lookback option, the value of a control problem with delay, the solution of a non-Markovian backward stochastic differential equation (BSDE). For Markovian problems the value is a function v(t,x)v(t,x)v(t,x) and solves a parabolic PDE, and the theory of viscosity solutions (Crandall, Ishii and Lions) gives existence, uniqueness and stability without any smoothness. For path-dependent problems the value is a functional u(t,ω)u(t,\omega)u(t,ω) of the path, and the corresponding equation is a path-dependent PDE (PPDE), written with the horizontal and vertical derivatives introduced by Dupire (SSRN 1435551) and developed into a functional Itô calculus by Cont and Fournié (arXiv:1002.2446). Classical solutions of PPDEs rarely exist, so a weak notion is needed.

Timeline:

  • 1990. Pardoux and Peng prove well-posedness of BSDEs with Lipschitz generator (doi:10.1016/0167-6911(90)90082-6); the BSDE value is the natural candidate solution of a semilinear PPDE.
  • 2009–2013. Dupire, and Cont and Fournié, define pathwise derivatives and prove a functional Itô formula; Peng asks for a viscosity theory of PPDEs (ICM 2010).
  • 2011–2014. Ekren, Keller, Touzi and Zhang (arXiv:1109.5971, Ann. Probab. 42 (2014) 204–236) define viscosity solutions of semilinear PPDEs through an optimal stopping problem under a nonlinear expectation and prove existence, stability, comparison and uniqueness. Fully nonlinear PPDEs follow in Ekren, Touzi and Zhang (arXiv:1210.0006).

Setting

Fix d≥1d \ge 1d≥1 and T>0T>0T>0. Let Ω\OmegaΩ be the space of continuous paths ω:[0,T]→Rd\omega:[0,T]\to\mathbb R^dω:[0,T]→Rd with ω0=0\omega_0 = 0ω0​=0, BBB the canonical process, F\mathbb FF the filtration it generates, P0P_0P0​ the Wiener measure and Λ=[0,T]×Ω\Lambda = [0,T]\times\OmegaΛ=[0,T]×Ω. On Λ\LambdaΛ the pseudometric is d∞((t,ω),(t′,ω′))=∣t−t′∣+sup⁡s≤T∣ωt∧s−ωt′∧s′∣d_\infty((t,\omega),(t',\omega')) = |t-t'| + \sup_{s\le T}|\omega_{t\wedge s}-\omega'_{t'\wedge s}|d∞​((t,ω),(t′,ω′))=∣t−t′∣+sups≤T​∣ωt∧s​−ωt′∧s′​∣. For t≤Tt\le Tt≤T, Ωt\Omega^tΩt is the space of continuous paths on [t,T][t,T][t,T] vanishing at ttt, with Wiener measure P0tP^t_0P0t​, and Ω^t\hat\Omega^tΩ^t the space of càdlàg paths on [t,T][t,T][t,T]. The concatenation ω⊗tω′\omega\otimes_t\omega'ω⊗t​ω′ follows ω\omegaω up to ttt and then ωt+ω′\omega_t + \omega'ωt​+ω′, and ut,ω(s,ω′)=u(s,ω⊗tω′)u^{t,\omega}(s,\omega') = u(s,\omega\otimes_t\omega')ut,ω(s,ω′)=u(s,ω⊗t​ω′).

A functional u^\hat uu^ on [t,T]×Ω^t[t,T]\times\hat\Omega^t[t,T]×Ω^t has the Dupire derivatives ∂ωu^\partial_\omega\hat u∂ω​u^, the derivative under a bump h1[s,T]eih\mathbf 1_{[s,T]}e_ih1[s,T]​ei​ of the path, and ∂tu^\partial_t\hat u∂t​u^, the right derivative in time along the stopped path. Cb1,2(Λt)C^{1,2}_b(\Lambda^t)Cb1,2​(Λt) is the class of functionals that agree on continuous paths with some u^\hat uu^ whose derivatives ∂tu^\partial_t\hat u∂t​u^, ∂ωu^\partial_\omega\hat u∂ω​u^, ∂ωω2u^\partial^2_{\omega\omega}\hat u∂ωω2​u^ exist and are bounded and d∞d_\inftyd∞​-continuous.

The equation is the semilinear PPDE

(Lu)(t,ω):=−∂tu−12tr⁡(∂ωω2u)−f(t,ω,u,∂ωu)=0,0≤t<T.(\mathcal L u)(t,\omega) := -\partial_t u - \tfrac12\operatorname{tr}\big(\partial^2_{\omega\omega}u\big) - f\big(t,\omega,u,\partial_\omega u\big) = 0,\qquad 0\le t<T.(Lu)(t,ω):=−∂t​u−21​tr(∂ωω2​u)−f(t,ω,u,∂ω​u)=0,0≤t<T.

For L≥0L\ge0L≥0, E‾tL\underline{\mathcal E}^L_tE​tL​ and E‾tL\overline{\mathcal E}^L_tEtL​ are the infimum and supremum of expectations under the Girsanov measures Pt,βP^{t,\beta}Pt,β, ∣βi∣≤L|\beta^i|\le L∣βi∣≤L. A bounded d∞d_\inftyd∞​-continuous uuu is a viscosity LLL-subsolution if (Lt,ωφ)(t,0)≤0(\mathcal L^{t,\omega}\varphi)(t,\mathbf 0)\le0(Lt,ωφ)(t,0)≤0 at every (t,ω)(t,\omega)(t,ω) with t<Tt<Tt<T for every test function φ∈Cb1,2(Λt)\varphi\in C^{1,2}_b(\Lambda^t)φ∈Cb1,2​(Λt) that touches ut,ωu^{t,\omega}ut,ω from above in the sense

0=φ(t,0)−u(t,ω)=min⁡τ~∈TtE‾tL[(φ−ut,ω)τ~∧τ]for some τ∈T+t,0 = \varphi(t,\mathbf 0)-u(t,\omega) = \min_{\tilde\tau\in\mathcal T^t}\underline{\mathcal E}^L_t\big[(\varphi-u^{t,\omega})_{\tilde\tau\wedge\tau}\big]\quad\text{for some }\tau\in\mathcal T^t_+ ,0=φ(t,0)−u(t,ω)=τ~∈Ttmin​E​tL​[(φ−ut,ω)τ~∧τ​]for some τ∈T+t​,

where Tt\mathcal T^tTt is a class of stopping times with open level sets. Supersolutions use max⁡\maxmax and E‾tL\overline{\mathcal E}^L_tEtL​. A viscosity subsolution is an LLL-subsolution for some LLL, the same LLL at every point. The candidate solution is u0(t,ω)=Yt0,t,ωu^0(t,\omega) = Y^{0,t,\omega}_tu0(t,ω)=Yt0,t,ω​, where Y0,t,ωY^{0,t,\omega}Y0,t,ω solves the BSDE with terminal value gt,ωg^{t,\omega}gt,ω and generator ft,ωf^{t,\omega}ft,ω under P0tP^t_0P0t​.

Formalization targets

Goal: Theorem 4.6

Under Assumption 4.2 (fff bounded, progressively measurable, continuous in ttt, uniformly continuous in ω\omegaω, Lipschitz in (y,z)(y,z)(y,z); ggg bounded and uniformly continuous) and Assumption 4.4 (an extension f^\hat ff^​ of fff to càdlàg paths, continuous and Lipschitz), for every viscosity subsolution u1u^1u1 and supersolution u2u^2u2,

u1(T,⋅)≤g≤u2(T,⋅) ⟹ u1≤u2  on Λ,u^1(T,\cdot)\le g\le u^2(T,\cdot)\ \Longrightarrow\ u^1\le u^2\ \text{ on }\Lambda,u1(T,⋅)≤g≤u2(T,⋅) ⟹ u1≤u2  on Λ,

and consequently u0u^0u0 is the unique viscosity solution with terminal condition ggg.

Milestones

In the order the proof uses them: Example 2.5 (hitting times lie in T\mathcal TT); Proposition 5.4 (u0u^0u0 is uniformly continuous); Theorem 4.3 (u0u^0u0 is a viscosity solution); Lemma 5.7 (partial comparison when one of u1,u2u^1,u^2u1,u2 is smooth) and its form under the weaker condition (5.11); the bound u‾≤u0≤uˉ\underline u\le u^0\le\bar uu​≤u0≤uˉ of (6.3) between the Perron envelopes

uˉ(t,ω)=inf⁡{φ(t,0):φ∈D‾(t,ω)},u‾(t,ω)=sup⁡{φ(t,0):φ∈D‾(t,ω)};\bar u(t,\omega) = \inf\{\varphi(t,\mathbf 0):\varphi\in\overline{\mathcal D}(t,\omega)\},\qquad \underline u(t,\omega) = \sup\{\varphi(t,\mathbf 0):\varphi\in\underline{\mathcal D}(t,\omega)\};uˉ(t,ω)=inf{φ(t,0):φ∈D(t,ω)},u​(t,ω)=sup{φ(t,0):φ∈D​(t,ω)};

Lemma 6.3 (classical solutions built from an ODE with random coefficients); and Theorem 6.1, u‾=uˉ\underline u = \bar uu​=uˉ.

Significance

Theorem 4.6 makes the definition of the paper a well-posed one: existence (Theorem 4.3) without uniqueness would allow any number of solutions, and the comparison principle is what identifies the BSDE value as the solution. It gives a path-dependent nonlinear Feynman–Kac formula, characterising non-Markovian BSDEs analytically, and it is the template on which the fully nonlinear theory, path-dependent games and non-Markovian control were later built.

The result is proved, in this paper, and the proof is not known to have been machine-checked. The formalization contributes a precise Lean account of the definitions (Dupire derivatives through extensions to càdlàg paths, the stopping-time class Tt\mathcal T^tTt, Girsanov measures, the piecewise class Cˉ1,2\bar C^{1,2}Cˉ1,2) and a checked proof of comparison. Pieces of independent value are a functional Itô formula for Cb1,2C^{1,2}_bCb1,2​ functionals, Girsanov's theorem on the canonical space, comparison for BSDEs, and optimal stopping under the nonlinear expectation E‾L\underline{\mathcal E}^LE​L.

Difficulty

The classical proof of comparison doubles variables and uses the Crandall–Ishii lemma, which rests on local compactness of the state space; Ω\OmegaΩ is infinite-dimensional and not locally compact, so that route fails. The paper instead proves comparison when one side is smooth (Lemma 5.7), and then shows that the Perron envelopes u‾\underline uu​ and uˉ\bar uuˉ, built from piecewise-smooth super- and subsolutions, coincide. That equality needs an approximation of an arbitrary square-integrable BSDE integrand ZZZ by processes that are piecewise differentiable in time with uniformly continuous derivative, so that the resulting functionals lie in Cˉ1,2\bar C^{1,2}Cˉ1,2 (Lemmas 6.3–6.5). The partial comparison relies on optimal stopping under E‾L\underline{\mathcal E}^LE​L, which the paper treats with heuristic arguments in Remark 3.11 and references to later work, so that step will need its own development.

Formalization scope

Time is [0,∞)[0,\infty)[0,∞) with a fixed horizon TTT; paths take values in Euclidean Rd\mathbb R^dRd and are constant after TTT. Ωt\Omega^tΩt is encoded as continuous paths vanishing on [0,t][0,t][0,t] and Ω^t\hat\Omega^tΩ^t as càdlàg paths constant on [0,t][0,t][0,t], so Ω=Ω0\Omega = \Omega^0Ω=Ω0. Filtrations are the raw ones generated by the canonical process. The Wiener measure is a hypothesis on finite-dimensional laws, and P0tP^t_0P0t​ is its image under the shift. The stochastic integral and BSDE solutions are those of the platform definition Peng1990.SMP.Stochastic.

Conventions and readings, all disclosed in the items:

  • the standing assumptions are Assumptions 4.2 and 4.4 as printed; "continuous in ttt" is for each fixed (ω,y,z)(\omega,y,z)(ω,y,z), "uniformly continuous in ω\omegaω" is one modulus uniform in (t,y,z)(t,y,z)(t,y,z), and the Lipschitz bound uses ∣y−y′∣+∣z−z′∣|y-y'|+|z-z'|∣y−y′∣+∣z−z′∣;
  • Cb1,2C^{1,2}_bCb1,2​ membership is witnessed by an extension to càdlàg paths together with its derivatives, and every statement involving derivatives quantifies over all such extensions; by Theorem 2.4(i) of the paper they agree on Λ\LambdaΛ;
  • the min⁡\minmin/max⁡\maxmax in the test sets is attained at τ~≡t\tilde\tau\equiv tτ~≡t, so the test condition is written as "every Girsanov expectation is ≥0\ge0≥0" (resp. ≤0\le0≤0), with integrability required; no real infimum or supremum is formed, and Theorem 6.1 is stated with greatest lower and least upper bounds;
  • u0u^0u0 is characterised by the BSDE, not constructed: the statements quantify over every uuu satisfying the characterisation, which by Pardoux–Peng holds for exactly one uuu;
  • in (6.2) and (5.11) the sign of the operator is required P0tP^t_0P0t​-a.s. for s∈[t,T)s\in[t,T)s∈[t,T);
  • Lemma 6.3 adds Assumption 4.4, which the page omits although (6.8) uses f^\hat ff^​, and reads "θ=θ^\theta=\hat\thetaθ=θ^ in Λ\LambdaΛ" as Λt\Lambda^tΛt.

No trivializing reading is available: the test functions are exactly the Cb1,2(Λt)C^{1,2}_b(\Lambda^t)Cb1,2​(Λt) functionals satisfying (3.6), the measures exactly the Girsanov measures with ∣βi∣≤L|\beta^i|\le L∣βi∣≤L, and the stopping times exactly Tt\mathcal T^tTt. A test set that is too large makes sub- and supersolutions scarce and the comparison principle weaker, a test set that is too small makes them abundant and the principle false, and neither is the case here.

The source is arXiv:1109.5971v2, the IMS electronic reprint of the Annals of Probability article; its printed page numbers equal the PDF's. Lemmas 6.4 and 6.5 (the approximation of ZZZ) are part of the proof but not stated as items. Contributions welcome: the functional Itô formula, Girsanov on Ωt\Omega^tΩt, BSDE comparison and stability, and the optimal stopping theory under E‾L\underline{\mathcal E}^LE​L.

Selected references

  • I. Ekren, C. Keller, N. Touzi, J. Zhang, On viscosity solutions of path dependent PDEs, Ann. Probab. 42(1) (2014) 204–236. arXiv:1109.5971, doi:10.1214/12-AOP788
  • B. Dupire, Functional Itô calculus, Bloomberg Portfolio Research Paper 2009-04 (2009). SSRN 1435551
  • R. Cont, D.-A. Fournié, Functional Itô calculus and stochastic integral representation of martingales, Ann. Probab. 41(1) (2013) 109–133. arXiv:1002.2446
  • É. Pardoux, S. Peng, Adapted solution of a backward stochastic differential equation, Systems Control Lett. 14 (1990) 55–61. doi:10.1016/0167-6911(90)90082-6
  • I. Ekren, N. Touzi, J. Zhang, Viscosity solutions of fully nonlinear parabolic path dependent PDEs: Part I, Ann. Probab. 44(2) (2016) 1212–1253. arXiv:1210.0006
16 thms1 active userReviewed
Algorithmic Game TheoryControl Theory·Captain: mikedeng1

A Probabilistic Weak Formulation of Mean Field Games and Applications 3: Distributed Controls from a Mean Field Game Solution Form an ε_n-Nash Equilibrium of the n-Player Game, ε_n → 0Research Paper

Why approximate Nash equilibria of finite games

Mean field games (MFGs) were introduced by Lasry and Lions (Jpn. J. Math. 2007) and by Huang, Malhamé and Caines (Commun. Inf. Syst. 2006) as limits of stochastic differential games with many symmetric players whose interaction runs through the empirical distribution of their states. An MFG is a fixed point problem for one representative player facing a flow of measures, and it is much easier to analyse than an nnn-player game. The justification for studying it is a converse statement: a solution of the MFG should yield strategies that are nearly optimal for every player of the finite game when nnn is large. Results of this type were proved by Huang, Malhamé and Caines for linear-quadratic models and by Carmona and Delarue (SIAM J. Control Optim. 2013) in the strong formulation with Lipschitz data.

Carmona and Lacker (arXiv:1307.1152v2; Ann. Appl. Probab. 25(3), 2015) set up MFGs in a weak formulation: controls change the law of the state through a Girsanov density instead of entering the state equation. This allows measurable, path-dependent data and controls that need only be progressively measurable. Their Theorem 4.2 is the finite-player approximation in this generality. This mission formalizes it.

Setting

Let C=C([0,T];Rd)\mathcal C=C([0,T];\mathbb R^d)C=C([0,T];Rd) with the sup norm, and fix a measurable weight ψ:C→[1,∞)\psi:\mathcal C\to[1,\infty)ψ:C→[1,∞). Pψ(C)\mathcal P_\psi(\mathcal C)Pψ​(C) is the set of probability measures μ\muμ on C\mathcal CC with ∫ψ dμ<∞\int\psi\,d\mu<\infty∫ψdμ<∞, carrying the topology τψ\tau_\psiτψ​: the weakest topology making μ↦∫f dμ\mu\mapsto\int f\,d\muμ↦∫fdμ continuous for every measurable fff with ∣f∣≤c ψ|f|\le c\,\psi∣f∣≤cψ. The control set AAA is a compact convex subset of a normed space, and P(A)\mathcal P(A)P(A) carries the weak topology.

The data are a volatility σ(t,x)\sigma(t,x)σ(t,x), a drift b(t,x,μ,a)b(t,x,\mu,a)b(t,x,μ,a), a running reward f(t,x,μ,q,a)f(t,x,\mu,q,a)f(t,x,μ,q,a) and a terminal reward g(x,μ)g(x,\mu)g(x,μ), where x∈Cx\in\mathcal Cx∈C is a whole path, μ∈Pψ(C)\mu\in\mathcal P_\psi(\mathcal C)μ∈Pψ​(C) and q∈P(A)q\in\mathcal P(A)q∈P(A). On a probability space with an initial value ξ∼λ0\xi\sim\lambda_0ξ∼λ0​ and an independent Wiener process WWW, let XXX solve dXt=σ(t,X) dWtdX_t=\sigma(t,X)\,dW_tdXt​=σ(t,X)dWt​, X0=ξX_0=\xiX0​=ξ. A control α\alphaα (an AAA-valued progressive process) and a measure μ\muμ define a new probability Pμ,αP^{\mu,\alpha}Pμ,α with density

dPμ,αdP=E(∫0⋅σ−1b(t,X,μ,αt) dWt)T,\frac{dP^{\mu,\alpha}}{dP}=\mathcal E\Big(\int_0^\cdot\sigma^{-1}b(t,X,\mu,\alpha_t)\,dW_t\Big)_T,dPdPμ,α​=E(∫0⋅​σ−1b(t,X,μ,αt​)dWt​)T​,

under which XXX has drift b(t,X,μ,αt)b(t,X,\mu,\alpha_t)b(t,X,μ,αt​). The reward is Jμ,q(α)=Eμ,α[∫0Tf(t,X,μ,qt,αt) dt+g(X,μ)]J^{\mu,q}(\alpha)=\mathbb E^{\mu,\alpha}[\int_0^Tf(t,X,\mu,q_t,\alpha_t)\,dt+g(X,\mu)]Jμ,q(α)=Eμ,α[∫0T​f(t,X,μ,qt​,αt​)dt+g(X,μ)]. A pair (μ^,q^)(\hat\mu,\hat q)(μ^​,q^​) is a solution of the MFG (Definition 3.4) if some α^\hat\alphaα^ maximizes Jμ^,q^J^{\hat\mu,\hat q}Jμ^​,q^​ and reproduces the input: Pμ^,α^∘X−1=μ^P^{\hat\mu,\hat\alpha}\circ X^{-1}=\hat\muPμ^​,α^∘X−1=μ^​ and Pμ^,α^∘α^t−1=q^tP^{\hat\mu,\hat\alpha}\circ\hat\alpha_t^{-1}=\hat q_tPμ^​,α^∘α^t−1​=q^​t​ for a.e. ttt. Under the standing assumptions the optimal control is a function α^(t,X)\hat\alpha(t,X)α^(t,X) of the path, the closed-loop control.

The nnn-player game. On a probability space with independent Wiener processes WiW^iWi and i.i.d. initial values ξi∼λ0\xi^i\sim\lambda_0ξi∼λ0​, let XiX^iXi solve dXti=b(t,Xi,α^(t,Xi)) dt+σ(t,Xi) dWtidX^i_t=b(t,X^i,\hat\alpha(t,X^i))\,dt+\sigma(t,X^i)\,dW^i_tdXti​=b(t,Xi,α^(t,Xi))dt+σ(t,Xi)dWti​ (the drift has no mean field term under (F.1)). The distributed controls are αti=α^(t,Xi)\alpha^i_t=\hat\alpha(t,X^i)αti​=α^(t,Xi): each player uses only their own state. A deviation β∈An\beta\in\mathbb A_nβ∈An​ is any process that is progressively measurable for the filtration Fn\mathbb F^nFn of all nnn states (full information). A profile β=(β1,…,βn)\beta=(\beta^1,\dots,\beta^n)β=(β1,…,βn) changes the probability to Pn(β)P_n(\beta)Pn​(β), with density the Doléans exponential of ∑i∫(σ−1b(t,Xi,βti)−σ−1b(t,Xi,αti)) dWti\sum_i\int(\sigma^{-1}b(t,X^i,\beta^i_t)-\sigma^{-1}b(t,X^i,\alpha^i_t))\,dW^i_t∑i​∫(σ−1b(t,Xi,βti​)−σ−1b(t,Xi,αti​))dWti​. Player iii then receives

Jn,i(β)=EPn(β)[∫0Tf(t,Xi,μn,qn(βt),βti) dt+g(Xi,μn)],J_{n,i}(\beta)=\mathbb E^{P_n(\beta)}\Big[\int_0^Tf\big(t,X^i,\mu^n,q^n(\beta_t),\beta^i_t\big)\,dt+g(X^i,\mu^n)\Big],Jn,i​(β)=EPn​(β)[∫0T​f(t,Xi,μn,qn(βt​),βti​)dt+g(Xi,μn)],

with μn=1n∑jδXj\mu^n=\frac1n\sum_j\delta_{X^j}μn=n1​∑j​δXj​ and qn(βt)=1n∑jδβtjq^n(\beta_t)=\frac1n\sum_j\delta_{\beta^j_t}qn(βt​)=n1​∑j​δβtj​​.

Formalization targets

Goal: Theorem 4.2 (p. 13)

Under (S), (C) and (F), there is a sequence ϵn≥0\epsilon_n\ge0ϵn​≥0, ϵn→0\epsilon_n\to0ϵn​→0, such that for all n≥1n\ge1n≥1, 1≤i≤n1\le i\le n1≤i≤n and β∈An\beta\in\mathbb A_nβ∈An​,

Jn,i(α1,…,αi−1,β,αi+1,…,αn)≤Jn,i(α1,…,αn)+ϵn.J_{n,i}(\alpha^1,\dots,\alpha^{i-1},\beta,\alpha^{i+1},\dots,\alpha^n)\le J_{n,i}(\alpha^1,\dots,\alpha^n)+\epsilon_n.Jn,i​(α1,…,αi−1,β,αi+1,…,αn)≤Jn,i​(α1,…,αn)+ϵn​.

No rate is claimed; the theorem asserts only that the gain from deviating vanishes uniformly over players and deviations.

Milestones

  1. Lemma 5.6 (p. 16): for compact KKK, joint continuity of G:E×K→RG:E\times K\to\mathbb RG:E×K→R at {x0}×K\{x_0\}\times K{x0​}×K is equivalent to continuity of G(x0,⋅)G(x_0,\cdot)G(x0​,⋅) together with continuity at x0x_0x0​ of x↦sup⁡y∈K∣G(x,y)−G(x0,y)∣x\mapsto\sup_{y\in K}|G(x,y)-G(x_0,y)|x↦supy∈K​∣G(x,y)−G(x0​,y)∣.
  2. Lemma 8.1 (p. 32): for empirically measurable FFF with ∣F(x,μ)∣≤c(ψ(x)+∫ψ dμ)|F(x,\mu)|\le c(\psi(x)+\int\psi\,d\mu)∣F(x,μ)∣≤c(ψ(x)+∫ψdμ) and F(x,⋅)F(x,\cdot)F(x,⋅) continuous at μ^\hat\muμ^​, E∣F(Xi,μn)−F(Xi,μ^)∣p→0\mathbb E|F(X^i,\mu^n)-F(X^i,\hat\mu)|^p\to0E∣F(Xi,μn)−F(Xi,μ^​)∣p→0 for p∈[1,2)p\in[1,2)p∈[1,2).
  3. The LpL^pLp bound (p. 33): {dPn(βα)/dP:β∈An, n≥1}\{dP_n(\beta^\alpha)/dP:\beta\in\mathbb A_n,\ n\ge1\}{dPn​(βα)/dP:β∈An​, n≥1} is bounded in LpL^pLp for each p≥1p\ge1p≥1, where βα=(β,α2,…,αn)\beta^\alpha=(\beta,\alpha^2,\dots,\alpha^n)βα=(β,α2,…,αn).
  4. Lemma 8.2 (p. 32): sup⁡β∈An∣Jn,1(βα)−Jn′(β)∣→0\sup_{\beta\in\mathbb A_n}|J_{n,1}(\beta^\alpha)-J'_n(\beta)|\to0supβ∈An​​∣Jn,1​(βα)−Jn′​(β)∣→0, where Jn′(β)=EPn(βα)[∫0Tf(t,X1,μ^,q^t,βt) dt+g(X1,μ^)]J'_n(\beta)=\mathbb E^{P_n(\beta^\alpha)}[\int_0^Tf(t,X^1,\hat\mu,\hat q_t,\beta_t)\,dt+g(X^1,\hat\mu)]Jn′​(β)=EPn​(βα)[∫0T​f(t,X1,μ^​,q^​t​,βt​)dt+g(X1,μ^​)].
  5. Lemma 8.3 (p. 33): Jn′(α1)≥Jn′(β)J'_n(\alpha^1)\ge J'_n(\beta)Jn′​(α1)≥Jn′​(β) for every β∈An\beta\in\mathbb A_nβ∈An​.

Significance

Theorem 4.2 states the sense in which an MFG solution solves the finite game. It covers path-dependent and merely measurable coefficients, interaction through the law of the controls, and full-information deviations against distributed strategies. In the paper it underlies the applications of §6: the price impact model, where Proposition 6.1 adds the rate C/nC/\sqrt nC/n​, and the flocking model. The result is qualitative: it gives no rate in general.

The result is proved in the paper. No machine-checked proof of it or of its lemmas exists on the platform. The mission produces a formal statement layer for weak-formulation MFGs: path space, Pψ\mathcal P_\psiPψ​ with τψ\tau_\psiτψ​, Girsanov densities over Itô versions, Definition 3.4, and the nnn-player game. It then asks for the formal proof of the theorem. Missions 1 and 2 of this series (existence and uniqueness of MFG solutions) use the same model encoding. The strong-formulation result of Carmona and Delarue is a separate statement with a separate model and is not part of this mission.

Difficulty

The obvious route replaces μn\mu^nμn by μ^\hat\muμ^​ and qn(βt)q^n(\beta_t)qn(βt​) by q^t\hat q_tq^​t​ in Jn,iJ_{n,i}Jn,i​ and appeals to the law of large numbers. This fails for two reasons. First, the expectation is taken under Pn(β)P_n(\beta)Pn​(β), which depends on the deviation β\betaβ, and β\betaβ may depend on all players' states. The convergence therefore has to be uniform over a class of measures and requires uniform integrability of the densities. Second, τψ\tau_\psiτψ​ is neither metrizable nor separable. Continuity in μ\muμ does not reduce to sequences, and dominated convergence does not hold for nets, so the almost sure convergence of empirical measures does not by itself transfer to the rewards. The remaining step asks whether full information helps the deviating player against the limiting environment. It is not a direct consequence of the optimality of α^\hat\alphaα^ in the mean field problem, which is posed over a smaller filtration.

Formalization scope

  • Paths and time. States are Fin d → ℝ. C\mathcal CC is C(Set.Icc 0 T, Fin d → ℝ) with its Borel σ-field. Time is ℝ≥0; only [0,T][0,T][0,T] matters.
  • Measures and topologies. Pψ(C)\mathcal P_\psi(\mathcal C)Pψ​(C) is a structure carrying τψ\tau_\psiτψ​ as its only topology. P(A)\mathcal P(A)P(A) is Mathlib's ProbabilityMeasure A with the weak topology and its Borel σ-field. Progressive measurability uses the canonical filtration on C\mathcal CC.
  • Base space. It is abstract: any probability space with ξ\xiξ and an independent Brownian motion WWW. The canonical space is an instance. Filtrations are augmented by the measurable null sets.
  • Stochastic integrals. All stochastic integrals come from the published Peng1990.SMP.Stochastic L2L^2L2 Itô layer. "Strong solution" therefore includes square integrability, E∫0T∥σ(t,X)∥2dt<∞\mathbb E\int_0^T\|\sigma(t,X)\|^2dt<\inftyE∫0T​∥σ(t,X)∥2dt<∞ and sup⁡tE∣Xt−ξ∣2<∞\sup_t\mathbb E|X_t-\xi|^2<\inftysupt​E∣Xt​−ξ∣2<∞.
  • Assumptions (S). Nonsingularity of σ\sigmaσ is encoded as invertibility of det⁡σ\det\sigmadetσ. The "increasing" ρ\rhoρ of (S.4) is encoded as monotone.
  • Densities and values. A density is a relation over versions of the Itô integrals. Every statement asserts that a version exists and holds for every version, so no statement holds because the set of versions is empty. Jn,iJ_{n,i}Jn,i​ and Jn′J'_nJn′​ are computed as EP[D(⋯ )]\mathbb E^P[D(\cdots)]EP[D(⋯)] for a version DDD. Suprema over An\mathbb A_nAn​ are unfolded into ∀ε ∃N\forall\varepsilon\,\exists N∀ε∃N form, never written as real ⨆.
  • Players. Players are indexed from 000, so player 1 is index 000.
  • Hypotheses. (S), (C), (F), the fixed solution with its closed-loop control and the game space are bundled into one structure.

Two readings of the goal would make it trivial, and the statement excludes both. If ϵ\epsilonϵ were allowed to depend on iii or β\betaβ, the bound would carry no content. If the deviation were evaluated under the undeviated measure PPP instead of Pn(β)P_n(\beta)Pn​(β), the game would be a different one. (F.4) is genuine continuity, not the sequential continuity of (E).

A complete development needs:

  • the strong law of large numbers for i.i.d. path-valued variables tested against BψB_\psiBψ​ functions;
  • LpL^pLp bounds for Doléans exponentials of bounded integrands;
  • Girsanov's theorem for the L2L^2L2 Itô layer;
  • comparison for BSDEs (Pardoux–Peng).

The Girsanov and BSDE comparison results are reusable well beyond this mission and are welcome as separate contributions, as are proofs of Lemma 5.6 and of the LpL^pLp bound.

Selected references

  • R. Carmona, D. Lacker, A probabilistic weak formulation of mean field games and applications, arXiv:1307.1152v2, 2014; Ann. Appl. Probab. 25(3), 2015. https://arxiv.org/abs/1307.1152v2, https://doi.org/10.1214/14-AAP1020
  • J.-M. Lasry, P.-L. Lions, Mean field games, Jpn. J. Math. 2, 2007. https://doi.org/10.1007/s11537-007-0657-8
  • M. Huang, R. Malhamé, P. Caines, Large population stochastic dynamic games: closed-loop McKean–Vlasov systems and the Nash certainty equivalence principle, Commun. Inf. Syst. 6(3), 2006. https://doi.org/10.4310/CIS.2006.v6.n3.a5
  • R. Carmona, F. Delarue, Probabilistic analysis of mean-field games, SIAM J. Control Optim. 51(4), 2013. https://doi.org/10.1137/120883499
  • É. Pardoux, S. Peng, Adapted solution of a backward stochastic differential equation, Systems Control Lett. 14, 1990. https://doi.org/10.1016/0167-6911(90)90082-6
14 thms1 active userReviewed
Information TheoryMachine LearningStatistics·Captain: mikedeng1

Information-Theoretic Analysis of Generalization Capability of Learning Algorithms II: n ≥ (8σ²/α²)(ε/β + log(2/β)) Samples Give |L_μ(W) − L_S(W)| ≤ α with Probability at Least 1 − β (Theorem 3)Research Paper

Motivation

A learning algorithm picks a hypothesis WWW from a dataset SSS; its generalization error Lμ(W)−LS(W)L_\mu(W) - L_S(W)Lμ​(W)−LS​(W) measures how far the empirical risk the algorithm sees is from the population risk it is judged by. Classical bounds control this error through the complexity of the hypothesis space (VC dimension, Rademacher complexity) or through the algorithm's stability. An information-theoretic approach instead controls it through how much the output reveals about the data. Russo and Zou (arXiv:1511.05219) introduced this view for adaptive data analysis, and Xu and Raginsky (arXiv:1705.07809) turned it into a general framework for learning algorithms; the framework underlies a large later literature on mutual-information and conditional-mutual-information generalization bounds.

Expected-value bounds of the form ∣E[Lμ(W)−LS(W)]∣≤2σ2I/n|\mathbb E[L_\mu(W) - L_S(W)]| \le \sqrt{2\sigma^2 I/n}∣E[Lμ​(W)−LS​(W)]∣≤2σ2I/n​ say nothing about a single run of the algorithm. A learner usually needs the error to be small with high probability. This mission formalizes Xu and Raginsky's high-probability result, Theorem 3, which gives a sample size sufficient for ∣Lμ(W)−LS(W)∣≤α|L_\mu(W) - L_S(W)| \le \alpha∣Lμ​(W)−LS​(W)∣≤α with probability at least 1−β1-\beta1−β under an information budget.

Timeline. 2016: Russo and Zou bound the expected bias of adaptively selected statistics by mutual information, for finite hypothesis classes. 2016: Bassily, Nissim, Smith, Steinke, Stemmer and Ullman (arXiv:1511.02513) introduce the "monitor technique" to convert expected bounds into high-probability bounds for differentially private and stable algorithms. 2017: Xu and Raginsky adapt the monitor technique to mutual information, obtaining Theorem 3 and its byproduct Theorem 4.

Setting

There is an instance space Z\mathsf ZZ with an unknown probability measure μ\muμ, a hypothesis space W\mathsf WW, and a nonnegative loss ℓ:W×Z→R+\ell:\mathsf W\times\mathsf Z\to\mathbb R_+ℓ:W×Z→R+​. A learning algorithm is a Markov kernel PW∣SP_{W|S}PW∣S​: it receives a dataset S=(Z1,…,Zn)S = (Z_1,\dots,Z_n)S=(Z1​,…,Zn​) of nnn i.i.d. draws from μ\muμ and outputs a random W∈WW\in\mathsf WW∈W. The joint law of data and output is PS,W=μ⊗n⊗PW∣SP_{S,W} = \mu^{\otimes n}\otimes P_{W|S}PS,W​=μ⊗n⊗PW∣S​.

The population risk and empirical risk of www are

Lμ(w)=∫Zℓ(w,z) μ(dz),LS(w)=1n∑i=1nℓ(w,Zi).L_\mu(w) = \int_{\mathsf Z}\ell(w,z)\,\mu(dz),\qquad L_S(w) = \frac1n\sum_{i=1}^n \ell(w,Z_i).Lμ​(w)=∫Z​ℓ(w,z)μ(dz),LS​(w)=n1​i=1∑n​ℓ(w,Zi​).

The empirical-risk vector is ΛW(S)=(LS(w))w∈W\Lambda_{\mathsf W}(S) = (L_S(w))_{w\in\mathsf W}ΛW​(S)=(LS​(w))w∈W​. For random variables X,YX, YX,Y with joint law PX,YP_{X,Y}PX,Y​, the mutual information is I(X;Y)=D(PX,Y ∥ PX⊗PY)∈[0,∞]I(X;Y) = D(P_{X,Y}\,\|\,P_X\otimes P_Y)\in[0,\infty]I(X;Y)=D(PX,Y​∥PX​⊗PY​)∈[0,∞], the Kullback–Leibler divergence from the joint law to the product of the marginals. The algorithm's information budget is I(ΛW(S);W)≤εI(\Lambda_{\mathsf W}(S);W)\le\varepsilonI(ΛW​(S);W)≤ε.

A real random variable UUU is σ\sigmaσ-subgaussian if log⁡E[eλ(U−EU)]≤λ2σ2/2\log\mathbb E[e^{\lambda(U - \mathbb EU)}]\le\lambda^2\sigma^2/2logE[eλ(U−EU)]≤λ2σ2/2 for all λ∈R\lambda\in\mathbb Rλ∈R. The standing assumption is that ℓ(w,Z)\ell(w,Z)ℓ(w,Z), Z∼μZ\sim\muZ∼μ, is σ\sigmaσ-subgaussian for every www; a loss with values in [a,b][a,b][a,b] qualifies with σ=(b−a)/2\sigma = (b-a)/2σ=(b−a)/2.

Formalization targets

Goal: Theorem 3

If I(ΛW(S);W)≤εI(\Lambda_{\mathsf W}(S);W)\le\varepsilonI(ΛW​(S);W)≤ε, then for any α>0\alpha>0α>0 and 0<β≤10<\beta\le10<β≤1, every sample size

n ≥ 8σ2α2(εβ+log⁡2β)guaranteesP[∣Lμ(W)−LS(W)∣>α]≤β,n\ \ge\ \frac{8\sigma^2}{\alpha^2}\Big(\frac{\varepsilon}{\beta}+\log\frac2\beta\Big)\quad\text{guarantees}\quad \mathbb P\big[|L_\mu(W)-L_S(W)|>\alpha\big]\le\beta,n ≥ α28σ2​(βε​+logβ2​)guaranteesP[∣Lμ​(W)−LS​(W)∣>α]≤β,

the probability being under PS,WP_{S,W}PS,W​.

Milestones

  1. Lemma B.1 — mmm independent parallel runs: I(ΛW(S1),…,ΛW(Sm);Wm)≤mεI(\Lambda_{\mathsf W}(S_1),\dots,\Lambda_{\mathsf W}(S_m);W^m)\le m\varepsilonI(ΛW​(S1​),…,ΛW​(Sm​);Wm)≤mε.
  2. Lemma B.2 — for any algorithm outputting (W,T,R)∈W×[m]×{±1}(W,T,R)\in\mathsf W\times[m]\times\{\pm1\}(W,T,R)∈W×[m]×{±1} from mmm datasets with information at most ε\varepsilonε: E[R(LST(W)−Lμ(W))]≤2σ2ε/n\mathbb E[R(L_{S_T}(W)-L_\mu(W))]\le\sqrt{2\sigma^2\varepsilon/n}E[R(LST​​(W)−Lμ​(W))]≤2σ2ε/n​.
  3. The monitor's information (p. 12): the arg max selector (W∗,T∗,R∗)(W^*,T^*,R^*)(W∗,T∗,R∗) of one of the mmm runs satisfies I(ΛW(S1),…,ΛW(Sm);W∗,T∗,R∗)≤mε+log⁡(2m)I(\Lambda_{\mathsf W}(S_1),\dots,\Lambda_{\mathsf W}(S_m);W^*,T^*,R^*)\le m\varepsilon+\log(2m)I(ΛW​(S1​),…,ΛW​(Sm​);W∗,T∗,R∗)≤mε+log(2m).
  4. (B.7) — E[max⁡t∈[m]∣LSt(Wt)−Lμ(Wt)∣]≤2σ2n(mε+log⁡(2m))\mathbb E\big[\max_{t\in[m]}|L_{S_t}(W_t)-L_\mu(W_t)|\big]\le\sqrt{\tfrac{2\sigma^2}{n}(m\varepsilon+\log(2m))}E[maxt∈[m]​∣LSt​​(Wt​)−Lμ​(Wt​)∣]≤n2σ2​(mε+log(2m))​.
  5. Theorem 4 — the case m=1m=1m=1: E∣Lμ(W)−LS(W)∣≤2σ2n(ε+log⁡2)\mathbb E|L_\mu(W)-L_S(W)|\le\sqrt{\tfrac{2\sigma^2}{n}(\varepsilon+\log 2)}E∣Lμ​(W)−LS​(W)∣≤n2σ2​(ε+log2)​.

Significance

The result. Theorem 3 shows that a sample complexity polynomial in 1/α1/\alpha1/α and logarithmic in 1/β1/\beta1/β, the same order as for a data-independent hypothesis (where Chernoff–Hoeffding gives 2σ2α2log⁡2β\frac{2\sigma^2}{\alpha^2}\log\frac2\betaα22σ2​logβ2​), still suffices for a data-dependent one, provided the information budget ε\varepsilonε is small relative to β\betaβ. It requires only subgaussian losses, whereas the earlier high-probability bounds of differential privacy apply to bounded losses or bounded-difference functions. Since I(ΛW(S);W)≤I(S;W)I(\Lambda_{\mathsf W}(S);W)\le I(S;W)I(ΛW​(S);W)≤I(S;W), any algorithm with small input-output mutual information (the Gibbs algorithm, noisy empirical risk minimization, adaptive compositions of such) inherits the guarantee. Theorem 4 improves Russo and Zou's bound on the expected absolute error.

Formalizing it. The result is proved in the paper; to the best of current knowledge no machine-checked version exists. The mission produces a Lean statement of the theorem with the correct domain of validity (see the scope section), and its proof will require a reusable layer of measure-theoretic information theory: mutual information of joint laws, its additivity over independent pairs, the data-processing inequality, a bound by the logarithm of the number of values of a discrete variable, and the Donsker–Varadhan route from mutual information to expectations of subgaussian functions.

Difficulty

The obvious argument fails at the step from an expectation to a probability. Markov's inequality applied to Theorem 4 gives a sample size of order σ2(ε+log⁡2)/(α2β2)\sigma^2(\varepsilon+\log 2)/(\alpha^2\beta^2)σ2(ε+log2)/(α2β2), quadratic in 1/β1/\beta1/β. A union-bound or Chernoff argument per hypothesis does not apply, because WWW depends on SSS and the deviation at the selected hypothesis is not a sum of independent terms. The paper's route runs m≈1/βm\approx 1/\betam≈1/β independent copies and selects the worst one; the delicate part is bounding the information the selection itself adds, which needs the chain rule and data processing for mutual information on general (non-discrete) spaces, and an expectation bound that holds uniformly over every selection rule.

Formalization scope

Lean conventions:

  • Z\mathsf ZZ, W\mathsf WW are measurable spaces; datasets are Fin n → Z with law Measure.pi, taken from the published LearnStability.Characterization.Setting (sampleLaw, risk, empRisk); the algorithm is a Markov kernel; the joint law is sampleLaw μ n ⊗ₘ κ.
  • W\mathsf WW is countable with measurable singletons in the deviation bounds (Lemma B.2, (B.7), Theorems 3 and 4). The paper claims its results hold "even when W\mathsf WW is uncountably infinite" (p. 4). Under the product σ-algebra on RW\mathbb R^{\mathsf W}RW this fails: with Z=[0,1]\mathsf Z=[0,1]Z=[0,1], μ\muμ uniform, W=[0,1]n\mathsf W=[0,1]^nW=[0,1]n, ℓ(w,z)=1{z∈{w1,…,wn}}\ell(w,z)=\mathbf 1\{z\in\{w_1,\dots,w_n\}\}ℓ(w,z)=1{z∈{w1​,…,wn​}} and the algorithm W=SW=SW=S, one has I(ΛW(S);W)=0I(\Lambda_{\mathsf W}(S);W)=0I(ΛW​(S);W)=0 but ∣Lμ(W)−LS(W)∣=1|L_\mu(W)-L_S(W)|=1∣Lμ​(W)−LS​(W)∣=1 always. Lemma B.1 and the monitor's information bound hold for arbitrary measurable W\mathsf WW.
  • The loss is jointly measurable; n≥1n\ge1n≥1; ε≥0\varepsilon\ge0ε≥0; σ\sigmaσ-subgaussianity is Mathlib's HasSubgaussianMGF of the centred loss with variance proxy σ2\sigma^2σ2.
  • Mutual information is valued in [0,∞][0,\infty][0,∞]; the budget is I ≤ ENNReal.ofReal ε. Expectations of nonnegative quantities (∣⋅∣|\cdot|∣⋅∣, max⁡t\max_tmaxt​) are lower Lebesgue integrals; Lemma B.2's signed expectation is a Bochner integral whose integrand is integrable under the hypotheses.
  • [m][m][m] is Fin m; the sign r∈{±1}r\in\{\pm1\}r∈{±1} is a Bool read through sgn.
  • "A sample complexity of n=…n = \dotsn=…" is read as n≥…n\ge\dotsn≥…, as the proof requires.
  • The monitor of milestone 3 is a Markov kernel selecting (T∗,R∗)(T^*,R^*)(T∗,R∗) from all runs and choosing an arg max as in (B.3) almost surely; ties may be resolved randomly.

Two printed slips are corrected in the Lean and disclosed in the item notes: the proof of Lemma B.2 claims rLst(w)rL_{s_t}(w)rLst​​(w) is σ/n\sigma/\sqrt nσ/n​-subgaussian under the product of marginals (false; the centred version is), and (B.6) bounds the negative of the quantity in (B.4) ((B.7) is still correct).

The hypothesis is I(ΛW(S);W)≤εI(\Lambda_{\mathsf W}(S);W)\le\varepsilonI(ΛW​(S);W)≤ε, not the stronger I(S;W)≤εI(S;W)\le\varepsilonI(S;W)≤ε, and the goal mentions neither the parallel copies nor the monitor; a formalization that strengthened the hypothesis, dropped the measurability of the loss (so that the law of (ΛW(S),W)(\Lambda_{\mathsf W}(S),W)(ΛW​(S),W) collapses to the zero measure and every mutual information is 000), or allowed ε<0\varepsilon<0ε<0 would be a weaker, vacuous or false statement.

Welcome contributions: chain rule and data processing for klDiv-based mutual information, additivity over independent products, the log⁡k\log klogk bound for finitely-valued outputs, and the Donsker–Varadhan decoupling lemma; these are reusable across the series and beyond.

Selected references

  • A. Xu and M. Raginsky, Information-theoretic analysis of generalization capability of learning algorithms, NIPS 2017. arXiv:1705.07809v2
  • D. Russo and J. Zou, Controlling bias in adaptive data analysis using information theory, AISTATS 2016. arXiv:1511.05219
  • R. Bassily, K. Nissim, A. Smith, T. Steinke, U. Stemmer and J. Ullman, Algorithmic stability for adaptive data analysis, STOC 2016. arXiv:1511.02513
  • S. Shalev-Shwartz, O. Shamir, N. Srebro and K. Sridharan, Learnability, stability and uniform convergence, JMLR 11, 2010. jmlr.org
9 thms1 active userReviewed
Algorithmic Game TheoryStochastic Systems·Captain: mikedeng1

From the Master Equation to Mean Field Game Limit Theory: Large Deviations and Concentration of Measure 2: Nash Equilibrium Empirical Measure Flows Satisfy a Weak LDP Under Common NoiseResearch Paper

Motivation

A mean field game describes the Nash equilibria of nnn symmetric players whose states interact only through their empirical distribution, in the limit n→∞n\to\inftyn→∞. The law of large numbers for the equilibria — convergence of the empirical measure of the nnn-player equilibrium to the mean field equilibrium — was proved in the diffusion setting by Cardaliaguet, Delarue, Lasry and Lions through the master equation (arXiv:1509.02505), and refined by Delarue, Lacker and Ramanan into fluctuation estimates and a central limit theorem in a companion paper (Electron. J. Probab. 2019). The next question is the size of rare deviations: the probability that the nnn-player equilibrium empirical measure flow stays near a flow different from the mean field limit decays exponentially in nnn, and the exponent is a rate function. Delarue, Lacker and Ramanan (arXiv:1804.08550) prove such a large deviation principle (LDP), including the case of a common noise affecting all players, for which no LDP was previously known even for McKean–Vlasov particle systems.

Timeline. Dawson and Gärtner (1987) proved the LDP for the empirical measure flows of weakly interacting diffusions without common noise, with time-independent coefficients and deterministic initial states, using the action functional adopted here. Budhiraja, Dupuis and Fischer (Ann. Probab. 2012) gave a weak-convergence proof for the empirical measure of paths. For mean field games, master-equation methods gave limit theorems, including LDPs, for finite state spaces without common noise (Cecchin–Fischer, arXiv:1704.00984; Cecchin–Pelino, arXiv:1707.01819; Bayraktar–Cohen, arXiv:1707.02648), and Lacker and Ramanan proved an LDP for static games (arXiv:1702.02113). The present paper (arXiv v1, 2018; Ann. Probab. 2020) treats diffusion-based games, with common noise.

Setting

On a filtered probability space (Ω,F,F,P)(\Omega,\mathcal F,\mathbb F,\mathbb P)(Ω,F,F,P) live a d0d_0d0​-dimensional Brownian motion WWW (the common noise), independent ddd-dimensional Brownian motions B1,B2,…B^1,B^2,\dotsB1,B2,…, and i.i.d. initial states X01,X02,…X^1_0,X^2_0,\dotsX01​,X02​,… with law μ0\mu_0μ0​. The whole initial-state family is independent of the joint noise family, as specified for (6.1). Player iii of nnn controls

dXti=b(Xti,mXtn,αti) dt+σ dBti+σ0 dWt,mxn=1n∑i=1nδxi,dX^i_t=b(X^i_t,m^n_{\boldsymbol X_t},\alpha^i_t)\,dt+\sigma\,dB^i_t+\sigma_0\,dW_t,\qquad m^n_{\boldsymbol x}=\frac1n\sum_{i=1}^n\delta_{x_i},dXti​=b(Xti​,mXt​n​,αti​)dt+σdBti​+σ0​dWt​,mxn​=n1​i=1∑n​δxi​​,

with running cost fff and terminal cost ggg. With the Hamiltonian H(x,m,y)=inf⁡a[b(x,m,a)⋅y+f(x,m,a)]H(x,m,y)=\inf_a[b(x,m,a)\cdot y+f(x,m,a)]H(x,m,y)=infa​[b(x,m,a)⋅y+f(x,m,a)], its minimizer α^\hat\alphaα^ and b^(x,m,y)=b(x,m,α^(x,m,y))\hat b(x,m,y)=b(x,m,\hat\alpha(x,m,y))b^(x,m,y)=b(x,m,α^(x,m,y)), a classical solution (vn,i)i(v^{n,i})_i(vn,i)i​ of the Nash system (2.6) gives the equilibrium states

dXti=b^(Xti,mXtn,Dxivn,i(t,Xt))dt+σ dBti+σ0 dWt.(2.7)dX^i_t=\hat b\big(X^i_t,m^n_{\boldsymbol X_t},D_{x_i}v^{n,i}(t,\boldsymbol X_t)\big)dt+\sigma\,dB^i_t+\sigma_0\,dW_t. \qquad (2.7)dXti​=b^(Xti​,mXt​n​,Dxi​​vn,i(t,Xt​))dt+σdBti​+σ0​dWt​.(2.7)

The master equation (2.8) is a PDE for U(t,x,m)U(t,x,m)U(t,x,m) on [0,T]×Rd×P2(Rd)[0,T]\times\mathbb R^d\times\mathcal P^2(\mathbb R^d)[0,T]×Rd×P2(Rd) involving derivatives in the measure argument. Assumption A asks for Lipschitz b^\hat bb^ (with exponent p∗∈[1,2]p^*\in[1,2]p∗∈[1,2] for the Wasserstein metric), non-degenerate σ\sigmaσ, p′>4p'>4p′>4 moments of μ0\mu_0μ0​, classical solutions of the Nash systems, and a classical solution UUU of the master equation with bounded derivatives; B or B′ controls f^\hat ff^​.

The state space is C([0,T];P1(Rd))C([0,T];\mathcal P^1(\mathbb R^d))C([0,T];P1(Rd)): flows ν=(νt)\nu=(\nu_t)ν=(νt​) of probability measures with finite first moment, continuous for the 1-Wasserstein distance W1\mathcal W_1W1​, with the uniform metric sup⁡tW1(νt,νt′)\sup_t\mathcal W_1(\nu_t,\nu'_t)supt​W1​(νt​,νt′​). The rate function uses the drift b~(t,x,m)=b^(x,m,DxU(t,x,m))\tilde b(t,x,m)=\hat b(x,m,D_xU(t,x,m))b~(t,x,m)=b^(x,m,Dx​U(t,x,m)) and the Dawson–Gärtner action functional

I(ν)=12∫0T∥ν˙t−Lt,νt∗νt∥νt2 dt,Lt,mφ=12Tr[σσ⊤D2φ]+Dφ⋅b~(t,⋅,m),I(\nu)=\frac12\int_0^T\big\|\dot\nu_t-\mathcal L^*_{t,\nu_t}\nu_t\big\|^2_{\nu_t}\,dt,\qquad \mathcal L_{t,m}\varphi=\tfrac12\mathrm{Tr}[\sigma\sigma^\top D^2\varphi]+D\varphi\cdot\tilde b(t,\cdot,m),I(ν)=21​∫0T​​ν˙t​−Lt,νt​∗​νt​​νt​2​dt,Lt,m​φ=21​Tr[σσ⊤D2φ]+Dφ⋅b~(t,⋅,m),

with ∥γ∥m2=sup⁡φ⟨γ,φ⟩2/⟨m,∣Dφ∣2⟩\|\gamma\|^2_m=\sup_\varphi\langle\gamma,\varphi\rangle^2/\langle m,|D\varphi|^2\rangle∥γ∥m2​=supφ​⟨γ,φ⟩2/⟨m,∣Dφ∣2⟩ over test functions, and I=∞I=\inftyI=∞ off absolutely continuous paths. With common noise, the drift is shifted along the mean path: I~ϕ\tilde I^\phiI~ϕ is III for the drift b~(t,x+ϕt,m∘τ−ϕt−1)\tilde b(t,x+\phi_t,m\circ\tau^{-1}_{-\phi_t})b~(t,x+ϕt​,m∘τ−ϕt​−1​), τx(z)=z−x\tau_x(z)=z-xτx​(z)=z−x, and

Jσ0(ν)=I~Mb~,ν((νt∘τMtb~,ν−1)t),Mtb~,ν=σΠσ−1σ0σ−1(∫x d(νt−ν0)−∫0t⟨νs,b~(s,⋅,νs)⟩ds),J^{\sigma_0}(\nu)=\tilde I^{\mathbb M^{\tilde b,\nu}}\big((\nu_t\circ\tau^{-1}_{\mathbb M^{\tilde b,\nu}_t})_t\big),\quad \mathbb M^{\tilde b,\nu}_t=\sigma\Pi_{\sigma^{-1}\sigma_0}\sigma^{-1}\Big(\int x\,d(\nu_t-\nu_0)-\int_0^t\langle\nu_s,\tilde b(s,\cdot,\nu_s)\rangle ds\Big),Jσ0​(ν)=I~Mb~,ν((νt​∘τMtb~,ν​−1​)t​),Mtb~,ν​=σΠσ−1σ0​​σ−1(∫xd(νt​−ν0​)−∫0t​⟨νs​,b~(s,⋅,νs​)⟩ds),

where Πσ−1σ0\Pi_{\sigma^{-1}\sigma_0}Πσ−1σ0​​ is the orthogonal projection onto the image of σ−1σ0\sigma^{-1}\sigma_0σ−1σ0​. R\mathcal RR is relative entropy.

Formalization targets

Goal: Theorem 3.10 (weak LDP, common noise allowed)

If p∗=1p^*=1p∗=1, A and B or B′ hold, and ∫eλ∣x∣μ0(dx)<∞\int e^{\lambda|x|}\mu_0(dx)<\infty∫eλ∣x∣μ0​(dx)<∞ for every λ>0\lambda>0λ>0, then for open OOO, compact KKK and closed FFF,

lim inf⁡n1nlog⁡P(mXn∈O)≥−inf⁡O(Jσ0+R(⋅0∣μ0)),lim sup⁡n1nlog⁡P(mXn∈K)≤−inf⁡K(Jσ0+R(⋅0∣μ0)),\liminf_n\tfrac1n\log\mathbb P(m^n_{\boldsymbol X}\in O)\ge-\inf_O\big(J^{\sigma_0}+\mathcal R(\cdot_0|\mu_0)\big),\qquad \limsup_n\tfrac1n\log\mathbb P(m^n_{\boldsymbol X}\in K)\le-\inf_K\big(J^{\sigma_0}+\mathcal R(\cdot_0|\mu_0)\big),nliminf​n1​logP(mXn​∈O)≥−Oinf​(Jσ0​+R(⋅0​∣μ0​)),nlimsup​n1​logP(mXn​∈K)≤−Kinf​(Jσ0​+R(⋅0​∣μ0​)), lim sup⁡n1nlog⁡P(mXn∈F)≤−lim⁡δ↘0inf⁡Fδ(Jσ0+R(⋅0∣μ0)).\limsup_n\tfrac1n\log\mathbb P(m^n_{\boldsymbol X}\in F)\le-\lim_{\delta\searrow0}\inf_{F_\delta}\big(J^{\sigma_0}+\mathcal R(\cdot_0|\mu_0)\big).nlimsup​n1​logP(mXn​∈F)≤−δ↘0lim​Fδ​inf​(Jσ0​+R(⋅0​∣μ0​)).

Milestones

Exponential equivalence of the Nash flows and the McKean–Vlasov particle flows (Corollary 6.1); a weak LDP for the noises and initial states (Proposition 6.15); uniform continuity of the McKean–Vlasov solution map (Lemma 6.16); the shifted action (Lemma 6.4); identification of the contracted entropy (Lemma 6.17); the weak LDP for general weakly interacting systems with common noise (Theorem 6.8) and its transfer to the Nash flows (Theorem 6.13); compactness after centering (Proposition 6.11); removal of the δ\deltaδ-relaxation on compacts, and the full LDP without common noise (Proposition 6.10); explicit forms of Jσ0J^{\sigma_0}Jσ0​ (Proposition 6.5, Theorem 6.6). A companion item states Theorem 3.9: without common noise, a full LDP with the good rate function I(ν)+R(ν0∣μ0)I(\nu)+\mathcal R(\nu_0|\mu_0)I(ν)+R(ν0​∣μ0​).

Significance

The result quantifies how unlikely atypical equilibrium behaviour is in large games: rare macroscopic deviations of the equilibrium empirical measure flow cost exp⁡(−n rate)\exp(-n\,\mathrm{rate})exp(−nrate), and the rate function makes explicit that the common noise moves the mean of the population for free in the directions of the image of σ0\sigma_0σ0​. When σ0≠0\sigma_0\ne0σ0​=0 the rate function has non-compact level sets, which is why the principle is weak and why the closed-set bound carries the δ\deltaδ-relaxation.

The proof transfers the LDP from the McKean–Vlasov particle system to the Nash system through the master equation, a method that applies beyond this model. Nothing in this paper is formalized: there is no large deviation principle, no Wasserstein space of measure flows, no derivative on Wasserstein space and no mean field game on the platform. A formal development produces reusable definitions (weak and full LDPs, the Dawson–Gärtner action functional, C([0,T];P1)C([0,T];\mathcal P^1)C([0,T];P1)) and checked proofs of the contraction and exponential-equivalence steps. The exponential estimate behind Corollary 6.1 (Theorem 4.3) is the companion mission's milestone and rests on estimates quoted from the companion central-limit-theorem paper.

Difficulty

The obvious route — exponential equivalence plus the Dawson–Gärtner LDP for the particle system — fails twice. The particle drift b~\tilde bb~ is time-dependent and the initial states are random, which the classical results do not cover; and with common noise there is no LDP to transfer. The proof instead freezes the noise: it proves a weak LDP for the pair (empirical measure of initial states and idiosyncratic paths, common noise path), which needs Sanov's theorem in the W1\mathcal W_1W1​ topology and the Brownian support theorem, and contracts it through the McKean–Vlasov solution map. The contraction principle requires the rate function to be good, and it is not when σ0≠0\sigma_0\ne0σ0​=0; uniform continuity of the solution map and the δ\deltaδ-enlargements replace goodness.

Formalization scope

Time is [0,T]⊂R≥0[0,T]\subset\mathbb R_{\ge0}[0,T]⊂R≥0​ with T>0T>0T>0; paths are continuous maps on [0,T][0,T][0,T], and solutions of the SDEs are path-valued, adapted, and satisfy the integral equations almost surely. Players are indexed from 000. Probability measures with finite ppp-th moment are guarded by an explicit predicate, and Wp\mathcal W_pWp​ is the published WassersteinDRO.Duality.wassersteinDistance, kept in [0,∞][0,\infty][0,∞]. Derivatives in xxx, vvv, ttt are genuine derivatives; derivatives in the measure are normalized flat-derivative witnesses. Relative entropy is Mathlib's klDiv. Logarithms of probabilities are in [−∞,∞][-\infty,\infty][−∞,∞]; open, closed and compact sets are those of the uniform W1\mathcal W_1W1​ metric, and lim⁡δ↘0\lim_{\delta\searrow0}limδ↘0​ is a supremum over δ>0\delta>0δ>0. The action functional is an infimum over all distributional time derivatives, with test functions and distributions from Mathlib. The common-noise paths are d0d_0d0​-dimensional.

Standing assumptions are carried explicitly: the filtered space and noises of §2.3, joint independence of initial states and noises from §6.1, Assumption A (with the Borel measurability of b,f,gb,f,gb,f,g), B or B′, p∗=1p^*=1p∗=1 where the paper assumes it, and, for §6, Condition 6.3 and non-degenerate σ\sigmaσ. Two disclosed additions: Theorems 3.9, 3.10 and 6.13 assume b~\tilde bb~ bounded (Condition 6.3(2) requires it; Assumption A does not imply it), and Theorem 6.13 assumes p∗=1p^*=1p∗=1. The solutions of the Nash systems, the master equation and the SDEs are hypotheses; existence is not posed.

A rate function identically 000 or ∞\infty∞, or bounds over a restricted family of sets, would trivialize the statements: the seminorm is a supremum over all test functions, I=∞I=\inftyI=∞ exactly off absolutely continuous flows, and the bounds quantify over every open, compact or closed set. A complete development needs Sanov's theorem in W1\mathcal W_1W1​, the Brownian support theorem, the contraction principle, Dawson–Gärtner's analysis of distribution-valued paths, and stochastic calculus for the particle systems; each of these is reusable, and contributions to any of them are welcome.

Selected references

  • F. Delarue, D. Lacker, K. Ramanan, From the master equation to mean field game limit theory: large deviations and concentration of measure, Ann. Probab. 48(1), 2020; arXiv v1, 2018. https://arxiv.org/abs/1804.08550
  • F. Delarue, D. Lacker, K. Ramanan, From the master equation to mean field game limit theory: a central limit theorem, Electron. J. Probab. 24, 2019 (reference [19] of the paper).
  • P. Cardaliaguet, F. Delarue, J.-M. Lasry, P.-L. Lions, The master equation and the convergence problem in mean field games, Ann. Math. Studies 201, 2019. https://arxiv.org/abs/1509.02505
  • D. Dawson, J. Gärtner, Large deviations from the McKean–Vlasov limit for weakly interacting diffusions, Stochastics 20(4), 1987, 247–308.
  • A. Budhiraja, P. Dupuis, M. Fischer, Large deviation properties of weakly interacting processes via weak convergence methods, Ann. Probab. 40(1), 2012, 74–102.
  • R. Wang, X. Wang, L. Wu, Sanov's theorem in the Wasserstein distance: a necessary and sufficient condition, Statist. Probab. Lett. 80(5), 2010, 505–512.
  • A. Cecchin, G. Pelino, Convergence, fluctuations and large deviations for finite state mean field games via the master equation, 2017. https://arxiv.org/abs/1707.01819
  • D. Lacker, K. Ramanan, Rare Nash equilibria and the price of anarchy in large static games, 2017. https://arxiv.org/abs/1702.02113
23 thms1 active userReviewed
Machine LearningOptimization·Captain: mikedeng1

Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization 6: Decreasing-Step Adam Iterates Are Almost Surely BoundedResearch Paper

Motivation

Adam (Kingma and Ba, arXiv:1412.6980) is the default optimizer for training neural networks. It combines a stochastic gradient step with two exponential moving averages: a momentum term mnm_nmn​ and a coordinatewise second-moment estimate vnv_nvn​ that rescales each coordinate of the step. Its convergence theory is delicate: Reddi, Kale and Kumar (arXiv:1904.09237) exhibited convex problems on which Adam with constant hyperparameters fails to converge.

Barakat and Bianchi (arXiv:1810.02263, SIAM J. Math. Data Sci. 3(1), 2021) study Adam on nonconvex objectives through the ODE method of stochastic approximation. In the decreasing-stepsize regime, their Theorem 5.2 proves that the iterates converge almost surely to the critical points of the objective — provided the iterates are almost surely bounded. A stability hypothesis of this kind is standard in stochastic approximation (Benaïm, Dynamics of stochastic approximation algorithms, Séminaire de Probabilités XXXIII, 1999, doi:10.1007/BFb0096509), and it is often the hardest part to verify. Theorem 5.4 of the paper gives sufficient conditions, on the objective and the stepsizes only, under which almost sure boundedness holds. This mission formalizes that theorem.

Setting

Let (Ω,F,P)(\Omega,\mathcal F,\mathbb P)(Ω,F,P) be a probability space and (Ξ,S)(\Xi,\mathfrak S)(Ξ,S) a measurable space carrying a probability measure μ\muμ. A loss f:Rd×Ξ→Rf:\mathbb R^d\times\Xi\to\mathbb Rf:Rd×Ξ→R is given, with gradient ∇f(x,ξ)\nabla f(x,\xi)∇f(x,ξ) in xxx, and the objective is

F(x)=Ef(x,ξ)=∫Ξf(x,ξ) μ(dξ).F(x)=\mathbb E f(x,\xi)=\int_\Xi f(x,\xi)\,\mu(d\xi).F(x)=Ef(x,ξ)=∫Ξ​f(x,ξ)μ(dξ).

The samples (ξn)n≥1(\xi_n)_{n\ge1}(ξn​)n≥1​ are iid with law μ\muμ (Assumption 4.1). Vector operations below are coordinatewise.

Fix ε>0\varepsilon>0ε>0 and real sequences (γn)(\gamma_n)(γn​) (stepsizes), (αn)(\alpha_n)(αn​), (βn)(\beta_n)(βn​) (moment parameters). Algorithm 5.1 (Adam with decreasing stepsize) starts from x0∈Rdx_0\in\mathbb R^dx0​∈Rd, m0=v0=0m_0=v_0=0m0​=v0​=0, r0=rˉ0=0r_0=\bar r_0=0r0​=rˉ0​=0, and for n≥1n\ge1n≥1 sets

mn=αnmn−1+(1−αn)∇f(xn−1,ξn),rn=αnrn−1+(1−αn),vn=βnvn−1+(1−βn)∇f(xn−1,ξn)⊙2,rˉn=βnrˉn−1+(1−βn),xn=xn−1−γn m^n/(ε+v^n),m^n=mn/rn,v^n=vn/rˉn.\begin{aligned} m_n&=\alpha_nm_{n-1}+(1-\alpha_n)\nabla f(x_{n-1},\xi_n), & r_n&=\alpha_nr_{n-1}+(1-\alpha_n),\\ v_n&=\beta_nv_{n-1}+(1-\beta_n)\nabla f(x_{n-1},\xi_n)^{\odot2}, & \bar r_n&=\beta_n\bar r_{n-1}+(1-\beta_n),\\ x_n&=x_{n-1}-\gamma_n\,\hat m_n/(\varepsilon+\sqrt{\hat v_n}), & \hat m_n&=m_n/r_n,\quad \hat v_n=v_n/\bar r_n . \end{aligned}mn​vn​xn​​=αn​mn−1​+(1−αn​)∇f(xn−1​,ξn​),=βn​vn−1​+(1−βn​)∇f(xn−1​,ξn​)⊙2,=xn−1​−γn​m^n​/(ε+v^n​​),​rn​rˉn​m^n​​=αn​rn−1​+(1−αn​),=βn​rˉn−1​+(1−βn​),=mn​/rn​,v^n​=vn​/rˉn​.​

The weights rn,rˉnr_n,\bar r_nrn​,rˉn​ implement the bias correction of Adam.

The hypotheses are: Assumption 2.2 (f(x,⋅)f(x,\cdot)f(x,⋅) measurable, f(⋅,ξ)f(\cdot,\xi)f(⋅,ξ) continuously differentiable for a.e. ξ\xiξ, integrability at one point, and E∥∇f(x,ξ)−∇f(y,ξ)∥2≤LK2∥x−y∥2\mathbb E\|\nabla f(x,\xi)-\nabla f(y,\xi)\|^2\le L_K^2\|x-y\|^2E∥∇f(x,ξ)−∇f(y,ξ)∥2≤LK2​∥x−y∥2 on each compact KKK); Assumption 2.3 (FFF coercive); Assumption 4.2 i) with p=4p=4p=4 (sup⁡x∈KE∥∇f(x,ξ)∥4<∞\sup_{x\in K}\mathbb E\|\nabla f(x,\xi)\|^4<\inftysupx∈K​E∥∇f(x,ξ)∥4<∞ on compacts); Assumption 5.1 (γn>0\gamma_n>0γn​>0, γn+1/γn→1\gamma_{n+1}/\gamma_n\to1γn+1​/γn​→1, ∑γn=∞\sum\gamma_n=\infty∑γn​=∞, ∑γn2<∞\sum\gamma_n^2<\infty∑γn2​<∞, αn,βn∈[0,1]\alpha_n,\beta_n\in[0,1]αn​,βn​∈[0,1], (1−αn)/γn→a(1-\alpha_n)/\gamma_n\to a(1−αn​)/γn​→a, (1−βn)/γn→b(1-\beta_n)/\gamma_n\to b(1−βn​)/γn​→b with 0<b<4a0<b<4a0<b<4a); and Assumption 5.3 (∇F\nabla F∇F Lipschitz, E∥∇f(x,ξ)∥2≤C(1+F(x))\mathbb E\|\nabla f(x,\xi)\|^2\le C(1+F(x))E∥∇f(x,ξ)∥2≤C(1+F(x)), and lim sup⁡n(γn−1−1−αn+21−αn+1γn+1−1)<2(a−b/4)\limsup_n\big(\gamma_n^{-1}-\frac{1-\alpha_{n+2}}{1-\alpha_{n+1}}\gamma_{n+1}^{-1}\big)<2(a-b/4)limsupn​(γn−1​−1−αn+1​1−αn+2​​γn+1−1​)<2(a−b/4)).

Formalization targets

Goal: Theorem 5.4

Under Assumptions 2.2, 2.3, 4.1, 5.1, 5.3 and 4.2 i) with p=4p=4p=4,

P(sup⁡n∈N∥(xn,mn,vn)∥<∞)=1.\mathbb P\Big(\sup_{n\in\mathbb N}\|(x_n,m_n,v_n)\|<\infty\Big)=1 .P(n∈Nsup​∥(xn​,mn​,vn​)∥<∞)=1.

Milestones (in the order the proof of §9.2 uses them)

  1. Lemma 9.1 i)–ii): rn=1−∏i=1nαir_n=1-\prod_{i=1}^n\alpha_irn​=1−∏i=1n​αi​, and (rn)(r_n)(rn​) is nondecreasing with rn→1r_n\to1rn​→1; likewise for rˉn\bar r_nrˉn​.
  2. (9.1): with an=(1−αn+1)/γna_n=(1-\alpha_{n+1})/\gamma_nan​=(1−αn+1​)/γn​ and Pn=12anrn⟨mn⊙2,1/(ε+v^n)⟩P_n=\frac1{2a_nr_n}\langle m_n^{\odot2},1/(\varepsilon+\sqrt{\hat v_n})\ranglePn​=2an​rn​1​⟨mn⊙2​,1/(ε+v^n​​)⟩,
F(xn)≤F(xn−1)−γn⟨∇F(xn),m^nε+v^n⟩+Cγn2Pn.F(x_n)\le F(x_{n-1})-\gamma_n\Big\langle\nabla F(x_n),\frac{\hat m_n}{\varepsilon+\sqrt{\hat v_n}}\Big\rangle+C\gamma_n^2P_n .F(xn​)≤F(xn−1​)−γn​⟨∇F(xn​),ε+v^n​​m^n​​⟩+Cγn2​Pn​.
  1. (9.3): coordinatewise, v^n−v^n+1≤cn+1v^n+1\sqrt{\hat v_n}-\sqrt{\hat v_{n+1}}\le c_{n+1}\sqrt{\hat v_{n+1}}v^n​​−v^n+1​​≤cn+1​v^n+1​​ with an explicit cn+1∼bγn/2c_{n+1}\sim b\gamma_n/2cn+1​∼bγn​/2.
  2. (9.4): with un=1−an+1/anu_n=1-a_{n+1}/a_nun​=1−an+1​/an​, for every δ>0\delta>0δ>0 and nnn large,
En(F(xn)+Pn+1)≤F(xn−1)+Pn+unEnPn+1−2(a−b+δ4)γnPn+Cγn2(1+F(xn)+Pn).\mathbb E_n\big(F(x_n)+P_{n+1}\big)\le F(x_{n-1})+P_n+u_n\mathbb E_nP_{n+1}-2\Big(a-\frac{b+\delta}4\Big)\gamma_nP_n+C\gamma_n^2\big(1+F(x_n)+P_n\big).En​(F(xn​)+Pn+1​)≤F(xn−1​)+Pn​+un​En​Pn+1​−2(a−4b+δ​)γn​Pn​+Cγn2​(1+F(xn​)+Pn​).
  1. The Robbins–Siegmund inequality: Vn=(1−Cγn−12)F(xn−1)+(1−un−1)PnV_n=(1-C\gamma_{n-1}^2)F(x_{n-1})+(1-u_{n-1})P_nVn​=(1−Cγn−12​)F(xn−1​)+(1−un−1​)Pn​ satisfies En(Vn+1)≤(1+C′γn2)Vn+Cγn2\mathbb E_n(V_{n+1})\le(1+C'\gamma_n^2)V_n+C\gamma_n^2En​(Vn+1​)≤(1+C′γn2​)Vn​+Cγn2​ for nnn large.

Significance

Theorem 5.2 of the paper, the almost sure convergence of decreasing-step Adam to the critical set, is conditional on almost sure boundedness. Theorem 5.4 removes that condition for objectives with Lipschitz gradient and quadratic gradient-noise growth, and so turns Theorem 5.2 into an unconditional convergence result in that class. The Lyapunov function F(xn−1)+PnF(x_{n-1})+P_nF(xn−1​)+Pn​ — the objective plus a weighted kinetic energy of the momentum — is the discrete counterpart of the energy used for the continuous-time Adam ODE in the same paper; the condition b<4ab<4ab<4a that keeps it decreasing is the discrete trace of the condition b≤4ab\le4ab≤4a of the ODE analysis.

The result is proved in the paper; nothing about Adam is formalized on the platform. A formal proof produces a machine-checked stability theorem for an adaptive, momentum-based stochastic algorithm, together with reusable pieces: the Robbins–Siegmund almost-supermartingale theorem in the conditional-expectation form used here, and the bias-correction lemma, which applies to every exponential moving average with vanishing forgetting rate.

Difficulty

For plain stochastic gradient descent, boundedness follows from the descent lemma applied to FFF alone: F(xn)F(x_n)F(xn​) is an almost supermartingale. For Adam this fails. The step m^n/(ε+v^n)\hat m_n/(\varepsilon+\sqrt{\hat v_n})m^n​/(ε+v^n​​) is not a descent direction for FFF: mnm_nmn​ averages past gradients, so ⟨∇F(xn),m^n/(ε+v^n)⟩\langle\nabla F(x_n),\hat m_n/(\varepsilon+\sqrt{\hat v_n})\rangle⟨∇F(xn​),m^n​/(ε+v^n​​)⟩ has no sign. The momentum must therefore enter the Lyapunov function, through PnP_nPn​, and the coordinatewise preconditioner 1/(ε+v^n)1/(\varepsilon+\sqrt{\hat v_n})1/(ε+v^n​​) changes from step to step, so Pn+1P_{n+1}Pn+1​ and PnP_nPn​ are measured in different weighted norms. Controlling that change is what (9.3) does, and it costs a term of size b2γnPn\frac b2\gamma_nP_n2b​γn​Pn​ that must be absorbed by the friction 2aγnPn2a\gamma_nP_n2aγn​Pn​ of the momentum update; the margin is exactly b<4ab<4ab<4a. The time-varying weights ana_nan​ and rnr_nrn​ produce the further term unPn+1u_nP_{n+1}un​Pn+1​, which is why Assumption 5.3 iii) is needed. Finally, the conditional expectations involve the next sample through both mn+1m_{n+1}mn+1​ and v^n+1\hat v_{n+1}v^n+1​, so the second-moment growth condition of Assumption 5.3 ii) has to be used with the right weights.

Formalization scope

Points of Rd\mathbb R^dRd are EuclideanSpace ℝ (Fin d); the state (x,m,v)(x,m,v)(x,m,v) lives in the product E×E×EE\times E\times EE×E×E, whose Mathlib norm is the maximum of the three Euclidean norms (the same bounded sets). The gradient of fff is a function gf : E → Ξ → E that equals the true gradient for μ\muμ-almost every ξ\xiξ. The run of Algorithm 5.1 is defined along a sample path and then pathwise in ω\omegaω. Moments are lower Lebesgue integrals, so no hypothesis is vacuous through the convention that a non-integrable Bochner integral is 000. Assumption 5.3 iii) is stated as "there is c<2(a−b/4)c<2(a-b/4)c<2(a−b/4) bounding the bracket for all large nnn", which avoids a real limsup. The algorithm divides by rnr_nrn​ and rˉn\bar r_nrˉn​; the theorem therefore assumes α1<1\alpha_1<1α1​<1 and β1<1\beta_1<1β1​<1, which Algorithm 5.1 needs for m^1,v^1\hat m_1,\hat v_1m^1​,v^1​ to be defined. In the milestones, En\mathbb E_nEn​ applied to a function of the next state is the integral of that function over the next sample, ∫G(Tn+1(zn,ξ)) μ(dξ)\int G(T_{n+1}(z_n,\xi))\,\mu(d\xi)∫G(Tn+1​(zn​,ξ))μ(dξ), a version of the conditional expectation under Assumption 4.1. In (9.4) the term printed as unPn+1u_nP_{n+1}un​Pn+1​ is unEnPn+1u_n\mathbb E_nP_{n+1}un​En​Pn+1​, the reading the derivation produces.

The goal asserts a single bound for the whole trajectory almost surely; finiteness of each iterate, boundedness of a projected variant of Adam, and boundedness under an almost-sure bound on ∇f(x,ξ)\nabla f(x,\xi)∇f(x,ξ) are all weaker statements and are not this theorem. The "without loss of generality F≥0F\ge0F≥0" of the proof appears only as a hypothesis of the last milestone.

A complete development needs the Robbins–Siegmund theorem (open on the platform as AdaptiveProtection.Convergence.lemma2_robbins_siegmund), differentiation under the integral sign for FFF, the descent lemma for Lipschitz gradients, and conditional expectations given σ(ξ1,…,ξn)\sigma(\xi_1,\dots,\xi_n)σ(ξ1​,…,ξn​) for functions of an independent sample. Proofs of any milestone, and a proof of Robbins–Siegmund in the form used here, are welcome.

Selected references

  • A. Barakat, P. Bianchi, Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization, SIAM J. Math. Data Sci. 3(1), 2021; arXiv:1810.02263v4. https://arxiv.org/abs/1810.02263
  • D. P. Kingma, J. Ba, Adam: A Method for Stochastic Optimization, ICLR 2015. https://arxiv.org/abs/1412.6980
  • S. J. Reddi, S. Kale, S. Kumar, On the Convergence of Adam and Beyond, ICLR 2018. https://arxiv.org/abs/1904.09237
  • H. Robbins, D. Siegmund, A convergence theorem for non negative almost supermartingales and some applications, in Optimizing Methods in Statistics, Academic Press, 1971. https://doi.org/10.1016/B978-0-12-604550-5.50015-8
  • M. Benaïm, Dynamics of stochastic approximation algorithms, Séminaire de Probabilités XXXIII, LNM 1709, Springer, 1999. https://doi.org/10.1007/BFb0096509
12 thms1 active userReviewed
Optimal TransportStatistics·Captain: mikedeng1

On the Rate of Convergence in Wasserstein Distance of the Empirical Measure II: Concentration Inequalities for T_p(μ_N, μ) under Exponential or Polynomial Moments (Theorem 2)Research Paper

Motivation

Approximating an unknown probability measure μ\muμ by the empirical measure μN=1N∑k=1NδXk\mu_N=\frac1N\sum_{k=1}^N\delta_{X_k}μN​=N1​∑k=1N​δXk​​ of an i.i.d. sample is the basic operation of statistics, Monte Carlo integration, quantization and particle approximations of nonlinear PDEs. The natural way to compare μN\mu_NμN​ with μ\muμ on Rd\mathbb R^dRd is an optimal-transport cost, because it metrizes weak convergence together with convergence of moments. For many applications the mean of this cost is not enough: one needs to know how unlikely a large deviation is, for a fixed sample size NNN.

The main consumer in operations research is data-driven distributionally robust optimization. Mohajerin Esfahani and Kuhn (Math. Program. 171, 2018) build Wasserstein balls around μN\mu_NμN​ whose radius is calibrated so that the true distribution lies inside with probability 1−β1-\beta1−β; their finite-sample guarantee (their inequality (7), quoted from this paper for p=1p=1p=1) is exactly a concentration inequality of the kind proved here. On Prove2Me that inequality appears as the hypothesis Concentration7 of WassDDRO.Consistency.Setting; Theorem 2 of this mission is the statement that discharges it.

Timeline. Bolley, Guillin and Villani (PTRF 137, 2007) proved concentration inequalities for Tp(μN,μ)\mathcal T_p(\mu_N,\mu)Tp​(μN​,μ) on non-compact spaces, under assumptions that often included functional inequalities for μ\muμ, and for rather large deviations. Boissard (Electron. J. Probab. 16, 2011) gave bounds in T1\mathcal T_1T1​ for empirical and occupation measures. Boissard and Le Gouic (arXiv:1105.5263) and Dereich, Scheutzow and Schottstedt (Ann. IHP 49, 2013) studied the mean speed of convergence; the latter introduced the multiscale bound used here and obtained sharp moment estimates for a limited range of parameters. Fournier and Guillin (arXiv:1312.2128, 2013; PTRF 162, 2015) gave moment bounds for all p>0p>0p>0 and d≥1d\ge1d≥1 under a qqq-th moment (their Theorem 1, mission I of this series) and the concentration inequalities of their Theorem 2, the subject of this mission, under integrability conditions only.

Setting

Fix d≥1d\ge1d≥1 and give Rd\mathbb R^dRd the Euclidean norm ∣x∣|x|∣x∣. Let μ\muμ be a Borel probability measure on Rd\mathbb R^dRd and X1,…,XNX_1,\dots,X_NX1​,…,XN​ i.i.d. with law μ\muμ. For p>0p>0p>0 the transport cost between probability measures μ,ν\mu,\nuμ,ν is

Tp(μ,ν)=inf⁡{∫∣x−y∣p ξ(dx,dy): ξ∈H(μ,ν)},\mathcal T_p(\mu,\nu)=\inf\Big\{\int|x-y|^p\,\xi(dx,dy):\ \xi\in\mathcal H(\mu,\nu)\Big\},Tp​(μ,ν)=inf{∫∣x−y∣pξ(dx,dy): ξ∈H(μ,ν)},

where H(μ,ν)\mathcal H(\mu,\nu)H(μ,ν) is the set of couplings, measures on Rd×Rd\mathbb R^d\times\mathbb R^dRd×Rd with marginals μ\muμ and ν\nuν (no 1/p1/p1/p root is taken). The moment conditions use

Mq(μ)=∫∣x∣q μ(dx),Eα,γ(μ)=∫eγ∣x∣α μ(dx).M_q(\mu)=\int|x|^q\,\mu(dx),\qquad \mathcal E_{\alpha,\gamma}(\mu)=\int e^{\gamma|x|^\alpha}\,\mu(dx).Mq​(μ)=∫∣x∣qμ(dx),Eα,γ​(μ)=∫eγ∣x∣αμ(dx).

The proof works with a multiscale distance Dp\mathcal D_pDp​. For ℓ≥0\ell\ge0ℓ≥0 let Pℓ\mathcal P_\ellPℓ​ be the partition of (−1,1]d(-1,1]^d(−1,1]d into 2dℓ2^{d\ell}2dℓ dyadic cubes of side 21−ℓ2^{1-\ell}21−ℓ. For measures on (−1,1]d(-1,1]^d(−1,1]d,

Dp(μ,ν)=2p−12∑ℓ≥12−pℓ∑F∈Pℓ∣μ(F)−ν(F)∣.\mathcal D_p(\mu,\nu)=\frac{2^p-1}{2}\sum_{\ell\ge1}2^{-p\ell}\sum_{F\in\mathcal P_\ell}|\mu(F)-\nu(F)|.Dp​(μ,ν)=22p−1​ℓ≥1∑​2−pℓF∈Pℓ​∑​∣μ(F)−ν(F)∣.

For measures on Rd\mathbb R^dRd one cuts space into the shells B0=(−1,1]dB_0=(-1,1]^dB0​=(−1,1]d, Bn=(−2n,2n]d∖(−2n−1,2n−1]dB_n=(-2^n,2^n]^d\setminus(-2^{n-1},2^{n-1}]^dBn​=(−2n,2n]d∖(−2n−1,2n−1]d, rescales each to (−1,1]d(-1,1]^d(−1,1]d (the measure RBnμ\mathcal R_{B_n}\muRBn​​μ), and sums the compact distances with weights 2pn2^{pn}2pn. Lemma 5 bounds Tp\mathcal T_pTp​ by κp,dDp\kappa_{p,d}\mathcal D_pκp,d​Dp​. The splitting Dp(μN,μ)≤ZNp+VNp\mathcal D_p(\mu_N,\mu)\le Z^p_N+V^p_NDp​(μN​,μ)≤ZNp​+VNp​ separates the fluctuation of the shell masses, ZNp=∑n2pn∣μN(Bn)−μ(Bn)∣Z^p_N=\sum_n2^{pn}|\mu_N(B_n)-\mu(B_n)|ZNp​=∑n​2pn∣μN​(Bn​)−μ(Bn​)∣, from the fluctuation inside the shells, VNp=∑n2pnμ(Bn)Dp(RBnμN,RBnμ)V^p_N=\sum_n2^{pn}\mu(B_n)\mathcal D_p(\mathcal R_{B_n}\mu_N,\mathcal R_{B_n}\mu)VNp​=∑n​2pnμ(Bn​)Dp​(RBn​​μN​,RBn​​μ). A Poisson measure ΠN\Pi_NΠN​ with intensity NμN\muNμ (a Poisson(NNN) number of i.i.d. μ\muμ points) and f(x)=(1+x)log⁡(1+x)−xf(x)=(1+x)\log(1+x)-xf(x)=(1+x)log(1+x)−x enter the compact case.

Formalization targets

Goal: Theorem 2 (p. 3)

Assume p≥d/2p\ge d/2p≥d/2 or p≥1p\ge1p≥1, and one of (1) Eα,γ(μ)<∞\mathcal E_{\alpha,\gamma}(\mu)<\inftyEα,γ​(μ)<∞ with α>p\alpha>pα>p; (2) Eα,γ(μ)<∞\mathcal E_{\alpha,\gamma}(\mu)<\inftyEα,γ​(μ)<∞ with α∈(0,p)\alpha\in(0,p)α∈(0,p); (3) Mq(μ)<∞M_q(\mu)<\inftyMq​(μ)<∞ with q>2pq>2pq>2p. Then for all N≥1N\ge1N≥1, x>0x>0x>0,

P(Tp(μN,μ)≥x)≤a(N,x)1{x≤1}+b(N,x),\mathbb P\big(\mathcal T_p(\mu_N,\mu)\ge x\big)\le a(N,x)\mathbf 1_{\{x\le1\}}+b(N,x),P(Tp​(μN​,μ)≥x)≤a(N,x)1{x≤1}​+b(N,x),

with a(N,x)=Ce−cNx2a(N,x)=Ce^{-cNx^2}a(N,x)=Ce−cNx2, Ce−cN(x/log⁡(2+1/x))2Ce^{-cN(x/\log(2+1/x))^2}Ce−cN(x/log(2+1/x))2 or Ce−cNxd/pCe^{-cNx^{d/p}}Ce−cNxd/p according as p>d/2p>d/2p>d/2, p=d/2p=d/2p=d/2, p∈[1,d/2)p\in[1,d/2)p∈[1,d/2), and b(N,x)=Ce−cNxα/p1{x>1}b(N,x)=Ce^{-cNx^{\alpha/p}}\mathbf 1_{\{x>1\}}b(N,x)=Ce−cNxα/p1{x>1}​ under (1), Ce−c(Nx)(α−ε)/p1{x≤1}+Ce−c(Nx)α/p1{x>1}C e^{-c(Nx)^{(\alpha-\varepsilon)/p}}\mathbf 1_{\{x\le1\}}+Ce^{-c(Nx)^{\alpha/p}}\mathbf 1_{\{x>1\}}Ce−c(Nx)(α−ε)/p1{x≤1}​+Ce−c(Nx)α/p1{x>1}​ under (2), CN(Nx)−(q−ε)/pCN(Nx)^{-(q-\varepsilon)/p}CN(Nx)−(q−ε)/p under (3). The constants C,c>0C,c>0C,c>0 depend only on p,dp,dp,d, the parameters of the condition, the value of the moment and ε\varepsilonε.

Milestones

In attack order: Lemma 5 (the coupling bound Tp≤κp,dDp\mathcal T_p\le\kappa_{p,d}\mathcal D_pTp​≤κp,d​Dp​); Lemma 9 (Poisson moment generating function and tails); Proposition 8 (concentration for ΠN(Rd)Dp(ΨN,μ)\Pi_N(\mathbb R^d)\mathcal D_p(\Psi_N,\mu)ΠN​(Rd)Dp​(ΨN​,μ) in the Poissonized compact case); Lemma 11 (P[Poisson(N)=N+k]≥e−2N−1/2/2\mathbb P[\mathrm{Poisson}(N)=N+k]\ge e^{-2}N^{-1/2}/\sqrt2P[Poisson(N)=N+k]≥e−2N−1/2/2​ for k≤⌊N⌋k\le\lfloor\sqrt N\rfloork≤⌊N​⌋); Proposition 10 (the compact case of Theorem 2, P[Dp(μN,μ)≥x]≤1{x≤1}a(N,x)\mathbb P[\mathcal D_p(\mu_N,\mu)\ge x]\le\mathbf 1_{\{x\le1\}}a(N,x)P[Dp​(μN​,μ)≥x]≤1{x≤1}​a(N,x)); Lemma 12 (binomial deviations); Lemma 13 (the tail of ZNpZ^p_NZNp​); display (6) (P[VNp≥x/(2κp,d)]≤a(N,x)1{x≤A}\mathbb P[V^p_N\ge x/(2\kappa_{p,d})]\le a(N,x)\mathbf 1_{\{x\le A\}}P[VNp​≥x/(2κp,d​)]≤a(N,x)1{x≤A}​).

Significance

The result. Theorem 2 gives, for every dimension and every ppp in its range, a deviation inequality whose small-xxx part a(N,x)a(N,x)a(N,x) has the same dimension-dependent exponent as the mean rate of Theorem 1, and whose large-xxx part b(N,x)b(N,x)b(N,x) is governed only by the tail of μ\muμ. Under exponential moments the tail is again exponential; under a polynomial moment it is polynomial, which is the correct order. It is the input for finite-sample confidence radii in Wasserstein DRO, for non-asymptotic guarantees in quantization and for propagation-of-chaos estimates.

Formalizing it. The theorem is proved (2013, published 2015) and widely cited; no machine-checked proof of it, or of any rate for the empirical measure in transport cost, exists in Mathlib or on Prove2Me. The work is formalizing the known proof: Poisson and binomial concentration (Lemmas 9, 12), the local Poisson bound (Lemma 11), Poissonization and depoissonization (Propositions 8, 10), and the shell decomposition (Lemma 13, display (6)). Lemmas 9, 11 and 12 are general probability facts useful well beyond this paper.

Difficulty

The obvious route is a bounded-differences (McDiarmid) inequality for ω↦Tp(μN,μ)\omega\mapsto\mathcal T_p(\mu_N,\mu)ω↦Tp​(μN​,μ). On Rd\mathbb R^dRd it is not available: moving a single sample point changes the cost by an amount that is unbounded, and the measures allowed here have only exponential or polynomial moments. Even on a compact set it bounds the deviation from the mean rather than from 000, so it gives nothing below the mean rate, and it does not see the dimension-dependent exponent xd/px^{d/p}xd/p of a(N,x)a(N,x)a(N,x). The bound must hold at all scales of the dyadic decomposition simultaneously, while the cell counts of a multinomial sample are dependent, and in the non-compact case the masses of far-away shells, which are rare events, must be controlled with a tail that degrades exactly as the moment condition allows.

Formalization scope

Rd\mathbb R^dRd is EuclideanSpace ℝ (Fin d) with d≥1d\ge1d≥1; the Euclidean norm matters, since κp,d\kappa_{p,d}κp,d​ involves the diameter of (−1,1]d(-1,1]^d(−1,1]d. The sample is ω:Fin N→Rd\omega:\mathrm{Fin}\,N\to\mathbb R^dω:FinN→Rd under the product measure μ⊗N\mu^{\otimes N}μ⊗N, and μN\mu_NμN​ is the published WassersteinDRO.Duality.empiricalDistribution; couplings are the published WassersteinLinOpt.Ball.couplings. Costs, moments, Dp\mathcal D_pDp​, ZNpZ^p_NZNp​, VNpV^p_NVNp​ and expectations are valued in [0,∞][0,\infty][0,∞] (lower Lebesgue integrals and [0,∞][0,\infty][0,∞]-valued series), so no bound can hold through a junk value of a divergent integral. Probabilities are the product measure applied to the event. ΠN\Pi_NΠN​ is represented by its law, a Poisson(NNN) mixture of i.i.d. samples, as on p. 13. Poisson and binomial laws are Mathlib's poissonMeasure and binomial.

Constants: in each of the three parts, the condition's parameters, the moment value Eα,γ(μ)=E0\mathcal E_{\alpha,\gamma}(\mu)=E_0Eα,γ​(μ)=E0​ (resp. Mq(μ)=M0M_q(\mu)=M_0Mq​(μ)=M0​) and ε\varepsilonε are fixed before ∃ C,c\exists\,C,c∃C,c, and μ,N,x\mu,N,xμ,N,x come after. A formalization with μ\muμ fixed before the constants would be trivial (the constants could absorb μ\muμ), and one stating the goal as the sum of the bounds for ZNpZ^p_NZNp​ and VNpV^p_NVNp​ would assume the proof; the goal mentions neither Dp\mathcal D_pDp​, ΠN\Pi_NΠN​, ZNpZ^p_NZNp​ nor VNpV^p_NVNp​.

Departures from the print, each disclosed in the statements: the page writes Tp(μN,μ)\mathcal T_p(\mu^N,\mu)Tp​(μN,μ) for Tp(μN,μ)\mathcal T_p(\mu_N,\mu)Tp​(μN​,μ); Theorem 2 opens with "p>0p>0p>0" but prints a(N,x)a(N,x)a(N,x) only for p>d/2p>d/2p>d/2, p=d/2p=d/2p=d/2, p∈[1,d/2)p\in[1,d/2)p∈[1,d/2), so it is posed for p≥d/2p\ge d/2p≥d/2 or p≥1p\ge1p≥1; Proposition 8's "p≥1p\ge1p≥1" is relaxed to that range (its proof does not use p≥1p\ge1p≥1, and Theorem 2 needs it for every p>d/2p>d/2p>d/2) (Proposition 10 is posed, as printed, for every p>0p>0p>0); Lemma 12 assumes N≥1N\ge1N≥1 and a positive success probability, without which (a) and (b) are false. "Supported in (−1,1]d(-1,1]^d(−1,1]d" is μ\muμ-null complement of B0B_0B0​.

The definitions of Tp\mathcal T_pTp​, MqM_qMq​, Notation 4 and Lemma 5 duplicate those of mission I of the series and are to be merged later. Contributions on Poisson and binomial concentration, and on transport costs between discrete measures, are reusable and welcome.

Selected references

  • N. Fournier, A. Guillin, On the rate of convergence in Wasserstein distance of the empirical measure, arXiv:1312.2128v1, 2013; Probab. Theory Relat. Fields 162 (2015) 707–738. https://arxiv.org/abs/1312.2128
  • S. Dereich, M. Scheutzow, R. Schottstedt, Constructive quantization: approximation by empirical measures, Ann. Inst. H. Poincaré Probab. Statist. 49 (2013) 1183–1203. https://doi.org/10.1214/12-AIHP489
  • F. Bolley, A. Guillin, C. Villani, Quantitative concentration inequalities for empirical measures on non-compact spaces, Probab. Theory Relat. Fields 137 (2007) 541–593. https://doi.org/10.1007/s00440-006-0004-7
  • E. Boissard, T. Le Gouic, On the mean speed of convergence of empirical and occupation measures in Wasserstein distance, preprint, 2011. https://arxiv.org/abs/1105.5263
  • P. Mohajerin Esfahani, D. Kuhn, Data-driven distributionally robust optimization using the Wasserstein metric, Math. Program. 171 (2018) 115–166. https://doi.org/10.1007/s10107-017-1172-1
13 thms1 active userReviewed
Algorithmic Game TheoryControl Theory·Captain: mikedeng1

A Probabilistic Weak Formulation of Mean Field Games and Applications 2: Under Unique Hamiltonian Maximizers and Lasry–Lions Monotonicity, the Mean Field Game Has at Most One SolutionResearch Paper

Motivation

Mean field games, introduced independently by Lasry and Lions (Mean field games, Jpn. J. Math. 2007) and by Huang, Malhamé and Caines (2006), describe the Nash equilibria of games with a very large number of symmetric players, each of whom reacts only to the empirical distribution of the others. In the limit, an equilibrium is a fixed point: a flow of population laws such that the optimal response of a single representative player to that flow reproduces it.

Existence of such fixed points is typically obtained by compactness, and says nothing about whether the equilibrium is determined by the data. Uniqueness matters for the use of the model: a unique equilibrium can be computed, approximated, and compared across parameters, while multiple equilibria raise a selection problem. Lasry and Lions showed by counterexamples that uniqueness fails in general, and identified a monotonicity condition on the population-dependent part of the reward under which it holds; outside that condition, uniqueness is typically available only for short horizons and Lipschitz coefficients.

Carmona and Lacker (arXiv:1307.1152v2, 2014; Ann. Appl. Probab. 25(3), 2015) set up a weak formulation of mean field games in which the controlled state is obtained from a fixed driftless diffusion by a Girsanov change of measure, so that the coefficients may be merely measurable in the state and path dependent. This mission formalizes their uniqueness theorem (Theorem 3.8): the Lasry–Lions argument carried out in the weak formulation, through backward stochastic differential equations.

Setting

Fix a horizon TTT, a dimension ddd, the path space C=C([0,T];Rd)\mathcal C = C([0,T];\mathbb R^d)C=C([0,T];Rd) with the sup norm, and a measurable ψ:C→[1,∞)\psi:\mathcal C\to[1,\infty)ψ:C→[1,∞). Write Pψ(C)\mathcal P_\psi(\mathcal C)Pψ​(C) for the probability measures μ\muμ on C\mathcal CC with ∫ψ dμ<∞\int\psi\,d\mu<\infty∫ψdμ<∞. A control set AAA is a compact convex subset of a normed space, and P(A)\mathcal P(A)P(A) is the set of probability measures on AAA with the weak topology.

On a probability space (Ω,P)(\Omega,P)(Ω,P) carrying an initial state ξ\xiξ and an independent ddd-dimensional Brownian motion WWW, filtered by the augmented filtration of (ξ,W)(\xi,W)(ξ,W), let XXX solve the driftless state equation dXt=σ(t,X) dWtdX_t=\sigma(t,X)\,dW_tdXt​=σ(t,X)dWt​, X0=ξX_0=\xiX0​=ξ. The admissible controls A\mathbb AA are the progressively measurable AAA-valued processes. For μ∈Pψ(C)\mu\in\mathcal P_\psi(\mathcal C)μ∈Pψ​(C) and α∈A\alpha\in\mathbb Aα∈A the measure Pμ,αP^{\mu,\alpha}Pμ,α has density

dPμ,αdP=E(∫0⋅σ−1b(t,X,μ,αt) dWt)T,\frac{dP^{\mu,\alpha}}{dP}=\mathcal E\Big(\int_0^\cdot\sigma^{-1}b(t,X,\mu,\alpha_t)\,dW_t\Big)_T,dPdPμ,α​=E(∫0⋅​σ−1b(t,X,μ,αt​)dWt​)T​,

under which XXX has drift b(t,X,μ,αt)b(t,X,\mu,\alpha_t)b(t,X,μ,αt​). For a flow q:[0,T]→P(A)q:[0,T]\to\mathcal P(A)q:[0,T]→P(A) the reward is

Jμ,q(α)=Eμ,α[∫0Tf(t,X,μ,qt,αt) dt+g(X,μ)].J^{\mu,q}(\alpha)=E^{\mu,\alpha}\Big[\int_0^T f(t,X,\mu,q_t,\alpha_t)\,dt+g(X,\mu)\Big].Jμ,q(α)=Eμ,α[∫0T​f(t,X,μ,qt​,αt​)dt+g(X,μ)].

A pair (μ,q)(\mu,q)(μ,q) is a solution of the MFG (Definition 3.4) if some α∈A\alpha\in\mathbb Aα∈A maximizes Jμ,qJ^{\mu,q}Jμ,q over A\mathbb AA, Pμ,α∘X−1=μP^{\mu,\alpha}\circ X^{-1}=\muPμ,α∘X−1=μ, and Pμ,α∘αt−1=qtP^{\mu,\alpha}\circ\alpha_t^{-1}=q_tPμ,α∘αt−1​=qt​ for almost every ttt.

The Hamiltonian is h(t,x,μ,q,z,a)=f(t,x,μ,q,a)+z⋅σ−1b(t,x,μ,a)h(t,x,\mu,q,z,a)=f(t,x,\mu,q,a)+z\cdot\sigma^{-1}b(t,x,\mu,a)h(t,x,μ,q,z,a)=f(t,x,μ,q,a)+z⋅σ−1b(t,x,μ,a), with maximum HHH over a∈Aa\in Aa∈A and maximizer set A(t,x,μ,q,z)A(t,x,\mu,q,z)A(t,x,μ,q,z). Assumption (U) asks that (U.1) the maximizer is unique; (U.2) b=b(t,x,a)b=b(t,x,a)b=b(t,x,a) does not depend on μ\muμ; (U.3) f=f1(t,x,μ)+f2(t,μ,q)+f3(t,x,a)f=f_1(t,x,\mu)+f_2(t,\mu,q)+f_3(t,x,a)f=f1​(t,x,μ)+f2​(t,μ,q)+f3​(t,x,a); and (U.4) the Lasry–Lions monotonicity condition

∫C[g(x,μ)−g(x,μ′)+∫0T(f1(t,x,μ)−f1(t,x,μ′))dt](μ−μ′)(dx)≤0for all μ,μ′.\int_{\mathcal C}\Big[g(x,\mu)-g(x,\mu')+\int_0^T\big(f_1(t,x,\mu)-f_1(t,x,\mu')\big)dt\Big](\mu-\mu')(dx)\le0\qquad\text{for all }\mu,\mu'.∫C​[g(x,μ)−g(x,μ′)+∫0T​(f1​(t,x,μ)−f1​(t,x,μ′))dt](μ−μ′)(dx)≤0for all μ,μ′.

The standing assumptions (S) of the paper (measurability, continuity in aaa, nonsingular σ\sigmaσ, bounded σ−1b\sigma^{-1}bσ−1b, a ψ\psiψ-growth bound on f,gf,gf,g, and a separation of fff) are in force throughout.

Formalization targets

Goal: Theorem 3.8

Under (S) and (U), if (μ1,q1)(\mu^1,q^1)(μ1,q1) and (μ2,q2)(\mu^2,q^2)(μ2,q2) are solutions of the MFG, then

μ1=μ2andqt1=qt2 for almost every t∈[0,T].\mu^1=\mu^2\qquad\text{and}\qquad q^1_t=q^2_t\ \text{for almost every }t\in[0,T].μ1=μ2andqt1​=qt2​ for almost every t∈[0,T].

Definition 3.4 constrains qtq_tqt​ only for almost every ttt, so this is the strongest identification possible.

Milestones

  1. §7.3, p. 30. For a solution (μ,q)(\mu,q)(μ,q) with optimal control α\alphaα and a solution (Y,Z)(Y,Z)(Y,Z) of the BSDE Yt=g(X,μ)+∫tTH(s,X,μ,qs,Zs)ds−∫tTZsdWsY_t=g(X,\mu)+\int_t^TH(s,X,\mu,q_s,Z_s)ds-\int_t^TZ_sdW_sYt​=g(X,μ)+∫tT​H(s,X,μ,qs​,Zs​)ds−∫tT​Zs​dWs​ (7.1), αt\alpha_tαt​ maximizes the Hamiltonian at ZtZ_tZt​, dt×dPdt\times dPdt×dP-a.e.; under (U.1) every such maximizing control agrees with α\alphaα a.e.
  2. (7.9)–(7.10). E[Y01−Y02]E[Y^1_0-Y^2_0]E[Y01​−Y02​] written as an expectation under Pμ1,α1P^{\mu^1,\alpha^1}Pμ1,α1 and under Pμ2,α2P^{\mu^2,\alpha^2}Pμ2,α2.
  3. (7.11)–(7.12). Pointwise bounds from maximization of the Hamiltonian, strict when the controls differ.
  4. (7.13). [Eμ1,α1−Eμ2,α2][Δg(X)+∫0TΔf1(t,X)dt]=0\big[E^{\mu^1,\alpha^1}-E^{\mu^2,\alpha^2}\big]\big[\Delta g(X)+\int_0^T\Delta f_1(t,X)dt\big]=0[Eμ1,α1−Eμ2,α2][Δg(X)+∫0T​Δf1​(t,X)dt]=0.
  5. §7.3, p. 31. α1=α2\alpha^1=\alpha^2α1=α2, L×P\mathcal L\times PL×P-a.e.

Significance

Theorem 3.8, combined with the existence theorem of the same paper (Theorem 3.5, the first mission of this series), gives existence and uniqueness of the equilibrium (Corollary 3.9) for coefficients that are only measurable and path dependent in the state, under a monotonicity condition and no Lipschitz or small-horizon requirement. Uniqueness is also what makes the approximation result of the paper (Theorem 4.2, the third mission) refer to the equilibrium.

The result is proved in the paper. It has not been machine-checked; no mean field game uniqueness theorem in a weak or Girsanov formulation is formalized in Lean or Mathlib. The formal development would contain, as reusable parts, the Doléans exponential of a bounded Itô integrand as a probability density, the change of Brownian motion under it, the comparison principle for BSDEs with Lipschitz drivers, and the Lasry–Lions monotonicity argument.

Difficulty

The argument compares two equilibria through two different measures Pμ1,α1P^{\mu^1,\alpha^1}Pμ1,α1 and Pμ2,α2P^{\mu^2,\alpha^2}Pμ2,α2. The direct Lasry–Lions computation, which differentiates a pairing of a Hamilton–Jacobi–Bellman solution with a Fokker–Planck solution, is not available: there is no PDE, and the value functions are only known through BSDEs. The proof needs (a) that an optimal control maximizes the Hamiltonian along the adjoint process ZZZ — the necessity half of the BSDE optimality criterion, which the paper uses without a displayed proof; (b) the representation of E[Y01−Y02]E[Y^1_0-Y^2_0]E[Y01​−Y02​] under each of the two measures, which requires that the stochastic integrals ∫(Z1−Z2) dWμi,αi\int(Z^1-Z^2)\,dW^{\mu^i,\alpha^i}∫(Z1−Z2)dWμi,αi be true martingales under the changed measures; and (c) turning a strict pointwise inequality on a set of positive dt×dPdt\times dPdt×dP-measure into a strict inequality of expectations, which uses the equivalence P∼Pμi,αiP\sim P^{\mu^i,\alpha^i}P∼Pμi,αi.

Formalization scope

The Lean development lives in the namespace WeakMFG.Uniqueness and builds on the published definition Peng1990.SMP.Stochastic (Brownian motion, L2L^2L2 Itô integrals, Itô processes, BSDEs). Conventions:

  • Base space. Any probability space carrying ξ\xiξ and an independent standard Brownian motion WWW, with the filtration σ(ξ)∨σ(Ws:s≤t)\sigma(\xi)\vee\sigma(W_s:s\le t)σ(ξ)∨σ(Ws​:s≤t) completed by the measurable null sets; the canonical space of the paper is an instance.
  • State. "Strong solution" of dX=σ(t,X)dWdX=\sigma(t,X)dWdX=σ(t,X)dW is read in the L2L^2L2 Itô theory (square-integrable solutions); σ(t,X)>0\sigma(t,X)>0σ(t,X)>0 is matrix invertibility; states are vectors of Rd\mathbb R^dRd with the sup norm, Euclidean squares written as sums of squares.
  • Measures. Pψ(C)\mathcal P_\psi(\mathcal C)Pψ​(C) is a structure carrying the topology τψ\tau_\psiτψ​; P(A)\mathcal P(A)P(A) has the weak topology and its Borel σ\sigmaσ-field; time is R≥0\mathbb R_{\ge0}R≥0​, of which only [0,T][0,T][0,T] enters.
  • Densities. Itô integrals are determined up to versions, so dPμ,α/dPdP^{\mu,\alpha}/dPdPμ,α/dP is a predicate on a random variable; statements assert that a version exists and hold for every version. Optimality is stated against every admissible competitor, never through a real supremum.
  • Added hypotheses, disclosed. Joint measurability of (t,x,q,a)↦f(t,x,μ,q,a)(t,x,q,a)\mapsto f(t,x,\mu,q,a)(t,x,q,a)↦f(t,x,μ,q,a), which the reward presupposes; in (U.4), integrability of the integrals the page writes; the slip in (U.3), which omits qqq from the arguments of fff, is corrected.

A formalization whose hypotheses contain the conclusion is ruled out: the goal assumes only that the two pairs are solutions in the sense of Definition 3.4 — no BSDE solution, no Hamiltonian maximization, no equality of densities is assumed. Uniqueness of qqq is stated almost everywhere in time, and nowhere is equality of the two optimal controls as functions asked for.

Contributions welcome: the Doléans exponential and Girsanov's theorem for bounded drifts in the L2L^2L2 Itô layer, existence and comparison for Lipschitz BSDEs on a filtration enlarged by an independent initial condition, and the measurable maximum theorem for the Hamiltonian. These are reusable beyond this mission, in particular by the other two missions of the series.

Selected references

  • R. Carmona, D. Lacker, A probabilistic weak formulation of mean field games and applications, arXiv:1307.1152v2, 2014; Ann. Appl. Probab. 25(3), 2015. https://arxiv.org/abs/1307.1152
  • J.-M. Lasry, P.-L. Lions, Mean field games, Japanese Journal of Mathematics 2(1), 2007. https://doi.org/10.1007/s11537-007-0657-8
  • M. Huang, R. P. Malhamé, P. E. Caines, Large population stochastic dynamic games: closed-loop McKean–Vlasov systems and the Nash certainty equivalence principle, Communications in Information and Systems 6(3), 2006. https://doi.org/10.4310/CIS.2006.v6.n3.a5
  • E. Pardoux, S. Peng, Adapted solution of a backward stochastic differential equation, Systems & Control Letters 14(1), 1990. https://doi.org/10.1016/0167-6911(90)90082-6
13 thms1 active userReviewed
Optimal TransportStatistics·Captain: mikedeng1

On the Rate of Convergence in Wasserstein Distance of the Empirical Measure I: Non-Asymptotic Moment Bounds on E T_p(μ_N, μ) under a q-th Moment Condition (Theorem 1)Research Paper

Motivation

How fast does the empirical measure of an i.i.d. sample approach the law it is drawn from? When distance is measured by optimal transport, the answer enters the analysis of statistical estimators built from empirical distributions, quantization of probability measures, Monte Carlo and particle approximations of nonlinear PDEs (McKean–Vlasov systems), and the radius calibration of Wasserstein ambiguity sets in data-driven distributionally robust optimization.

The question has a long history. Ajtai, Komlós and Tusnády (1984) found the (log⁡N/N)1/2(\log N/N)^{1/2}(logN/N)1/2 rate for uniform samples in the unit square. Horowitz–Karandikar (1994), Rachev–Rüschendorf and Mischler–Mouhot gave bounds that were far from optimal outside the compactly supported case. Boissard and Le Gouic (2014) and Dereich, Scheutzow and Schottstedt (2013) introduced multiscale couplings; the latter obtained sharp moment bounds for p∈[1,d/2)p\in[1,d/2)p∈[1,d/2), d≥3d\ge3d≥3, under a moment condition q>dp/(d−p)q>dp/(d-p)q>dp/(d−p). Fournier and Guillin (arXiv:1312.2128, Probab. Theory Relat. Fields 162, 2015) extended these bounds to every p>0p>0p>0, every dimension d≥1d\ge1d≥1 and every moment order q>pq>pq>p, with explicit dependence on the moment.

Setting

Fix d≥1d\ge1d≥1 and write ∣⋅∣|\cdot|∣⋅∣ for the Euclidean norm on Rd\mathbb R^dRd. For probability measures μ,ν\mu,\nuμ,ν on Rd\mathbb R^dRd and p>0p>0p>0, the transport cost is

Tp(μ,ν)=inf⁡{∫∣x−y∣p ξ(dx,dy): ξ∈H(μ,ν)}∈[0,∞],\mathcal T_p(\mu,\nu)=\inf\Big\{\int|x-y|^p\,\xi(dx,dy):\ \xi\in\mathcal H(\mu,\nu)\Big\}\in[0,\infty],Tp​(μ,ν)=inf{∫∣x−y∣pξ(dx,dy): ξ∈H(μ,ν)}∈[0,∞],

where H(μ,ν)\mathcal H(\mu,\nu)H(μ,ν) is the set of couplings, measures on Rd×Rd\mathbb R^d\times\mathbb R^dRd×Rd with marginals μ\muμ and ν\nuν. The Wasserstein distance is Tp1/p\mathcal T_p^{1/p}Tp1/p​ for p>1p>1p>1 and Tp\mathcal T_pTp​ for p≤1p\le1p≤1; the statements here are about Tp\mathcal T_pTp​ itself. The moment of order q>0q>0q>0 is Mq(μ)=∫∣x∣q μ(dx)M_q(\mu)=\int|x|^q\,\mu(dx)Mq​(μ)=∫∣x∣qμ(dx).

Let X1,X2,…X_1,X_2,\dotsX1​,X2​,… be i.i.d. with law μ\muμ and let μN=1N∑k=1NδXk\mu_N=\frac1N\sum_{k=1}^N\delta_{X_k}μN​=N1​∑k=1N​δXk​​. The quantity of interest is E Tp(μN,μ)\mathbb E\,\mathcal T_p(\mu_N,\mu)ETp​(μN​,μ).

The proof works through a multiscale distance. For ℓ≥0\ell\ge0ℓ≥0, Pℓ\mathcal P_\ellPℓ​ is the partition of (−1,1]d(-1,1]^d(−1,1]d into 2dℓ2^{d\ell}2dℓ dyadic cubes of side 21−ℓ2^{1-\ell}21−ℓ. The dyadic shells are B0=(−1,1]dB_0=(-1,1]^dB0​=(−1,1]d and Bn=(−2n,2n]d∖(−2n−1,2n−1]dB_n=(-2^n,2^n]^d\setminus(-2^{n-1},2^{n-1}]^dBn​=(−2n,2n]d∖(−2n−1,2n−1]d. For measures on (−1,1]d(-1,1]^d(−1,1]d, Dp(μ,ν)=2p−12∑ℓ≥12−pℓ∑F∈Pℓ∣μ(F)−ν(F)∣\mathcal D_p(\mu,\nu)=\frac{2^p-1}{2}\sum_{\ell\ge1}2^{-p\ell}\sum_{F\in\mathcal P_\ell}|\mu(F)-\nu(F)|Dp​(μ,ν)=22p−1​∑ℓ≥1​2−pℓ∑F∈Pℓ​​∣μ(F)−ν(F)∣, and for measures on Rd\mathbb R^dRd,

Dp(μ,ν)=∑n≥02pn(∣μ(Bn)−ν(Bn)∣+(μ(Bn)∧ν(Bn))Dp(RBnμ,RBnν)),\mathcal D_p(\mu,\nu)=\sum_{n\ge0}2^{pn}\Big(|\mu(B_n)-\nu(B_n)|+\big(\mu(B_n)\wedge\nu(B_n)\big)\mathcal D_p(\mathcal R_{B_n}\mu,\mathcal R_{B_n}\nu)\Big),Dp​(μ,ν)=n≥0∑​2pn(∣μ(Bn​)−ν(Bn​)∣+(μ(Bn​)∧ν(Bn​))Dp​(RBn​​μ,RBn​​ν)),

where RBnμ\mathcal R_{B_n}\muRBn​​μ is μ\muμ conditioned on BnB_nBn​ and rescaled by 2−n2^{-n}2−n.

In Lean, Rd\mathbb R^dRd is EuclideanSpace ℝ (Fin d); Tp\mathcal T_pTp​, MqM_qMq​, Dp\mathcal D_pDp​ are transportCost, moment, Dp (compact case Dcube) in FournierGuillin.Moment, valued in ℝ≥0∞. μN\mu_NμN​ is the published WassersteinDRO.Duality.empiricalDistribution, and H(μ,ν)\mathcal H(\mu,\nu)H(μ,ν) the published WassersteinLinOpt.Ball.couplings.

Formalization targets

Goal: Theorem 1 (p. 2)

For p>0p>0p>0 and q>pq>pq>p there is C=C(p,d,q)C=C(p,d,q)C=C(p,d,q) such that for every μ\muμ with Mq(μ)<∞M_q(\mu)<\inftyMq​(μ)<∞ and every N≥1N\ge1N≥1,

E Tp(μN,μ)≤C Mqp/q(μ)×{N−1/2+N−(q−p)/qp>d/2, q≠2p,N−1/2log⁡(1+N)+N−(q−p)/qp=d/2, q≠2p,N−p/d+N−(q−p)/qp∈(0,d/2), q≠dp/(d−p).\mathbb E\,\mathcal T_p(\mu_N,\mu)\le C\,M_q^{p/q}(\mu)\times\begin{cases}N^{-1/2}+N^{-(q-p)/q}&p>d/2,\ q\ne2p,\\ N^{-1/2}\log(1+N)+N^{-(q-p)/q}&p=d/2,\ q\ne2p,\\ N^{-p/d}+N^{-(q-p)/q}&p\in(0,d/2),\ q\ne dp/(d-p).\end{cases}ETp​(μN​,μ)≤CMqp/q​(μ)×⎩⎨⎧​N−1/2+N−(q−p)/qN−1/2log(1+N)+N−(q−p)/qN−p/d+N−(q−p)/q​p>d/2, q=2p,p=d/2, q=2p,p∈(0,d/2), q=dp/(d−p).​

The constant is left unspecified, as in the paper.

Milestones

  1. Lemma 5 (p. 6): Tp(μ,ν)≤κp,d Dp(μ,ν)\mathcal T_p(\mu,\nu)\le\kappa_{p,d}\,\mathcal D_p(\mu,\nu)Tp​(μ,ν)≤κp,d​Dp​(μ,ν) with κp,d=2p(1+d/2)(2p+1)/(2p−1)\kappa_{p,d}=2^{p(1+d/2)}(2^p+1)/(2^p-1)κp,d​=2p(1+d/2)(2p+1)/(2p−1), for all probability measures.
  2. Lemma 6 (p. 7): Dp(μ,ν)≤C∑n≥02pn∑ℓ≥02−pℓ∑F∈Pℓ∣μ(2nF∩Bn)−ν(2nF∩Bn)∣\mathcal D_p(\mu,\nu)\le C\sum_{n\ge0}2^{pn}\sum_{\ell\ge0}2^{-p\ell}\sum_{F\in\mathcal P_\ell}|\mu(2^nF\cap B_n)-\nu(2^nF\cap B_n)|Dp​(μ,ν)≤C∑n≥0​2pn∑ℓ≥0​2−pℓ∑F∈Pℓ​​∣μ(2nF∩Bn​)−ν(2nF∩Bn​)∣.
  3. Shell tails (p. 8): Mq(μ)=1M_q(\mu)=1Mq​(μ)=1 implies μ(Bn)≤2−q(n−1)\mu(B_n)\le2^{-q(n-1)}μ(Bn​)≤2−q(n−1).
  4. Binomial mean deviation (p. 8): E∣μN(A)−μ(A)∣≤min⁡{2μ(A),μ(A)/N}\mathbb E|\mu_N(A)-\mu(A)|\le\min\{2\mu(A),\sqrt{\mu(A)/N}\}E∣μN​(A)−μ(A)∣≤min{2μ(A),μ(A)/N​}.
  5. Level bound (p. 8): ∑F∈PℓE∣μN(2nF∩Bn)−μ(2nF∩Bn)∣≤min⁡{2μ(Bn),2dℓ/2(μ(Bn)/N)1/2}\sum_{F\in\mathcal P_\ell}\mathbb E|\mu_N(2^nF\cap B_n)-\mu(2^nF\cap B_n)|\le\min\{2\mu(B_n),2^{d\ell/2}(\mu(B_n)/N)^{1/2}\}∑F∈Pℓ​​E∣μN​(2nF∩Bn​)−μ(2nF∩Bn​)∣≤min{2μ(Bn​),2dℓ/2(μ(Bn​)/N)1/2}.
  6. Display (4) (p. 8): E Dp(μN,μ)≤C∑n2pn∑ℓ2−pℓmin⁡{2−qn,2dℓ/2(2−qn/N)1/2}\mathbb E\,\mathcal D_p(\mu_N,\mu)\le C\sum_{n}2^{pn}\sum_{\ell}2^{-p\ell}\min\{2^{-qn},2^{d\ell/2}(2^{-qn}/N)^{1/2}\}EDp​(μN​,μ)≤C∑n​2pn∑ℓ​2−pℓmin{2−qn,2dℓ/2(2−qn/N)1/2} when Mq(μ)=1M_q(\mu)=1Mq​(μ)=1.
  7. Step 1 (p. 8): the scale series ∑ℓ≥02−pℓmin⁡{ε,2dℓ/2(ε/N)1/2}\sum_{\ell\ge0}2^{-p\ell}\min\{\varepsilon,2^{d\ell/2}(\varepsilon/N)^{1/2}\}∑ℓ≥0​2−pℓmin{ε,2dℓ/2(ε/N)1/2} in the three regimes.

Significance

Theorem 1 is the standard non-asymptotic rate for empirical measures in Wasserstein distance under moment assumptions alone. The three regimes are sharp for general laws: N−1/2N^{-1/2}N−1/2 is attained by two-point laws, N−p/dN^{-p/d}N−p/d by the uniform law on a cube, and the term N−(q−p)/qN^{-(q-p)/q}N−(q−p)/q by heavy-tailed laws (examples on pp. 2–3 of the paper). It is the input to finite-sample guarantees for Wasserstein distributionally robust optimization, to propagation-of-chaos rates for particle systems, and to quantization error bounds.

The paper result is proved; it has, to our knowledge, no machine-checked proof. A formalization adds the multiscale coupling bound (Lemma 5), a reusable comparison between transport costs and dyadic mass differences, and binomial mean-deviation estimates for empirical measures, all of which serve other rates of convergence (the concentration bounds of Theorem 2 of the same paper rest on Lemma 5).

Difficulty

The obvious route bounds Tp\mathcal T_pTp​ by a coupling on a single partition of fixed mesh and optimizes the mesh. This loses a logarithm or a power in every regime and cannot reach N−p/dN^{-p/d}N−p/d for p<d/2p<d/2p<d/2 or N−1/2N^{-1/2}N−1/2 for p>d/2p>d/2p>d/2: the error at all scales must be controlled simultaneously, which is what Dp\mathcal D_pDp​ does. The step that requires work in Lean is Lemma 5: it builds an explicit coupling scale by scale inside (−1,1]d(-1,1]^d(−1,1]d and glues the shells BnB_nBn​ together, and it must hold for arbitrary probability measures with possibly infinite cost. The remaining steps are careful summations of geometric series in nnn and ℓ\ellℓ whose regimes depend on ppp versus d/2d/2d/2 and on qqq versus 2p2p2p or dp/(d−p)dp/(d-p)dp/(d−p).

Formalization scope

Conventions: Rd\mathbb R^dRd with the Euclidean norm (the paper's constant κp,d\kappa_{p,d}κp,d​ uses the diameter bound 21+d/22^{1+d/2}21+d/2 of (−1,1]d(-1,1]^d(−1,1]d, which holds for that norm); d≥1d\ge1d≥1, N≥1N\ge1N≥1, p>0p>0p>0, μ\muμ a probability measure. The sample X1,…,XNX_1,\dots,X_NX1​,…,XN​ is a point of (Rd)N(\mathbb R^d)^N(Rd)N under the product measure μ⊗N\mu^{\otimes N}μ⊗N, i.e. the first NNN terms of the i.i.d. sequence. Expectations are lower Lebesgue integrals of [0,∞][0,\infty][0,∞]-valued functions and all series of nonnegative terms are summed in [0,∞][0,\infty][0,∞], so no bound holds by a junk value of a non-integrable integrand or a non-summable series. Constants "depending only on p,d,qp,d,qp,d,q" are quantified after p,d,qp,d,qp,d,q and before μ\muμ and NNN; a statement with the constant chosen after μ\muμ would only assert finiteness and is ruled out.

Corrections of the print, disclosed in the items: the third case of Theorem 1 is printed with q≠d/(d−p)q\ne d/(d-p)q=d/(d−p); the remark below the theorem and Step 4 of the proof show the excluded value is q=dp/(d−p)q=dp/(d-p)q=dp/(d−p) (the two agree only for p=1p=1p=1), and the goal excludes q=dp/(d−p)q=dp/(d-p)q=dp/(d−p). Step 1 is printed for ε∈(0,1)\varepsilon\in(0,1)ε∈(0,1) but applied at ε=1\varepsilon=1ε=1; it is stated for ε∈(0,1]\varepsilon\in(0,1]ε∈(0,1]. The display defining Tp\mathcal T_pTp​ says p≥1p\ge1p≥1, but the paper uses it for all p>0p>0p>0, and so does the definition.

Needed infrastructure: couplings and gluing of measures on products, dyadic partitions of boxes and their counting, binomial variance, and summation of geometric series with case analysis. Lemma 5 and the binomial estimates are reusable beyond this mission. Proofs of any milestone are welcome, as are alternative proofs of the goal.

Selected references

  • N. Fournier, A. Guillin, On the rate of convergence in Wasserstein distance of the empirical measure, Probab. Theory Relat. Fields 162 (2015) 707–738; arXiv:1312.2128v1. https://arxiv.org/abs/1312.2128 · https://doi.org/10.1007/s00440-014-0583-7
  • S. Dereich, M. Scheutzow, R. Schottstedt, Constructive quantization: approximation by empirical measures, Ann. Inst. Henri Poincaré Probab. Stat. 49 (2013) 1183–1203. https://arxiv.org/abs/1108.5346
  • M. Ajtai, J. Komlós, G. Tusnády, On optimal matchings, Combinatorica 4 (1984) 259–264. https://doi.org/10.1007/BF02579135
  • E. Boissard, T. Le Gouic, On the mean speed of convergence of empirical and occupation measures in Wasserstein distance, Ann. Inst. Henri Poincaré Probab. Stat. 50 (2014) 539–563. https://arxiv.org/abs/1105.5263
  • J. Horowitz, R. L. Karandikar, Mean rates of convergence of empirical measures in the Wasserstein metric, J. Comput. Appl. Math. 55 (1994) 261–273. https://doi.org/10.1016/0377-0427(94)90033-7
11 thms1 active userReviewed
Control TheoryOptimal TransportPartial Differential Equations·Captain: mikedeng1

Mean Field Games Master Equations with Nonseparable Hamiltonians and Displacement Monotonicity: Under Displacement Monotone H and G, the Master Equation Has a Unique Global Classical SolutionResearch Paper

Motivation

Mean field games (Lasry–Lions 2006–2007; Huang–Malhamé–Caines 2006) describe Nash equilibria of games with a very large number of symmetric players, each interacting with the others only through the empirical distribution of their states. When all players are also exposed to a common noise, the equilibrium is no longer described by a forward–backward pair of PDEs but by a single equation on the space of probability measures, the master equation. The master equation is the object that lets one prove convergence of NNN-player equilibria to the mean field limit (Cardaliaguet–Delarue–Lasry–Lions 2019), so a global classical solution is the starting point of that theory.

Global well-posedness requires a monotonicity condition; without one, uniqueness of equilibria fails. Before this paper, global results were known under the Lasry–Lions monotonicity condition and for separable Hamiltonians H(x,μ,p)=H0(x,p)−F(x,μ)H(x,\mu,p)=H_0(x,p)-F(x,\mu)H(x,μ,p)=H0​(x,p)−F(x,μ), and under displacement convexity in deterministic potential games (Gangbo–Mészáros 2022). Gangbo, Mészáros, Mou and Zhang (Ann. Probab. 50 (2022)) prove global well-posedness for nonseparable Hamiltonians under displacement monotonicity, a condition that is different from Lasry–Lions monotonicity and that has a natural extension to Hamiltonians depending jointly on (x,μ,p)(x,\mu,p)(x,μ,p).

Setting

Let P2=P2(Rd)\mathcal P_2=\mathcal P_2(\mathbb R^d)P2​=P2​(Rd) be the Borel probability measures on Rd\mathbb R^dRd with finite second moment, with the 2-Wasserstein distance W2W_2W2​. For U:P2→RU:\mathcal P_2\to\mathbb RU:P2​→R, the Lions derivative ∂μU(μ,x~)∈Rd\partial_\mu U(\mu,\tilde x)\in\mathbb R^d∂μ​U(μ,x~)∈Rd is characterized by

U(Lξ+η)−U(μ)=E[⟨∂μU(μ,ξ),η⟩]+o(∥η∥2),Lξ=μ.U(\mathcal L_{\xi+\eta})-U(\mu)=\mathbb E[\langle\partial_\mu U(\mu,\xi),\eta\rangle]+o(\|\eta\|_2),\qquad \mathcal L_\xi=\mu .U(Lξ+η​)−U(μ)=E[⟨∂μ​U(μ,ξ),η⟩]+o(∥η∥2​),Lξ​=μ.

The class C2(Rd×P2)\mathcal C^2(\mathbb R^d\times\mathcal P_2)C2(Rd×P2​) consists of continuous U(x,μ)U(x,\mu)U(x,μ) for which ∂xU\partial_xU∂x​U, ∂xxU\partial_{xx}U∂xx​U, ∂μU(x,μ,x~)\partial_\mu U(x,\mu,\tilde x)∂μ​U(x,μ,x~), ∂x∂μU\partial_x\partial_\mu U∂x​∂μ​U, ∂x~∂μU\partial_{\tilde x}\partial_\mu U∂x~​∂μ​U and ∂μμU(x,μ,x~,xˉ)\partial_{\mu\mu}U(x,\mu,\tilde x,\bar x)∂μμ​U(x,μ,x~,xˉ) exist and extend to jointly continuous functions of all their arguments.

The data are a horizon T>0T>0T>0, a common-noise intensity β≥0\beta\ge0β≥0 with β^2=1+β2\hat\beta^2=1+\beta^2β^​2=1+β2, a Hamiltonian H(x,μ,p)H(x,\mu,p)H(x,μ,p) and a terminal cost G(x,μ)G(x,\mu)G(x,μ). The master equation on Θ=[0,T]×Rd×P2\Theta=[0,T]\times\mathbb R^d\times\mathcal P_2Θ=[0,T]×Rd×P2​ is

−∂tV−β^22tr⁡(∂xxV)+H(x,μ,∂xV)−NV=0,V(T,x,μ)=G(x,μ),-\partial_tV-\tfrac{\hat\beta^2}{2}\operatorname{tr}(\partial_{xx}V)+H(x,\mu,\partial_xV)-\mathcal NV=0,\qquad V(T,x,\mu)=G(x,\mu),−∂t​V−2β^​2​tr(∂xx​V)+H(x,μ,∂x​V)−NV=0,V(T,x,μ)=G(x,μ),

with the nonlocal operator

NV=tr⁡ E~ˉ[β^22∂x~∂μV(t,x,μ,ξ~)+β22∂μμV(t,x,μ,ξˉ,ξ~)+β2∂x∂μV(t,x,μ,ξ~)−∂μV(t,x,μ,ξ~)(∂pH)⊤(ξ~,μ,∂xV(t,ξ~,μ))],\mathcal NV=\operatorname{tr}\,\bar{\tilde{\mathbb E}}\Big[\tfrac{\hat\beta^2}{2}\partial_{\tilde x}\partial_\mu V(t,x,\mu,\tilde\xi)+\tfrac{\beta^2}{2}\partial_{\mu\mu}V(t,x,\mu,\bar\xi,\tilde\xi)+\beta^2\partial_x\partial_\mu V(t,x,\mu,\tilde\xi)-\partial_\mu V(t,x,\mu,\tilde\xi)(\partial_pH)^\top(\tilde\xi,\mu,\partial_xV(t,\tilde\xi,\mu))\Big],NV=trE~ˉ[2β^​2​∂x~​∂μ​V(t,x,μ,ξ~​)+2β2​∂μμ​V(t,x,μ,ξˉ​,ξ~​)+β2∂x​∂μ​V(t,x,μ,ξ~​)−∂μ​V(t,x,μ,ξ~​)(∂p​H)⊤(ξ~​,μ,∂x​V(t,ξ~​,μ))],

where ξ~,ξˉ\tilde\xi,\bar\xiξ~​,ξˉ​ are independent with law μ\muμ. A classical solution is a V∈C1,2,2(Θ)V\in\mathcal C^{1,2,2}(\Theta)V∈C1,2,2(Θ) satisfying the equation on (0,T)(0,T)(0,T) and the terminal condition.

U(x,μ)U(x,\mu)U(x,μ) is displacement monotone (2.16) if for all square-integrable ξ,η\xi,\etaξ,η with Lξ=μ\mathcal L_\xi=\muLξ​=μ and an independent copy (ξ~,η~)(\tilde\xi,\tilde\eta)(ξ~​,η~​),

E~[⟨∂xμU(ξ,μ,ξ~)η~,η⟩+⟨∂xxU(ξ,μ)η,η⟩]≥0.\tilde{\mathbb E}\big[\langle\partial_{x\mu}U(\xi,\mu,\tilde\xi)\tilde\eta,\eta\rangle+\langle\partial_{xx}U(\xi,\mu)\eta,\eta\rangle\big]\ge0 .E~[⟨∂xμ​U(ξ,μ,ξ~​)η~​,η⟩+⟨∂xx​U(ξ,μ)η,η⟩]≥0.

The Hamiltonian is displacement monotone (Definition 3.4) if a bilinear form built from ∂xμH\partial_{x\mu}H∂xμ​H, ∂xxH\partial_{xx}H∂xx​H and a correction 14E∣(∂ppH)−1/2E~[∂pμH η~]∣2\tfrac14\mathbb E\big|(\partial_{pp}H)^{-1/2}\tilde{\mathbb E}[\partial_{p\mu}H\,\tilde\eta]\big|^241​E​(∂pp​H)−1/2E~[∂pμ​Hη~​]​2 is nonpositive, with p=φ(ξ)p=\varphi(\xi)p=φ(ξ) for every bounded Lipschitz C1C^1C1 map φ\varphiφ. Assumptions 3.1 and 3.2 impose regularity and bounds on GGG and HHH; Assumption 3.5 imposes the two monotonicity conditions.

Formalization targets

Goal: Theorem 6.3, first sentence

Under Assumptions 3.1, 3.2 and 3.5, the master equation on [0,T][0,T][0,T] has a classical solution VVV with bounded ∂xV\partial_xV∂x​V, ∂xxV\partial_{xx}V∂xx​V, ∂μV\partial_\mu V∂μ​V, ∂xμV\partial_{x\mu}V∂xμ​V, and it is the only classical solution in that class:

∃! V∈C1,2,2(Θ) solving (1.1) with ∂xV,∂xxV,∂μV,∂xμV bounded.\exists!\,V\in\mathcal C^{1,2,2}(\Theta)\ \text{solving (1.1) with}\ \partial_xV,\partial_{xx}V,\partial_\mu V,\partial_{x\mu}V\ \text{bounded}.∃!V∈C1,2,2(Θ) solving (1.1) with ∂x​V,∂xx​V,∂μ​V,∂xμ​V bounded.

Milestones

  1. Lemma 2.1: ∂x~μU(μ,x~)\partial_{\tilde x\mu}U(\mu,\tilde x)∂x~μ​U(μ,x~) is symmetric for U∈C2(P2)U\in\mathcal C^2(\mathcal P_2)U∈C2(P2​).
  2. Theorem 4.1: along a sufficiently regular classical solution, V(t,⋅,⋅)V(t,\cdot,\cdot)V(t,⋅,⋅) is displacement monotone for every t∈[0,T]t\in[0,T]t∈[0,T].
  3. Theorem 5.1: if V(t,⋅,⋅)V(t,\cdot,\cdot)V(t,⋅,⋅) is displacement semimonotone with constant λ\lambdaλ, then VVV and ∂xV\partial_xV∂x​V are W2W_2W2​-Lipschitz in μ\muμ with a constant depending only on ddd, TTT, ∥∂xV∥∞\|\partial_xV\|_\infty∥∂x​V∥∞​, ∥∂xxV∥∞\|\partial_{xx}V\|_\infty∥∂xx​V∥∞​, L2GL_2^GL2G​, LH(∥∂xV∥∞)L^H(\|\partial_xV\|_\infty)LH(∥∂x​V∥∞​) and λ\lambdaλ.
  4. Proposition 6.2(iii) with (6.7): on a short interval [t0,T][t_0,T][t0​,T], of length δ\deltaδ independent of L1GL_1^GL1G​, the master equation has a unique classical solution with full C2\mathcal C^2C2 regularity and ∣∂μV(t0)∣,∣∂xμV(t0)∣≤C1μ|\partial_\mu V(t_0)|,|\partial_{x\mu}V(t_0)|\le C_1^\mu∣∂μ​V(t0​)∣,∣∂xμ​V(t0​)∣≤C1μ​.

Significance

The theorem gives global classical well-posedness of the master equation with common noise for a class of Hamiltonians that need not be separable and data that need not be Lasry–Lions monotone. A classical solution is what the convergence analysis of NNN-player games and the construction of approximate equilibria take as input. Theorem 4.1, displacement monotonicity propagating backward along the equation, is the central structural fact; Theorem 5.1 converts it into an a priori Lipschitz bound in μ\muμ that is uniform in time, which is what allows local solutions to be continued.

The result is proved in the paper; nothing in this mission is open mathematically. No part of it is formalized anywhere. The mission produces a formal statement of the master equation, its classical solutions and the displacement monotonicity conditions, plus targets for a machine-checked proof. Calculus on Wasserstein space with Lions derivatives is absent from Mathlib, so even Lemma 2.1 requires new infrastructure.

Difficulty

Local well-posedness holds for any regular data; the obstacle is continuing the solution to the whole interval. The length of the local interval depends on the Lipschitz constant of the terminal data in μ\muμ, and without a uniform-in-time bound on that constant the local intervals can shrink to zero. Lasry–Lions monotonicity is not available here, and for nonseparable HHH it has no obvious analogue. Any argument that controls this constant has to work with second-order Lions derivatives, which needs full C2\mathcal C^2C2 regularity in the measure variable. That regularity is itself only known on short intervals.

Formalization scope

  • States are EuclideanSpace ℝ (Fin d). P2\mathcal P_2P2​ is a subtype of measures, so functions of μ\muμ are defined only on P2\mathcal P_2P2​. W2W_2W2​ is the published WassersteinDRO.Duality.wassersteinDistance with p=2p=2p=2, converted to a real number.
  • There is no probability space. Every expectation over ξ,η\xi,\etaξ,η and independent copies is an integral against an L2\mathbb L^2L2-coupling π\piπ (the joint law of (ξ,η)(\xi,\eta)(ξ,η)), against π⊗π\pi\otimes\piπ⊗π, or against μ⊗μ\mu\otimes\muμ⊗μ. Quantifying over all couplings is the reading of "for all ξ,η∈L2\xi,\eta\in\mathbb L^2ξ,η∈L2".
  • The Lions derivative is stated in coupling form, uniformly over all ξ\xiξ of law μ\muμ. Derivatives are explicit witnesses, i.e. global versions, and joint continuity is required as on the page.
  • Derivatives are (bi)linear maps. ⟨∂xμU η~,η⟩\langle\partial_{x\mu}U\,\tilde\eta,\eta\rangle⟨∂xμ​Uη~​,η⟩ takes the xxx-direction η\etaη first. Matrix norms are operator norms; this choice changes no statement, since all constants are existential.
  • C2(Rd×P2×Rk)\mathcal C^2(\mathbb R^d\times\mathcal P_2\times\mathbb R^k)C2(Rd×P2​×Rk), which the page uses without defining, lumps the Euclidean variables into one. "H∈C3H\in\mathcal C^3H∈C3" is read as existence and joint continuity of the (x,p)(x,p)(x,p)-derivatives up to order three. Vector-valued memberships are stated coordinatewise.
  • ∂ppH\partial_{pp}H∂pp​H is assumed positive definite, which the page's (∂ppH)−1/2(\partial_{pp}H)^{-1/2}(∂pp​H)−1/2 presupposes. ∣A−1/2w∣2|A^{-1/2}w|^2∣A−1/2w∣2 is written ⟨A−1w,w⟩\langle A^{-1}w,w\rangle⟨A−1w,w⟩.
  • The expectations in NV\mathcal NVNV are required to exist, so a non-integrable integrand cannot make the equation hold through a Bochner integral defaulting to 000. L2GL_2^GL2G​ (Remark 3.3) is used in its Lipschitz form.
  • "Depending only on" clauses are quantifier orders. In Proposition 6.2, δ\deltaδ depends on d,T,C0,L0G,LH,L2Gd,T,C_0,L_0^G,L^H,L_2^Gd,T,C0​,L0G​,LH,L2G​; this expands LH(C1x)L^H(C_1^x)LH(C1x​), whose constant C1xC_1^xC1x​ comes from a BSDE. Uniqueness is within the bounded-derivative class of Theorem 6.3.
  • Out of scope: the second sentence of Theorem 6.3 (well-posedness of the McKean–Vlasov FBSDEs and the representation (6.6)), Proposition 6.1, and Proposition 6.2(i), (ii) and (2.27). They need Brownian motions with common noise and BSDEs.
  • A statement in which the regularity hypotheses cannot all hold at once, or in which existence of the solution is assumed, would be a trivializing formalization and is not acceptable. The hypotheses here are taken from the page, which shows they are satisfiable (Remark 3.6(i), Lemma 3.8).
  • Wanted contributions: first- and second-order calculus on P2\mathcal P_2P2​ (Lions derivatives, the chain rule along μ↦Lξ+εη\mu\mapsto\mathcal L_{\xi+\varepsilon\eta}μ↦Lξ+εη​, symmetry of ∂x~μ\partial_{\tilde x\mu}∂x~μ​). These are reusable for any mean field problem.

Selected references

  • W. Gangbo, A. R. Mészáros, C. Mou, J. Zhang, Mean field games master equations with nonseparable Hamiltonians and displacement monotonicity, Ann. Probab. 50(6), 2178–2217, 2022. https://doi.org/10.1214/22-AOP1580
  • J.-M. Lasry, P.-L. Lions, Mean field games, Jpn. J. Math. 2, 229–260, 2007. https://doi.org/10.1007/s11537-007-0657-8
  • P. Cardaliaguet, F. Delarue, J.-M. Lasry, P.-L. Lions, The Master Equation and the Convergence Problem in Mean Field Games, Annals of Mathematics Studies 201, Princeton University Press, 2019. https://doi.org/10.2307/j.ctvckq7qf
  • R. Carmona, F. Delarue, Probabilistic Theory of Mean Field Games with Applications I–II, Springer, 2018. https://doi.org/10.1007/978-3-319-58920-6
  • W. Gangbo, A. R. Mészáros, Global well-posedness of master equations for deterministic displacement convex potential mean field games, Comm. Pure Appl. Math. 75, 2685–2801, 2022. https://doi.org/10.1002/cpa.22069
11 thms1 active userReviewed
Algorithmic Game TheoryOptimal TransportStochastic Systems·Captain: mikedeng1

From the Master Equation to Mean Field Game Limit Theory: Large Deviations and Concentration of Measure 1: Without Common Noise, n-Player Nash Equilibria Concentrate Dimension-FreeResearch Paper

Motivation

A large stochastic game has one state process per player. Each player's feedback changes with the empirical distribution of all states, so a finite population remains coupled even when the idiosyncratic Brownian motions are independent. A useful quantitative question is whether a statistic of the entire collection of equilibrium trajectories can deviate substantially from its mean as the population grows. Delarue, Lacker, and Ramanan answer this for smooth closed-loop mean-field games in their large-deviations and concentration paper. Their result concerns the equilibrium state paths themselves, rather than only a fixed-time empirical measure.

The paper is part of a two-paper limit theory. Its companion central-limit paper supplies the Nash-to-McKean–Vlasov estimates quoted here as Theorems 4.1 and 4.2. The concentration argument also uses transport inequalities: Gozlan's dimension-free characterization explains the quadratic transport assumption on the initial law, while Djellout, Guillin, and Wu provide a transport principle for diffusion path laws. The present mission records the paper's main concentration theorem and four of its explicit intermediate targets.

Setting

Fix a horizon T>0T>0T>0 and a positive state dimension ddd. Player iii has a continuous state path Xi∈Cd=C([0,T];Rd)X^i\in C^d=C([0,T];\mathbb R^d)Xi∈Cd=C([0,T];Rd). The empirical measure of a vector x=(x1,…,xn)x=(x^1,\ldots,x^n)x=(x1,…,xn) is mxn=n−1∑iδxim_x^n=n^{-1}\sum_i\delta_{x^i}mxn​=n−1∑i​δxi​; the same formula applies to paths. The norm on CdC^dCd is ∥x∥∞=sup⁡t≤T∣xt∣\|x\|_\infty=\sup_{t\le T}|x_t|∥x∥∞​=supt≤T​∣xt​∣, and the product norm relevant to this mission is ∥x∥n,2=(∑i∥xi∥∞2)1/2\|x\|_{n,2}=(\sum_i\|x^i\|_\infty^2)^{1/2}∥x∥n,2​=(∑i​∥xi∥∞2​)1/2.

The game is posed on a filtered probability space with a common Wiener process WWW, independent idiosyncratic Wiener processes BiB^iBi, and i.i.d. initial states X0iX^i_0X0i​ of law μ0\mu_0μ0​. The action space is Polish. A drift b(x,m,a)b(x,m,a)b(x,m,a), running cost f(x,m,a)f(x,m,a)f(x,m,a), and terminal cost g(x,m)g(x,m)g(x,m) specify the control problem. The Hamiltonian H(x,m,y)H(x,m,y)H(x,m,y) minimizes b(x,m,a)⋅y+f(x,m,a)b(x,m,a)\cdot y+f(x,m,a)b(x,m,a)⋅y+f(x,m,a) over actions; a selected minimizer α^\hat\alphaα^ defines b^=b(⋅,α^)\hat b=b(\cdot,\hat\alpha)b^=b(⋅,α^) and f^=f(⋅,α^)\hat f=f(\cdot,\hat\alpha)f^​=f(⋅,α^).

Classical solutions vn,iv^{n,i}vn,i of the nnn-player Nash system (2.6) determine the feedback in the equilibrium state equation (2.7). A classical solution UUU of the master equation (2.8) determines the comparison particle equation (4.1). Both equations retain common-noise terms in their definitions. The goal sets the common-noise coefficient σ0\sigma_0σ0​ to zero. Assumption A imposes Hamiltonian attainment, Lipschitz b^\hat bb^, nondegenerate idiosyncratic diffusion, an initial moment above order four, and the stated classical solutions. Either B or B′ controls the selected running cost; B′ also bounds UUU and vn,iv^{n,i}vn,i as specified on pp. 8–9.

Formalization targets

The goal is Theorem 3.4. If μ0\mu_0μ0​ satisfies the quadratic transport inequality W2(μ0,ν)≤2κR(ν∣μ0)W_2(\mu_0,\nu)\le\sqrt{2\kappa R(\nu\mid\mu_0)}W2​(μ0​,ν)≤2κR(ν∣μ0​)​ for every ν≪μ0\nu\ll\mu_0ν≪μ0​ with finite second moment, then constants C,δ1,δ2>0C,\delta_1,\delta_2>0C,δ1​,δ2​>0 exist such that, for a>0a>0a>0, n≥C/a2n\ge C/a^2n≥C/a2, and every 1-Lipschitz Φ\PhiΦ on the product path space,

P ⁣(Φ(X)−EΦ(X)>a)≤2nexp⁡(−δ1a2n)+2exp⁡(−δ2a2).P\!\left(\Phi(X)-E\Phi(X)>a\right) \le 2n\exp(-\delta_1a^2n)+2\exp(-\delta_2a^2).P(Φ(X)−EΦ(X)>a)≤2nexp(−δ1​a2n)+2exp(−δ2​a2).

The four milestones retain the paper's two main comparison layers. Theorem 4.3 controls both the path-space Wasserstein distance between the Nash and comparison empirical measures and their synchronous squared path distance by 2nexp⁡(−ε2n2/κ2)2n\exp(-\varepsilon^2n^2/\kappa_2)2nexp(−ε2n2/κ2​) for n≥κ1/εn\ge\kappa_1/\varepsilonn≥κ1​/ε. Theorem 5.3 gives a dimension-uniform transport inequality and concentration bound for the law of a Lipschitz SDE in the coordinatewise product-supremum norm. Equation (5.7) bounds the change in a 1-Lipschitz path expectation when the deterministic initial vector changes. Theorem 5.4 gives P(Φ(X~)−EΦ(X~)>a)≤2e−δa2P(\Phi(\tilde X)-E\Phi(\tilde X)>a)\le2e^{-\delta a^2}P(Φ(X~)−EΦ(X~)>a)≤2e−δa2 for the interacting comparison system. The labels, constants, and domains follow the pinned preprint, pp. 12 and 16–20.

Significance

Theorem 3.4 supplies a finite-population tail estimate for every 1-Lipschitz observable of the entire equilibrium path vector. The first term becomes small at a population-dependent scale, while the second term has a rate independent of the number of players. This is stronger information than convergence of the empirical measure alone: it applies to path-dependent statistics and includes explicit deviation probabilities Theorem 3.4.

The mathematical statements are proved in the source paper, subject to its assumptions; Theorems 4.1 and 4.2 that support its comparison result are proved in the companion paper. The work here is to give these claims faithful machine-checkable statements and ultimately machine-checked proofs. The present draft is a set of open Lean theorem statements with sorry, so it asserts no completed formal proof. A completed development would also make its definitions of empirical path laws, Wasserstein continuity, flat derivatives, and interacting SDE solutions reusable for other mean-field models.

Difficulty

Independent-noise concentration cannot simply be applied to the Nash state paths. A player's drift depends on the empirical state measure and on a derivative of the nnn-player Nash solution, so changing one input can change every trajectory. The master equation describes a comparison system, but using it requires matching the Nash and master feedbacks on the same filtered probability space. The regularity in Assumptions A, B, and B′ is substantial: the master field has first and second derivatives in both space and measure, with uniform bounds. A formal proof must also preserve the exact path norm and the population-independent placement of constants. The SDE transport theorem's uniformity over dimensions is particularly consequential for Theorem 5.4 §§4–5.

Formalization scope

State vectors use finite-dimensional Euclidean spaces; time uses nonnegative reals and only [0,T][0,T][0,T] is evaluated. A continuous path is a ContinuousMap on that interval with its supremum norm. Finite products use PiLp 2; the scalar-coordinate version of the norm is used for Theorem 5.3. Players are indexed from zero, corresponding to the paper's indices 1,…,n1,\ldots,n1,…,n, and every theorem requires n≥1n\ge1n≥1. Probabilities and entropy are extended nonnegative values. Transport distances stay extended until a finite-moment hypothesis justifies their real value.

The filtered Wiener processes, i.i.d. initial states, Borel coefficients, Polish action space, Nash and master PDEs, and either B or B′ are represented explicitly. The master equation is imposed on P2\mathcal P_2P2​; its spatial gradient is also required on Pp∗\mathcal P_{p_*}Pp∗​​, as Assumption A(5) specifies. A flat measure derivative is a normalized witness satisfying (2.2), while spatial derivatives are actual Fréchet derivatives. SDE solutions are path-valued processes satisfying coordinate Itô integral relations; solution families are supplied as hypotheses, since their existence is asserted by the source. Expectations appearing in the conclusions are stated integrable, so a default zero integral cannot satisfy a tail bound accidentally. The model cannot be replaced by arbitrary paths or a vacuous solution predicate: the Nash and comparison paths must satisfy their respective equations with the same noises and initial states.

The mission includes Theorem 4.3, Theorem 5.3, (5.7), and Theorem 5.4. The quoted Theorems 4.1 and 4.2, the general transport equivalence of Theorem 5.1, and tensorization in Theorem 5.2 remain useful later contributions, with their original hypotheses and conclusions intact. The printed constant in the “moreover” clause of Theorem 5.1 is omitted because it is dimensionally incorrect; no substitute assertion is placed in this mission.

Selected references

  • F. Delarue, D. Lacker, and K. Ramanan, From the master equation to mean field game limit theory: Large deviations and concentration of measure, Annals of Probability 48 (2020), 211–263; formalization follows arXiv:1804.08550v1.
  • F. Delarue, D. Lacker, and K. Ramanan, From the master equation to mean field game limit theory: A central limit theorem, preprint (2018), arXiv:1804.08542.
  • N. Gozlan, A characterization of dimension free concentration in terms of transportation inequalities, Annals of Probability 37 (2009), 2480–2498, doi:10.1214/09-AOP470.
  • H. Djellout, A. Guillin, and L. Wu, Transportation cost-information inequalities and applications to random dynamical systems and diffusions, Annals of Probability 32 (2004), 2702–2732, doi:10.1214/009117904000000531.
12 thms1 active userReviewed
AnalysisStochastic Systems·Captain: mikedeng1

Functional Itô Calculus and Stochastic Integral Representation of Martingales 2: The Vertical Derivative Extends to a Bijective Isometry W^{1,2}(X) → L²(X) Inverting the Itô IntegralResearch Paper

Motivation

Every square-integrable martingale of a Brownian filtration is a stochastic integral, Y(T)=E[Y(T)]+∫0Tϕ⋅dWY(T)=E[Y(T)]+\int_0^T\phi\cdot dWY(T)=E[Y(T)]+∫0T​ϕ⋅dW (Itô's representation theorem). The classical theorem gives no formula for ϕ\phiϕ. In hedging, ϕ\phiϕ is the replicating strategy of a claim. In filtering and stochastic control it is the quantity one has to compute. The Clark–Haussmann–Ocone formula identifies ϕ(t)=E[DtH∣Ft]\phi(t)=E[D_tH\mid\mathcal F_t]ϕ(t)=E[Dt​H∣Ft​] through the Malliavin derivative DDD. That derivative is anticipative, defined only up to null sets, and acts on the Wiener space rather than on the observed path.

Cont and Fournié (arXiv:1002.2446, Ann. Probab. 2013) develop a nonanticipative alternative from Dupire's functional Itô calculus (Dupire 2009). The integrand of the representation is a vertical derivative ∇XY\nabla_XY∇X​Y, computed pathwise from a functional representation Y(t)=Ft(Xt,At)Y(t)=F_t(X_t,A_t)Y(t)=Ft​(Xt​,At​) of the martingale. Their main structural result is that this derivative, first defined on regular functionals, extends to all square-integrable stochastic integrals and inverts the Itô integral there. This mission formalizes that extension.

Timeline:

  • 1940s–1950s. Itô constructs the stochastic integral and proves the representation theorem for Brownian functionals.
  • 1970–1984. Clark (1970), Haussmann (1979) and Ocone (1984) give the explicit formula through the Malliavin derivative.
  • 2009. Dupire introduces horizontal and vertical derivatives of path functionals.
  • 2010. Cont and Fournié prove a change-of-variable formula for path functionals (J. Funct. Anal. 259, 2010).
  • 2013. Cont and Fournié prove the Itô formula used here (their Theorem 4.1, the subject of the companion mission) and the extension theorem of this mission.

Setting

Fix a horizon TTT and a dimension ddd. A path is a map x:[0,∞)→Rdx:[0,\infty)\to\mathbb R^dx:[0,∞)→Rd. A path is cadlag on [0,t][0,t][0,t] if it is right-continuous there with left limits. The stopped path is xt(u)=x(u∧t)x_t(u)=x(u\wedge t)xt​(u)=x(u∧t), and the vertical perturbation xtex_t^exte​ shifts the value at time ttt by e∈Rde\in\mathbb R^de∈Rd while keeping xxx on [0,t)[0,t)[0,t). Paths vvv with values in the positive semidefinite matrices Sd+S_d^+Sd+​ carry the density of the quadratic variation.

A nonanticipative functional Ft(x,v)F_t(x,v)Ft​(x,v) depends only on (xt,vt)(x_t,v_t)(xt​,vt​). Its vertical derivative ∇xFt(x,v)∈Rd\nabla_xF_t(x,v)\in\mathbb R^d∇x​Ft​(x,v)∈Rd is the gradient at e=0e=0e=0 of e↦Ft(xte,vt)e\mapsto F_t(x_t^e,v_t)e↦Ft​(xte​,vt​). Its horizontal derivative DtF(x,v)\mathcal D_tF(x,v)Dt​F(x,v) is the right derivative of h↦Ft+h(xt,vt)h\mapsto F_{t+h}(x_t,v_t)h↦Ft+h​(xt​,vt​) along the flat extension. The class Cb1,2([0,T))\mathbb C_b^{1,2}([0,T))Cb1,2​([0,T)) consists of functionals with the following properties:

  • FFF is left-continuous for the distance d∞d_\inftyd∞​ of (9);
  • DF\mathcal DFDF is continuous at fixed times;
  • ∇xF\nabla_xF∇x​F and ∇x2F\nabla_x^2F∇x2​F exist and are left-continuous;
  • DF\mathcal DFDF, ∇xF\nabla_xF∇x​F and ∇x2F\nabla_x^2F∇x2​F are bounded on bounded sets of paths.

All functionals also satisfy (10), Ft(x,v)=Ft(x,vt−)F_t(x,v)=F_t(x,v_{t-})Ft​(x,v)=Ft​(x,vt−​).

Assumption 5.1. WWW is a standard ddd-dimensional Brownian motion, and

X(t)=X(0)+∫0tσ(u)⋅dW(u),det⁡σ(t)≠0dt×dP-a.e.,X(t)=X(0)+\int_0^t\sigma(u)\cdot dW(u),\qquad\det\sigma(t)\ne0\quad dt\times d\mathbb P\text{-a.e.},X(t)=X(0)+∫0t​σ(u)⋅dW(u),detσ(t)=0dt×dP-a.e.,

with σ\sigmaσ adapted to FW\mathcal F^WFW. The density A=σσ⊤A=\sigma\sigma^\topA=σσ⊤ of [X][X][X] is cadlag and adapted. The working filtration is F=FX\mathcal F=\mathcal F^XF=FX, the completed natural filtration of XXX, right-continuous on [0,T)[0,T)[0,T).

The spaces involved are:

  • L2(X)\mathcal L^2(X)L2(X): progressive φ\varphiφ with ∥φ∥2=E∫0Tφ⊤Aφ dt<∞\|\varphi\|^2=E\int_0^T\varphi^\top A\varphi\,dt<\infty∥φ∥2=E∫0T​φ⊤Aφdt<∞;
  • I2(X)\mathcal I^2(X)I2(X): the Itô integrals ∫0⋅φ⋅dX\int_0^\cdot\varphi\cdot dX∫0⋅​φ⋅dX, with norm E[Y(T)2]E[Y(T)^2]E[Y(T)2];
  • D(X)D(X)D(X): the processes of I2(X)\mathcal I^2(X)I2(X) that equal Ft(Xt,At)F_t(X_t,A_t)Ft​(Xt​,At​) for some F∈Cb1,2F\in\mathbb C_b^{1,2}F∈Cb1,2​, with ∇XY(t)=∇xFt(Xt,At)\nabla_XY(t)=\nabla_xF_t(X_t,A_t)∇X​Y(t)=∇x​Ft​(Xt​,At​);
  • W1,2(X)\mathcal W^{1,2}(X)W1,2(X): the closure of D(X)D(X)D(X) in I2(X)\mathcal I^2(X)I2(X).

Formalization targets

Goal: Theorem 5.8 with (56)

The operator ∇X:D(X)→L2(X)\nabla_X:D(X)\to\mathcal L^2(X)∇X​:D(X)→L2(X) is closable on W1,2(X)\mathcal W^{1,2}(X)W1,2(X). Its closure is a bijective isometry

∇X:W1,2(X)→L2(X),∫0⋅φ⋅dX↦φ,\nabla_X:\mathcal W^{1,2}(X)\to\mathcal L^2(X),\qquad\int_0^\cdot\varphi\cdot dX\mapsto\varphi,∇X​:W1,2(X)→L2(X),∫0⋅​φ⋅dX↦φ,

and ∇XY\nabla_XY∇X​Y is the unique element of L2(X)\mathcal L^2(X)L2(X) with

E[Y(T)Z(T)]=E∫0T∇XY ∇XZ d[X]for all Z∈D(X).E[Y(T)Z(T)]=E\int_0^T\nabla_XY\,\nabla_XZ\,d[X]\quad\text{for all }Z\in D(X).E[Y(T)Z(T)]=E∫0T​∇X​Y∇X​Zd[X]for all Z∈D(X).

In particular ∇X(∫0⋅φ dX)=φ\nabla_X\big(\int_0^\cdot\varphi\,dX\big)=\varphi∇X​(∫0⋅​φdX)=φ in L2(X)\mathcal L^2(X)L2(X). The adjoint identity (55),

E[Y(T)∫0Tφ⋅dX]=E∫0T∇XY φ d[X],E\Big[Y(T)\int_0^T\varphi\cdot dX\Big]=E\int_0^T\nabla_XY\,\varphi\,d[X],E[Y(T)∫0T​φ⋅dX]=E∫0T​∇X​Yφd[X],

is a separate item.

Milestones

  1. Corollary 4.4. Two Cb1,2\mathbb C_b^{1,2}Cb1,2​ representations of one process have vertical derivatives that agree in the A(t−)A(t-)A(t−)-seminorm, outside an evanescent set.
  2. Theorem 5.2. Y(T)=Y(0)+∫0T∇xFt(Xt,At) dX(t)Y(T)=Y(0)+\int_0^T\nabla_xF_t(X_t,A_t)\,dX(t)Y(T)=Y(0)+∫0T​∇x​Ft​(Xt​,At​)dX(t) for a martingale with a Cb1,2\mathbb C_b^{1,2}Cb1,2​ representation.
  3. Proposition 5.5. E[Y(T)Z(T)]=E∫0T∇XY ∇XZ d[X]E[Y(T)Z(T)]=E\int_0^T\nabla_XY\,\nabla_XZ\,d[X]E[Y(T)Z(T)]=E∫0T​∇X​Y∇X​Zd[X] on D(X)D(X)D(X).
  4. The cylindrical functional of Lemma 5.7's proof is in Cb1,2\mathbb C_b^{1,2}Cb1,2​ with the stated derivatives, and its evaluation on (X,A)(X,A)(X,A) equals the stochastic integral of the cylindrical integrand.
  5. Lemma 5.7. {∇XY:Y∈D(X)}\{\nabla_XY:Y\in D(X)\}{∇X​Y:Y∈D(X)} is dense in L2(X)\mathcal L^2(X)L2(X), and W1,2(X)=I2(X)\mathcal W^{1,2}(X)=\mathcal I^2(X)W1,2(X)=I2(X).

Significance

The theorem identifies the integrand of the martingale representation of any square-integrable FX\mathcal F^XFX-martingale as a limit of pathwise derivatives. On regular functionals, those derivatives are computed by perturbing the endpoint of the observed path. The integrand is therefore adapted by construction, and it can be approximated by finite differences. This is the basis of the paper's general representation formula (Theorem 5.9) and of its comparison with Malliavin calculus (Theorem 6.1, ∇XY(t)=E[DtH∣Ft]\nabla_XY(t)=E[D_tH\mid\mathcal F_t]∇X​Y(t)=E[Dt​H∣Ft​]). The isometry also gives W1,2(X)\mathcal W^{1,2}(X)W1,2(X) the structure of a Hilbert space on which ∇X\nabla_X∇X​ is a weak derivative. This is a nonanticipative counterpart of the Wiener–Sobolev space D1,2\mathbb D^{1,2}D1,2.

The results are proved in the paper; none of them has a machine-checked proof. Neither Mathlib nor the platform has a square-integrable Itô integral with its isometry, a functional Itô calculus, or a martingale representation theorem. A complete development would provide the first formal statement and proof of a martingale representation formula with an explicit, nonanticipative integrand. The path-space and L2(X)\mathcal L^2(X)L2(X) layers are reusable for any work on path-dependent functionals.

Difficulty

The proof of the goal is short once its inputs are available, but each input is substantial.

  • Proposition 5.5 needs Theorem 5.2, which needs the functional Itô formula (Theorem 4.1 of the paper, the companion mission). It also needs the uniqueness of the decomposition of a continuous semimartingale.
  • Lemma 5.7 needs the totality of cylindrical integrands f(X(t1),…,X(tn))1t>tnf(X(t_1),\dots,X(t_n))1_{t>t_n}f(X(t1​),…,X(tn​))1t>tn​​ in L2(X)\mathcal L^2(X)L2(X). This is a monotone-class argument tied to the filtration being generated by XXX, and it fails for a larger filtration (take σ=sgn⁡(W)\sigma=\operatorname{sgn}(W)σ=sgn(W) in dimension one and the filtration of WWW).
  • Corollary 4.4 converts an identity of processes into an identity of integrands. This needs the quadratic variation of a stochastic integral and left-continuity of the integrand, and it gives nothing at t=0t=0t=0.

A tempting shortcut is to define ∇X\nabla_X∇X​ on I2(X)\mathcal I^2(X)I2(X) as the inverse of the Itô integral. That makes (56) a tautology and erases the link with the pathwise derivative, so the closure must be built from D(X)D(X)D(X).

Formalization scope

Time is R≥0\mathbb R_{\ge0}R≥0​, statements are made on [0,T)[0,T)[0,T), and functionals are defined on all paths, with every quantifier over path space restricted to cadlag pairs. The derivatives of a functional are explicit witnesses tied to it by HasDerivWithinAt and HasFDerivAt, so a derivative is never a junk value. The distance d∞d_\inftyd∞​ uses the max norm on Rd×Sd+\mathbb R^d\times S_d^+Rd×Sd+​ (sup norm on vectors, entrywise sup norm on matrices) and appears only through explicit bounds.

The formal setting makes these hypotheses explicit:

  1. The filtration is the completed natural filtration of XXX. Its right-continuity and AAA's adaptedness on the horizon are included from §2.
  2. E[X](T)<∞E[X](T)<\inftyE[X](T)<∞, through the square-integrable Itô integral defining XXX.
  3. σ\sigmaσ is progressively measurable, and X(0)X(0)X(0) is F0W\mathcal F^W_0F0W​-measurable.
  4. All paths of XXX are continuous and all paths of AAA are cadlag.

In ddd dimensions, φ2 d[X]\varphi^2\,d[X]φ2d[X] means φ⊤Aφ dt\varphi^\top A\varphi\,dtφ⊤Aφdt. The square-integrable Itô integral is a relation, defined through simple dyadic integrands and an almost-surely continuous integral process on [0,T][0,T][0,T]. This continuity selects the stochastic integral version from the limits at fixed times. The derivative of each test process is required to belong to L2(X)\mathcal L^2(X)L2(X), as Definition 5.4 states. Theorem 5.2 integrates by dyadic left Riemann sums in probability (EthierKurtz.itoStepSum). Corollary 4.4 is stated for 0<t<T0<t<T0<t<T, because the printed version fails at t=0t=0t=0.

The statements must not be trivialized. The closure of ∇X\nabla_X∇X​ is a relation, and its existence, uniqueness up to L2(X)\mathcal L^2(X)L2(X)-null sets, isometry and surjectivity are all conclusions, never definitions. Expectations of squares are lower integrals in [0,∞][0,\infty][0,∞], and every real expectation in (51), (53) and (55) comes with its integrability as part of the conclusion. L2(X)\mathcal L^2(X)L2(X) is not reduced to {0}\{0\}{0}, because det⁡σ≠0\det\sigma\ne0detσ=0. A derivative witness cannot be chosen freely, because it is tied to FFF.

Contributions are welcome on:

  • the L2L^2L2 Itô integral and its isometry for continuous square-integrable martingales;
  • the functional Itô formula, from the companion mission;
  • the monotone-class density of cylindrical integrands;
  • the left-limit and cadlag lemmas for path functionals.

Selected references

  • R. Cont and D.-A. Fournié, Functional Itô calculus and stochastic integral representation of martingales, Ann. Probab. 41(1):109–133, 2013. https://arxiv.org/abs/1002.2446 (v5), https://doi.org/10.1214/11-AOP721
  • R. Cont and D.-A. Fournié, Change of variable formulas for non-anticipative functionals on path space, J. Funct. Anal. 259(4):1043–1072, 2010. https://doi.org/10.1016/j.jfa.2010.04.017
  • B. Dupire, Functional Itô calculus, Bloomberg Portfolio Research paper 2009-04, 2009. https://ssrn.com/abstract=1435551
  • D. Ocone, Malliavin's calculus and stochastic integral representations of functionals of diffusion processes, Stochastics 12:161–185, 1984. https://doi.org/10.1080/17442508408833299
  • P. Protter, Stochastic Integration and Differential Equations, 2nd ed., Springer, 2005. https://doi.org/10.1007/978-3-662-10061-5
14 thms1 active userReviewed
Operations ResearchOptimal TransportOptimization·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 2: The Shadow of γ1 + γ2 in ν Is the Shadow of γ1 Plus the Shadow of γ2 in What RemainsResearch Paper

Motivation

The martingale optimal transport problem asks for a coupling of two probability measures μ,ν\mu,\nuμ,ν on R\mathbb RR that is the law of a one-step martingale and minimizes an expected cost. It arises in robust finance, where the marginals are the risk-neutral laws of an asset at two dates implied by option prices, and model-independent price bounds for exotic options are the extreme values of the problem (Beiglböck, Henry-Labordère, Penkner 2013; Galichon, Henry-Labordère, Touzi 2014).

Beiglböck and Juillet (arXiv:1208.1509v2, Ann. Probab. 44(1), 2016) construct a canonical martingale coupling, the left-curtain coupling, which plays the role that the monotone (quantile) coupling plays in classical transport. Its construction rests on one object, the shadow of a measure in another, and on one structural property of it: shadows are associative. This mission formalizes that property, Theorem 4.8 of the paper, together with the chain of results in §2.3 and §4.1–4.3 on which it rests.

Setting

Let M\mathcal MM be the set of finite Borel measures on R\mathbb RR with finite first moment, of any total mass. For μ,ν∈M\mu,\nu\in\mathcal Mμ,ν∈M:

  • the convex order μ⪯Cν\mu\preceq_C\nuμ⪯C​ν holds if ∫φ dμ≤∫φ dν\int\varphi\,d\mu\le\int\varphi\,d\nu∫φdμ≤∫φdν for every convex φ:R→R\varphi:\mathbb R\to\mathbb Rφ:R→R (this forces equal masses and equal barycentres);
  • the extended convex order μ⪯Eν\mu\preceq_E\nuμ⪯E​ν holds if the same inequality holds for every nonnegative convex φ\varphiφ; it holds both when μ⪯Cν\mu\preceq_C\nuμ⪯C​ν and when μ≤ν\mu\le\nuμ≤ν setwise;
  • the potential function of μ\muμ is uμ(x)=∫∣y−x∣ dμ(y)u_\mu(x)=\int|y-x|\,d\mu(y)uμ​(x)=∫∣y−x∣dμ(y);
  • a sequence (νn)(\nu_n)(νn​) converges weakly in M\mathcal MM to ν\nuν if ∫f dνn→∫f dν\int f\,d\nu_n\to\int f\,d\nu∫fdνn​→∫fdν for every continuous bounded fff and ∫∣x∣ dνn→∫∣x∣ dν\int|x|\,d\nu_n\to\int|x|\,d\nu∫∣x∣dνn​→∫∣x∣dν.

If μ⪯Eν\mu\preceq_E\nuμ⪯E​ν, a shadow of μ\muμ in ν\nuν is a measure η\etaη with (i) η≤ν\eta\le\nuη≤ν, (ii) μ⪯Cη\mu\preceq_C\etaμ⪯C​η, and (iii) η⪯Cη′\eta\preceq_C\eta'η⪯C​η′ for every η′\eta'η′ satisfying (i) and (ii). Lemma 4.6 of the paper shows that it exists and is unique; it is written Sν(μ)S^\nu(\mu)Sν(μ). It is the least spread-out part of ν\nuν into which μ\muμ can be transported by a martingale. An atom is a measure α δx\alpha\,\delta_xαδx​ with α≥0\alpha\ge0α≥0.

In the Lean development these objects are InM, ConvexLE, ExtConvexLE, potential, ConvergesInM and the predicate IsShadow ν μ η, in the namespace MartOT.Shadow.

Formalization targets

Goal: Theorem 4.8 (shadow of a sum), p. 25

For γ1,γ2,ν∈M\gamma_1,\gamma_2,\nu\in\mathcal Mγ1​,γ2​,ν∈M with γ1+γ2⪯Eν\gamma_1+\gamma_2\preceq_E\nuγ1​+γ2​⪯E​ν,

γ2⪯Eν−Sν(γ1)andSν(γ1+γ2)=Sν(γ1)+Sν−Sν(γ1)(γ2).\gamma_2\preceq_E\nu-S^\nu(\gamma_1)\qquad\text{and}\qquad S^\nu(\gamma_1+\gamma_2)=S^\nu(\gamma_1)+S^{\nu-S^\nu(\gamma_1)}(\gamma_2).γ2​⪯E​ν−Sν(γ1​)andSν(γ1​+γ2​)=Sν(γ1​)+Sν−Sν(γ1​)(γ2​).

Milestones, in attack order

  1. Proposition 4.2 (p. 21): for equal masses, μ⪯Cν  ⟺  uμ≤uν\mu\preceq_C\nu\iff u_\mu\le u_\nuμ⪯C​ν⟺uμ​≤uν​; μ≤ν  ⟺  uν−uμ\mu\le\nu\iff u_\nu-u_\muμ≤ν⟺uν​−uμ​ is convex; for fixed mass and mean, convergence in M\mathcal MM is pointwise convergence of potential functions.
  2. Proposition 4.4 (p. 21): μ⪯Eν\mu\preceq_E\nuμ⪯E​ν implies μ⪯Cθ\mu\preceq_C\thetaμ⪯C​θ for some θ≤ν\theta\le\nuθ≤ν.
  3. Lemma 4.6 (p. 23): existence, uniqueness and property (iii′) of the shadow.
  4. Example 4.7 (p. 24): the shadow of an atom is the restriction of ν\nuν between two quantiles.
  5. Lemma 4.11 (p. 27): η−Sη(δ)≤ν−Sν(δ)\eta-S^\eta(\delta)\le\nu-S^\nu(\delta)η−Sη(δ)≤ν−Sν(δ) for an atom δ⪯Eη≤ν\delta\preceq_E\eta\le\nuδ⪯E​η≤ν.
  6. Lemma 4.12 (p. 27): the goal when γ1\gamma_1γ1​ is an atom.
  7. Lemma 4.13 (p. 28): the shadow of finitely many atoms, built one atom at a time.
  8. Lemma 2.9 (p. 15): approximation of γ∈M\gamma\in\mathcal Mγ∈M by a ⪯C\preceq_C⪯C​-increasing sequence of finitely supported measures below it.
  9. Proposition 4.15 (p. 29): shadows pass to limits of ⪯C\preceq_C⪯C​-increasing sequences.
  10. Lemma 4.16 (p. 29): the goal when γ2\gamma_2γ2​ is an atom, with δ⪯ESν(γ+δ)−Sν(γ)\delta\preceq_E S^\nu(\gamma+\delta)-S^\nu(\gamma)δ⪯E​Sν(γ+δ)−Sν(γ).

Significance

Theorem 4.8 is what makes the left-curtain coupling well defined and consistent. That coupling is the martingale plan which, for every xxx, sends μ∣]−∞,x]\mu|_{]-\infty,x]}μ∣]−∞,x]​ onto Sν(μ∣]−∞,x])S^\nu(\mu|_{]-\infty,x]})Sν(μ∣]−∞,x]​) (Theorem 4.18). Associativity says that the parts of ν\nuν assigned to μ∣]−∞,x]\mu|_{]-\infty,x]}μ∣]−∞,x]​ and to μ∣]x,x′]\mu|_{]x,x']}μ∣]x,x′]​ fit together into the part assigned to μ∣]−∞,x′]\mu|_{]-\infty,x']}μ∣]−∞,x′]​, so the family of shadows defines a single coupling. The uniqueness of left-monotone martingale plans and the optimality of the left-curtain coupling for the costs h(y−x)h(y-x)h(y−x) with h′h'h′ strictly convex, both later results of the paper, rest on it.

The result is proved in the paper. As far as is known it has no machine-checked proof. This mission produces a statement of it, and of the supporting results, in terms of measures of arbitrary finite mass with no reference to a chosen shadow function. A complete development would give Lean a theory of the convex order on finite measures through potential functions, which is reusable well beyond martingale transport.

Difficulty

For finitely atomic measures the identity follows by adding one atom at a time (Lemmas 4.12, 4.13, 4.16), but even the single-atom step needs a monotonicity property of shadows of atoms in varying targets (Lemma 4.11), and that property comes from their explicit description through quantile functions. The general case cannot be obtained by a direct manipulation of the minimality property (iii): minimality of Sν(γ1)S^\nu(\gamma_1)Sν(γ1​) and of Sν−Sν(γ1)(γ2)S^{\nu-S^\nu(\gamma_1)}(\gamma_2)Sν−Sν(γ1​)(γ2​) separately says nothing obvious about minimality of their sum among measures dominating γ1+γ2\gamma_1+\gamma_2γ1​+γ2​, because a competitor for the sum need not split into competitors for the summands. The paper passes to the limit along convex-order approximations, which requires a continuity property of the shadow (Proposition 4.15) in the topology of M\mathcal MM.

Formalization scope

  • Measures are MeasureTheory.Measure ℝ with membership in M\mathcal MM stated explicitly (InM: finite measure, identity integrable). Masses are arbitrary; nothing is normalized to probability measures.
  • Integrals of convex test functions are taken in EReal through the published ModelRiskOT.Duality.extIntegral (positive minus negative part), never as Bochner integrals, so a non-integrable test function cannot produce a junk value. The extended convex order uses lower Lebesgue integrals of nonnegative functions.
  • Shadows are the predicate IsShadow ν μ η, never a function built by choice. Every statement about Sν(⋅)S^\nu(\cdot)Sν(⋅) quantifies over all shadows, which with existence and uniqueness (Lemma 4.6, a milestone) is the paper's statement. Uniqueness is part of the conclusion of Lemma 4.6 and is not assumed elsewhere.
  • ν−η\nu-\etaν−η is Mathlib's truncated subtraction of measures. It is used only where η≤ν\eta\le\nuη≤ν is guaranteed by property (i) of a shadow. Lemma 4.16 additionally asserts Sν(γ)≤Sν(γ+δ)S^\nu(\gamma)\le S^\nu(\gamma+\delta)Sν(γ)≤Sν(γ+δ), so that the difference there is a genuine one.
  • Not a trivialization: in the goal, neither η1+η2≤ν\eta_1+\eta_2\le\nuη1​+η2​≤ν nor γ1+γ2⪯Cη1+η2\gamma_1+\gamma_2\preceq_C\eta_1+\eta_2γ1​+γ2​⪯C​η1​+η2​ nor the minimality of η1+η2\eta_1+\eta_2η1​+η2​ is assumed; all three are the content of the conclusion IsShadow ν (γ1 + γ2) (η1 + η2).
  • Added relative to the page: Lemma 4.11 states ν∈M\nu\in\mathcal Mν∈M, which the paper takes from context. Proposition 4.2's third bullet is split into an equivalence for each candidate limit and a uniqueness clause, which together are equivalent to the printed sentence. Lemma 4.10 (continuity of ν↦Sν(δ)\nu\mapsto S^\nu(\delta)ν↦Sν(δ) in the Kantorovich metric) and Proposition 4.17 are not included.
  • Needed infrastructure: potential functions and their second distributional derivatives, quantile functions of finite measures, weak convergence of finite measures with first moments. Contributions to any of these are welcome.

Selected references

  • M. Beiglböck, N. Juillet, On a problem of optimal transport under marginal martingale constraints, Ann. Probab. 44(1), 42–106, 2016. arXiv:1208.1509v2, doi:10.1214/14-AOP966
  • M. Beiglböck, P. Henry-Labordère, F. Penkner, Model-independent bounds for option prices — a mass transport approach, Finance Stoch. 17(3), 477–501, 2013. doi:10.1007/s00780-013-0205-8
  • A. Galichon, P. Henry-Labordère, N. Touzi, A stochastic control approach to no-arbitrage bounds given marginals, with an application to lookback options, Ann. Appl. Probab. 24(1), 312–336, 2014. doi:10.1214/13-AAP925
  • V. Strassen, The existence of probability measures with given marginals, Ann. Math. Statist. 36, 423–439, 1965. doi:10.1214/aoms/1177700153
17 thms1 active userReviewed
Operations ResearchOptimal TransportOptimization·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 7: For c = |y − x| and Continuous µ the Optimizer Is Unique, Keeps µ ∧ ν in Place, Splits the Rest in TwoResearch Paper

Motivation

A martingale transport plan between two laws μ\muμ and ν\nuν on R\mathbb RR is a joint law of a pair (X,Y)(X,Y)(X,Y) with X∼μX\sim\muX∼μ, Y∼νY\sim\nuY∼ν and E[Y∣X]=XE[Y\mid X]=XE[Y∣X]=X. Minimizing or maximizing E[c(X,Y)]E[c(X,Y)]E[c(X,Y)] over such plans gives the model-independent price bounds of an option with payoff c(X,Y)c(X,Y)c(X,Y) when the market quotes vanilla options at two maturities, and so fixes the marginal laws μ\muμ and ν\nuν of the asset price. For the forward-starting straddle, with payoff ∣Y−X∣|Y-X|∣Y−X∣, the two bounds are the problems with costs −∣y−x∣-|y-x|−∣y−x∣ and ∣y−x∣|y-x|∣y−x∣.

  • 1965: Strassen (doi:10.1214/aoms/1177700153) shows that martingale plans between μ\muμ and ν\nuν exist if and only if μ\muμ and ν\nuν are in convex order.
  • 2012: Hobson and Neuberger (doi:10.1111/j.1467-9965.2010.00473.x) identify the optimizer for −∣y−x∣-|y-x|−∣y−x∣ through a construction of dual maximizers, under conditions on the marginals.
  • 2012: Hobson and Klimmek communicate a description of the optimizer for +∣y−x∣+|y-x|+∣y−x∣ to Beiglböck and Juillet, cited there as private communication (arXiv:1208.1509v2, §7.4 and reference 15).
  • 2016: Beiglböck and Juillet (arXiv:1208.1509v2) prove existence, uniqueness and the shape of the optimizer for ∣y−x∣|y-x|∣y−x∣ for every continuous starting law, using only the primal problem and their variational lemma.

Setting

μ\muμ and ν\nuν are Borel probability measures on R\mathbb RR with finite first moments, in convex order: ∫φ dμ≤∫φ dν\int\varphi\,d\mu\le\int\varphi\,d\nu∫φdμ≤∫φdν for every convex φ:R→R\varphi:\mathbb R\to\mathbb Rφ:R→R (Definition 2.1). ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν) is the set of measures π\piπ on R2\mathbb R^2R2 with marginals μ\muμ and ν\nuν such that y−xy-xy−x is π\piπ-integrable and

∫ρ(x) (y−x) dπ(x,y)=0for every bounded Borel ρ,\int\rho(x)\,(y-x)\,d\pi(x,y)=0\qquad\text{for every bounded Borel }\rho,∫ρ(x)(y−x)dπ(x,y)=0for every bounded Borel ρ,

which is the paper's characterization (4) of "the disintegration πx\pi_xπx​ has barycentre xxx". For the cost c(x,y)=∣y−x∣c(x,y)=|y-x|c(x,y)=∣y−x∣ the cost of a plan is ∫∣y−x∣ dπ∈[0,∞)\int|y-x|\,d\pi\in[0,\infty)∫∣y−x∣dπ∈[0,∞), and π\piπ is optimal if it minimizes this over ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν). μ\muμ is continuous if μ({x})=0\mu(\{x\})=0μ({x})=0 for every xxx.

μ∧ν\mu\wedge\nuμ∧ν is the largest measure below both μ\muμ and ν\nuν (Example 2.5); (Id⊗Id)#η(\mathrm{Id}\otimes\mathrm{Id})_\#\eta(Id⊗Id)#​η is the image of η\etaη under x↦(x,x)x\mapsto(x,x)x↦(x,x), a measure on the diagonal Δ={(x,x)}\Delta=\{(x,x)\}Δ={(x,x)}. For Γ⊆R2\Gamma\subseteq\mathbb R^2Γ⊆R2, Γx={y:(x,y)∈Γ}\Gamma_x=\{y:(x,y)\in\Gamma\}Γx​={y:(x,y)∈Γ}, and graph⁡(T)={(x,T(x))}\operatorname{graph}(T)=\{(x,T(x))\}graph(T)={(x,T(x))}.

Formalization targets

Goal: Theorem 7.4 (p. 43)

If μ⪯Cν\mu\preceq_C\nuμ⪯C​ν and μ\muμ is continuous, there is a unique optimal πabs∈ΠM(μ,ν)\pi_{\mathrm{abs}}\in\Pi_M(\mu,\nu)πabs​∈ΠM​(μ,ν) for c(x,y)=∣y−x∣c(x,y)=|y-x|c(x,y)=∣y−x∣; it is concentrated on a set Γ\GammaΓ with ∣Γx∣≤3|\Gamma_x|\le3∣Γx​∣≤3 for every xxx; and

πabs=(Id⊗Id)#(μ∧ν)+πgo,πgo concentrated on graph⁡(T1)∪graph⁡(T2)\pi_{\mathrm{abs}}=(\mathrm{Id}\otimes\mathrm{Id})_\#(\mu\wedge\nu)+\pi_{\mathrm{go}},\qquad \pi_{\mathrm{go}}\ \text{concentrated on}\ \operatorname{graph}(T_1)\cup\operatorname{graph}(T_2)πabs​=(Id⊗Id)#​(μ∧ν)+πgo​,πgo​ concentrated on graph(T1​)∪graph(T2​)

for some functions T1,T2:R→RT_1,T_2:\mathbb R\to\mathbb RT1​,T2​:R→R.

Milestones, in attack order

  1. Attainment of the minimum (§2.1, pp. 10–11).
  2. Lemma 1.11, the variational lemma (p. 8).
  3. Lemma 7.5, the sign of a three-point cost difference (pp. 43–44).
  4. The forbidden configurations (24) on a finitely optimal set (p. 45).
  5. The static part: π∣Δ=(Id⊗Id)#(μ∧ν)\pi|_\Delta=(\mathrm{Id}\otimes\mathrm{Id})_\#(\mu\wedge\nu)π∣Δ​=(Id⊗Id)#​(μ∧ν) for every optimal π\piπ (pp. 45–46).
  6. Lemma 3.2, accumulation of uncountably many large fibres (p. 19).
  7. At most two off-diagonal points per fibre (p. 46).
  8. The reduced problem between μ−μ∧ν\mu-\mu\wedge\nuμ−μ∧ν and ν−μ∧ν\nu-\mu\wedge\nuν−μ∧ν (p. 46).
  9. Lemma 5.5, two Borel graphs (p. 35), and Lemma 5.6, uniqueness from at most two points per fibre (p. 36).

Significance

The theorem identifies the lower model-independent bound for the forward-starting straddle: the extremal model keeps the mass that μ\muμ and ν\nuν share in place and splits every other starting point between at most two destinations. With Theorem 7.3 for −∣y−x∣-|y-x|−∣y−x∣ it settles both bounds for continuous μ\muμ without any dual attainment, which is known to fail in general. The decomposition into a static part μ∧ν\mu\wedge\nuμ∧ν and a part between marginals with μˉ∧νˉ=0\bar\mu\wedge\bar\nu=0μˉ​∧νˉ=0 is a reduction that applies to other costs vanishing on the diagonal.

The result is proved in the paper; nothing in it has been machine-checked. The mission produces a formal statement of Theorem 7.4 and of each step of its proof, a Lean vocabulary for martingale transport on R\mathbb RR shared with the other missions of this series, and the general measure-theoretic lemmas (3.2, 5.5, 5.6) that the structure theorems of the paper all use.

Difficulty

Lemma 7.5 and (24) are elementary; the work lies in passing from them to statements about measures. The variational lemma needs Kellerer's duality-type result for finitely optimal sets. The static part requires showing that a positive defect κ=μ∧ν−π(Δ-projection)\kappa=\mu\wedge\nu-\pi(\Delta\text{-projection})κ=μ∧ν−π(Δ-projection) produces, at κ\kappaκ-almost every point, a forbidden configuration, which uses the disintegration of the moving part. The cardinality bound requires the accumulation argument of Lemma 3.2, and the forbidden configurations only hold for points that lie strictly inside the range of their own fibre, which the martingale condition supplies only almost everywhere. Uniqueness does not follow from strict convexity of a cost functional, since the problem is linear: it comes from the two-graph structure through Lemma 5.6, and it fails if μ\muμ has atoms (Remark 7.7).

Formalization scope

Measures are Mathlib Measure ℝ and Measure (ℝ × ℝ) with Borel σ-algebras. Costs are integrals in the extended reals through the published ModelRiskOT.Duality.extIntegral; the cost ∣y−x∣|y-x|∣y−x∣ is nonnegative and, under finite first moments, finite. Martingale plans are encoded by condition (4), competitors by the same device. μ∧ν\mu\wedge\nuμ∧ν is the infimum in Mathlib's complete lattice of measures, measure subtraction is Mathlib's truncated subtraction, cardinalities of fibres are Set.encard in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}, and "concentrated on AAA" is π(Ac)=0\pi(A^c)=0π(Ac)=0. Continuity of μ\muμ is μ({x})=0\mu(\{x\})=0μ({x})=0 for all xxx. As on the page, Γ\GammaΓ, T1T_1T1​ and T2T_2T2​ in the goal carry no measurability requirement.

Two choices differ from a literal reading and are disclosed in the items: (24) carries the hypothesis y−<x<y+y^-<x<y^+y−<x<y+ of Lemma 7.5, which the page invokes and without which (24) is false; and the steps that do not need continuity of μ\muμ (the static part, the reduced problem) are stated without it.

A trivializing formalization is ruled out: μ∧ν\mu\wedge\nuμ∧ν is the lattice infimum of measures, not a product and not a pointwise minimum of set values, and all four conjuncts of the goal (existence, uniqueness, the bound 3, the decomposition) are asserted together.

Reusable beyond this mission: the Setting layer (convex order, ΠM\Pi_MΠM​, competitors), Lemma 3.2, Lemma 5.5 (a Lusin–Novikov consequence) and Lemma 5.6. Proofs of any milestone, and infrastructure on disintegrations of plans on R2\mathbb R^2R2, are welcome.

Selected references

  • M. Beiglböck, N. Juillet, On a problem of optimal transport under marginal martingale constraints, Ann. Probab. 44(1), 42–106, 2016. arXiv:1208.1509v2, doi:10.1214/14-AOP966
  • D. Hobson, A. Neuberger, Robust bounds for forward start options, Mathematical Finance 22(1), 31–56, 2012. doi:10.1111/j.1467-9965.2010.00473.x
  • V. Strassen, The existence of probability measures with given marginals, Ann. Math. Statist. 36, 423–439, 1965. doi:10.1214/aoms/1177700153
  • A. S. Kechris, Classical Descriptive Set Theory, Graduate Texts in Mathematics 156, Springer, 1995 (Theorem 18.11). doi:10.1007/978-1-4612-4190-4
13 thms1 active userReviewed
Operations ResearchOptimal TransportOptimization·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 3: Between Probability Measures in Convex Order There Is Exactly One Left-Monotone Martingale PlanResearch Paper

Motivation

In classical optimal transport on the real line, one coupling plays a distinguished role: the monotone (Hoeffding–Fréchet) coupling, which sends the qqq-quantile of the first marginal to the qqq-quantile of the second. It is canonical (every initial segment of the first marginal goes as far left as possible) and it is optimal for a whole family of costs at once.

Martingale optimal transport adds the constraint that the coupling be the law of a one-step martingale (X,Y)(X, Y)(X,Y), E[Y∣X]=X\mathbb E[Y\mid X]=XE[Y∣X]=X. The problem arises in robust (model-independent) mathematical finance: prices of vanilla options fix the marginal laws μ\muμ of XXX and ν\nuν of YYY, and bounds on the price of an exotic option c(X,Y)c(X,Y)c(X,Y) that hold under every arbitrage-free model are values of the martingale transport problem (Beiglböck, Henry-Labordère, Penkner 2013; Galichon, Henry-Labordère, Touzi 2014). Martingale couplings exist exactly when μ\muμ and ν\nuν are in convex order (Strassen 1965).

Beiglböck and Juillet (arXiv:1208.1509, Ann. Probab. 44(1), 2016) asked for the martingale counterpart of the monotone coupling, and found it: the left-curtain coupling πlc\pi_{\mathrm{lc}}πlc​. This mission formalizes its existence and uniqueness (Theorem 1.5), which is the foundation for the paper's later optimality results (Theorems 1.7, 6.1 and 6.3, other missions of this series).

Setting

All measures are Borel measures on R\mathbb RR or R×R\mathbb R\times\mathbb RR×R. M\mathcal MM is the set of finite measures μ\muμ with ∫∣x∣ dμ<∞\int|x|\,d\mu<\infty∫∣x∣dμ<∞. For μ,ν∈M\mu,\nu\in\mathcal Mμ,ν∈M:

  • Convex order μ⪯Cν\mu\preceq_C\nuμ⪯C​ν: ∫φ dμ≤∫φ dν\int\varphi\,d\mu\le\int\varphi\,d\nu∫φdμ≤∫φdν for every convex φ:R→R\varphi:\mathbb R\to\mathbb Rφ:R→R (Definition 2.1). It forces equal mass and equal mean. Extended convex order μ⪯Eν\mu\preceq_E\nuμ⪯E​ν: the same inequality for nonnegative convex φ\varphiφ only (Definition 4.3); it allows μ(R)<ν(R)\mu(\mathbb R)<\nu(\mathbb R)μ(R)<ν(R).
  • Martingale transport plans ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν): measures π\piπ on R2\mathbb R^2R2 with marginals μ\muμ and ν\nuν and ∫ρ(x)(y−x) dπ(x,y)=0\int\rho(x)(y-x)\,d\pi(x,y)=0∫ρ(x)(y−x)dπ(x,y)=0 for every bounded Borel ρ\rhoρ, that is, the conditional barycentre of πx\pi_xπx​ is xxx for μ\muμ-a.e. xxx.
  • Left-monotone plans (Definition 1.4): π\piπ is concentrated on a Borel set Γ\GammaΓ that contains no three points (x,y−),(x,y+),(x′,y′)(x,y^-),(x,y^+),(x',y')(x,y−),(x,y+),(x′,y′) with x<x′x<x'x<x′ and y−<y′<y+y^-<y'<y^+y−<y′<y+. Mass leaving a point xxx to both sides of y′y'y′ forbids any later point x′>xx'>xx′>x from sending mass to y′y'y′.
  • Shadow (Lemma 4.6): for μ⪯Eν\mu\preceq_E\nuμ⪯E​ν, Sν(μ)S^\nu(\mu)Sν(μ) is the measure η≤ν\eta\le\nuη≤ν with μ⪯Cη\mu\preceq_C\etaμ⪯C​η that is least in the convex order among all such η\etaη: the least spread-out part of ν\nuν into which μ\muμ can be embedded by a martingale.
  • Left-curtain coupling (Theorem 4.18): the plan πlc\pi_{\mathrm{lc}}πlc​ with proj⁡#x(πlc∣]−∞,x]×R)=μ∣]−∞,x]\operatorname{proj}^x_\#(\pi_{\mathrm{lc}}|_{]-\infty,x]\times\mathbb R})=\mu|_{]-\infty,x]}proj#x​(πlc​∣]−∞,x]×R​)=μ∣]−∞,x]​ and νxπlc:=proj⁡#y(πlc∣]−∞,x]×R)=Sν(μ∣]−∞,x])\nu^{\pi_{\mathrm{lc}}}_x:=\operatorname{proj}^y_\#(\pi_{\mathrm{lc}}|_{]-\infty,x]\times\mathbb R})=S^\nu(\mu|_{]-\infty,x]})νxπlc​​:=proj#y​(πlc​∣]−∞,x]×R​)=Sν(μ∣]−∞,x]​) for every xxx.

In Lean these are InM, ConvexLE, ExtConvexLE, IsMartingalePlan, IsLeftMonotone, IsShadow, IsLeftCurtain and targetUpTo in the shared namespace MartOT.Var. The mission's own theorems are in MartOT.Curtain.

Formalization targets

Goal: Theorem 1.5 (p. 6)

For probability measures μ⪯Cν\mu\preceq_C\nuμ⪯C​ν on R\mathbb RR with finite first moments,

∃! ππ∈ΠM(μ,ν)  and  π is left-monotone.\exists!\,\pi\quad\pi\in\Pi_M(\mu,\nu)\ \text{ and }\ \pi\text{ is left-monotone}.∃!ππ∈ΠM​(μ,ν)  and  π is left-monotone.

Existence alone, or uniqueness only among left-curtain plans, is not the goal: the statement says that monotonicity alone singles out one martingale coupling.

Milestones

  1. Lemma 4.6: shadows exist and are unique, and satisfy (iii′) for the extended order.
  2. Monotonicity of shadows (§4.4, p. 31): μ≤μ′⪯Eν\mu\le\mu'\preceq_E\nuμ≤μ′⪯E​ν implies Sν(μ)≤Sν(μ′)S^\nu(\mu)\le S^\nu(\mu')Sν(μ)≤Sν(μ′).
  3. Theorem 4.18: πlc\pi_{\mathrm{lc}}πlc​ exists, is unique, is a probability measure and lies in ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν).
  4. Theorem 1.8: νtπlc⪯Cνtπ\nu^{\pi_{\mathrm{lc}}}_t\preceq_C\nu^\pi_tνtπlc​​⪯C​νtπ​ for every ttt and every π∈ΠM(μ,ν)\pi\in\Pi_M(\mu,\nu)π∈ΠM​(μ,ν).
  5. Lemma 1.11 (variational lemma): an optimal plan of finite cost lives on a Borel set on which no finitely supported measure has a cheaper competitor.
  6. Proof of Theorem 4.21: πlc\pi_{\mathrm{lc}}πlc​ is optimal for every cost cs,t(x,y)=1]−∞,s](x)∣y−t∣c_{s,t}(x,y)=\mathbf 1_{]-\infty,s]}(x)|y-t|cs,t​(x,y)=1]−∞,s]​(x)∣y−t∣.
  7. Theorem 4.21: πlc\pi_{\mathrm{lc}}πlc​ is left-monotone (the existence half of the goal).
  8. Lemma 5.1: end-point behaviour of μ⪯Cν\mu\preceq_C\nuμ⪯C​ν at sup⁡spt⁡μ\sup\operatorname{spt}\musupsptμ and inf⁡spt⁡μ\inf\operatorname{spt}\muinfsptμ.
  9. Lemma 5.2: a nonzero signed measure of mass 000 is detected by a test function ga,bg_{a,b}ga,b​ anchored in the support of its positive part.
  10. Theorem 5.3: every left-monotone martingale plan is the left-curtain coupling of its marginals (the uniqueness half).

Significance

Theorem 1.5 identifies a canonical martingale coupling defined by a geometric property of its support alone. The paper then shows that πlc\pi_{\mathrm{lc}}πlc​ is the unique optimizer of the martingale transport problem for costs h(y−x)h(y-x)h(y−x) with h′h'h′ strictly convex (Theorem 1.7) and that it is characterized by the convex-order minimality of Theorem 1.8. The left-curtain coupling has since been studied and generalized in a series of works (for instance Henry-Labordère and Touzi 2016).

The result is proved in the paper. It has, as far as the platform's catalogue shows, no machine-checked proof: no statement about martingale transport plans, shadows or the left-curtain coupling exists on Prove2Me. A formal development would produce reusable infrastructure: the convex order on finite measures of arbitrary mass, shadows, and the passage between the barycentre characterization (4) of martingale plans and their disintegrations.

Difficulty

Existence is not the hard part in the abstract: a left-monotone plan can be obtained as an optimizer for a suitable cost via the variational lemma. The construction through shadows is more delicate: one must show that the shadows of the initial segments μ∣]−∞,x]\mu|_{]-\infty,x]}μ∣]−∞,x]​ increase with xxx (this rests on Theorem 4.8, the shadow of a sum) and that the resulting plan satisfies the martingale property.

Uniqueness is the main obstacle. The classical argument for uniqueness of optimal plans (averaging two candidates and using strict convexity) requires a continuous first marginal and does not apply to arbitrary μ\muμ with atoms. The paper's argument is specific to the problem: it compares νxπ\nu^\pi_xνxπ​ with the shadow νxπlc\nu^{\pi_{\mathrm{lc}}}_xνxπlc​​ through the test functions gu,vg_{u,v}gu,v​ and a case analysis at the support end-points, which needs the measure-theoretic Lemmas 5.1 and 5.2.

Formalization scope

  • Measures are MeasureTheory.Measure ℝ and Measure (ℝ × ℝ) with Borel σ-algebras. The goal and Theorems 1.8, 4.18, 4.21 take μ,ν\mu,\nuμ,ν probability measures (IsProbabilityMeasure) in convex order; Lemma 4.6, the shadow monotonicity, Lemma 5.1 and Theorem 5.3 work in M\mathcal MM, as the paper's Sections 4–5 do.
  • Integrals of convex functions and costs are extended-real valued (EReal, through the published ModelRiskOT.Duality.extIntegral), so no Bochner integral of a non-integrable function enters a statement. ΠM\Pi_MΠM​ is encoded by characterization (4) of the paper, not by disintegrations.
  • Shadows and the left-curtain coupling are predicates (IsShadow, IsLeftCurtain), never chosen functions: their existence and uniqueness are milestones, not definitions. A formalization that defined πlc\pi_{\mathrm{lc}}πlc​ by a choice and the left-monotone plan as "the left-curtain plan" would make the goal circular; the goal mentions only ΠM\Pi_MΠM​ and left-monotonicity.
  • "π(Γ)=1\pi(\Gamma)=1π(Γ)=1" is written π(Γc)=0\pi(\Gamma^c)=0π(Γc)=0; the support of a measure is Mathlib's Measure.support.
  • No hypothesis is added to any statement of the page. In Lemma 5.1, sup⁡spt⁡μ\sup\operatorname{spt}\musupsptμ is the real supremum of the support under BddAbove; at μ=0\mu=0μ=0 Lean's convention sup⁡∅=0\sup\emptyset=0sup∅=0 applies.
  • Reading: Theorem 1.8's "minimal" is formalized as "least" (below every member of the family), which is how the paper uses it.
  • Strassen's theorem is not restated; it is already posed on the platform as PalmQueueing.Ordering.strassen_cx.

Contributions are welcome at every level: proofs of the milestones, auxiliary lemmas on the convex order of finite measures (potential functions uμu_\muuμ​, equality of mass and mean), and the equivalence between (4) and the disintegration form of the martingale property.

Selected references

  • M. Beiglböck, N. Juillet, On a problem of optimal transport under marginal martingale constraints, Ann. Probab. 44(1), 42–106, 2016. arXiv:1208.1509, doi:10.1214/14-AOP966
  • M. Beiglböck, P. Henry-Labordère, F. Penkner, Model-independent bounds for option prices — a mass transport approach, Finance Stoch. 17(3), 477–501, 2013. arXiv:1106.5929
  • A. Galichon, P. Henry-Labordère, N. Touzi, A stochastic control approach to no-arbitrage bounds given marginals, with an application to lookback options, Ann. Appl. Probab. 24(1), 312–336, 2014. doi:10.1214/13-AAP925
  • V. Strassen, The existence of probability measures with given marginals, Ann. Math. Statist. 36(2), 423–439, 1965. doi:10.1214/aoms/1177700153
  • P. Henry-Labordère, N. Touzi, An explicit martingale version of the one-dimensional Brenier theorem, Finance Stoch. 20(3), 635–668, 2016. arXiv:1302.4854
14 thms1 active userReviewed
Dynamical SystemsMachine LearningOptimization·Captain: mikedeng1

Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization 5: Decreasing-Step Adam Converges Almost Surely to the Critical Points of FResearch Paper

Motivation

Adam (Kingma and Ba, 2015) is the default optimizer for training neural networks: a stochastic gradient method that keeps an exponential moving average mnm_nmn​ of past gradients and an exponential moving average vnv_nvn​ of their coordinatewise squares, and divides the first by the square root of the second. Its practical success came well before any convergence theory for nonconvex objectives. Reddi, Kale and Kumar (2018) showed that Adam with constant momentum parameters can fail to converge even on convex problems, which made the question of under which parameter schedules Adam provably converges a live one.

Barakat and Bianchi (arXiv:1810.02263, SIAM J. Math. Data Sci. 2021) answer it through the ODE method of stochastic approximation (Benaïm, 1999). This mission takes the paper's almost-sure convergence theorem for Adam with decreasing stepsizes, Theorem 5.2. Under a stepsize schedule in which 1−αn1 - \alpha_n1−αn​ and 1−βn1 - \beta_n1−βn​ shrink in proportion to the stepsize γn\gamma_nγn​, the iterates converge almost surely to the critical points of the objective, provided they stay bounded.

Setting

Let ξ\xiξ be a random variable on a measurable space Ξ\XiΞ with law μ\muμ, let f:Rd×Ξ→Rf : \mathbb R^d \times \Xi \to \mathbb Rf:Rd×Ξ→R be an integrand with gradient ∇f(x,ξ)\nabla f(x, \xi)∇f(x,ξ) in xxx, and set

F(x)=Ef(x,ξ),S(x)=E(∇f(x,ξ)⊙2),S=∇F−1({0}),F(x) = \mathbb E f(x, \xi), \qquad S(x) = \mathbb E\big(\nabla f(x,\xi)^{\odot 2}\big), \qquad \mathcal S = \nabla F^{-1}(\{0\}),F(x)=Ef(x,ξ),S(x)=E(∇f(x,ξ)⊙2),S=∇F−1({0}),

where ⊙2\odot 2⊙2 is the coordinatewise square and S\mathcal SS is the critical set. Let ξ1,ξ2,…\xi_1, \xi_2, \dotsξ1​,ξ2​,… be iid copies of ξ\xiξ on a probability space (Ω,F,P)(\Omega, \mathcal F, \mathbb P)(Ω,F,P).

Algorithm 5.1 takes stepsizes γn>0\gamma_n > 0γn​>0, weights αn,βn∈[0,1]\alpha_n, \beta_n \in [0,1]αn​,βn​∈[0,1] and a constant ε>0\varepsilon > 0ε>0. Starting from x0∈Rdx_0 \in \mathbb R^dx0​∈Rd, m0=v0=0m_0 = v_0 = 0m0​=v0​=0 and r0=rˉ0=0r_0 = \bar r_0 = 0r0​=rˉ0​=0, it computes for n≥1n \ge 1n≥1, with all vector operations coordinatewise:

mn=αnmn−1+(1−αn)∇f(xn−1,ξn),vn=βnvn−1+(1−βn)∇f(xn−1,ξn)⊙2,rn=αnrn−1+(1−αn),rˉn=βnrˉn−1+(1−βn),xn=xn−1−γnm^nε+v^n,m^n=mn/rn,v^n=vn/rˉn.\begin{aligned} m_n &= \alpha_n m_{n-1} + (1-\alpha_n)\nabla f(x_{n-1}, \xi_n), & v_n &= \beta_n v_{n-1} + (1-\beta_n)\nabla f(x_{n-1}, \xi_n)^{\odot 2},\\ r_n &= \alpha_n r_{n-1} + (1 - \alpha_n), & \bar r_n &= \beta_n \bar r_{n-1} + (1 - \beta_n),\\ x_n &= x_{n-1} - \gamma_n \frac{\hat m_n}{\varepsilon + \sqrt{\hat v_n}}, & \hat m_n &= m_n / r_n,\quad \hat v_n = v_n / \bar r_n . \end{aligned}mn​rn​xn​​=αn​mn−1​+(1−αn​)∇f(xn−1​,ξn​),=αn​rn−1​+(1−αn​),=xn−1​−γn​ε+v^n​​m^n​​,​vn​rˉn​m^n​​=βn​vn−1​+(1−βn​)∇f(xn−1​,ξn​)⊙2,=βn​rˉn−1​+(1−βn​),=mn​/rn​,v^n​=vn​/rˉn​.​

The divisions by rnr_nrn​, rˉn\bar r_nrˉn​ are the bias correction.

The stepsizes satisfy Assumption 5.1: γn+1/γn→1\gamma_{n+1}/\gamma_n \to 1γn+1​/γn​→1, ∑nγn=+∞\sum_n \gamma_n = +\infty∑n​γn​=+∞, ∑nγn2<+∞\sum_n \gamma_n^2 < +\infty∑n​γn2​<+∞, and there are a,ba, ba,b with 0<b<4a0 < b < 4a0<b<4a, (1−αn)/γn→a(1-\alpha_n)/\gamma_n \to a(1−αn​)/γn​→a and (1−βn)/γn→b(1-\beta_n)/\gamma_n \to b(1−βn​)/γn​→b. The limiting dynamics is the autonomous ODE z˙=h∞(z)\dot z = h_\infty(z)z˙=h∞​(z) on Z+=Rd×Rd×[0,∞)d\mathcal Z_+ = \mathbb R^d \times \mathbb R^d \times [0,\infty)^dZ+​=Rd×Rd×[0,∞)d, written (ODE∞)(\mathrm{ODE}_\infty)(ODE∞​), with

h∞(x,m,v)=(−mε+v, a(∇F(x)−m), b(S(x)−v)).h_\infty(x, m, v) = \Big( -\frac{m}{\varepsilon + \sqrt v},\ a(\nabla F(x) - m),\ b(S(x) - v) \Big).h∞​(x,m,v)=(−ε+v​m​, a(∇F(x)−m), b(S(x)−v)).

Formalization targets

Goal: Theorem 5.2

Assume Assumption 2.2 (regularity and moments of fff), FFF coercive (2.3), S(x)>0S(x) > 0S(x)>0 coordinatewise (2.4), iid samples (4.1), Assumption 5.1, sup⁡x∈KE∥∇f(x,ξ)∥4<∞\sup_{x\in K}\mathbb E\|\nabla f(x,\xi)\|^4 < \inftysupx∈K​E∥∇f(x,ξ)∥4<∞ on compacts (4.2 i) with p=4p = 4p=4), that F(S)F(\mathcal S)F(S) has empty interior, and that (xn,mn,vn)(x_n, m_n, v_n)(xn​,mn​,vn​) is bounded with probability one. Then, almost surely,

d(xn,S)→0,mn→0,S(xn)−vn→0,d(x_n, \mathcal S) \to 0, \qquad m_n \to 0, \qquad S(x_n) - v_n \to 0,d(xn​,S)→0,mn​→0,S(xn​)−vn​→0,

and if S\mathcal SS is countable, almost surely (xn,mn,vn)→(x∗,0,S(x∗))(x_n, m_n, v_n) \to (x^*, 0, S(x^*))(xn​,mn​,vn​)→(x∗,0,S(x∗)) for some x∗∈Sx^* \in \mathcal Sx∗∈S.

Milestones

  1. Lemma 9.1 i)–ii): rn=1−∏i=1nαir_n = 1 - \prod_{i=1}^n \alpha_irn​=1−∏i=1n​αi​, and rnr_nrn​ increases to 111.
  2. §9.1: in the decomposition zˉn+1=zˉn+γn+1h∞(zˉn)+γn+1χn+1+γn+1ςn+1\bar z_{n+1} = \bar z_n + \gamma_{n+1} h_\infty(\bar z_n) + \gamma_{n+1}\chi_{n+1} + \gamma_{n+1}\varsigma_{n+1}zˉn+1​=zˉn​+γn+1​h∞​(zˉn​)+γn+1​χn+1​+γn+1​ςn+1​ of zˉn=(xn−1,mn,vn)\bar z_n = (x_{n-1}, m_n, v_n)zˉn​=(xn−1​,mn​,vn​), the remainder satisfies ςn→0\varsigma_n \to 0ςn​→0 almost surely.
  3. §9.1: the piecewise-affine interpolation of (zˉn)(\bar z_n)(zˉn​) on the times τn=∑k≤nγk\tau_n = \sum_{k\le n}\gamma_kτn​=∑k≤n​γk​ is almost surely a bounded asymptotic pseudotrajectory of the semiflow of (ODE∞)(\mathrm{ODE}_\infty)(ODE∞​).
  4. Proposition 7.13: (ODE∞)(\mathrm{ODE}_\infty)(ODE∞​) is well posed on Z+\mathcal Z_+Z+​ and defines a semiflow Φ\PhiΦ.
  5. Proposition 7.14 (after Benaïm): the limit set of a relatively compact asymptotic pseudotrajectory of a semiflow with a strict Lyapunov function lies in the set of equilibria.
  6. Proposition 7.15: on the closed hull of the orbits of a compact set, Wδ=V∞−δ⟨∇F(x),m⟩+δ∥S(x)−v∥2W_\delta = V_\infty - \delta\langle\nabla F(x), m\rangle + \delta\|S(x) - v\|^2Wδ​=V∞​−δ⟨∇F(x),m⟩+δ∥S(x)−v∥2 is a strict Lyapunov function for some δ>0\delta > 0δ>0.

Significance

The theorem identifies a regime of Adam's hyperparameters, 1−αn∼aγn1 - \alpha_n \sim a\gamma_n1−αn​∼aγn​ and 1−βn∼bγn1 - \beta_n \sim b\gamma_n1−βn​∼bγn​ with b<4ab < 4ab<4a, in which the algorithm behaves like a gradient method with vanishing noise: the iterates approach critical points, the momentum dies out, and the second-moment estimate converges to S(xn)S(x_n)S(xn​). The condition b<4ab < 4ab<4a ties the two averaging rates together. It is the condition under which the paper's Lyapunov function for the continuous dynamics decreases (Lemma 7.5). The argument structure is also a template for other adaptive methods: once the limiting ODE has a strict Lyapunov function, almost-sure convergence of the iterates follows from the same steps.

The paper proves the result on paper; none of it is machine-checked. A formal proof would also be the first formal instance on Prove2Me of the full ODE method for a concrete stochastic algorithm. That pipeline runs from the iterates to a perturbed Euler scheme, then to an asymptotic pseudotrajectory and a limit-set theorem, and finally to convergence. Benaïm's general results are being formalized separately on the platform (the asymptotic-pseudotrajectory definition this mission reuses comes from that effort), so the two developments meet in milestone 3.

Difficulty

The obvious approach is to treat Adam as stochastic gradient descent with a preconditioner and run a descent-lemma argument on F(xn)F(x_n)F(xn​). This fails because the update direction m^n/(ε+v^n)\hat m_n/(\varepsilon + \sqrt{\hat v_n})m^n​/(ε+v^n​​) is not a descent direction for FFF: mnm_nmn​ lags behind ∇F(xn)\nabla F(x_n)∇F(xn​). Any Lyapunov function has to involve the momentum, and FFF alone does not decrease. The continuous-time energy V∞V_\inftyV∞​ decreases only weakly, and only its perturbation WδW_\deltaWδ​ is strict, and only on compact sets. A second difficulty is that the stepsize-dependent coefficients (1−αn+1)/γn+1(1-\alpha_{n+1})/\gamma_{n+1}(1−αn+1​)/γn+1​ and the bias corrections rnr_nrn​, rˉn\bar r_nrˉn​ make the recursion a non-autonomous perturbation of the Euler scheme of h∞h_\inftyh∞​. The remainder must be shown to vanish along almost every path before the general theory applies. Finally, the abstract limit-set theorem needs the semiflow to be well defined on the closed set Z+\mathcal Z_+Z+​, where h∞h_\inftyh∞​ involves v\sqrt vv​ and is not Lipschitz at v=0v = 0v=0.

Formalization scope

Rd\mathbb R^dRd is EuclideanSpace ℝ (Fin d). The state space Z\mathcal ZZ is the product of three copies with Mathlib's max-of-factors norm, which is equivalent to the Euclidean norm of R3d\mathbb R^{3d}R3d and leaves boundedness and limits unchanged. FFF and SSS are Bochner integrals against the law μ\muμ. Assumption 2.2 makes the integrands integrable, so they are the true expectations. Moments are lower Lebesgue integrals. Algorithm 5.1 is a pathwise recursion adamIter, driven by a random sequence ξ:N→Ω→Ξ\xi : \mathbb N \to \Omega \to \Xiξ:N→Ω→Ξ whose index 000 is unused. The iid hypothesis is iIndepFun with every ξn+1\xi_{n+1}ξn+1​ of law μ\muμ.

Two hypotheses are left implicit on the page and are added explicitly. The first is ε>0\varepsilon > 0ε>0. The second is α1<1\alpha_1 < 1α1​<1 and β1<1\beta_1 < 1β1​<1: Assumption 5.1 iii) permits α1=1\alpha_1 = 1α1​=1, which gives r1=0r_1 = 0r1​=0, and Lean's division by zero returns 000. Lemma 9.1 is stated with γn>0\gamma_n > 0γn​>0 and ∑γn=∞\sum\gamma_n = \infty∑γn​=∞, which its convergence claim needs. Semiflows are Flow ℝ≥0 on the subtype Z+\mathcal Z_+Z+​, and the asymptotic pseudotrajectory and limit set are the published StochApproxDyn.LimitSet definitions. The ODE milestones 4–6 hold for abstract FFF, SSS under Assumptions 7.1–7.2 with 0<b≤4a0 < b \le 4a0<b≤4a, as in the paper's §7.

The goal concerns the iterates of Algorithm 5.1 itself. A statement about trajectories of (ODE∞)(\mathrm{ODE}_\infty)(ODE∞​), or one that replaces almost-sure boundedness by a bound uniform in ω\omegaω together with deterministic gradients, is a different and much weaker theorem and is ruled out. The interior condition on F(S)F(\mathcal S)F(S) and the countability of S\mathcal SS enter exactly as on the page.

A complete development needs the following:

  • well-posedness of the ODE on a closed set with a non-Lipschitz field;
  • the Benaïm machinery: martingale-noise control via Doob's convergence theorem, and the passage from vanishing perturbations to asymptotic pseudotrajectories;
  • the limit-set theorem for strict Lyapunov functions.

The last two are reusable for any stochastic approximation scheme, and contributions to them are welcome independently of Adam.

Selected references

  • A. Barakat, P. Bianchi, Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization, SIAM J. Math. Data Sci. 3(1), 2021; arXiv:1810.02263v4. https://arxiv.org/abs/1810.02263
  • M. Benaïm, Dynamics of stochastic approximation algorithms, Séminaire de Probabilités XXXIII, LNM 1709, Springer, 1999. https://doi.org/10.1007/BFb0096509
  • D. P. Kingma, J. Ba, Adam: A Method for Stochastic Optimization, ICLR 2015. https://arxiv.org/abs/1412.6980
  • S. J. Reddi, S. Kale, S. Kumar, On the Convergence of Adam and Beyond, ICLR 2018. https://arxiv.org/abs/1904.09237
16 thms1 active userReviewed
Operations ResearchOptimal TransportOptimization·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 5: For c = ϕ(x)ψ(y), ψ Strictly Convex, ϕ Strictly Decreasing, the Left-Curtain Coupling Is the Unique OptimizerResearch Paper

Motivation

Martingale optimal transport asks for the cheapest way to couple two given laws μ\muμ and ν\nuν on R\mathbb RR by a one-step martingale: a pair (X,Y)(X,Y)(X,Y) with X∼μX\sim\muX∼μ, Y∼νY\sim\nuY∼ν and E[Y∣X]=XE[Y\mid X]=XE[Y∣X]=X. The problem arises in mathematical finance, where μ\muμ and ν\nuν are the risk-neutral laws of an asset at two maturities, implied by quoted vanilla option prices, and the extremal values of E[c(X,Y)]E[c(X,Y)]E[c(X,Y)] over all such couplings are model-independent price bounds for the exotic payoff ccc (Beiglböck, Henry-Labordère, Penkner 2013; Galichon, Henry-Labordère, Touzi 2014). In classical optimal transport on the line, a single coupling, the monotone (quantile) coupling, is optimal for a whole family of costs. Beiglböck and Juillet (arXiv:1208.1509, Ann. Probab. 2016) identify its martingale counterpart, the left-curtain coupling πlc\pi_{lc}πlc​, and determine costs for which it is optimal.

This mission formalizes one of those optimality results, Theorem 6.3: for product costs c(x,y)=φ(x)ψ(y)c(x,y)=\varphi(x)\psi(y)c(x,y)=φ(x)ψ(y) with ψ\psiψ strictly convex and φ\varphiφ decreasing, πlc\pi_{lc}πlc​ is the unique optimizer.

Setting

Let M\mathcal MM be the set of finite Borel measures on R\mathbb RR with finite first moment. For μ,ν∈M\mu,\nu\in\mathcal Mμ,ν∈M the convex order μ⪯Cν\mu\preceq_C\nuμ⪯C​ν means ∫ϕ dμ≤∫ϕ dν\int\phi\,d\mu\le\int\phi\,d\nu∫ϕdμ≤∫ϕdν for every convex ϕ:R→R\phi:\mathbb R\to\mathbb Rϕ:R→R; it forces equal mass and equal mean. The extended convex order μ⪯Eν\mu\preceq_E\nuμ⪯E​ν asks this only for nonnegative convex ϕ\phiϕ.

A transport plan from μ\muμ to ν\nuν is a measure π\piπ on R×R\mathbb R\times\mathbb RR×R with marginals μ\muμ and ν\nuν; the set of them is Π(μ,ν)\Pi(\mu,\nu)Π(μ,ν). It is a martingale transport plan, π∈ΠM(μ,ν)\pi\in\Pi_M(\mu,\nu)π∈ΠM​(μ,ν), if y−xy-xy−x is π\piπ-integrable and

∫ρ(x) (y−x) dπ(x,y)=0for every bounded Borel ρ,\int\rho(x)\,(y-x)\,d\pi(x,y)=0\quad\text{for every bounded Borel }\rho,∫ρ(x)(y−x)dπ(x,y)=0for every bounded Borel ρ,

that is, the conditional law πx\pi_xπx​ of yyy given xxx has barycentre xxx for μ\muμ-almost every xxx. For a cost c:R2→Rc:\mathbb R^2\to\mathbb Rc:R2→R the cost of a plan is Eπ[c]=∫c dπ∈(−∞,+∞]E_\pi[c]=\int c\,d\pi\in(-\infty,+\infty]Eπ​[c]=∫cdπ∈(−∞,+∞], the value is CM(μ,ν)=inf⁡π∈ΠM(μ,ν)Eπ[c]C_M(\mu,\nu)=\inf_{\pi\in\Pi_M(\mu,\nu)}E_\pi[c]CM​(μ,ν)=infπ∈ΠM​(μ,ν)​Eπ​[c], and π\piπ is optimal if it belongs to ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν) and attains this infimum.

For a plan π\piπ and t∈Rt\in\mathbb Rt∈R, the measure νtπ=proj#y(π∣(−∞,t]×R)\nu^\pi_t=\mathrm{proj}^y_\#(\pi|_{(-\infty,t]\times\mathbb R})νtπ​=proj#y​(π∣(−∞,t]×R​) is where π\piπ sends the left part μ∣(−∞,t]\mu|_{(-\infty,t]}μ∣(−∞,t]​ of μ\muμ. Given μ⪯Eν\mu\preceq_E\nuμ⪯E​ν, the shadow Sν(μ)S^\nu(\mu)Sν(μ) is the measure η\etaη with η≤ν\eta\le\nuη≤ν and μ⪯Cη\mu\preceq_C\etaμ⪯C​η that is ⪯C\preceq_C⪯C​-below every other such measure. The left-curtain coupling of μ⪯Cν\mu\preceq_C\nuμ⪯C​ν is the plan πlc\pi_{lc}πlc​ with

proj#x(πlc∣(−∞,x]×R)=μ∣(−∞,x],νxπlc=Sν(μ∣(−∞,x])(x∈R).\mathrm{proj}^x_\#(\pi_{lc}|_{(-\infty,x]\times\mathbb R})=\mu|_{(-\infty,x]},\qquad \nu^{\pi_{lc}}_x=S^\nu(\mu|_{(-\infty,x]})\qquad(x\in\mathbb R).proj#x​(πlc​∣(−∞,x]×R​)=μ∣(−∞,x]​,νxπlc​​=Sν(μ∣(−∞,x]​)(x∈R).

It sends every left part of μ\muμ to the most concentrated part of ν\nuν that can receive it by a martingale.

Formalization targets

Goal: Theorem 6.3

Let μ⪯Cν\mu\preceq_C\nuμ⪯C​ν be finite measures, ψ≥0\psi\ge0ψ≥0 strictly convex, φ≥0\varphi\ge0φ≥0 strictly decreasing, c(x,y)=φ(x)ψ(y)c(x,y)=\varphi(x)\psi(y)c(x,y)=φ(x)ψ(y), and assume CM(μ,ν)<+∞C_M(\mu,\nu)<+\inftyCM​(μ,ν)<+∞. Then

πlc is optimal, and every optimal π∈ΠM(μ,ν) equals πlc.\pi_{lc}\ \text{is optimal, and every optimal }\pi\in\Pi_M(\mu,\nu)\text{ equals }\pi_{lc}.πlc​ is optimal, and every optimal π∈ΠM​(μ,ν) equals πlc​.

Milestones

  1. Lemma 4.6: for μ⪯Eν\mu\preceq_E\nuμ⪯E​ν in M\mathcal MM the shadow exists and is unique.
  2. Theorem 4.18: for μ⪯Cν\mu\preceq_C\nuμ⪯C​ν the left-curtain coupling exists, is unique, and lies in ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν).
  3. Proof of Theorem 4.21: for every π∈ΠM(μ,ν)\pi\in\Pi_M(\mu,\nu)π∈ΠM​(μ,ν) and sss, νsπ≤ν\nu^\pi_s\le\nuνsπ​≤ν, μ∣(−∞,s]⪯Cνsπ\mu|_{(-\infty,s]}\preceq_C\nu^\pi_sμ∣(−∞,s]​⪯C​νsπ​, and νsπlc⪯Cνsπ\nu^{\pi_{lc}}_s\preceq_C\nu^\pi_sνsπlc​​⪯C​νsπ​.
  4. Equation (16): ∫φ(x)ψ(y) dπ=∫0∞(∫ψ dν{φ≥t}π)dt\displaystyle\int\varphi(x)\psi(y)\,d\pi=\int_0^\infty\Big(\int\psi\,d\nu^\pi_{\{\varphi\ge t\}}\Big)dt∫φ(x)ψ(y)dπ=∫0∞​(∫ψdν{φ≥t}π​)dt.
  5. Equality case: for η⪯Cη′\eta\preceq_C\eta'η⪯C​η′ and ψ\psiψ strictly convex with ∫ψ dη′<∞\int\psi\,d\eta'<\infty∫ψdη′<∞, ∫ψ dη=∫ψ dη′\int\psi\,d\eta=\int\psi\,d\eta'∫ψdη=∫ψdη′ iff η=η′\eta=\eta'η=η′.
  6. §1.3: a plan in Π(μ,ν)\Pi(\mu,\nu)Π(μ,ν) is determined by the family (νtπ)t∈R(\nu^\pi_t)_{t\in\mathbb R}(νtπ​)t∈R​.

Significance

Theorem 6.3 gives a class of costs for which the martingale transport problem has an explicit, cost-independent solution, and does so with uniqueness and without any regularity of φ\varphiφ beyond monotonicity. In the financial reading, every payoff of the form φ(X)ψ(Y)\varphi(X)\psi(Y)φ(X)ψ(Y) with these shape properties has its model-independent lower price bound attained by one and the same model, the left-curtain martingale, which depends only on the marginals. The result complements Theorem 6.1 of the same paper (costs h(y−x)h(y-x)h(y−x) with h′h'h′ strictly convex), proved by a different, variational route.

The theorem is proved in the paper. No machine-checked version is known: neither the left-curtain coupling nor shadows nor martingale optimal transport on R\mathbb RR appears in Mathlib or on the platform. A formalization produces the shadow construction, the left-curtain coupling as a Lean object with its characterization, and the comparison principle "πlc\pi_{lc}πlc​ has the ⪯C\preceq_C⪯C​-least targets", all of which are reused by the other results of the series (uniqueness of the left-monotone plan, Theorem 6.1, the support bounds of §7).

Difficulty

The obvious argument compares costs plan by plan, but the convex order of two measures alone does not order the integrals of a strictly convex ψ\psiψ strictly: that ∫ψ dη=∫ψ dη′\int\psi\,d\eta=\int\psi\,d\eta'∫ψdη=∫ψdη′ forces η=η′\eta=\eta'η=η′ requires representing η′\eta'η′ as a martingale image of η\etaη (Strassen's theorem on R\mathbb RR) and the equality case of Jensen's inequality, with care about infinite integrals. The second obstacle is the passage from "equal targets for almost every level ttt of φ\varphiφ" to "equal plans": the superlevel sets of a strictly decreasing φ\varphiφ are half-lines that may be open or closed at the jumps of φ\varphiφ, so the targets must be controlled for both kinds of half-line, and a null set of levels must be bridged by monotonicity of t↦νtπt\mapsto\nu^\pi_tt↦νtπ​. Existence of shadows (Lemma 4.6) is itself a nontrivial construction through potential functions uμ(x)=∫∣y−x∣ dμ(y)u_\mu(x)=\int|y-x|\,d\mu(y)uμ​(x)=∫∣y−x∣dμ(y).

Formalization scope

Measures are Mathlib Measure ℝ and Measure (ℝ × ℝ) with the Borel σ-algebras. μ\muμ and ν\nuν are finite, not necessarily probability, measures, as the theorem states; membership in M\mathcal MM is part of ConvexLE. Integrals that may be infinite take values in EReal, through the published ModelRiskOT.Duality.extIntegral (∫f+−∫f−\int f^+-\int f^-∫f+−∫f−). ΠM\Pi_MΠM​ is encoded by the characterization above with bounded test functions ρ\rhoρ. The shadow and the left-curtain coupling are predicates (IsShadow, IsLeftCurtain); their existence and uniqueness are milestones, never built into definitions. "Optimal" is minimality of cost over martingale plans; attainment is not assumed.

Two hypotheses are read into the printed statement. "Decreasing" is strict: with φ≡1\varphi\equiv1φ≡1 all martingale plans have the same cost ∫ψ dν\int\psi\,d\nu∫ψdν, and for μ\muμ uniform on {−1,1}\{-1,1\}{−1,1}, ν\nuν uniform on {−2,0,2}\{-2,0,2\}{−2,0,2} there are infinitely many of them. CM(μ,ν)<+∞C_M(\mu,\nu)<+\inftyCM​(μ,ν)<+∞ is added, as the proof assumes a plan of finite cost; otherwise every plan is optimal. A formalization in which πlc\pi_{lc}πlc​ is merely some plan, the cost is a Bochner integral (which is 000 for non-integrable integrands), or optimality is taken among all plans rather than martingale plans would not be Theorem 6.3. Theorem 4.18 is stated for finite measures of equal mass, the generality Theorem 6.3 needs. Strassen's theorem is already posed on the platform (PalmQueueing.Ordering.strassen_cx) and is not restated.

A complete development needs the convex order on finite measures, shadows, the left-curtain coupling, a layer-cake identity for product integrands and the equality case of the convex order for strictly convex test functions. The shadow and left-curtain layers are reusable across the whole series; contributions to any milestone, and to general lemmas on the convex order of finite (not only probability) measures, are welcome.

Selected references

  • M. Beiglböck, N. Juillet, On a problem of optimal transport under marginal martingale constraints, Ann. Probab. 44(1), 42–106, 2016. arXiv:1208.1509v2, doi:10.1214/14-AOP966
  • M. Beiglböck, P. Henry-Labordère, F. Penkner, Model-independent bounds for option prices — a mass transport approach, Finance Stoch. 17, 477–501, 2013. doi:10.1007/s00780-013-0205-8
  • A. Galichon, P. Henry-Labordère, N. Touzi, A stochastic control approach to no-arbitrage bounds given marginals, with an application to lookback options, Ann. Appl. Probab. 24(1), 312–336, 2014. doi:10.1214/13-AAP925
  • V. Strassen, The existence of probability measures with given marginals, Ann. Math. Statist. 36, 423–439, 1965. doi:10.1214/aoms/1177700153
9 thms1 active userReviewed
Operations ResearchOptimal TransportOptimization·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 6: For c = −|y − x| and Continuous µ the Optimizer Is Unique and Lives on Two Monotone GraphsResearch Paper

Motivation

A forward-start straddle pays ∣S2−S1∣|S_2 - S_1|∣S2​−S1​∣, the absolute change of an asset price between two future dates. A trader who knows the market prices of all vanilla options at both dates knows the laws μ\muμ of S1S_1S1​ and ν\nuν of S2S_2S2​, but not their joint law. Under a pricing measure the price is a martingale, so the admissible joint laws are exactly the martingale couplings of μ\muμ and ν\nuν. The highest price consistent with the data is therefore the value of an optimization problem over martingale couplings: maximize E∣S2−S1∣\mathbb E|S_2-S_1|E∣S2​−S1​∣. Hobson and Neuberger (Robust bounds for forward start options, 2012) studied this problem and identified the maximizing coupling through the dual problem. Beiglböck, Henry-Labordère and Penkner (arXiv:1106.5929) showed that the dual maximizers need not exist in general.

Beiglböck and Juillet (arXiv:1208.1509v2, Ann. Probab. 2016) approach martingale transport through the structure of the support of optimal plans. Their Theorem 7.3 recovers the Hobson–Neuberger optimizer for every continuous starting law μ\muμ: it is unique and splits each starting point into at most two destinations along two monotone maps.

Timeline.

  • 1965: Strassen (doi:10.1214/aoms/1177700153) shows that martingale couplings of μ,ν\mu,\nuμ,ν exist iff μ\muμ and ν\nuν are in convex order.
  • 2012: Hobson and Neuberger identify the optimizer for c=−∣y−x∣c=-|y-x|c=−∣y−x∣ via a construction of dual maximizers, under conditions on the marginals.
  • 2013: Beiglböck, Henry-Labordère and Penkner give an example where the dual maximizers do not exist.
  • 2016: Beiglböck and Juillet prove existence, uniqueness and the two-graph structure for every continuous μ\muμ, using only the primal problem and a variational lemma.

Setting

A martingale transport plan between probability measures μ,ν\mu,\nuμ,ν on R\mathbb RR with finite first moments is a probability measure π\piπ on R2\mathbb R^2R2 with first marginal μ\muμ, second marginal ν\nuν, and

∫ρ(x) (y−x) dπ(x,y)=0for every bounded Borel ρ,\int \rho(x)\,(y-x)\,d\pi(x,y)=0\qquad\text{for every bounded Borel }\rho,∫ρ(x)(y−x)dπ(x,y)=0for every bounded Borel ρ,

that is, the conditional mean of yyy given xxx is xxx. Their set is ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν). It is nonempty exactly when μ\muμ and ν\nuν are in convex order, μ⪯Cν\mu\preceq_C\nuμ⪯C​ν: ∫φ dμ≤∫φ dν\int\varphi\,d\mu\le\int\varphi\,d\nu∫φdμ≤∫φdν for every convex φ\varphiφ.

For a cost c:R2→Rc:\mathbb R^2\to\mathbb Rc:R2→R the problem is

CM(μ,ν)=inf⁡{∫c dπ: π∈ΠM(μ,ν)},C_M(\mu,\nu)=\inf\Big\{\int c\,d\pi:\ \pi\in\Pi_M(\mu,\nu)\Big\},CM​(μ,ν)=inf{∫cdπ: π∈ΠM​(μ,ν)},

and π\piπ is optimal if it attains this infimum. This mission concerns the Hobson–Neuberger cost c(x,y)=−∣y−x∣c(x,y)=-|y-x|c(x,y)=−∣y−x∣, so optimal plans maximize ∫∣y−x∣ dπ\int|y-x|\,d\pi∫∣y−x∣dπ. The measure μ\muμ is continuous: μ({x})=0\mu(\{x\})=0μ({x})=0 for every xxx.

For Γ⊆R2\Gamma\subseteq\mathbb R^2Γ⊆R2 write Γx={y:(x,y)∈Γ}\Gamma_x=\{y:(x,y)\in\Gamma\}Γx​={y:(x,y)∈Γ}. A competitor of a finitely supported measure α\alphaα on R2\mathbb R^2R2 is a measure α′\alpha'α′ with the same two marginals and the same conditional barycentres ∫y dαx(y)\int y\,d\alpha_x(y)∫ydαx​(y).

Formalization targets

Goal: Theorem 7.3 (p. 43)

If μ⪯Cν\mu\preceq_C\nuμ⪯C​ν are probability measures and μ\muμ is continuous, there is a unique optimal πHN∈ΠM(μ,ν)\pi_{\mathrm{HN}}\in\Pi_M(\mu,\nu)πHN​∈ΠM​(μ,ν) for c(x,y)=−∣y−x∣c(x,y)=-|y-x|c(x,y)=−∣y−x∣. Moreover there are a Borel set SSS with μ(S)=1\mu(S)=1μ(S)=1 and functions T1,T2T_1,T_2T1​,T2​, nondecreasing on SSS, with

T1(x)≤x≤T2(x) (x∈S),πHN({(x,y):x∈S, y∈{T1(x),T2(x)}})=1.T_1(x)\le x\le T_2(x)\ (x\in S),\qquad \pi_{\mathrm{HN}}\big(\{(x,y):x\in S,\ y\in\{T_1(x),T_2(x)\}\}\big)=1.T1​(x)≤x≤T2​(x) (x∈S),πHN​({(x,y):x∈S, y∈{T1​(x),T2​(x)}})=1.

Milestones, in attack order

  1. Attainment (§2.1, pp. 10–11): for a lower semicontinuous, sufficiently integrable cost the infimum is attained when ΠM(μ,ν)≠∅\Pi_M(\mu,\nu)\neq\emptysetΠM​(μ,ν)=∅.
  2. Lemma 1.11 (p. 8): an optimal plan of finite cost is concentrated on a Borel Γ\GammaΓ such that no finitely supported α\alphaα on Γ\GammaΓ has a cheaper competitor.
  3. Lemma 7.5 (pp. 43–44): the sign of A−BA-BA−B, an explicit difference of absolute values, as a function of one variable.
  4. (23) (p. 44): on such a Γ\GammaΓ, for (x,y−),(x,y+),(x′,y′)∈Γ(x,y^-),(x,y^+),(x',y')\in\Gamma(x,y−),(x,y+),(x′,y′)∈Γ with y−<y′<y+y^-<y'<y^+y−<y′<y+, neither y′≤x′<xy'\le x'<xy′≤x′<x nor x<x′≤y′x<x'\le y'x<x′≤y′.
  5. Lemma 3.2 (p. 19) and the countability of {a:∣Γa∣>2}\{a:|\Gamma_a|>2\}{a:∣Γa​∣>2} (p. 45).
  6. Lemma 5.5 (p. 35): a Borel set with at most two points per fibre is the union of two Borel graphs.
  7. Monotonicity of T1,T2T_1,T_2T1​,T2​ (p. 45).
  8. Convexity of the set of optimizers (p. 45) and Lemma 5.6 (p. 36): a nonempty convex set of martingale plans each living on a set with two-point fibres is a single plan.

Significance

The result. Theorem 7.3 gives the extremal martingale coupling for the forward-start straddle in closed structural form: a plan that sends each xxx to one point below and one point above it, both chosen monotonically in xxx. Combined with the martingale constraint, this determines the transition probabilities at each xxx, so the plan, and the model-independent upper price bound, are pinned down by μ\muμ and ν\nuν. Remark 7.6 of the paper shows that continuity of μ\muμ cannot be dropped: for atomic μ\muμ uniqueness can fail.

Formalizing it. The result is proved in the paper; to our knowledge none of it is machine-checked. The mission produces a formal account of a support-based method (variational lemma, forbidden configurations, fibre counting, selection of Borel graphs, uniqueness from convexity). Lemma 3.2, Lemma 5.5 and Lemma 5.6 are general statements reused by the paper's other structure theorems (Corollary 1.6, Theorems 7.1, 7.4) and are of independent use.

Difficulty

The forbidden configurations (23) are pointwise statements about a set Γ\GammaΓ of full measure, while the conclusion is about functions. Passing from one to the other needs three ingredients that do not follow from (23) alone: a counting argument showing that only countably many fibres can have three or more points (this is where continuity of μ\muμ enters, through Lemma 3.2), a measurable selection of the two branches (Lemma 5.5, a Lusin–Novikov type theorem not in Mathlib), and a uniqueness argument comparing two optimizers through their average. The naive idea of reading uniqueness off from (23) directly fails: (23) constrains each optimizer separately, and two optimizers could a priori live on different pairs of graphs.

Lemma 1.11 itself rests on a duality theorem of Kellerer type for product sets and is the subject of a separate mission of this series.

Formalization scope

The Lean development works with measures on ℝ and ℝ × ℝ and their Borel σ-algebras. Integrals that may be infinite are taken in EReal through the published ModelRiskOT.Duality.extIntegral (positive minus negative part, with (+∞)−(+∞)=−∞(+\infty)-(+\infty)=-\infty(+∞)−(+∞)=−∞); the cost of a plan, CMC_MCM​, and the convex order are defined through it. ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν) is encoded by the paper's own characterization (4) with bounded test functions, and competitors by the same device; no disintegrations appear in the statements. Cardinalities of fibres are Set.encard, valued in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}. Continuity of μ\muμ is the hypothesis μ({x})=0\mu(\{x\})=0μ({x})=0 for every xxx. "Concentrated on AAA" is π(Ac)=0\pi(A^c)=0π(Ac)=0.

The attainment milestone uses the finite-measure class M\mathcal MM introduced in §2.1: probability normalization is required for Lemma 1.11 and the goal, but not for attainment. The first moments of both marginals are explicit hypotheses in that milestone.

The goal states T1,T2T_1,T_2T1​,T2​ as nondecreasing on a Borel set SSS of full μ\muμ-measure, with T1≤id≤T2T_1\le\mathrm{id}\le T_2T1​≤id≤T2​ on SSS. The page writes T1,T2:R→RT_1,T_2:\mathbb R\to\mathbb RT1​,T2​:R→R nondecreasing everywhere; read literally that version fails when μ\muμ has bounded support and ν\nuν does not, and the paper's proof produces exactly the full-measure form (as in its Corollary 1.6).

Statements (23), the fibre count and the monotonicity of T1,T2T_1,T_2T1​,T2​ are stated for an arbitrary set Γ\GammaΓ with the finite-optimality property of Lemma 1.11 for c=−∣y−x∣c=-|y-x|c=−∣y−x∣, so they do not depend on a plan. A formalization proving only existence of an optimizer, or uniqueness without the two-graph structure, does not settle the goal: both parts are required.

Needed infrastructure: weak compactness of ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν) and lower semicontinuity of the cost functional; a Kellerer-type duality for Lemma 1.11; a Lusin–Novikov selection theorem for Lemma 5.5. Contributions to any of these, and alternative proofs of Lemma 5.6, are welcome.

Selected references

  • M. Beiglböck, N. Juillet, On a problem of optimal transport under marginal martingale constraints, Ann. Probab. 44(1), 42–106, 2016. arXiv:1208.1509v2, doi:10.1214/14-AOP966
  • D. Hobson, A. Neuberger, Robust bounds for forward start options, Mathematical Finance 22(1), 31–56, 2012. doi:10.1111/j.1467-9965.2010.00473.x
  • M. Beiglböck, P. Henry-Labordère, F. Penkner, Model-independent bounds for option prices — a mass transport approach, Finance Stoch. 17, 477–501, 2013. arXiv:1106.5929
  • V. Strassen, The existence of probability measures with given marginals, Ann. Math. Statist. 36, 423–439, 1965. doi:10.1214/aoms/1177700153
  • A. S. Kechris, Classical Descriptive Set Theory, Graduate Texts in Mathematics 156, Springer, 1995 (Theorem 18.11). doi:10.1007/978-1-4612-4190-4
13 thms1 active userReviewed
Operations ResearchOptimal TransportOptimization·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 4: For c = h(y − x) with h′ Strictly Convex the Left-Curtain Coupling Is the Unique OptimizerResearch Paper

Motivation

Martingale optimal transport asks for the cheapest way to couple two probability laws μ\muμ and ν\nuν on R\mathbb RR under the extra constraint that the coupling is the law of a one-step martingale. The problem arose in robust mathematical finance: when the prices of all call options at two maturities are observed, the marginal laws of the underlying asset at those maturities are known, and the no-arbitrage bounds on the price of a path-dependent option are the values of a martingale transport problem (Beiglböck, Henry-Labordère, Penkner 2013; Galichon, Henry-Labordère, Touzi 2014). The paper of Beiglböck and Juillet (arXiv:1208.1509v2, Ann. Probab. 44 (2016)) introduced the structural theory of the one-dimensional problem: a variational principle for optimal plans, a canonical coupling called the left-curtain coupling, and the identification of that coupling as the optimizer for a family of costs.

This mission formalizes that last identification. In classical optimal transport on the line, the monotone (quantile) coupling is the unique optimizer for every cost h(y−x)h(y-x)h(y−x) with hhh strictly convex; the result here is the martingale counterpart, with a different coupling and a different convexity condition.

Setting

Let μ,ν\mu,\nuμ,ν be Borel probability measures on R\mathbb RR with finite first moment. They are in convex order, μ⪯Cν\mu\preceq_C\nuμ⪯C​ν, if ∫φ dμ≤∫φ dν\int\varphi\,d\mu\le\int\varphi\,d\nu∫φdμ≤∫φdν for every convex φ:R→R\varphi:\mathbb R\to\mathbb Rφ:R→R (Definition 2.1). A transport plan is a measure π\piπ on R×R\mathbb R\times\mathbb RR×R with first marginal μ\muμ and second marginal ν\nuν; it is a martingale transport plan, π∈ΠM(μ,ν)\pi\in\Pi_M(\mu,\nu)π∈ΠM​(μ,ν), if under π\piπ the conditional mean of yyy given xxx equals xxx, equivalently

∫ρ(x) (y−x) dπ(x,y)=0for every bounded Borel ρ.\int\rho(x)\,(y-x)\,d\pi(x,y)=0\quad\text{for every bounded Borel }\rho .∫ρ(x)(y−x)dπ(x,y)=0for every bounded Borel ρ.

Strassen's theorem says ΠM(μ,ν)≠∅\Pi_M(\mu,\nu)\ne\emptysetΠM​(μ,ν)=∅ exactly when μ⪯Cν\mu\preceq_C\nuμ⪯C​ν.

A cost is a function c:R2→Rc:\mathbb R^2\to\mathbb Rc:R2→R. It satisfies the sufficient integrability condition if c(x,y)≥a(x)+b(y)c(x,y)\ge a(x)+b(y)c(x,y)≥a(x)+b(y) for all x,yx,yx,y with a∈L1(μ)a\in L^1(\mu)a∈L1(μ), b∈L1(ν)b\in L^1(\nu)b∈L1(ν); then ∫c dπ∈(−∞,+∞]\int c\,d\pi\in(-\infty,+\infty]∫cdπ∈(−∞,+∞] is well defined for every plan. The martingale transport problem is

CM(μ,ν)=inf⁡π∈ΠM(μ,ν)∫c dπ,C_M(\mu,\nu)=\inf_{\pi\in\Pi_M(\mu,\nu)}\int c\,d\pi ,CM​(μ,ν)=π∈ΠM​(μ,ν)inf​∫cdπ,

and a plan attaining the infimum is optimal.

A plan π\piπ is (left-)monotone (Definition 1.4) if it is concentrated on a Borel set Γ\GammaΓ containing no three points (x,y−),(x,y+),(x′,y′)(x,y^-),(x,y^+),(x',y')(x,y−),(x,y+),(x′,y′) with x<x′x<x'x<x′ and y−<y′<y+y^-<y'<y^+y−<y′<y+. For a finite measure η≤μ\eta\le\muη≤μ, its shadow Sν(η)S^\nu(\eta)Sν(η) is the least measure in the convex order among the measures η′≤ν\eta'\le\nuη′≤ν with η⪯Cη′\eta\preceq_C\eta'η⪯C​η′ (Lemma 4.6). The left-curtain coupling πlc\pi_{lc}πlc​ is the plan that transports μ∣]−∞,x]\mu|_{]-\infty,x]}μ∣]−∞,x]​ onto Sν(μ∣]−∞,x])S^\nu(\mu|_{]-\infty,x]})Sν(μ∣]−∞,x]​) for every xxx (Theorem 4.18); writing νtπ\nu^\pi_tνtπ​ for the second marginal of π∣]−∞,t]×R\pi|_{]-\infty,t]\times\mathbb R}π∣]−∞,t]×R​, this says νtπlc=Sν(μ∣]−∞,t])\nu^{\pi_{lc}}_t=S^\nu(\mu|_{]-\infty,t]})νtπlc​​=Sν(μ∣]−∞,t]​).

Formalization targets

Goal: Theorem 1.7 (= Theorem 6.1)

Let μ⪯Cν\mu\preceq_C\nuμ⪯C​ν be probability measures, let h:R→Rh:\mathbb R\to\mathbb Rh:R→R be differentiable with strictly convex derivative h′h'h′, let c(x,y)=h(y−x)c(x,y)=h(y-x)c(x,y)=h(y−x) satisfy the sufficient integrability condition, and assume CM(μ,ν)<∞C_M(\mu,\nu)<\inftyCM​(μ,ν)<∞. Then

πlc is optimal, and every optimal π∈ΠM(μ,ν) equals πlc.\pi_{lc}\ \text{is optimal, and every optimal}\ \pi\in\Pi_M(\mu,\nu)\ \text{equals}\ \pi_{lc}.πlc​ is optimal, and every optimal π∈ΠM​(μ,ν) equals πlc​.

Milestones

  1. Attainment (§2.1): for a lower semicontinuous cost with the integrability condition, the infimum CM(μ,ν)C_M(\mu,\nu)CM​(μ,ν) is attained whenever ΠM(μ,ν)≠∅\Pi_M(\mu,\nu)\ne\emptysetΠM​(μ,ν)=∅.
  2. Lemma 1.11 (variational lemma): an optimal plan of finite cost is concentrated on a Borel Γ\GammaΓ such that no finitely supported α\alphaα with support in Γ\GammaΓ has a strictly cheaper competitor (same marginals, same conditional barycentres).
  3. The rerouting (proof of Theorem 6.1): for λy++(1−λ)y−=y′\lambda y^+ + (1-\lambda)y^- = y'λy++(1−λ)y−=y′, the measure α′\alpha'α′ with masses 1−λ,λ,11-\lambda,\lambda,11−λ,λ,1 at (x′,y−),(x′,y+),(x,y′)(x',y^-),(x',y^+),(x,y')(x′,y−),(x′,y+),(x,y′) is a competitor of α\alphaα with masses λ,1−λ,1\lambda,1-\lambda,1λ,1−λ,1 at (x,y+),(x,y−),(x′,y′)(x,y^+),(x,y^-),(x',y')(x,y+),(x,y−),(x′,y′).
  4. Display (15): d(t)=λh(y+−t)+(1−λ)h(y−−t)−h(y′−t)d(t)=\lambda h(y^+-t)+(1-\lambda)h(y^--t)-h(y'-t)d(t)=λh(y+−t)+(1−λ)h(y−−t)−h(y′−t) is strictly decreasing.
  5. The rerouting is strictly cheaper: for x<x′x<x'x<x′,
λc(x,y+)+(1−λ)c(x,y−)+c(x′,y′)>λc(x′,y+)+(1−λ)c(x′,y−)+c(x,y′).\lambda c(x,y^+)+(1-\lambda)c(x,y^-)+c(x',y')>\lambda c(x',y^+)+(1-\lambda)c(x',y^-)+c(x,y').λc(x,y+)+(1−λ)c(x,y−)+c(x′,y′)>λc(x′,y+)+(1−λ)c(x′,y−)+c(x,y′).
  1. Every finite optimizer is monotone.
  2. Theorem 4.18: πlc\pi_{lc}πlc​ exists, is unique and lies in ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν).
  3. Theorem 5.3: a monotone martingale transport plan is the left-curtain coupling of its marginals.
  4. Theorem 1.9 (companion): under the goal's hypotheses, for π∈ΠM(μ,ν)\pi\in\Pi_M(\mu,\nu)π∈ΠM​(μ,ν), "monotone", "optimal" and "νtπ⪯Cνtπ′\nu^\pi_t\preceq_C\nu^{\pi'}_tνtπ​⪯C​νtπ′​ for all π′∈ΠM(μ,ν)\pi'\in\Pi_M(\mu,\nu)π′∈ΠM​(μ,ν) and ttt" are equivalent.

Significance

The theorem shows that, for every cost h(y−x)h(y-x)h(y−x) with h′h'h′ strictly convex (for instance h=exp⁡h=\exph=exp), the martingale transport problem has the same optimizer, determined by μ\muμ and ν\nuν alone. In the financial reading, the model-independent bound on the price of the corresponding forward-start payoff is attained by one explicit martingale, the same for the whole family. Remark 6.2 of the paper derives from it that πlc\pi_{lc}πlc​ also minimizes the essential supremum of y−xy-xy−x. Theorem 1.9 packages the result as an equivalence of a geometric property (monotonicity), an optimality property and an order property of the curtain; later work on the left-curtain coupling, its explicit construction, and its extensions to higher dimensions and to multiple marginals takes these characterizations as its starting point.

The result is proved in the paper. As far as is known, none of it is formalized: Mathlib has the convex order neither for finite measures nor in the form used here, no martingale couplings, and no theory of shadows. The mission produces the statement layer (convex order on finite measures, martingale plans, extended-real costs, shadows, left-monotone plans, competitors) and asks for a machine-checked proof of the goal and of each milestone. The real-variable milestones (displays around (15)) are self-contained and elementary; the measure-theoretic ones carry the weight.

Difficulty

Optimality is a global property of a measure on R2\mathbb R^2R2, while monotonicity is a pointwise property of its support. Passing from the first to the second requires the variational lemma, whose proof uses a duality theorem for measures with prescribed marginal bounds and a measurable-selection argument; a direct perturbation of π\piπ along a single bad triple fails because a triple of points carries no mass. The second obstacle is uniqueness of the monotone plan (Theorem 5.3), which needs the shadow construction and the associativity of shadows; monotonicity alone does not visibly pin down the plan. Existence of an optimizer needs weak compactness of ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν), which is not immediate because the martingale condition is tested against bounded measurable, not continuous, functions.

Formalization scope

All measures are Borel measures on R\mathbb RR and R×R\mathbb R\times\mathbb RR×R; μ,ν\mu,\nuμ,ν in the goal are probability measures. Convex order requires finite mass and finite first moment of both sides. Integrals that may be infinite (∫c dπ\int c\,d\pi∫cdπ, ∫φ dμ\int\varphi\,d\mu∫φdμ for convex φ\varphiφ) are computed in the extended reals as ∫f+−∫f−\int f^+-\int f^-∫f+−∫f− (the published ModelRiskOT.Duality.extIntegral), never as Bochner integrals. ΠM\Pi_MΠM​ is encoded by the test-function condition displayed above (the paper's (4)). Shadows and the left-curtain coupling are predicates (IsShadow, IsLeftCurtain); their existence and uniqueness are theorems, and the goal asserts them rather than assuming them. Strict convexity of h′h'h′ is strict convexity of deriv h on R\mathbb RR, with hhh differentiable everywhere. Finiteness of costs is CM(μ,ν)<+∞C_M(\mu,\nu)<+\inftyCM​(μ,ν)<+∞, which is the same as the existence of a martingale plan of finite cost (Theorem 6.1's wording).

A formalization that assumes an optimizer exists, or that asserts uniqueness only among left-curtain plans, is trivial and is not the goal: the statement asserts a plan with the left-curtain property, its optimality, and that every optimal plan equals it.

The development needs: weak compactness of plan sets on R2\mathbb R^2R2; lower semicontinuity of extended-real cost functionals; the variational lemma (shared with the companion mission on Lemma 1.11); shadows and their order properties; and the uniqueness of monotone martingale plans. The shadow theory and the variational lemma are reusable across the whole series on this paper. Contributions on any milestone are welcome, including proofs of the elementary displays (15) and the rerouting inequality.

Selected references

  • M. Beiglböck, N. Juillet, On a problem of optimal transport under marginal martingale constraints, Ann. Probab. 44(1), 42–106, 2016. https://arxiv.org/abs/1208.1509v2
  • M. Beiglböck, P. Henry-Labordère, F. Penkner, Model-independent bounds for option prices: a mass transport approach, Finance Stoch. 17, 477–501, 2013. https://doi.org/10.1007/s00780-013-0205-8
  • A. Galichon, P. Henry-Labordère, N. Touzi, A stochastic control approach to no-arbitrage bounds given marginals, with an application to lookback options, Ann. Appl. Probab. 24(1), 312–336, 2014. https://doi.org/10.1214/13-AAP925
  • V. Strassen, The existence of probability measures with given marginals, Ann. Math. Statist. 36, 423–439, 1965. https://doi.org/10.1214/aoms/1177700153
  • C. Villani, Optimal Transport: Old and New, Springer, 2009. https://doi.org/10.1007/978-3-540-71050-9
12 thms1 active userReviewed
PreviousPage 24 of 38Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me