Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck pass
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.

A one-dimensional Arnoldi projection misses a slow mode of a stiff diagonal matrix

Statement

Let A=diag⁡(−100,−1), v=(1,1)T, t=1/10, and use one Arnoldi step (m=1). Compute the projected exponential action, compare it exactly with etAv, and evaluate the residual-integral bound.

Facts & Assumptions

Given: The stated real diagonal matrix, nonzero starting vector, time, and exact-arithmetic Arnoldi run with m=1.

[F1]

The Arnoldi process for building an orthonormal basis of a Krylov subspace and Before breakdown, Arnoldi produces an orthonormal Krylov basis and a rectangular upper-Hessenberg factorization: the first Arnoldi vector is q1=v/∥v∥2, H1=q1∗Aq1, and Aq1=H1q1+h2,1q2 when the residual is nonzero.

[F2]

Arnoldi projection for exponential and phi-function actions: for k=0, the exact projected action is ∥v∥2V1etH1e1.

[F3]

Arnoldi action error is the semigroup-weighted residual integral: with exact Arnoldi and exact reduced action, zero initial mismatch, and D=Ω=0, the error is bounded by the semigroup-weighted integral of h2,1∣e1∗c(s)∣, where c(s)=esH1∥v∥2e1.

[F4]

The phi-function family by everywhere-convergent series: the diagonal exponential acts entrywise by the scalar exponential series.

[F5]

The Euclidean logarithmic norm of a complex matrix: μ2(A) is the largest eigenvalue of the Hermitian part (A+A∗)/2.

[F6]
[F7]

exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential: the complex exponential satisfies its addition law and agrees with the real exponential on real inputs.

[F8]

The exponential function is smooth and (exp⁡)′=exp⁡: (exp⁡x)′=exp⁡x for real x.

[F10]

If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz: for a continuously differentiable real scalar function, its definite integral is the endpoint difference of an antiderivative.

[F11]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real-valued function on a nondegenerate closed bounded interval is Riemann integrable.

Proof

1.1givenF1algebra

We have ∥v∥2=2 and q1=(1,1)T/2. Thus H1=q1∗Aq1=−101/2. The Arnoldi residual is Aq1−H1q1=(−99,99)T/(22), so its norm is 99/2 and its normalization is q2=(−1,1)T/2.

2.1givenstep 1.1F2F4F6F7algebra

By [F2], the projected action is 2q1e−101/20=e−101/20(1,1)T. By [F4], the exact action is (e−10,e−1/10)T. Its exact error vector is (e−10−e−101/20,e−1/10−e−101/20)T, which is nonzero because [F7] identifies these real-argument complex exponentials with the real exponential, and −1/10≠−101/20 with injectivity from [F6].

3.1givenF3F5F7F8F9F10F11step 1.1algebra∎

The matrix is Hermitian with largest eigenvalue −1, so [F5] gives μ2(A)=−1. Here c(s)=2e−101s/2 and the initial mismatch v−2q1 is zero. By [F3], the certificate is ∥etAv−V1etH12e1∥2≤∫01/10e−(1/10−s)(99/2)2e−101s/2 ds. By the addition law [F7] its integrand is e−1/10(99/2)2e−99s/2, a continuous real function on [0,1/10] and hence integrable by [F11]. The antiderivative −(2/99)e−99s/2 follows from [F8] and [F9]; applying [F10] yields the bound 2e−1/10(1−e−99/20). Thus the slow component e−1/10 is missed by the one-dimensional projection even though the residual certificate applies.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

92 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