Alphabeta Math
Pipeline-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.

✓ 3 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 3 also cleared it.

Linear scheme stability and Lax equivalence

1 · Prerequisites

2 · Summary

This page defines a common Banach-space interface for a well-posed autonomous linear initial-value problem and its time-stepping family. Consistency is checked on a dense invariant subspace; convergence and stability use one common norm and uniform finite-time bounds. The Lax equivalence proof gives the Duhamel error sum in the stable-to-convergent direction and uses the DC-qualified Banach–Steinhaus theorem in the reverse direction. Finite-grid restriction and reconstruction are explicit: a grid-norm stability claim reaches the common space under the sufficient uniform operator and norm-comparison bounds of the transfer lemma. Spectral-radius or CFL tests alone do not replace that power bound.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Common Banach-space interface for a linear IVP and its time schemes

Definition

Fix a scalar field K∈{R,C}. A common-space linear IVP interface consists of a Banach space X over K and a strongly continuous semigroup U(t)∈B(X), t≥0, as defined in Strongly continuous semigroup, together with a finite-time bound: for each T>0 there is MT<∞ such that sup⁡0≤t≤T∥U(t)∥≤MT. The solution with initial value x∈X is u(t)=U(t)x. This definition records the solution operators and their continuous dependence in the same norm; it makes no claim about a generator domain.

A consistency subspace is a dense linear subspace D⊆X satisfying U(t)D⊆D for every t≥0. Here dense means D‾ X=X, and invariant means the displayed inclusion. It need not be the domain of a differential generator.

A common-space time-scheme family is a sequence of positive time steps (τν)ν∈N with τν→0 and bounded linear maps Sν:X→X in the sense of A bounded linear operator between normed spaces. Write Sν0=IX and recursively set Sνn+1=SνSνn for n∈N. These powers are uniquely defined by the recursion theorem (The recursion theorem) on the set B(X) of bounded linear operators (The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators): for fixed Sν, the map T↦SνT preserves B(X) because composition preserves linearity and multiplies operator bounds, and IX∈B(X) with bound 1. All scheme and solution errors below use the norm of this same space X; write ∥⋅∥ for that norm and ∥⋅∥op for the operator norm of The operator norm as the least bound and as the unit-sphere or unit-ball supremum.

The family is consistent on D when for every x∈D and T>0, lim⁡ν→∞max⁡r∈Nrτν≤T∥(Sν−U(τν))U(rτν)x∥τν=0. The maximum is over a nonempty finite set because it includes r=0. This is the local defect divided by one time step, uniformly over the exact orbit on the finite time interval.

The family is stable on finite time intervals when for every T>0 there is CT<∞ such that ∥Sνn∥op≤CTwhenever ν,n∈N and nτν≤T. It is convergent on finite time intervals when for every x∈X and T>0, lim⁡ν→∞max⁡n∈Nnτν≤T∥Sνnx−U(nτν)x∥=0. The maximum convention includes time zero. This locally uniform-in-grid-time convergence is the hypothesis used for the reverse implication in the equivalence theorem below.

Remarks

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The diagonal heat semigroup on c0 is contractive and strongly continuous

Statement

Let K∈{R,C} and let X=c0(K) with the supremum norm, as in The sequence spaces c_0 and ell-infinity. For t≥0 define U(t)x=(exp⁡(−j2t)xj)j∈N. Then U(t) is a strongly continuous semigroup on the Banach space X and ∥U(t)∥op≤1(t≥0).

Facts & Assumptions

Given: K∈{R,C} and X=c0(K).

[F1]

The space c0(K) consists of scalar sequences tending to zero and has norm ∥x∥∞=sup⁡j∣xj∣ (The sequence spaces c_0 and ell-infinity).

[F2]

With this norm, real and complex c0 are Banach spaces (Real and complex c0 are Banach).

[F4]

The real exponential is continuous and strictly increasing (The exponential function is strictly increasing).

