Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 N≥1 be an integer and put xj=cos⁡(jπ/N) for j=0,…,N. The ordering is decreasing: x0=1 and xN=−1. These are the Chebyshev–Gauss–Lobatto nodes; Tn(cos⁡θ)=cos⁡(nθ) and Un(cos⁡θ)sin⁡θ=sin⁡((n+1)θ) for every n∈N gives TN(xj)=(−1)j. They are distinct because cosine is strictly decreasing on [0,π] by Signs, monotonicity intervals, and ranges of sine and cosine.

For interpolation using Cardinal-polynomial interpolation, use the increasing reindexing zk=xN−k, k=0,…,N. For descending-grid real data Uj, the corresponding increasing data are Yk=UN−k.

For real nodal data U0,…,UN∈R, define INLU to be the cardinal interpolant of (Yk)k=0N at (zk)k=0N. For a function f:[−1,1]→R, write INLf 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

Used by

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