Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: 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.

Backward heat amplifies small high-frequency errors

Statement refuted

Assume Countable Choice. The claim refuted is that the backward heat problem on (0,π) depends continuously on its terminal data in the L2(0,π) norm: arbitrarily small terminal perturbations do not, in general, produce small perturbations of the initial state.

Facts & Assumptions

Given: Countable Choice and T>0 and, for every integer k≥1, the k-th decaying sine mode u~k(x,t)=e−k2tsin⁡(kx) on (0,π).

[F1]

Each u~k is a classical solution of ut=uxx on (0,π)×(0,T] with zero Dirichlet data, smooth up to t=0, with amplification factor ek2T between terminal and initial data (Sine modes decay under Dirichlet heat flow, The backward heat solution map is unbounded).

[F2]

The L2(0,π) inner product is ⟨f,g⟩=∫0πfg on the quotient space of The space Lp(μ) as the quotient by null functions (L2 with the integral pairing is a Hilbert space), and ∥sin⁡(k⋅)∥2=π/2 (L2 normalisation of the sine modes on an interval); the derivative identities for sine are those of The derivatives of sine and cosine are cosine and minus sine.

[F3]

e−k2T→0 faster than every polynomial as k→∞ (The exponential dominates every fixed nonnegative integer power at +∞).

Counterexample

Given: Countable Choice and T>0 and the modes u~k(x,t)=e−k2tsin⁡(kx).

1.1F1F2given

For every k the function u~k is a classical solution of ut=uxx on (0,π)×(0,T] with u~k(0,t)=u~k(π,t)=0, terminal data gk(x):=e−k2Tsin⁡(kx) and initial state u~k(x,0)=sin⁡(kx).

2.1step 1.1F1F2given

By [F2] the terminal data have norm ∥gk∥2=e−k2T∥sin⁡(k⋅)∥2=π/2 e−k2T, while the initial states satisfy ∥u~k(⋅,0)∥2=∥sin⁡(k⋅)∥2=π/2 for every k; moreover u~k(⋅,0)=ek2Tgk, so the terminal-to-initial amplification factor of the k-th mode is exactly ek2T.

3.1step 2.1F3given∎

By [F3] the terminal norms ∥gk∥2=π/2e−k2T tend to 0 while the initial norms remain the fixed constant π/2, so terminal perturbations of arbitrarily small L2 norm come from solutions whose initial states have order-one norm; this refutes continuous dependence on the terminal data, and the amplification is a failure of stability rather than of existence (the solution pair is explicit for every k).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

45 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