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.
Characteristic solution for a finite signed regularized vorticity
Definition
Assume AC. Let be a finite signed Borel measure on , set , and let be its Jordan decomposition. The Jordan total-variation formula gives . If , its characteristic solution is the constant zero measure curve. If , set with sigma-algebra , and define the probability measure by for Borel and ; its total mass is one by the displayed formula. A signed characteristic solution for the regularized kernel on is a jointly measurable path map , modulo -almost everywhere equality, with absolutely continuous paths for almost every label, , and
such that its time-supremum function is measurable and . It represents the signed measure curve
Here denotes when and when . The total variation mass is at time zero, and the sign coordinate records each Jordan part separately.
Depends on
- A signed measure is countably additive and takes at most one infinite value
- The total variation |nu|(E) from countable measurable partitions
- Jordan decomposition of a signed measure into unique mutually singular positive parts
- The Axiom of Choice
- Smooth mollified Biot-Savart kernel
- For a signed measure, total variation is nu-plus plus nu-minus, finite partitions suffice, and nu-plus and nu-minus are extremal
- The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}
Used by
Dependency tree · two levels
25 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
- François Golse, Mean-Field Limits in Statistical Dynamics, Lecture 1 (standard reference, not scraped)
- 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)