[F6]

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

Proof

1.1F1F4F5F6given

For t≥0 and j∈N, [F4] and [F5] give 0<exp⁡(−j2t)≤exp⁡(0)=1. Thus the coordinate formula is linear and ∥U(t)x∥∞≤∥x∥∞. If x∈c0 and ε>0, choose N so that ∣xj∣<ε for all j≥N; then ∣(U(t)x)j∣≤∣xj∣<ε for j≥N. So U(t)x∈c0, U(t) is bounded, and [F6] gives ∥U(t)∥op≤1.

2.1F3step 1.1algebra

Since exp⁡(0)=1, U(0)=IX. For s,t≥0, [F3] gives U(t)U(s)x=(exp⁡(−j2t)exp⁡(−j2s)xj)j=(exp⁡(−j2(t+s))xj)j=U(t+s)x. Thus the semigroup identities hold on every coordinate and hence on X.

2.2F1F4step 1.1choose

Fix x∈X, t0≥0, and ε>0. By [F1], choose N such that ∣xj∣<ε/3 for j≥N. For those indices, ∣exp⁡(−j2t)−exp⁡(−j2t0)∣ ∣xj∣<ε/3 for every t≥0, because both exponential factors lie in [0,1]. For the finitely many indices j<N, continuity in [F4] supplies a common δ>0 such that the same coordinate differences are below ε/3 whenever t≥0 and ∣t−t0∣<δ. Taking the supremum over all coordinates proves ∥U(t)x−U(t0)x∥∞<ε. Therefore every orbit is continuous, so U is strongly continuous.

3.1F2step 1.1step 2.1step 2.2∎

The boundedness in step 1.1 holds for every t, so for each T>0, sup⁡0≤t≤T∥U(t)∥op≤1. Together with the Banach property [F2], the semigroup identities in step 2.1, and strong continuity in step 2.2, this proves the statement.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-grid restriction, reconstruction, and common-space lift

Definition

Let (X,U,D,(τν)) be a common-space IVP interface from Common Banach-space interface for a linear IVP and its time schemes. A finite grid space Gν is a normed vector space spanned by a possibly empty finite list over the same field K. A grid realization consists, for each ν, of bounded linear maps Pν:X→Gν,Rν:Gν→X,Qν:Gν→Gν, where bounded linearity is in the sense of A bounded linear operator between normed spaces, such that PνRν=IGν and U(τν)(ker⁡Pν)⊆ker⁡Pν,ker⁡Pν:={x∈X:Pνx=0}. Here Pν is restriction to grid data, Rν reconstructs grid data in X, and Qν is the one-step grid update.

The common-space lift of the grid update is Sν:=RνQνPν+U(τν)(IX−RνPν). The first summand advances the reconstructed grid component; the second continues the exact semigroup on the complementary component. The lift is bounded because all factors are bounded. More explicitly, if cP,cR,cQ bound Pν,Rν,Qν and cU bounds U(τν), then ∥Sνx∥≤(cRcQcP+cU(1+cRcP))∥x∥ by the factor bounds and the triangle inequality. This finite bound proves that Sν is bounded. The invariance hypothesis on ker⁡Pν is used later to identify the lift's powers when comparing grid and common-space stability. This definition is an analysis interface; it does not assert that evaluating the complementary semigroup is part of a finite-grid implementation.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Lax equivalence for a common Banach-space scheme

Statement

Assume the Axiom of Dependent Choice (DC). Let a common-space IVP interface and bounded time-scheme family be given as in Common Banach-space interface for a linear IVP and its time schemes. If the scheme is consistent on its dense invariant subspace, then it is convergent on every finite time interval if and only if it is stable there, with stability, consistency, and convergence all measured in the same norm of X.

Facts & Assumptions

Given: DC; a common-space scheme interface as in the statement; and consistency on its dense invariant subspace.

[F1]

