Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-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.

Forward Euler for a finite sectional balance with a positivity CFL

Definition

Input a valid grid state (n,L) with ni≥0, a step h>0, and the finite sectional event rates of Finite sectional coagulation-fragmentation balance with reported overflow. The total per-particle loss rate is

Λi(n)=∑jKijnj+βi.

First validate the grid, state, rates, and daughter measures against the input conditions of Finite sectional coagulation-fragmentation balance with reported overflow, and require h>0; if any condition fails, return invalid-input without updating. For admissible inputs use exact arithmetic to evaluate the finite event sums defining F and Λi. If hΛi(n)>1 for any coordinate, return cfl-failure without updating. Otherwise return success together with (n+,L+)=(n,L)+hF(n,L). Exact-arithmetic positivity and conservation are stated separately in The sectional forward-Euler step is positive and conserves augmented mass ↗.

Depends on

Used by

Dependency tree · two levels

3 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