Alphabeta Math
LemmaStatement: 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.

The localized flow cannot escape all cutoffs in finite time

Statement

Assume AC and the feature-measure energy hypotheses. Let r0>0 and let μ0∈P2(Ω) have finite energy and be concentrated on Qr0. Set M0=sup⁡{∥∇R(z)∥:R(z)≤F(μ0)}, a=(1+M0)C1, and b=(1+M0)C2. For T<∞, define r(T)={(r0+aT),b=0,(r0+a/b)ebT−a/b,b>0. For every R>r(T), the localized flow with indicator ιQR remains in Qr(T) for 0≤t≤T and therefore solves the continuity equation with the constraint Ω alone on this interval. Localized flows with different cutoffs larger than r(T) agree on [0,T]. In particular no trajectory starting in Qr0 can escape every cutoff in finite time.

Facts & Assumptions

Given: AC, the model assumptions, initial law and cutoff family.

[F1]

Along a localized flow the energy decreases, and R(mμt)≤F(μ0) because V≥0. The localized Wasserstein gradient flow exists, satisfies EVI, and is unique Feature-measure energy and its regularity assumptions

[F2]

The constrained minimum-norm field is no larger than the admissible field obtained by adding zero from the cutoff normal cone; on Qs its norm is at most (1+M0)(C1+C2s). Feature-measure energy and its regularity assumptions The localized Wasserstein gradient flow exists, satisfies EVI, and is unique

[F3]

If a point of Ω is within distance s of Qr, then it lies in Qr+s. Feature-measure energy and its regularity assumptions

[F4]

AC supplies the locally absolutely continuous label paths representing the localized flow. The Axiom of Choice The localized Wasserstein gradient flow exists, satisfies EVI, and is unique

[F5]

Solutions using the same Ω-constrained velocity are unique by their W2 stability estimate. One-sided semiconvex characteristics give W2 uniqueness and stability

Proof

Given: AC, T, and μ0 as in the Statement.

1.1F1F2F4

By [F1], mμt stays in the R-sublevel set used to define M0. The unconstrained part of the negative velocity has norm at most M0(C1+C2R)+(C1+C2R)=(a+bR). Since 0 belongs to the normal cone of QR at each point of QR, adding the cutoff constraint and taking the minimum norm cannot increase this bound by [F2]. Thus every localized label path has speed at most a+bR before leaving QR.

2.1F2F3step 1.1

Fix R>r(T) and a label path starting at u0∈Qr0. Let sR(t)=∫0t∣X˙q∣dq. By [F3], its displacement from u0 gives dist⁡(Xt,Qr0)≤sR(t) and hence Xt∈Qr0+sR(t). At almost every time apply [F2] at its current radius (the bounded potential supporting vector at the current point remains admissible after restriction to QR), obtaining sR′(t)≤a+b(r0+sR(t)) almost everywhere. If b>0, multiply by e−bt and integrate to get r0+sR(t)≤(r0+a/b)ebt−a/b; if b=0, integration gives r0+sR(t)≤r0+at. Thus r0+sR(t)≤r(t). This estimate holds for the entire localized path; in particular r(T)<R places it in the relative Ω-interior of QR on this interval. The bound holds for almost every label, so the measure flow stays in Qr(T).

3.1F3F5step 2.1∎

For x∈Qr(T), the relative-neighborhood condition places an Ω-neighborhood of x inside QR because R>r(T). Thus the cutoff and Ω constraints have the same local normal cone along these paths, so each localized flow solves the equation with the common Ω-constrained field. If two cutoffs exceed r(T), [F5] gives equality for the common initial law. Taking T arbitrary and increasing the cutoff constructs a compatible global flow, so finite-time escape from all cutoffs is impossible.

Depends on

Used by

Dependency tree · two levels

34 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