Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-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.

Global characteristic flow for a globally Lipschitz mean-field kernel

Statement

Assume Countable Choice. Let K be globally Lipschitz with constant L in the convention of Globally Lipschitz mean-field interaction kernel, and let μ0 be a Borel probability measure on Rd with finite first moment. For every finite T>0 there exists a characteristic solution on [0,T] in the sense of Characteristic solution of a probability mean-field equation. It is unique up to equality of trajectories for μ0-almost every label. No compact support assumption is needed.

Facts & Assumptions

Given: Countable Choice, the kernel, probability measure, and finite first moment in the Statement.

[F1]

The kernel satisfies ∣K(x,y)∣≤∣K(0,0)∣+L(∣x∣+∣y∣) and the two-variable Lipschitz bound (Globally Lipschitz mean-field interaction kernel).

[F2]

The weighted continuous path space over a probability label space with integrable initial path is complete (Completeness of the weighted continuous trajectory space).

[F4]

The product probability measure exists, Tonelli applies to its nonnegative integrands, and the product Borel sigma-algebra agrees with the Euclidean product Borel sigma-algebra (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}).

[F5]

Dominated convergence passes a pointwise limit through an integral under one integrable majorant (Dominated convergence).

[A1]

Countable Choice supplies representatives in the weighted-path completeness proof (The Axiom of Countable Choice (ACω)).

[F6]

The natural numbers are cofinal in the reals (Every complete ordered field is Archimedean).

Proof

1.1givenA1F1F2F4F5construct

On a time interval [a,a+δ], use the space in [F2] over (Rd,μ0) and fix the initial label map Xa. Define Φ(Z)t(x)=Xa(x)+∫at∫K(Zs(x),Zs(y))dμ0(y)ds. The growth bound in [F1], the integrability of Xa, and [F4] make the time integral finite in the weighted norm. For almost every label, the integrand is continuous in time; it is dominated in the second label by ∣K(0,0)∣+L(sup⁡s∣Zs(x)∣+sup⁡s∣Zs(y)∣), integrable by the path norm, so [F5] makes each output path continuous. The space is nonempty because the constant-in-time path Xa belongs to it.

2.1F1F2F3F4step 1.1choose

For any Z,W, applying [F1], integrating first over the label x and then y, and using that μ0 has mass one gives ∥ΦZ−ΦW∥≤2Lδ∥Z−W∥. Choose δ>0 with 2Lδ<1 when L>0; if L=0 any finite δ works. The contraction theorem [F3] yields a unique fixed point on this interval.

3.1F1F2F6step 1.1step 2.1algebra

The bound in step 2.1 applies on each successive interval with the attained endpoint path as initial data. By [F6], choose an integer J>2LT and partition [0,T] into J equal intervals (or use one interval when L=0); each interval then has length below 1/(2L) and successive fixed points construct the solution on all of [0,T]. Each fixed point belongs to the weighted path space, so its endpoint has finite first moment and is admissible for the next interval.

4.1F1F2F3step 3.1step 2.1∎

Any two solutions on the first interval are fixed points of the same contraction and hence agree by [F3]. Repeating on each successive interval gives equality for μ0-almost every label on all of [0,T]. The fixed point equation and the pushforward definition give exactly the characteristic solution in [F1] and Characteristic solution of a probability mean-field equation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

73 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