Alphabeta Math
Pipeline-generated
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

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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Bounded-Lipschitz discrepancy for finite measures

Definition

For finite signed Borel measures μ,ν on E=[a,∞), define their bounded-Lipschitz discrepancy by

dBL(μ,ν)=sup⁡∥φ∥∞≤1, Lip⁡(φ)≤1∣∫Eφ d(μ−ν)∣,

where the supremum is over all real functions on E with supremum norm at most 1 and Lipschitz constant at most 1. For a finite measure η, the notation ∥η∥BL means dBL(η,0). This discrepancy only tests bounded Lipschitz observables; it does not control an unbounded moment without a separate moment estimate.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Conservative fixed-pivot redistribution on a finite positive grid

Definition

Let x0<x1<⋯<xM=R be a finite grid of positive pivot masses with integer M≥1, and let Δ=max⁡0≤i<M(xi+1−xi). For z∈[xi,xi+1], define the fixed-pivot probability measure

PΔ(z)=xi+1−zxi+1−xi δxi+z−xixi+1−xi δxi+1.

At a grid node this rule returns the single Dirac mass at that node, including at both endpoints. For z>R, the rule returns an overflow record of mass z and no last-bin particle. For z<x0 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 x0, and a product above R is handled by the overflow rule.

For error analysis, the same barycentric formula is also used on a semi-infinite grid x0<x1<⋯ with xi→∞ and sup⁡i(xi+1−xi)≤Δ. On that grid it is defined for every z≥x0 and never overflows; this is an auxiliary unbounded-pivot dynamics, distinct from the finite-cutoff method above.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Finite discrete coagulation and fragmentation with a mass reservoir

Definition

Fix a basic mass a>0 and an integer N≥2. Species i∈{1,…,N} has mass mi=ia and number concentration ni≥0. A symmetric nonnegative array Kij=Kji specifies binary aggregation. In the ordered-pair convention, the event rate for (i,j) is Kijninj/2; summing over ordered pairs counts an unequal pair twice and an equal pair once with its required factor 1/2.

If i+j≤N, an aggregation event has stoichiometric increment ei+j−ei−ej, where ei is the ith coordinate vector. If i+j>N, it removes the two parents from the retained bins and adds mass mi+mj to a scalar overflow reservoir L; 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 i≥2 has event rate βini, where βi≥0. The monomer does not fragment: set β1=0 and impose no daughter normalization for i=1. Its expected daughter counts are bi(k)≥0 for 1≤k<i, with ∑k<ikbi(k)=i. One event has increment −ei+∑k<ibi(k)ek. The mean equations are the finite sums of these event rates times their increments, together with the stated overflow-reservoir equation. When bi is specified as an actual random daughter law, these equations describe its expected event increment.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Weighted total-variation space for population measures

Definition

Fix a>0, put E=[a,∞), and define the weight w(x)=1+x2. Let Mw(E) be the real vector space of finite signed Borel measures σ on E for which

∥σ∥w:=∫Ew(x) ∣σ∣(dx)<∞,

where ∣σ∣ is the total-variation measure. The norm is ∥⋅∥w. A positive population measure is a nonnegative member μ∈Mw(E). Its number, mass, and second moment are M0(μ)=∫E1 dμ, M1(μ)=∫Ex dμ, and M2(μ)=∫Ex2 dμ. The space and its completeness are established in The weighted total-variation measure space is complete.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Convergent power series differentiate term by term inside their radius

Statement

Let r0>0 and let (an)n≥0 be real coefficients such that for every 0<R<r0 both ∑n≥0∣an∣Rn and ∑n≥1n∣an∣Rn−1 converge. Then F(x)=∑n≥0anxn is differentiable for ∣x∣<r0, with F′(x)=∑n≥1nanxn−1.

Facts & Assumptions

Given: The two absolute-convergence assumptions in the Statement.

Proof

1.1givenalgebra

Fix c with ∣c∣<r0 and choose R with ∣c∣<R<r0. For 0<∣h∣<R−∣c∣ and each n≥1, (c+h)n−cnh=∑j=0n−1(c+h)n−1−jcj, so every term has modulus at most Rn−1 and the quotient has modulus at most nRn−1. Therefore the tail after degree N of the difference-quotient series is bounded uniformly in such h by ∑n>Nn∣an∣Rn−1. The tail of the proposed derivative series at c has the same bound.

2.1givenstep 1.1algebra∎

Given ε>0, choose N so both tail bounds in step 1.1 are below ε/3. The finite polynomial ∑n=0Nanxn has derivative ∑n=1Nnancn−1 at c, so choose h small enough that its difference quotient differs from this derivative by less than ε/3. 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.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Finite sectional coagulation-fragmentation balance with reported overflow

Definition

Input a grid a=x0<⋯<xM=R, a nonnegative grid population ni, a nonnegative reservoir mass L, symmetric nonnegative aggregation rates Kij, nonnegative parent fragmentation rates βi, and daughter-count measures Bxi supported in [a,xi] with ∫zBxi(dz)=xi. For each ordered pair (i,j) use event rate Kijninj/2. If xi+xj≤R, remove one particle from each parent slot and add the fixed-pivot measure PΔ(xi+xj); if xi+xj>R, remove both parents and add mass xi+xj to L, with no retained last-bin particle. For each parent i, use fragmentation rate βini, remove its parent particle, and add ∫PΔ(z)Bxi(dz) to the grid population.

The resulting finite-dimensional autonomous ODE is the sum of these event rates times their stated increments, with L˙ equal to the total overflow-mass rate. Invalid grids, negative input populations, or a daughter measure with support outside [a,xi] return invalid-input. The reservoir is diagnostic truncation mass and has no later fragmentation or coagulation law.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Continuous-size coagulation-fragmentation weak model

Definition

Fix a>0 and E=[a,∞). A continuous-size coagulation-fragmentation model consists of a symmetric nonnegative aggregation kernel K:E2→[0,K∗] and finite constants LK,Lβ≥0 such that ∣K(x,y)−K(x′,y′)∣≤LK(∣x−x′∣+∣y−y′∣),∣β(x)−β(y)∣≤Lβ∣x−y∣, where β:E→[0,β∗] is the fragmentation rate. It also has a Borel kernel x↦Bx of finite nonnegative daughter-count measures on E. Fix a finite constant D≥1 and require Bx(E)≤D, supp⁡(Bx)⊆[a,x], and ∫Ez Bx(dz)=x. For x<2a, take β(x)=0 and Bx=δx. Assume dBL(Bx,By)≤LB∣x−y∣, where dBL is defined in Bounded-Lipschitz discrepancy for finite measures.

For signed μ,ν∈Mw(E) define the symmetric bilinear coagulation operator and linear fragmentation operator by

C(μ,ν)=12∬E2K(x,y)(δx+y−δx−δy) μ(dx)ν(dy),Fμ=∫Eβ(x)(Bx−δx) μ(dx).

On a time interval [0,T], a weak solution is a path μ∈C([0,T];Mw(E)) of positive measures satisfying the following identity in integral form for each continuous φ with ∣φ(x)∣≤C(1+x2):

ddt∫Eφ dμt=12∬E2K(x,y)[φ(x+y)−φ(x)−φ(y)] μt(dx)μt(dy)+∫Eβ(x)[∫Eφ(z)Bx(dz)−φ(x)]μt(dx)

Equivalently, μ˙=C(μ,μ)+Fμ in Mw(E). The first term counts ordered coagulation pairs with factor 1/2. 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 x↦(u,x−u) has Bx=δu+δx−u.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

Weighted total variation bounds bounded-Lipschitz discrepancy

Statement

For μ,ν∈Mw(E),

dBL(μ,ν)≤∥μ−ν∥TV≤∥μ−ν∥w.

Facts & Assumptions

Given: The weight w(x)=1+x2≥1 and the test class in the bounded-Lipschitz discrepancy.

[F1]

Bounded-Lipschitz discrepancy for finite measures: every admissible test has ∥φ∥∞≤1.

[F2]

Weighted total-variation space for population measures: the weighted norm is ∫w d∣σ∣ with w≥1.

Proof

1.1givenF1

For each admissible φ, ∣∫φ d(μ−ν)∣≤∫∣φ∣ d∣μ−ν∣≤∥μ−ν∥TV by [F1]. Taking the supremum proves the first inequality.

2.1F2algebra∎

Since w≥1, integrating w against ∣μ−ν∣ dominates its total mass, which is the total-variation norm.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

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 −1 and retained mass by 0. An overflow event changes retained number by −2, retained mass by −(mi+mj), and reservoir mass by mi+mj. A fragmentation event of species i changes number by ∑k<ibi(k)−1 and mass by 0.

