Consistent systems of linear differential and difference equations
Abstract
We consider systems of linear differential and difference equations eqnarray* ∂ Y(x) =A(x)Y(x), σ Y(x) =B(x)Y(x) eqnarray* with ∂ = ddx, σ a shift operator σ(x) = x+a, q-dilation operator σ(x) = qx or Mahler operator σ(x) = xp and systems of two linear difference equations eqnarray* σ1 Y(x) =A(x)Y(x), σ2 Y(x) =B(x)Y(x) eqnarray* with (σ1,σ2) a sufficiently independent pair of shift operators, pair of q-dilation operators or pair of Mahler operators. Here A(x) and B(x) are n× n matrices with rational function entries. Assuming a consistency hypothesis, we show that such system can be reduced to a system of a very simple form. Using this we characterize functions satisfying two linear scalar differential or difference equations with respect to these operators. We also indicate how these results have consequences both in the theory of automatic sets, leading to a new proof of Cobham's Theorem, and in the Galois theories of linear difference and differential equations, leading to hypertranscendence results.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.