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.
Finite cutoff differs from the unbounded pivot model by a controlled return error
Statement
Let be a semi-infinite pivot grid and . Let be a positive grid measure in and let solve the no-cutoff dynamics of Unbounded-grid fixed-pivot coagulation-fragmentation dynamics. Let be the finite sectional solution on the initial grid segment from , extended by zero to . Initialize the finite model's reported reservoir with . If , then for , where is the bounded-number stability constant from Unbounded-grid fixed-pivot dynamics are globally well posed and stable. The reservoir records the finite model's overflow mass exactly; the estimate allows the unbounded model's above-cutoff particles to coagulate or fragment and return mass to the retained range.
Facts & Assumptions
Given: The finite cutoff and unbounded pivot systems share the same grid, kernels and rates below .
Finite sectional coagulation-fragmentation balance with reported overflow: a product above is omitted from retained bins and its mass is added to the reservoir; parents are still removed.
Finite sectional dynamics have a unique global positive solution: the finite solution is positive and its retained mass is bounded by the conserved augmented mass .
Unbounded-grid fixed-pivot dynamics are globally well posed and stable: unbounded-grid solutions conserve first moment, have number at most , and their vector field is bounded-Lipschitz on number-bounded sets with constant .
A second moment controls the discarded mass and number tails: the number in a tail above is at most its first moment divided by .
Proof
At time zero, is the restriction of to . Since every admissible bounded-Lipschitz test has supremum norm at most , by [F4].
At any finite-cutoff state, the fragmentation gains and all parent-loss terms in agree with those of the no-cutoff field. The only omitted retained-measure gain is for parent pairs with . Their ordered event rate is at most The finite mass bound gives , while [F4] gives . Each omitted gain pairs with a bounded test by at most its event rate, so .
Write for the retained-measure field of the finite algorithm [F1], and for the no-cutoff field. Subtract the equations for and , add and subtract , and test against any admissible bounded-Lipschitz function. By [F3] the vector-field difference contributes at most ; step 1.2 contributes at most . Taking the supremum and integrating yields Let . Then and almost everywhere. If , multiplying by and integrating gives ; if , . Substituting from step 1.1 proves the bound.
Depends on
- Finite sectional coagulation-fragmentation balance with reported overflow
- Unbounded-grid fixed-pivot coagulation-fragmentation dynamics
- Finite sectional dynamics have a unique global positive solution
- Unbounded-grid fixed-pivot dynamics are globally well posed and stable
- A second moment controls the discarded mass and number tails
Used by
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
- 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)