Stable modes and the algebra of boundary data

A frozen boundary equation asks which normal profiles remain bounded inside the domain, and which boundary measurements determine those profiles. For systems, the number of profiles counts algebraic multiplicity. Eigenvectors alone can miss solutions. This lesson constructs the bounded solution space from Cauchy data, then changes the equation while preserving that space and its boundary measurements.

Section 13 of Metric and topological foundations proves the full original scalar and finite-coordinate calculus. Its Section 13.12 gives the exact Gaussian, Rayleigh, logarithmic-contour, matrix and half-line receiving maps, retaining every original factor, endpoint and norm.

The complete original real-number, compactness, extrema and finite-norm proofs are in Section 12 of Metric and topological foundations. Its Section 12.10 gives the exact receiving minimum and spectral-contour maps; the original coordinates, norms and constants are retained.

Throughout, vector spaces are finite-dimensional and complex, coefficients are constant in the normal variable, and

D=−iddt,t∈ℝ. D=-i\frac{d}{dt},\qquad t\in\mathbb R.

We call a solution stable when it is bounded for t≥0t\geq0. Under the no-real-root hypotheses below, this is equivalent to exponential decay of the solution and every derivative. No diagonalizability, simplicity of roots, commutation of matrix coefficients, or prescribed number of boundary equations is assumed.

Polynomial and contour interfaces for stable boundary models proves scalar polynomial division over ℂ\mathbb C, Bézout, Cayley–Hamilton, complex triangularization, and the contour moments for globally convergent power-series numerators with specified spectral indices. That lesson now proves the complex-root theorem and the full determinant, kernel and invariant-quotient maps in Section 9. Sections 10.1–10.9 there supply the full finite bases and direct sums, projection rank and trace, matrix algebra, original-inner-product adjoints and operator norms. Compactness of the original unit sphere retains its separate topological base. Section 16 below makes the original annihilator and Cauchy receiving maps explicit. We also use its locally uniform exponential-series calculus, termwise differentiation and integration under uniform convergence, and dominated differentiation of exponentially decreasing tails. The spectral and ODE consequences needed here are proved below.

1. Spectral calculus without an eigenbasis

Let VV be a finite-dimensional complex vector space and A∈End⁡(V)A\in\operatorname{End}(V). Choose any norm. The series

EA(t)=∑k=0∞(itA)kk! E_A(t)=\sum_{k=0}^{\infty}\frac{(itA)^k}{k!}

converges locally uniformly with all derivatives, since its norms and the norms of its differentiated terms are bounded by scalar exponential series. Thus DEA=AEADE_A=AE_A, EA(0)=IE_A(0)=I, and multiplication of absolutely convergent series gives EA(−t)EA(t)=IE_A(-t)E_A(t)=I. If Du=AuDu=Au, differentiating EA(−t)u(t)E_A(-t)u(t) shows that it is constant. Consequently

u(t)=EA(t)v(S1) u(t)=E_A(t)v \tag{S1}

is the unique solution with u(0)=vu(0)=v. In particular the solution space has dimension dim⁡V\dim V.

Here is the spectral information, including the nilpotent terms. Keep an original least-degree nonzero annihilator mm with leading coefficient cm≠0c_m\ne0. Its named monic comparison has factorization ∏ζ(z−ζ)νζ\prod_{\zeta}(z-\zeta)^{\nu_\zeta}; the original polynomial is m=cm∏ζ(z−ζ)νζm=c_m\prod_{\zeta}(z-\zeta)^{\nu_\zeta}, with every unit and multiplicity retained. Section 16.1 proves the full scalar-unit and polynomial evaluation maps. The spectral label λ\lambda used there denotes the same actual root as ζ\zeta here, through the identity λ=ζ\lambda=\zeta. The factors are pairwise relatively prime. Repeated Bézout identities give polynomials eζe_\zeta which are one modulo (z−ζ)νζ(z-\zeta)^{\nu_\zeta} and zero modulo every other factor. Their sum is one modulo the named comparison, while the full original calculation uses Mζ=m/(z−ζ)νζ=cmHζM_\zeta=m/(z-\zeta)^{\nu_\zeta}=c_mH_\zeta and eζ=(cm−1bζ)Mζe_\zeta=(c_m^{-1}b_\zeta)M_\zeta. Formula (SR2) retains both original scalar factors. Evaluation at AA therefore gives projections

Qζ=eζ(A),QζQη=0(ζ≠η),∑ζQζ=I. Q_\zeta=e_\zeta(A),\quad Q_\zeta Q_\eta=0\ (\zeta\ne\eta),\quad \sum_\zeta Q_\zeta=I.

Their images are exactly

Vζ=ker⁡(A−ζI)νζ. V_\zeta=\ker(A-\zeta I)^{\nu_\zeta}.

Indeed, the polynomial congruences show both inclusion in this kernel and that QζQ_\zeta is the identity there. Thus V=⨁VζV=\bigoplus V_\zeta. On VζV_\zeta, write A=ζI+NζA=\zeta I+N_\zeta, where Nζνζ=0N_\zeta^{\nu_\zeta}=0. The inverse and the evolution on that summand are

(zI−A)−1|Vζ=∑k=0νζ−1Nζk(z−ζ)k+1,EA(t)|Vζ=eitζ∑k=0νζ−1(it)kNζkk!.(S2) (zI-A)^{-1}|_{V_\zeta} =\sum_{k=0}^{\nu_\zeta-1}\frac{N_\zeta^k}{(z-\zeta)^{k+1}}, \qquad E_A(t)|_{V_\zeta} =e^{it\zeta}\sum_{k=0}^{\nu_\zeta-1}\frac{(it)^kN_\zeta^k}{k!}. \tag{S2}

The first identity follows by multiplying a finite geometric series; the second follows from the exponential series for commuting ζI\zeta I and NζN_\zeta. The entire-series contour moment formula from the preceding lesson, applied to the first identity, yields

EA(t)=12πi∫Γeitz(zI−A)−1dz,(S3) E_A(t)=\frac{1}{2\pi i}\int_\Gamma e^{itz}(zI-A)^{-1}\,dz, \tag{S3}

where Γ\Gamma is a finite union of positively oriented closed contours enclosing every eigenvalue once and no point of the spectrum on the contours. Integrating the resolvent alone around a single eigenvalue gives QζQ_\zeta. These assertions also follow directly from (S2), so multiple poles are included.

The full characteristic/pole comparison is proved in Sections 16.2–16.3, including the exact nonzero leading resolvent coefficient. For later counting, dim⁡Vζ\dim V_\zeta equals the algebraic multiplicity of ζ\zeta in det⁡(zI−A)\det(zI-A). The direct sum decomposes the determinant into the determinants of the restrictions. A nilpotent map is upper triangular with zero diagonal in a basis adapted to its successive kernels; the restriction to VζV_\zeta therefore contributes (z−ζ)dim⁡Vζ(z-\zeta)^{\dim V_\zeta}. The length of a nilpotent chain affects polynomial factors in time, while the dimension of the whole generalized eigenspace determines the number of solutions.

The exact original annihilator and scalar-unit calculation in Sections 16.1–16.4 proves these same operators and contour formulas with every leading factor shown.

2. A monic equation and its complete Cauchy coordinates

Let EE have dimension NN, let m≥1m\geq1, and put

p(z)=zmI+∑j=0m−1pjzj,pj∈End⁡(E).(S4) p(z)=z^m I+\sum_{j=0}^{m-1}p_jz^j, \qquad p_j\in\operatorname{End}(E). \tag{S4}

The scalar variable zz commutes with every coefficient; the coefficients need not commute with each other. The case E=0E=0 has only zero solutions and determinant one; the following arguments can be read with N>0N>0.

For x=(x0,…,xm−1)∈Emx=(x_0,\ldots,x_{m-1})\in E^m, define the companion map

Cpx=(x1,…,xm−1,−p0x0−⋯−pm−1xm−1). C_px=(x_1,\ldots,x_{m-1},-p_0x_0-\cdots-p_{m-1}x_{m-1}).

If p(D)u=0p(D)u=0, its state Ju=(u,Du,…,Dm−1u)J u=(u,Du,\ldots,D^{m-1}u) satisfies D(Ju)=CpJuD(Ju)=C_pJu. Conversely, the first m−1m-1 rows of this first-order equation imply that any state solution is the jet of its first component, and the last row gives p(D)u=0p(D)u=0. Applying Section 1 proves existence and uniqueness for arbitrary Cauchy data and gives dim⁡ker⁡p(D)=mN\dim\ker p(D)=mN.

We will need the exact characteristic polynomial:

det⁡(zIEm−Cp)=det⁡p(z).(S5) \det(zI_{E^m}-C_p)=\det p(z). \tag{S5}

For a direct determinant check, make the triangular change of variables x0=y0x_0=y_0 and xj=zxj−1+yjx_j=zx_{j-1}+y_j for 1≤j<m1\leq j<m; its determinant is one. The first m−1m-1 rows of (zI−Cp)x(zI-C_p)x become −y1,…,−ym−1-y_1,\ldots,-y_{m-1}, and the coefficient of y0y_0 in the last row is p(z)p(z). Move that last block row to the front and eliminate its other entries using the identity block rows. The block-row permutation has sign (−1)N2(m−1)(-1)^{N^2(m-1)}, and the negative identities contribute (−1)N(m−1)(-1)^{N(m-1)}. Their product is one. This proves (S5), as a polynomial identity, without assuming that any pjp_j is invertible.

There is also a useful polynomial encoding of a jet. Set pm=Ip_m=I and

𝒰x(z)=∑0≤k≤j<mpj+1xj−kzk.(S6) \mathcal U_x(z)= \sum_{0\leq k\leq j<m}p_{j+1}x_{j-k}z^k. \tag{S6}

This maps EmE^m bijectively onto the EE-valued polynomials of degree less than mm. To see this, read coefficients from the highest power downwards: the coefficient of zm−1z^{m-1} is x0x_0, the next is x1+pm−1x0x_1+p_{m-1}x_0, and in general the next unknown xrx_r occurs with coefficient II, accompanied only by already recovered x0,…,xr−1x_0,\ldots,x_{r-1}.

Let π0:Em→E\pi_0:E^m\to E be the first coordinate. Solving (zI−Cp)w=x(zI-C_p)w=x gives

wj=zjw0−∑r=0j−1zj−1−rxr,p(z)w0=𝒰x(z). w_j=z^jw_0-\sum_{r=0}^{j-1}z^{j-1-r}x_r, \qquad p(z)w_0=\mathcal U_x(z).

The latter equality follows by substituting the first formula into the last block row; its coefficient of xrx_r is ∑j=rm−1pj+1zj−r\sum_{j=r}^{m-1}p_{j+1}z^{j-r}. Consequently (S3), applied to CpC_p, gives the solution with jet xx:

u(t)=12πi∫Γp(z)−1𝒰x(z)eitzdz.(S7) u(t)=\frac{1}{2\pi i}\int_\Gamma p(z)^{-1}\mathcal U_x(z)e^{itz}\,dz. \tag{S7}

The contours enclose all roots of det⁡p\det p. Formula (S7) is valid for repeated roots and matrix poles of arbitrary order. It is the finite sum of the pole moments computed from (S2). The triangular bijection above proves uniqueness of the polynomial in this representation, as well as existence. In particular, it does not require a factorization of pp into linear matrix factors.

Section 16.7 proves the corresponding original numerator, inverse coordinates, resolvent and contour maps when the actual leading matrix is any invertible pmp_m. It retains its full determinant and both block signs.

3. Bounded solutions, derivatives, and multiplicity

First, boundedness of a solution of a monic constant-coefficient equation controls all its derivatives. This fact is useful before any spectral separation is imposed.

Lemma. If rr is any monic matrix polynomial and r(D)u=0r(D)u=0, then boundedness of uu on [0,∞)[0,\infty) implies boundedness there of DkuD^ku for every k≥0k\geq0.

Proof. Write C=CrC=C_r, with state space WW, and define

h(v)=∫01∥π0EC(s)v∥2ds. h(v)=\int_0^1\|\pi_0E_C(s)v\|^2\,ds.

If h(v)=0h(v)=0, the continuous integrand vanishes on the interval. Its derivatives at zero then vanish, so every Cauchy coordinate of vv is zero. The positive function hh has a positive minimum cc on the unit sphere. Thus for every t≥0t\geq0,

c∥Ju(t)∥2≤∫01∥u(t+s)∥2ds. c\|Ju(t)\|^2\leq \int_0^1\|u(t+s)\|^2\,ds.

All components of the state are bounded. Repeated differentiation of D(Ju)=CJuD(Ju)=CJu expresses every higher derivative through a fixed power of CC, proving the claim. The same argument with integration over [−1,0][-1,0] proves the negative-half-line version. An equation with invertible leading coefficient is first multiplied on the left by its inverse. ▫\square

Assume now that AA has no real eigenvalues. Define

qA=∑Im⁡ζ>0Qζ=12πi∫Γ+(zI−A)−1dz,(S8) q_A=\sum_{\operatorname{Im}\zeta>0}Q_\zeta =\frac{1}{2\pi i}\int_{\Gamma_+}(zI-A)^{-1}\,dz, \tag{S8}

where Γ+\Gamma_+ surrounds precisely the upper-half-plane spectrum. This is a projection commuting with AA. On its image, (S2) shows that EA(t)E_A(t) and all its derivatives decay as t→+∞t\to+\infty: every polynomial factor is dominated by the exponential e−tIm⁡ζe^{-t\operatorname{Im}\zeta}. On the image of I−qAI-q_A, the corresponding decay holds as t→−∞t\to-\infty.

Conversely, if EA(t)vE_A(t)v is bounded for t≥0t\geq0, set v−=(I−qA)vv_-=(I-q_A)v. Then

v−=EA(−t)(I−qA)EA(t)v. v_-=E_A(-t)(I-q_A)E_A(t)v.

The norm of EA(−t)E_A(-t) on the lower spectral subspace tends to zero, by (S2), while the last factor is bounded. Taking t→∞t\to\infty gives v−=0v_-=0. The negative-half-line assertion follows with signs reversed. Hence initial evaluation identifies the two bounded solution spaces with qAVq_AV and (I−qA)V(I-q_A)V, and every solution splits uniquely into one of each kind.

For (S4), assume

det⁡p(ξ)≠0(ξ∈ℝ).(S9) \det p(\xi)\ne0\qquad(\xi\in\mathbb R). \tag{S9}

The companion characteristic identity and the lemma imply that its stable solution space

ℳ+(p)={u∈C∞(ℝ,E):p(D)u=0,supt≥0∥u(t)∥<∞} \mathcal M^+(p)= \{u\in C^\infty(\mathbb R,E):p(D)u=0, \ \sup_{t\geq0}\|u(t)\|<\infty\}

corresponds under JJ exactly to qCpEmq_{C_p}E^m. All its derivatives decay exponentially. The dimension is the sum of the algebraic multiplicities of the roots of det⁡p\det p in the upper half-plane. The analogous lower space gives a direct-sum decomposition of all solutions. The statement counts generalized modes, even if the scalar determinant has high multiplicity and the space of ordinary eigenvectors is small.

Section 16.5 also proves the exact bounded modes when real roots are present; those extra modes are distinguished from the original no-real-root decay assertion above.

4. Parameters and fixed projections

