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.

Exact weak transport identity for weighted signed vortex particles

Statement

Let xi:[0,T]→R2 be C1 trajectories with fixed real weights Γi, and let g:[0,T]×R2→R2 be a common continuous force correction. Suppose x˙i(t)=∑j=1NΓjKε(xi(t)−xj(t))+g(t,xi(t)), where Kε is the mollified kernel in Equal-probability mean-field and weighted signed vortex particle systems. For ωN(t)=∑iΓiδxi(t) and every φ∈Cc1(R2), ∫φdωN(t)−∫φdωN(0)=∫0t∫∇φ(x)⋅(∫Kε(x−y)dωN(s)(y)+g(s,x))dωN(s)(x)ds. In particular, the uncorrected regularized particle system satisfies the same weak identity with g=0.

Facts & Assumptions

Given: The weighted particle paths, fixed weights, common continuous force correction, and φ∈Cc1(R2).

[F1]

The weighted system and its signed particle measure use the finite sums x˙i=∑jΓjKε(xi−xj) and ωN=∑iΓiδxi (Equal-probability mean-field and weighted signed vortex particle systems).

Proof

1.1givenF1F2algebra

By [F2] and the ODE in the Statement, ddt∑iΓiφ(xi(t))=∑i,jΓiΓj∇φ(xi(t))⋅Kε(xi(t)−xj(t))+∑iΓi∇φ(xi(t))⋅g(t,xi(t)). All sums are finite, so integrating this equality in time is valid.

2.1F1step 1.1algebra∎

Expanding the two signed-measure integrals on the right of the Statement gives exactly the two finite sums in step 1.1. The left side is the weighted test sum at times t and 0, so integration of step 1.1 proves the identity.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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