Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

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.

Depends on

Used by

Dependency tree · two levels

17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources