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

Grid and common-space stability agree under uniform norm comparison

Statement

Let a finite-grid lift be as in Finite-grid restriction, reconstruction, and common-space lift over the common Banach-space interface of Common Banach-space interface for a linear IVP and its time schemes. Assume there are constants a,b,P>0, independent of ν, such that for every g∈Gν and x∈X, a∥g∥Gν≤∥Rνg∥X≤b∥g∥Gν,∥Pν∥X→Gν≤P. Then the lifted family (Sν) is stable on finite time intervals if and only if the grid-update family (Qν) is stable in the declared grid norms on finite time intervals.

Here grid stability means that for every T>0 there is CT<∞ such that ∥Qνn∥Gν→Gν≤CT whenever ν,n∈N and nτν≤T.

Facts & Assumptions

Given: The common-space and grid-lift data and uniform constants a,b,P from the statement.

[F1]

The grid lift has PνRν=IGν, U(τν)(ker⁡Pν)⊆ker⁡Pν, and Sν=RνQνPν+U(τν)(IX−RνPν) (Finite-grid restriction, reconstruction, and common-space lift).

[F2]

The exact semigroup satisfies ∥U(t)∥op≤MT for 0≤t≤T (Common Banach-space interface for a linear IVP and its time schemes).

[F3]

The operator norm is the supremum over the unit ball, so ∥Tx∥≤∥T∥op∥x∥ for every x (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[F4]

A property true at 0 and preserved by successor holds for every n∈N (The principle of mathematical induction).

Proof

1.1F1givenalgebra

The identity PνRν=I gives x=RνPνx+(IX−RνPν)x. The first term is in Rν(Gν) and the second is in ker⁡Pν. For g∈Gν, the lift satisfies SνRνg=RνQνg; for y∈ker⁡Pν, it satisfies Sνy=U(τν)y, which remains in ker⁡Pν by [F1]. Thus both summands are invariant under Sν.

2.1F1F4step 1.1algebra

Induction [F4] on n∈N, using the two invariant summands from step 1.1 and the semigroup identity U(τν)n=U(nτν), gives Sνn=RνQνnPν+U(nτν)(IX−RνPν). For n=0 the right side is RνPν+(IX−RνPν)=IX; the induction step applies RνQν on the first summand and U(τν) on the second.

3.1F1F2F3step 2.1givenalgebra

Suppose the grid updates are stable, with ∥Qνn∥Gν→Gν≤CT whenever nτν≤T. For every x∈X, step 2.1 and the comparison bounds give ∥Sνnx∥X≤bCTP∥x∥X+MT(1+bP)∥x∥X: indeed, ∥RνQνnPνx∥X≤bCTP∥x∥X and ∥U(nτν)(IX−RνPν)x∥X≤MT(1+bP)∥x∥X. Taking the supremum over ∥x∥X≤1 using [F3] proves the uniform common-space power bound, hence stability.

4.1F3step 1.1givenalgebra∎

Conversely, suppose ∥Sνn∥X→X≤CT for nτν≤T. For every g∈Gν, step 1.1 gives SνnRνg=RνQνng. The lower and upper norm comparisons and [F3] therefore give a∥Qνng∥Gν≤∥RνQνng∥X=∥SνnRνg∥X≤CT∥Rνg∥X≤CTb∥g∥Gν. Thus ∥Qνn∥Gν→Gν≤CTb/a uniformly on the same finite interval. The two stability notions are equivalent under the stated uniform comparisons.

Depends on

Used by

Dependency tree · two levels

12 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