Facts & Assumptions

Given: The event definitions, stoichiometric increments, and daughter normalization in Finite discrete coagulation and fragmentation with a mass reservoir.

[F1]

Finite discrete coagulation and fragmentation with a mass reservoir: an in-range aggregation event has increment ei+j−ei−ej; overflow removes both parents and adds their mass to the reservoir; fragmentation has increment −ei+∑k<ibi(k)ek with ∑k<ikbi(k)=i.

Proof

1.1givenF1algebra

For i+j≤N, summing the coordinates of ei+j−ei−ej gives 1−1−1=−1, and pairing it with the mass vector (mk) gives (i+j)a−ia−ja=0.

1.2givenF1algebra

For i+j>N, the two parent removals give number change −2 and retained-mass change −(mi+mj); the reservoir increment is exactly mi+mj, so augmented mass change is zero.

2.1givenF1algebra∎

Fragmentation changes number by −1+∑k<ibi(k). Its mass change is −ia+∑k<ikabi(k)=a(−i+i)=0 by the daughter normalization.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Fixed-pivot weights are nonnegative and reproduce number and mass

Statement

For every z∈[xi,xi+1], the two weights in Conservative fixed-pivot redistribution on a finite positive grid are nonnegative, sum to 1, and have weighted pivot mass z. Their expected absolute displacement is at most Δ/2, and their weighted second moment satisfies

∫u2 PΔ(z)(du)−z2=(z−xi)(xi+1−z)≤Δ24.

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 z∈[xi,xi+1].

[F1]

Conservative fixed-pivot redistribution on a finite positive grid: the weights are (xi+1−z)/(xi+1−xi) and (z−xi)/(xi+1−xi), with single-node assignment at grid endpoints.

Proof

1.1givenF1algebra

Since xi≤z≤xi+1 and xi+1−xi>0, both fractions in [F1] are nonnegative. Their sum is ((xi+1−z)+(z−xi))/(xi+1−xi)=1.

2.1step 1.1F1algebra

Their weighted mass is (xi+1−z)xi+(z−xi)xi+1xi+1−xi=z after expanding and cancelling terms.

2.2givenF1step 1.1algebra

Writing hi=xi+1−xi, the weighted second moment is xi+1−zhixi2+z−xihixi+12. Subtracting z2 and factoring gives (z−xi)(xi+1−z), which is nonnegative and at most hi2/4≤Δ2/4 because (z−xi)+(xi+1−z)=hi.

3.1givenF1step 2.1step 2.2

At a grid endpoint the single pivot has mass z and second moment z2, so the excess is zero; this proves the endpoint clauses too.

4.1givenF1step 2.2algebra∎

In an interior cell, the expected absolute displacement is xi+1−zhi(z−xi)+z−xihi(xi+1−z)=2(z−xi)(xi+1−z)hi≤hi2≤Δ2, by step 2.2. At a node the displacement is zero by [F1].

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

Rooted-tree series and the inverse of u exp(-u)

Statement

Let T(z)=∑k≥1kk−1zk/k! and U(z)=T(z)−T(z)2/2. These series converge absolutely for ∣z∣<e−1. On that disk they satisfy T=zeT, zT′=T/(1−T), and zU′=T. Consequently U(z)=∑k≥1kk−2zk/k!. For real 0≤z<e−1, T(z) is the unique u∈[0,1) satisfying ue−u=z.

Facts & Assumptions

Given: Formal series are multiplied by coefficient convolution, and the Lagrange–Bürmann formula applies to the unique formal solution of w=zϕ(w) over a field containing Q.

[F1]

Lagrange–Bürmann inversion extracts coefficients of a compositional inverse and of functions of it: if w=zϕ(w) and ϕ(0)≠0, then [zn]H(w)=1n[un−1]H′(u)ϕ(u)n for every n≥1.

[F2]

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.

[F3]

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.

[F5]

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

1.1givenF1algebra

Apply [F1] with ϕ(u)=eu and H(u)=u. It gives [zk]T=1k[uk−1]eku=kk−1/k!, and the defining equation for the compositional inverse gives T=zeT as a formal identity.

2.1step 1.1F2F3algebra

Differentiate T=zeT formally using [F2]. Since T(0)=0, the series 1−T is a unit by [F3], and rearrangement yields zT′=T/(1−T). Therefore zU′=zT′(1−T)=T, so [zk]U=[zk]T/k=kk−2/k!.

3.1F4F5step 2.1algebra

For ak=kk−1/k!, the ratio is ak+1/ak=(1+1/k)k−1→e by [F4]. The coefficients of U are ak/k, so their ratios have the same limit; the derivative-series ratios are (1+1/k)k→e and (1+1/k)k−1→e, respectively. For every 0<r<e−1, all four series are therefore bounded in their tails on ∣z∣≤r by convergent geometric series. In particular, [F5] gives termwise differentiation for real arguments.

4.1step 1.1step 2.1step 3.1algebra

For either coefficient sequence (ck)=(ak) or (ak/k), fix complex z and real R with ∣z∣<R<e−1. For complex 0<∣h∣<R−∣z∣, the identity ((z+h)k−zk)/h=∑j=0k−1(z+h)k−1−jzj bounds the difference-quotient tail after degree m by ∑k>mk∣ck∣Rk−1, uniformly in h. 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 m→∞ proves complex termwise differentiation. Products may be regrouped absolutely, and the expansion of eT(z) is absolutely dominated by exp⁡(∑k≥1ak∣z∣k). Thus the formal identities in steps 1.1 and 2.1 give T=zeT, (1−T)zT′=T, and zU′=T for the sums. The middle identity rules out T(z)=1, and hence gives zT′=T/(1−T).

5.1step 3.1step 4.1algebra∎

For real 0≤z<e−1, the coefficients of T are nonnegative, so T(z)≥0. If T(z)≥1, continuity and T(0)=0 give z0≤z with T(z0)=1, but step 4.1 implies z0=T(z0)e−T(z0)=e−1, a contradiction. Thus T(z)<1. Since u↦ue−u is strictly increasing on [0,1), step 4.1 identifies T(z) with its unique inverse-branch value.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

The weighted total-variation measure space is complete

Statement

The normed vector space Mw(E) of Weighted total-variation space for population measures is complete.

Facts & Assumptions

Given: E=[a,∞), w(x)=1+x2, and Mw(E) with norm ∥σ∥w=∫w d∣σ∣.

[F1]

Weighted total-variation space for population measures: Mw(E) consists of finite signed Borel measures with ∫w d∣σ∣<∞, and ∥σ∥w=∫w d∣σ∣.

Proof

1.1givenF1algebra

The map J:σ↦wσ is linear. Multiplication by the positive function w gives ∣wσ∣=w∣σ∣, so [F1] yields ∥Jσ∥TV=∥σ∥w. It is onto because for any finite signed measure η, σ=w−1η satisfies Jσ=η and ∥σ∥w=∫w d∣w−1η∣=∥η∥TV.

1.2givenchoose

Let (ηn) be Cauchy in total variation. Choose increasing indices nj with ∥ηnj+1−ηnj∥TV≤2−j, taking the least qualifying index at each step. For each Borel set A, the series ηn1(A)+∑j≥1(ηnj+1−ηnj)(A) converges absolutely, uniformly in A, because each summand is bounded by its total-variation norm. Define η(A) by that sum. If (Ak) are disjoint, the double series of absolute values is bounded by ∥ηn1∥TV+∑j∥ηnj+1−ηnj∥TV, so the two countable sums may be interchanged; hence η is countably additive. The same tail bound gives ∥η−ηnj∥TV≤∑r≥j2−r→0. Given ε>0, choose j so this is below ε/2 and the Cauchy property gives ∥ηn−ηm∥TV<ε/2 for all n,m≥nj. For any n≥nj, choose nk≥nj and pass to the limit in ∥ηn−ηnk∥TV<ε/2; since ηnk→η, this gives ∥ηn−η∥TV≤ε/2<ε. Thus finite signed measures are complete in total variation.

2.1step 1.1step 1.2∎

Pulling the limit η back through the inverse isometry w−1 gives a limit in Mw(E) for every Cauchy sequence there.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Forward Euler for a finite sectional balance with a positivity CFL

Definition

Input a valid grid state (n,L) with ni≥0, a step h>0, and the finite sectional event rates of Finite sectional coagulation-fragmentation balance with reported overflow. The total per-particle loss rate is

Λi(n)=∑jKijnj+βi.

