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.

The unbounded fixed-pivot flow has first-order grid error

Statement

Let μt be the continuous solution of Continuous-size coagulation-fragmentation weak model on [0,T], and let ηt be the no-cutoff pivot solution of Unbounded-grid fixed-pivot coagulation-fragmentation dynamics on a grid of maximum spacing Δ≤1, initialized by η0=PΔμ0. Then for 0≤t≤T, dBL(ηt,μt)≤eCTt CQTΔ+Δ2M0(μt), where CQ is the quadrature constant in Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error evaluated at the uniform number bound for μt, and CT is the vector-field stability constant for the projected continuous paths and pivot solutions. Both constants are finite and independent of Δ.

Facts & Assumptions

Given: Bounded-kernel moment bounds, first-order fixed-pivot quadrature consistency, and grid-field bounded-Lipschitz stability.

[F1]

Continuous-size coagulation-fragmentation weak model: the continuous path satisfies μ˙=F(μ) in integral form.

[F2]

Unbounded-grid fixed-pivot coagulation-fragmentation dynamics: PΔ is a linear map from continuous measures to grid measures and η˙=FΔ(η).

[F3]

Fixed-pivot projection has first-order bounded-Lipschitz kernel quadrature error: ∥FΔ(PΔμ)−PΔF(μ)∥BL≤CQΔ on the bounded-number set.

[F4]

Bounded-kernel measure solutions conserve mass and control number and second moments: M1(μt) is constant and M0(μt) is bounded on [0,T].

[F5]

Unbounded-grid fixed-pivot dynamics are globally well posed and stable: the pivot vector field is bounded-Lipschitz in dBL on positive paths with bounded number, and PΔ preserves M0 and M1.

[F6]

Fixed-pivot weights are nonnegative and reproduce number and mass: each pivot projection has expected displacement at most Δ/2.

Proof

1.1F1F2F4F5F6

For every z≥a, [F6] gives ∫w(u)PΔ(z)(du)≤w(z)+Δ2/4≤(5/4)w(z), so the linear projection PΔ is bounded on Mw(E). Set qt=PΔμt; applying this bounded linear map to the integral equation [F1] gives q˙t=PΔF(μt). The total-number-one and first-moment identities in [F2] and [F6] give M0(qt)=M0(μt) and M1(qt)=M1(μt), so [F5] supplies a Δ-independent number bound for both qt and ηt.

2.1F2F3F5step 1.1algebra

Subtract the equations for ηt and qt and add and subtract FΔ(qt). The vector-field term is bounded by CTdBL(ηt,qt) using [F5]; the residual is at most r:=CQΔ by [F3]. Therefore d(t)≤CT∫0td(s)ds+rt, with d(0)=0. Set g(t)=rt+CT∫0td(s)ds. Then d≤g and g′≤r+CTg. If CT>0, integrating (e−CTtg(t))′≤re−CTt gives g(t)≤r(eCTt−1)/CT≤rteCTt; if CT=0, g(t)=rt. Since t≤T, this is at most eCTtCQTΔ.

3.1F3F4F6step 2.1algebra∎

For any test admissible in [F3], its expected pivot value differs from its original value by at most its Lipschitz constant times the expected displacement. [F6] therefore yields dBL(qt,μt)≤(Δ/2)M0(μt). The triangle inequality with step 2.1 proves the Statement.

Depends on

Used by

Dependency tree · two levels

13 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