Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Crank–Nicolson and cG(1) for an autonomous parabolic form

Definition

Input a finite-dimensional conforming subspace Vh⊂V with its inherited H inner product and V norm; a finite-element use instantiates it with a zero-boundary conforming polynomial space. Input also a final time T>0, a finite partition 0=t0<⋯<tN=T, a time-independent real bounded coercive bilinear form a on V, a load f∈L2(0,T;V∗), and U0∈Vh. Put fˉj=τj−1∫tj−1tjf(t) dt. For j=1,…,N, solve τj−1(Uj−Uj−1,vh)H+a ⁣(Uj+Uj−12,vh)=⟨fˉj,vh⟩(vh∈Vh). Return the nodal values and their continuous piecewise-linear interpolant. There are no interior time jumps; the initial value is the supplied U0. The coefficient form is time-independent, while the load is averaged, so no point value of an L2(V∗) equivalence class is used. Invalid inputs return invalid-input; the well-definedness theorem proves that each indicated step has a unique solution under the stated hypotheses.

For each interval, the same equation is the continuous-Galerkin cG(1) equation with continuous piecewise-linear trial functions and constant test functions: integrating U′ gives Uj−Uj−1, and integrating the linear trial function in the time-independent form gives its midpoint value. Thus this item asserts the cG(1) equivalence only; it does not assert rates for higher-degree cG or discontinuous-Galerkin methods.

Depends on

Used by

Dependency tree · two levels

8 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