Alphabeta Math
DefinitionDefinition: 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.

Backward Euler step equation and algebraic residual

Definition

Let f:D→Rd define a first-order initial-value problem on an open time-state domain D⊆R×Rd. Given a time tn, step hn>0, and state yn with (tn,yn)∈D, an admissible endpoint yn+1 must satisfy (tn+hn,yn+1)∈D. The backward Euler endpoint is any such yn+1 satisfying

yn+1=yn+hnf(tn+hn,yn+1).

Its update residual at an approximate endpoint z with (tn+hn,z)∈D is

GnBE(z)=z−yn−hnf(tn+hn,z).

When f is defined at the endpoint, the derivative residual is GnBE(z)/hn. The equation can have no, one, or several roots on a restricted admissible branch set; this definition by itself asserts neither existence nor uniqueness.

Depends on

Used by

Dependency tree · two levels

4 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