Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Displacement data versus velocity data in one dimension

Example

Let c>0, a>0, t≥0, and let u0∈Cc2(R) and u1∈Cc1(R), with supp⁡u0,supp⁡u1⊆[−a,a]. The two terms of the classical d'Alembert formula of d'Alembert's formula and uniqueness in one dimension behave differently: (i) pure displacement, u1=0: u(x,t)=12(u0(x−ct)+u0(x+ct)) is the sum of two half-amplitude copies of the profile translating rigidly at speed c; each component preserves its own values and the support lies in [−a−ct,a+ct]. (ii) pure velocity, u0=0: u(x,t)=12c∫x−ctx+ctu1 is t times the interval average of u1 for t>0, and hence is an integral over a growing interval: where the whole support of u1 lies inside the interval the value is the constant 12c∫u1, and the profile is smoothed by integration rather than generally undergoing a rigid translation. For the bounded indicator extension u1=1[−a,a], this integral is the expanding plateau of A compactly supported velocity datum produces an expanding interval; that indicator example describes the formula extension, while the present Cauchy-problem data are classical. Both classical solutions are supported in [−a−ct,a+ct], consistent with The one-dimensional value depends on the characteristic interval.

Facts & Assumptions

Given: a speed c>0, a>0, compactly supported data u0∈Cc2(R), u1∈Cc1(R) with supports in [−a,a], and the classical d'Alembert solution u of d'Alembert's formula and uniqueness in one dimension.

[F1]

For admissible data the d'Alembert solution is u(x,t)=12(u0(x−ct)+u0(x+ct))+12c∫x−ctx+ctu1(y) dy (d'Alembert's formula and uniqueness in one dimension, The d'Alembert expression attains both initial data).

[F2]

The value at (x,t) depends on the data only through their restrictions to [x−ct,x+ct] (The one-dimensional value depends on the characteristic interval).

[F3]

For u1=1[−a,a] the integral extension is the expanding plateau computed in A compactly supported velocity datum produces an expanding interval.

Verification

1.1F1algebra

Pure displacement. Setting u1=0 in [F1] leaves u(x,t)=12u0(x−ct)+12u0(x+ct). Each summand is a rigid translate of the half-amplitude profile u0/2. Their supports lie in the translates [−a+ct,a+ct] and [−a−ct,a−ct], so the total support lies in [−a−ct,a+ct]. Where the two profiles overlap they add, and can reinforce or cancel; preservation of amplitude is a claim about the individual translating summands.

1.2F1F3algebra

Pure velocity. Setting u0=0 leaves u(x,t)=12c∫x−ctx+ctu1, the overlap integral of the datum with the interval [x−ct,x+ct], which equals the constant 12c∫u1 whenever supp⁡u1⊆[x−ct,x+ct]; for u1∈Cc1 the profile gains one derivative and generally changes shape through integration rather than translating a fixed profile. The bounded indicator extension in [F3] has the exact plateau computed there, though the present classical solution claim uses the stated Cc1 data.

2.1F1F2algebra∎

Support. In both cases the data vanish outside [−a,a], so by [F1] the value is zero unless [x−ct,x+ct]∩[−a,a]≠∅, that is unless ∣x∣≤a+ct; continuity of the compactly supported data makes the value zero also at ∣x∣=a+ct; this is the one-dimensional instance of the domain of dependence [F2].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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