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–Lobatto nodes cluster quadratically at the endpoints
Example
For , the endpoint gap is at most , whereas a central adjacent-node gap is at least . Their ratio tends to zero, and the smallest spacing has quadratic endpoint scale. The mesh is nonuniform for ; for the nodes are equally spaced.
Facts & Assumptions
Given: An integer and the decreasing Chebyshev–Gauss–Lobatto nodes .
The subtraction formulas for sine and cosine and The addition formulas for sine and cosine: cosine differences reduce to products of sine factors, , and .
Sine chord and Lipschitz bounds: for and for all real .
Signs, monotonicity intervals, and ranges of sine and cosine and Quarter-turn values and shifts by pi/2 and pi: sine is strictly increasing on and .
Square roots exist: a unique with ; the positives are : each nonnegative real has a unique nonnegative square root.
For every in a complete ordered field there is a natural with : for every there is an integer with . Canonical naturals are positive and strictly increasing: canonical positive naturals are positive and strictly increasing. Inverses of positives are positive, and reciprocation reverses order: reciprocation reverses strict order on positive reals. Algebra of limits: sums, scalar multiples, products and quotients: a fixed real multiple of a sequence converging to zero also converges to zero.
Verification
The subtraction and addition identities [F2] give By [F3], , hence .
If is odd, choose ; then and [F4] gives sine equal to , so the gap formula in step 1.1 and [F3] give a central gap at least . If is even, choose and write . The addition and subtraction formulas [F2] give and . Thus ; the chord bound [F3] gives , so uniqueness of the nonnegative square root [F5] gives . Monotonicity [F4] now gives . In either parity, [F3] also gives , so the selected central gap in step 1.1 is at least .
Put . Every adjacent gap has the form , with . Reflecting about and using monotonicity [F4] gives ; equality occurs at and . Hence the smallest spacing is exactly , and [F3] bounds it by . For every , [F6] supplies an integer with ; for every integer , positivity and monotonicity of the canonical naturals and reciprocal order give . Thus , and the endpoint-to-central-gap ratio is at most , which tends to zero by the fixed-multiple limit law in [F6]. For , the selected central angle, reflected into if necessary, is strictly larger than ; strict monotonicity in [F4] makes its gap larger than the endpoint gap. For , the nodes are and both gaps equal . This proves the quadratic endpoint scale with its stated nonuniformity exception.
Depends on
- Chebyshev–Gauss–Lobatto collocation grid
- Sine chord and Lipschitz bounds
- The subtraction formulas for sine and cosine
- The addition formulas for sine and cosine
- Signs, monotonicity intervals, and ranges of sine and cosine
- Quarter-turn values and shifts by pi/2 and pi
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Canonical naturals are positive and strictly increasing
- Inverses of positives are positive, and reciprocation reverses order
- Algebra of limits: sums, scalar multiples, products and quotients
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
51 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)