Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Exact exponential stepping captures nonnormal transient growth

Statement

Let A=(−12e0−1),g=0,y(0)=(01). Here nonnormal means AA∗≠A∗A. Compute the exact solution, show its norm grows above its initial value before decaying, and verify that exact-action exponential Euler and ETD2 reproduce it at every grid point.

Facts & Assumptions

Given: The finite matrix, zero nonlinear term, initial state, and methods of Exponential Euler and the two-stage ETD2 step maps.

[F1]

Exponential Euler and the two-stage ETD2 step maps: when g=0, both exact maps reduce to y↦ehAy.

[F2]

The exponential series of a bounded operator: the finite-matrix exponential is defined by its convergent series and satisfies e(r+s)A=erAesA.

[F6]
[F7]

Variation of constants for a finite-matrix semilinear system: when g=0, a solution satisfies y(t)=etAy(0).

[A1]

The exact IVP starts at the stated y(0) and has g=0.

Verification

1.1givenF2F3F4inductionalgebra

Write A=−I+N with N=(02e00); direct multiplication gives N2=0 [F4]. The formula holds for n=1 since A=−I+N. If An=(−1)nI+n(−1)n−1N, multiplying by A=−I+N and using N2=0 gives An+1=(−1)n+1I+(n+1)(−1)nN, so induction proves it for every n≥1. Substituting in the absolutely convergent matrix-exponential series [F2] gives etA=e−tI+∑n≥1tn(−1)n−1N/(n−1)!=e−t(I+tN) by the scalar series [F3].

2.1A1F3F4F5F6F7step 1.1algebra

By [F7] and step 1.1, the solution is y(t)=e−t(2et,1)T. Direct multiplication using [F4] gives AA∗=(1+4e2−2e−2e1) and A∗A=(1−2e−2e1+4e2), which differ, so A is nonnormal. By [F5] and [F6], its initial norm is 1, whereas ∥y(1)∥2=e−14e2+1>2. For t>0, the exponential series gives et≥t2/2, and [F6] gives e−t=1/et≤2/t2; hence e−t→0 and te−t≤2/t→0, so y(t)→0.

3.1F1F2step 1.1algebrainduction∎

By [F1], every exact-action step is multiplication by ehA. Repeated use of the semigroup identity in [F2] gives (ehA)n=enhA, so the method returns y(tn) at every grid point. The transient growth is therefore present in the exact linear flow and is not removed by exponentiating this nonnormal matrix.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

56 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