First validate the grid, state, rates, and daughter measures against the input conditions of Finite sectional coagulation-fragmentation balance with reported overflow, and require h>0; if any condition fails, return invalid-input without updating. For admissible inputs use exact arithmetic to evaluate the finite event sums defining F and Λi. If hΛi(n)>1 for any coordinate, return cfl-failure without updating. Otherwise return success together with (n+,L+)=(n,L)+hF(n,L). Exact-arithmetic positivity and conservation are stated separately in The sectional forward-Euler step is positive and conserves augmented mass ↗.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Unbounded-grid fixed-pivot coagulation-fragmentation dynamics

Definition

Adopt all kernel and daughter-measure hypotheses of Continuous-size coagulation-fragmentation weak model: in particular, K is symmetric, nonnegative, bounded and Lipschitz, β is nonnegative, bounded and Lipschitz, and Bx is a nonnegative Borel kernel with Bx(E)≤D, support in [a,x], ∫EzBx(dz)=x, and the stated bounded-Lipschitz dependence and convention below 2a. Let G={xi:i≥0} be a strictly increasing grid with x0=a, xi→∞, and xi+1−xi≤Δ≤1. Use the no-cutoff pivot rule PΔ from Conservative fixed-pivot redistribution on a finite positive grid on every cell of this semi-infinite grid. For every signed measure μ∈Mw(E), write PΔμ=∫PΔ(x) μ(dx) for the linear projection of a measure on E=[a,∞) onto G.

For a signed grid measure ν∈Mw(E), define FΔ(ν)=12∬K(x,y)(PΔ(x+y)−δx−δy) ν(dx)ν(dy)+∫β(x)(∫PΔ(z)Bx(dz)−δx)ν(dx). 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 Δ2/4 to the second moment of each projected size.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

Bounded coagulation is bilinear and bounded in weighted total variation

Statement

For the coagulation bilinear operator C of Continuous-size coagulation-fragmentation weak model, every μ,ν∈Mw(E) satisfies

∥C(μ,ν)∥w≤32K∗∥μ∥w∥ν∥w.

Facts & Assumptions

Given: The weight w(x)=1+x2, the bounded kernel 0≤K≤K∗, and the signed-measure operator.

[F1]

Continuous-size coagulation-fragmentation weak model: C(μ,ν)=12∬K(x,y)(δx+y−δx−δy) μ(dx)ν(dy).

[F2]

Weighted total-variation space for population measures: ∥σ∥w=∫w d∣σ∣.

Proof

1.1givenF2algebra

For x,y≥a, w(x+y)+w(x)+w(y)=3+2x2+2xy+2y2≤3(1+x2)(1+y2), since the difference is (x−y)2+3x2y2≥0.

2.1givenF1F2step 1.1algebra∎

Total variation of a signed integral is bounded by the integral against the variation measures. Applying this to [F1] and using K≤K∗ gives ∥C(μ,ν)∥w≤K∗2∬[w(x+y)+w(x)+w(y)] ∣μ∣(dx)∣ν∣(dy). Step 1.1 factors this bound as 32K∗(∫w d∣μ∣)(∫w d∣ν∣), which is the claimed estimate by [F2].

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

Mass-normalized fragmentation is bounded in weighted total variation

Statement

Assume the daughter-count bound Bx(E)≤D of Continuous-size coagulation-fragmentation weak model with D≥1. The fragmentation operator there satisfies

∥Fμ∥w≤β∗(D+1)∥μ∥w(μ∈Mw(E)).

Facts & Assumptions

Given: E=[a,∞), w(x)=1+x2, 0≤β≤β∗, daughter support in [a,x], daughter number at most D, and daughter first moment x.

[F1]

Continuous-size coagulation-fragmentation weak model: Fμ=∫β(x)(Bx−δx) μ(dx), Bx(E)≤D, and ∫z Bx(dz)=x.

[F2]

Weighted total-variation space for population measures: ∥σ∥w=∫(1+x2) d∣σ∣.

Proof

1.1givenF1algebra

Since 0≤z≤x on the support of Bx, z2≤xz and hence ∫z2Bx(dz)≤x2. Therefore ∫w(z)Bx(dz)≤D+x2.

2.1givenF1F2step 1.1algebra∎

The weighted variation of the signed measure Bx−δx is at most ∫w dBx+w(x)≤D+1+2x2≤(D+1)(1+x2) because D≥1. Integrating against β(x)∣μ∣(dx) and using [F2] gives the claim.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

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 F 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.

[F1]

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

1.1givenF1algebra

Define the extension F 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 ∥n∥∞,∥n~∥∞≤R, every quadratic monomial obeys ∣ninj−n~in~j∣≤R∣ni−n~i∣+R∣nj−n~j∣ by adding and subtracting nin~j. Linear monomials obey the same bound with coefficient 1.

2.1F1step 1.1algebra∎

Each coordinate of F(n,L)−F(n~,L~) is a finite weighted sum of these differences; the reservoir coordinate is independent of L. Summing the finitely many coefficient bounds gives a finite constant CR with ∥F(n,L)−F(n~,L~)∥2≤CR∥(n,L)−(n~,L~)∥2 on the ball.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

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 ni(0)≥0 and L(0)≥0 remains nonnegative for as long as it exists. The augmented mass

mtot(t)=∑i=0Mxini(t)+L(t)

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.

[F1]

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 L.

[F2]

Fixed-pivot weights are nonnegative and reproduce number and mass: every retained product or daughter is redistributed by nonnegative weights reproducing its mass.

Proof

1.1givenF1construct

At every nonnegative state with ni=0, no event consuming coordinate i has positive rate, because each such rate contains ni; all events producing i have nonnegative rates and yields. Thus Fi(n,L)≥0 on that face of the orthant.

2.1givenF1step 1.1algebra

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 C on a ball containing both the solution and its coordinatewise positive part. Set ni+=max⁡(ni,0) and u(t)=∑imax⁡(−ni(t),0). For each coordinate with ni<0, one has ni+=0, so step 1.1 and Lipschitz continuity give Fi(n,L)≥Fi(n+,L)−C∥n−n+∥2≥−Cu. The absolutely continuous negative-part chain rule gives (max⁡(−ni,0))′=−Fi when ni<0, zero when ni>0, and zero almost everywhere on the level set ni=0. Hence u′(t)≤(M+1)Cu(t) almost everywhere. Since u(0)=0 and u≥0, differentiating e−(M+1)Ctu(t) shows it is nonincreasing from zero, so u(t)=0. Once n≥0, the reservoir derivative is a sum of nonnegative overflow rates, hence L(t)≥0.

3.1F1F2algebra∎

For an in-range aggregation event with parent masses xi,xj, the pivot output has mass xi+xj by [F2]; subtracting the two parents gives zero augmented-mass change. For overflow, the retained parents remove mass xi+xj and the algorithm adds exactly this amount to L. For fragmentation of parent xi, the daughter measure has first moment xi 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 L˙ gives m˙tot=0; integrating yields mtot(t)=mtot(0).

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

The discrete product-kernel solution has finite-time second-moment blow-up

Statement

Define concentrations ck(t)≥0 by the discrete product-kernel equations c˙k=12∑i+j=kijcicj−kck∑j≥1jcj,k≥1, with monomer initial data c1(0)=1 and ck(0)=0 for k≥2. For r=1,2, define Mr(t)=∑k≥1krck(t). The pre-gelation solution is ck(t)=kk−2k!tk−1e−kt,0≤t<1, where the value at t=0 is understood by continuity. Its first and second moments satisfy M1(t)=1 and M2(t)=1/(1−t). Thus the second moment becomes unbounded at the finite time t=1 although the pre-gelation first moment is constant.

Facts & Assumptions

Given: The discrete product-kernel equations and the rooted-tree generating series.

[F1]

Rooted-tree series and the inverse of u exp(-u): T(z)=∑k≥1kk−1zk/k!, U(z)=∑k≥1kk−2zk/k!, T=zeT, zT′=T/(1−T), and zU′=T for ∣z∣<e−1.

[F2]

Rooted-tree series and the inverse of u exp(-u): for 0≤z<e−1, T(z) is the unique u∈[0,1) satisfying ue−u=z.

Proof

1.1F1F2algebra

Put q(t)=te−t and ak=kk−2/k!. For 0<t<1, define ck(t)=akq(t)k/t. Since q(t)<e−1, [F1] gives the convergent generating function C(z,t)=∑k≥1ck(t)zk=U(zq(t))/t. Its mass generating function is z∂zC=T(zq)/t. Because q=te−t and t∈[0,1), [F2] gives T(q)=t, so M1=z∂zC(1,t)=1.

2.1F1step 1.1algebra

