Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Superposition for finite-action Euclidean continuity equations

Statement

Assume AC. Let T>0 and let (μt,vt) be a narrowly continuous finite-action solution of the continuity equation on [0,T]×Rd. There is a Borel probability law η on C([0,T];Rd) such that (et)#η=μt for every t, and for η-almost every path γ, γ is absolutely continuous and γ˙(t)=vt(γ(t)) for almost every t. Its expected path action equals the Eulerian action: ∫ ⁣∫0T∣γ˙(t)∣2dt dη(γ)=∫0T ⁣∫∣vt(x)∣2dμt(x)dt.

Statement references

Finite-action continuity equation in Euclidean space

A narrow probability curve defines its space-time measure

Gaussian regularization preserves finite-action continuity equations

Regularized continuity equations are represented by characteristic flows

Quadratic path energy is lower semicontinuous

Prokhorov tightness theorem on polish spaces

Weakly convergent sequences are tight

Tight family of probability measures

Polish spaces are separable completely metrizable spaces

Ascoli–Arzelà in the uniform topology for nonempty compact metric domains

Continuous Rn-valued curves on a nonempty compact interval form a complete supremum-metric space

C_c(X) is dense in L^p(mu) for a Radon measure

Smooth compactly supported tests are dense for finite Radon L2 measures

Radon measure on an LCH space

Assuming countable choice, Borel probability measures on Polish spaces are inner regular

Disintegration of a joint law on standard borel spaces

Standard Borel spaces

Finite products of standard Borel spaces are standard Borel

The product measure of two sigma-finite measure spaces

For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique

Random elements and real random variables

Law or distribution of a random element

The law of a random element is a probability measure

Change of variables for expectation

Measurability of integration against a kernel

Weak convergence of borel probability measures

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

Fubini's theorem for L^1 functions on a sigma-finite product

Holder's inequality for integrals, including the endpoint cases

Monotone convergence for the integral

Closure properties of measurable functions used by the integral

The Axiom of Choice

AC implies DC implies countable choice

The Axiom of Countable Choice (ACω)

The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

Ambrosio, Gigli, and Savaré, Gradient Flows, Theorem 8.2.1

Santambrogio, Optimal Transport for Applied Mathematicians, Chapter 5, §5.3

Facts & Assumptions

Given: AC and the narrowly continuous finite-action solution (μt,vt).

[F1]

For every ε>0, the regularized pair has a global flow representation μtε=(Xtε)#μ0ε and its flow paths satisfy γ˙=vtε(γ) almost everywhere. Gaussian regularization preserves finite-action continuity equations Regularized continuity equations are represented by characteristic flows

[F2]

A family of probabilities on a Polish space is tight exactly when it is relatively sequentially compact under AC; every weakly convergent sequence of probabilities on a Polish space is tight. Prokhorov tightness theorem on polish spaces Tight family of probability measures Weakly convergent sequences are tight Polish spaces are separable completely metrizable spaces The Axiom of Choice

[F3]

The path energy E(γ)=∫∣γ˙∣2 (infinite off AC2 paths) is nonnegative and lower semicontinuous on the uniform path space. Quadratic path energy is lower semicontinuous

[F9]

Weak convergence is convergence of integrals against bounded continuous functions; monotone convergence passes increasing nonnegative integrals to the limit. Weak convergence of borel probability measures Monotone convergence for the integral

[F10]

A Borel random element has a Borel probability law defined by pushforward; nonnegative path functionals integrate against that law by change of variables, and laws compose with Borel evaluation maps. Random elements and real random variables Law or distribution of a random element The law of a random element is a probability measure Change of variables for expectation

[F4]

Under AC, disintegrating the law of (t,γ(t),γ˙(t)) over its standard-Borel (t,γ(t)) marginal gives a Borel conditional probability kernel. Kernel integrals are measurable. Disintegration of a joint law on standard borel spaces Standard Borel spaces Finite products of standard Borel spaces are standard Borel Measurability of integration against a kernel The Axiom of Choice

[F7]

The time-space law M is a finite Borel measure with time marginal Lebesgue measure and section integral dt μt(dx). A narrow probability curve defines its space-time measure

[F8]

Borel probabilities on Polish spaces are inner regular, so compact sets can capture arbitrarily high mass. Assuming countable choice, Borel probability measures on Polish spaces are inner regular Polish spaces are separable completely metrizable spaces

Proof

1.1F1F6F8F10

Set εn=1/n. For each n, let Dn be the Borel full-μ0εn-measure set of initial points whose regularized flow paths exist on all of [0,T]. The map Fn:Dn→C([0,T];Rd), Fn(x)(t)=Xtεn(x), is Borel by [F1]. Extend it by the zero path off Dn and define ηn=(Fn)#μ0εn; this is the law of a Borel random element and is a Borel probability. For every t, composition with evaluation gives (et)#ηn=(Xtεn)#μ0εn=μtεn by [F1]. The flow equation, the same marginal identity, and Tonelli give ∫E(γ)dηn(γ)=∫0T ⁣∫∣vtεn(x)∣2dμtεn(x)dt≤A, where A=∫0T ⁣∫∣vt(x)∣2dμt(x)dt<∞. For every fixed t, μtεn⇒μt: for bounded continuous f, first restrict y to a compact set carrying all but arbitrarily small μt-mass using [F8], then use uniform continuity of f on a one-neighborhood of that compact and concentration of the Gaussian kernels at zero.

