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

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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