For every fixed k and 0<t<1, differentiation of akqk/t gives c˙k=ck((k−1)/t−k). The gain coefficient in the kth product-kernel equation is 12∑i+j=kijcicj=qkt2[zk]T(z)22=k−1tck, because U=T−T2/2 implies [zk]T2/2=(k−1)ak. The loss is kckM1=kck by step 1.1. Their difference is exactly c˙k, verifying every coefficient equation for 0<t<1. At t=0, only c1 is nonzero: the right-hand side is −1 for k=1, 1/2 for k=2, and 0 for k≥3. The displayed formula has the same right derivatives, since a2=1/2 and tk−1 has zero derivative at 0 for k≥3. Thus the equations and initial data hold at the initial time as well.

3.1F1step 1.1algebra∎

Applying z∂z once more to C=U(zq)/t and using [F1] gives M2(t)=(z∂z)2C(1,t)=qT′(q)t=T(q)t(1−T(q))=11−t. Therefore M2(t)→∞ as t↑1, while step 1.1 gives M1(t)=1 throughout the pre-gelation interval.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

The bounded-kernel continuous coagulation-fragmentation field is locally Lipschitz

Statement

Let F(μ)=C(μ,μ)+Fμ be the vector field from Continuous-size coagulation-fragmentation weak model. On the ball ∥μ∥w,∥ν∥w≤R it satisfies

∥F(μ)−F(ν)∥w≤(3K∗R+β∗(D+1))∥μ−ν∥w.

Also, F(0)=0.

Facts & Assumptions

Given: The symmetric bilinear coagulation operator and linear fragmentation operator on Mw(E).

[F1]

Bounded coagulation is bilinear and bounded in weighted total variation: ∥C(α,γ)∥w≤32K∗∥α∥w∥γ∥w.

[F2]

Mass-normalized fragmentation is bounded in weighted total variation: ∥Fα∥w≤β∗(D+1)∥α∥w.

Proof

1.1givenF1algebra

Bilinearity and symmetry give C(μ,μ)−C(ν,ν)=C(μ−ν,μ)+C(ν,μ−ν). Applying [F1] to each term and the ball bounds yields at most 3K∗R∥μ−ν∥w.

2.1givenF2step 1.1algebra∎

Linearity and [F2] bound the fragmentation difference by β∗(D+1)∥μ−ν∥w. Adding the coagulation and fragmentation estimates proves the stated Lipschitz bound. Both operators vanish at the zero measure, so F(0)=0.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

The sectional forward-Euler step is positive and conserves augmented mass

Statement

For a nonnegative finite sectional state, if hΛi(n)≤1 for every bin, the successful step of Forward Euler for a finite sectional balance with a positivity CFL has ni+≥0, L+≥0, and

∑ixini++L+=∑ixini+L.

Facts & Assumptions

Given: A valid grid state ni,L≥0, a step h>0, and the CFL inequalities in the Statement.

[F1]

Forward Euler for a finite sectional balance with a positivity CFL: the update is (n+,L+)=(n,L)+hF(n,L) and Λi(n)=∑jKijnj+βi.

[F2]
[F3]

Finite sectional coagulation-fragmentation balance with reported overflow: each ordered pair has rate Kijninj/2 and removes both parents; fragmentation removes its parent at rate βini; retained gains are nonnegative, and overflow adds its consumed mass to L.

Proof

1.1givenF1F3algebra

For each bin, write Fi(n)=Gi(n)−niΛi(n), where Gi(n)≥0 is the total birth rate. This is the event decomposition of [F3]: the total aggregation loss of parent i is ni∑jKijnj under the ordered-pair convention, and its fragmentation loss is βini. Thus ni+=ni(1−hΛi(n))+hGi(n)≥0 by the CFL condition.

2.1givenF1F2F3algebra∎

By [F3], the reservoir update adds h times a nonnegative overflow-mass rate, so L+≥0. By [F2], the mass derivative at every nonnegative initial state is zero, so the vector-field increment has zero augmented mass; multiplying by h and adding the unchanged initial mass proves the displayed identity.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

Finite sectional dynamics have a unique global positive solution

Statement

For every nonnegative finite-grid initial state (n0,L0), with grid indices 0≤i≤J, mesh width Δ=max⁡i<J(xi+1−xi)≤1, maximum aggregation rate K∗:=max⁡i,jKij, fragmentation rate bound β∗:=max⁡iβi, and daughter count bound D:=max⁡iBxi(E), the ODE of Finite sectional coagulation-fragmentation balance with reported overflow has a unique solution for all t≥0, and the solution remains nonnegative. Here xi≥a>0 and each daughter measure has first moment xi. If its initial augmented mass is M=∑i=0Jxini0+L0, then

0≤ni(t)≤M/xi,0≤L(t)≤M,M2(t)≤M2,0+t[K∗M2+Δ2(K∗M28a2+β∗DM4a)],

where M2(t)=∑ixi2ni(t) and M2,0=M2(0).

Facts & Assumptions

Given: A finite-dimensional autonomous event ODE, a nonnegative initial state, and the mass and positivity conclusions of the cited items.

[F1]

The finite sectional reaction vector field is locally Lipschitz: the finite-dimensional right-hand side is locally Lipschitz.

[F2]

Finite sectional event dynamics preserve positivity and retained-plus-reservoir mass: solutions remain nonnegative and ∑ixini(t)+L(t)=M on their intervals of existence.

[F3]

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.

[F4]

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.

[F5]

Fixed-pivot weights are nonnegative and reproduce number and mass: redistributing a product or daughter of size z adds at most Δ2/4 to its second moment.

Proof

1.1givenF1F2F3

By [F1] and [F3], the event ODE has a unique maximal solution on an open time interval containing 0. While it exists, [F2] puts every coordinate in the closed set 0≤ni≤M/xi and 0≤L≤M, which is compact because the grid is finite and xi>0.

1.2givenF1F2F5algebra

Along each in-range coagulation event at parent masses xi,xj, the second-moment increment is at most 2xixj+Δ2/4 by [F5]; an overflow event only removes retained second moment. Summing the event rates Kijninj/2 bounds the coagulation contribution by K∗M12+K∗Δ2M02/8. For fragmentation, ∫z2Bxi(dz)≤xi2 because z≤xi and ∫zBxi=xi; pivot redistribution adds at most DΔ2/4 per parent event. Thus its second-moment contribution is at most β∗DΔ2M0/4.

2.1step 1.1step 1.2algebra

Since xi≥a, the mass bound in step 1.1 gives M0≤M/a and M1≤M. Integrating the derivative bound in step 1.2 yields the displayed M2 estimate.

3.1step 1.1F3F4algebra∎

If the maximal right endpoint T∗ were finite, step 1.1 puts the solution in a compact set. Continuity of F there gives a bound B on ∥F∥2, so ∥y(t)−y(s)∥2≤B∣t−s∣ and y(t) has a limit in that set as t↑T∗. By [F4], restarting at the limit gives a local solution; uniqueness in [F3] glues it to the existing solution and extends past T∗, a contradiction. The same argument applies at every finite endpoint.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

Unbounded-grid fixed-pivot dynamics are globally well posed and stable

Statement

Under the hypotheses of Unbounded-grid fixed-pivot coagulation-fragmentation dynamics, FΔ is a well-defined locally Lipschitz vector field on the weighted measure space supported on G, and every positive initial grid measure ν0∈Mw(E) has a unique global positive solution to ν˙=FΔ(ν). On every finite interval it satisfies M1(νt)=M1(ν0),M0(νt)≤M0(ν0)eβ∗Dt, M2(νt)≤M2(ν0)+K∗M1(ν0)2t+K∗Δ28∫0tM0(νs)2 ds+β∗DΔ24∫0tM0(νs) ds. If ν,η are two such solutions and sup⁡s≤T(M0(νs)+M0(ηs))≤NT, then dBL(νt,ηt)≤eCTtdBL(ν0,η0),0≤t≤T, where CT depends only on NT,K∗,LK,β∗,Lβ,D,LB. The proof also gives the vector-field estimate ∥FΔ(ν)−FΔ(η)∥BL≤CTdBL(ν,η) for positive grid measures with the same number bound; here ∥σ∥BL=dBL(σ,0).

Facts & Assumptions

Given: A semi-infinite positive pivot grid, bounded Lipschitz kernels, and the weighted measure space.

[F1]

Unbounded-grid fixed-pivot coagulation-fragmentation dynamics: FΔ has nonnegative gains for positive states, per-parent coagulation loss rate ∫K(x,y)ν(dy), and fragmentation loss rate β(x). Its adopted daughter hypotheses include support in [a,x], Bx(E)≤D, ∫zBx(dz)=x, and dBL(Bx,By)≤LB∣x−y∣.

[F2]

