Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Composite Simpson error bound for Chebyshev weighted mass entries

Statement

Let N≥0, let M≥2 be even, put h=π/M, and let Gij=⟨Ti,Tj⟩C be the exact weighted mass entry from Arcsine-weighted inner product on the Chebyshev interval. The approximation MijS from Composite-Simpson assembly of the Chebyshev weighted mass matrix satisfies

∣Gij−MijS∣≤πh4180(i+j)4,0≤i,j≤N.

Facts & Assumptions

Given: Integers N≥0, even M≥2, h=π/M, and indices 0≤i,j≤N.

[F1]

Arcsine-weighted inner product on the Chebyshev interval: ⟨Ti,Tj⟩C=∫0πTi(cos⁡θ)Tj(cos⁡θ) dθ.

[F2]

Composite-Simpson assembly of the Chebyshev weighted mass matrix: MijS is the composite Simpson value on [0,π] for gij(θ)=Ti(cos⁡θ)Tj(cos⁡θ) with step h.

[F3]

Composite Simpson error bound for a four-times continuously differentiable function: if g∈C4([0,π]), then ∣∫0πg−QS(g;0,π,M)∣≤πh4max⁡∣g(4)∣/180.

[F4]

Tn(cos⁡θ)=cos⁡(nθ) and Un(cos⁡θ)sin⁡θ=sin⁡((n+1)θ) for every n∈N and The addition formulas for sine and cosine: Tk(cos⁡θ)=cos⁡(kθ) and 2cos⁡ucos⁡v=cos⁡(u+v)+cos⁡(u−v).

Proof

1.1givenF4F5algebra

By [F4], gij(θ)=12{cos⁡((i+j)θ)+cos⁡((i−j)θ)}. By [F5] this finite trigonometric expression is C4 on [0,π], and its fourth derivative is gij(4)(θ)=12{(i+j)4cos⁡((i+j)θ)+(i−j)4cos⁡((i−j)θ)}. Therefore max⁡[0,π]∣gij(4)∣≤12((i+j)4+∣i−j∣4)≤(i+j)4. This also covers i=j=0, when the fourth derivative is zero.

2.1F1F2F3step 1.1∎

Apply [F3] to gij and use [F1]–[F2] to identify the exact integral and the Simpson approximation. The derivative bound in step 1.1 gives the claimed entrywise error.

Depends on

Used by

Dependency tree · two levels

49 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