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.
First steps for a scalar fractional relaxation
Example
Consider the scalar fractional relaxation equation with . On a uniform first step of width , the L1 method returns
while backward-Euler convolution quadrature returns
These are the methods' first-step outputs; this calculation makes no claim about their later-step values or a long-time limit.
Facts & Assumptions
Given: , , , , and .
Uniform-grid and graded-grid L1 discretization: on the first uniform step, ; the returned sequence satisfies the discrete equation by Positive L1 weights, discrete comparison, and residual stability.
Backward-Euler convolution quadrature for a Caputo equation: with , and ; the algorithm's returned sequence satisfies its shifted discrete equation by Scalar resolvent stability for backward-Euler convolution quadrature.
Verification
For , the first-step discrete equation is by [F1]. Multiplying by and solving gives .
For CQ, [F2] gives , so and . Both values are positive and less than because and .
Depends on
- Uniform-grid and graded-grid L1 discretization
- Backward-Euler convolution quadrature for a Caputo equation
- Positive L1 weights, discrete comparison, and residual stability
- Scalar resolvent stability for backward-Euler convolution quadrature
- Fractional integral and Caputo derivative
- The real Gamma function by Euler's integral
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 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
- Yumin Lin and Chuanju Xu, Finite difference/spectral approximations for the time-fractional diffusion equation, Journal of Computational Physics 225 (2007), §3 (standard reference, not scraped)
- Ralf Hiptmair, Advanced Numerical Methods for Computational Science and Engineering, lecture notes (2023), §3.3.2 (standard reference, not scraped)