The common-space interface supplies a Banach space X, bounded linear steps Sν, positive time steps τν→0, a dense invariant consistency subspace D, a strongly continuous solution semigroup with sup⁡0≤t≤T∥U(t)∥op≤MT, and same-norm definitions of consistency, finite-time stability, and convergence (Common Banach-space interface for a linear IVP and its time schemes).

[F2]

For a set-family of bounded linear maps from a Banach space, pointwise boundedness implies a uniform operator-norm bound under DC (Uniform boundedness principle).

[A1]

DC is the dependent-choice axiom stated in The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain; it is the explicit axiom assumed by [F2].

Proof

1.1F1given

Fix T>0 and suppose the family is stable, with a bound CT from [F1]. For x∈D, set ην(x,T):=max⁡r∈Nrτν≤T∥(Sν−U(τν))U(rτν)x∥τν. Consistency says ην(x,T)→0 for each x∈D.

1.2F1algebra

For each integer n≥0, the finite telescoping identity is Sνn−U(nτν)=∑r=0n−1Sνn−1−r(Sν−U(τν))U(rτν). For n=0 both sides are zero. For n≥1, expand each summand as Sνn−rU(rτν)−Sνn−1−rU((r+1)τν); adjacent terms cancel, leaving Sνn−U(nτν).

1.3F1given

Conversely, suppose the family is convergent. Fix T>0 and x∈X. By convergence, for all sufficiently large ν, max⁡nτν≤T∥Sνnx−U(nτν)x∥≤1. The finite-time solution bound in [F1] then gives max⁡nτν≤T∥Sνnx∥≤MT∥x∥+1 for those ν.

2.1F1step 1.2algebra

If x∈D and nτν≤T, [F1], step 1.2, and the definition of ην yield ∥Sνnx−U(nτν)x∥≤CT∑r=0n−1∥(Sν−U(τν))U(rτν)x∥≤CTnτνην(x,T)≤CTTην(x,T). The last quantity tends to zero independently of the allowed n.

2.2F1F3step 1.3algebra

Only finitely many indices ν were omitted in step 1.3. For each fixed omitted ν, there are only finitely many integers n with nτν≤T, and each Sνnx is a vector of finite norm. Thus the powers are pointwise bounded on every x∈X. The admissible index set IT:={(ν,n)∈N×N:nτν≤T} exists by Separation; each pair determines a unique bounded linear operator Sνn, so Replacement gives the set-family FT:={Sνn:(ν,n)∈IT}. For fixed ν, boundedness supplies a finite Kν≥1 with ∥Sνz∥≤Kν∥z∥. The identity Sν0=I is linear with bound 1=Kν0; if Sνn is linear with bound Kνn, then Sνn+1=SνSνn is linear and ∥Sνn+1z∥≤Kν∥Sνnz∥≤Kνn+1∥z∥. Finite induction therefore proves every member of FT bounded and linear. This argument fixes one ν at a time and chooses no sequence of bounds. Also X is Banach by [F1].

3.1F1step 2.1choosealgebra

Let x∈X and ε>0. By density in [F1], choose y∈D with ∥x−y∥<ε/[2(1+CT+MT)]. For every nτν≤T, ∥Sνnx−U(nτν)x∥≤(CT+MT)∥x−y∥+∥Sνny−U(nτν)y∥. By step 2.1, the second term is below ε/2 for all such n once ν is sufficiently large. This proves convergence for x, uniformly over the grid times in [0,T]. Since x,T were arbitrary, stability implies convergence.

4.1F1F2A1step 2.2step 3.1∎

Apply the uniform boundedness principle [F2] to FT, using the explicit DC assumption [A1]. It gives sup⁡ν,n∈Nnτν≤T∥Sνn∥op<∞, which is stability on [0,T]. Since T>0 was arbitrary, convergence implies stability; together with step 3.1 this proves the equivalence.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

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.

5 · Examples, counterexamples and false statements

None yet.

Sources