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

The neutral derivative shift has a bounded Neumann inverse when ∣a∣<1

Statement

For the segment shift SK on the derivative-segment product, and for a mesh shift Sm(M) on an array of any finite length M∈N0 with m≥1 under the same rule as SK,m in Scalar neutral delay equations and the derivative-segment shift, the supremum operator norm satisfies ∥S∥op≤1. Let J=K for SK and J=⌈M/m⌉ for Sm(M); then SJ=0. For ∣a∣<1, (I−aS)−1=∑j=0∞ajSj=∑j=0J−1ajSj,∥(I−aS)−1∥op≤11−∣a∣. Here I is the identity map and ∥S∥op:=sup⁡∥v∥≤1∥Sv∥. For M=0, use the zero-space norm and shift defined in the supplier: the identity and zero operator coincide, J=0, and the finite sum over 0≤j<J is the zero operator, which is the inverse on that zero space. Its operator norm is 0.

Facts & Assumptions

Given: Either a segment shift with K≥1 or a mesh shift with M∈N0 and m≥1, and a∈R with ∣a∣<1.

[F1]

SK shifts each derivative segment to its predecessor; the mesh shift inserts zeros in the first m entries and copies the entry m places earlier thereafter, with its explicitly defined zero-space norm and unique map when M=0 (Scalar neutral delay equations and the derivative-segment shift).

Proof

1.1givenF1algebra

If the mesh array length is M=0, [F1] gives a space with exactly one vector 0, of norm 0, and a unique self-map. This map is both the zero operator and the identity I, and S is this same operator. Thus J=⌈0/m⌉=0 and SJ=S0=I=0. The map I−aS is also the unique map, whose composite with itself is the identity; hence it is its own inverse. The finite sum over 0≤j<J is the zero operator. Every term of the infinite series is also zero, including the j=0 term because S0=I=0 as an operator on this space. Finally the operator-norm supremum is over the nonempty unit ball {0} and equals 0. This proves all stated assertions for M=0, without an empty real maximum. For the remaining proof use either the segment case K≥1 or a mesh array with M≥1.

1.2givenF1algebra

By [F1], every output coordinate of either shift is zero or an input coordinate. Taking the maximum of the component suprema therefore gives ∥Sv∥≤∥v∥, so ∥S∥op≤1. After K segment shifts every component is zero; after J=⌈M/m⌉ mesh shifts every array index has moved below zero and is zero. Thus SJ=0 in both cases.

2.1step 1.2algebra

Put R=∑j=0J−1ajSj. Multiplying the finite sum on either side by I−aS cancels adjacent terms and leaves I−aJSJ=I, so R is a two-sided inverse. Since SJ=0, this finite sum equals the displayed infinite series.

3.1step 1.2step 2.1algebra∎

Iterating the contraction bound in step 1.2 gives ∥Sjv∥≤∥v∥ for every j, hence ∥Sj∥op≤1. Thus ∥R∥op≤∑j=0J−1∣a∣j. Multiplying this finite geometric sum by the positive number 1−∣a∣ gives 1−∣a∣J≤1, hence ∥R∥op≤(1−∣a∣)−1.

Depends on

Used by

Dependency tree · two levels

6 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