Polynomial inverse expansion with ordered matrix coefficients

This lesson proves the finite inverse expansion for the polynomial and cutoff specified below. It keeps the original tangential and normal frequency coordinates, the leading coefficient IdI_d, and the order of every matrix product. All position-variable estimates are uniform on the original ℝxn\mathbb R_x^n. No pseudodifferential composition theorem is used.

Inverting mixed symbols without commuting matrix factors supplies the ordered inverse derivative identity and cutoff inverse used below.

1. Exact setting and both weight presentations

Fix n,d≥1n,d\geq1 and an integer m≥1m\geq1. Write x∈ℝn,ξ=(η,ζ)∈ℝn−1×ℝ,h=⟨η⟩=(1+|η|2)1/2,Q=⟨ξ⟩=(1+|η|2+ζ2)1/2.(PI1) x\in\mathbb R^n,\quad \xi=(\eta,\zeta)\in\mathbb R^{n-1}\times\mathbb R,\quad h=\langle\eta\rangle=(1+|\eta|^2)^{1/2},\quad Q=\langle\xi\rangle=(1+|\eta|^2+\zeta^2)^{1/2}. \tag{PI1} Keep also the original weights R=1+|ξ|,T=1+|η|,Ξ=ζ+ih,|Ξ|=Q,1≤h≤Q.(PI2) R=1+|\xi|,\qquad T=1+|\eta|,\qquad \Xi=\zeta+ih,\qquad |\Xi|=Q,\quad 1\leq h\leq Q. \tag{PI2} The equality |Ξ|=Q|\Xi|=Q is exact. It follows by squaring the modulus; there is no rescaling of a frequency coordinate.

For real u,vu,v, a smooth matrix function ff is in the bracket presentation of Su,vS^{u,v} when all seminorms [f]u,v;β,α,r=supx,η,ζ∥∂xβ∂ηα∂ζrf∥Qu−rhv−|α|(PI3) [f]_{u,v;\beta,\alpha,r} =\sup_{x,\eta,\zeta} \frac{\|\partial_x^\beta\partial_\eta^\alpha\partial_\zeta^r f\|} {Q^{u-r}h^{v-|\alpha|}} \tag{PI3} are finite, where β∈ℕ0n\beta\in\mathbb N_0^n, α∈ℕ0n−1\alpha\in\mathbb N_0^{n-1}, r∈ℕ0r\in\mathbb N_0. Matrices carry their Euclidean operator norm. The original presentation replaces the denominator by Ru−rTv−|α|R^{u-r}T^{v-|\alpha|}, and its seminorm is written [f]u,v;β,α,ro[f]^o_{u,v;\beta,\alpha,r}.

For each s≥0s\geq0, 1+s2≤(1+s)2≤2(1+s2)1+s^2\leq(1+s)^2\leq2(1+s^2). Thus R/Q,T/h∈[1,2]R/Q,T/h\in[1,\sqrt2]. If a=u−ra=u-r, b=v−|α|b=v-|\alpha|, and a±=max⁡(±a,0)a_\pm=\max(\pm a,0), b±=max⁡(±b,0)b_\pm=\max(\pm b,0), then 2−(a−+b−)/2Qahb≤RaTb≤2(a++b+)/2Qahb.(PI4) 2^{-(a_-+b_-)/2}Q^ah^b \leq R^aT^b \leq2^{(a_++b_+)/2}Q^ah^b. \tag{PI4} For a negative exponent this follows by taking the reciprocal of the corresponding positive-exponent inequality; hence it covers all real orders and every derivative shift. Dividing by these positive weights gives [f]u,v;β,α,ro≤2(a−+b−)/2[f]u,v;β,α,r,[f]u,v;β,α,r≤2(a++b+)/2[f]u,v;β,α,ro.(PI5) [f]^o_{u,v;\beta,\alpha,r} \leq2^{(a_-+b_-)/2}[f]_{u,v;\beta,\alpha,r},\qquad [f]_{u,v;\beta,\alpha,r} \leq2^{(a_++b_+)/2}[f]^o_{u,v;\beta,\alpha,r}. \tag{PI5} The identity on actual functions is therefore the exact continuous linear bijection between the two presentations. It commutes with every derivative and preserves multiplication in its original order. In particular the proof below with Q,hQ,h proves the assertion with R,TR,T, with constants (PI5), including when either differentiated exponent is negative.

A tangential symbol b(x,η)∈Stansb(x,\eta)\in S^s_{\mathrm{tan}}, for real ss, means |b|s;β,α=supx,η∥∂xβ∂ηαb(x,η)∥hs−|α|<∞.(PI6) |b|_{s;\beta,\alpha} =\sup_{x,\eta} \frac{\|\partial_x^\beta\partial_\eta^\alpha b(x,\eta)\|} {h^{s-|\alpha|}}<\infty. \tag{PI6} Its TT-weight presentation satisfies the one-factor version of (PI4)–(PI5), with exponent s−|α|s-|\alpha|.

