Alphabeta Math
TheoremStatement: 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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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