1.2F2F3F7

The path space C with the uniform metric is Polish: it is complete by the continuous-curve completeness fact, and rational polygonal paths are countable and dense. By [F2], the sequence of initial laws is tight. Given δ>0, choose compact K with μ0εn(Kc)<δ/2 for all n, and choose R so A/R<δ/2. The set KR={γ:γ(0)∈K, E(γ)≤R} is closed by [F3] and compact by Arzela–Ascoli: its paths obey ∣γ(t)−γ(s)∣≤R∣t−s∣ and sup⁡t∣γ(t)∣≤sup⁡x∈K∣x∣+RT. Markov's inequality, which follows from 1{E>R}≤E/R, gives ηn(KR)≥1−δ. Thus (ηn) is tight; [F2] gives a weakly convergent subsequence, still denoted ηn, with Borel probability limit η.

2.1F2F3F9step 1.1step 1.2

For each t, evaluation et:C→Rd is continuous, so weak convergence and the marginal convergence μtεn⇒μt imply (et)#η=μt. By [F3], E is nonnegative and lower semicontinuous. For each integer k define gk(γ)=min⁡{k,inf⁡ζ∈C[E(ζ)+k∥γ−ζ∥∞]}. The triangle inequality makes gk k-Lipschitz, 0≤gk≤E, and gk increases with k. If a<E(γ), lower semicontinuity gives a neighborhood of γ where E>a; outside that neighborhood the term k∥γ−ζ∥∞ exceeds a for all sufficiently large k. Thus gk(γ)↑E(γ). By [F9], weak convergence gives ∫gkdη=lim⁡n∫gkdηn≤lim inf⁡n∫Edηn for every k. Monotone convergence [F9] yields ∫Edη≤lim inf⁡n∫Edηn≤A. In particular η-almost every path is absolutely continuous with square-integrable derivative.

3.1F4F6F7step 2.1

Give [0,T]×C the probability measure λ=(dt/T)⊗η and define the Borel random element Z(t,γ)=(t,γ(t),γ˙(t)), setting the last coordinate to zero wherever the derivative limit is undefined. Measurability follows by expressing the derivative as the limit of measurable difference quotients; it agrees with the path derivative for λ-almost every pair. The law Π of Z has (t,x) marginal M/T by the time-marginal identity in step 2.1. Disintegrate with the velocity as the conditioned coordinate, and put b(t,x)=∫u Kt,x(du) where defined, zero otherwise. It is Borel by [F4]. Conditional Jensen and step 2.1 give ∫∣b∣2dM≤T∫∣u∣2dΠ=∫ ⁣∫0T∣γ˙(t)∣2dt dη(γ)≤A. The factor T cancels because Π uses normalized time.

3.2F6step 1.1step 2.1

Fix a smooth compactly supported vector field ξ(t,x). For a finite partition P=(ti) of mesh h, set SP(γ)=∑iξ(ti,γ(ti))⋅(γ(ti+1)−γ(ti)). For every AC2 path, bounded derivatives of ξ imply ∣∫0Tξ(t,γ(t))⋅γ˙(t)dt−SP(γ)∣≤Cξ(hT E(γ)1/2+hE(γ)). Indeed on each interval ∣ξ(t,γt)−ξ(ti,γti)∣≤Cξ(h+∣γt−γti∣), while Cauchy--Schwarz gives ∫titi+1∣γ˙∣≤hEi and ∣γt−γti∣≤hEi; summing yields the bound. Its expectation is uniform over ηn and η by the action bound. For fixed P with N intervals, SP is continuous and ∣SP∣2≤N∥ξ∥∞2∑i∣γ(ti+1)−γ(ti)∣2. Pathwise Cauchy--Schwarz gives ∫∣γ(ti+1)−γ(ti)∣2dηn≤(ti+1−ti)A, so these sums have uniformly bounded second moments under ηn and η. Thus SP is uniformly integrable, and weak convergence plus bounded truncations gives ∫SPdηn→∫SPdη. Letting h tend to zero proves convergence of the expected path integrals.

4.1F1F5F6F7step 3.1step 3.2

Under ηn, the path derivative is vtεn(γ(t)); hence its expected ξ-pairing is ∫ξ(t,x)⋅vtεn(x)dμtεn(x)dt. By the convolution definitions, ∫ξ⋅vεndMεn=∫0T ⁣∫vt(y)⋅(ξt∗ρεn)(y)dμt(y)dt⟶∫ξ⋅v dM, since ξt∗ρεn→ξt uniformly and v∈L1(M) by finite action and Holder. Combining with step 3.2 and the conditional-mean definition of b gives ∫ξ⋅b dM=∫ξ⋅v dM. Smooth-test density [F5] implies b=v M-almost everywhere.

5.1F3step 2.1step 3.1step 4.1∎

The time marginals of η are μt, so ∫∣v(t,γ(t))∣2dt dη=A. By step 3.1 the conditional mean of γ˙ given (t,γ(t)) is b, which equals v by step 4.1. Therefore ∫ ⁣∫0T∣γ˙(t)−vt(γ(t))∣2dt dη=∫E dη+A−2∫v⋅b dM=∫E dη−A≤0. The left side is nonnegative, so it is zero. Thus γ˙=vt(γ(t)) for dt dη-almost every pair, and the expected path action equals A. Together with the time marginals this is the claimed superposition law.

Depends on

Used by

Dependency tree · two levels

158 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources