Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: 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 reaction followed by exact FV or periodic diffusion

Definition

Input: Either the no-flux TPFA discretization of No-flux TPFA diffusion generator or the periodic-grid discretization of Periodic rectangular reaction-diffusion grid; a reaction field F; a reaction-inward rectangle R; coordinate constants Li≥0 such that ∣Fi(z)−Fi(w)∣≤Li∣zi−wi∣ whenever z,w∈R differ only in coordinate i, as required in A bounded forward-Euler reaction step preserves an inward rectangle; τR=min⁡i:Li>0Li−1, with τR=+∞ if every Li=0; a state Un with every cell/node state in R; and 0≤τ≤τR.

Procedure:

  1. At every cell/node, compute the forward-Euler reaction value Vi=Uin+τF(Uin).
  2. For each species r, apply the exact diffusion map e−τdrM−1Lh in the TPFA case or e−τdrAhper in the periodic-grid case to (Vi,r)i.
  3. Return the resulting state Un+1.

This is an approximate reaction substep followed by exact diffusion. The bound τ≤τR is part of the input contract and is needed for the stated rectangle guarantee; no diffusion CFL restriction is needed because the diffusion map is exact. The procedure makes no claim about finite-precision evaluation of either step.

Depends on

Used by

Dependency tree · two levels

15 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