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.

Fully discrete θ heat finite-difference scheme

Definition

Fix a dimension d≥1, side lengths Lj>0, integers Nj≥2, directional diffusivities κj>0, and spacings hj=Lj/Nj. For a finite periodic rectangular grid let

Ghper=∏j=1d(Z/NjZ),⟨v,w⟩h=(∏j=1dhj)∑i∈Ghperviwi,

and define the positive centered heat operator, with indices reduced modulo Nj, by (Ahperv)i=∑j=1dκj2vi−vi+ej−vi−ejhj2.

For a two-dimensional Dirichlet rectangle, use the nodes and weighted interior inner product of Rectangular grid and Dirichlet flux stencil. At an interior node (i,j) define (AhBV)ij=κx2Vij−Vi+1,j−Vi−1,jhx2+κy2Vij−Vi,j+1−Vi,j−1hy2, where values on boundary neighbours are the prescribed Dirichlet row B. Write Ah0 for the square matrix on interior values when the boundary is zero. For any boundary vector B, let ch(B) be the result of applying this stencil to the grid vector that equals B on the boundary and 0 at interior nodes. Then AhBV=Ah0V+ch(B) on interior nodes.

Let T>0, an integer M≥1, Δt=T/M, tn=nΔt, and θ∈[0,1]. Given interior initial data U0, interior source samples Fn, and, in the Dirichlet case, boundary rows Bn for 0≤n≤M whose time-zero row agrees with the initial grid data, the periodic update is

Un+1−UnΔt+Ahper((1−θ)Un+θUn+1)=(1−θ)Fn+θFn+1,0≤n<M.

The Dirichlet update, with the boundary values imposed at every time level, is

Un+1−UnΔt+Ah0((1−θ)Un+θUn+1)=(1−θ)(Fn−ch(Bn))+θ(Fn+1−ch(Bn+1)),0≤n<M.

Thus the interior rows use the exact boundary contributions at both endpoints of the time step. The choices θ=0,1/2,1 are forward Euler, Crank–Nicolson, and backward Euler applied to the spatially semidiscrete heat equation; this definition does not redefine those ODE time-stepping procedures.

For a homogeneous-source update with periodic rows or zero Dirichlet boundary values, let Qh be its one-step linear map when that step is well defined, and give it the operator norm induced by ∥⋅∥h. The family is grid-norm power stable on [0,T] if there is CT<∞, independent of the grid and time step, such that ∥Qhn∥h→h≤CT whenever nΔt≤T. This is a statement in the mesh-dependent finite grid norms defined above.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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