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.
Unbounded-grid fixed-pivot coagulation-fragmentation dynamics
Definition
Adopt all kernel and daughter-measure hypotheses of Continuous-size coagulation-fragmentation weak model: in particular, is symmetric, nonnegative, bounded and Lipschitz, is nonnegative, bounded and Lipschitz, and is a nonnegative Borel kernel with , support in , , and the stated bounded-Lipschitz dependence and convention below . Let be a strictly increasing grid with , , and . Use the no-cutoff pivot rule from Conservative fixed-pivot redistribution on a finite positive grid on every cell of this semi-infinite grid. For every signed measure , write for the linear projection of a measure on onto .
For a signed grid measure , define All products are projected, with no overflow; positive states are the population dynamics. The finite-cutoff algorithm instead sends products above its last pivot to the reported reservoir. By the barycentric identities, each projection has total number one, reproduces its first moment, and adds at most to the second moment of each projected size.
Depends on
Used by
- Finite cutoff differs from the unbounded pivot model by a controlled return error Lemma
- Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error Lemma
- Sectional size discretization separates grid and cutoff errors Theorem
- The unbounded fixed-pivot flow has first-order grid error Theorem
- Unbounded-grid fixed-pivot dynamics are globally well posed and stable Theorem
Dependency tree · two levels
4 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
- Jitendra Kumar, Numerical approximations of population balance equations in particulate systems, Chapter 2, §2.2 (standard reference, not scraped)
- Philippe Laurençot and Stéphane Mischler, From the discrete to the continuous coagulation-fragmentation equations, §§1–2 (standard reference, not scraped)