Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge 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.

Local truncation residual for the θ heat scheme

Statement

Let Ω=(0,Lx)×(0,Ly), T>0, Nx,Ny≥2, M≥1, hx=Lx/Nx, hy=Ly/Ny, and Δt=T/M. Let κx,κy>0, θ∈[0,1], and suppose u satisfies

u_t-\kappa_xu_{xx}-\kappa_yu_{yy}=f$$ on $\overline\Omega\times[0,T]$, with exact sampled initial and Dirichlet rows in the scheme of [Fully discrete θ heat finite-difference scheme](/item/def-parabolic-theta-finite-difference-scheme). Assume $u_{tt},u_{ttt},u_{xxxx},u_{yyyy}$ are continuous on the closed cylinder, and write $M_{tt},M_{ttt},M_{x4},M_{y4}$ for their respective sup norms there. If $r^n$ is the exact grid sample at time $t_n$, the complete interior residual is bounded at every time step by

|\tau^n|\infty\le \Delta t M{tt}+\frac{\kappa_xh_x^2M_{x4}+\kappa_yh_y^2M_{y4}}{12}\quad(\theta\ne\tfrac12),

and

|\tau^n|\infty\le\frac{(\Delta t)^2M{ttt}}{12}+\frac{\kappa_xh_x^2M_{x4}+\kappa_yh_y^2M_{y4}}{12}\quad(\theta=\tfrac12),

where $\tau^n$ is defined by substituting the exact samples and the exact boundary rows into the fully discrete equation, including its interior rows adjacent to the boundary.

Facts & Assumptions

Given: The rectangular domain and finite mesh above; κx,κy>0; θ∈[0,1]; an exact solution with the stated continuous derivatives satisfying ut−κxuxx−κyuyy=f; and exact initial and boundary samples.

[F1]

Fully discrete θ heat finite-difference scheme defines the centered heat stencil, the endpoint-weighted source (1−θ)fn+θfn+1, and boundary contributions from both endpoint rows.

Proof

1.1F1givenalgebra

At each interior node set rijn=u(xi,yj,tn) and define τn=(rn+1−rn)/Δt+AhBθ((1−θ)rn+θrn+1)−((1−θ)fn+θfn+1), where Bθ=(1−θ)Bn+θBn+1 and AhBθ applies the centered stencil using that exact boundary row. Applying the PDE at tn and tn+1 rewrites this as the weighted average of the two spatial stencil defects plus (rn+1−rn)/Δt−((1−θ)utn+θutn+1).

2.1F1givenstep 1.1algebra

For a one-variable C4 function v, Taylor expansion at an interior node gives (v(x+h)−2v(x)+v(x−h))/h2−v′′(x)=h2(v(4)(ξ+)+v(4)(ξ−))/24 for some ξ+∈(x,x+h) and ξ−∈(x−h,x). Thus the absolute error is at most h2∥v(4)∥∞/12. The stencil uses the exact boundary samples at the first and last interior rows, so the same Taylor estimate applies there. Applying it in x and y bounds each spatial defect in step 1.1 by (κxhx2Mx4+κyhy2My4)/12.

2.2givenstep 1.1algebra

Put g(t)=ut(xi,yj,t). The quotient (u(tn+1)−u(tn))/Δt is the average of g on the time interval. For θ≠1/2, both this average and (1−θ)g(tn)+θg(tn+1) lie between the minimum and maximum of g on that interval; their difference is therefore at most its oscillation, which is at most ΔtMtt. For θ=1/2, let L be the linear interpolant of g at the two endpoints. The interpolation remainder satisfies ∣g(t)−L(t)∣≤Mttt(t−tn)(tn+1−t)/2. Integrating and dividing by Δt gives ∣(Δt)−1∫tntn+1g−(g(tn)+g(tn+1))/2∣≤(Δt)2Mttt/12. These are the required bounds for the temporal term in step 1.1.

3.1step 1.1step 2.1step 2.2algebra∎

Combining the two spatial bounds from step 2.1 with the temporal bound from step 2.2 in the residual identity of step 1.1 gives the two asserted estimates at every interior node. Taking the maximum over nodes and time steps proves the stated complete-residual bounds.

Remarks

The derivatives are assumed up to the closed space-time boundary, so the proof includes boundary-adjacent interior rows. Exact boundary samples are essential; no result for a lower-order or different boundary closure is asserted. No choice axiom is used.

Depends on

Used by

Dependency tree · two levels

2 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