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.
Coagulation Fragmentation and Sectional Population Balance Numerics
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Formal Power Series
- Foundations of the Real Numbers for Analysis
- Global ODE and Log-density Integration Error
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- One-step ODE Consistency and Local Error
- Order, Zorn's Lemma, and the Axiom of Choice
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Formal Laurent Series Field ℝ((t⁻¹)): Cauchy Complete, Non-Archimedean, Not Complete
- The Logarithm and General Powers
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Summary
This page defines finite discrete coagulation-fragmentation events, conservative fixed-pivot redistribution, and a reported overflow-mass reservoir. It proves event-level mass identities, positivity for a finite sectional ODE and its forward-Euler step under an explicit loss-rate CFL, global finite-dimensional well-posedness, and fixed-grid first-order time convergence.
For bounded Lipschitz kernels and finite initial weighted moments, it develops a measure-valued weak model with local and global well-posedness, number/mass/second-moment estimates, bounded-Lipschitz stability, and an explicit fixed-pivot quadrature argument. An auxiliary unbounded pivot grid separates grid error from the finite-cutoff error; the reservoir is diagnostic and does not model later fragmentation return. The final budget separates time, grid, and cutoff errors.
The continuous global claims require bounded kernels and the stated daughter-count and mass normalizations. The product-kernel example proves pre-gelation second-moment blow-up; no post-gelation mass-loss theorem is proved here. Finite-grid mass conservation does not imply a cutoff-independent continuum moment bound for superlinear kernels.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Bounded-Lipschitz discrepancy for finite measures
Definition
For finite signed Borel measures on , define their bounded-Lipschitz discrepancy by
where the supremum is over all real functions on with supremum norm at most and Lipschitz constant at most . For a finite measure , the notation means . This discrepancy only tests bounded Lipschitz observables; it does not control an unbounded moment without a separate moment estimate.
Conservative fixed-pivot redistribution on a finite positive grid
Definition
Let be a finite grid of positive pivot masses with integer , and let . For , define the fixed-pivot probability measure
At a grid node this rule returns the single Dirac mass at that node, including at both endpoints. For , the rule returns an overflow record of mass and no last-bin particle. For it returns an invalid-grid status. The domain convention is therefore part of the method: every retained aggregation product and every daughter size must be at least , and a product above is handled by the overflow rule.
For error analysis, the same barycentric formula is also used on a semi-infinite grid with and . On that grid it is defined for every and never overflows; this is an auxiliary unbounded-pivot dynamics, distinct from the finite-cutoff method above.
Finite discrete coagulation and fragmentation with a mass reservoir
Definition
Fix a basic mass and an integer . Species has mass and number concentration . A symmetric nonnegative array specifies binary aggregation. In the ordered-pair convention, the event rate for is ; summing over ordered pairs counts an unequal pair twice and an equal pair once with its required factor .
If , an aggregation event has stoichiometric increment , where is the th coordinate vector. If , it removes the two parents from the retained bins and adds mass to a scalar overflow reservoir ; the reservoir has no return dynamics. Thus this branch is a truncation model and is not a physical state law for particles that later fragment.
For fragmentation, each species has event rate , where . The monomer does not fragment: set and impose no daughter normalization for . Its expected daughter counts are for , with . One event has increment . The mean equations are the finite sums of these event rates times their increments, together with the stated overflow-reservoir equation. When is specified as an actual random daughter law, these equations describe its expected event increment.
Weighted total-variation space for population measures
Definition
Fix , put , and define the weight . Let be the real vector space of finite signed Borel measures on for which
where is the total-variation measure. The norm is . A positive population measure is a nonnegative member . Its number, mass, and second moment are , , and . The space and its completeness are established in The weighted total-variation measure space is complete.
Convergent power series differentiate term by term inside their radius
Statement
Let and let be real coefficients such that for every both and converge. Then is differentiable for , with
Facts & Assumptions
Given: The two absolute-convergence assumptions in the Statement.
Proof
Fix with and choose with . For and each , so every term has modulus at most and the quotient has modulus at most . Therefore the tail after degree of the difference-quotient series is bounded uniformly in such by . The tail of the proposed derivative series at has the same bound.
Given , choose so both tail bounds in step 1.1 are below . The finite polynomial has derivative at , so choose small enough that its difference quotient differs from this derivative by less than . The full difference quotient and full derivative series then differ by less than by the two tails and this finite-polynomial bound. This proves differentiability and the displayed derivative formula.
Finite sectional coagulation-fragmentation balance with reported overflow
Definition
Input a grid , a nonnegative grid population , a nonnegative reservoir mass , symmetric nonnegative aggregation rates , nonnegative parent fragmentation rates , and daughter-count measures supported in with . For each ordered pair use event rate . If , remove one particle from each parent slot and add the fixed-pivot measure ; if , remove both parents and add mass to , with no retained last-bin particle. For each parent , use fragmentation rate , remove its parent particle, and add to the grid population.
The resulting finite-dimensional autonomous ODE is the sum of these event rates times their stated increments, with equal to the total overflow-mass rate. Invalid grids, negative input populations, or a daughter measure with support outside return invalid-input. The reservoir is diagnostic truncation mass and has no later fragmentation or coagulation law.
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 .
Weighted total variation bounds bounded-Lipschitz discrepancy
Statement
For ,
Facts & Assumptions
Given: The weight and the test class in the bounded-Lipschitz discrepancy.
Bounded-Lipschitz discrepancy for finite measures: every admissible test has .
Weighted total-variation space for population measures: the weighted norm is with .
Proof
For each admissible , by [F1]. Taking the supremum proves the first inequality.
Since , integrating against dominates its total mass, which is the total-variation norm.
Stoichiometric number and mass changes for finite coagulation and fragmentation events
Statement
In the finite discrete model of Finite discrete coagulation and fragmentation with a mass reservoir, an in-range coagulation event changes the retained number by and retained mass by . An overflow event changes retained number by , retained mass by , and reservoir mass by . A fragmentation event of species changes number by and mass by .
Facts & Assumptions
Given: The event definitions, stoichiometric increments, and daughter normalization in Finite discrete coagulation and fragmentation with a mass reservoir.
Finite discrete coagulation and fragmentation with a mass reservoir: an in-range aggregation event has increment ; overflow removes both parents and adds their mass to the reservoir; fragmentation has increment with .
Proof
For , summing the coordinates of gives , and pairing it with the mass vector gives .
For , the two parent removals give number change and retained-mass change ; the reservoir increment is exactly , so augmented mass change is zero.
Fragmentation changes number by . Its mass change is by the daughter normalization.
Fixed-pivot weights are nonnegative and reproduce number and mass
Statement
For every , the two weights in Conservative fixed-pivot redistribution on a finite positive grid are nonnegative, sum to , and have weighted pivot mass . Their expected absolute displacement is at most , and their weighted second moment satisfies
At a grid endpoint the same conclusions hold for the single-pivot endpoint rule, with zero second-moment excess.
Facts & Assumptions
Given: A strictly increasing positive grid and .
Conservative fixed-pivot redistribution on a finite positive grid: the weights are and , with single-node assignment at grid endpoints.
Proof
Since and , both fractions in [F1] are nonnegative. Their sum is .
Their weighted mass is after expanding and cancelling terms.
Writing , the weighted second moment is . Subtracting and factoring gives , which is nonnegative and at most because .
At a grid endpoint the single pivot has mass and second moment , so the excess is zero; this proves the endpoint clauses too.
In an interior cell, the expected absolute displacement is by step 2.2. At a node the displacement is zero by [F1].
Rooted-tree series and the inverse of u exp(-u)
Statement
Let and . These series converge absolutely for . On that disk they satisfy , , and . Consequently . For real , is the unique satisfying .
Facts & Assumptions
Given: Formal series are multiplied by coefficient convolution, and the Lagrange–Bürmann formula applies to the unique formal solution of over a field containing .
Lagrange–Bürmann inversion extracts coefficients of a compositional inverse and of functions of it: if and , then for every .
Formal differentiation is linear and satisfies product, power, quotient, chain, and coefficient-recovery laws: formal differentiation obeys the product rule and the chain rule for admissible compositions with summable differentiated families; composition with a series of zero constant coefficient is locally finite.
A formal power series is a unit exactly when its constant coefficient is a unit: a formal power series with nonzero constant coefficient over a field is invertible.
For every real , : .
Convergent power series differentiate term by term inside their radius: for real coefficients and real arguments, if a power series and its formal derivative series converge absolutely at every smaller radius, the sum differentiates termwise inside the radius.
Proof
Apply [F1] with and . It gives , and the defining equation for the compositional inverse gives as a formal identity.
Differentiate formally using [F2]. Since , the series is a unit by [F3], and rearrangement yields . Therefore , so .
For , the ratio is by [F4]. The coefficients of are , so their ratios have the same limit; the derivative-series ratios are and , respectively. For every , all four series are therefore bounded in their tails on by convergent geometric series. In particular, [F5] gives termwise differentiation for real arguments.
For either coefficient sequence or , fix complex and real with . For complex , the identity bounds the difference-quotient tail after degree by , uniformly in . The derivative-series tail has the same bound, tending to zero by step 3.1. The finite polynomial head differentiates for complex increments, so taking its limit and then letting proves complex termwise differentiation. Products may be regrouped absolutely, and the expansion of is absolutely dominated by . Thus the formal identities in steps 1.1 and 2.1 give , , and for the sums. The middle identity rules out , and hence gives .
For real , the coefficients of are nonnegative, so . If , continuity and give with , but step 4.1 implies , a contradiction. Thus . Since is strictly increasing on , step 4.1 identifies with its unique inverse-branch value.
The weighted total-variation measure space is complete
Statement
The normed vector space of Weighted total-variation space for population measures is complete.
Facts & Assumptions
Given: , , and with norm .
Weighted total-variation space for population measures: consists of finite signed Borel measures with , and .
Proof
The map is linear. Multiplication by the positive function gives , so [F1] yields . It is onto because for any finite signed measure , satisfies and .
Let be Cauchy in total variation. Choose increasing indices with , taking the least qualifying index at each step. For each Borel set , the series converges absolutely, uniformly in , because each summand is bounded by its total-variation norm. Define by that sum. If are disjoint, the double series of absolute values is bounded by , so the two countable sums may be interchanged; hence is countably additive. The same tail bound gives . Given , choose so this is below and the Cauchy property gives for all . For any , choose and pass to the limit in ; since , this gives . Thus finite signed measures are complete in total variation.
Pulling the limit back through the inverse isometry gives a limit in for every Cauchy sequence there.
Forward Euler for a finite sectional balance with a positivity CFL
Definition
Input a valid grid state with , a step , and the finite sectional event rates of Finite sectional coagulation-fragmentation balance with reported overflow. The total per-particle loss rate is
First validate the grid, state, rates, and daughter measures against the input conditions of Finite sectional coagulation-fragmentation balance with reported overflow, and require ; if any condition fails, return invalid-input without updating. For admissible inputs use exact arithmetic to evaluate the finite event sums defining and . If for any coordinate, return cfl-failure without updating. Otherwise return success together with . Exact-arithmetic positivity and conservation are stated separately in The sectional forward-Euler step is positive and conserves augmented mass ↗.
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.
Bounded coagulation is bilinear and bounded in weighted total variation
Statement
For the coagulation bilinear operator of Continuous-size coagulation-fragmentation weak model, every satisfies
Facts & Assumptions
Given: The weight , the bounded kernel , and the signed-measure operator.
Proof
For , , since the difference is .
Total variation of a signed integral is bounded by the integral against the variation measures. Applying this to [F1] and using gives . Step 1.1 factors this bound as , which is the claimed estimate by [F2].
Mass-normalized fragmentation is bounded in weighted total variation
Statement
Assume the daughter-count bound of Continuous-size coagulation-fragmentation weak model with . The fragmentation operator there satisfies
Facts & Assumptions
Given: , , , daughter support in , daughter number at most , and daughter first moment .
Proof
Since on the support of , and hence . Therefore .
The weighted variation of the signed measure is at most because . Integrating against and using [F2] gives the claim.
The finite sectional reaction vector field is locally Lipschitz
Statement
For fixed grid, aggregation rates, fragmentation rates, and daughter measures, the augmented right-hand side in Finite sectional coagulation-fragmentation balance with reported overflow is locally Lipschitz on the full finite-dimensional state space.
Facts & Assumptions
Given: The finite grid, rates, and event formulas of Finite sectional coagulation-fragmentation balance with reported overflow.
Finite sectional coagulation-fragmentation balance with reported overflow: every retained coordinate and the reservoir derivative are finite sums of constant multiples of linear or quadratic monomials in the retained concentrations.
Proof
Define the extension on all real augmented states by evaluating the same finite event polynomials, without the algorithm's population-validity test. On nonnegative states it agrees with the algorithm's right-hand side; the extension need not describe physical events off that orthant. On a ball , every quadratic monomial obeys by adding and subtracting . Linear monomials obey the same bound with coefficient .
Each coordinate of is a finite weighted sum of these differences; the reservoir coordinate is independent of . Summing the finitely many coefficient bounds gives a finite constant with on the ball.
Finite sectional event dynamics preserve positivity and retained-plus-reservoir mass
Statement
For the ODE of Finite sectional coagulation-fragmentation balance with reported overflow, every solution starting from and remains nonnegative for as long as it exists. The augmented mass
is constant. The retained-bin number and retained mass need not be constant when overflow occurs.
Facts & Assumptions
Given: A finite positive pivot grid, nonnegative aggregation and fragmentation rates, daughter measures with first moment equal to the parent mass, and a nonnegative initial state.
Finite sectional coagulation-fragmentation balance with reported overflow: every aggregation or fragmentation contribution is an event rate times a nonnegative product or daughter measure minus the consumed parent particles; an overflow event adds its consumed mass to .
Fixed-pivot weights are nonnegative and reproduce number and mass: every retained product or daughter is redistributed by nonnegative weights reproducing its mass.
Proof
At every nonnegative state with , no event consuming coordinate has positive rate, because each such rate contains ; all events producing have nonnegative rates and yields. Thus on that face of the orthant.
For the ODE, extend the event formulas to all real states by the same finite polynomials; they agree with the algorithm on admissible states and are locally Lipschitz, since differences of quadratic monomials are bounded by a constant times the coordinate differences on each ball. On a compact time interval in the solution's existence interval choose a Lipschitz constant on a ball containing both the solution and its coordinatewise positive part. Set and . For each coordinate with , one has , so step 1.1 and Lipschitz continuity give . The absolutely continuous negative-part chain rule gives when , zero when , and zero almost everywhere on the level set . Hence almost everywhere. Since and , differentiating shows it is nonincreasing from zero, so . Once , the reservoir derivative is a sum of nonnegative overflow rates, hence .
For an in-range aggregation event with parent masses , the pivot output has mass by [F2]; subtracting the two parents gives zero augmented-mass change. For overflow, the retained parents remove mass and the algorithm adds exactly this amount to . For fragmentation of parent , the daughter measure has first moment by the algorithm input, and each pivot projection preserves daughter mass by [F2], so parent removal and daughter addition cancel. Thus every event increment has zero augmented-mass change. Pairing the ODE with the mass vector and adding gives ; integrating yields .
The discrete product-kernel solution has finite-time second-moment blow-up
Statement
Define concentrations by the discrete product-kernel equations with monomer initial data and for . For , define . The pre-gelation solution is where the value at is understood by continuity. Its first and second moments satisfy and . Thus the second moment becomes unbounded at the finite time although the pre-gelation first moment is constant.
Facts & Assumptions
Given: The discrete product-kernel equations and the rooted-tree generating series.
Rooted-tree series and the inverse of u exp(-u): , , , , and for .
Rooted-tree series and the inverse of u exp(-u): for , is the unique satisfying .
Proof
Put and . For , define . Since , [F1] gives the convergent generating function . Its mass generating function is . Because and , [F2] gives , so .
For every fixed and , differentiation of gives . The gain coefficient in the th product-kernel equation is because implies . The loss is by step 1.1. Their difference is exactly , verifying every coefficient equation for . At , only is nonzero: the right-hand side is for , for , and for . The displayed formula has the same right derivatives, since and has zero derivative at for . Thus the equations and initial data hold at the initial time as well.
Applying once more to and using [F1] gives Therefore as , while step 1.1 gives throughout the pre-gelation interval.
The bounded-kernel continuous coagulation-fragmentation field is locally Lipschitz
Statement
Let be the vector field from Continuous-size coagulation-fragmentation weak model. On the ball it satisfies
Also, .
Facts & Assumptions
Given: The symmetric bilinear coagulation operator and linear fragmentation operator on .
Proof
Bilinearity and symmetry give . Applying [F1] to each term and the ball bounds yields at most .
Linearity and [F2] bound the fragmentation difference by . Adding the coagulation and fragmentation estimates proves the stated Lipschitz bound. Both operators vanish at the zero measure, so .
The sectional forward-Euler step is positive and conserves augmented mass
Statement
For a nonnegative finite sectional state, if for every bin, the successful step of Forward Euler for a finite sectional balance with a positivity CFL has , , and
Facts & Assumptions
Given: A valid grid state , a step , and the CFL inequalities in the Statement.
Forward Euler for a finite sectional balance with a positivity CFL: the update is and .
Finite sectional event dynamics preserve positivity and retained-plus-reservoir mass: the augmented mass is conserved along the event ODE.
Finite sectional coagulation-fragmentation balance with reported overflow: each ordered pair has rate and removes both parents; fragmentation removes its parent at rate ; retained gains are nonnegative, and overflow adds its consumed mass to .
Proof
For each bin, write , where is the total birth rate. This is the event decomposition of [F3]: the total aggregation loss of parent is under the ordered-pair convention, and its fragmentation loss is . Thus by the CFL condition.
By [F3], the reservoir update adds times a nonnegative overflow-mass rate, so . By [F2], the mass derivative at every nonnegative initial state is zero, so the vector-field increment has zero augmented mass; multiplying by and adding the unchanged initial mass proves the displayed identity.
Finite sectional dynamics have a unique global positive solution
Statement
For every nonnegative finite-grid initial state , with grid indices , mesh width , maximum aggregation rate , fragmentation rate bound , and daughter count bound , the ODE of Finite sectional coagulation-fragmentation balance with reported overflow has a unique solution for all , and the solution remains nonnegative. Here and each daughter measure has first moment . If its initial augmented mass is , then
where and .
Facts & Assumptions
Given: A finite-dimensional autonomous event ODE, a nonnegative initial state, and the mass and positivity conclusions of the cited items.
The finite sectional reaction vector field is locally Lipschitz: the finite-dimensional right-hand side is locally Lipschitz.
Finite sectional event dynamics preserve positivity and retained-plus-reservoir mass: solutions remain nonnegative and on their intervals of existence.
Every Picard–Lindelöf initial value problem has one maximal solution on an open interval: every locally Lipschitz finite-dimensional initial-value problem has a unique maximal solution.
Picard-Lindelöf local existence and uniqueness for first-order systems: every locally Lipschitz finite-dimensional initial-value problem has a unique solution on a neighborhood of its initial time.
Fixed-pivot weights are nonnegative and reproduce number and mass: redistributing a product or daughter of size adds at most to its second moment.
Proof
By [F1] and [F3], the event ODE has a unique maximal solution on an open time interval containing . While it exists, [F2] puts every coordinate in the closed set and , which is compact because the grid is finite and .
Along each in-range coagulation event at parent masses , the second-moment increment is at most by [F5]; an overflow event only removes retained second moment. Summing the event rates bounds the coagulation contribution by . For fragmentation, because and ; pivot redistribution adds at most per parent event. Thus its second-moment contribution is at most .
Since , the mass bound in step 1.1 gives and . Integrating the derivative bound in step 1.2 yields the displayed estimate.
If the maximal right endpoint were finite, step 1.1 puts the solution in a compact set. Continuity of there gives a bound on , so and has a limit in that set as . By [F4], restarting at the limit gives a local solution; uniqueness in [F3] glues it to the existing solution and extends past , a contradiction. The same argument applies at every finite endpoint.
Unbounded-grid fixed-pivot dynamics are globally well posed and stable
Statement
Under the hypotheses of Unbounded-grid fixed-pivot coagulation-fragmentation dynamics, is a well-defined locally Lipschitz vector field on the weighted measure space supported on , and every positive initial grid measure has a unique global positive solution to . On every finite interval it satisfies If are two such solutions and , then where depends only on . The proof also gives the vector-field estimate for positive grid measures with the same number bound; here .
Facts & Assumptions
Given: A semi-infinite positive pivot grid, bounded Lipschitz kernels, and the weighted measure space.
Unbounded-grid fixed-pivot coagulation-fragmentation dynamics: has nonnegative gains for positive states, per-parent coagulation loss rate , and fragmentation loss rate . Its adopted daughter hypotheses include support in , , , and .
Bounded-Lipschitz discrepancy for finite measures: tests functions with supremum norm and Lipschitz constant at most .
Fixed-pivot weights are nonnegative and reproduce number and mass: is positive, has mass , expected displacement at most , and second-moment excess at most .
The weighted total-variation measure space is complete: is complete in weighted total variation.
Proof
The grid has no finite accumulation point, so it is closed in . A weighted-total-variation limit of measures supported on assigns zero variation to , hence the grid-supported subspace is closed and complete by [F5]. For , [F4] gives . Thus projection maps weighted measures boundedly into this subspace. The positive cone is closed: if and in weighted total variation, then .
Testing the equation with gives , since each aggregation event changes number by and each fragmentation increment is at most . Testing with gives zero coagulation increment by [F4], and zero fragmentation increment because by [F1] and projection preserves each daughter's mass by [F4]. Thus . Testing with , each coagulation event contributes at most , and each fragmentation event contributes at most because daughter second moment before projection is at most . Integrating the resulting inequalities proves all three displayed moment bounds.
For an admissible test in [F3], let . On each cell this is the linear interpolant of the endpoint values; its slope has absolute value at most . Continuity at the pivots gives and on all of . The coagulation test integrand is bounded and Lipschitz in each variable with constants depending only on .
Write , where and is the sum of the positive aggregation and fragmentation gains in [F1]. On a signed-measure ball , , and when . The bound in step 1.1 and bound the aggregation gain by a constant times ; for fragmentation, and bound the gain by a constant times . Bilinearity makes the aggregation gain locally Lipschitz, and the fragmentation gain is bounded linear.
Decompose . Each section of the step 1.3 integrand, scaled by its bounded-Lipschitz norm, is an admissible test in [F3]. The resulting coagulation difference is bounded by . For fragmentation the integrand has supremum at most and Lipschitz constant at most , so its difference is bounded by a constant times .
On the closed positive path ball of radius , let bound and be its Lipschitz constant, as obtained in step 2.1. For positive paths in that ball, set Since , is continuous in time in ; the gain path is continuous in by step 2.1. For bounded , multiplication has , so the survival multipliers are continuous in operator norm and the formula defines a continuous path. They lie in , so preserves positivity. Its norm is at most , hence it maps the ball into itself when . Since , the inequalities for and the triangle inequality give Choose so this coefficient is . The positive path ball is nonempty because it contains . Iteration from satisfies ; for , . Completeness from step 1.1 gives a limit, and the contraction bound makes continuous, so the limit is fixed. Any two fixed points have distance at most times itself, so they coincide. For a fixed point, has operator-norm derivative , since the scalar exponential difference quotients converge uniformly in size. Splitting the difference quotient of the source integral at gives endpoint term and integral term ; hence the fixed point solves the equation in [F1]. Conversely, for any positive solution , the inverse multiplier is operator-norm differentiable with . The product difference quotient gives ; integrating this continuous derivative by telescoping partitions and multiplying by recovers the same mild formula. Continuity at puts any competing solution in this ball on a sufficiently short interval, where the fixed-point uniqueness just proved applies.
On the number and second-moment estimates bound . The local Lipschitz estimates in step 2.1 bound there, so is Cauchy in weighted total variation at any finite endpoint. Completeness gives a positive limit; the local construction restarts there and uniqueness glues the extension. Therefore no finite maximal endpoint exists.
Integrating the two weak equations and using the number bound in the Statement gives , where . With , one has and almost everywhere. Thus and .
Bounded kernels give a local positive measure-valued solution
Statement
For the bounded Lipschitz kernels and daughter measures of Continuous-size coagulation-fragmentation weak model, every positive initial measure has a unique positive solution to the weak model for some .
Facts & Assumptions
Given: The bounded-kernel weak equation, a positive initial measure, and the weighted total-variation space.
Continuous-size coagulation-fragmentation weak model: define the weak vector field and preserve positivity of the gain measures.
The bounded-kernel continuous coagulation-fragmentation field is locally Lipschitz: that vector field is Lipschitz on every bounded ball of .
The weighted total-variation measure space is complete: is complete in .
Bounded coagulation is bilinear and bounded in weighted total variation: the coagulation bilinear operator is bounded on weighted total variation.
Mass-normalized fragmentation is bounded in weighted total variation: the fragmentation operator is bounded on weighted total variation.
Proof
For a positive path in a ball of radius , define and the positive gain , , and . Then . Since , ; bilinearity gives its local Lipschitz bound. Also by the daughter estimate in [F5]. Thus is bounded and Lipschitz on the ball, and is bounded by .
On define . The loss rate is continuous in time in , since ; the gain path is continuous in by the bounded-operator estimates in [F4]–[F5]. For bounded , multiplication satisfies , so the survival multipliers are continuous in operator norm and is a continuous path. For positive it is positive. On the closed positive path ball of radius , the gain bound gives for sufficiently small . The bounds and give . Choose so this coefficient is below .
The closed positive path ball is complete: a Cauchy sequence converges uniformly by [F3], its uniform limit is continuous, and the positive cone is closed because when . It is nonempty because it contains the constant path . If is the contraction coefficient in step 2.1, iteration from satisfies . For , , so completeness gives a limit. The contraction bound makes continuous, hence the limit is fixed; if two fixed points existed, their distance would be at most times itself, hence zero. For a fixed point, has operator-norm derivative , since the scalar exponential difference quotients converge uniformly in . Splitting the difference quotient of the source integral at gives its endpoint term and its integral term ; thus the fixed point solves . Conversely, for any positive solution , the inverse multiplier is operator-norm differentiable with . The product difference quotient gives ; integrating this continuous derivative by telescoping partitions and multiplying by recovers the same mild formula. Continuity at puts any competing solution in this ball on a sufficiently short interval, where fixed-point uniqueness makes it equal to the constructed solution.
The derivative established in step 3.1 is . Symmetry of combines the two coagulation loss marginals into ; the fragmentation loss is . Hence this is precisely the weak equation in [F1], proving the claim.
Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error
Statement
Let be positive and put . With the continuous vector field and the no-cutoff grid field, for one has
Facts & Assumptions
Given: A mesh with maximum cell width , bounded Lipschitz kernels, and a positive finite-number measure.
Unbounded-grid fixed-pivot coagulation-fragmentation dynamics: projects every product and daughter to the grid by and preserves each event's first moment.
Continuous-size coagulation-fragmentation weak model: has the stated coagulation and fragmentation weak forms, with Lipschitz and .
Bounded-Lipschitz discrepancy for finite measures: is the supremum over tests of supremum norm and Lipschitz constant at most .
Fixed-pivot weights are nonnegative and reproduce number and mass: has total mass , expected displacement at most , expected mass exactly , and second-moment excess at most .
Bounded coagulation is bilinear and bounded in weighted total variation: the continuous coagulation term maps to .
Mass-normalized fragmentation is bounded in weighted total variation: the continuous fragmentation term maps to .
Unbounded-grid fixed-pivot dynamics are globally well posed and stable: is well-defined on weighted grid measures.
Proof
By [F5] and [F6], , and [F4] makes well-defined; [F7] gives . Fix a test admissible in [F3] and set . On each cell this is the linear interpolation of endpoint values; its slope has absolute value at most , so is also admissible. The displacement estimate [F4] gives .
For the coagulation term, sample and independently. The grid-field test integrand averaged over has gain and losses ; the projected continuous-field integrand has gain and the same losses. The gain difference is at most . Also , and the event bracket has absolute value at most . Thus the absolute difference of the two coagulation integrals is at most .
For fragmentation, write . Then , , and by [F2] and [F3]. Since , the integrand difference equals . The three terms are bounded by , , and , respectively. Using proves the displayed bound after integrating over .
Adding the coagulation and fragmentation bounds holds for every admissible test in [F3]. Taking their supremum gives the asserted bounded-Lipschitz norm inequality.
Sectional forward Euler converges globally with first-order error
Statement
Fix a finite grid and a final time . Let be the exact finite sectional solution from Finite sectional dynamics have a unique global positive solution, with nonnegative initial data and augmented mass . Let be an integer, set , initialize , and apply Forward Euler for a finite sectional balance with a positivity CFL for steps, with a uniform CFL bound . Then there is a constant , independent of , such that
The constant may depend on the grid, rates, mass, and final time. This is convergence to the specified finite-dimensional sectional ODE; it does not include grid or cutoff error.
Facts & Assumptions
Given: The fixed finite-dimensional autonomous ODE, its nonnegative exact solution, the shared initial state , the fixed-time mesh , and the uniform positivity CFL.
Finite sectional dynamics have a unique global positive solution: the unique global nonnegative exact solution obeys and for initial augmented mass .
Forward Euler for a finite sectional balance with a positivity CFL: each successful update is forward Euler .
The sectional forward-Euler step is positive and conserves augmented mass: each accepted step stays in the same compact nonnegative mass simplex.
Forward Euler has uniform local order one and a one-step Lipschitz bound: for a field with the field and its first derivatives bounded on an open cylinder with convex state fibers, forward Euler has local defect when the exact path and every exact-start Euler input/output pair lie in a common compact tube; the derivative bound gives the one-step factor for inputs in a common state fiber.
Global error from uniform one-step defect and stability: with a common compact tube having positive margin in the open domain and containing the exact path, numerical states, and method stages, a uniform local defect and one-step factor imply a fixed-time global error bound .
Proof
Use the finite event polynomials to extend to all real augmented states, and use the Euler map there. This map agrees with every successful algorithm step; the error analysis may evaluate it at other states without imposing the algorithm's acceptance test. Let , a compact box since the grid is finite and each . The exact path lies in by [F1]; starting from , repeated application of [F3] puts every numerical state in the nonnegative augmented-mass simplex of mass , which is contained in . Set and ; these are finite because is polynomial. Since , every exact-start Euler output obeys . Thus the exact path, all successful numerical states and Euler stage states, and the exact-start Euler inputs and outputs all lie in the compact tube . This tube lies with positive margin in the bounded open cylinder , whose state fibers are convex. The time-independent finite polynomial field and its first derivatives are bounded on . Hence [F4] applies uniformly to every local defect, including the exact-start Euler output, and gives defect ; its derivative bound also gives the one-step factor for inputs in .
Apply [F5] with initial error zero, the fixed mesh , and the common compact tube from step 1.1. It gives , as claimed.
Bounded-kernel measure solutions conserve mass and control number and second moments
Statement
Let be a positive local solution of Continuous-size coagulation-fragmentation weak model with initial number , mass , and second moment . Then for every time in its interval of existence,
Facts & Assumptions
Given: The weak equation with symmetric bounded , daughter mass normalization, and a positive local solution in .
Continuous-size coagulation-fragmentation weak model: the coagulation increment for a test is ; fragmentation increment is , with and on its support.
Bounded kernels give a local positive measure-valued solution: a positive local solution exists in , so the tests are integrable.
Proof
Take in [F1]. The coagulation increment is , and the fragmentation increment is . Thus , and integration gives .
With , each coagulation event changes number by , while fragmentation changes it by . Hence . The derivative of is nonpositive, giving .
With , coagulation contributes . Fragmentation contributes , since and . Therefore , and integration proves the last bound.
A second moment controls the discarded mass and number tails
Statement
For a positive measure with finite second moment and every , In particular, for the bounded-kernel solution of Bounded-kernel measure solutions conserve mass and control number and second moments, these tails are uniform on every finite time interval after substituting the theorem's mass and second-moment bounds.
Facts & Assumptions
Given: A positive measure and the moment definitions on .
Continuous-size coagulation-fragmentation weak model: the state measure is positive.
Bounded-kernel measure solutions conserve mass and control number and second moments: on each finite interval, is constant and .
Proof
On , . Integrating this pointwise inequality against the positive measure gives .
On the same set, . Integration gives . Applying [F2] makes both right-hand sides uniform for in a fixed finite interval.
Bounded binary coagulation-fragmentation is globally well posed in weighted total variation
Statement
Under the hypotheses of Continuous-size coagulation-fragmentation weak model, every positive initial measure has a unique positive weak solution on every finite time interval. For its norm is bounded by
Facts & Assumptions
Given: The weighted measure space, local positive solution construction, and number, mass, and second-moment estimates.
Continuous-size coagulation-fragmentation weak model: the bounded kernels and daughter measures specify the weak equation and its vector field on .
Bounded kernels give a local positive measure-valued solution: every positive initial measure admits a unique local positive solution.
The weighted total-variation measure space is complete: is complete in its weighted norm.
The bounded-kernel continuous coagulation-fragmentation field is locally Lipschitz: is Lipschitz on every bounded ball and .
Proof
Since is positive, . Applying [F3] for gives the displayed finite bound.
Suppose a maximal solution had a finite endpoint . The model definition [F1] identifies its vector field, and the bound in step 1.1 places it in a fixed weighted-norm ball. By [F5], there, so ; hence is Cauchy as . Completeness [F4] gives a limit . Positivity is closed: if and in weighted total variation, then .
Restart the local construction [F2] at . Its solution agrees on the overlap by local uniqueness and extends the original solution beyond , a contradiction. Repeating this continuation excludes every finite right endpoint. If two global solutions have the same initial measure, local uniqueness in [F2] makes them agree successively on each compact time interval.
Bounded-kernel measure solutions are stable in bounded-Lipschitz discrepancy
Statement
Let be positive weak solutions of Continuous-size coagulation-fragmentation weak model on , with . Then for a constant depending only on ,
Facts & Assumptions
Given: Two positive weak solutions, the bounded-Lipschitz test class, symmetric bounded Lipschitz , and bounded Lipschitz fragmentation data.
Continuous-size coagulation-fragmentation weak model: the coagulation test increment is , and the fragmentation increment is .
Bounded-Lipschitz discrepancy for finite measures: is the supremum over tests with and .
Bounded-kernel measure solutions conserve mass and control number and second moments: the number moments of both solutions are bounded by their initial number times .
Proof
Fix an admissible test in [F2]. The coagulation integrand has a uniform supremum bound and uniform Lipschitz bounds in each variable: the bracket is bounded by and changes by at most when only changes, so the product rule for differences gives a bound depending only on .
The function is bounded by and Lipschitz with constant at most , by the assumed boundedness and . Thus its fragmentation derivative difference is bounded by a constant times .
Write . For each fixed value of the other variable, the section of is a bounded-Lipschitz function with the constants from step 1.1. Scaling that section into the unit test class [F2] and integrating the other variable gives a coagulation derivative difference bounded by .
Integrating the weak equations, steps 2.1 and 1.2 give for every admissible the bound , where [F3] makes uniform on . Taking the supremum gives . Put ; then and almost everywhere, so and .
The unbounded fixed-pivot flow has first-order grid error
Statement
Let be the continuous solution of Continuous-size coagulation-fragmentation weak model on , and let be the no-cutoff pivot solution of Unbounded-grid fixed-pivot coagulation-fragmentation dynamics on a grid of maximum spacing , initialized by . Then for , where is the quadrature constant in Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error evaluated at the uniform number bound for , and is the vector-field stability constant for the projected continuous paths and pivot solutions. Both constants are finite and independent of .
Facts & Assumptions
Given: Bounded-kernel moment bounds, first-order fixed-pivot quadrature consistency, and grid-field bounded-Lipschitz stability.
Continuous-size coagulation-fragmentation weak model: the continuous path satisfies in integral form.
Unbounded-grid fixed-pivot coagulation-fragmentation dynamics: is a linear map from continuous measures to grid measures and .
Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error: on the bounded-number set.
Bounded-kernel measure solutions conserve mass and control number and second moments: is constant and is bounded on .
Unbounded-grid fixed-pivot dynamics are globally well posed and stable: the pivot vector field is bounded-Lipschitz in on positive paths with bounded number, and preserves and .
Fixed-pivot weights are nonnegative and reproduce number and mass: each pivot projection has expected displacement at most .
Proof
For every , [F6] gives , so the linear projection is bounded on . Set ; applying this bounded linear map to the integral equation [F1] gives . The total-number-one and first-moment identities in [F2] and [F6] give and , so [F5] supplies a -independent number bound for both and .
Subtract the equations for and and add and subtract . The vector-field term is bounded by using [F5]; the residual is at most by [F3]. Therefore , with . Set . Then and . If , integrating gives ; if , . Since , this is at most .
For any test admissible in [F3], its expected pivot value differs from its original value by at most its Lipschitz constant times the expected displacement. [F6] therefore yields . The triangle inequality with step 2.1 proves the Statement.
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.
Sectional size discretization separates grid and cutoff errors
Statement
Let be a continuous solution on with initial mass , and let be the retained measure of the finite sectional system initialized by retaining the projection on pivots at most and placing the projected tail mass in its reported reservoir. Assume is a pivot endpoint and . Then where is from Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error, is a finite bounded-number stability constant, and the terms proportional to , are respectively the grid and cutoff errors. The reservoir itself is diagnostic and does not recreate the omitted transition law.
Facts & Assumptions
Given: The continuous weak model, the finite reported-overflow scheme, and the no-cutoff pivot comparison.
Continuous-size coagulation-fragmentation weak model: the continuous population satisfies the weak coagulation-fragmentation equation.
Conservative fixed-pivot redistribution on a finite positive grid: in-range sizes are redistributed by positive barycentric weights and above-cutoff products enter a mass reservoir.
Finite sectional coagulation-fragmentation balance with reported overflow: the finite algorithm applies the in-range pivot rule and omits retained particles for products above .
Bounded-kernel measure solutions conserve mass and control number and second moments: is constant and is bounded on .
The unbounded fixed-pivot flow has first-order grid error: the unbounded-pivot flow differs from by at most .
Finite cutoff differs from the unbounded pivot model by a controlled return error: replacing the unbounded-pivot flow by the finite reported-overflow flow adds at most .
Proof
By [F1] the target is a continuous-model solution; [F2]–[F3] specify that finite products above leave the retained measure and enter only the diagnostic reservoir. Form the unbounded-pivot solution from the initial projection . Split the difference as This is the triangle inequality for the discrepancy in [F1].
Apply [F5] to the second term and [F6] to the first term. Their stated bounds use the same conserved initial mass and finite-horizon number bound, so taking a common stability constant and adding gives exactly the displayed estimate. The first two contributions vanish with grid spacing, and the last two with cutoff growth.
Sectional forward Euler separates temporal, quadrature, and cutoff errors
Statement
Assume all hypotheses of Sectional size discretization separates grid and cutoff errors, with continuous-model solution on , initial mass , grid spacing , and pivot endpoint . Let the finite grid have retained bins, take , an integer , and . Initialize both the exact finite sectional system and forward Euler by that theorem's same retained projection and tail-mass reservoir. Let be the successful forward-Euler states under the uniform positivity CFL, and let be the exact finite-sectional retained measure. There are constants and independent of such that The first term is temporal error for the fixed finite ODE; the terms in and are the separate grid and cutoff errors. The temporal constant may depend on the fixed grid and cutoff.
Facts & Assumptions
Given: A fixed finite-dimensional sectional ODE, its accepted forward-Euler steps, and the grid/cutoff estimate.
Sectional forward Euler converges globally with first-order error: for the fixed finite system.
Sectional size discretization separates grid and cutoff errors: the exact finite-sectional retained measure differs from by the displayed grid and cutoff terms.
Proof
Write the population-coordinate error vector as . Its total-variation norm as an atomic signed measure is at most by Cauchy-Schwarz. Thus [F1] and [F3] bound the temporal discrepancy by .
Insert the exact finite-sectional measure between the Euler retained measure and . The triangle inequality and [F2] add the temporal term from step 1.1 to the grid and cutoff terms in [F2], giving the asserted separated error budget.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §§2–3
- Jitendra Kumar, Numerical approximations of population balance equations in particulate systems, Chapter 2, §2.2
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §1
- Philippe Laurençot and Stéphane Mischler, From the discrete to the continuous coagulation-fragmentation equations, §1
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §§1 and 3
- Tobias Holck Colding, MIT 18.100B Real Analysis, Lecture 22: Differentiating and Integrating Power Series
- Philippe Laurençot and Stéphane Mischler, From the discrete to the continuous coagulation-fragmentation equations, §§1–2
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §2
- Jacek Banasiak, Analytic fragmentation semigroups and classical solutions to coagulation-fragmentation equations, §1
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §§1 and 3.3
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, §6.2
- Ernst Hairer, course notes, Chapter III: Équations Différentielles Ordinaires, §§III.2–III.3
- Jacek Banasiak, Analytic fragmentation semigroups and classical solutions to coagulation-fragmentation equations, §§1–2
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §§3.1–3.4
- Jitendra Kumar, Numerical approximations of population balance equations in particulate systems, Chapter 2
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §§3.1–3.2
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §§1 and 3.1
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §3.4
- Philippe Laurençot and Stéphane Mischler, From the discrete to the continuous coagulation-fragmentation equations, §§2–4