Alphabeta Math
Pipeline-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.

Spectral collocation and Galerkin methods — Examples

1 · Prerequisites

2 · Summary

The examples compute a periodic Fourier derivative including its even-grid Nyquist mode, quantify the quadratic endpoint spacing of Lobatto nodes, and compare geometric Chebyshev coefficient decay for analytic data with algebraic decay for a cusp. A quadratic Fourier product shows the exact aliasing of frequencies three and four on a four-point grid. The final mass-matrix check computes a two-node Gaussian Legendre matrix and a two-panel Simpson approximation for the Chebyshev weight, including the proved Simpson error bound.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Four-point Fourier collocation differentiates the Nyquist cosine at its nodes

Example

Take N=4 and p(x)=1+2cos⁡x+3sin⁡x−4cos⁡(2x) on the grid xj=πj/2. Its samples are U=(−1,8,−5,2). The interpolating space contains the Nyquist cosine cos⁡(2x), while the derivative matrix omits that mode's derivative because it vanishes at every grid point. The returned derivative vector is (3,−2,−3,2).

Facts & Assumptions

Given: The four-point periodic Fourier grid, the real interpolant convention, and the polynomial p.

[F1]

Periodic Fourier collocation grid and even-grid Nyquist convention: for even N=4 the interpolation space contains 1,cos⁡x,sin⁡x,cos⁡(2x) and uses the cosine Nyquist mode only.

[F2]

Quarter-turn values and shifts by pi/2 and pi: the sine and cosine values at integer multiples of π/2 are 0,±1.

[F4]

Periodic Fourier collocation differentiates its interpolant exactly: the matrix output on nodal data equals the derivative of their periodic trigonometric interpolant at every grid point, with the Nyquist derivative zero at the nodes.

Proof

1.1givenF1F2algebra

Substitution of x0=0,x1=π/2,x2=π,x3=3π/2 into p using [F2] gives respectively −1,8,−5,2. The frequencies 0,1,2 lie in [F1]'s interpolation space, so p is the interpolant of these samples.

1.2givenF2F3F5algebra

By [F3] and [F5], p′(x)=−2sin⁡x+3cos⁡x+8sin⁡(2x). At the four nodes, the final term is zero and the first two terms give 3,−2,−3,2.

2.1F1F4step 1.1step 1.2∎

Exactness [F4] therefore gives D4U=(3,−2,−3,2), including the vanishing nodal derivative of the Nyquist mode.

ExampleConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

Chebyshev–Lobatto nodes cluster quadratically at the endpoints

Example

For xj=cos⁡(jπ/N), the endpoint gap x0−x1 is at most π2/(2N2), whereas a central adjacent-node gap is at least 2/N. Their ratio tends to zero, and the smallest spacing has quadratic endpoint scale. The mesh is nonuniform for N≥3; for N=2 the nodes 1,0,−1 are equally spaced.

Facts & Assumptions

Given: An integer N≥2 and the decreasing Chebyshev–Gauss–Lobatto nodes xj.

[F1]

Chebyshev–Gauss–Lobatto collocation grid: xj=cos⁡(jπ/N) for 0≤j≤N.

[F2]

The subtraction formulas for sine and cosine and The addition formulas for sine and cosine: cosine differences reduce to products of sine factors, sin⁡(a+b)=sin⁡acos⁡b+cos⁡asin⁡b, and cos⁡(2t)=cos⁡2t−sin⁡2t.

[F3]

Sine chord and Lipschitz bounds: sin⁡t≥2t/π for 0≤t≤π/2 and ∣sin⁡u−sin⁡v∣≤∣u−v∣ for all real u,v.

[F4]

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 [0,π/2] and sin⁡(π/2)=1.

[F6]

For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε: for every ε>0 there is an integer n≥1 with 1/n<ε. 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

1.1F1F2F3algebra

The subtraction and addition identities [F2] give xj−xj+1=2sin⁡((2j+1)π2N)sin⁡(π2N),x0−x1=2sin⁡2(π2N). By [F3], sin⁡(π/(2N))≤π/(2N), hence x0−x1≤π2/(2N2).

