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.
Chebyshev–Gauss–Lobatto collocation grid
Definition
Let be an integer and put for . The ordering is decreasing: and . These are the Chebyshev–Gauss–Lobatto nodes; and for every gives . They are distinct because cosine is strictly decreasing on by Signs, monotonicity intervals, and ranges of sine and cosine.
For interpolation using Cardinal-polynomial interpolation, use the increasing reindexing , . For descending-grid real data , the corresponding increasing data are .
For real nodal data , define to be the cardinal interpolant of at . For a function , write for the interpolant of its nodal values. The increasing-node interpolation theorem Existence and uniqueness of the cardinal-polynomial interpolant makes this polynomial unique.
Depends on
- Chebyshev polynomials of the first and second kinds by their three-term recurrences
- $T_n(\cos\theta)=\cos(n\theta)$ and $U_n(\cos\theta)\sin\theta=\sin((n+1)\theta)$ for every $n\in\mathbb N$
- Signs, monotonicity intervals, and ranges of sine and cosine
- Cardinal-polynomial interpolation
- Existence and uniqueness of the cardinal-polynomial interpolant
Used by
- Boundary-eliminated Chebyshev collocation for a two-point Dirichlet BVP Algorithm
- Chebyshev–Gauss–Lobatto polynomial differentiation matrix Algorithm
- Chebyshev–Lobatto nodes cluster quadratically at the endpoints Example
- Chebyshev–Lobatto interpolation folds polynomial modes Lemma
- Analytic ellipse data give exponential Chebyshev–Lobatto interpolation error Theorem
- Chebyshev–Gauss–Lobatto differentiation is exact on the interpolant Theorem
- Chebyshev–Lobatto interpolation remainder bound Theorem
Dependency tree · two levels
23 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
- Jie Shen and Tao Tang, Spectral and High-Order Methods with Applications, Ch. 2 (standard reference, not scraped)
- Lloyd N. Trefethen, Finite Difference and Spectral Methods for Ordinary and Partial Differential Equations, Ch. 8 (standard reference, not scraped)