Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Compact iid empirical convergence and propagation of chaos

Statement

Let K⊂Z=Td×Rd be compact and let μ0∈P1(Z) be supported in K. Take an iid sequence (Zi(0))i≥1 with common law μ0 (iid means a common law and mutual independence as in Identical distribution and IID families). Its existence for each μ0 follows from the countable-kernel construction Ionescu-Tulcea construction of a Markov chain under the Axiom of Choice. Let P0>0 be the momentum scale, τ0=mL/P0, and ΞN:ZN→(T∗TLd)N be ΞN((xi,vi)i)=((Lxi,P0vi)i), with torus multiplication as in Smooth periodic finite-N and scaled mean-field phase data. If ΦtN is the physical finite-N flow of Complete finite-N flow and permutation-invariant Liouville law, define the first N dimensionless trajectories by (Zi(s))i=1N:=ΞN−1Φτ0sNΞN((Zi(0))i=1N). Write μN(s)=N−1∑i=1NδZi(s), and let μs be the global characteristic evolution from μ0. For C=1+2A, every finite T>0 and N≥1 satisfy

Esup⁡∣s∣≤TW1(μN(s),μs)≤eCT EW1(μN(0),μ0)≤eCT(δ+DK2MδN),

where for each 0<δ≤1 one may choose a finite Borel partition of K into Mδ≤CKδ−2d cells of diameter at most δ, DK=diam⁡dZ(K), and CK depends only on K and d. Consequently the expected phase-space Wasserstein error tends to zero; choosing δ=N−1/(2d+2) gives a bound of order N−1/(2d+2) with a constant depending on K,d,T,A. Almost surely, sup⁡∣s∣≤TW1(μN(s),μs)→0.

For each fixed k≥1 and every bounded Lipschitz Ψ:Zk→R with the sum metric dZk(z,z′)=∑j=1kdZ(zj,zj′), the law fN(k)(s) of the first k particles obeys, for N≥k and ∣s∣≤T,

∣∫Ψ dfN(k)(s)−∫Ψ dμs⊗k∣≤2∥Ψ∥∞k(k−1)2N+kLip⁡(Ψ)eCTEW1(μN(0),μ0).

Thus every fixed marginal converges to the product law uniformly on bounded time intervals in bounded-Lipschitz tests, where bounded-Lipschitz means ∥Ψ∥∞<∞ and Lip⁡(Ψ)=sup⁡z≠z′∣Ψ(z)−Ψ(z′)∣/dZk(z,z′)<∞. This conclusion is specific to the compact iid preparation and the smooth N−1 mean-field model.

Facts & Assumptions

Given: A compactly supported probability μ0, an iid sequence with that law, the finite-N dynamics, and the characteristic evolution.

[F1]

Identical distribution and IID families: iid random elements have a common marginal law and are mutually independent.

[F2]

Ionescu-Tulcea construction of a Markov chain and The Axiom of Choice: under full Axiom of Choice, a sequence with any fixed probability law exists as the chain generated by constant transition kernels; the theorem's construction uses Choice.

[F3]

Smooth periodic finite-N and scaled mean-field phase data and Wasserstein-1 coupling cost on dimensionless phase space: Z has dimension 2d, dZ=dTd+∣v−w∣, and W1 is the coupling-cost infimum.

[F4]

Complete finite-N flow and permutation-invariant Liouville law: the finite-N flow is complete and commutes with particle permutations.

[F5]

Dobrushin coupling estimate and actual particle-to-Vlasov limit: for any first-moment empirical initial law, the empirical particle evolution is exact and its W1 distance from the characteristic solution is bounded by e(1+2A)∣s∣ times the initial distance.

[F7]

Cauchy-Schwarz inequality for L2: for a probability law, E∣Y∣≤(E∣Y∣2)1/2 whenever the second moment is finite.

Proof

1.1F1F3F6F7givenconstructalgebra

For any fixed ν∈P1(Z), the map z↦W1(N−1∑iδzi,ν) is continuous. Indeed, split a coupling's mass at each repeated atom equally among its labels, and then move label i from zi to zi′ while keeping its target. The cost increases by at most N−1∑idZ(zi,zi′). Taking infima and reversing the roles gives the same bound for the absolute difference of the two Wasserstein values. Thus the initial Wasserstein error is a measurable random variable, bounded by DK on KN. For a finite Borel partition P={C1,…,CM} of K with cell diameters at most δ, put pj=μ0(Cj) and PN,j=N−1∑i=1N1Cj(Zi(0)). A coupling matches the common mass min⁡(pj,PN,j) inside each cell at cost at most δ; the leftover mass is r=12∑j∣PN,j−pj∣ and can be coupled across K at cost at most DKr. Product measures in [F6] construct these within-cell and residual couplings (if r=0, no residual coupling is needed). Hence W1(μN(0),μ0)≤δ+(DK/2)∑j∣PN,j−pj∣. Independence [F1] gives E∣PN,j−pj∣2=pj(1−pj)/N, so [F7] gives E∣PN,j−pj∣≤pj/N; therefore the sum of expected discrepancies is at most M/N. Partition a bounded velocity box containing K and the position torus into rectangular cells of side at most a fixed multiple of δ; intersect with K and disjointize the cover. There are at most CKδ−2d cells, each with dZ-diameter at most δ. This proves the expected initial bound in the Statement.

