Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge 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.

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.

Depends on

Used by

Dependency tree · two levels

10 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