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.
Smooth mollified Biot-Savart kernel
Definition
In this definition only, use the local one-based coordinate names and for , whose coordinate domain is as in The Euclidean inner product on . Let and The locally integrable value assigned to is immaterial. Fix a radial, nonnegative smooth bump supported in the unit ball with ; its scaled family is the mollifier family of The mollifier family generated by a unit-mass smooth bump. Put , , and The kernel is a regularized interaction; its smoothness and global Lipschitz property are proved in a separate lemma. It does not define the singular physical interaction at a collision.
Depends on
Used by
- Characteristic solution for a finite signed regularized vorticity Definition
- Equal-probability mean-field and weighted signed vortex particle systems Definition
- Separable regularized vortex-inspired Hamiltonian comparison system Definition
- Same-sign smooth vortex density and probability blob error budget Example
- The mollified Biot-Savart kernel is smooth and globally Lipschitz Lemma
- Characteristic existence and total-variation preservation for regularized signed vorticity Theorem
- L1 consistency of the mollified Biot-Savart kernel Theorem
- Mean-field vortex blob error budget with signed particles, force quadrature, and RK4 Theorem
- Signed Dobrushin stability with bounded force defects Theorem
Dependency tree · two levels
17 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
- J. Liu and X. Xin, Convergence of Vortex Methods for Weak Solutions to the 2-D Euler Equations with Vortex Sheet Data (standard reference, not scraped)
- Gregory R. Baker and Lan D. Pham, A Comparison of Blob Methods for Vortex Sheet Roll Up (standard reference, not scraped)