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.
A solution with only H1 time regularity loses CN second order
Example
In the scalar evolution triple , use , , exact solution , and load . Apply Crank–Nicolson with exact interval-average load, uniform step , and . Then the first nodal error is Thus the maximum nodal error is not although the exact solution belongs to and the load belongs to , as assumed by the method. The time regularity in the Crank–Nicolson theorem is a real condition.
Facts & Assumptions
Given: with the identity embeddings, the form , the function , its load , and the Crank–Nicolson algorithm with interval-average forcing.
Crank–Nicolson uses the average of the endpoint states in the autonomous form and the interval-average load (Crank–Nicolson and cG(1) for an autonomous parabolic form).
A form is bounded and coercive when and (Bounded, coercive and symmetric sesquilinear forms).
An evolution triple uses dense continuous embeddings and identifies with its dual in the canonical way (Evolution triples and the parabolic energy space).
Verification
Here has . The derivative is and ; also , so and . But has nonintegrable square near zero, so .
The exact equation integrated over is The first CN step from [F1] is . Subtract, use , and set . This gives
Solving the scalar equation in step 1.2 yields . Along , ; the maximum nodal error is at least , so it cannot be .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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.