2.1givenF2F3F4F5step 1.1algebra

If N is odd, choose j=(N−1)/2; then (2j+1)π/(2N)=π/2 and [F4] gives sine equal to 1, so the gap formula in step 1.1 and [F3] give a central gap at least 2/N≥2/N. If N is even, choose j=N/2−1 and write t=π/2−π/(2N)≥π/4. The addition and subtraction formulas [F2] give sin⁡(π/4)=cos⁡(π/4) and 2sin⁡(π/4)cos⁡(π/4)=sin⁡(π/2)=1. Thus sin⁡2(π/4)=1/2; the chord bound [F3] gives sin⁡(π/4)≥1/2>0, so uniqueness of the nonnegative square root [F5] gives sin⁡(π/4)=2/2. Monotonicity [F4] now gives sin⁡t≥2/2. In either parity, [F3] also gives sin⁡(π/(2N))≥1/N, so the selected central gap in step 1.1 is at least 2/N.

3.1F2F3F4F6step 1.1step 2.1algebra∎

Put a=π/(2N). Every adjacent gap has the form 2sin⁡((2j+1)a)sin⁡a, with a≤(2j+1)a≤π−a. Reflecting about π/2 and using monotonicity [F4] gives sin⁡((2j+1)a)≥sin⁡a; equality occurs at j=0 and j=N−1. Hence the smallest spacing is exactly 2sin⁡2a, and [F3] bounds it by 2/N2≤2sin⁡2a≤π2/(2N2). For every ε>0, [F6] supplies an integer n≥1 with 1/n<ε; for every integer N≥max⁡{2,n}, positivity and monotonicity of the canonical naturals and reciprocal order give 0<1/N≤1/n<ε. Thus 1/N→0, and the endpoint-to-central-gap ratio is at most π2/(2N), which tends to zero by the fixed-multiple limit law in [F6]. For N≥3, the selected central angle, reflected into [0,π/2] if necessary, is strictly larger than a; strict monotonicity in [F4] makes its gap larger than the endpoint gap. For N=2, the nodes are 1,0,−1 and both gaps equal 1. This proves the quadratic endpoint scale with its stated nonuniformity exception.

ExampleConstruction: AI-generatedVerification: AI-adaptedOpen item page →

Analytic and nonsmooth data have geometric and algebraic Chebyshev coefficient decay

Example

For a continuous f on [−1,1], define its Chebyshev coefficients by a0(f)=1π∫0πf(cos⁡θ) dθ,an(f)=2π∫0πf(cos⁡θ)cos⁡(nθ) dθ(n≥1). For the analytic function fa(x)=1/(2−x), these coefficients are a0=1/3 and an=2(2−3)n/3 for n≥1, a geometric decay. For the nonsmooth function fs(x)=∣x∣, they are a0=2/π, a2m=4(−1)m−1/(π(4m2−1)) for m≥1, and a2m+1=0; the nonzero coefficients decay algebraically like m−2.

Facts & Assumptions

Given: The coefficient convention above and the two functions fa and fs.

[F2]

Arcsine-weighted inner product on the Chebyshev interval and Chebyshev polynomials are orthogonal for the arcsine weight: ⟨T0,T0⟩C=π, ⟨Tn,Tn⟩C=π/2 for n≥1, and distinct modes are orthogonal.

[F5]

The addition formulas for sine and cosine: 2cos⁡ucos⁡v=cos⁡(u+v)+cos⁡(u−v).

[F7]

Quarter-turn values and shifts by pi/2 and pi and Signs, monotonicity intervals, and ranges of sine and cosine: sin⁡(kπ)=0, sin⁡((2m+1)π/2)=(−1)m, cos⁡(kπ)=(−1)k, and cosine is nonnegative on [0,π/2] and nonpositive on [π/2,π].

[F8]

exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0: eiθ=cos⁡θ+isin⁡θ and ∣eiθ∣=1 for real θ.

[F9]

The subtraction formulas for sine and cosine: cos⁡(u−v)=cos⁡ucos⁡v+sin⁡usin⁡v.

[F10]

Parity and the Pythagorean identity for sine and cosine: sin⁡2θ+cos⁡2θ=1.