Weighted total-variation space for population measures: ∥σ∥w=∫(1+x2) d∣σ∣.

[F3]

Bounded-Lipschitz discrepancy for finite measures: dBL tests functions with supremum norm and Lipschitz constant at most 1.

[F4]

Fixed-pivot weights are nonnegative and reproduce number and mass: PΔ(z) is positive, has mass z, expected displacement at most Δ/2, and second-moment excess at most Δ2/4.

[F5]

The weighted total-variation measure space is complete: Mw(E) is complete in weighted total variation.

Proof

1.1givenF2F4F5algebra

The grid G has no finite accumulation point, so it is closed in E. A weighted-total-variation limit of measures supported on G assigns zero variation to E∖G, hence the grid-supported subspace is closed and complete by [F5]. For z≥a, [F4] gives ∫w(u)PΔ(z)(du)≤w(z)+Δ2/4≤(5/4)w(z). Thus projection maps weighted measures boundedly into this subspace. The positive cone is closed: if νn≥0 and νn→ν in weighted total variation, then ν−(E)≤∥ν−νn∥TV→0.

1.2givenF1F4algebra

Testing the equation with 1 gives M0′≤β∗DM0, since each aggregation event changes number by −1 and each fragmentation increment is at most D. Testing with x gives zero coagulation increment by [F4], and zero fragmentation increment because ∫zBx(dz)=x by [F1] and projection preserves each daughter's mass by [F4]. Thus M1′=0. Testing with x2, each coagulation event contributes at most 2xy+Δ2/4, and each fragmentation event contributes at most DΔ2/4 because daughter second moment before projection is at most x2. Integrating the resulting inequalities proves all three displayed moment bounds.

1.3givenF1F3

For an admissible test φ in [F3], let φˉ(z)=∫φ(u)PΔ(z)(du). On each cell this is the linear interpolant of the endpoint values; its slope has absolute value at most 1. Continuity at the pivots gives ∥φˉ∥∞≤1 and Lip⁡(φˉ)≤1 on all of E. The coagulation test integrand 12K(x,y)[φˉ(x+y)−φ(x)−φ(y)] is bounded and Lipschitz in each variable with constants depending only on K∗,LK.

2.1givenF1F2step 1.1algebra

Write FΔ(ν)=GΔ(ν)−qνν, where qν(x)=∫K(x,y)ν(dy)+β(x) and GΔ is the sum of the positive aggregation and fragmentation gains in [F1]. On a signed-measure ball ∥ν∥w≤R, ∥qν∥∞≤K∗R+β∗, and qν≥0 when ν≥0. The bound in step 1.1 and w(x+y)+w(x)+w(y)≤3w(x)w(y) bound the aggregation gain by a constant times K∗R2; for fragmentation, ∫z2Bx(dz)≤x2 and Bx(E)≤D bound the gain by a constant times β∗(D+1)R. Bilinearity makes the aggregation gain locally Lipschitz, and the fragmentation gain is bounded linear.

2.2F1F3step 1.3algebra

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 CK(M0(ν)+M0(η))dBL(ν,η). For fragmentation the integrand β(x)[∫φˉ dBx−φ(x)] has supremum at most β∗(D+1) and Lipschitz constant at most Lβ(D+1)+β∗(LB+1), so its difference is bounded by a constant times dBL(ν,η).

3.1givenF1F5step 1.1step 2.1choose

On the closed positive path ball of radius R>2∥ν0∥w, let CR bound ∥GΔ(ξ)∥w and LR be its Lipschitz constant, as obtained in step 2.1. For positive paths in that ball, set Φ(ξ)t=e−∫0tqξs(⋅)dsν0+∫0te−∫stqξr(⋅)drGΔ(ξs) ds. Since ∥qξt−qξs∥∞≤K∗∥ξt−ξs∥w, qξ is continuous in time in L∞(E); the gain path is continuous in Mw(E) by step 2.1. For bounded b, multiplication Mbσ=bσ has ∥Mb∥≤∥b∥∞, so the survival multipliers are continuous in operator norm and the formula defines a continuous path. They lie in [0,1], so Φ preserves positivity. Its norm is at most ∥ν0∥w+TCR, hence it maps the ball into itself when TCR≤R−∥ν0∥w. Since ∣qξ−qζ∣∞≤K∗∥ξ−ζ∥w, the inequalities ∣e−u−e−v∣≤∣u−v∣ for u,v≥0 and the triangle inequality give ∥Φ(ξ)−Φ(ζ)∥CMw≤(TLR+TK∗∥ν0∥w+12T2K∗CR)∥ξ−ζ∥CMw. Choose T so this coefficient is q<1. The positive path ball is nonempty because it contains ξt0=ν0. Iteration ξj+1=Φ(ξj) from ξ0 satisfies ∥ξj+1−ξj∥≤qj∥ξ1−ξ0∥; for m>n, ∥ξm−ξn∥≤qn∥ξ1−ξ0∥/(1−q)→0. 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 q times itself, so they coincide. For a fixed point, Sξ(t,s):=Me−∫stqξr(⋅)dr has operator-norm derivative ∂tSξ(t,s)=−MqξtSξ(t,s), since the scalar exponential difference quotients converge uniformly in size. Splitting the difference quotient of the source integral at s=t gives endpoint term GΔ(ξt) and integral term −Mqξt∫0tSξ(t,s)GΔ(ξs)ds; hence the fixed point solves the equation in [F1]. Conversely, for any positive solution ζ, the inverse multiplier Aζ(t):=Me∫0tqζs(⋅)ds is operator-norm differentiable with Aζ′=MqζtAζ. The product difference quotient gives (Aζζ)′=AζGΔ(ζ); integrating this continuous derivative by telescoping partitions and multiplying by Aζ(t)−1 recovers the same mild formula. Continuity at 0 puts any competing solution in this ball on a sufficiently short interval, where the fixed-point uniqueness just proved applies.

3.2F2F5step 2.1step 1.2algebra

On [0,T] the number and second-moment estimates bound ∥νt∥w=M0(νt)+M2(νt). The local Lipschitz estimates in step 2.1 bound ∥FΔ(νt)∥w there, so νt 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.

4.1F1F3step 1.2step 2.2algebra∎

Integrating the two weak equations and using the number bound in the Statement gives d(t)≤d(0)+CT∫0td(s)ds, where d(t)=dBL(νt,ηt). With g(t)=d(0)+CT∫0td(s)ds, one has d≤g and g′≤CTg almost everywhere. Thus (e−CTtg(t))′≤0 and d(t)≤eCTtd(0).

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

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 μ0∈Mw(E) has a unique positive solution μ∈C([0,T0];Mw(E)) to the weak model for some T0>0.

Facts & Assumptions

Given: The bounded-kernel weak equation, a positive initial measure, and the weighted total-variation space.

[F1]

Continuous-size coagulation-fragmentation weak model: K,β,Bx define the weak vector field C(μ,μ)+Fμ and preserve positivity of the gain measures.

[F2]

The bounded-kernel continuous coagulation-fragmentation field is locally Lipschitz: that vector field is Lipschitz on every bounded ball of Mw(E).

[F3]

The weighted total-variation measure space is complete: Mw(E) is complete in ∥⋅∥w.

[F4]

Bounded coagulation is bilinear and bounded in weighted total variation: the coagulation bilinear operator is bounded on weighted total variation.

[F5]

Mass-normalized fragmentation is bounded in weighted total variation: the fragmentation operator is bounded on weighted total variation.

Proof

1.1givenF1F2F4F5algebra

For a positive path ν in a ball of radius R, define aν(t,x)=∫EK(x,y)νt(dy)+β(x) and the positive gain GC(νt)=12∬K(x,y)δx+yνt(dx)νt(dy), GF(νt)=∫Eβ(x)Bx νt(dx), and G=GC+GF. Then 0≤aν≤K∗R+β∗. Since w(x+y)≤2w(x)w(y), ∥GC(μ)∥w≤K∗∥μ∥w2; bilinearity gives its local Lipschitz bound. Also ∥GF(μ)∥w≤β∗(D+1)∥μ∥w by the daughter estimate in [F5]. Thus G is bounded and Lipschitz on the ball, and aν−aη is bounded by K∗∥ν−η∥w.

2.1F2F3F4F5step 1.1choose

