Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

The first sine mode with matched velocity data: exact solution and the numerical tail bound 8(N+1)−4

Example

Let L>0, c>0 and define the odd 2L-periodic C∞ datum

F(x):=sin⁡(πxL),G(x):=cπLsin⁡(πxL).

Then the sine coefficients of Sine coefficients, sine series and the odd periodic extension are b1(F)=1 and bn(F)=0 for n≥2, and b1(G)=cπ/L, bn(G)=0 for n≥2; the series solution of the string theorem is the finite expression

u(t,x)=[cos⁡(ω1t)+sin⁡(ω1t)]sin⁡(πxL),ω1=cπL,

which solves utt=c2uxx with u(0,⋅)=F, ut(0,⋅)=G and u(t,0)=u(t,L)=0; its tail beyond the first mode vanishes. For each N≥1 define the matching partial sum uN(t,x):=∑n=1N[ancos⁡(ωnt)+dnsin⁡(ωnt)]sin⁡(nπx/L), where an=bn(F), dn=bn(G)/ωn and ωn=cnπ/L. The numerical bound of the string theorem at these data is

∣u(t,x)−uN(t,x)∣≤8 (N+1)−4(N≥1),

so the general bound is valid but far from sharp on this datum.

Facts & Assumptions

Given: The period L>0, wave speed c>0, the data F,G above, and ω1=cπ/L.

[L1]

Sine coefficients equal (2/L)∫0L(datum)sin⁡(nπx/L)dx; for a single sine mode sin⁡(πx/L) with the orthogonality of Sine orthogonality on a half period and the full-period integrals of odd 2L-periodic functions one gets b1=1, bn=0 for n≥2, and the function is odd and 2L-periodic (Sine coefficients, sine series and the odd periodic extension, Sine and cosine defined by their real power series, The zero sets of sine and cosine and the least positive common period 2 pi).

[L2]

The string theorem: the series (S) with an=bn(F), dn=bn(G)/ωn is C2, solves utt=c2uxx with the fixed-end conditions and the stated initial data, and obeys the tail bound with C=2(2L5M5π5+2L5M4cπ5) (The classical C2 fixed-end string: the sine series solves the wave equation with the given data, uniquely, with an explicit tail bound).

[L3]

Verification

technique · direct; identify the coefficients and evaluate the constants of the theorem
1.1givenL1algebra

By [L1], b1(F)=1, bn(F)=0 for n≥2; similarly b1(G)=cπ/L and bn(G)=0 for n≥2. Hence a1=1, d1=b1(G)/ω1=1, and all other coefficients vanish, so the series (S) collapses to u(t,x)=[cos⁡ω1t+sin⁡ω1t]sin⁡(πx/L).

2.1step 1.1L3algebra

By [L3] and step 1.1, ∂t2u=−ω12u and ∂x2u=−(π/L)2u, so utt=c2uxx; u(t,0)=u(t,L)=0; u(0,x)=sin⁡(πx/L)=F(x); and ut(0,x)=ω1sin⁡(πx/L)=G(x).

3.1step 1.1L2algebra∎

For the constant of the theorem, M5=sup⁡∣F(5)∣=(π/L)5 and M4=sup⁡∣G(4)∣=(cπ/L)(π/L)4=cπ5/L5. Hence C=2(2L5(π/L)5π5+2L5cπ5/L5cπ5)=2(2+2)=8. Since the exact tail vanishes for N≥1, the bound ∣u−uN∣≤8(N+1)−4 holds trivially for every N≥1.

Remarks

  • The finite datum exercises the theorem without any infinite tail; the numerical bound 8(N+1)−4 is valid because the general constant is valid, and the example shows explicitly that the general bound is not claimed to be sharp.

Depends on

Dependency tree · 2 levels

Sources