Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Diagonal Dirichlet sine-mode heat model with constant forcing

Definition

Let I={k∈N:k≥1} and H=ℓ2(I,R), with square-summability as in Square-summable families on an arbitrary index set and the space ℓ2(I). All modal coordinates below are indexed by k∈I. Define the diagonal operator A by D(A)={u∈H:∑k≥1k4∣uk∣2<∞},(Au)k=−k2uk. Let g∈H be the fixed sequence gk=1/k for odd k and gk=0 for even k; membership follows from The p-series for a real exponent p converges exactly when p is greater than one with exponent 2. The split evolution is u′=Au+g. For t≥0, define the exact diagonal subflow Etu=(exp⁡(−k2t)uk)k≥1 and the exact translation subflow Btu=u+tg. By The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x) and The exponential function is strictly increasing, 0<exp⁡(−k2t)≤1, so each Et maps H to itself; each Bt does so because g∈H. The associated Strang modal step is Sh=Eh/2∘Bh∘Eh/2,h>0, where the rightmost map is applied first. Each coordinate of Et solves uk′=−k2uk, and each coordinate of Bt solves uk′=gk. This is a precisely defined sequence-space model; it records one Dirichlet sine-mode boundary mismatch and makes no general convergence assertion for unbounded PDE operators.

Depends on

Used by

Dependency tree · two levels

40 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