On C([0,T];Mw(E)) define Φ(ν)t=e−∫0taν(s,⋅) dsμ0+∫0te−∫staν(r,⋅) drG(νs) ds. The loss rate is continuous in time in L∞(E), since ∥aν(t,⋅)−aν(s,⋅)∥∞≤K∗∥νt−νs∥w; the gain path is continuous in Mw(E) by the bounded-operator estimates in [F4]–[F5]. For bounded b, multiplication Mbσ=bσ satisfies ∥Mb∥≤∥b∥∞, 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 R>2∥μ0∥w, the gain bound gives ∥Φν∥CMw≤∥μ0∥w+TCR≤R for sufficiently small T. The bounds ∣aν−aη∣≤K∗∥ν−η∥w and ∣e−u−e−v∣≤∣u−v∣ give ∥Φν−Φη∥CMw≤(TLR+TK∗∥μ0∥w+T2K∗CR)∥ν−η∥CMw. Choose T so this coefficient is below 1.

3.1F3step 2.1algebra

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 ν−(E)≤∥ν−νj∥TV when νj≥0. It is nonempty because it contains the constant path νt0=μ0. If q<1 is the contraction coefficient in step 2.1, iteration νj+1=Φ(νj) from ν0 satisfies ∥νj+1−νj∥≤qj∥ν1−ν0∥. For m>n, ∥νm−νn∥≤∥ν1−ν0∥∑j=nm−1qj≤qn∥ν1−ν0∥/(1−q)→0, 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 q times itself, hence zero. For a fixed point, S(t,s):=Me−∫staν(r,⋅)dr has operator-norm derivative ∂tS(t,s)=−Maν(t,⋅)S(t,s), since the scalar exponential difference quotients converge uniformly in x. Splitting the difference quotient of the source integral at s=t gives its endpoint term G(νt) and its integral term −Maν(t,⋅)∫0tS(t,s)G(νs)ds; thus the fixed point solves ν˙=G(ν)−aνν. Conversely, for any positive solution ζ, the inverse multiplier A(t)=Me∫0taζ(s,⋅)ds is operator-norm differentiable with A′=MaζA. The product difference quotient gives (Aζ)′=AG(ζ); integrating this continuous derivative by telescoping partitions and multiplying by A(t)−1 recovers the same mild formula. Continuity at 0 puts any competing solution in this ball on a sufficiently short interval, where fixed-point uniqueness makes it equal to the constructed solution.

4.1givenF1step 3.1algebra∎

The derivative established in step 3.1 is μ˙t=G(μt)−aμ(t,⋅)μt. Symmetry of K combines the two coagulation loss marginals into −∫K(x,y)δx μt(dx)μt(dy); the fragmentation loss is −∫β(x)δx μt(dx). Hence this is precisely the weak equation in [F1], proving the claim.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error

Statement

Let μ∈Mw(E) be positive and put m=M0(μ). With F the continuous vector field and FΔ the no-cutoff grid field, for PΔμ=∫PΔ(x)μ(dx) one has ∥FΔ(PΔμ)−PΔF(μ)∥BL≤Δ[3LK+K∗2m2+(Lβ(D+1)+β∗LB)m].

Facts & Assumptions

Given: A mesh with maximum cell width Δ≤1, bounded Lipschitz kernels, and a positive finite-number measure.

[F1]

Unbounded-grid fixed-pivot coagulation-fragmentation dynamics: FΔ projects every product and daughter to the grid by PΔ and preserves each event's first moment.

[F2]

Continuous-size coagulation-fragmentation weak model: F has the stated coagulation and fragmentation weak forms, with K Lipschitz and dBL(Bx,By)≤LB∣x−y∣.

[F3]

Bounded-Lipschitz discrepancy for finite measures: ∥σ∥BL is the supremum over tests of supremum norm and Lipschitz constant at most 1.

[F4]

Fixed-pivot weights are nonnegative and reproduce number and mass: PΔ(z) has total mass 1, expected displacement at most Δ/2, expected mass exactly z, and second-moment excess at most Δ2/4.

[F5]

Bounded coagulation is bilinear and bounded in weighted total variation: the continuous coagulation term maps Mw(E)2 to Mw(E).

[F6]

Mass-normalized fragmentation is bounded in weighted total variation: the continuous fragmentation term maps Mw(E) to Mw(E).

[F7]

Unbounded-grid fixed-pivot dynamics are globally well posed and stable: FΔ is well-defined on weighted grid measures.

Proof

1.1givenF3F4F5F6F7algebra

By [F5] and [F6], F(μ)∈Mw(E), and [F4] makes PΔF(μ) well-defined; [F7] gives FΔ(PΔμ)∈Mw(E). Fix a test φ admissible in [F3] and set φˉ(z)=∫φ(u)PΔ(z)(du). On each cell this is the linear interpolation of endpoint values; its slope has absolute value at most 1, so φˉ is also admissible. The displacement estimate [F4] gives ∫∣u−z∣PΔ(z)(du)≤Δ/2.

2.1F1F2step 1.1algebra

For the coagulation term, sample X∼PΔ(x) and Y∼PΔ(y) independently. The grid-field test integrand averaged over X,Y has gain Eφˉ(X+Y) and losses φˉ(x)+φˉ(y); the projected continuous-field integrand has gain φˉ(x+y) and the same losses. The gain difference is at most E(∣X−x∣+∣Y−y∣)≤Δ. Also E∣K(X,Y)−K(x,y)∣≤LKΔ, and the event bracket has absolute value at most 3. Thus the absolute difference of the two coagulation integrals is at most 12(3LK+K∗)Δm2.

2.2F2F3step 1.1algebra

For fragmentation, write G(x)=∫φˉ(z)Bx(dz). Then ∣G(x)∣≤D, ∣G(x)−φ(x)∣≤D+1, and ∣G(X)−G(x)∣≤LB∣X−x∣ by [F2] and [F3]. Since Eφ(X)=φˉ(x), the integrand difference equals E{β(X)[G(X)−φ(X)]}−β(x)[G(x)−φˉ(x)]=E[β(X)(G(X)−G(x))]+E[(β(X)−β(x))G(x)]+E[(β(x)−β(X))φ(X)]. The three terms are bounded by β∗LBE∣X−x∣, LβDE∣X−x∣, and LβE∣X−x∣, respectively. Using E∣X−x∣≤Δ proves the displayed bound after integrating over μ.

3.1F3step 2.1step 2.2∎

Adding the coagulation and fragmentation bounds holds for every admissible test in [F3]. Taking their supremum gives the asserted bounded-Lipschitz norm inequality.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

Sectional forward Euler converges globally with first-order error

Statement

Fix a finite grid and a final time T>0. Let y(t)=(n(t),L(t)) be the exact finite sectional solution from Finite sectional dynamics have a unique global positive solution, with nonnegative initial data and augmented mass M. Let N≥1 be an integer, set h=T/N, initialize y0=y(0), and apply Forward Euler for a finite sectional balance with a positivity CFL for N steps, with a uniform CFL bound hΛi(nk)≤1. Then there is a constant CT, independent of N, such that

max⁡0≤k≤N∥yk−y(tk)∥2≤CTh,tk=kh.

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 y0=y(0), the fixed-time mesh h=T/N, and the uniform positivity CFL.

[F1]

Finite sectional dynamics have a unique global positive solution: the unique global nonnegative exact solution obeys 0≤ni(t)≤M/xi and 0≤L(t)≤M for initial augmented mass M.

[F2]

Forward Euler for a finite sectional balance with a positivity CFL: each successful update is forward Euler yk+1=yk+hF(yk).

[F3]

The sectional forward-Euler step is positive and conserves augmented mass: each accepted step stays in the same compact nonnegative mass simplex.

[F4]

Forward Euler has uniform local order one and a one-step Lipschitz bound: for a C1 field with the field and its first derivatives bounded on an open cylinder with convex state fibers, forward Euler has local defect O(h2) 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 1+Lh for inputs in a common state fiber.

[F5]

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 Ch2 and one-step factor 1+Lh imply a fixed-time global error bound CTh.

Proof

1.1givenF1F3F4algebra

Use the finite event polynomials to extend F to all real augmented states, and use the Euler map Ψh(v)=v+hF(v) 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 BM={(n,L):0≤ni≤M/xi, 0≤L≤M}, a compact box since the grid is finite and each xi>0. The exact path lies in BM by [F1]; starting from y0=y(0), repeated application of [F3] puts every numerical state in the nonnegative augmented-mass simplex of mass M, which is contained in BM. Set RB=max⁡z∈BM∥z∥2 and BF=max⁡z∈BM∥F(z)∥2; these are finite because F is polynomial. Since h=T/N≤T, every exact-start Euler output obeys ∥y(tk)+hF(y(tk))∥2≤RB+TBF. 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 K=[0,T]×B‾(0,RB+TBF+1). This tube lies with positive margin in the bounded open cylinder V=(−1,T+1)×B(0,RB+TBF+2), whose state fibers are convex. The time-independent finite polynomial field f(t,z)=F(z) and its first derivatives are bounded on V. Hence [F4] applies uniformly to every local defect, including the exact-start Euler output, and gives defect Ch2; its derivative bound also gives the one-step factor 1+Lh for inputs in K.

