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.
Linear scheme stability and Lax equivalence
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Approximation and Compactness in C(K)
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Geometric Hahn Banach and Convex Separation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Reflexivity and Eberlein Smulian
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Strongly Continuous Semigroups and Hille Yosida
- Suprema and Infima
- The Baire Principles of Functional Analysis
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
Common Banach-space interface for a linear IVP and its time schemes
Definition
Fix a scalar field . A common-space linear IVP interface consists of a Banach space over and a strongly continuous semigroup , , as defined in Strongly continuous semigroup, together with a finite-time bound: for each there is such that The solution with initial value is . 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 satisfying for every . Here dense means , 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 with and bounded linear maps in the sense of A bounded linear operator between normed spaces. Write and recursively set for . These powers are uniquely defined by the recursion theorem (The recursion theorem) on the set of bounded linear operators (The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators): for fixed , the map preserves because composition preserves linearity and multiplies operator bounds, and with bound . All scheme and solution errors below use the norm of this same space ; write for that norm and 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 when for every and , The maximum is over a nonempty finite set because it includes . 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 there is such that It is convergent on finite time intervals when for every and , 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
- A finite-dimensional grid update can be used in this interface only after it has been represented by bounded operators on the common space. The exact projection/reconstruction lift and the norm bounds needed to transfer stability are stated separately in Finite-grid restriction, reconstruction, and common-space lift and Grid and common-space stability agree under uniform norm comparison.
- A spectral-radius, von Neumann, or CFL calculation is not the stability condition in this definition; stability is the displayed uniform bound on powers in the declared common norm.
The diagonal heat semigroup on is contractive and strongly continuous
Statement
Let and let with the supremum norm, as in The sequence spaces c_0 and ell-infinity. For define Then is a strongly continuous semigroup on the Banach space and
Facts & Assumptions
Given: and .
The space consists of scalar sequences tending to zero and has norm (The sequence spaces c_0 and ell-infinity).
With this norm, real and complex are Banach spaces (Real and complex are Banach).
The real exponential is continuous and strictly increasing (The exponential function is strictly increasing).
for every real (The exponential is positive and satisfies ).
The operator norm is the supremum of over the unit ball, so a bound implies (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).
Proof
For and , [F4] and [F5] give . Thus the coordinate formula is linear and If and , choose so that for all ; then for . So , is bounded, and [F6] gives .
Since , . For , [F3] gives Thus the semigroup identities hold on every coordinate and hence on .
Fix , , and . By [F1], choose such that for . For those indices, for every , because both exponential factors lie in . For the finitely many indices , continuity in [F4] supplies a common such that the same coordinate differences are below whenever and . Taking the supremum over all coordinates proves . Therefore every orbit is continuous, so is strongly continuous.
The boundedness in step 1.1 holds for every , so for each , Together with the Banach property [F2], the semigroup identities in step 2.1, and strong continuity in step 2.2, this proves the statement.
Finite-grid restriction, reconstruction, and common-space lift
Definition
Let be a common-space IVP interface from Common Banach-space interface for a linear IVP and its time schemes. A finite grid space is a normed vector space spanned by a possibly empty finite list over the same field . A grid realization consists, for each , of bounded linear maps where bounded linearity is in the sense of A bounded linear operator between normed spaces, such that and Here is restriction to grid data, reconstructs grid data in , and is the one-step grid update.
The common-space lift of the grid update is 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 bound and bounds , then by the factor bounds and the triangle inequality. This finite bound proves that is bounded. The invariance hypothesis on 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.
Lax equivalence for a common Banach-space scheme
Statement
Assume the Axiom of Dependent Choice (). 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 .
Facts & Assumptions
Given: DC; a common-space scheme interface as in the statement; and consistency on its dense invariant subspace.
The common-space interface supplies a Banach space , bounded linear steps , positive time steps , a dense invariant consistency subspace , a strongly continuous solution semigroup with , and same-norm definitions of consistency, finite-time stability, and convergence (Common Banach-space interface for a linear IVP and its time schemes).
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).
is a set, subsets defined by a predicate are sets, and the image of a set under a uniquely specified assignment is a set (The natural numbers (von Neumann), The Cartesian product , The Axiom Schema of Separation: for each formula , , The Axiom Schema of Replacement: for each formula , if defines a class function on then its image on is a set).
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 -indexed chain; it is the explicit axiom assumed by [F2].
Proof
Fix and suppose the family is stable, with a bound from [F1]. For , set Consistency says for each .
For each integer , the finite telescoping identity is For both sides are zero. For , expand each summand as ; adjacent terms cancel, leaving .
Conversely, suppose the family is convergent. Fix and . By convergence, for all sufficiently large , The finite-time solution bound in [F1] then gives for those .
If and , [F1], step 1.2, and the definition of yield The last quantity tends to zero independently of the allowed .
Only finitely many indices were omitted in step 1.3. For each fixed omitted , there are only finitely many integers with , and each is a vector of finite norm. Thus the powers are pointwise bounded on every . The admissible index set exists by Separation; each pair determines a unique bounded linear operator , so Replacement gives the set-family . For fixed , boundedness supplies a finite with . The identity is linear with bound ; if is linear with bound , then is linear and . Finite induction therefore proves every member of bounded and linear. This argument fixes one at a time and chooses no sequence of bounds. Also is Banach by [F1].
Let and . By density in [F1], choose with . For every , By step 2.1, the second term is below for all such once is sufficiently large. This proves convergence for , uniformly over the grid times in . Since were arbitrary, stability implies convergence.
Apply the uniform boundedness principle [F2] to , using the explicit DC assumption [A1]. It gives which is stability on . Since was arbitrary, convergence implies stability; together with step 3.1 this proves the equivalence.
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 , independent of , such that for every and , Then the lifted family is stable on finite time intervals if and only if the grid-update family is stable in the declared grid norms on finite time intervals.
Here grid stability means that for every there is such that whenever and .
Facts & Assumptions
Given: The common-space and grid-lift data and uniform constants from the statement.
The grid lift has , , and (Finite-grid restriction, reconstruction, and common-space lift).
The exact semigroup satisfies for (Common Banach-space interface for a linear IVP and its time schemes).
The operator norm is the supremum over the unit ball, so for every (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).
A property true at and preserved by successor holds for every (The principle of mathematical induction).
Proof
The identity gives The first term is in and the second is in . For , the lift satisfies ; for , it satisfies , which remains in by [F1]. Thus both summands are invariant under .
Induction [F4] on , using the two invariant summands from step 1.1 and the semigroup identity , gives For the right side is ; the induction step applies on the first summand and on the second.
Suppose the grid updates are stable, with whenever . For every , step 2.1 and the comparison bounds give : indeed, and . Taking the supremum over using [F3] proves the uniform common-space power bound, hence stability.
Conversely, suppose for . For every , step 1.1 gives . The lower and upper norm comparisons and [F3] therefore give Thus 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.