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

Size characteristics, positivity, and discrete number and size-moment balances

Statement

Under Size transport with a nonlocal division kernel, for every initial size y∈[0,X] the extended IVP specified there has a unique solution χy on [0,T]. The solution is strictly increasing and agrees with the original growth field until it first reaches X, so its restriction through that first hit is the model characteristic.

For Finite-volume size transport with positive division quadrature, assume nonnegative initial masses, nonnegative quadrature coefficients Ajℓ, and the stated CFL. Then all Mjk remain nonnegative. Define the cell number and center-weighted size moment by Nhk=∑jMjk and Whk=∑jxjcMjk. With k0,ℓh=∑jAjℓ and k1,ℓh=∑jxjcAjℓ, the exact balances are

Nhk+1−Nhk=Δt(−FJk−∑jdjMjk+∑ℓk0,ℓhMℓk),

Whk+1−Whk=Δt(∑j=1J−1(xj+1c−xjc)Fjk−xJcFJk−∑jxjcdjMjk+∑ℓk1,ℓhMℓk).

Thus a division kernel preserves the discrete size moment only when its first-moment production cancels the parent-removal term; this identity is not automatic for an arbitrary kernel.

Facts & Assumptions

[F1]

Size transport with a nonlocal division kernel: the total loss rate is d=μ+γ, and each daughter kernel is a nonnegative measure supported on sizes no larger than its parent.

[F2]

Finite-volume size transport with positive division quadrature: the update is Mjk+1=Mjk−Δt(Fj−Fj−1)−ΔtdjMjk+Δt∑ℓAjℓMℓk, with nonnegative Ajℓ and the stated CFL.

[F3]

Picard-Lindelöf local existence and uniqueness for first-order systems: a continuous vector field that is locally Lipschitz in the state variable has a unique local IVP solution; its quantitative clause gives a solution on any centered cylinder where the boundedness and contraction conditions hold, and its uniqueness clause applies on common intervals.

[A1]

The initial cell masses are nonnegative.

Proof

1.1A1F1F2inductionalgebra

In [F2], the coefficient of Mjk outside the division source is 1−Δt(g(xj)/hj+dj), which is nonnegative by the CFL. For j≥2 the incoming transport term has coefficient Δtg(xj−1)/hj−1≥0; for j=1 the incoming flux is F0=0. Every division term has coefficient ΔtAjℓ≥0. Hence each new mass is a sum of nonnegative terms when [A1] holds. Induction on k proves Mjk≥0.

1.2F2algebra

Sum [F2] over j. The finite flux sum telescopes to FJ−F0=FJ because F0=0. Interchanging the finite sums in the kernel source gives ∑ℓ(∑jAjℓ)Mℓ=∑ℓk0,ℓhMℓ. Subtracting Nhk yields the number identity.

2.1F1F2step 1.2algebra

Multiply [F2] by xjc and sum over j. For the flux term, finite summation by parts gives ∑jxjc(Fj−Fj−1)=xJcFJ−∑j=1J−1(xj+1c−xjc)Fj since F0=0. The loss term is −∑jxjcdjMj, and the source term is ∑ℓ(∑jxjcAjℓ)Mℓ=∑ℓk1,ℓhMℓ. Rearranging proves the weighted-moment identity and the stated condition for cancellation.

3.1F1F3constructalgebra∎

Let M=∥g∥∞ and let L be a Lipschitz constant for g on [0,X]. The projection Π[0,X] is 1-Lipschitz, so the extension g~=g∘Π[0,X] is globally bounded by M and globally Lipschitz with constant L on the open domain R. Since g≥gmin⁡>0, choose h0>0 with h0M≤1 and Lh0<1. For every starting time t0∈R and state z∈R, the cylinder [t0−h0,t0+h0]×[z−1,z+1] lies in R×R, and [F3] gives a unique solution through (t0,z) on that interval; the same bounds apply after every restart. Restricting and concatenating at most ⌈T/h0⌉ such forward segments gives a solution on [0,T], and the uniqueness clause of [F3] makes it unique there. Along this solution χy′(s)=g~(χy(s))≥gmin⁡, so it is strictly increasing. Starting from y∈[0,X], it stays in [0,X] through its first hitting of X, where g~=g; that restricted segment is the model characteristic.

Depends on

Used by

Cited to discharge well-definedness by Size transport with a nonlocal division kernel.

Dependency tree · two levels

12 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