[F13]

Uniformly close integrable functions have integrals differing by at most the interval length times their uniform error: integrable functions uniformly within η on [0,π] have integrals differing by at most πη.

[F15]

A real-analytic function on an open subset of R is locally represented by a convergent real power series: a real function on an open set is real analytic if near each point it agrees with a convergent real power series centered at that point.

Proof

1.1givenF3F4F11F15algebra

The set Ω={z∈C:∣z∣<3/2} is an open neighborhood of [−1,1] and omits 2. For z,z0∈Ω with z≠z0, fa(z)−fa(z0)z−z0=1(2−z)(2−z0)⟶1(2−z0)2(z→z0). Thus [F4] makes fa holomorphic on a neighborhood of the interval. To verify analyticity in the power-series sense as well, fix a real c<2 and put t=(x−c)/(2−c) for ∣x−c∣<(2−c)/2. Finite geometric summation gives 12−x=∑k=0M(x−c)k(2−c)k+1+tM+1(2−c)(1−t). Since ∣t∣<1/2, the remainder has absolute value at most 2−M/(2−c), tending to zero by [F3]. The series therefore represents fa on a neighborhood of every c<2, establishing real analyticity on (−∞,2) by [F15], in particular near [−1,1].

1.2givenF6F7F9F11F14algebra

The function fs(x)=∣x∣ is continuous by [F14] and is not differentiable at 0: for h>0 its difference quotient is 1, while for h<0 it is −1, so the two-sided limit in [F11] does not exist. By [F7], ∣cos⁡θ∣=cos⁡θ on [0,π/2] and ∣cos⁡θ∣=−cos⁡θ on [π/2,π]. The subtraction identity [F9] gives cos⁡(n(π−θ))=(−1)ncos⁡(nθ), so reflection makes each odd coefficient integral its own negative. Therefore a0(fs)=1π∫0π∣cos⁡θ∣ dθ=2π. For odd n, that reflection makes an(fs)=0.

1.3F3F4F5F8F14algebrainduction

Put q=2−3. Then 0<q<1, q−1=2+3, q+q−1=4, and 1−q2=23q. By [F8], z=qeiθ has modulus q. For m≥1, put Sm(z)=∑n=1mzn. Multiplying the finite sum by 1−z cancels consecutive terms and gives (1−z)Sm=z−zm+1. The triangle inequality in [F3] gives ∣1−z∣≥1−q>0, so ∣Sm(z)−z1−z∣=∣z∣m+1∣1−z∣≤qm+11−q. Induction using the addition formulas in [F5] and Euler's identity in [F8] gives zn=qn(cos⁡(nθ)+isin⁡(nθ)). Thus Cm(θ):=1+2∑n=1mqncos⁡(nθ), a continuous function by [F14], differs from 1+2Re⁡(z/(1−z)) by at most 2qm+1/(1−q), uniformly for θ∈[0,π].

2.1F1F3F4F8F10F14step 1.3algebra

Multiplying numerator and denominator by 1−qcos⁡θ+iqsin⁡θ and using [F10] gives Re⁡z1−z=qcos⁡θ−q21−2qcos⁡θ+q2. Hence 1+2Re⁡z1−z=1−q21−2qcos⁡θ+q2=32−cos⁡θ, because the denominator equals 2q(2−cos⁡θ). By step 1.3, the continuous functions Cm/3 satisfy sup⁡0≤θ≤π∣Cm(θ)3−fa(cos⁡θ)∣≤ηm:=2qm+13(1−q)⟶0 by [F3]. This also establishes the claimed convergent Chebyshev expansion through [F1].

3.1F1F2F7F12F13F14step 2.1algebra

Fix a coefficient index n≥0. By [F14], the functions fa(cos⁡θ), Cm/3, and their products with cos⁡(nθ) are continuous; [F12] makes them integrable. Since ∣cos⁡(nθ)∣≤1 by [F7], [F13] bounds the corresponding coefficient differences by ηm for index zero and by 2ηm for positive indices. For every m≥n, finite integration and orthogonality [F2] give the coefficients of Cm/3 as 1/3 at zero and 2qn/3 at each 1≤n≤m. Letting m→∞ therefore yields exactly the asserted coefficients of fa; no interchange of an unbounded infinite sum and integral is assumed.