Take the given polynomial p(x,η,ζ)=∑k=0mpk(x,η)ζk,pm=Id,pk∈Stanm−k.(PI7) p(x,\eta,\zeta)=\sum_{k=0}^{m}p_k(x,\eta)\zeta^k,\qquad p_m=I_d,\qquad p_k\in S^{m-k}_{\mathrm{tan}}. \tag{PI7} Let χ∈Cc∞(ℝξn;ℂ)\chi\in C_c^\infty(\mathbb R_\xi^n;\mathbb C) be the fixed frequency cutoff, θ=1−χ\theta=1-\chi, and 𝒱=supp⁡θ\mathcal V=\operatorname{supp}\theta. The meaning of the cutoff inverse hypothesis is that p(x,ξ)p(x,\xi) is invertible at every (x,ξ)(x,\xi) with ξ∈𝒱\xi\in\mathcal V, and ∥p(x,ξ)−1∥≤C0Q−m(ξ∈𝒱).(PI8) \|p(x,\xi)^{-1}\|\leq C_0Q^{-m}\quad(\xi\in\mathcal V). \tag{PI8} If the given invertibility statement is formulated outside a fixed compact set, the cutoff is chosen equal to one on a neighborhood of that set, exactly as required to define its cutoff inverse. No invertibility is required where θ\theta vanishes on a neighborhood. Define the original function τ(x,ξ)=θ(ξ)p(x,ξ)−1(ξ∈𝒱),τ(x,ξ)=0(ξ∉𝒱).(PI9) \tau(x,\xi)=\theta(\xi)p(x,\xi)^{-1}\quad(\xi\in\mathcal V), \qquad \tau(x,\xi)=0\quad(\xi\notin\mathcal V). \tag{PI9} The expansion below concerns this same τ\tau, without alteration of pp or χ\chi.

2. All derivatives of the scalar weights and complex powers

We first provide constants valid even when the displayed symbol order becomes negative. For a real number ss and nonnegative integer jj, let (s)j_=s(s−1)⋯(s−j+1)(s)_{\underline j}=s(s-1)\cdots(s-j+1), with empty product one. For a tangential multiindex α\alpha, differentiation of hs=(1+|η|2)s/2h^s=(1+|\eta|^2)^{s/2} gives the exact finite identity ∂ηαhs=∑k+2ℓ=αα!k!ℓ!(s/2)|k|+|ℓ|_(2η)k(1+|η|2)s/2−|k|−|ℓ|.(PI10) \partial_\eta^\alpha h^s =\sum_{k+2\ell=\alpha} \frac{\alpha!}{k!\ell!} (s/2)_{\underline{|k|+|\ell|}} (2\eta)^k (1+|\eta|^2)^{s/2-|k|-|\ell|}. \tag{PI10} Here k,ℓk,\ell are tangential multiindices and their equation is componentwise. To prove it, expand the finite Taylor polynomial of the scalar function zs/2z^{s/2} at z=1+|η|2>0z=1+|\eta|^2>0, substitute z+2η⋅y+|y|2z+2\eta\cdot y+|y|^2, and compare the coefficient of yαy^\alpha. Only terms through total degree |α||\alpha| can contribute, so the calculation is a finite Taylor identity for derivatives and does not require convergence of an infinite series.

Since |ηj|≤h|\eta_j|\leq h, each summand is bounded by a constant times hs−|α|h^{s-|\alpha|}. Explicitly put K(s,α)=∑k+2ℓ=αα!k!ℓ!|(s/2)|k|+|ℓ|_|2|k|.(PI11) K(s,\alpha)= \sum_{k+2\ell=\alpha} \frac{\alpha!}{k!\ell!} |(s/2)_{\underline{|k|+|\ell|}}|\,2^{|k|}. \tag{PI11} Then |∂ηαhs|≤K(s,α)hs−|α||\partial_\eta^\alpha h^s|\leq K(s,\alpha)h^{s-|\alpha|}, for every real ss; K(s,0)=1K(s,0)=1. For n=1n=1 the tangential multiindices are empty, h=1h=1, and the same formulas have their empty-index meanings.

Since Ξ\Xi is in the open upper half-plane, define Ξs=exp⁡(slog⁡Ξ)\Xi^s=\exp(s\log\Xi) with its argument in (0,π)(0,\pi), for every real ss. Its modulus is QsQ^s. Normal differentiation yields ∂ζrΞs=(s)r_Ξs−r\partial_\zeta^r\Xi^s=(s)_{\underline r}\Xi^{s-r}. For tangential derivatives, the finite Taylor chain rule gives, when |α|>0|\alpha|>0, ∂ηαΞs−r=∑ℓ=1|α|(s−r)ℓ_iℓℓ!∑ν1+⋯+νℓ=α|νi|>0α!ν1!⋯νℓ!Ξs−r−ℓ∏i=1ℓ∂ηνih.(PI12) \partial_\eta^\alpha\Xi^{s-r} =\sum_{\ell=1}^{|\alpha|} \frac{(s-r)_{\underline\ell}i^\ell}{\ell!} \sum_{\substack{\nu_1+\cdots+\nu_\ell=\alpha\\|\nu_i|>0}} \frac{\alpha!}{\nu_1!\cdots\nu_\ell!} \Xi^{s-r-\ell}\prod_{i=1}^\ell\partial_\eta^{\nu_i}h. \tag{PI12} The inner lists are ordered. The factor 1/ℓ!1/\ell! is the scalar Taylor factor; the multinomial coefficient comes from multiplying the ℓ\ell positive-degree Taylor polynomials of hh. Thus no multiplicity has been suppressed.

Let the sum on the right below have its single value one at α=0,ℓ=0\alpha=0,\ell=0, and otherwise only the displayed positive partitions: H(s;r,α)=|(s)r_|∑ℓ=0|α||(s−r)ℓ_|ℓ!∑ν1+⋯+νℓ=α|νi|>0α!ν1!⋯νℓ!∏iK(1,νi).(PI13) H(s;r,\alpha)= |(s)_{\underline r}| \sum_{\ell=0}^{|\alpha|} \frac{|(s-r)_{\underline\ell}|}{\ell!} \sum_{\substack{\nu_1+\cdots+\nu_\ell=\alpha\\|\nu_i|>0}} \frac{\alpha!}{\nu_1!\cdots\nu_\ell!} \prod_i K(1,\nu_i). \tag{PI13} Combining (PI11)–(PI12) with h/Q≤1h/Q\leq1 proves |∂ηα∂ζrΞs|≤H(s;r,α)Qs−rh−|α|.(PI14) |\partial_\eta^\alpha\partial_\zeta^r\Xi^s| \leq H(s;r,\alpha)Q^{s-r}h^{-|\alpha|}. \tag{PI14} Indeed a term before the last comparison has weight Qs−r−ℓhℓ−|α|Q^{s-r-\ell}h^{\ell-|\alpha|}, whose ratio to the displayed weight is (h/Q)ℓ≤1(h/Q)^\ell\leq1. This works for all real ss, including every negative exponent used in the expansion.

