Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

One-step stability after removing the exact linear flow

Statement

Fix T>0, A∈Md(C), and define K+:=sup⁡0≤r≤T∥erA∥2,K−:=sup⁡0≤r≤T∥e−rA∥2,κ:=LK+K−. These constants are finite by continuity of the finite-matrix exponential. Let g be L-Lipschitz in its state variable on a common tube containing all states and stages below. For 0<h≤T and an admissible t, define the transformed maps ΘhE(t,z):=e−(t+h)AΨhE(t,etAz),Θh2(t,z):=e−(t+h)AΨh2(t,etAz). Then ∥ΘhE(t,z)−ΘhE(t,w)∥2≤(1+κh)∥z−w∥2, and ∥Θh2(t,z)−Θh2(t,w)∥2≤(1+h(κ+Tκ22))∥z−w∥2.

Facts & Assumptions

Given: The finite matrix, interval, methods, Lipschitz constant, and tube in the Statement.

[F1]

Exponential Euler and the two-stage ETD2 step maps: ΨhE and Ψh2 have the displayed exponential Euler and ETD2 formulas, with the predictor ah(t,y)=ΨhE(t,y).

[F2]

Integral representations of the first two phi functions: φ1(X)=∫01e(1−θ)Xdθ and φ2(X)=∫01θe(1−θ)Xdθ.

[F5]

The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2 and For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable: products obey ∥ST∥2≤∥S∥2∥T∥2, and vector integrals obey ∥∫v∥2≤∫∥v∥2.

[F6]

The exponential series of a bounded operator: for finite A on the finite-dimensional Banach space Cd, ∥e±rA∥2≤er∥A∥2 for 0≤r≤T. For 0≤r≤T, nonnegativity of ∥A∥2 gives r∥A∥2≤T∥A∥2, so scalar exponential monotonicity (The exponential function is strictly increasing) gives er∥A∥2≤eT∥A∥2. Both sets contain ∥Id∥2 at r=0 and are therefore bounded above by eT∥A∥2; Dedekind completeness: the least-upper-bound property supplies finite suprema.

[F7]

C is the real coordinate plane, with coordinate arithmetic, The standard formulas ⟨x,y⟩=∑k<nxkyk on Rn and ∑k<nxkyk‾ on Cn are inner products, and The norm ∥v∥=⟨v,v⟩ induced by a real or complex inner product: for v=(v0,…,vd−1), Φd(v):=(Re⁡v0,Im⁡v0,…,Re⁡vd−1,Im⁡vd−1) is real-linear and satisfies ∥Φd(v)∥R2d2=∑j<d∣vj∣2=∥v∥22. Thus the real vector-integral estimate [F5] applies to the complex-valued integrands with the same norms.

[A1]

On the stated tube, ∥g(r,u)−g(r,v)∥2≤L∥u−v∥2, and all transformed inputs and ETD2 predictor stages considered in the Statement remain admissible.

Proof

1.1givenF1F2F3F4F5F6F7A1algebra

By [F6], the defining sets are nonempty and bounded, so K+ and K− are finite. Substituting etAz into the exponential Euler formula and using [F2]–[F3] gives ΘhE(t,z)=z+∫0he−(t+s)Ag(t,etAz) ds. For z,w, [A1] and [F4] bound the integrand difference by K−LK+∥z−w∥2=κ∥z−w∥2; by [F7] the real integral norm inequality [F5] applies and integration over length h proves the first inequality.

2.1step 1.1F3algebra

Let at(z):=ah(t,etAz). The same identity as in step 1.1 gives e−(t+h)Aat(z)=ΘhE(t,z), hence [F3] and the first bound imply ∥at(z)−at(w)∥2≤K+(1+κh)∥z−w∥2.

3.1givenF1F2F4F5F7A1step 2.1algebra∎

Applying [F2] to both ETD2 coefficients gives Θh2(t,z)=z+∫0he−(t+s)A[(1−s/h)g(t,etAz)+(s/h)g(t+h,at(z))] ds. By [A1] and step 2.1, the bracket difference for z,w has norm at most LK+[(1−s/h)+(1+κh)s/h]∥z−w∥2. Multiplying by the kernel bound K− and applying [F7] to use the real integral norm bound [F5] gives coefficient 1+κh+κ2h2/2, since both weight integrals equal h/2. As h≤T, this is at most 1+h(κ+Tκ2/2).

Depends on

Used by

Dependency tree · two levels

79 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