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.

Finite sine sums admit a backward Dirichlet heat solution

Example

For T>0 and a finite terminal sine sum g(x)=∑k=1Naksin⁡(kx) on (0,π), the function u(x,t)=∑k=1Nakek2(T−t)sin⁡(kx)(0≤t≤T) solves ut−uxx=0, vanishes at x=0 and x=π, and has u(x,T)=g(x). Every such finite terminal datum therefore has a classical backward extension, although its mode amplification grows without bound as k increases.

Facts & Assumptions

Given: T>0, a finite integer N≥1, real coefficients a1,…,aN, and the terminal sum g(x)=∑k=1Naksin⁡(kx) on (0,π).

[F1]

(sin⁡x)′=cos⁡x and (cos⁡x)′=−sin⁡x (The derivatives of sine and cosine are cosine and minus sine), so differentiating twice gives ∂x2sin⁡(kx)=−k2sin⁡(kx) by the chain rule The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c).

[F4]

sin⁡0=0 and sin⁡(kπ)=0 for every integer k (The zero sets of sine and cosine and the least positive common period 2 pi), and the cylinder vocabulary is that of Parabolic cylinder and parabolic boundary.

Verification

Given: T>0, N≥1, real a1,…,aN, the terminal sum g, and u(x,t)=∑k=1Nakek2(T−t)sin⁡(kx).

1.1F1F2given

For each k the summand uk(x,t)=akek2(T−t)sin⁡(kx) satisfies ∂tuk=−k2uk by [F2] and ∂x2uk=−k2uk by [F1], so ∂tuk−∂x2uk=0 on (0,π)×(0,T].

2.1step 1.1F3F4given

Since u is a finite sum of the summands of step 1.1, [F3] gives ∂tu=∑k∂tuk and ∂x2u=∑k∂x2uk, so ut−uxx=∑k(∂tuk−∂x2uk)=0; moreover u(0,t)=∑kaksin⁡0=0 and u(π,t)=∑kaksin⁡(kπ)=0 for every t by [F4], while u(x,T)=∑kaksin⁡(kx)=g(x) because e0=1; the sum is smooth because it has finitely many smooth summands.

3.1step 2.1given∎

Step 2.1 exhibits, for every finite terminal sine sum g, the classical backward solution u on the closed rectangle, so existence is unconditional for finite data; the k-th summand carries the factor ek2(T−t), which equals ek2T at t=0 and grows without bound as k increases, so no uniform amplification bound over all k is claimed, in agreement with the example's final sentence and the unboundedness of the backward solution map.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

36 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