The pointwise product rule gives, for arbitrary real orders, [fg]u+u′,v+v′;β,α,r≤∑γ≤β,ϵ≤α0≤l≤r(βγ)(αϵ)(rl)[f]u,v;γ,ϵ,l[g]u′,v′;β−γ,α−ϵ,r−l.(PI15) \begin{split} [fg]_{u+u',v+v';\beta,\alpha,r} \leq \sum_{\substack{\gamma\leq\beta,\ \epsilon\leq\alpha\\0\leq l\leq r}} \binom{\beta}{\gamma}\binom{\alpha}{\epsilon}\binom rl [f]_{u,v;\gamma,\epsilon,l} [g]_{u',v';\beta-\gamma,\alpha-\epsilon,r-l}. \end{split} \tag{PI15} Each term preserves the order fgfg. Its first weight exponents add to u+u′−ru+u'-r, and its second to v+v′−|α|v+v'-|\alpha|, as literal equalities. Also, for every real a≥0a\geq0, Su−a,v+a⊂Su,v,[f]u,v;β,α,r≤[f]u−a,v+a;β,α,r.(PI16) S^{u-a,v+a}\subset S^{u,v},\qquad [f]_{u,v;\beta,\alpha,r}\leq[f]_{u-a,v+a;\beta,\alpha,r}. \tag{PI16} This follows from the exact weight ratio (h/Q)a≤1(h/Q)^a\leq1, and remains valid for negative differentiated exponents.

3. The original polynomial and its cutoff inverse estimates

Set Pk;β,α=|pk|m−k;β,αP_{k;\beta,\alpha}=|p_k|_{m-k;\beta,\alpha}, finite by hypothesis. Since ∂ζrζk=(k)r_ζk−r\partial_\zeta^r\zeta^k=(k)_{\underline r}\zeta^{k-r} for r≤kr\leq k and vanishes otherwise, (PI7) gives ∥∂xβ∂ηα∂ζrp∥≤Aβ,α,rQm−rh−|α|,Aβ,α,r=∑k=rm(k)r_Pk;β,α.(PI17) \|\partial_x^\beta\partial_\eta^\alpha\partial_\zeta^r p\| \leq A_{\beta,\alpha,r}Q^{m-r}h^{-|\alpha|},\qquad A_{\beta,\alpha,r} =\sum_{k=r}^{m}(k)_{\underline r}P_{k;\beta,\alpha}. \tag{PI17} For r>mr>m the sum and derivative are zero. To verify the bound term by term, divide hm−k−|α||ζ|k−rh^{m-k-|\alpha|}|\zeta|^{k-r} by Qm−rh−|α|Q^{m-r}h^{-|\alpha|}. The quotient is (h/Q)m−k(|ζ|/Q)k−r≤1(h/Q)^{m-k}(|\zeta|/Q)^{k-r}\leq1. Thus the actual polynomial belongs to Sm,0S^{m,0}.

For clarity all inverse constants can now be written with the bracket weights. Use a combined derivative multiindex μ=(β,α,r)\mu=(\beta,\alpha,r). Section 2 of Inverting mixed symbols without commuting matrix factors, formula (MSI6), proves the exact finite inverse derivative formula ∂μp−1=∑k=1|μ|(−1)k∑μ1+⋯+μk=μ|μi|>0μ!μ1!⋯μk!p−1(∂μ1p)p−1⋯(∂μkp)p−1(PI18) \partial^\mu p^{-1} =\sum_{k=1}^{|\mu|}(-1)^k \sum_{\substack{\mu_1+\cdots+\mu_k=\mu\\|\mu_i|>0}} \frac{\mu!}{\mu_1!\cdots\mu_k!} p^{-1}(\partial^{\mu_1}p)p^{-1}\cdots (\partial^{\mu_k}p)p^{-1} \tag{PI18} for μ≠0\mu\ne0, on the open set of invertible matrices. It is obtained by taking the finite Taylor polynomial of pp, inverting its constant part, and using the finite geometric identity in the nilpotent positive-degree Taylor terms. That finite algebra proof does not commute matrix factors.

Define V0=C0,Vμ=∑k=1|μ|∑μ1+⋯+μk=μ|μi|>0μ!μ1!⋯μk!C0k+1∏iAμi(μ≠0).(PI19) V_0=C_0,\qquad V_\mu= \sum_{k=1}^{|\mu|} \sum_{\substack{\mu_1+\cdots+\mu_k=\mu\\|\mu_i|>0}} \frac{\mu!}{\mu_1!\cdots\mu_k!} C_0^{k+1}\prod_i A_{\mu_i} \quad(\mu\ne0). \tag{PI19} Equations (PI8), (PI17), and (PI18) prove ∥∂xβ∂ηα∂ζrp−1∥≤Vβ,α,rQ−m−rh−|α|(ξ∈𝒱).(PI20) \|\partial_x^\beta\partial_\eta^\alpha\partial_\zeta^r p^{-1}\| \leq V_{\beta,\alpha,r}Q^{-m-r}h^{-|\alpha|} \quad(\xi\in\mathcal V). \tag{PI20} The k+1k+1 inverse factors and kk polynomial derivative factors give exponent −(k+1)m+km−r=−m−r-(k+1)m+km-r=-m-r; the tangential exponents sum to −|α|-|\alpha|. All orders and constants are therefore retained.