2.1givenF2F4F5step 1.1∎

Apply [F5] with initial error zero, the fixed mesh h=T/N, and the common compact tube from step 1.1. It gives max⁡k≤N∥yk−y(tk)∥2≤CTh, as claimed.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

Bounded-kernel measure solutions conserve mass and control number and second moments

Statement

Let μt be a positive local solution of Continuous-size coagulation-fragmentation weak model with initial number N0, mass M1, and second moment M2,0<∞. Then for every time in its interval of existence,

M1(μt)=M1,M0(μt)≤N0eβ∗Dt,M2(μt)≤M2,0+K∗M12t.

Facts & Assumptions

Given: The weak equation with symmetric bounded K, daughter mass normalization, and a positive local solution in Mw(E).

[F1]

Continuous-size coagulation-fragmentation weak model: the coagulation increment for a test φ is φ(x+y)−φ(x)−φ(y); fragmentation increment is ∫φ(z)Bx(dz)−φ(x), with ∫zBx(dz)=x and z≤x on its support.

[F2]

Bounded kernels give a local positive measure-valued solution: a positive local solution exists in Mw(E), so the tests 1,x,x2 are integrable.

Proof

1.1givenF1F2algebra

Take φ(x)=x in [F1]. The coagulation increment is (x+y)−x−y=0, and the fragmentation increment is ∫zBx(dz)−x=0. Thus M1′(μt)=0, and integration gives M1(μt)=M1.

1.2F1F2algebra

With φ=1, each coagulation event changes number by −1, while fragmentation changes it by Bx(E)−1≤D. Hence M0′(μt)≤β∗DM0(μt). The derivative of e−β∗DtM0(μt) is nonpositive, giving M0(μt)≤N0eβ∗Dt.

2.1F1F2step 1.1algebra∎

With φ=x2, coagulation contributes 12∬K(x,y)[(x+y)2−x2−y2] dμtdμt=∬K(x,y)xy dμtdμt≤K∗M12. Fragmentation contributes ∫β(x)[∫z2Bx(dz)−x2] dμt≤0, since z2≤xz and ∫zBx=x. Therefore M2′(μt)≤K∗M12, and integration proves the last bound.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

A second moment controls the discarded mass and number tails

Statement

For a positive measure μ with finite second moment and every R>0, ∫(R,∞)x μ(dx)≤M2(μ)R,μ((R,∞))≤M1(μ)R. 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 E=[a,∞).

[F1]
[F2]

Bounded-kernel measure solutions conserve mass and control number and second moments: on each finite interval, M1 is constant and M2(t)≤M2,0+K∗M12t.

Proof

1.1givenF1

On (R,∞), x≤x2/R. Integrating this pointwise inequality against the positive measure gives ∫(R,∞)x dμ≤M2(μ)/R.

2.1givenF1F2algebra∎

On the same set, 1≤x/R. Integration gives μ((R,∞))≤M1(μ)/R. Applying [F2] makes both right-hand sides uniform for t in a fixed finite interval.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

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 μ0∈Mw(E) has a unique positive weak solution on every finite time interval. For T<∞ its norm is bounded by

sup⁡0≤t≤T∥μt∥w≤M0(μ0)eβ∗DT+M2(μ0)+K∗M1(μ0)2T.

Facts & Assumptions

Given: The weighted measure space, local positive solution construction, and number, mass, and second-moment estimates.

[F1]

Continuous-size coagulation-fragmentation weak model: the bounded kernels and daughter measures specify the weak equation and its vector field F(μ)=C(μ,μ)+Fμ on Mw(E).

[F2]

Bounded kernels give a local positive measure-valued solution: every positive initial measure admits a unique local positive solution.

[F3]

Bounded-kernel measure solutions conserve mass and control number and second moments: M0(t)≤M0(0)eβ∗Dt, M1(t)=M1(0), and M2(t)≤M2(0)+K∗M1(0)2t.

[F4]

The weighted total-variation measure space is complete: Mw(E) is complete in its weighted norm.

[F5]

The bounded-kernel continuous coagulation-fragmentation field is locally Lipschitz: F is Lipschitz on every bounded ball and F(0)=0.

Proof

1.1givenF3algebra

Since μt is positive, ∥μt∥w=M0(μt)+M2(μt). Applying [F3] for 0≤t≤T gives the displayed finite bound.

2.1step 1.1F1F4F5algebra

Suppose a maximal solution had a finite endpoint T∗. 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], ∥F(μt)∥w≤C there, so ∥μt−μs∥w≤C∣t−s∣; hence μt is Cauchy as t↑T∗. Completeness [F4] gives a limit μ∗. Positivity is closed: if μn≥0 and μn→μ∗ in weighted total variation, then μ∗−(E)≤∥μ∗−μn∥TV→0.

3.1step 2.1F2algebra∎

Restart the local construction [F2] at μ∗. Its solution agrees on the overlap by local uniqueness and extends the original solution beyond T∗, 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.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

Bounded-kernel measure solutions are stable in bounded-Lipschitz discrepancy

Statement

Let μt,νt be positive weak solutions of Continuous-size coagulation-fragmentation weak model on [0,T], with sup⁡t≤T(M0(μt)+M0(νt))≤NT. Then for a constant CT depending only on NT,K∗,LK,β∗,Lβ,D,LB,

dBL(μt,νt)≤eCTtdBL(μ0,ν0)(0≤t≤T).

Facts & Assumptions

Given: Two positive weak solutions, the bounded-Lipschitz test class, symmetric bounded Lipschitz K, and bounded Lipschitz fragmentation data.

[F1]

Continuous-size coagulation-fragmentation weak model: the coagulation test increment is φ(x+y)−φ(x)−φ(y), and the fragmentation increment is ∫φ dBx−φ(x).

[F2]

Bounded-Lipschitz discrepancy for finite measures: dBL is the supremum over tests with ∥φ∥∞≤1 and Lip⁡(φ)≤1.

[F3]

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 eβ∗Dt.

Proof

1.1givenF1F2algebra

Fix an admissible test φ in [F2]. The coagulation integrand Hφ(x,y)=12K(x,y)[φ(x+y)−φ(x)−φ(y)] has a uniform supremum bound and uniform Lipschitz bounds in each variable: the bracket is bounded by 3 and changes by at most 2∣x−x′∣ when only x changes, so the product rule for differences gives a bound depending only on K∗,LK.

1.2givenF1F2algebra

The function Jφ(x)=β(x)[∫φ dBx−φ(x)] is bounded by β∗(D+1) and Lipschitz with constant at most Lβ(D+1)+β∗(LB+1), by the assumed boundedness and dBL(Bx,By)≤LB∣x−y∣. Thus its fragmentation derivative difference is bounded by a constant times dBL(μt,νt).

2.1step 1.1F2algebra

Write μ⊗μ−ν⊗ν=(μ−ν)⊗μ+ν⊗(μ−ν). For each fixed value of the other variable, the section of Hφ 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 CK(M0(μt)+M0(νt))dBL(μt,νt).

3.1F1F2F3step 2.1step 1.2algebra∎

Integrating the weak equations, steps 2.1 and 1.2 give for every admissible φ the bound ∣⟨φ,μt−νt⟩∣≤dBL(μ0,ν0)+CT∫0tdBL(μs,νs) ds, where [F3] makes CT uniform on [0,T]. Taking the supremum gives d(t)≤d(0)+CT∫0td(s) ds. Put g(t)=d(0)+CT∫0td(s) ds; then d≤g and g′≤CTg almost everywhere, so (e−CTtg(t))′≤0 and d(t)≤g(t)≤eCTtd(0).

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

The unbounded fixed-pivot flow has first-order grid error

Statement

Let μt be the continuous solution of Continuous-size coagulation-fragmentation weak model on [0,T], and let ηt be the no-cutoff pivot solution of Unbounded-grid fixed-pivot coagulation-fragmentation dynamics on a grid of maximum spacing Δ≤1, initialized by η0=PΔμ0. Then for 0≤t≤T, dBL(ηt,μt)≤eCTt CQTΔ+Δ2M0(μt), where CQ is the quadrature constant in Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error evaluated at the uniform number bound for μt, and CT 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.

[F1]

Continuous-size coagulation-fragmentation weak model: the continuous path satisfies μ˙=F(μ) in integral form.

[F2]

Unbounded-grid fixed-pivot coagulation-fragmentation dynamics: PΔ is a linear map from continuous measures to grid measures and η˙=FΔ(η).