4.1givenF5F6F7algebra∎

For m≥1, symmetry about π/2 and [F5] give ∫0π∣cos⁡θ∣cos⁡(2mθ) dθ=2∫0π/2cos⁡θcos⁡(2mθ) dθ=2(−1)m−14m2−1, where the last equality follows by integrating 12[cos⁡((2m+1)θ)+cos⁡((2m−1)θ)] using [F6]–[F7]. Multiplying by 2/π gives a2m(fs)=4(−1)m−1/(π(4m2−1)). This coefficient magnitude is asymptotic to 1/(πm2).

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A quadratic Fourier product aliases two high modes on an even grid

Example

On the N=4 periodic grid, let p(x)=cos⁡x+cos⁡(2x). The continuous square has modes through frequency four, but its grid interpolant is

I4(p2)=32+2cos⁡x+12cos⁡(2x).

The frequency-three mode aliases to frequency one, and the frequency-four mode aliases to the constant mode. This exact sample identity is not a de-aliasing or nonlinear stability result.

Facts & Assumptions

Given: The four-point grid xj=πj/2, the interpolant convention, and p(x)=cos⁡x+cos⁡(2x).

[F1]

Periodic Fourier collocation grid and even-grid Nyquist convention: for N=4, the interpolation space is spanned over R by 1,cos⁡x,sin⁡x,cos⁡(2x).

[F2]

Periodic Fourier modes alias modulo the grid size: modes whose integer frequencies are congruent modulo 4 have the same samples, and sampled products have frequency equal to the sum modulo 4.

[F3]

The addition formulas for sine and cosine: cos⁡ucos⁡v=12(cos⁡(u+v)+cos⁡(u−v)).

[F4]

Quarter-turn values and shifts by pi/2 and pi: on xj=πj/2, cos⁡(4xj)=1 and cos⁡(3xj)=cos⁡(xj).

Proof

1.1F3algebra

By [F3], p(x)2=cos⁡2x+2cos⁡xcos⁡(2x)+cos⁡2(2x)=1+cos⁡x+12cos⁡(2x)+cos⁡(3x)+12cos⁡(4x).

2.1givenF1F4step 1.1algebra

At every grid node [F4] turns this into p(xj)2=32+2cos⁡(xj)+12cos⁡(2xj). The right side belongs to [F1]'s interpolation space.

3.1F1F2step 1.1step 2.1algebra∎

The modes at frequencies 3 and 4 in step 1.1 are identified on the grid by the congruences 3≡−1(mod4) and 4≡0(mod4), exactly as [F2] states. Thus the displayed interpolant has the same samples as p2, with the two alias contributions combined.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Gaussian and Simpson mass assembly give distinct exact and approximate checks

Example

Assume Countable Choice for the Lebesgue measure construction. For the degree-one monic Legendre basis P0=1,P1=x on [−1,1], the two-node Gaussian mass matrix is diag⁡(2,2/3). For the Chebyshev arcsine pairing, composite Simpson with two panels gives MS=(π00π/3),G=(π00π/2). The Simpson error in the (1,1) entry is π/6 and satisfies the itemwise error estimate.

Facts & Assumptions

Given: Countable Choice, Lebesgue measure on [−1,1], its two-node Gauss–Legendre rule, and the Chebyshev pairing sampled by two-panel composite Simpson.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed for the Lebesgue measure construction and Riemann–Lebesgue agreement used in the local two-node Gaussian calculation.

[F1]

Positive-measure Gaussian quadrature moment data, Monic orthogonal polynomials exist uniquely through the quadrature order, The m-node Gaussian quadrature rule for a positive measure, and Gaussian quadrature is exact through degree 2m−1 and has positive weights: valid order-three moment data for m=2 give the unique monic orthogonal polynomial, its two root nodes, cardinal-integral weights, and exactness through degree three.

[F2]

Legendre polynomials have explicit norms and weighted derivative orthogonality: ∫−11P02=2, ∫−11P0P1=0, and ∫−11P12=2/3.