Choose M≥1M\geq1 such that supp⁡χ⊂{|ξ|≤M}\operatorname{supp}\chi\subset\{|\xi|\leq M\}, and put HM=(1+M2)1/2H_M=(1+M^2)^{1/2}. For a frequency multiindex δ=(ϵ,l)\delta=(\epsilon,l), write tδ=supξ|∂ηϵ∂ζlθ(ξ)|,Lδ={1,δ=0,HM|ϵ|+l,δ≠0. t_\delta=\sup_\xi|\partial_\eta^\epsilon\partial_\zeta^l\theta(\xi)|,\qquad L_\delta=\begin{cases}1,&\delta=0,\\H_M^{|\epsilon|+l},&\delta\ne0.\end{cases} The derivative of θ\theta is supported in this ball whenever δ≠0\delta\ne0. Leibniz’ rule and (PI20) give [τ]−m,0;β,α,r≤Uβ,α,r:=∑ϵ≤α,0≤l≤r(αϵ)(rl)t(ϵ,l)L(ϵ,l)Vβ,α−ϵ,r−l.(PI21) [\tau]_{-m,0;\beta,\alpha,r} \leq U_{\beta,\alpha,r} :=\sum_{\epsilon\leq\alpha,\ 0\leq l\leq r} \binom\alpha\epsilon\binom rl t_{(\epsilon,l)}L_{(\epsilon,l)} V_{\beta,\alpha-\epsilon,r-l}. \tag{PI21} The weight correction on a nonzero cutoff derivative is exactly Qlh|ϵ|≤HMl+|ϵ|Q^lh^{|\epsilon|}\leq H_M^{l+|\epsilon|}.

The function in (PI9) is smooth globally. Outside 𝒱\mathcal V, θ\theta is locally zero. At a point of 𝒱\mathcal V, the invertible matrix pp has a smooth local inverse by the determinant formula; its product with θ\theta agrees with (PI9) on that neighborhood, including points outside 𝒱\mathcal V. This proves smoothness at its boundary and makes (PI21) a global estimate. It also proves the global exact identities pτ=τp=θId.(PI22) p\tau=\tau p=\theta I_d. \tag{PI22}

4. Re-expression in the unchanged complex normal coordinate

Substitute the literal identity ζ=Ξ−ih\zeta=\Xi-ih into the polynomial: p=∑j=0mPj(x,η)Ξj,Pj=∑k=jm(kj)pk(x,η)(−ih)k−j,Pm=Id.(PI23) \begin{split} p&=\sum_{j=0}^{m}P_j(x,\eta)\Xi^j,\\ P_j&=\sum_{k=j}^{m}\binom kj\,p_k(x,\eta)(-ih)^{k-j},\qquad P_m=I_d. \end{split} \tag{PI23} The scalar hh commutes with matrices, so this binomial expansion does not move one matrix past another. Each PjP_j has tangential order m−jm-j. In fact |Pj|m−j;β,α≤∑k=jm(kj)∑ϵ≤α(αϵ)Pk;β,ϵK(k−j,α−ϵ).(PI24) |P_j|_{m-j;\beta,\alpha} \leq \sum_{k=j}^{m}\binom kj \sum_{\epsilon\leq\alpha}\binom\alpha\epsilon P_{k;\beta,\epsilon}\,K(k-j,\alpha-\epsilon). \tag{PI24} The weight exponent in each term is (m−k−|ϵ|)+(k−j−|α−ϵ|)=m−j−|α|(m-k-|\epsilon|)+(k-j-|\alpha-\epsilon|)=m-j-|\alpha|, including all its possibly negative values.

Write Aℓ=Pm−ℓ∈Stanℓ,1≤ℓ≤m,p=Ξm(Id+∑ℓ=1mAℓΞ−ℓ).(PI25) A_\ell=P_{m-\ell}\in S^\ell_{\mathrm{tan}},\quad1\leq\ell\leq m,\qquad p=\Xi^m\left(I_d+\sum_{\ell=1}^{m}A_\ell\Xi^{-\ell}\right). \tag{PI25} Let aℓ;β,αa_{\ell;\beta,\alpha} denote the explicit right side of (PI24) with j=m−ℓj=m-\ell. It is a finite bound for every tangential derivative seminorm of AℓA_\ell.

Define matrices τj(x,η)\tau_j(x,\eta) recursively by τ0=Id,τj=−∑ℓ=1min⁡(m,j)Aℓτj−ℓ(j≥1).(PI26) \tau_0=I_d,\qquad \tau_j=-\sum_{\ell=1}^{\min(m,j)}A_\ell\tau_{j-\ell} \quad(j\geq1). \tag{PI26} This specifies the multiplication order. A closed finite expression for the same coefficient is τj=∑k=1j(−1)k∑ℓ1+⋯+ℓk=j1≤ℓi≤mAℓ1⋯Aℓk(j≥1).(PI27) \tau_j= \sum_{k=1}^{j}(-1)^k \sum_{\substack{\ell_1+\cdots+\ell_k=j\\1\leq\ell_i\leq m}} A_{\ell_1}\cdots A_{\ell_k}\quad(j\geq1). \tag{PI27} To prove it, group each ordered list by its first entry in the right side; the resulting sum is exactly (PI26). Grouping by its last entry also proves the different, compatible recursion τj=−∑ℓ=1min⁡(m,j)τj−ℓAℓ.(PI28) \tau_j=-\sum_{\ell=1}^{\min(m,j)}\tau_{j-\ell}A_\ell. \tag{PI28} This equality is a sum identity obtained from the same ordered lists; it does not assert pairwise commutation of its factors.

Each τj\tau_j is in StanjS^j_{\mathrm{tan}}. Explicit constants that prove every derivative bound are obtained as follows. Put b0;0,0=1b_{0;0,0}=1 and b0;β,α=0b_{0;\beta,\alpha}=0 for (β,α)≠(0,0)(\beta,\alpha)\ne(0,0). For j≥1j\geq1, set bj;β,α=∑ℓ=1min⁡(m,j)∑γ≤βϵ≤α(βγ)(αϵ)aℓ;γ,ϵbj−ℓ;β−γ,α−ϵ.(PI29) b_{j;\beta,\alpha}= \sum_{\ell=1}^{\min(m,j)} \sum_{\substack{\gamma\leq\beta\\\epsilon\leq\alpha}} \binom\beta\gamma\binom\alpha\epsilon a_{\ell;\gamma,\epsilon} b_{j-\ell;\beta-\gamma,\alpha-\epsilon}. \tag{PI29} Induction using the tangential Leibniz identity shows ∥∂xβ∂ηατj∥≤bj;β,αhj−|α|.(PI30) \|\partial_x^\beta\partial_\eta^\alpha\tau_j\| \leq b_{j;\beta,\alpha}h^{j-|\alpha|}. \tag{PI30} The exponent is ℓ−|ϵ|+j−ℓ−|α−ϵ|=j−|α|\ell-|\epsilon|+j-\ell-|\alpha-\epsilon|=j-|\alpha|, so the induction is valid at every derivative order without assuming a nonnegative exponent.

5. Exact residual coefficients and the next cancellation

For an integer N≥1N\geq1, let qN=∑j=0N−1τjΞ−m−j.(PI31) q_N=\sum_{j=0}^{N-1}\tau_j\Xi^{-m-j}. \tag{PI31} Multiplying (PI25) by this sum on the right gives constant coefficient IdI_d, and all coefficients of Ξ−k\Xi^{-k} for 1≤k<N1\leq k<N vanish by (PI26). The complete remaining finite polynomial in Ξ−1\Xi^{-1} is pqN=Id+RN,RN=∑s=0m−1ρN,sΞ−N−s,ρN,s=∑1≤ℓ≤m,0≤j<Nℓ+j=N+sAℓτj.(PI32) \begin{split} p q_N&=I_d+R_N,\\ R_N&=\sum_{s=0}^{m-1}\rho_{N,s}\Xi^{-N-s},\\ \rho_{N,s} &=\sum_{\substack{1\leq\ell\leq m,\ 0\leq j<N\\\ell+j=N+s}} A_\ell\tau_j. \end{split} \tag{PI32} An empty sum is zero. The largest possible total index is m+N−1m+N-1, which explains the precise last value s=m−1s=m-1. Each coefficient has the exact asserted order ρN,s∈StanN+s,τN=−ρN,0.(PI33) \rho_{N,s}\in S^{N+s}_{\mathrm{tan}},\qquad \tau_N=-\rho_{N,0}. \tag{PI33} For the second assertion, the constraint ℓ+j=N\ell+j=N, j<Nj<N, is exactly j=N−ℓj=N-\ell and 1≤ℓ≤min⁡(m,N)1\leq\ell\leq\min(m,N), which is the recursion for −τN-\tau_N.

The explicit all-derivative constants for these residual coefficients are cN,s;β,α=∑1≤ℓ≤m,0≤j<Nℓ+j=N+s∑γ≤βϵ≤α(βγ)(αϵ)aℓ;γ,ϵbj;β−γ,α−ϵ.(PI34) c_{N,s;\beta,\alpha}= \sum_{\substack{1\leq\ell\leq m,\ 0\leq j<N\\\ell+j=N+s}} \ \sum_{\substack{\gamma\leq\beta\\\epsilon\leq\alpha}} \binom\beta\gamma\binom\alpha\epsilon a_{\ell;\gamma,\epsilon} b_{j;\beta-\gamma,\alpha-\epsilon}. \tag{PI34} Then ∥∂xβ∂ηαρN,s∥≤cN,s;β,αhN+s−|α|.(PI35) \|\partial_x^\beta\partial_\eta^\alpha\rho_{N,s}\| \leq c_{N,s;\beta,\alpha}h^{N+s-|\alpha|}. \tag{PI35} In particular this proves the required coefficient order SN+sS^{N+s}, not merely a bound after multiplication by a power of Ξ\Xi.

The other product has its own ordered residual: qNp=Id+R̃N,R̃N=∑s=0m−1ρ̃N,sΞ−N−s,ρ̃N,s=∑1≤ℓ≤m,0≤j<Nj+ℓ=N+sτjAℓ.(PI36) q_Np=I_d+\widetilde R_N,\qquad \widetilde R_N=\sum_{s=0}^{m-1}\widetilde\rho_{N,s}\Xi^{-N-s}, \qquad \widetilde\rho_{N,s} =\sum_{\substack{1\leq\ell\leq m,\ 0\leq j<N\\j+\ell=N+s}} \tau_jA_\ell. \tag{PI36} It follows by (PI28), not by commuting any coefficient in (PI32). The same derivative argument gives the same orders, with constants obtained by interchanging the written factors and their derivative allocations in (PI34).

6. The global expansion and every remainder derivative

The exact global algebra identity follows from (PI22) and (PI32): τ(pqN)=θqN=τ+τRN. \tau(pq_N)=\theta q_N=\tau+\tau R_N. Subtract qNq_N and use θ−1=−χ\theta-1=-\chi. The result is τ=qN+ρN,ρN=−τRN−χqN.(PI37) \boxed{\quad \tau=q_N+\rho_N,\qquad \rho_N=-\tau R_N-\chi q_N. \quad} \tag{PI37} Every factor here is a globally smooth function already constructed. This avoids use of p−1p^{-1} in the discarded region. On the invertible region, the first term is precisely −(1−χ)p−1∑sρN,sΞ−N−s-(1-\chi)p^{-1}\sum_s\rho_{N,s}\Xi^{-N-s}. The ordered alternative is ρN=−R̃Nτ−χqN,(PI38) \rho_N=-\widetilde R_N\tau-\chi q_N, \tag{PI38} obtained from (PI36). Both formulas equal the same actual difference τ−qN\tau-q_N, although their matrix factors occupy different sides.

For full quantitative estimates, (PI14) and (PI30) imply [qN]−m,0;β,α,r≤QN;β,α,r:=∑j=0N−1∑ϵ≤α(αϵ)bj;β,ϵH(−m−j;r,α−ϵ).(PI39) [q_N]_{-m,0;\beta,\alpha,r}\leq Q_{N;\beta,\alpha,r} :=\sum_{j=0}^{N-1}\sum_{\epsilon\leq\alpha}\binom\alpha\epsilon b_{j;\beta,\epsilon}H(-m-j;r,\alpha-\epsilon). \tag{PI39} Before applying (PI16), the jj-th differentiated term has weight Q−m−j−rhj−|α|Q^{-m-j-r}h^{j-|\alpha|}. Its ratio to the displayed target weight is (h/Q)j(h/Q)^j, exactly.

Likewise, [RN]−N,N;β,α,r≤DN;β,α,r:=∑s=0m−1∑ϵ≤α(αϵ)cN,s;β,ϵH(−N−s;r,α−ϵ).(PI40) [R_N]_{-N,N;\beta,\alpha,r}\leq D_{N;\beta,\alpha,r} :=\sum_{s=0}^{m-1}\sum_{\epsilon\leq\alpha}\binom\alpha\epsilon c_{N,s;\beta,\epsilon}H(-N-s;r,\alpha-\epsilon). \tag{PI40} The pre-comparison weight is Q−N−s−rhN+s−|α|Q^{-N-s-r}h^{N+s-|\alpha|}; its ratio to Q−N−rhN−|α|Q^{-N-r}h^{N-|\alpha|} is (h/Q)s≤1(h/Q)^s\leq1. Thus RN∈S−N,NR_N\in S^{-N,N}, with every derivative and every negative exponent controlled.

For the inverse term in (PI37), the product bound (PI15) gives [τRN]−m−N,N;β,α,r≤FN;β,α,r, [\tau R_N]_{-m-N,N;\beta,\alpha,r}\leq F_{N;\beta,\alpha,r}, where the explicit finite constant is FN;β,α,r=∑γ≤β,ϵ≤α0≤l≤r(βγ)(αϵ)(rl)Uγ,ϵ,lDN;β−γ,α−ϵ,r−l.(PI41) F_{N;\beta,\alpha,r} =\sum_{\substack{\gamma\leq\beta,\ \epsilon\leq\alpha\\0\leq l\leq r}} \binom\beta\gamma\binom\alpha\epsilon\binom rl U_{\gamma,\epsilon,l} D_{N;\beta-\gamma,\alpha-\epsilon,r-l}. \tag{PI41} In particular the inverse contribution has precisely the required mixed order, with the rightmost coefficient factors never interchanged with τ\tau.

The cutoff contribution is better than required in every mixed order. Put χϵ,l=sup⁡ξ|∂ηϵ∂ζlχ|\chi_{\epsilon,l}=\sup_\xi|\partial_\eta^\epsilon\partial_\zeta^l\chi|. For arbitrary real u,vu,v, direct Leibniz differentiation of χqN\chi q_N, using (PI39), yields [χqN]u,v;β,α,r≤KN;u,v;β,α,r:=∑ϵ≤α,0≤l≤r(αϵ)(rl)χϵ,lQN;β,α−ϵ,r−l×HM(−m−u+l)++(−v+|ϵ|)+.(PI42) \begin{split} [\chi q_N]_{u,v;\beta,\alpha,r} \leq K_{N;u,v;\beta,\alpha,r} :=\sum_{\epsilon\leq\alpha,\ 0\leq l\leq r} \binom\alpha\epsilon\binom rl \chi_{\epsilon,l}Q_{N;\beta,\alpha-\epsilon,r-l}\\ {}\times H_M^{(-m-u+l)_+ +(-v+|\epsilon|)_+}. \end{split} \tag{PI42} To verify this exponent exactly, divide the differentiated qNq_N weight Q−m−r+lh−|α|+|ϵ|Q^{-m-r+l}h^{-|\alpha|+|\epsilon|} by the requested Qu−rhv−|α|Q^{u-r}h^{v-|\alpha|}. The quotient is Q−m−u+lh−v+|ϵ|Q^{-m-u+l}h^{-v+|\epsilon|}. On the support of each cutoff derivative, 1≤h≤Q≤HM1\leq h\leq Q\leq H_M, so any negative power is at most one and any positive power is bounded by its corresponding power of HMH_M. This proves (PI42) for real u,vu,v without discarding negative derivative shifts.

Set u=−m−Nu=-m-N, v=Nv=N in (PI42). Equations (PI37), (PI41), and (PI42) prove ∥∂xβ∂ηα∂ζrρN∥≤(FN;β,α,r+KN;−m−N,N;β,α,r)Q−m−N−rhN−|α|,ρN∈S−m−N,N.(PI43) \begin{split} \|\partial_x^\beta\partial_\eta^\alpha\partial_\zeta^r\rho_N\| &\leq \left(F_{N;\beta,\alpha,r} +K_{N;-m-N,N;\beta,\alpha,r}\right) Q^{-m-N-r}h^{N-|\alpha|},\\ \rho_N&\in S^{-m-N,N}. \end{split} \tag{PI43} Together with (PI30), (PI31), and (PI37), this is the required expansion for every N≥1N\geq1: τ=∑j=0N−1τj(x,ξ′)Ξ−m−j+ρN,τj∈Stanj,ρN∈S−m−N,N.(PI44) \tau=\sum_{j=0}^{N-1}\tau_j(x,\xi')\Xi^{-m-j}+\rho_N,\qquad \tau_j\in S^j_{\mathrm{tan}},\quad \rho_N\in S^{-m-N,N}. \tag{PI44} The constants use only finitely many indicated seminorms of the actual pkp_k, the given C0C_0, the actual cutoff derivatives and radius, and the fixed derivative orders, dimension, m,Nm,N. The same coefficient sequence works for every truncation. These finite expansions need not be a convergent infinite series.

For N=0N=0, the sum is empty and ρ0=τ∈S−m,0\rho_0=\tau\in S^{-m,0} by (PI21). Thus this value is covered when the phrase “every NN” includes zero. If the polynomial degree is m=0m=0, then p=Idp=I_d, τ=(1−χ)Id\tau=(1-\chi)I_d, and one takes τ0=Id\tau_0=I_d, τj=0\tau_j=0 for j≥1j\geq1. For N≥1N\geq1, qN=Idq_N=I_d, ρN=−χId\rho_N=-\chi I_d; the same compact-support proof as (PI42) puts it in every real mixed order. This handles the degenerate polynomial case as well.

If a later application prescribes a real number ss or ν\nu, an integer N≥max⁡(0,s)N\geq\max(0,s), or N≥max⁡(0,ν)N\geq\max(0,\nu), can be chosen because (PI44) holds for every nonnegative integer. For example the choices N=max⁡(0,⌈s⌉)N=\max(0,\lceil s\rceil) and N=max⁡(0,⌈ν⌉)N=\max(0,\lceil\nu\rceil) are exact. The mapping estimates themselves require their stated one-sided operator arguments; the present result supplies their full expansion at every such chosen truncation.

7. A complete noncommuting polynomial example

Take d=2d=2, any n≥1n\geq1, and U=(0100),V=(0010),W=U+V,UV=(1000),VU=(0001).(PI45) U=\begin{pmatrix}0&1\\0&0\end{pmatrix},\qquad V=\begin{pmatrix}0&0\\1&0\end{pmatrix},\qquad W=U+V,\quad UV=\begin{pmatrix}1&0\\0&0\end{pmatrix},\quad VU=\begin{pmatrix}0&0\\0&1\end{pmatrix}. \tag{PI45} Here U2=V2=0U^2=V^2=0, W2=I2W^2=I_2, and UV≠VUUV\ne VU. Each of U,V,UV,VUU,V,UV,VU has operator norm one, as follows by applying it to (z1,z2)(z_1,z_2) and computing the Euclidean norm. The same is true of WW, which exchanges the two coordinates.

Keep h=⟨η⟩h=\langle\eta\rangle and Ξ=ζ+ih\Xi=\zeta+ih. Define the actual degree-two polynomial, independent of xx, by p=(ΞI2+ihU)(ΞI2+ihV)=ζ2I2+ih(2I2+W)ζ−h2(I2+W+UV).(PI46) \begin{split} p&=(\Xi I_2+ihU)(\Xi I_2+ihV)\\ &=\zeta^2I_2+ih(2I_2+W)\zeta-h^2(I_2+W+UV). \end{split} \tag{PI46} Thus p2=I2p_2=I_2, p1=ih(2I2+W)∈Stan1p_1=ih(2I_2+W)\in S^1_{\mathrm{tan}}, and p0=−h2(I2+W+UV)∈Stan2p_0=-h^2(I_2+W+UV)\in S^2_{\mathrm{tan}}. These membership assertions include every derivative: all positive-order xx derivatives vanish, and (PI11) gives ∥∂ηαp1∥≤3K(1,α)h1−|α|,∥∂ηαp0∥≤3K(2,α)h2−|α|.(PI47) \|\partial_\eta^\alpha p_1\| \leq3K(1,\alpha)h^{1-|\alpha|},\qquad \|\partial_\eta^\alpha p_0\| \leq3K(2,\alpha)h^{2-|\alpha|}. \tag{PI47} The coefficient matrices themselves do not commute: [p1,p0]=−ih3[W,UV]=−ih3(V−U)≠0.(PI48) [p_1,p_0] =-ih^3[W,UV] =-ih^3(V-U)\ne0. \tag{PI48} Indeed WUV=VWUV=V, UVW=UUVW=U, by the displayed matrices.

Nilpotence gives exact inverses of the two factors: (ΞI2+ihU)−1=Ξ−1I2−ihΞ−2U,(ΞI2+ihV)−1=Ξ−1I2−ihΞ−2V.(PI49) (\Xi I_2+ihU)^{-1} =\Xi^{-1}I_2-ih\Xi^{-2}U,\qquad (\Xi I_2+ihV)^{-1} =\Xi^{-1}I_2-ih\Xi^{-2}V. \tag{PI49} For instance multiplying the first expression by ΞI2+ihU\Xi I_2+ihU on either side cancels the two linear UU-terms and leaves a multiple of U2=0U^2=0. Since |Ξ|=Q≥h|\Xi|=Q\geq h, each inverse has norm at most 2Q−12Q^{-1}. The original pp is consequently invertible everywhere and obeys ∥p−1∥≤4Q−2.(PI50) \|p^{-1}\|\leq4Q^{-2}. \tag{PI50} The ordered product of those inverses is p−1=(ΞI2+ihV)−1(ΞI2+ihU)−1=Ξ−2I2−ihWΞ−3−h2VUΞ−4.(PI51) \begin{split} p^{-1} &=(\Xi I_2+ihV)^{-1}(\Xi I_2+ihU)^{-1}\\ &=\Xi^{-2}I_2-ihW\Xi^{-3}-h^2VU\Xi^{-4}. \end{split} \tag{PI51} Every coefficient and sign follows from multiplication in that written order; the final coefficient is VUVU, not UVUV.

In the notation of (PI25), A1=ihW,A2=−h2UV.(PI52) A_1=ihW,\qquad A_2=-h^2UV. \tag{PI52} The recursion gives τ0=I2,τ1=−ihW,τ2=A12−A2=−h2I2+h2UV=−h2VU,τ3=−A1τ2−A2τ1=ih3WVU−ih3UVW=ih3U−ih3U=0.(PI53) \begin{split} \tau_0&=I_2,\qquad \tau_1=-ihW,\\ \tau_2&=A_1^2-A_2=-h^2I_2+h^2UV=-h^2VU,\\ \tau_3&=-A_1\tau_2-A_2\tau_1 =ih^3WVU-ih^3UVW=ih^3U-ih^3U=0. \end{split} \tag{PI53} Next τ4=−A1τ3−A2τ2=0\tau_4=-A_1\tau_3-A_2\tau_2=0, since UVVU=U(V2)U=0UVVU=U(V^2)U=0. The two-step recursion then gives τj=0\tau_j=0 for every j≥3j\geq3. This recovers (PI51) by the actual recursive coefficients rather than assuming it from the factorization.

Take first the admissible cutoff χ=0\chi=0, so τ=p−1\tau=p^{-1}. The remainders are exactly ρ1=−ihWΞ−3−h2VUΞ−4∈S−3,1,ρ2=−h2VUΞ−4∈S−4,2,ρN=0(N≥3).(PI54) \rho_1=-ihW\Xi^{-3}-h^2VU\Xi^{-4}\in S^{-3,1},\qquad \rho_2=-h^2VU\Xi^{-4}\in S^{-4,2},\qquad \rho_N=0\quad(N\geq3). \tag{PI54} All derivative estimates follow explicitly from (PI11) and (PI14), followed, for the second term of ρ1\rho_1, by the factor h/Q≤1h/Q\leq1. This matches the target orders S−m−N,NS^{-m-N,N} with m=2m=2. The finite expansion terminates here because of the particular nilpotent factors; no termination claim is made in the general theorem.

For any other allowed compact frequency cutoff χ\chi, the coefficients τj\tau_j stay exactly those in (PI53), because they depend on pp rather than the cutoff. For N≥3N\geq3 the exact remainder is then ρN=−χp−1.(PI55) \rho_N=-\chi p^{-1}. \tag{PI55} It belongs to every mixed order by (PI42). Thus even a terminating inverse series does not make the actual cutoff remainder vanish unless the cutoff term vanishes.

8. Solved exercise detecting an invalid matrix reversal

Exercise. For (PI46), compute the polynomial inverse and the first three inverse-series coefficients at η=0,ζ=0\eta=0,\zeta=0. Compare the true inverse with the expression obtained by reversing the two inverse factors in (PI51). Verify the residual coefficient identity τ2=−ρ2,0\tau_2=-\rho_{2,0} before substituting this frequency.

Solution. At η=0\eta=0, h=1h=1; at ζ=0\zeta=0, Ξ=i\Xi=i. These are the original frequency values. Equation (PI46) gives p=−(I2+U)(I2+V)=(−2−1−1−1),p−1=(−111−2).(PI56) p=-(I_2+U)(I_2+V) =\begin{pmatrix}-2&-1\\-1&-1\end{pmatrix},\qquad p^{-1}=\begin{pmatrix}-1&1\\1&-2\end{pmatrix}. \tag{PI56} Their product in either order is I2I_2, by direct entry multiplication. The coefficients at this frequency are τ0=I2,τ1=−i(0110),τ2=−(0001).(PI57) \tau_0=I_2,\qquad \tau_1=-i\begin{pmatrix}0&1\\1&0\end{pmatrix},\qquad \tau_2=-\begin{pmatrix}0&0\\0&1\end{pmatrix}. \tag{PI57} Since i−2=−1i^{-2}=-1, i−3=ii^{-3}=i, and i−4=1i^{-4}=1, their terms add to −I2+W−VU-I_2+W-VU, which is the inverse matrix in (PI56).

Reversing the inverse factors instead gives the different symbol qwrong=Ξ−2I2−ihWΞ−3−h2UVΞ−4.(PI58) q_{\mathrm{wrong}} =\Xi^{-2}I_2-ihW\Xi^{-3}-h^2UV\Xi^{-4}. \tag{PI58} At the selected frequency its value and left product with pp are qwrong=(−211−1),pqwrong=(3−110)≠I2.(PI59) q_{\mathrm{wrong}}= \begin{pmatrix}-2&1\\1&-1\end{pmatrix},\qquad p q_{\mathrm{wrong}}= \begin{pmatrix}3&-1\\1&0\end{pmatrix}\ne I_2. \tag{PI59} The error is exactly the replacement of the ordered matrix VUVU by UVUV; scalar powers and frequency coordinates were unchanged.

For N=2N=2, the residual coefficient constraints in (PI32) give ρ2,0=A1τ1+A2τ0=h2W2−h2UV=h2VU,ρ2,1=A2τ1=ih3UVW=ih3U.(PI60) \begin{split} \rho_{2,0} &=A_1\tau_1+A_2\tau_0 =h^2W^2-h^2UV=h^2VU,\\ \rho_{2,1} &=A_2\tau_1=ih^3UVW=ih^3U. \end{split} \tag{PI60} Thus τ2=−ρ2,0\tau_2=-\rho_{2,0}, with tangential orders 22 and 33 for the two residual coefficients. The other product has ρ̃2,0=h2VU\widetilde\rho_{2,0}=h^2VU and ρ̃2,1=τ1A2=ih3V\widetilde\rho_{2,1}=\tau_1A_2=ih^3V. The highest residual coefficients differ, confirming why (PI32) and (PI36) have to retain their separate multiplication orders. Each still yields the same actual inverse remainder through its corresponding formula (PI37) or (PI38).

References

The finite ordered inverse derivative identity is Inverting mixed symbols without commuting matrix factors, (MSI6), restated in (PI18); its cutoff estimates are supplied above in the exact notation needed here. The separate one-sided operator mapping estimates use this construction in subsequent units.