1.2F1F2givenconstruct

For each μ0, take every coordinate space to be (Z,B(Z)) and set every history-dependent kernel to Kn(z0,…,zn,A)=μ0(A). For each fixed A this is constant, hence measurable, and it is a probability measure in A. The Ionescu--Tulcea theorem [F2], under full Choice, supplies a probability on the countable product whose finite-prefix laws are the iterated products of μ0. Reindexing coordinates from 0 to 1 gives the sequence in the Statement; its common marginals and product finite-prefix laws make its coordinates mutually independent and identically distributed by [F1].

2.1F1step 1.1givenalgebra

For a centered Bernoulli variable Y=1Cj(Zi)−pj, EY2=pj(1−pj) and EY4≤pj. Expanding the fourth power of the sum of independent centered variables leaves only terms with four equal indices or two equal pairs, so E∣PN,j−pj∣4=N−4(NEY4+3N(N−1)(EY2)2)≤4N−2. For every rational ε>0, the elementary bound P(∣PN,j−pj∣>ε)≤ε−4E∣PN,j−pj∣4 makes ∑NP(∣PN,j−pj∣>ε)<∞. By countable subadditivity, the probability of such deviations occurring for some N≥n is bounded by the tail of that convergent series, which tends to zero; hence for this rational ε the deviations occur only finitely often almost surely. Intersect over rational ε>0, over the finitely many cells of each of a countable sequence of partitions with mesh δℓ↓0. The coupling bound in step 1.1 then gives lim sup⁡NW1(μN(0),μ0)≤δℓ for every ℓ, so the initial Wasserstein distance tends to zero almost surely.

3.1F3F4F5step 1.1step 2.1algebra

Step 1.1 and Mδ≤CKδ−2d give EW1(μN(0),μ0)≤δ+(DKCK/2)δ−dN−1/2. Taking δ=N−1/(2d+2) bounds both terms by constants times that power of N. Step 2.1 gives almost-sure convergence. To identify the trajectories used by [F4] and [F5], let ΞN:ZN→(T∗TLd)N be ΞN((xi,vi)i=1N)=((Lxi mod L,P0vi)i=1N) and set τ0=mL/P0, k(x)=(mL/P02)K(Lx) as in [F3]. For the first N iid initial coordinates, define (Zi(s))i=1N:=ΞN−1 ⁣(Φτ0sN(ΞN((Zi(0))i=1N)))=((qi(τ0s)/L,pi(τ0s)/P0))i=1N, where ΦtN is the physical flow from [F4]. This is its conjugate in the dimensionless coordinates Z=Td×Rd and time s; differentiating and using the model equations gives X˙i=Vi and V˙i=N−1∑j≠ik(Xi−Xj). Since k(0)=0, μN(s)=N−1∑iδZi(s) is the empirical characteristic evolution to which [F5] applies. The coordinate scaling commutes with particle permutations, so the exchangeability used below follows from [F4] and the iid initial law. On [−T,T] the particle trajectories depend continuously on time and their initial vector by [F4]. The characteristics carrying μ0 have uniformly bounded velocities there because K is compact and k is bounded. For two times s,t, transport the target of any empirical-to-μs coupling by the characteristic map from s to t, and move its labelled source atoms from Zi(s) to Zi(t). The cost changes by at most N−1∑idZ(Zi(s),Zi(t))+∫dZ(χsz,χtz) dμ0(z), which tends to zero as t→s; reversing times proves continuity of the error. At each fixed time its dependence on the initial vector is continuous by the labelled-coupling bound above and [F4]. Its supremum over [−T,T] therefore equals the supremum over a countable dense set of times and is measurable. Applying [F5] at every ∣s∣≤T yields the supremum bound with factor eCT, both in expectation and almost surely.

4.1F1F4F5F6step 3.1algebra∎

The joint law of the finite particle vector is permutation invariant by [F4] and iid symmetry [F1]. Given the finite-particle configuration at time s, draw k indices independently and uniformly from {1,…,N}. The resulting tuple has conditional law μN(s)⊗k. The chance of an index collision is at most (k2)/N by a union bound. After averaging over the exchangeable particle vector, conditioning the index sampling on no collision makes the tuple's law equal to that of the first k particles. Thus the expectation of Ψ under the true k-law and under μN(s)⊗k differs by at most 2∥Ψ∥∞(k2)/N. For any coupling π of μN(s) and μs, its k-fold product from [F6] couples their product laws, and the sum-metric Lipschitz bound gives a test-integral difference at most kLip⁡(Ψ)∫dZ dπ. Taking the infimum over π, then expectation, and using [F5] gives the second term in the displayed bound. The estimate tends to zero uniformly for ∣s∣≤T, establishing fixed-k propagation of chaos in the stated test class.

Remarks

The expected rate is intentionally a simple finite-partition bound, not an optimal Wasserstein rate. Almost-sure convergence is obtained from fourth moments and a direct tail-union argument; no strong-law claim is needed. The theorem assumes an iid sequence exists, while the cited Ionescu--Tulcea construction records how one can obtain it under its full Choice hypothesis.

Depends on

Dependency tree · 2 levels

Sources