[F3]

Assemble a weighted Galerkin mass matrix from Gaussian nodes and Gaussian quadrature exactly assembles the orthogonal Galerkin mass matrix: the mass entries are Gaussian sums and equal the corresponding exact polynomial integrals.

[F4]

Arcsine-weighted inner product on the Chebyshev interval: Gij=∫0πTi(cos⁡θ)Tj(cos⁡θ) dθ for i,j∈{0,1}.

[F5]

Composite-Simpson assembly of the Chebyshev weighted mass matrix: for two panels, MijS=π6(gij(0)+4gij(π/2)+gij(π)).

[F6]

Composite Simpson error bound for Chebyshev weighted mass entries: ∣Gij−MijS∣≤πh4(i+j)4/180 for even panel count and h=π/M.

[F7]

Chebyshev polynomials are orthogonal for the arcsine weight: the exact mass matrix for T0,T1 is diag⁡(π,π/2).

[F8]

Quarter-turn values and shifts by pi/2 and pi: cos⁡0=1, cos⁡(π/2)=0, and cos⁡π=−1.

[F12]

The Lebesgue integral is linear on L1(μ): finite linear combinations of integrable polynomial functions may be integrated termwise.

[F14]

Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0} supplies the positive root 3; Basic properties of the absolute value, A function differentiable at c is continuous at c, and Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function give continuity of ∣x∣k and the polynomial integrands, as used with [F11]. Measure monotonicity in step 1.1 follows from the measure axioms in [F10]: if A⊆B, then B=A⊔(B∖A) and μ(B)=μ(A)+μ(B∖A)≥μ(A).

Proof

1.1A1F1F10F11F14algebra

Under [A1], let μ be Lebesgue measure restricted to the relative Borel sets of [−1,1]. It is a positive measure with total mass 2 by [F10]. Every relative open neighborhood of a point of [−1,1] contains a positive-length interval, including a one-sided interval at either endpoint, so [F10] and [F14] give that neighborhood positive measure. Thus the relative support is all of [−1,1], containing at least three points. Every ∣x∣k for 0≤k≤3 is continuous and bounded on [−1,1] by [F14], so [F11] gives its integrability. These are exactly the order-three, m=2 moment-data conditions in [F1]. The primitives x,x2/2,x3/3,x4/4 give moments μ0=2,μ1=0,μ2=2/3,μ3=0 by [F11].

1.2F4F5F7F8F9algebra

By [F9], g00=1, g01=cos⁡θ, and g11=cos⁡2θ. Substitution of the quarter-turn values [F8] into [F5] gives M00S=π, M01S=0, and M11S=π/3. The exact mass matrix is G=diag⁡(π,π/2) by [F7].

2.1F1F12F14step 1.1algebra

The monic polynomial p2(x)=x2−1/3 is orthogonal to 1 and x, since μ2−μ0/3=0 and μ3−μ1/3=0 by step 1.1 and [F12]. Finite linearity extends this to every polynomial of degree below two, so uniqueness in [F1] identifies p2 with the Gaussian orthogonal polynomial. Its roots satisfy x2=1/3, hence are x1=−1/3 and x2=1/3 by [F14]. Their cardinal polynomials are ℓ1(x)=(1−3x)/2 and ℓ2(x)=(1+3x)/2, so [F12] and the first two moments give w1=w2=1. The rule Definition and exactness theorem in [F1] therefore give Q2(f)=f(−1/3)+f(1/3), exact for degrees through three.

3.1A1F1F2F3step 2.1algebra

The Gaussian sum for the basis 1,x is (1−1/311/3) ⁣T(1001)(1−1/311/3)=(2002/3). The entries agree with exact integrals by [F2], as also asserted by [F3].

4.1F6F13step 1.2algebra∎

The only nonzero entry error is ∣G11−M11S∣=π/6. The Simpson theorem [F6] applies with M=2, h=π/2, and i=j=1, and gives its bound π5/180. This bound is at least π/6, since [F13] gives π4>81>30, equivalently π5/180>π/6. Therefore the displayed finite calculation matches the general entrywise estimate.

Sources