Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

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.

Depends on

Used by

Dependency tree · two levels

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

Sources