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.
L1 consistency of the mollified Biot-Savart kernel
Statement
Assume Countable Choice and the radial compactly supported mollifier of Smooth mollified Biot-Savart kernel. Write and let be the essential supremum of . There is a constant , independent of , such that Consequently, for every bounded measurable vorticity density , This is an error estimate at fixed ; it does not prove a singular-limit theorem for the particle dynamics.
Facts & Assumptions
Given: The mollifier and kernel in Smooth mollified Biot-Savart kernel, and Countable Choice for polar integration.
Assume Countable Choice for the polar-coordinate and change-of-variables suppliers (The Axiom of Countable Choice ()).
The mollifier is radial, nonnegative, supported in , and has mass one (Smooth mollified Biot-Savart kernel).
Polar coordinates give for nonnegative Borel (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma).
Taylor expansion through first order has a second-derivative remainder bounded along admitted segments (Multivariable Taylor formula with a Lagrange remainder along a line segment).
Under Countable Choice, a diffeomorphism obeys change of variables for functions (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions).
The Euclidean norm on is the square root of the sum of coordinate squares (The Euclidean inner product on , Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
Proof
On , [F2] and give . Also so its integral over this disk is at most .
First, each component is integrable because it is bounded and compactly supported. Radiality makes it odd under the reflection ; applying [F4] to that reflection, whose Jacobian determinant has absolute value one, gives , hence every first-moment component is zero. Now fix and . The segment from to is contained in the open ball , which is convex and avoids the origin, and each second coordinate derivative of is bounded there by : direct differentiation gives terms of the forms and . Apply the scalar Taylor theorem [F3] to each component of along this segment. The coordinate remainders are each bounded by , so [F5] gives the vector bound with . Integrating in against , the linear term vanishes by the just-proved first-moment identity, and . Hence .
Integrating the bound in step 1.2 by [F2] over gives at most Together with step 1.1 this proves the stated estimate.
For each , the convolution difference is absolutely bounded by Taking the essential supremum in and using step 2.1 proves the force estimate.
Depends on
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Smooth mollified Biot-Savart kernel
- The mollified Biot-Savart kernel is smooth and globally Lipschitz
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma
- A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions
- Multivariable Taylor formula with a Lagrange remainder along a line segment
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
Used by
Dependency tree · two levels
61 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)
- François Golse, Mean-Field Limits in Statistical Dynamics, Lecture 1 (standard reference, not scraped)