Suppose A(y)A(y) is a CrC^r family on an open parameter set, where 0≤r≤∞0\leq r\leq\infty, and every A(y)A(y) has no real eigenvalues. Near a fixed parameter one can choose the same contours in (S8): invertibility on a compact contour persists under small matrix perturbations. The resolvent is CrC^r, and, for one derivative,

∂y(zI−A)−1=(zI−A)−1(∂yA)(zI−A)−1.(S10) \partial_y(zI-A)^{-1} =(zI-A)^{-1}(\partial_y A)(zI-A)^{-1}. \tag{S10}

Repeated differentiation gives finite sums of ordered products of such factors; their order cannot be changed when matrices do not commute. Differentiating the contour integral proves that qA(y)q_A(y) is CrC^r. Since the rank of a projection is its integer-valued trace, its rank is locally constant. A basis of its image at one parameter remains a basis after applying nearby projections, so the stable spaces form a CrC^r vector bundle. A global eigenbasis or a splitting into individual eigenvalue branches is unnecessary.

On a compact parameter set contained in this no-real-spectrum region, there are constants δ>0\delta>0 and CkC_k such that

∥DtkEA(y)(t)qA(y)∥≤Cke−δt(t≥0).(S11) \|D_t^k E_{A(y)}(t)q_{A(y)}\|\leq C_k e^{-\delta t} \qquad(t\geq0). \tag{S11}

To justify the common contour used for this estimate, matrix norms give a common bound for all eigenvalues. If their distances from the real axis had no positive lower bound, a convergent sequence of parameters and a convergent subsequence of eigenvalues would give a real eigenvalue at the limiting parameter, by continuity of the determinant. Choose a rectangle enclosing all upper eigenvalues with its lower side strictly above the real axis, and with its other sides beyond the common spectral bound. Its distance from the spectra is positive. Formula (S3) with this contour, and Dtkeitz=zkeitzD_t^ke^{itz}=z^ke^{itz}, proves (S11). In parameter charts, derivatives through order rr obey the corresponding estimate by (S10). Constants are local on the parameter space; no global spectral gap is asserted on a noncompact parameter set.

These results apply to Cp(y)C_{p(y)} when the coefficients of a fixed-degree monic polynomial vary CrC^r and (S9) holds. Collisions among roots in one half-plane do not damage the stable bundle or these estimates.

Section 16.6 gives every ordered multiindex derivative with its full multiplicity and the original contour length, spectral-gap and resolvent constants.

5. Collapsing rates within their half-planes

Let q=qAq=q_A, let λ>0\lambda>0, and let 0≤τ≤10\leq\tau\leq1. Put

Aτ=(1−τ)A+iτλ(2q−I).(S12) A_\tau=(1-\tau)A+i\tau\lambda(2q-I). \tag{S12}

Theorem. Each AτA_\tau has no real eigenvalues, and its upper spectral projection is exactly qq. At τ=1\tau=1, its solution with initial value vv is

e−λtqv+eλt(I−q)v.(S13) e^{-\lambda t}qv+e^{\lambda t}(I-q)v. \tag{S13}

Proof. On an original primary summand VζV_\zeta, the restriction is

((1−τ)ζ+iτλsgn⁡(Im⁡ζ))I+(1−τ)Nζ. \big((1-\tau)\zeta+i\tau\lambda\, \operatorname{sgn}(\operatorname{Im}\zeta)\big)I +(1-\tau)N_\zeta.

Its only eigenvalue has the same strict imaginary-part sign as ζ\zeta, including at both endpoints. The fixed direct sum of all original upper summands is therefore the full upper primary subspace for every τ\tau, and the lower sum is its complementary lower subspace. The spectral projection is uniquely the projection onto the first along the second, hence equals qq. Formula (S13) follows by exponentiating the restrictions iλIi\lambda I and −iλI-i\lambda I.

Distinct original eigenvalues can coalesce during this deformation, and at the last endpoint nilpotent parts vanish. Individual generalized eigenspaces labelled by distinct moving eigenvalues therefore need not stay individually identifiable. The two half-plane sums and their projection are what remain fixed. ▫\square

For parameter-dependent AA and positive λ\lambda, (S12) has the same regularity as those data by Section 4. There is no additional requirement that λ\lambda avoid the original eigenvalues.

6. Polynomial coordinates adapted to two half-planes

Return to (S4), now with m>1m>1, and fix λ>0\lambda>0. Write

L(z)=z+iλ,R(z)=z−iλ. L(z)=z+i\lambda,\qquad R(z)=z-i\lambda.

There are unique coefficients a0,…,am∈End⁡(E)a_0,\ldots,a_m\in\operatorname{End}(E) with

p(z)=∑j=0majR(z)jL(z)m−j.(S14) p(z)=\sum_{j=0}^m a_j R(z)^jL(z)^{m-j}. \tag{S14}

For completeness, set w=R(z)/L(z)w=R(z)/L(z), so z=iλ(1+w)/(1−w)z=i\lambda(1+w)/(1-w) and L(z)=2iλ/(1−w)L(z)=2i\lambda/(1-w). Then the coefficients are those of the polynomial

∑j=0majwj=∑k=0mik−m2mλk−mpk(1+w)k(1−w)m−k.(S15) \sum_{j=0}^m a_jw^j =\sum_{k=0}^m\frac{i^{k-m}}{2^m}\lambda^{k-m} p_k(1+w)^k(1-w)^{m-k}. \tag{S15}

This gives an explicit formula

aj=∑k=0mcjkpkλk−m,cjk=ik−m2m∑r=0j(−1)j−r(kr)(m−kj−r),(S16) a_j=\sum_{k=0}^m c_{jk}p_k\lambda^{k-m},\qquad c_{jk}=\frac{i^{k-m}}{2^m} \sum_{r=0}^{j}(-1)^{j-r} \binom{k}{r}\binom{m-k}{j-r}, \tag{S16}

with binomial coefficients outside their ordinary range interpreted as zero. The right side of (S15) has degree at most mm, proving existence. If a combination in (S14) vanishes, divide by L(z)mL(z)^m for z≠−iλz\ne-i\lambda; the polynomial ∑ajwj\sum a_jw^j vanishes on infinitely many ww, so each coefficient vanishes. This proves uniqueness and invertibility of the change of basis. Comparing the coefficient of zmz^m gives

∑j=0maj=I.(S17) \sum_{j=0}^m a_j=I. \tag{S17}

Neither a0a_0 nor ama_m, nor any intermediate coefficient, is assumed invertible. The negative powers of λ\lambda in (S16) require λ>0\lambda>0; there is no claim of uniformity as λ↓0\lambda\downarrow0.

7. First-order coordinates that respect decay

For a solution of p(D)u=0p(D)u=0, define

vj=R(D)jL(D)m−1−ju,0≤j<m.(S18) v_j=R(D)^jL(D)^{m-1-j}u,\qquad 0\leq j<m. \tag{S18}

The polynomials RjLm−1−jR^jL^{m-1-j} form a basis of the scalar polynomials of degree at most m−1m-1, by the same argument as in Section 6. Thus (S18) is an invertible, constant, scalar-block change from the Cauchy state (u,Du,…,Dm−1u)(u,Du,\ldots,D^{m-1}u). There is no loss of a Cauchy coordinate.

The transformed equations are

∑j=0m−1ajL(D)vj+amR(D)vm−1=0,L(D)vj−R(D)vj−1=0(1≤j<m).(S19) \begin{aligned} &\sum_{j=0}^{m-1}a_jL(D)v_j+a_mR(D)v_{m-1}=0,\\ &L(D)v_j-R(D)v_{j-1}=0\quad(1\leq j<m). \end{aligned} \tag{S19}

The second equations follow by commuting scalar polynomials in DD; the first is precisely (S14) applied to uu. We have only moved scalar differential factors past constant matrix coefficients, never exchanged two matrix coefficients.

These equations are exactly a first-order system, not merely consequences that define a larger space. One way to check the converse is to let TT denote the invertible change in (S18). The leading matrix of the left side of (S19) has row zero (a0,a1,…,am−2,am−1+am)(a_0,a_1,\ldots,a_{m-2},a_{m-1}+a_m), and lower rows have −I,I-I,I in adjacent columns. Its determinant is one by the factorization in the next result at τ=1\tau=1. Call that leading matrix CC, and the constant matrix KK. Every jet initial value yields a transformed solution, so (CTCp+KT)x=0(CTC_p+KT)x=0 for every initial vector xx. Hence CD+K=CT(D−Cp)T−1CD+K=CT(D-C_p)T^{-1}. Invertibility of C,TC,T proves the converse.

This change of state is an exact first-order reduction. The next construction has a different purpose: it produces a homotopy of fixed-degree polynomial systems beginning with the original equation plus auxiliary equations. Choosing L(D)mL(D)^m for those auxiliary equations places their characteristic root at −iλ-i\lambda, where they have no stable solutions. Auxiliary equations Dmv=0D^m v=0 would instead introduce the real root zero.

8. An explicit stabilization and its leading coefficient

For 0≤τ≤10\leq\tau\leq1, define the degree-mm polynomial Pτ(z)∈End⁡(Em)[z]P_\tau(z)\in\operatorname{End}(E^m)[z] by its action on U=(U0,…,Um−1)U=(U_0,\ldots,U_{m-1}). The first component is

(Pτ(z)U)0=((1−τm)p(z)+τma0L(z)m)U0+∑j=1m−2τm−jajL(z)mUj+τ(am−1L(z)m+amR(z)L(z)m−1)Um−1,(S20) \begin{aligned} (P_\tau(z)U)_0={}& \big((1-\tau^m)p(z)+\tau^m a_0L(z)^m\big)U_0\\ &+\sum_{j=1}^{m-2}\tau^{m-j}a_jL(z)^mU_j\\ &+\tau\big(a_{m-1}L(z)^m+a_mR(z)L(z)^{m-1}\big)U_{m-1}, \end{aligned} \tag{S20}

and the remaining components are

(Pτ(z)U)j=L(z)mUj−τR(z)L(z)m−1Uj−1(1≤j<m).(S21) (P_\tau(z)U)_j=L(z)^mU_j- \tau R(z)L(z)^{m-1}U_{j-1}\quad(1\leq j<m). \tag{S21}

For m=2m=2, the sum in the middle line of (S20) is empty; the last block appears only once. At the endpoints,

P0(z)=diag⁡(p(z),L(z)mI,…,L(z)mI),(S22) P_0(z)=\operatorname{diag}(p(z),L(z)^mI,\ldots,L(z)^mI), \tag{S22}

and every entry of P1(z)P_1(z) contains L(z)m−1L(z)^{m-1}. After that scalar factor is removed, its equations are (S19).

Let CτC_\tau be the coefficient of zmz^m in PτP_\tau. Define S:Em→EmS:E^m\to E^m by (SU)0=0(SU)_0=0, (SU)j=Uj−1(SU)_j=U_{j-1}, and let HτH_\tau have identity diagonal, zero off-diagonal entries except in its first row, and

(Hτ)0j=hj=τm−j∑k=jmak(1≤j<m). (H_\tau)_{0j}=h_j =\tau^{m-j}\sum_{k=j}^m a_k\quad(1\leq j<m).

Then

Cτ=Hτ(I−τS).(S23) C_\tau=H_\tau(I-\tau S). \tag{S23}

To verify this, its first block is I−τh1=I−τm∑k=1mak=(1−τm)I+τma0I-\tau h_1=I-\tau^m\sum_{k=1}^ma_k=(1-\tau^m)I+\tau^ma_0. Its intermediate first-row blocks are hj−τhj+1=τm−jajh_j-\tau h_{j+1}=\tau^{m-j}a_j, and its last block is hm−1=τ(am−1+am)h_{m-1}=\tau(a_{m-1}+a_m). The lower rows are exactly −τI,I-\tau I,I. These are the leading blocks of (S20)–(S21).

Both factors in (S23) are block triangular with identity diagonal. Therefore

det⁡Cτ=1.(S24) \det C_\tau=1. \tag{S24}

Moreover, Hτ=I+NτH_\tau=I+N_\tau with Nτ2=0N_\tau^2=0, while Sm=0S^m=0. Its inverse is the explicit finite expression

Cτ−1=(∑r=0m−1τrSr)(I−Nτ).(S25) C_\tau^{-1} =\left(\sum_{r=0}^{m-1}\tau^rS^r\right)(I-N_\tau). \tag{S25}

In block form, (Cτ−1)i0=τiI(C_\tau^{-1})_{i0}=\tau^iI, and for j≥1j\geq1,

