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 kernels give a local positive measure-valued solution
Statement
For the bounded Lipschitz kernels and daughter measures of Continuous-size coagulation-fragmentation weak model, every positive initial measure has a unique positive solution to the weak model for some .
Facts & Assumptions
Given: The bounded-kernel weak equation, a positive initial measure, and the weighted total-variation space.
Continuous-size coagulation-fragmentation weak model: define the weak vector field and preserve positivity of the gain measures.
The bounded-kernel continuous coagulation-fragmentation field is locally Lipschitz: that vector field is Lipschitz on every bounded ball of .
The weighted total-variation measure space is complete: is complete in .
Bounded coagulation is bilinear and bounded in weighted total variation: the coagulation bilinear operator is bounded on weighted total variation.
Mass-normalized fragmentation is bounded in weighted total variation: the fragmentation operator is bounded on weighted total variation.
Proof
For a positive path in a ball of radius , define and the positive gain , , and . Then . Since , ; bilinearity gives its local Lipschitz bound. Also by the daughter estimate in [F5]. Thus is bounded and Lipschitz on the ball, and is bounded by .
On define . The loss rate is continuous in time in , since ; the gain path is continuous in by the bounded-operator estimates in [F4]–[F5]. For bounded , multiplication satisfies , so the survival multipliers are continuous in operator norm and is a continuous path. For positive it is positive. On the closed positive path ball of radius , the gain bound gives for sufficiently small . The bounds and give . Choose so this coefficient is below .
The closed positive path ball is complete: a Cauchy sequence converges uniformly by [F3], its uniform limit is continuous, and the positive cone is closed because when . It is nonempty because it contains the constant path . If is the contraction coefficient in step 2.1, iteration from satisfies . For , , so completeness gives a limit. The contraction bound makes continuous, hence the limit is fixed; if two fixed points existed, their distance would be at most times itself, hence zero. For a fixed point, has operator-norm derivative , since the scalar exponential difference quotients converge uniformly in . Splitting the difference quotient of the source integral at gives its endpoint term and its integral term ; thus the fixed point solves . Conversely, for any positive solution , the inverse multiplier is operator-norm differentiable with . The product difference quotient gives ; integrating this continuous derivative by telescoping partitions and multiplying by recovers the same mild formula. Continuity at puts any competing solution in this ball on a sufficiently short interval, where fixed-point uniqueness makes it equal to the constructed solution.
The derivative established in step 3.1 is . Symmetry of combines the two coagulation loss marginals into ; the fragmentation loss is . Hence this is precisely the weak equation in [F1], proving the claim.
Depends on
- Continuous-size coagulation-fragmentation weak model
- The bounded-kernel continuous coagulation-fragmentation field is locally Lipschitz
- The weighted total-variation measure space is complete
- Bounded coagulation is bilinear and bounded in weighted total variation
- Mass-normalized fragmentation is bounded in weighted total variation
Used by
Dependency tree · two levels
7 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
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §§3.1–3.2 (standard reference, not scraped)
- Jacek Banasiak, Analytic fragmentation semigroups and classical solutions to coagulation-fragmentation equations, §§1–2 (standard reference, not scraped)