Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Analytic ellipse data give exponential Chebyshev–Lobatto interpolation error

Statement

Let ρ>1, and let Eρ be the closed Bernstein ellipse

Eρ={ρeit+ρ−1e−it2:0≤t≤2π}

together with its interior. Suppose f is real-valued on [−1,1], extends holomorphically to an open neighborhood of Eρ, and satisfies ∣f(z)∣≤M on Eρ. Then for every N≥1,

∥f−INLf∥C≤4πMρ−1ρ−N.

Facts & Assumptions

Given: ρ>1, a function f holomorphic near Eρ with ∣f∣≤M there, and N≥1.

[F1]

A continuous function holomorphic away from one point on a star-shaped domain has a primitive and zero closed-contour integrals: a holomorphic function on a star-shaped open set has zero integral around every closed rectifiable contour in that set.

[F3]

Chebyshev–Lobatto interpolation folds polynomial modes: INLTn=TρN(n) for the folded degree 0≤ρN(n)≤N.

[F4]

Chebyshev polynomials are orthogonal for the arcsine weight: the Chebyshev modes have squared norms π at degree zero and π/2 at positive degrees, and a continuous function pairing to zero with every mode is zero. The coefficient convention used in this proof is defined explicitly in step 2.1.

[F5]

Arcsine-weighted inner product on the Chebyshev interval: the angular measure has total mass π, so ∥h∥C≤π∥h∥∞.

[F6]

Signs, monotonicity intervals, and ranges of sine and cosine: ∣cos⁡t∣≤1 for real t.

[F7]

For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges: for r∈R with ∣r∣<1, ∑k≥0rk=1/(1−r).

[F11]

The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x), Integer powers am, and Laws of integer exponents: e−nL=(e−L)n=(1/ρ)n=ρ−n for each natural n.

Proof

1.1givenF8F9F10algebra

Put L=log⁡ρ>0. For z=θ−it, 0≤t≤L, let r=et, so 1≤r≤ρ by [F10]. The definitions in [F8] and Cartesian formula [F9] give cos⁡(θ−it)=Arcos⁡θ+iBrsin⁡θ, where Ar=(r+r−1)/2 and Br=(r−r−1)/2. For 1≤r≤ρ, Ar≤Aρ and Br≤Bρ: the differences are (ρ−r)(1−1/(ρr))/2 and (ρ−r)(1+1/(ρr))/2. Therefore x2/Aρ2+y2/Bρ2≤cos⁡2θ+sin⁡2θ=1 for r>1, so the image lies in the filled ellipse Eρ; at r=1 it lies on [−1,1]⊂Eρ. The closed rectangle R0={−π≤ℜz≤π, −L≤ℑz≤0} is compact and lies in the open set cos⁡−1(V), where V is a neighborhood on which f is holomorphic. Hence a slightly larger open rectangle R still lies in cos⁡−1(V); it is convex and therefore star-shaped. By [F8], g=f∘cos⁡ is holomorphic on R, and each Hn(z)=g(z)e−inz is holomorphic and continuous there by [F8]. On the lower edge ∣g(θ−iL)∣≤M.

2.1F1F2F8F9F11step 1.1algebra

For each n≥1 define cn=2π∫0πf(cos⁡θ)cos⁡(nθ) dθ, and define c0=1π∫0πf(cos⁡θ) dθ. For real θ, g is even and f(cos⁡θ) is real; Euler's identity [F9] makes the sine part of ∫−ππg(θ)e−inθ dθ vanish, so this integral is πcn. Also Hn(z)=g(z)e−inz is 2π-periodic: g is periodic by [F8]--[F9], and e−2πin=1 by [F9]. Apply [F1] to the boundary of R0; the vertical integrals cancel by periodicity, so the top and lower horizontal integrals, both oriented from left to right, are equal. On the lower edge, [F9] and [F11] give ∣e−in(θ−iL)∣=e−nL=ρ−n, hence ∣cn∣≤2Mρ−n. Also ∣c0∣≤M by the defining integral and the bound ∣f∣≤M.

3.1F2F4F6step 2.1algebra

The coefficient bounds in step 2.1 make ∑n≥0cnTn uniformly convergent, since [F2] and [F6] give ∣Tn(x)∣≤1. Uniform convergence permits termwise integration against each bounded Tk; orthogonality [F4] shows that this series and f have the same coefficients as defined in step 2.1. Their continuous difference therefore pairs to zero with every Chebyshev mode, so [F4] gives f=∑n≥0cnTn on [−1,1].

4.1F2F3F6F7step 3.1algebra

By [F3], every mode Tn with n>N interpolates to a Chebyshev mode. Each such mode has sup norm at most one by [F2] and [F6]. Thus the series tail and its interpolant each have sup norm at most ∑n>N∣cn∣, and ∥f−INLf∥∞≤2∑n>N∣cn∣≤4M∑n>Nρ−n=4Mρ−1ρ−N, where [F7] evaluates the geometric tail.

5.1F5step 4.1algebra∎

Apply [F5] to the uniform error in step 4.1. This yields ∥f−INLf∥C≤4πM(ρ−1)−1ρ−N, as claimed.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

107 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