(Cτ−1)ij={τi−jI−τihj,i≥j,−τihj,i<j,0≤i<m.(S26) (C_\tau^{-1})_{ij} =\begin{cases} \tau^{i-j}I-\tau^i h_j,&i\geq j,\\ -\tau^i h_j,&i<j, \end{cases} \qquad 0\leq i<m. \tag{S26}

Every entry has degree at most one in the aka_k; using (S17) to replace II makes it a linear combination of them. No product of two aka_k’s occurs. The factorization uses only addition, composition with scalar multiples of identity, and the relation (S17). Consequently the inverse calculation also works for coefficients in any unital, possibly noncommutative, algebra satisfying that relation. Only the determinant statement is restricted here to finite-dimensional matrices.

9. A determinant identity retaining every root

For every complex zz and every 0≤τ≤10\leq\tau\leq1,

det⁡Pτ(z)=det⁡p(z)L(z)m(m−1)N.(S27) \det P_\tau(z)=\det p(z)\,L(z)^{m(m-1)N}. \tag{S27}

Proof. First suppose L(z)≠0L(z)\ne0. The block of rows and columns indexed 1,…,m−11,\ldots,m-1 is lower triangular with diagonal L(z)mIL(z)^m I, and therefore has determinant L(z)m(m−1)NL(z)^{m(m-1)N}. Eliminating these rows expresses the auxiliary components as

Uj=(τR(z)L(z))jU0. U_j=\left(\tau\frac{R(z)}{L(z)}\right)^jU_0.

The Schur complement in the first row is

(1−τm)p(z)+τm∑j=0majR(z)jL(z)m−j=p(z). (1-\tau^m)p(z) +\tau^m\sum_{j=0}^ma_jR(z)^jL(z)^{m-j}=p(z).

The block determinant formula proves (S27) whenever L(z)≠0L(z)\ne0. Both sides are polynomials in zz, so equality on that set proves equality also at z=−iλz=-i\lambda. The calculation never assumes invertibility of p(z)p(z). ▫\square

If (S9) holds, (S27) proves that PτP_\tau is invertible at every real zz. It also records multiplicity: the upper-half-plane roots, with algebraic multiplicity, are exactly those of det⁡p\det p; the auxiliary factor adds only the lower root −iλ-i\lambda, with multiplicity m(m−1)Nm(m-1)N. If this is already a root of det⁡p\det p, multiplicities add. At τ=1\tau=1, writing P1=Lm−1FP_1=L^{m-1}F, where FF is the first-order polynomial of (S19), gives det⁡F=det⁡p\det F=\det p. A zero of the auxiliary factor is not discarded from the full equation.

10. The stable space is preserved, with an explicit inverse

Assume (S9), and write ℳτ+=ℳ+(Pτ)\mathcal M^+_\tau=\mathcal M^+(P_\tau), with the definition extended to invertible leading coefficient by left normalization.

Theorem. For every 0≤τ≤10\leq\tau\leq1,

Πτ:ℳτ+→ℳ+(p),U↦U0(S28) \Pi_\tau:\mathcal M^+_\tau\longrightarrow\mathcal M^+(p), \qquad U\longmapsto U_0 \tag{S28}

is a linear isomorphism. On these spaces,

L(D)Uj=τR(D)Uj−1,L(D)jUj=τjR(D)jU0.(S29) L(D)U_j=\tau R(D)U_{j-1},\qquad L(D)^jU_j=\tau^jR(D)^jU_0. \tag{S29}

Proof. The leading coefficient is invertible by (S24), and the determinant has no real zeros by (S27). Section 3 therefore applies to PτP_\tau: every stable solution and all its derivatives decay exponentially.

Equation (S21) says L(D)m−1(L(D)Uj−τR(D)Uj−1)=0L(D)^{m-1}(L(D)U_j-\tau R(D)U_{j-1})=0. The expression in parentheses is bounded. The kernel of L(D)kL(D)^k, for k≥1k\geq1, consists exactly of eλte^{\lambda t} times vector polynomials of degree less than kk: substitute f=eλtgf=e^{\lambda t}g and use L(D)f=−ieλtg′L(D)f=-ie^{\lambda t}g'. No nonzero such function is bounded for t≥0t\geq0. Cancellation is therefore valid on this bounded solution space, giving the first recurrence in (S29). Iteration gives the second one.

For j<mj<m, multiply the second identity by L(D)m−jL(D)^{m-j}. In the last term of (S20), use R(D)L(D)m−1Um−1=τm−1R(D)mU0R(D)L(D)^{m-1}U_{m-1}=\tau^{m-1}R(D)^mU_0. The first row of the differential equation becomes

(1−τm)p(D)U0+τm∑j=0majR(D)jL(D)m−jU0=p(D)U0=0. (1-\tau^m)p(D)U_0+ \tau^m\sum_{j=0}^ma_jR(D)^jL(D)^{m-j}U_0=p(D)U_0=0.

Thus Πτ\Pi_\tau has the asserted codomain.

To construct the inverse, first observe that for a smooth exponentially decreasing function gg, whose derivatives have the same property, the unique bounded solution of L(D)f=gL(D)f=g is

(Tλg)(t)=−i∫0∞e−λsg(t+s)ds.(S30) (T_\lambda g)(t) =-i\int_0^\infty e^{-\lambda s}g(t+s)\,ds. \tag{S30}

Differentiating the integral or integrating once by parts gives f′−λf=igf'-\lambda f=ig, which is equivalent to L(D)f=gL(D)f=g. The difference of any two bounded solutions is ceλtce^{\lambda t}, so is zero. Differentiation under the integral is justified by the exponential derivative bounds. If ∥Dkg(t)∥≤Mke−δt\|D^kg(t)\|\leq M_ke^{-\delta t}, then

∥DkTλg(t)∥≤Mkλ+δe−δt(t≥0).(S31) \|D^kT_\lambda g(t)\|\leq \frac{M_k}{\lambda+\delta}e^{-\delta t} \quad(t\geq0). \tag{S31}

Every u∈ℳ+(p)u\in\mathcal M^+(p) has these bounds by Section 3. Define

U0=u,Uj=τTλR(D)Uj−1(1≤j<m).(S32) U_0=u,\qquad U_j=\tau T_\lambda R(D)U_{j-1}\ (1\leq j<m). \tag{S32}

These functions are defined on all real tt; for fixed tt, the integration tail still lies in the decaying region. They and all their derivatives decay on the positive half-line, satisfy (S29), and hence satisfy every lower row of Pτ(D)U=0P_\tau(D)U=0. Substituting the recurrences into the first row gives p(D)u=0p(D)u=0, as above. This proves surjectivity. If U0=0U_0=0, each successive bounded solution of L(D)Uj=τR(D)Uj−1L(D)U_j=\tau R(D)U_{j-1} is zero by uniqueness, proving injectivity. ▫\square

Since TλT_\lambda commutes with scalar constant-coefficient differentiation on these functions, the lift can also be written

Uj=τj(TλR(D))ju. U_j=\tau^j(T_\lambda R(D))^ju.

At τ=0\tau=0, this is exactly (u,0,…,0)(u,0,\ldots,0); no division by τ\tau is needed. The same estimates show local CrC^r dependence of the lift on CrC^r coefficients and on λ>0\lambda>0. In Cauchy coordinates this is an isomorphism of the stable bundles from Section 4. On compact parameter sets, differentiation of (S30) in λ\lambda introduces powers of ss, whose integrals remain finite because λ\lambda has a positive lower bound and the stable decay estimates are uniform.

11. Boundary measurements, their orders, and the zero endpoint

For 1≤ℓ≤J1\leq\ell\leq J, let GℓG_\ell be a finite-dimensional complex vector space and

Bℓ(z)=∑r=0dℓbℓrzr,bℓr∈Hom⁡(E,Gℓ),dℓ≥0. B_\ell(z)=\sum_{r=0}^{d_\ell}b_{\ell r}z^r, \qquad b_{\ell r}\in\operatorname{Hom}(E,G_\ell), \qquad d_\ell\geq0.

The boundary map is

ℬ:ℳ+(p)→G:=⨁ℓ=1JGℓ,u↦(Bℓ(D)u(0))ℓ.(S33) \mathcal B:\mathcal M^+(p)\longrightarrow G:=\bigoplus_{\ell=1}^J G_\ell, \qquad u\longmapsto\big(B_\ell(D)u(0)\big)_\ell. \tag{S33}

The empty family is allowed, with target zero. We call these measurements complementing precisely when (S33) is bijective. In particular its domain and target dimensions must agree; injectivity alone does not establish complementing data with arbitrary targets.

For any finite orders dℓd_\ell, composition with (S28) gives

ℬτ(U)=(Bℓ(D)U0(0))ℓ,ℬτ=ℬΠτ.(S34) \mathcal B_\tau(U)=\big(B_\ell(D)U_0(0)\big)_\ell, \qquad \mathcal B_\tau=\mathcal B\Pi_\tau. \tag{S34}

Since Πτ\Pi_\tau is an isomorphism, ℬτ\mathcal B_\tau is bijective if and only if ℬ\mathcal B is. This statement includes both τ=0\tau=0 and τ=1\tau=1, and does not require dℓ<md_\ell<m.

The preserved data form the commuting square

ℳτ+→ℬτGΠτ↓↓IGℳ+(p)→ℬG. \begin{array}{ccc} \mathcal M^+_\tau&\xrightarrow{\mathcal B_\tau}&G\\ \Pi_\tau\downarrow&&\downarrow I_G\\ \mathcal M^+(p)&\xrightarrow{\mathcal B}&G. \end{array}

The left vertical arrow is invertible; the bottom measurement map is invertible exactly when the top one is. This diagram concerns solution spaces, so it does not extend an expression with singular coefficients to arbitrary Cauchy vectors.

For the following alternative expression, impose the additional hypothesis dℓ<md_\ell<m. There are unique coefficients βℓk∈Hom⁡(E,Gℓ)\beta_{\ell k}\in\operatorname{Hom}(E,G_\ell) such that

Bℓ(z)=∑k=0m−1βℓkR(z)kL(z)m−1−k.(S35) B_\ell(z)=\sum_{k=0}^{m-1} \beta_{\ell k}R(z)^kL(z)^{m-1-k}. \tag{S35}

Repeating the change of variables with degree m−1m-1 gives

∑k=0m−1βℓkwk=∑r=0dℓir+1−m2m−1λr+1−mbℓr(1+w)r(1−w)m−1−r.(S36) \sum_{k=0}^{m-1}\beta_{\ell k}w^k =\sum_{r=0}^{d_\ell} \frac{i^{r+1-m}}{2^{m-1}}\lambda^{r+1-m} b_{\ell r}(1+w)^r(1-w)^{m-1-r}. \tag{S36}

Thus βℓk=∑r=0dℓckr′bℓrλr+1−m\beta_{\ell k}=\sum_{r=0}^{d_\ell}c'_{kr}b_{\ell r}\lambda^{r+1-m}, where

ckr′=ir+1−m2m−1∑a=0k(−1)k−a(ra)(m−1−rk−a). c'_{kr}=\frac{i^{r+1-m}}{2^{m-1}} \sum_{a=0}^k(-1)^{k-a} \binom{r}{a}\binom{m-1-r}{k-a}.

The degrees and powers of λ\lambda follow from (S36), including when the actual order is less than m−1m-1. From (S29),

L(D)m−1Uk=τkR(D)kL(D)m−1−kU0. L(D)^{m-1}U_k =\tau^kR(D)^kL(D)^{m-1-k}U_0.

Consequently for 0<τ≤10<\tau\leq1 and U∈ℳτ+U\in\mathcal M^+_\tau,

Bℓ(D)U0=∑k=0m−1τ−kβℓkL(D)m−1Uk.(S37) B_\ell(D)U_0 =\sum_{k=0}^{m-1}\tau^{-k}\beta_{\ell k} L(D)^{m-1}U_k. \tag{S37}

This is equality of functions of tt, so it remains true at the boundary after evaluation at zero. The factors τ−k\tau^{-k} make (S37) unsuitable as a formula for an ambient boundary operator at τ=0\tau=0. The correct endpoint map is (S34). On the explicitly lifted stable vectors (S32), the factors cancel with τk\tau^k, but this cancellation does not define τ−k\tau^{-k} on arbitrary vectors at zero.

Here the orders are orders in the single normal variable. In a boundary PDE, tangential orders and their Sobolev shifts are additional data. None of the finite-dimensional statements permits dropping them or replacing an arbitrary boundary system by Dirichlet data.

12. The reduction with its leading coefficient retained

Combine the preceding statements under exactly these assumptions: EE is finite-dimensional over ℂ\mathbb C; m>1m>1; pp has degree mm and leading coefficient II; det⁡p(ξ)≠0\det p(\xi)\ne0 for every real ξ\xi; λ>0\lambda>0; and 0≤τ≤10\leq\tau\leq1.

The family PτP_\tau in (S20)–(S21) begins with the stabilized equation (S22), has no real characteristic roots, preserves the full stable solution space by first-coordinate projection, and preserves bijectivity of every finite collection of boundary measurements transported by that projection. Its leading coefficient has determinant one and inverse entries linear in a0,…,ama_0,\ldots,a_m. The extra boundary expression (S37) requires orders less than mm and τ>0\tau>0.

Define

P̂τ(z)=Cτ−1Pτ(z).(S38) \widehat P_\tau(z)=C_\tau^{-1}P_\tau(z). \tag{S38}

It is monic of degree mm. Left multiplication by the invertible constant matrix changes neither the differential equation’s solutions nor any of their boundary measurements. Because det⁡Cτ=1\det C_\tau=1, it also leaves (S27) unchanged. At τ=0\tau=0, (S23) gives C0=IC_0=I, so the starting polynomial is unchanged. At τ=1\tau=1,

P̂1(z)=L(z)m−1(zI−A*)(S39) \widehat P_1(z)=L(z)^{m-1}(zI-A_*) \tag{S39}

for a matrix A*A_* with no real eigenvalues: the first-order factor is monic and its determinant is det⁡p(z)\det p(z). Thus its stable equation can be further deformed by Section 5. The scalar factor in (S39) has only the lower root −iλ-i\lambda; cancellation of that factor is valid for bounded solutions by Section 10, and is not an equality of full solution spaces.

The preceding construction begins with a monic polynomial because its Cauchy coordinates use the leading identity. For an original polynomial p(z)=pmzm+∑j=0m−1pjzj,pm∈GL⁡(E), p(z)=p_m z^m+\sum_{j=0}^{m-1}p_jz^j,\qquad p_m\in\operatorname{GL}(E), retain pp and every leading-coefficient factor. Set r(z)=pm−1p(z)r(z)=p_m^{-1}p(z) only to calculate the monic comparison, and let Pτ[r]P_\tau[r] and Cτ[r]C_\tau[r] denote (S20)–(S23) formed from rr. The expression pm−1pp_m^{-1}p is used only for this comparison; multiplication is on the left. The family attached to the original equation is 𝒫τ(z)=diag⁡(pm,I,…,I)Pτ[r](z). \mathcal P_\tau(z) =\operatorname{diag}(p_m,I,\ldots,I)P_\tau[r](z). Its first row has the original left factor pmp_m; the other rows are unchanged. In particular, 𝒫0(z)=diag⁡(p(z),L(z)mI,…,L(z)mI),det⁡𝒫τ(z)=det⁡p(z)L(z)m(m−1)N. \mathcal P_0(z)=\operatorname{diag}(p(z),L(z)^mI,\ldots,L(z)^mI), \qquad \det\mathcal P_\tau(z)=\det p(z)\,L(z)^{m(m-1)N}. The determinant identity follows without cancellation: det⁡r(z)=(det⁡pm)−1det⁡p(z)\det r(z)=(\det p_m)^{-1}\det p(z), while left multiplication contributes det⁡pm\det p_m. The leading matrix is 𝒞τ=diag⁡(pm,I,…,I)Cτ[r],det⁡𝒞τ=det⁡pm,𝒞τ−1=Cτ[r]−1diag⁡(pm−1,I,…,I). \mathcal C_\tau =\operatorname{diag}(p_m,I,\ldots,I)C_\tau[r], \qquad \det\mathcal C_\tau=\det p_m,\qquad \mathcal C_\tau^{-1} =C_\tau[r]^{-1}\operatorname{diag}(p_m^{-1},I,\ldots,I). These orders follow from matrix multiplication; no commutation of pmp_m with the other coefficients is used. Since the diagonal left factor is invertible, 𝒫τ(D)U=0\mathcal P_\tau(D)U=0 if and only if Pτ[r](D)U=0P_\tau[r](D)U=0, and p(D)u=0p(D)u=0 if and only if r(D)u=0r(D)u=0. Thus the first-coordinate stable isomorphism and every transported boundary measurement remain exact for the original equation. The monic comparison satisfies 𝒞τ−1𝒫τ=Cτ[r]−1Pτ[r]\mathcal C_\tau^{-1}\mathcal P_\tau=C_\tau[r]^{-1}P_\tau[r]; it does not erase det⁡pm\det p_m from the original family. For singular pmp_m, this comparison is unavailable and the full mNmN-dimensional Cauchy space can fail, as Problem 6 shows.

13. Example: cubic time factors in a four-dimensional stable space

Let E=ℂ2E=\mathbb C^2, let κ≠0\kappa\ne0, and consider

p(z)=((z−i)2κ0(z−i)2). p(z)= \begin{pmatrix}(z-i)^2&\kappa\\0&(z-i)^2\end{pmatrix}.

It is monic of degree two, and its determinant is (z−i)4(z-i)^4, so every solution is stable. To see all four coordinates directly, write

u2(t)=e−t(a+bt),u1(t)=e−t(c+dt+κa2t2+κb6t3). u_2(t)=e^{-t}(a+bt),\qquad u_1(t)=e^{-t} \left(c+dt+\frac{\kappa a}{2}t^2+\frac{\kappa b}{6}t^3\right).

Since (D−i)(e−tf)=−ie−tf′(D-i)(e^{-t}f)=-ie^{-t}f', substitution proves the equation. The free constants a,b,c,da,b,c,d give all four solutions by Cauchy uniqueness. Thus a second-order matrix equation can contain a cubic polynomial times an exponential; the order of the scalar equation alone does not bound the length of a generalized chain for the full state matrix. In agreement, the upper-right entry of p(z)−1p(z)^{-1} is −κ(z−i)−4-\kappa(z-i)^{-4}.

The pair of measurements u(0)∈Eu(0)\in E, Du(0)∈EDu(0)\in E is complementing because every Cauchy jet is stable. Under the construction with λ=2\lambda=2, the stabilized system has determinant (z−i)4(z+2i)4(z-i)^4(z+2i)^4. Its stable dimension remains four, while its total solution dimension is eight.

14. Example: noncommuting coefficients and an unsuitable trace

Consider

p(z)=((z−i)210(z+2i)2). p(z)= \begin{pmatrix}(z-i)^2&1\\0&(z+2i)^2\end{pmatrix}.

Its coefficients p1=diag⁡(−2i,4i)p_1=\operatorname{diag}(-2i,4i) and p0=(−110−4)p_0=\left(\begin{smallmatrix}-1&1\\0&-4\end{smallmatrix}\right) do not commute: p1p0−p0p1p_1p_0-p_0p_1 has upper-right entry −6i-6i. The determinant is (z−i)2(z+2i)2(z-i)^2(z+2i)^2. A bounded solution must have u2=0u_2=0, since its second component solves (D+2i)2u2=0(D+2i)^2u_2=0. Therefore

u(t)=(e−t(a+bt),0),a,b∈ℂ. u(t)=\big(e^{-t}(a+bt),0\big),\qquad a,b\in\mathbb C.

The stable dimension is two. The ordinary vector trace u(0)∈ℂ2u(0)\in\mathbb C^2 has image ℂ×{0}\mathbb C\times\{0\} and a one-dimensional kernel, despite equality of source and target dimensions. In contrast, the two scalar measurements

B1(D)u(0)=u1(0)=a,B2(D)u(0)=Du1(0)=i(a−b) B_1(D)u(0)=u_1(0)=a,\qquad B_2(D)u(0)=Du_1(0)=i(a-b)

are bijective onto ℂ⊕ℂ\mathbb C\oplus\mathbb C. The entire construction above applies without changing the coefficient order or imposing a scalar boundary model.

15. Problems with solutions

Problem 1: a real root at the boundary of the hypothesis. Let Aε=(iε10iε)A_\varepsilon=\left(\begin{smallmatrix}i\varepsilon&1\\0&i\varepsilon\end{smallmatrix}\right), for real ε\varepsilon. Determine the positive-half-line bounded initial values, including ε=0\varepsilon=0. Explain the failure of a continuous stable projection across zero.

Solution. The solution is e−εt(v1+itv2,v2)e^{-\varepsilon t}(v_1+itv_2,v_2). For ε>0\varepsilon>0, every initial vector is stable. For ε<0\varepsilon<0, only zero is bounded. At zero, precisely vectors with v2=0v_2=0 are bounded, and their solutions are constant. Thus the bounded dimensions are respectively two, zero, and one. The upper spectral projection is II for positive ε\varepsilon and zero for negative ε\varepsilon, so cannot extend continuously across zero. At zero, boundedness does not imply decay, and the upper/lower splitting omits the real generalized eigenspace. This identifies why the no-real-spectrum hypothesis is used.

Problem 2: the smallest block homotopy. For m=2m=2, write PτP_\tau, its leading coefficient, and an inverse of that coefficient. Verify the determinant-one assertion without commutativity assumptions.

Solution. With a0+a1+a2=Ia_0+a_1+a_2=I,

Pτ=((1−τ2)p+τ2a0L2τ(a1L2+a2RL)−τRLL2I). P_\tau= \begin{pmatrix} (1-\tau^2)p+\tau^2a_0L^2&\tau(a_1L^2+a_2RL)\\ -\tau RL&L^2I \end{pmatrix}.

Writing b=τ(a1+a2)b=\tau(a_1+a_2), its leading coefficient and inverse are

Cτ=(I−τbb−τII)=(Ib0I)(I0−τII),Cτ−1=(I−bτII−τb). C_\tau= \begin{pmatrix}I-\tau b&b\\-\tau I&I\end{pmatrix} =\begin{pmatrix}I&b\\0&I\end{pmatrix} \begin{pmatrix}I&0\\-\tau I&I\end{pmatrix}, \qquad C_\tau^{-1}= \begin{pmatrix}I&-b\\\tau I&I-\tau b\end{pmatrix}.

Multiplying the two displayed factors or multiplying CτCτ−1C_\tau C_\tau^{-1} verifies the formulas; no two unrelated coefficient matrices are interchanged. Each triangular factor has determinant one. In addition, (S27) reads det⁡Pτ=det⁡pL2N\det P_\tau=\det p\,L^{2N}.

Problem 3: boundary orders beyond the coordinate basis. Let B(z)∈Hom⁡(E,G)[z]B(z)\in\operatorname{Hom}(E,G)[z] have arbitrary finite degree and let pp be monic of degree mm. Prove a unique division formula B=Qp+RBB=Qp+R_B with deg⁡RB<m\deg R_B<m. Which factor order is required, and what does this imply on solutions?

Solution. If BB has leading term bzdbz^d with d≥md\geq m, subtract bzd−mp(z)bz^{d-m}p(z). The leading term cancels because pm=Ip_m=I, and the degree decreases. Iterating constructs Q∈Hom⁡(E,G)[z]Q\in\operatorname{Hom}(E,G)[z] and RBR_B of degree below mm. If two decompositions exist, a nonzero difference Q1−Q2Q_1-Q_2 of degree ss makes (Q1−Q2)p(Q_1-Q_2)p have degree exactly s+ms+m, since its leading coefficient is unchanged by multiplication by II. It cannot equal a polynomial of degree below mm; hence both differences vanish. The required order is QpQp, which composes E→pE→QGE\xrightarrow{p}E\xrightarrow{Q}G. On constant-coefficient solutions, B(D)u=RB(D)uB(D)u=R_B(D)u. This justifies normal-order reduction for this algebraic model. A PDE with variable coefficients or tangential orders needs its own division and mapping argument.

Problem 4: a negative power of the homotopy parameter. Take m=2m=2, B(z)=zB(z)=z, and any stable scalar solution uu. Find β0,β1\beta_0,\beta_1, verify (S37), and identify its valid zero-parameter interpretation.

Solution. Since z=12(z+iλ)+12(z−iλ)z=\tfrac12(z+i\lambda)+\tfrac12(z-i\lambda), one has β0=β1=1/2\beta_0=\beta_1=1/2. For τ>0\tau>0, the recurrence gives LU1=τRU0LU_1=\tau RU_0, so 12LU0+12τLU1=12(L+R)U0=DU0\tfrac12 LU_0+\tfrac1{2\tau}LU_1=\tfrac12(L+R)U_0=DU_0. At zero, the stable lift has U1=0U_1=0; inserting this into τ−1LU1\tau^{-1}LU_1 is undefined. The correct boundary functional remains DU0(0)DU_0(0) from (S34). Along a lifted family, its limiting value can be computed before setting τ=0\tau=0, using τ−1LU1=RU0\tau^{-1}LU_1=RU_0. It is not an ambient formula at zero.

Problem 5: nilpotent coalescence at the last endpoint. Let AA be the direct sum of the blocks iI+NiI+N on ℂ2\mathbb C^2, 2i2i on ℂ\mathbb C, and −3i-3i on ℂ\mathbb C, where N=(0100)N=\left(\begin{smallmatrix}0&1\\0&0\end{smallmatrix}\right). Describe (S12) when λ=1\lambda=1.

Solution. The first block is iI+(1−τ)NiI+(1-\tau)N, the next is i(2−τ)i(2-\tau), and the last is −i(3−2τ)-i(3-2\tau). The upper projection is always diag⁡(I2,1,0)\operatorname{diag}(I_2,1,0). For τ<1\tau<1, the first and second upper blocks have distinct eigenvalues; at one, their eigenvalues coalesce at ii and the nilpotent part of the first vanishes. The full ii-eigenspace at one has dimension three. Thus individual primary summands associated with distinct spectral values have merged, while the upper spectral subspace has remained the same three-dimensional space throughout.

Problem 6: why the leading coefficient matters. Treat r(z)=diag⁡(z,1)r(z)=\operatorname{diag}(z,1) as a degree-one matrix polynomial on ℂ2\mathbb C^2. Determine the solutions and compare their dimension with the formal count mdim⁡Em\dim E.

Solution. The equations are Du1=0Du_1=0 and u2=0u_2=0, so the solution space is one-dimensional, although mdim⁡E=2m\dim E=2. The leading coefficient is diag⁡(1,0)\operatorname{diag}(1,0), which is singular. Initial values are constrained, and multiplication by the inverse leading coefficient is impossible. In contrast, a genuinely monic degree-one polynomial supplies two free initial coordinates. This example concerns the leading-coefficient hypothesis; its determinant also has a real root, so it is not an example within the stable reduction theorem.

16. Full original factors in the spectral and Cauchy maps

We make explicit every scalar and matrix leading factor used by Sections 1–5 and 12. The original characteristic multiplicities, nilpotent orders, projection maps, Cauchy coordinates and contour conventions remain in the calculation. The bounded-mode classification at real roots and the complete original-leading-matrix numerator map are stated as additional results; they do not silently change the no-real-root assumptions of the earlier reduction.

The entry proof is Polynomial and contour interfaces for stable boundary models, Sections 2–4 and 9: original polynomial division and Bézout, full complex roots/factorization, original scalar units, determinant signs, kernel coordinates and both invariant quotient maps. We retain the finite basis and scalar-calculus entry definitions used there. Each argument below preserves the chosen original norm and actual coordinates; no Jordan decomposition or selected smooth eigenvalue branch is assumed.

16.1. The original annihilator and complete primary projection maps

Let VV be the original finite-dimensional complex vector space, n=dim⁡Vn=\dim V, and A∈End⁡(V)A\in\operatorname{End}(V). Cayley–Hamilton in Section 4 of Polynomial and contour interfaces for stable boundary models supplies a nonzero annihilator. Keep an original least-degree nonzero annihilator mm, with original leading coefficient cm≠0c_m\ne0. That lesson proves that mm divides every annihilator. For n>0n>0, mm is nonconstant, because a nonzero constant acts as that nonzero scalar times the nonzero identity. The full factorization proved there is m(z)=cm∏λ∈Z(m)hλ(z),hλ(z)=(z−λ)νλ,νλ≥1,Hλ(z)=∏μ≠λhμ(z),Mλ(z)=m(z)/hλ(z)=cmHλ(z).(SR1) \begin{gathered} m(z)=c_m\prod_{\lambda\in Z(m)}h_\lambda(z),\quad h_\lambda(z)=(z-\lambda)^{\nu_\lambda},\quad \nu_\lambda\geq1,\quad\\ H_\lambda(z)=\prod_{\mu\ne\lambda}h_\mu(z),\quad M_\lambda(z)=m(z)/h_\lambda(z)=c_mH_\lambda(z). \end{gathered} \tag{SR1} Every original leading unit and root multiplicity is retained. A least-degree choice is unique up to its nonzero original scalar unit, by division in both directions. The named monic polynomial is exactly cm−1mc_m^{-1}m, as a comparison; it does not replace mm in this calculation.

The coprime-factor proof in Section 3 of Polynomial and contour interfaces for stable boundary models gives aλhλ+bλHλ=1a_\lambda h_\lambda+b_\lambda H_\lambda=1. In the original quotient calculation set βλ=cm−1bλ\beta_\lambda=c_m^{-1}b_\lambda. The full identities are aλhλ+βλMλ=1,eλ=βλMλ=cm−1bλcmHλ,Qλ=(cm−1bλ)(A)(cmHλ)(A).(SR2) a_\lambda h_\lambda+\beta_\lambda M_\lambda=1,\qquad e_\lambda=\beta_\lambda M_\lambda =c_m^{-1}b_\lambda\,c_mH_\lambda,\qquad Q_\lambda=(c_m^{-1}b_\lambda)(A)(c_mH_\lambda)(A). \tag{SR2} For the factor hλh_\lambda, eλe_\lambda is one modulo that factor; for every other factor it is zero. Thus each of ∑λeλ−1\sum_\lambda e_\lambda-1, eλ2−eλe_\lambda^2-e_\lambda, and eλeμe_\lambda e_\mu for λ≠μ\lambda\ne\mu is divisible by every factor. The exact Bézout divisibility proof in Section 3 of Polynomial and contour interfaces for stable boundary models makes it divisible by their full product H=cm−1mH=c_m^{-1}m. Its evaluation is zero because H(A)=cm−1m(A)=0H(A)=c_m^{-1}m(A)=0. Consequently Qλ2=Qλ,QλQμ=0(λ≠μ),∑λQλ=IV,V=⨁λWλ,Wλ=im⁡Qλ=ker⁡(A−λI)νλ.(SR3) Q_\lambda^2=Q_\lambda,\quad Q_\lambda Q_\mu=0\ (\lambda\ne\mu), \quad\sum_\lambda Q_\lambda=I_V,\quad V=\bigoplus_\lambda W_\lambda,\quad W_\lambda=\operatorname{im}Q_\lambda =\ker(A-\lambda I)^{\nu_\lambda}. \tag{SR3} Here the image equality is an exact map: hλeλ=βλmh_\lambda e_\lambda=\beta_\lambda m gives the first inclusion; 1−eλ=aλhλ1-e_\lambda=a_\lambda h_\lambda gives v=Qλvv=Q_\lambda v on the kernel. Applying QμQ_\mu to a zero sum proves directness. Each projection commutes with AA, since it is an evaluated scalar polynomial.

A different Bézout choice has the same factorwise remainders. Its difference from eλe_\lambda is a multiple of H=cm−1mH=c_m^{-1}m, whose full evaluation is zero. Thus it gives the same actual QλQ_\lambda, not just the same abstract summand. Under an original coordinate change TT, polynomial evaluation gives f(T−1AT)=T−1f(A)Tf(T^{-1}AT)=T^{-1}f(A)T: expand every finite power and use the ordered adjacent products TT−1=ITT^{-1}=I. Applied separately to both factors in (SR2), this gives (cm−1bλ)(T−1AT)(cmHλ)(T−1AT)=T−1QλT.(SR4) (c_m^{-1}b_\lambda)(T^{-1}AT) (c_mH_\lambda)(T^{-1}AT)=T^{-1}Q_\lambda T. \tag{SR4} This is the exact coordinate map for the full original projection.

If V=0V=0, a least-degree annihilator can be the original nonzero constant m=cmm=c_m. Its root set is empty, and the empty projection sum is zero, exactly the identity of the zero vector space. The empty decomposition in (SR3) therefore includes that case without adding a root or assigning a multiplicity.

16.2. Actual nilpotent order and characteristic multiplicity

On WλW_\lambda define the original restricted operator Nλ=A|Wλ−λIWλN_\lambda=A|_{W_\lambda}-\lambda I_{W_\lambda}. Equation (SR3) gives Nλνλ=0N_\lambda^{\nu_\lambda}=0. In fact every WλW_\lambda is nonzero and this exponent is exact.

To prove both assertions without a Jordan assumption, suppose that Nλνλ−1=0N_\lambda^{\nu_\lambda-1}=0, also including an empty WλW_\lambda. The original polynomial mλ(z)=m(z)/(z−λ)=cm(z−λ)νλ−1∏μ≠λ(z−μ)νμ(SR5) m_\lambda(z)=m(z)/(z-\lambda) =c_m(z-\lambda)^{\nu_\lambda-1} \prod_{\mu\ne\lambda}(z-\mu)^{\nu_\mu} \tag{SR5} would annihilate WλW_\lambda by that supposed zero power. It annihilates every other WμW_\mu through the retained full factor (A−μI)νμ(A-\mu I)^{\nu_\mu}. The direct sum (SR3) would then make it an annihilator of VV, with its original nonzero leading coefficient cmc_m and degree one less than mm. Minimality excludes this. Hence Nλνλ−1≠0N_\lambda^{\nu_\lambda-1}\ne0; in particular Wλ≠0W_\lambda\ne0.

Choose an actual w∈Wλw\in W_\lambda for which Nλνλ−1w≠0N_\lambda^{\nu_\lambda-1}w\ne0. The original vectors w,Nλw,…,Nλνλ−1ww,N_\lambda w,\ldots,N_\lambda^{\nu_\lambda-1}w are independent. If their linear combination vanished, take its smallest index jj with nonzero coefficient and apply Nλνλ−1−jN_\lambda^{\nu_\lambda-1-j}. The full higher terms vanish by the known zero power, leaving that nonzero coefficient times the unchanged nonzero vector Nλνλ−1wN_\lambda^{\nu_\lambda-1}w, a contradiction. Thus 1≤νλ≤dλ,dλ=dim⁡Wλ.(SR6) 1\leq\nu_\lambda\leq d_\lambda, \qquad d_\lambda=\dim W_\lambda. \tag{SR6}

For the full determinant calculation choose a basis by successively extending bases of ker⁡Nλj\ker N_\lambda^j for j=0,…,νλj=0,\ldots,\nu_\lambda. The actual map sends each such space into the preceding one. In that ordered basis its matrix is upper triangular with every diagonal entry zero; no vector or matrix entry is rescaled. For the full original change of basis TλT_\lambda, the determinant identities proved there give det⁡(zIWλ−A|Wλ)=det⁡(Tλ)(z−λ)dλdet⁡(Tλ−1),det⁡(Tλ)det⁡(Tλ−1)=1.(SR7) \det(zI_{W_\lambda}-A|_{W_\lambda}) =\det(T_\lambda)(z-\lambda)^{d_\lambda}\det(T_\lambda^{-1}), \qquad \det(T_\lambda)\det(T_\lambda^{-1})=1. \tag{SR7} Choose bases of the original direct summands and concatenate them, with full coordinate matrix TT. The original operator is block diagonal in those coordinates. Its full characteristic polynomial is therefore χA(z)=det⁡(T)∏λ[det⁡(Tλ)(z−λ)dλdet⁡(Tλ−1)]det⁡(T−1).(SR8) \chi_A(z)=\det(T)\prod_\lambda \bigl[\det(T_\lambda)(z-\lambda)^{d_\lambda} \det(T_\lambda^{-1})\bigr]\det(T^{-1}). \tag{SR8} All determinant factors remain explicit and their inverse products are proved; the characteristic leading coefficient one was computed from the original permutation sums in the polynomial and contour lesson, rather than imposed on the original annihilator. Each root’s characteristic multiplicity is exactly dλd_\lambda, while the annihilator exponent is exactly νλ\nu_\lambda. The opposite determinant convention retains the full factor det⁡(A−zI)=(−1)nχA(z)\det(A-zI)=(-1)^n\chi_A(z).

An eigenvalue is a root of mm: if Av=λvAv=\lambda v, v≠0v\ne0, then the original finite polynomial gives m(A)v=m(λ)v=0m(A)v=m(\lambda)v=0. Conversely each Wλ≠0W_\lambda\ne0 has a nonzero vector in ker⁡Nλ\ker N_\lambda, for example Nλνλ−1wN_\lambda^{\nu_\lambda-1}w above. Thus Z(m)Z(m) is precisely the original spectrum. For n=0n=0, both spectra are empty and the actual characteristic determinant is the empty product one.

16.3. The original resolvent, pole orders and every unit factor

For z∉Z(m)z\notin Z(m), multiplication of the full finite geometric sum gives on the original summand (zI−A)−1|Wλ=∑k=0νλ−1Nλk(z−λ)k+1.(SR9) (zI-A)^{-1}|_{W_\lambda} =\sum_{k=0}^{\nu_\lambda-1} \frac{N_\lambda^k}{(z-\lambda)^{k+1}}. \tag{SR9} Indeed multiplication by (z−λ)I−Nλ(z-\lambda)I-N_\lambda produces the identity minus Nλνλ/(z−λ)νλN_\lambda^{\nu_\lambda}/(z-\lambda)^{\nu_\lambda}, and that full terminal term is zero by (SR3). The product in the opposite order is the same since every factor is a power of the same original restricted operator. Using (SR2)–(SR3), the full global operator formula is (zI−A)−1=∑λ∑k=0νλ−1(A−λI)k(cm−1bλ)(A)(cmHλ)(A)(z−λ)k+1.(SR10) (zI-A)^{-1} =\sum_\lambda\sum_{k=0}^{\nu_\lambda-1} \frac{(A-\lambda I)^k (c_m^{-1}b_\lambda)(A)(c_mH_\lambda)(A)} {(z-\lambda)^{k+1}}. \tag{SR10} Every actual scalar-unit and projection factor is present. Acting on each original summand proves both inverse identities for this original matrix; no leading coefficient has been dropped from the receiving map.

Multiplying (SR10) by the full power (z−λ)νλ(z-\lambda)^{\nu_\lambda} and taking z→λz\to\lambda gives limz→λ(z−λ)νλ(zI−A)−1=(A−λI)νλ−1(cm−1bλ)(A)(cmHλ)(A)≠0.(SR11) \lim_{z\to\lambda}(z-\lambda)^{\nu_\lambda}(zI-A)^{-1} =(A-\lambda I)^{\nu_\lambda-1} (c_m^{-1}b_\lambda)(A)(c_mH_\lambda)(A)\ne0. \tag{SR11} All terms with a smaller pole power at λ\lambda tend to zero; every term at a distinct root has a bounded nonzero denominator near λ\lambda and also tends to zero after that multiplication. The nonzero conclusion follows by applying the right side to the unchanged ww from Section 16.2. Hence the resolvent’s pole order is exactly νλ\nu_\lambda, which need not equal the characteristic multiplicity dλd_\lambda. This is an exact nonzero coefficient and limit, not merely a distinction between two names.

For example, in the original three coordinates let A=(λ100λ000λ),(zI−A)−1=((z−λ)−1(z−λ)−200(z−λ)−1000(z−λ)−1).(SR12) A=\begin{pmatrix}\lambda&1&0\\0&\lambda&0\\0&0&\lambda\end{pmatrix}, \quad (zI-A)^{-1}= \begin{pmatrix} (z-\lambda)^{-1}&(z-\lambda)^{-2}&0\\ 0&(z-\lambda)^{-1}&0\\0&0&(z-\lambda)^{-1} \end{pmatrix}. \tag{SR12} Direct multiplication gives both inverse identities and all displayed zeros. The full determinant is (z−λ)3(z-\lambda)^3. An original least-degree annihilator is cm(z−λ)2c_m(z-\lambda)^2, for any original cm≠0c_m\ne0: the actual nilpotent part has square zero and is nonzero. A nonzero degree-zero annihilator is impossible; a degree-one annihilator would have to vanish on all diagonal entries, leaving its nonzero leading coefficient in the actual upper-right entry, also impossible. Thus the characteristic multiplicity is three and the exact annihilator/resolvent order is two.

16.4. Original contour and exponential receivers at every order

Let Γ\Gamma be a finite integer linear combination of the original piecewise C1C^1 closed paths, avoiding every root. Keep ind⁡Γ(λ)=12πi∫Γdzz−λ.(SR13) \operatorname{ind}_\Gamma(\lambda) =\frac{1}{2\pi i}\int_\Gamma\frac{dz}{z-\lambda}. \tag{SR13} For a numerator ϕ\phi having its asserted globally convergent power series about each of these finitely many roots, the proved entire-series moment formula of Polynomial and contour interfaces for stable boundary models gives the full receiving identity 12πi∫Γϕ(z)(zI−A)−1dz=∑λind⁡Γ(λ)∑k=0νλ−1ϕ(k)(λ)k!(A−λI)k(cm−1bλ)(A)(cmHλ)(A).(SR14) \frac{1}{2\pi i}\int_\Gamma\phi(z)(zI-A)^{-1}\,dz =\sum_\lambda\operatorname{ind}_\Gamma(\lambda) \sum_{k=0}^{\nu_\lambda-1}\frac{\phi^{(k)}(\lambda)}{k!} (A-\lambda I)^k (c_m^{-1}b_\lambda)(A)(c_mH_\lambda)(A). \tag{SR14} This follows by integrating the actual finite sum (SR10). No sum/interchange beyond the proved scalar moments is needed. Every factorial, root repetition, nilpotent power, contour index and original projection factor remains. The stated entire-series hypothesis includes constants, polynomials and exponentials. No formula for an arbitrary holomorphic numerator on an arbitrary domain is inferred here.

For ϕ=1\phi=1, all higher derivatives vanish exactly; a contour with index one at precisely the selected roots and zero at the others therefore gives the sum of their actual QλQ_\lambda. For ϕ(z)=eitz\phi(z)=e^{itz}, the original derivative is ϕ(k)(λ)=(it)keitλ\phi^{(k)}(\lambda)=(it)^k e^{it\lambda}, so (SR14) retains all powers of i,ti,t and every factorial.

The corresponding exponential equality is obtained directly from the original operator series, without a contour assumption: EA(t)=∑r=0∞(itA)rr!=∑λeitλ∑k=0νλ−1(it)kk!(A−λI)k(cm−1bλ)(A)(cmHλ)(A).(SR15) E_A(t)=\sum_{r=0}^{\infty}\frac{(itA)^r}{r!} =\sum_\lambda e^{it\lambda} \sum_{k=0}^{\nu_\lambda-1}\frac{(it)^k}{k!} (A-\lambda I)^k (c_m^{-1}b_\lambda)(A)(c_mH_\lambda)(A). \tag{SR15} On each original WλW_\lambda, the two operators λI\lambda I and NλN_\lambda commute. Expand every finite binomial power of their sum. The scalar exponential majorants give absolute convergence on each compact time interval, including the differentiated series, so regrouping by the finitely many surviving powers k<νλk<\nu_\lambda is valid. The full factorial relation (rk)/r!=1/(k!(r−k)!)\binom{r}{k}/r!=1/(k!(r-k)!) gives the two series product. All higher nilpotent terms are the proved zero operators, not omitted nonzero contributions. Acting on the full direct sum proves (SR15).

Termwise differentiation of the actual series gives DtEA=AEAD_tE_A=AE_A, where Dt=−i∂tD_t=-i\partial_t, and repeated differentiation gives DtjEA=AjEAD_t^jE_A=A^jE_A. The original addition identity gives EA(−t)EA(t)=IE_A(-t)E_A(t)=I. Thus every solution of Dtu=AuD_tu=Au is u(t)=EA(t)vu(t)=E_A(t)v, because differentiating the full product EA(−t)u(t)E_A(-t)u(t) gives zero. Initial evaluation u↦u(0)u\mapsto u(0) and v↦EA(t)vv\mapsto E_A(t)v are inverse linear maps; these are the actual Cauchy maps used in the source.

16.5. Complete bounded-mode classification, including the real roots

First every linear map is bounded for the original chosen norm. Choose an actual basis v1,…,vnv_1,\ldots,v_n, retaining these vectors. If v=∑xjvjv=\sum x_jv_j, triangle inequality and Cauchy–Schwarz give ∥v∥≤B|x|2\|v\|\leq B|x|_2, with the full constant B=(∑j∥vj∥2)1/2B=(\sum_j\|v_j\|^2)^{1/2}. On the coordinate unit sphere the actual function x↦∥∑jxjvj∥x\mapsto\|\sum_jx_jv_j\| is continuous by that inequality, and is everywhere positive by independence. Coordinate compactness supplies its actual minimum b>0b>0. Homogeneity then gives b|x|2≤∥v∥b|x|_2\leq\|v\|. For any original linear map TT, this proves ∥Tv∥≤(∑j∥Tvj∥2)1/2b∥v∥.(SR16) \|Tv\|\leq \frac{(\sum_j\|Tv_j\|^2)^{1/2}}{b}\,\|v\|. \tag{SR16} Every original basis vector and both comparison constants are retained. These are comparison maps, not replacements of the original norm. In particular all projections and coordinate functionals used below are bounded. The zero-dimensional case requires no positive sphere minimum and every map is the zero map.

On WλW_\lambda, (SR15) gives for an actual vv ∥EA(t)v∥≤e−tIm⁡λ∑k=0νλ−1|t|kk!∥Nλkv∥.(SR17) \|E_A(t)v\|\leq e^{-t\,\operatorname{Im}\lambda} \sum_{k=0}^{\nu_\lambda-1} \frac{|t|^k}{k!}\|N_\lambda^kv\|. \tag{SR17} For Im⁡λ>0\operatorname{Im}\lambda>0 every full term tends to zero as t→+∞t\to+\infty. To prove the elementary exponential domination, choose any 0<a<Im⁡λ0<a<\operatorname{Im}\lambda. The scalar series gives eat≥(at)k+1/(k+1)!e^{at}\geq (at)^{k+1}/(k+1)! for t>0t>0, so tke−at≤(k+1)!/(ak+1t)t^ke^{-at}\leq(k+1)!/(a^{k+1}t). The remaining factor e−(Im⁡λ−a)te^{-(\operatorname{Im}\lambda-a)t} is bounded and tends to zero. Every derivative is covered by the same actual finite expansion with the additional fixed factor AjA^j.

Conversely take v≠0v\ne0 and the largest jj for which Nλjv≠0N_\lambda^jv\ne0. It exists and lies between zero and νλ−1\nu_\lambda-1. Some actual coordinate functional ℓ\ell has ℓ(Nλjv)≠0\ell(N_\lambda^jv)\ne0; boundedness was proved in (SR16), without changing vv or ℓ\ell. The complete scalar polynomial in ℓ(EA(t)v)=eitλ∑k=0jiktkk!ℓ(Nλkv)(SR18) \ell(E_A(t)v)=e^{it\lambda} \sum_{k=0}^j\frac{i^kt^k}{k!}\ell(N_\lambda^kv) \tag{SR18} has nonzero leading coefficient ijℓ(Nλjv)/j!i^j\ell(N_\lambda^jv)/j!. For t≥1t\geq1, the full reverse triangle inequality bounds its modulus below by |ℓ(Nλjv)|j!tj−∑k=0j−1|ℓ(Nλkv)|k!tk.(SR19) \frac{|\ell(N_\lambda^jv)|}{j!}t^j -\sum_{k=0}^{j-1}\frac{|\ell(N_\lambda^kv)|}{k!}t^k. \tag{SR19} If j≥1j\geq1, the lower sum is at most tj−1t^{j-1} times its full coefficient sum. Taking tt at least twice that coefficient sum divided by the actual nonzero leading modulus makes (SR19) at least half the full leading term. If j=0j=0, the lower sum is empty and the modulus is its exact nonzero constant.

It follows that when Im⁡λ<0\operatorname{Im}\lambda<0, every nonzero vv gives an unbounded solution on the positive half-line, since its scalar lower bound contains e−tIm⁡λe^{-t\operatorname{Im}\lambda}. When Im⁡λ=0\operatorname{Im}\lambda=0, it is bounded exactly when j=0j=0, equivalently Nλv=0N_\lambda v=0; then the solution is exactly eitλve^{it\lambda}v. On a general vv, applying the bounded actual projection QλQ_\lambda to a bounded solution isolates each such component; components cannot conceal one another’s growth. Thus the complete positive-half-line bounded initial space is BA+=⨁Im⁡λ>0Wλ⊕⨁Im⁡λ=0ker⁡(A−λI).(SR20) B_A^+=\bigoplus_{\operatorname{Im}\lambda>0}W_\lambda \ \oplus\ \bigoplus_{\operatorname{Im}\lambda=0} \ker(A-\lambda I). \tag{SR20} With t=−st=-s, s≥0s\geq0, the same full expansions and inequalities reverse the imaginary-part signs, giving BA−=⨁Im⁡λ<0Wλ⊕⨁Im⁡λ=0ker⁡(A−λI).(SR21) B_A^-=\bigoplus_{\operatorname{Im}\lambda<0}W_\lambda \ \oplus\ \bigoplus_{\operatorname{Im}\lambda=0} \ker(A-\lambda I). \tag{SR21} These formulas prove the precise additional real-root modes rather than simply discarding the no-real-root hypothesis. Under the original no-real-spectrum assumption in Section 3 the extra sums are empty, so its actual upper projection gives BA+=qAVB_A^+=q_AV, its lower projection gives BA−=(I−qA)VB_A^-=(I-q_A)V, and every such solution and derivative decays in its own half-line. The original stable dimension counts dλd_\lambda in the upper half-plane, by (SR8), whereas time-polynomial degree is bounded by νλ−1\nu_\lambda-1. Neither count can be substituted for the other.

16.6. Full ordered parameter derivatives and common contour bounds

For an original CrC^r family A(y)A(y), near a fixed parameter a compact contour avoiding its spectrum stays disjoint from nearby spectra. Indeed the original determinant is continuous on the compact contour, has a strictly positive modulus minimum there, and small changes of its full finitely many coefficients preserve half that minimum. Inversion is continuous through its full cofactor matrix divided by that nonzero determinant. Differentiating (zI−A)R=I(zI-A)R=I and multiplying by the actual inverse gives ∂jR=R(∂jA)R\partial_jR=R(\partial_jA)R, with this exact product order.

For a nonzero multiindex α\alpha, |α|≤r|\alpha|\leq r, the full formula is ∂αR=∑k=1|α|∑α1+⋯+αk=α|α1|,…,|αk|>0α!α1!⋯αk!R(∂α1A)R⋯(∂αkA)R.(SR22) \partial^\alpha R =\sum_{k=1}^{|\alpha|} \ \sum_{\substack{\alpha^1+\cdots+\alpha^k=\alpha\\ |\alpha^1|,\ldots,|\alpha^k|>0}} \frac{\alpha!}{\alpha^1!\cdots\alpha^k!} R(\partial^{\alpha^1}A)R\cdots (\partial^{\alpha^k}A)R. \tag{SR22} Here every inner list is ordered; matrices are never commuted. One direct proof retains the actual Neumann series R(y+h)=∑k≥0(R(y)(A(y+h)−A(y)))kR(y)R(y+h)=\sum_{k\geq0}(R(y)(A(y+h)-A(y)))^kR(y) for the original difference small enough that its operator product norm is less than one. Its finite Taylor coefficient at hαh^\alpha is the sum over ordered nonzero lists in (SR22); each coefficient is divided by α1!⋯αk!\alpha^1!\cdots\alpha^k!, and differentiation multiplies it by the full α!\alpha!. Terms with more than |α||\alpha| differences have no such coefficient. The remainder bounds in the finite Taylor theorem and the geometric-series tail make the coefficient passage valid through order rr. Equivalently, labeling each of the |α||\alpha| successive derivative applications partitions the labels into ordered nonempty batches; their multinomial counts are precisely the displayed coefficients. Both constructions include every repeated derivative and every original factor.

For a compact parameter set with no real spectrum, the original norm has a common bound MM for A(y)A(y), and every eigenvalue satisfies |λ|≤M|\lambda|\leq M by the original eigenvector inequality in Section 9.8 of Polynomial and contour interfaces for stable boundary models. A hypothetical sequence of spectral points whose imaginary parts tend to zero has a convergent parameter subsequence and a bounded complex-point subsequence. Continuity of the original full determinant would give a real eigenvalue at the limit, contradicting the original hypothesis. Thus there is an actual gap g>0g>0.

Choose an original positive rectangle enclosing all upper roots, with lower height 0<γ<g0<\gamma<g, upper height greater than MM, and left/right coordinates beyond −M,M-M,M. Its orientation and all its edges are retained; the proven rectangle index is one at every upper root and zero at every lower root. Let LΓL_\Gamma be its full length and let CR=sup⁡y,z∈K×Γ∥R(y,z)∥C_R=\sup_{y,z\in K\times\Gamma}\|R(y,z)\|. This is finite by the original determinant/cofactor continuity and compactness. The original contour formula therefore gives ∥DtjEA(y)(t)qA(y)∥≤LΓ2π(supz∈Γ|z|j)CRe−γt,t≥0.(SR23) \|D_t^jE_{A(y)}(t)q_{A(y)}\| \leq \frac{L_\Gamma}{2\pi} \bigl(\sup_{z\in\Gamma}|z|^j\bigr) C_R e^{-\gamma t}, \qquad t\geq0. \tag{SR23} The full 1/(2πi)1/(2\pi i) contour factor yields 1/(2π)1/(2\pi) in the norm bound, and Dtjeitz=zjeitzD_t^j e^{itz}=z^j e^{itz} retains the original differential convention.

For each parameter derivative in a fixed original chart, insert every term of (SR22) into the same contour. Its original operator norm is bounded by LΓ2πsupΓ|z|je−γt∑k=1|α|∑α1+⋯+αk=α|αℓ|>0α!α1!⋯αk!CRk+1∏ℓ=1ksupy∈K∥∂αℓA(y)∥.(SR24) \frac{L_\Gamma}{2\pi}\sup_\Gamma|z|^j\, e^{-\gamma t} \sum_{k=1}^{|\alpha|} \ \sum_{\substack{\alpha^1+\cdots+\alpha^k=\alpha\\ |\alpha^\ell|>0}} \frac{\alpha!}{\alpha^1!\cdots\alpha^k!} C_R^{\,k+1}\prod_{\ell=1}^k \sup_{y\in K}\|\partial^{\alpha^\ell}A(y)\|. \tag{SR24} For α=0\alpha=0 the actual bound is (SR23). The finite derivative bounds hold in each chart on the compact set under consideration. This proves the full regularity and uniform decay statements in Section 4 even when roots collide in one half-plane; no selection of individual smooth roots was used. It makes no global gap claim on a noncompact parameter set.

16.7. Original matrix-polynomial Cauchy and numerator maps

In this section mm has the original meaning in Section 2 as matrix-polynomial order. Keep p(z)=pmzm+∑j=0m−1pjzjp(z)=p_m z^m+\sum_{j=0}^{m-1}p_jz^j, with m≥1m\geq1, pm∈GL⁡(E)p_m\in\operatorname{GL}(E), and all original matrix coefficients in their original order. If E=0E=0, all state spaces and solution spaces are zero and every determinant is the empty product one. Otherwise let N=dim⁡E>0N=\dim E>0. The actual original-equation companion and jet maps are C(x0,…,xm−1)=(x1,…,xm−1,−∑j=0m−1pm−1pjxj),Ju=(u,Du,…,Dm−1u).(SR25) C(x_0,\ldots,x_{m-1}) =(x_1,\ldots,x_{m-1},-\sum_{j=0}^{m-1}p_m^{-1}p_jx_j), \qquad Ju=(u,Du,\ldots,D^{m-1}u). \tag{SR25} The original equation implies D(Ju)=CJuD(Ju)=CJu through its last row after multiplying on the left by the displayed pm−1p_m^{-1}. Conversely the first m−1m-1 rows give every jet coordinate from the first, and multiplying the full last row by the original pmp_m gives exactly pmDmu+∑j=0m−1pjDju=0p_mD^mu+\sum_{j=0}^{m-1}p_jD^ju=0. Both implications retain every left factor and do not commute any coefficients. Therefore the actual map u↦Ju(0)u\mapsto Ju(0) is inverse to x↦π0EC(t)xx\mapsto \pi_0 E_C(t)x, by the already proved first-order uniqueness; the original solution dimension is mNmN.

For a direct characteristic calculation make the original triangular coordinate change x0=y0,xj=zxj−1+yjx_0=y_0,\ x_j=zx_{j-1}+y_j, 1≤j<m1\leq j<m, on the state coordinates. Its original block diagonal is all identities, so its determinant is one. The first m−1m-1 output rows of (zI−C)x(zI-C)x are −y1,…,−ym−1-y_1,\ldots,-y_{m-1}. The coefficient of y0y_0 in the last row is exactly pm−1p(z)p_m^{-1}p(z), with this order. Move that last block row to the front: its full sign is (−1)N2(m−1)(-1)^{N^2(m-1)}. Each remaining negative identity gives the total factor (−1)N(m−1)(-1)^{N(m-1)}. Eliminate every other entry of the first row by those identity rows, retaining the original determinant under each row addition. Thus det⁡(zIEm−C)=(−1)N2(m−1)(−1)N(m−1)det⁡(pm−1p(z))=(−1)N2(m−1)(−1)N(m−1)det⁡(pm−1)det⁡p(z).(SR26) \det(zI_{E^m}-C) =(-1)^{N^2(m-1)}(-1)^{N(m-1)} \det(p_m^{-1}p(z)) =(-1)^{N^2(m-1)}(-1)^{N(m-1)} \det(p_m^{-1})\det p(z). \tag{SR26} Both signs are retained and their product is one because their full exponent is N(N+1)(m−1)N(N+1)(m-1), an even integer. Also det⁡(pm−1)det⁡pm=1\det(p_m^{-1})\det p_m=1 by the original determinant multiplication proof. Hence the nonzero original prefactor preserves every root and multiplicity through an explicit scalar-unit map. It is not a replacement of the original determinant. All formulas include m=1m=1, where the negative block list and row permutation are empty.

The full original polynomial numerator of an arbitrary actual state is 𝒰xp(z)=∑0≤k≤j<mpj+1xj−kzk,𝒰xp(z)=∑k=0m−1ukzk.(SR27) \mathcal U_x^p(z) =\sum_{0\leq k\leq j<m}p_{j+1}x_{j-k}z^k,\qquad \mathcal U_x^p(z)=\sum_{k=0}^{m-1}u_kz^k. \tag{SR27} Here pmp_m is the original invertible leading matrix, including at the highest coefficient um−1=pmx0u_{m-1}=p_mx_0. The inverse map from the full numerator coefficients is the ordered triangular recursion xr=pm−1(um−1−r−∑q=0r−1pm−r+qxq),r=0,…,m−1.(SR28) x_r=p_m^{-1} \left(u_{m-1-r} -\sum_{q=0}^{r-1}p_{m-r+q}x_q\right), \qquad r=0,\ldots,m-1. \tag{SR28} For r=0r=0 the sum is empty. To verify each row, the coefficient of zm−1−rz^{m-1-r} in (SR27) is ∑q=0rpm−r+qxq\sum_{q=0}^r p_{m-r+q}x_q; its last term is precisely pmxrp_mx_r. Multiplication on the left by the actual inverse yields (SR28). Thus the original numerator map is a linear bijection, with every matrix order and leading factor explicit. Its monic comparison r(z)=pm−1p(z)r(z)=p_m^{-1}p(z) has 𝒰xr=pm−1𝒰xp\mathcal U_x^r=p_m^{-1}\mathcal U_x^p; the comparison does not erase pmp_m from either actual forward or inverse map.

To find the first coordinate of the actual resolvent solve (zI−C)w=x(zI-C)w=x. Its first m−1m-1 rows give wj=zjw0−∑q=0j−1zj−1−qxq,p(z)w0=𝒰xp(z),π0(zI−C)−1x=p(z)−1𝒰xp(z).(SR29) w_j=z^jw_0-\sum_{q=0}^{j-1}z^{j-1-q}x_q,\quad p(z)w_0=\mathcal U_x^p(z),\quad \pi_0(zI-C)^{-1}x=p(z)^{-1}\mathcal U_x^p(z). \tag{SR29} For the last row, multiply by the original pmp_m and substitute all preceding rows. Its right side becomes the full sum pmxm−1+pm∑q=0m−2zm−1−qxq+∑j=1m−1pj∑q=0j−1zj−1−qxqp_mx_{m-1}+p_m\sum_{q=0}^{m-2}z^{m-1-q}x_q+ \sum_{j=1}^{m-1}p_j\sum_{q=0}^{j-1}z^{j-1-q}x_q. For each original xqx_q, its coefficient is exactly ∑j=qm−1pj+1zj−q\sum_{j=q}^{m-1}p_{j+1}z^{j-q}, proving the second identity. All denominators are legitimate exactly away from the original roots by (SR26) and the actual determinant-inverse criterion; no linear factorization of a matrix polynomial has been assumed. Applying the already proved exponential contour receiver to the original CC gives u(t)=12πi∫Γp(z)−1𝒰xp(z)eitzdz,Ju(0)=x.(SR30) u(t)=\frac{1}{2\pi i}\int_\Gamma p(z)^{-1}\mathcal U_x^p(z)e^{itz}\,dz, \qquad Ju(0)=x. \tag{SR30} Every root multiplicity, matrix pole order, original leading factor, factorial in the earlier scalar pole moments and the original contour prefactor is retained. This is the full original-equation receiving extension of the monic formula (S7) in Section 2; its arbitrary numerator is unique through (SR28).

Boundedness of the original first component gives boundedness of the full original state without assuming spectral separation. With the original state and component norms let h(x)=∫01∥π0EC(s)x∥2dsh(x)=\int_0^1\|\pi_0E_C(s)x\|^2\,ds. If h(x)=0h(x)=0, continuity makes its integrand zero on the entire interval. The first-coordinate solution is then identically zero there. Its derivatives at zero vanish, and its Cauchy coordinates x0,…,xm−1x_0,\ldots,x_{m-1} vanish by the first rows of (SR25). Thus hh is positive on the original nonzero state space. Its continuity follows from the original finite matrix exponential and norm bounds; the original unit sphere is compact by the retained coordinate comparisons (SR16). Let c>0c>0 be its actual minimum on that sphere. Homogeneity and the original flow addition rule then give c∥Ju(t)∥2≤∫01∥u(t+s)∥2ds,t≥0.(SR31) c\|Ju(t)\|^2\leq \int_0^1\|u(t+s)\|^2\,ds,\qquad t\geq0. \tag{SR31} Hence a bounded uu has a bounded original jet; conversely its first-coordinate projection is bounded whenever its jet is bounded. The exact derivative conventions are Dtku=π0CkJu(t)D_t^ku=\pi_0C^kJu(t) and ∂tku=ikπ0CkJu(t)\partial_t^ku=i^k\pi_0C^kJu(t), retaining the full original factor iki^k. The actual finite operator norm bounds prove boundedness for every derivative. The negative-half-line proof uses the original interval [−1,0][-1,0] with its own positive minimum and the same exact Cauchy map. For the zero state space the implication is immediate and no minimum on an empty sphere is introduced.

When the original determinant has no real roots, (SR26), (SR20)–(SR21) and (SR31) identify the original bounded solution space with the companion’s upper primary space and prove decay of every derivative. Its dimension is the sum of the upper-root algebraic multiplicities of the original det⁡p\det p, with the original det⁡(pm−1)\det(p_m^{-1}) map displayed in (SR26). The full leading-coefficient homotopy and transported boundary measurements in Section 12 retain their separate original formulas and proofs. Formulas (SR25)–(SR31) give the complete original-equation Cauchy, numerator, resolvent and contour maps without dropping its leading matrix.

17. Bounded profiles with complex parameters

This separate extension allows real characteristic roots and complex stabilization parameters. Sections 3–12 keep their original stable, no-real-root statements. Here bounded profiles may contain nondecaying real-root modes. The complete classification and jet estimate in Sections 16.5 and 16.7 provide the additional argument; no uniform bundle claim through a real-root crossing is made.

17.1. The original polynomial and its full stabilized family

Keep the original finite-dimensional complex space, its chosen norm, and p(z)=pmzm+∑j=0m−1pjzj,pm∈GL⁡(E),m>1,N=dim⁡E,D=−i∂t.(SB1) p(z)=p_mz^m+\sum_{j=0}^{m-1}p_jz^j,\quad p_m\in\operatorname{GL}(E),\quad m>1,\quad N=\dim E, \quad D=-i\partial_t. \tag{SB1} There is no restriction on the real roots of det⁡p\det p. Fix τ∈ℂ,λ∈ℂ,α=Re⁡λ>0,L(z)=z+iλ,R(z)=z−iλ.(SB2) \tau\in\mathbb C,\qquad \lambda\in\mathbb C, \qquad \alpha=\operatorname{Re}\lambda>0, \qquad L(z)=z+i\lambda,\quad R(z)=z-i\lambda. \tag{SB2} Use r(z)=pm−1p(z)r(z)=p_m^{-1}p(z) only for the coefficient calculation (S15)–(S17), retaining the original polynomial. Those identities use λ≠0\lambda\ne0, scalar polynomial algebra and the actual ordered coefficients; their proofs hold for complex λ\lambda without a positivity assumption. Form Pτ[r]P_\tau[r] by exactly (S20)–(S21), with every displayed power of τ\tau, including the empty middle sum when m=2m=2. The original family and leading coefficient are 𝒫τ(z)=diag⁡(pm,I,…,I)Pτ[r](z),𝒞τ=diag⁡(pm,I,…,I)Cτ[r],𝒞τ−1=Cτ[r]−1diag⁡(pm−1,I,…,I),det⁡𝒞τ=det⁡pm.(SB3) \begin{split} \mathcal P_\tau(z)&=\operatorname{diag}(p_m,I,\ldots,I)P_\tau[r](z),\\ \mathcal C_\tau&=\operatorname{diag}(p_m,I,\ldots,I)C_\tau[r],\\ \mathcal C_\tau^{-1}&=C_\tau[r]^{-1} \operatorname{diag}(p_m^{-1},I,\ldots,I),\\ \det\mathcal C_\tau&=\det p_m. \end{split} \tag{SB3} Indeed the factorization (S23) is still Hτ(I−τS)H_\tau(I-\tau S). Its actual nilpotents satisfy Nτ2=0N_\tau^2=0, Sm=0S^m=0, so (S25)–(S26) is the same finite inverse for every complex τ\tau. Both triangular determinants equal one. This proves (SB3), keeping the inverse product in its required order.

The lower-block elimination in Section 9 also uses no real-parameter restriction. For L(z)≠0L(z)\ne0 it has the same lower-block determinant and the same Schur complement r(z)r(z). Thus, with both original determinant factors visible, det⁡𝒫τ(z)=det⁡pmdet⁡r(z)L(z)m(m−1)N=det⁡pmdet⁡(pm−1)det⁡p(z)L(z)m(m−1)N=det⁡p(z)L(z)m(m−1)N.(SB4) \begin{split} \det\mathcal P_\tau(z) &=\det p_m\,\det r(z)\,L(z)^{m(m-1)N}\\ &=\det p_m\,\det(p_m^{-1})\det p(z)\, L(z)^{m(m-1)N}\\ &=\det p(z)\,L(z)^{m(m-1)N}. \end{split} \tag{SB4} Both sides are polynomials, so the identity holds also at L(z)=0L(z)=0. The auxiliary root is −iλ-i\lambda, with imaginary part −α<0-\alpha<0 and multiplicity m(m−1)Nm(m-1)N. If it is already an original root, the multiplicities add. Every original real root remains in the determinant, with its full algebraic multiplicity.

17.2. The bounded inverse and all original derivative bounds

Let ℬ+(p)\mathcal B^+(p) consist of smooth solutions of the original equation on ℝ\mathbb R that are bounded for t≥0t\geq0; define ℬ+(𝒫τ)\mathcal B^+(\mathcal P_\tau) in the same way. They include all bounded real-root modes. By (SR31) and (SB3), boundedness of either solution controls its complete original Cauchy jet and every derivative. This implication requires neither spectral separation nor exponential decay.

If gg is smooth on ℝ\mathbb R and all its derivatives are bounded on the positive half-line, set Tλg(t)=−i∫0∞e−λsg(t+s)ds.(SB5) T_\lambda g(t)=-i\int_0^\infty e^{-\lambda s}g(t+s)\,ds. \tag{SB5} For negative tt, split this integral at max⁡(0,−t)\max(0,-t). Its first part is over a finite interval of smooth values; its tail has the same exponential majorant as on the positive half-line. On a compact set of tt’s the finite interval can be chosen uniformly. This proves convergence and justifies every differentiation in tt by the corresponding derivative majorant.

To verify the equation, integrate the derivative of e−λsg(t+s)e^{-\lambda s}g(t+s). The upper endpoint is zero, the lower endpoint is g(t)g(t), and consequently ∫0∞e−λsg′(t+s)ds=−g(t)+λ∫0∞e−λsg(t+s)ds\int_0^\infty e^{-\lambda s}g'(t+s)\,ds =-g(t)+\lambda\int_0^\infty e^{-\lambda s}g(t+s)\,ds. Including the original factor −i-i gives (Tλg)′=λTλg+ig(T_\lambda g)'=\lambda T_\lambda g+ig, hence L(D)Tλg=gL(D)T_\lambda g=g. Two bounded solutions differ by ceλtce^{\lambda t}. Its norm is ∥c∥eαt\|c\|e^{\alpha t}, so boundedness forces c=0c=0. Thus (SB5) is the unique bounded inverse. It commutes with each DkD^k, by the just-proved differentiation.

For d≥0d\geq0, retain the actual constants ∥Dkg(t)∥≤Mk,de−dt\|D^kg(t)\|\leq M_{k,d}e^{-dt}, t≥0t\geq0. Direct integration yields ∥DkTλg(t)∥≤Mk,dα+de−dt.(SB6) \|D^kT_\lambda g(t)\| \leq\frac{M_{k,d}}{\alpha+d}e^{-dt}. \tag{SB6} In particular d=0d=0 gives the full bounded, nondecaying case with denominator α\alpha.

Theorem. For every parameter pair (SB2), first-coordinate projection is a linear bijection Π:ℬ+(𝒫τ)→ℬ+(p),U↦U0.(SB7) \Pi:\mathcal B^+(\mathcal P_\tau)\longrightarrow\mathcal B^+(p), \qquad U\longmapsto U_0. \tag{SB7} Its inverse is exactly U0=u,Uj=τTλR(D)Uj−1,1≤j<m.(SB8) U_0=u,\qquad U_j=\tau T_\lambda R(D)U_{j-1},\quad 1\leq j<m. \tag{SB8} If ∥Dku(t)∥≤M0,k,de−dt\|D^ku(t)\|\leq M_{0,k,d}e^{-dt} for all required derivatives, then the lifted components satisfy ∥DkUj(t)∥≤|τ|j(α+d)je−dt∑a=0j(ja)|λ|j−aM0,k+a,d.(SB9) \|D^kU_j(t)\|\leq \frac{|\tau|^j}{(\alpha+d)^j}e^{-dt} \sum_{a=0}^j\binom ja |\lambda|^{j-a}M_{0,k+a,d}. \tag{SB9} For j=0j=0, the single summand is the original bound.

Proof. For a bounded original family solution the lower row says L(D)m−1gj=0L(D)^{m-1}g_j=0, where gj=L(D)Uj−τR(D)Uj−1g_j=L(D)U_j-\tau R(D)U_{j-1}. All its derivatives, and thus gjg_j, are bounded by (SR31). Substituting gj=eλthjg_j=e^{\lambda t}h_j gives L(D)m−1gj=(−i)m−1eλthj(m−1)L(D)^{m-1}g_j=(-i)^{m-1}e^{\lambda t}h_j^{(m-1)}. Thus hjh_j is a vector polynomial of degree at most m−2m-2. If it is nonzero, an actual bounded coordinate functional detects a nonzero leading coefficient. The full polynomial lower bound (SR19), multiplied by eαte^{\alpha t}, is unbounded. Therefore gj=0g_j=0. This proves every recurrence (S29) on the present bounded space, including complex τ\tau.

Substitute these recurrences in the original first row. Its complete expression is pm((1−τm)r(D)U0+τm∑j=0majR(D)jL(D)m−jU0)=pmr(D)U0=p(D)U0=0.(SB10) p_m\left((1-\tau^m)r(D)U_0+ \tau^m\sum_{j=0}^ma_jR(D)^jL(D)^{m-j}U_0\right) =p_mr(D)U_0=p(D)U_0=0. \tag{SB10} The last summand uses the additional R(D)R(D) in (S20), exactly as in Section 10. This proves the codomain of (SB7).

Conversely, (SR31) bounds every derivative of a bounded original uu, so each step (SB8) is defined by (SB5), has bounded derivatives by (SB6), and satisfies the actual lower row. Equation (SB10) gives the first row. This proves surjectivity. Uniqueness of the bounded inverse successively shows that a lifted solution with U0=0U_0=0 has every component zero, proving injectivity. In particular τ=0\tau=0 gives (u,0,…,0)(u,0,\ldots,0) with no division by that parameter.

Finally R(D)=D−iλR(D)=D-i\lambda and (SB6) give the recursion for the derivative bounds Mj,k,d≤|τ|(α+d)−1(Mj−1,k+1,d+|λ|Mj−1,k,d)M_{j,k,d}\leq |\tau|(\alpha+d)^{-1} (M_{j-1,k+1,d}+|\lambda|M_{j-1,k,d}). Starting at j=0j=0, its two finite sums combine by (j−1a−1)+(j−1a)=(ja)\binom{j-1}{a-1}+\binom{j-1}a=\binom ja, with each endpoint term retained. Induction proves exactly (SB9). ▫\square

17.3. Exact iterated kernels and parameter derivatives

The lift has a full integral formula, rather than only a formal inverse power. For j≥1j\geq1, Tλjg(t)=(−i)j(j−1)!∫0∞sj−1e−λsg(t+s)ds.(SB11) T_\lambda^jg(t)=\frac{(-i)^j}{(j-1)!} \int_0^\infty s^{j-1}e^{-\lambda s}g(t+s)\,ds. \tag{SB11} Induction proves this formula. The step from jj to j+1j+1 has an absolutely integrable double integral, bounded on the positive half-line by the complete product envelope M0,drj−1e−(α+d)(r+s)M_{0,d}r^{j-1}e^{-(\alpha+d)(r+s)}. For negative tt, use the same finite-interval/tail split as above. Fubini therefore applies. The substitution v=r+sv=r+s, with Jacobian one and 0≤r≤v0\leq r\leq v, has inner integral ∫0vrj−1/(j−1)!dr=vj/j!\int_0^v r^{j-1}/(j-1)!\,dr=v^j/j!. The factor becomes exactly (−i)j+1(-i)^{j+1}, proving (SB11) with its full factorial.

Only scalar constant-coefficient operators are commuted in the following binomial calculation: Uj=τj∑a=0j(ja)(−iλ)j−aTλjDau,j≥1.(SB12) U_j=\tau^j\sum_{a=0}^j\binom ja(-i\lambda)^{j-a} T_\lambda^jD^au,\qquad j\geq1. \tag{SB12} Indeed TλT_\lambda commutes with DD, and expansion of (D−iλ)j(D-i\lambda)^j supplies precisely these coefficients. No two original matrix coefficients are commuted.

For each integer b≥0b\geq0, differentiation in λ\lambda gives ∂λbTλjg(t)=(−i)j(−1)b(j−1)!∫0∞sj+b−1e−λsg(t+s)ds,(SB13) \partial_\lambda^bT_\lambda^jg(t) =\frac{(-i)^j(-1)^b}{(j-1)!} \int_0^\infty s^{j+b-1}e^{-\lambda s}g(t+s)\,ds, \tag{SB13} and ∥Dk∂λbTλjg(t)∥≤(j+b−1)!(j−1)!Mk,d(α+d)j+be−dt.(SB14) \|D^k\partial_\lambda^bT_\lambda^jg(t)\| \leq\frac{(j+b-1)!}{(j-1)!} \frac{M_{k,d}}{(\alpha+d)^{j+b}}e^{-dt}. \tag{SB14} On a compact subset of Re⁡λ>0\operatorname{Re}\lambda>0, the displayed integrals have common integrable derivative envelopes, which justifies the differentiation. The scalar moment used here is exact: ∫0∞she−csds=h!c−h−1\int_0^\infty s^he^{-cs}\,ds=h!c^{-h-1} for c>0c>0, h≥0h\geq0. At h=0h=0 it is direct integration. For h>0h>0, integration by parts has zero upper endpoint and zero lower endpoint, and gives h/ch/c times the preceding moment. This proves every factorial in (SB14).

For c≥0c\geq0 the full product rule for the original lift is ∂λcUj=τj∑a=0j(ja)∑0≤b≤cc−b≤j−a(cb)(−i)j−a(j−a)!(j−a−c+b)!⋅λj−a−c+b∂λb(TλjDau),j≥1.(SB15) \begin{split} \partial_\lambda^cU_j={}&\tau^j\sum_{a=0}^j\binom ja \sum_{\substack{0\leq b\leq c\\c-b\leq j-a}} \binom cb(-i)^{j-a}\frac{(j-a)!}{(j-a-c+b)!}\\ &\hspace{15mm}\cdot\lambda^{j-a-c+b} \partial_\lambda^b(T_\lambda^jD^au),\qquad j\geq1. \end{split} \tag{SB15} Its indices make every factorial and power defined; differentiated polynomial terms outside this range are zero. Taking norms and using (SB14) proves the explicit bound ∥Dk∂λcUj(t)∥≤|τ|je−dt∑a=0j(ja)∑0≤b≤cc−b≤j−a(cb)(j−a)!(j−a−c+b)!|λ|j−a−c+b⋅(j+b−1)!(j−1)!M0,k+a,d(α+d)j+b.(SB16) \begin{split} \|D^k\partial_\lambda^cU_j(t)\| \leq{}&|\tau|^je^{-dt}\sum_{a=0}^j\binom ja \sum_{\substack{0\leq b\leq c\\c-b\leq j-a}} \binom cb\frac{(j-a)!}{(j-a-c+b)!} |\lambda|^{j-a-c+b}\\ &\hspace{8mm}\cdot\frac{(j+b-1)!}{(j-1)!} \frac{M_{0,k+a,d}}{(\alpha+d)^{j+b}}. \end{split} \tag{SB16} Here λ≠0\lambda\ne0 by (SB2), and every power-zero factor equals one. For the other parameter, the complete formula is ∂τqUj={j!(j−q)!τj−q(TλR(D))ju,0≤q≤j,0,q>j.(SB17) \partial_\tau^qU_j= \begin{cases} \displaystyle\frac{j!}{(j-q)!}\tau^{j-q}(T_\lambda R(D))^ju, &0\leq q\leq j,\\ 0,&q>j. \end{cases} \tag{SB17} At τ=0\tau=0 the power-zero term is one. The coordinate U0=uU_0=u is independent of both parameters; its positive-order parameter derivatives vanish. Applying (SB17) to (SB15) gives all mixed derivatives, with exactly the same finite product-rule coefficients.

For fixed pp and uu, these formulas prove holomorphic dependence of the lift on λ\lambda in its right half-plane and polynomial dependence on τ\tau. To verify the analytic assertion directly, expand e−hse^{-hs} in (SB5) at a fixed λ\lambda. For |h|<α|h|<\alpha, the sum of integral norms in any bounded derivative seminorm is at most Mk,0α−1∑a≥0(|h|/α)aM_{k,0}\alpha^{-1}\sum_{a\geq0}(|h|/\alpha)^a. It converges, so termwise integration gives the Taylor series in that seminorm. On a compact negative tt interval, the finite first part has uniformly bounded smooth input values and an entire exponential series; the remaining tail has the same convergent majorant, with its finite shift factor. This proves the assertion in each local derivative seminorm as well. Formula (SB11), finite products and (SB12) then give the asserted dependence of every component. This concerns a fixed original solution space; it does not assert smoothness of bounded spaces when an original root crosses the real axis.

17.4. Real modes, multiplicities and the exact Cauchy maps

For the original companion CC in (SR25), the bounded initial space is exactly Jℬ+(p)(0)=⨁Im⁡ζ>0Wζ(C)⊕⨁ζ∈ℝker⁡(C−ζI).(SB18) J\mathcal B^+(p)(0)= \bigoplus_{\operatorname{Im}\zeta>0}W_\zeta(C) \ \oplus\!\bigoplus_{\zeta\in\mathbb R}\ker(C-\zeta I). \tag{SB18} Only actual roots contribute a summand. Formula (SR20) proves this for the full state and (SR31) identifies first-coordinate boundedness with state boundedness. The original Cauchy map and its inverse in (SR25) identify it with the actual solution space.

The exact real-root kernel map, for each real ζ\zeta, is ker⁡p(ζ)→ker⁡(C−ζI),v↦(v,ζv,…,ζm−1v),inverse π0.(SB19) \ker p(\zeta)\longrightarrow\ker(C-\zeta I),\qquad v\longmapsto(v,\zeta v,\ldots,\zeta^{m-1}v), \qquad\text{inverse }\pi_0. \tag{SB19} The first m−1m-1 rows of the eigenvector equation force precisely these coordinates. The last row, multiplied on the left by the actual pmp_m, says pmζmv+∑j=0m−1pjζjv=p(ζ)v=0p_m\zeta^mv+\sum_{j=0}^{m-1}p_j\zeta^jv=p(\zeta)v=0. Both directions follow, proving the map and inverse without dropping the leading coefficient. Formula (SR26) retains its complete signs and factor det⁡(pm−1)\det(p_m^{-1}); hence every upper-root primary dimension equals the algebraic multiplicity of that root in the original det⁡p\det p. Consequently dim⁡ℬ+(p)=∑Im⁡ζ>0mult⁡ζ(det⁡p)+∑ζ∈ℝdim⁡ker⁡p(ζ).(SB20) \dim\mathcal B^+(p) =\sum_{\operatorname{Im}\zeta>0} \operatorname{mult}_\zeta(\det p) +\sum_{\zeta\in\mathbb R}\dim\ker p(\zeta). \tag{SB20} Real bounded modes are counted by their geometric nullities, not by substituting their entire algebraic multiplicities. Higher real Jordan terms give the unbounded time polynomials already proved in (SR18)–(SR20).

For real ζ\zeta, L(ζ)≠0L(\zeta)\ne0, since its imaginary part is α\alpha. The original stabilized real-root kernel and its inverse are v↦((τR(ζ)L(ζ))jv)j=0m−1,ker⁡p(ζ)≃ker⁡𝒫τ(ζ),inverse π0.(SB21) v\longmapsto \left(\left(\tau\frac{R(\zeta)}{L(\zeta)}\right)^jv \right)_{j=0}^{m-1}, \qquad \ker p(\zeta)\simeq\ker\mathcal P_\tau(\zeta), \qquad\text{inverse }\pi_0. \tag{SB21} The lower rows uniquely force these coordinates because L(ζ)≠0L(\zeta)\ne0; the first row is the actual Schur complement p(ζ)vp(\zeta)v proved in (SB4). This proves the displayed bijection. For u(t)=eitζvu(t)=e^{it\zeta}v, direct integration in (SB5) gives Tλu=−i(λ−iζ)−1uT_\lambda u=-i(\lambda-i\zeta)^{-1}u, and L(ζ)=i(λ−iζ)L(\zeta)=i(\lambda-i\zeta). Thus (SB8) gives exactly the coefficient in (SB21), preserving the original frequency and factor −i-i. At τ=0\tau=0, its first coordinate is one times vv, and every positive-index coordinate is zero. The auxiliary lower root supplies no additional bounded mode by the classification (SR20).

17.5. Every finite boundary measurement and its ordered remainder

For the original finite family (S33), with arbitrary finite normal orders, put 𝔅u=(Bℓ(D)u(0))ℓ,𝔅τU=(Bℓ(D)U0(0))ℓ,𝔅τ=𝔅Π.(SB22) \mathfrak B u=(B_\ell(D)u(0))_\ell, \quad\mathfrak B_\tau U=(B_\ell(D)U_0(0))_\ell, \quad\mathfrak B_\tau=\mathfrak B\Pi. \tag{SB22} The target remains the actual G=⨁ℓGℓG=\bigoplus_\ell G_\ell, including the empty target. The bijection (SB7) proves ker⁡𝔅τ=Π−1(ker⁡𝔅)\ker\mathfrak B_\tau=\Pi^{-1}(\ker\mathfrak B) and im⁡𝔅τ=im⁡𝔅\operatorname{im}\mathfrak B_\tau=\operatorname{im}\mathfrak B: the first follows by evaluating (SB22), and the second follows in both directions using the inverse lift. Thus bijectivity, kernel dimension and image are preserved for every complex τ\tau, including zero, and every λ\lambda in (SB2).

When dℓ<md_\ell<m, equations (S35)–(S36) retain exactly their full coefficients, including ir+1−mi^{r+1-m}, 21−m2^{1-m}, λr+1−m\lambda^{r+1-m}, and the entire signed binomial sum. The polynomial change of variables needs only λ≠0\lambda\ne0, so applies here. The same recurrence proves (S37) for τ≠0\tau\ne0 as an equality of functions on the lifted bounded space. It remains unsuitable for an ambient operator at zero; (SB22) is the actual endpoint map.

For any larger boundary degree one can also prove an exact polynomial reduction without altering the original equation. If its current leading coefficient is bb and its degree is d≥md\geq m, subtract (bpm−1)zd−mp(z).(SB23) (b p_m^{-1})z^{d-m}p(z). \tag{SB23} This cancels exactly the leading term bzdbz^d, with the original composition order. Repeating the strict degree decrease gives B(z)=Q(z)p(z)+B<m(z)B(z)=Q(z)p(z)+B_{<m}(z), where deg⁡B<m<m\deg B_{<m}<m. Uniqueness follows because any nonzero difference QQ, with leading coefficient qq, gives the nonzero leading coefficient qpmq p_m in QpQp; invertibility of pmp_m makes its degree at least mm. It cannot equal a polynomial of degree less than mm. On actual solutions, constant-coefficient differentiation and these ordered compositions give B(D)u=Q(D)p(D)u+B<m(D)u=B<m(D)uB(D)u=Q(D)p(D)u+B_{<m}(D)u=B_{<m}(D)u. Thus the actual arbitrary-order measurements can be computed by this remainder and the original coefficient formula (S36), with every subtracted term recorded. This finite-dimensional normal-variable proof makes no reduction of tangential PDE orders or their Sobolev shifts.

17.6. The exact measurement map during rate deformation

Return only for this paragraph to the original no-real-root branch (S9). Let CC be the original companion, q=qCq=q_C its full upper projection, and λ0>0\lambda_0>0 a fixed real number. The deformation in Section 5 is Cθ=(1−θ)C+iθλ0(2q−I),0≤θ≤1.(SB24) C_\theta=(1-\theta)C+i\theta\lambda_0(2q-I), \qquad0\leq\theta\leq1. \tag{SB24} Its bounded initial space is the same qEmqE^m, by (S12). An original profile is u(t)=π0EC(t)vu(t)=\pi_0E_C(t)v; the new first-order state profile is w(t)=ECθ(t)vw(t)=E_{C_\theta}(t)v, for the same v∈qEmv\in qE^m. Sending uu to ww is a bijection: its forward map uses the unique original Cauchy state, and its inverse is w↦π0EC(t)w(0)w\mapsto\pi_0E_C(t)w(0). First-order uniqueness and (SR25) prove both compositions to be identities.

For the original boundary polynomial, keep every original coefficient and derivative order in Hℓ=∑r=0dℓbℓrπ0Cr,𝔅̃θ(w)=(Hℓw(0))ℓ.(SB25) H_\ell=\sum_{r=0}^{d_\ell}b_{\ell r}\pi_0 C^r, \qquad\widetilde{\mathfrak B}_\theta(w) =(H_\ell w(0))_\ell. \tag{SB25} Since Dru(0)=π0CrvD^ru(0)=\pi_0C^rv, this is precisely the transported original measurement. Its commuting map is proved by substituting w(0)=vw(0)=v, so it preserves the original kernel, image and bijectivity.

If one instead applies the unchanged polynomial Bℓ(D)B_\ell(D) to the first coordinate of the new state profile, the measurement is ∑rbℓrπ0Cθrv\sum_r b_{\ell r}\pi_0C_\theta^rv. The complete difference from (SB25) is Δℓ,θ=∑r=1dℓbℓrπ0∑a=0r−1Cθr−1−a(Cθ−C)Ca,Cθ−C=θ(iλ0(2q−I)−C).(SB26) \begin{split} \Delta_{\ell,\theta} &=\sum_{r=1}^{d_\ell}b_{\ell r}\pi_0 \sum_{a=0}^{r-1}C_\theta^{r-1-a}(C_\theta-C)C^a,\\ C_\theta-C&=\theta\big(i\lambda_0(2q-I)-C\big). \end{split} \tag{SB26} For each rr, expansion of the middle difference produces Cθr−aCa−Cθr−1−aCa+1C_\theta^{r-a}C^a-C_\theta^{r-1-a}C^{a+1}. Successive terms telescope, retaining their order, to Cθr−CrC_\theta^r-C^r. This proves (SB26) without assuming commutation. The zero-order summand has zero difference; for degree zero the displayed sum is empty.

A concrete original order-two example shows why this receiving map matters. Take p(z)=(z−i)2,C=(0112i),q=I,v=(1,i),λ0=2,B(z)=z.(SB27) p(z)=(z-i)^2,\quad C=\begin{pmatrix}0&1\\1&2i\end{pmatrix},\quad q=I,\quad v=(1,i),\quad\lambda_0=2,\quad B(z)=z. \tag{SB27} Here Cv=ivCv=iv, Cθv=i(1+θ)vC_\theta v=i(1+\theta)v, and vv belongs to the bounded upper space. The original measurement and its transported value are both ii. Applying the unchanged derivative polynomial to the deformed first coordinate instead gives i(1+θ)i(1+\theta), with difference iθi\theta. Both profiles are exponentially decreasing. This proves that preservation of the initial stable space does not itself preserve unchanged derivative expressions; (SB25) supplies the exact correspondence. The earlier stable-bundle statement is retained with its original scope.

17.7. A real double root and an exact complex lift

Original real and auxiliary roots, with the exact bounded lifted profile

The figure uses the original polynomial p(z)=3z2p(z)=3z^2, E=ℂE=\mathbb C, m=2m=2, λ=1+i\lambda=1+i, τ=i\tau=i. The coefficient calculation gives a0=1/4,a1=1/2,a2=1/4a_0=1/4,a_1=1/2,a_2=1/4, since r(z)=z2=(L(z)+R(z))2/4r(z)=z^2=(L(z)+R(z))^2/4. The full original determinant is det⁡𝒫τ(z)=3z2(z+iλ)2,det⁡𝒞τ=3.(SB28) \det\mathcal P_\tau(z)=3z^2(z+i\lambda)^2, \qquad\det\mathcal C_\tau=3. \tag{SB28} The original root zero has algebraic multiplicity two, but its bounded original space consists exactly of constants and has dimension one: D2u=0D^2u=0 gives u=a+btu=a+bt, bounded exactly when b=0b=0. The auxiliary root −iλ=1−i-i\lambda=1-i also has multiplicity two and has no bounded positive-half-line mode. Formula (SB21) gives the exact lifted constant U=(1,−τ)=(1,−i)U=(1,-\tau)=(1,-i). The original first-row value at D=0D=0 is 3[−τ2λ2/4+τ2λ2/4]=03[-\tau^2\lambda^2/4+\tau^2\lambda^2/4]=0, while the lower row is −λ2(−τ)−τλ2=0-\lambda^2(-\tau)-\tau\lambda^2=0. These are symbolic equalities with all factors retained. The right panel shows Re⁡U0=1\operatorname{Re}U_0=1, Im⁡U1=−1\operatorname{Im}U_1=-1, and both zero components. Its finite plotting interval is an illustration of this exact profile, not a numerical proof of boundedness. The editable figure source and parameters preserve these original coordinates.

If E=0E=0, both solution spaces and all kernels above are zero, every determinant is the empty product one, and every measurement has the zero-domain image. The proofs use no minimum on an empty sphere. All statements about nonzero leading coordinates and roots then disappear, while the zero-space bijections and arbitrary target convention remain exact.

Further questions and analytic use

The next analytic use of this algebra is a family over nonzero tangential covectors. Section 4 supplies its stable vector bundle, and (S33) supplies the finite-dimensional complementing map. A global boundary parametrix also needs symbol calculus, coordinate invariance, bundle gluing and adjoint theory; Cauchy data from jumps and residues and Solving an elliptic system from compatible boundary measurements develop those analytic steps. A fiberwise stable isomorphism alone does not establish their Sobolev estimates or index statements.

For the analytic use of a homogeneous differential principal polynomial, Cauchy data from jumps and residues, Section9 proves the exact reflection of the original solutions and every Cauchy jet. Its positive mode bundle together with the antipodal pullback of that bundle maps bijectively onto the entire original jet bundle, with an explicit inverse. In dimension at least three the original stable rank is necessarily half the total solution rank; in dimension two the antipodal ranks are complementary and may differ. These conclusions use the additional homogeneous differential and ellipticity hypotheses proved there. They are not imposed on the arbitrary matrix polynomials or bounded real-root constructions of this lesson.

Two useful research questions are to identify when the stable bundle admits a globally chosen system of boundary measurements, and to determine which additional estimates survive when spectral roots approach the real axis. The examples here already distinguish the local rank condition from a global choice of boundary data, and show why estimates uniform through a real crossing cannot be inferred from this lesson.

References

The finite-dimensional algebra, decay estimates, examples and solved problems in this lesson are given above.

Polynomial and contour interfaces for stable boundary models, Sections 2–9, proves the exact scalar algebra and contour tools used here.