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.
Continuous and discrete heat maximum bounds on sampled data
Example
On , the function
solves the unit-diffusivity heat equation with zero Dirichlet data and initial values in . It remains in continuously. On an equal-spacing grid, forward Euler also remains in provided .
Verification
Given: , , , , with , and the exact sampled initial and zero Dirichlet boundary data for the forward-Euler heat scheme with .
[F1] Fully discrete θ heat finite-difference scheme: the centered Dirichlet update imposes the specified boundary rows at every time level.
[F2] A boundary-aware discrete maximum principle for the θ scheme: for the zero-source Dirichlet θ scheme, if , all grid values lie between the initial and boundary extrema.
Direct differentiation gives and , so . Also on the four sides and .
On , , and for the factor lies in . The explicit formula therefore gives throughout the closed cylinder.
The sampled initial values lie in and the boundary rows are zero. With and , the condition in [F2] is exactly . Therefore [F2] gives at every grid node and time level.
Remarks
The continuous supplier is used only for unit diffusivity on a bounded rectangle with smooth exact data. The discrete conclusion follows from the separately proved finite-grid boundary condition.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 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.