[F3]

Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error: ∥FΔ(PΔμ)−PΔF(μ)∥BL≤CQΔ on the bounded-number set.

[F4]

Bounded-kernel measure solutions conserve mass and control number and second moments: M1(μt) is constant and M0(μt) is bounded on [0,T].

[F5]

Unbounded-grid fixed-pivot dynamics are globally well posed and stable: the pivot vector field is bounded-Lipschitz in dBL on positive paths with bounded number, and PΔ preserves M0 and M1.

[F6]

Fixed-pivot weights are nonnegative and reproduce number and mass: each pivot projection has expected displacement at most Δ/2.

Proof

1.1F1F2F4F5F6

For every z≥a, [F6] gives ∫w(u)PΔ(z)(du)≤w(z)+Δ2/4≤(5/4)w(z), so the linear projection PΔ is bounded on Mw(E). Set qt=PΔμt; applying this bounded linear map to the integral equation [F1] gives q˙t=PΔF(μt). The total-number-one and first-moment identities in [F2] and [F6] give M0(qt)=M0(μt) and M1(qt)=M1(μt), so [F5] supplies a Δ-independent number bound for both qt and ηt.

2.1F2F3F5step 1.1algebra

Subtract the equations for ηt and qt and add and subtract FΔ(qt). The vector-field term is bounded by CTdBL(ηt,qt) using [F5]; the residual is at most r:=CQΔ by [F3]. Therefore d(t)≤CT∫0td(s)ds+rt, with d(0)=0. Set g(t)=rt+CT∫0td(s)ds. Then d≤g and g′≤r+CTg. If CT>0, integrating (e−CTtg(t))′≤re−CTt gives g(t)≤r(eCTt−1)/CT≤rteCTt; if CT=0, g(t)=rt. Since t≤T, this is at most eCTtCQTΔ.

3.1F3F4F6step 2.1algebra∎

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 dBL(qt,μt)≤(Δ/2)M0(μt). The triangle inequality with step 2.1 proves the Statement.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

Finite cutoff differs from the unbounded pivot model by a controlled return error

Statement

Let G be a semi-infinite pivot grid and R∈G. Let η0 be a positive grid measure in Mw(E) and let ηt solve the no-cutoff dynamics of Unbounded-grid fixed-pivot coagulation-fragmentation dynamics. Let νt be the finite sectional solution on the initial grid segment G∩[a,R] from ν0=η0∣[a,R], extended by zero to G. Initialize the finite model's reported reservoir with L0=∫(R,∞)x η0(dx). If M1=M1(η0), then for 0≤t≤T, dBL(νt,ηt)≤eCTt[M1R+2K∗M12taR], where CT 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 R.

[F1]

Finite sectional coagulation-fragmentation balance with reported overflow: a product above R is omitted from retained bins and its mass is added to the reservoir; parents are still removed.

[F2]

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 M1.

[F3]

Unbounded-grid fixed-pivot dynamics are globally well posed and stable: unbounded-grid solutions conserve first moment, have number at most M1/a, and their vector field is bounded-Lipschitz on number-bounded sets with constant CT.

[F4]

A second moment controls the discarded mass and number tails: the number in a tail above r is at most its first moment divided by r.

Proof

1.1givenF3F4

At time zero, η0−ν0 is the restriction of η0 to (R,∞). Since every admissible bounded-Lipschitz test has supremum norm at most 1, dBL(η0,ν0)≤η0((R,∞))≤M1/R by [F4].

1.2F1F2F4algebra

At any finite-cutoff state, the fragmentation gains and all parent-loss terms in FΔ agree with those of the no-cutoff field. The only omitted retained-measure gain is PΔ(x+y) for parent pairs with x+y>R. Their ordered event rate is at most K∗2∬x+y>Rνt(dx)νt(dy)≤K∗M0(νt)νt((R/2,∞)). The finite mass bound gives M0(νt)≤M1/a, while [F4] gives νt((R/2,∞))≤2M1/R. Each omitted gain pairs with a bounded test by at most its event rate, so ∥FR(νt)−FΔ(νt)∥BL≤2K∗M12/(aR).

2.1F1F2F3step 1.1step 1.2algebra∎

Write FR for the retained-measure field of the finite algorithm [F1], and FΔ for the no-cutoff field. Subtract the equations for νt and ηt, add and subtract FΔ(νt), and test against any admissible bounded-Lipschitz function. By [F3] the vector-field difference contributes at most CTdBL(νt,ηt); step 1.2 contributes at most r:=2K∗M12/(aR). Taking the supremum and integrating yields d(t)≤d(0)+CT∫0td(s)ds+2K∗M12taR. Let g(t)=d(0)+rt+CT∫0td(s)ds. Then d≤g and g′≤r+CTg almost everywhere. If CT>0, multiplying by e−CTt and integrating gives g(t)≤d(0)eCTt+r(eCTt−1)/CT≤eCTt(d(0)+rt); if CT=0, g(t)=d(0)+rt. Substituting d(0)≤M1/R from step 1.1 proves the bound.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

Sectional size discretization separates grid and cutoff errors

Statement

Let μt be a continuous solution on [0,T] with initial mass M1, and let νtR be the retained measure of the finite sectional system initialized by retaining the projection PΔμ0 on pivots at most R and placing the projected tail mass ∫(R,∞)x PΔμ0(dx) in its reported reservoir. Assume R is a pivot endpoint and Δ≤1. Then dBL(νtR,μt)≤eCTt[CQTΔ+Δ2M0(μt)+M1R+2K∗M12taR],0≤t≤T, where CQ is from Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error, CT is a finite bounded-number stability constant, and the terms proportional to Δ, R−1 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.

[F1]

Continuous-size coagulation-fragmentation weak model: the continuous population satisfies the weak coagulation-fragmentation equation.

[F2]

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.

[F3]

Finite sectional coagulation-fragmentation balance with reported overflow: the finite algorithm applies the in-range pivot rule and omits retained particles for products above R.

[F4]

Bounded-kernel measure solutions conserve mass and control number and second moments: M1 is constant and M0 is bounded on [0,T].

[F5]

The unbounded fixed-pivot flow has first-order grid error: the unbounded-pivot flow differs from μt by at most eCTtCQTΔ+(Δ/2)M0(μt).

[F6]

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 eCTt[M1/R+2K∗M12t/(aR)].

Proof

1.1givenF1F2F3

By [F1] the target is a continuous-model solution; [F2]–[F3] specify that finite products above R leave the retained measure and enter only the diagnostic reservoir. Form the unbounded-pivot solution ηt from the initial projection PΔμ0. Split the difference as dBL(νtR,μt)≤dBL(νtR,ηt)+dBL(ηt,μt). This is the triangle inequality for the discrepancy in [F1].

2.1givenF4F5F6step 1.1algebra∎

Apply [F5] to the second term and [F6] to the first term. Their stated bounds use the same conserved initial mass M1 and finite-horizon number bound, so taking a common stability constant CT and adding gives exactly the displayed estimate. The first two contributions vanish with grid spacing, and the last two with cutoff growth.

TheoremStatement: AI-adaptedProof: AI-generatedOpen item page →

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 μt on [0,T], initial mass M1, grid spacing Δ≤1, and pivot endpoint R. Let the finite grid have m retained bins, take T>0, an integer N≥1, and h=T/N. Initialize both the exact finite sectional system and forward Euler by that theorem's same retained projection and tail-mass reservoir. Let yk be the successful forward-Euler states under the uniform positivity CFL, and let νtR be the exact finite-sectional retained measure. There are constants CE,T,R,Δ and CT independent of N such that dBL(∑iniNδxi,μT)≤m CE,T,R,Δh+eCTT[CQTΔ+Δ2M0(μT)+M1R+2K∗M12TaR]. The first term is temporal error for the fixed finite ODE; the terms in Δ and R−1 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.

[F1]

Sectional forward Euler converges globally with first-order error: ∥yN−y(T)∥2≤CE,T,R,Δh for the fixed finite system.

[F2]

Sectional size discretization separates grid and cutoff errors: the exact finite-sectional retained measure differs from μT by the displayed grid and cutoff terms.

[F3]

Bounded-Lipschitz discrepancy for finite measures: dBL(σ,0)≤∥σ∥TV.

Proof

1.1F1F3algebra

Write the population-coordinate error vector as e=nN−n(T). Its total-variation norm as an atomic signed measure is at most ∑i=1m∣ei∣≤m∥e∥2 by Cauchy-Schwarz. Thus [F1] and [F3] bound the temporal discrepancy by mCE,T,R,Δh.

2.1F2step 1.1algebra∎

Insert the exact finite-sectional measure between the Euler retained measure and μT. 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