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.
Continuous-size coagulation-fragmentation weak model
Definition
Fix and . A continuous-size coagulation-fragmentation model consists of a symmetric nonnegative aggregation kernel and finite constants such that where is the fragmentation rate. It also has a Borel kernel of finite nonnegative daughter-count measures on . Fix a finite constant and require , , and . For , take and . Assume , where is defined in Bounded-Lipschitz discrepancy for finite measures.
For signed define the symmetric bilinear coagulation operator and linear fragmentation operator by
On a time interval , a weak solution is a path of positive measures satisfying the following identity in integral form for each continuous with :
Equivalently, in . The first term counts ordered coagulation pairs with factor . The second term removes one parent at each fragmentation event and adds its expected daughter measure; its first-moment normalization is the displayed identity. A binary split has .
Depends on
Used by
- Unbounded-grid fixed-pivot coagulation-fragmentation dynamics Definition
- Constant-kernel aggregation conserves mass and has explicit number decay Example
- A second moment controls the discarded mass and number tails Lemma
- Bounded coagulation is bilinear and bounded in weighted total variation Lemma
- Bounded kernels give a local positive measure-valued solution Lemma
- Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error Lemma
- Mass-normalized fragmentation is bounded in weighted total variation Lemma
- The bounded-kernel continuous coagulation-fragmentation field is locally Lipschitz Lemma
- Bounded binary coagulation-fragmentation is globally well posed in weighted total variation Theorem
- Bounded-kernel measure solutions are stable in bounded-Lipschitz discrepancy Theorem
- Bounded-kernel measure solutions conserve mass and control number and second moments Theorem
- Sectional size discretization separates grid and cutoff errors Theorem
- The unbounded fixed-pivot flow has first-order grid error Theorem
Dependency tree · one level
2 results within one dependency step 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
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §§1 and 3 (standard reference, not scraped)
- Philippe Laurençot and Stéphane Mischler, From the discrete to the continuous coagulation-fragmentation equations, §1 (standard reference, not scraped)