Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Dependency tree · one level

2 results within one dependency step 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