Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

d'Alembert's formula solves the wave equation, is the unique C2 solution, and the fixed-end sine modes solve it exactly

Statement

Let c>0.

(a) The formula. For every f∈C2(R) and g∈C1(R), the function

u(t,x):=f(x−ct)+f(x+ct)2+12c∫x−ctx+ctg(s) ds((t,x)∈R2)

is of class C2 (Ck Euclidean maps and diffeomorphisms) and satisfies

utt=c2uxx,u(0,x)=f(x),ut(0,x)=g(x)

for every x∈R (The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf, The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set).

(b) Uniqueness. If u∈C2(R2) satisfies utt=c2uxx with u(0,⋅)=f and ut(0,⋅)=g for f∈C2(R), g∈C1(R), then u equals the formula in (a).

(c) Fixed ends and modes. Let L>0 and, for each integer n≥1,

un(t,x):=sin⁡ ⁣(nπxL)cos⁡ ⁣(nπctL).

Then each un is C∞ on R2, satisfies utt=c2uxx, vanishes at x=0 and x=L for every t, and has un(0,x)=sin⁡(nπx/L), ∂tun(0,x)=0. Every finite sum ∑n≤Nαnun+βnvn with the companion modes vn(t,x):=sin⁡(nπx/L)sin⁡(nπct/L)/(nπc/L) also solves the equation, vanishes at both ends and has the corresponding finite initial data.

Facts & Assumptions

Given: The wave speed c>0; data f∈C2(R), g∈C1(R) in (a), (b); L>0 and the modes in (c).

[F3]
[F4]

If q is C2 on an open neighbourhood of a point (t,x), then qtx=qxt there. For small h,k>0, the divided rectangular increment of q over [t,t+h]×[x,x+k] equals the average of each mixed partial in its corresponding iterated order, by the one-variable fundamental theorem; continuity of the second partials makes the two averages tend to the respective mixed partial values, which must therefore agree (The first fundamental theorem: if f is integrable on [a,b] and continuous at c, then F′(c)=f(c); in particular a continuous f has F as a primitive, A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion).

Proof

technique · direct; differentiate the explicit formula, then split the solution into the two characteristic combinations for uniqueness, and verify the modes by substitution
1.1givenF1F2algebra

By [F1] write F(x)=∫0xg; then u(t,x)=f(x−ct)+f(x+ct)2+F(x+ct)−F(x−ct)2c. By [F2] (affine chain rule) and [F1], this is C2 in (t,x) and ut=−cf′(x−ct)+cf′(x+ct)2+g(x+ct)+g(x−ct)2,ux=f′(x−ct)+f′(x+ct)2+g(x+ct)−g(x−ct)2c.

1.2givenF2F4algebra

(Uniqueness.) For a C2 solution u set v:=ut+cux and w:=ut−cux. By [F2] and the mixed-partial identity [F4], vt−cvx=utt+cuxt−cutx−c2uxx=0 and wt+cwx=utt−cuxt+cutx−c2uxx=0. Hence s↦v(s,x0−cs) is constant for every fixed x0: its derivative is vt−cvx=0 by [F2], so v(t,x)=v(0,x+ct)=g(x+ct)+cf′(x+ct) for every (t,x). Likewise w(t,x)=w(0,x−ct)=g(x−ct)−cf′(x−ct).

2.1step 1.1F1F2algebra

Differentiating again by [F2] and [F1], utt=c2f′′(x−ct)+c2f′′(x+ct)2+c g′(x+ct)−c g′(x−ct)2,uxx=f′′(x−ct)+f′′(x+ct)2+g′(x+ct)−g′(x−ct)2c. Hence utt=c2uxx. Evaluating step 1.1 at t=0 gives u(0,x)=f(x) and ut(0,x)=−cf′(x)+cf′(x)2+g(x)+g(x)2=g(x). This proves (a).

2.2step 1.2F1F2algebra

From step 1.2, ut=v+w2=g(x+ct)+g(x−ct)2+c f′(x+ct)−c f′(x−ct)2. Since s↦u(s,x) is differentiable with derivative ut(s,x), the fundamental theorem [F1] gives u(t,x)−f(x)=∫0tut(s,x) ds. Substituting step 1.2 and integrating with [F1] (the substitutions y=x+cs and y=x−cs are affine) yields ∫0tg(x+cs)+g(x−cs)2ds=F(x+ct)−F(x−ct)2c,∫0tc f′(x+cs)−c f′(x−cs)2ds=f(x+ct)+f(x−ct)2−f(x). Adding and cancelling f(x) identifies u with the formula of (a). This proves (b).

3.1givenF2F3algebra∎

(Modes.) Fix n≥1 and put θ:=nπx/L, φ:=nπct/L. By [F2], un is C∞ with un,tt=−(nπc/L)2un and un,xx=−(nπ/L)2un, so un,tt=c2un,xx. By [F3], un(t,0)=sin⁡0=0 and un(t,L)=sin⁡(nπ)cos⁡φ=0; un(0,x)=sin⁡θcos⁡0=sin⁡θ and ∂tun(0,x)=−(nπc/L)sin⁡θsin⁡0=0. The companion mode vn=(L/(nπc))sin⁡θsin⁡φ satisfies vn,tt=−(nπc/L)2vn and vn,xx=−(nπ/L)2vn by the same computation, has vn(0,x)=0 and ∂tvn(0,x)=sin⁡θ, and vanishes at both ends. Finite sums solve the linear equation and the boundary conditions because derivatives and finite sums commute; they have the corresponding finite initial data. This proves (c).

Remarks

  • Parts (a) and (b) are stated on all of R2 for C2 data; no weaker regularity, no distributional solutions, and no boundary conditions enter. The formula requires f∈C2, g∈C1 exactly so that the displayed second derivatives exist and are continuous.

  • The modes in (c) are exact solutions of the equation and of the two endpoint conditions; they are not asserted to exhaust the solutions with fixed ends, and no infinite-series representation is claimed here. The companion modes vn are normalized so that ∂tvn(0,⋅)=sin⁡(nπx/L); their amplitude factor has time units divided by the corresponding velocity when units are declared in a consuming model.

Depends on

Dependency tree · 2 levels

Sources