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
,
and the order of every matrix product. All position-variable estimates
are uniform on the original
.
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
and an integer
.
Write
Keep also the original weights
The equality
is exact. It follows by squaring the modulus; there is no rescaling of a
frequency coordinate.
For real
,
a smooth matrix function
is in the bracket presentation of
when all seminorms
are finite, where
,
,
.
Matrices carry their Euclidean operator norm. The original presentation
replaces the denominator by
,
and its seminorm is written
.
For each
,
.
Thus
.
If
,
,
and
,
,
then
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
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
proves the assertion with
,
with constants (PI5), including when either differentiated exponent is
negative.
A tangential symbol
,
for real
,
means
Its
-weight
presentation satisfies the one-factor version of (PI4)–(PI5), with
exponent
.
Take the given polynomial
Let
be the fixed frequency cutoff,
,
and
.
The meaning of the cutoff inverse hypothesis is that
is invertible at every
with
,
and
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
vanishes on a neighborhood. Define the original function
The expansion below concerns this same
,
without alteration of
or
.
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
and nonnegative integer
,
let
,
with empty product one. For a tangential multiindex
,
differentiation of
gives the exact finite identity
Here
are tangential multiindices and their equation is componentwise. To
prove it, expand the finite Taylor polynomial of the scalar function
at
,
substitute
,
and compare the coefficient of
.
Only terms through total degree
can contribute, so the calculation is a finite Taylor identity for
derivatives and does not require convergence of an infinite series.
Since
,
each summand is bounded by a constant times
.
Explicitly put
Then
,
for every real
;
.
For
the tangential multiindices are empty,
,
and the same formulas have their empty-index meanings.
Since
is in the open upper half-plane, define
with its argument in
,
for every real
.
Its modulus is
.
Normal differentiation yields
.
For tangential derivatives, the finite Taylor chain rule gives, when
,
The inner lists are ordered. The factor
is the scalar Taylor factor; the multinomial coefficient comes from
multiplying the
positive-degree Taylor polynomials of
.
Thus no multiplicity has been suppressed.
Let the sum on the right below have its single value one at
,
and otherwise only the displayed positive partitions:
Combining (PI11)–(PI12) with
proves
Indeed a term before the last
comparison has weight
,
whose ratio to the displayed weight is
.
This works for all real
,
including every negative exponent used in the expansion.
The pointwise product rule gives, for arbitrary real orders,
Each term preserves the order
.
Its first weight exponents add to
,
and its second to
,
as literal equalities. Also, for every real
,
This follows from the exact weight
ratio
,
and remains valid for negative differentiated exponents.
3. The
original polynomial and its cutoff inverse estimates
Set
,
finite by hypothesis. Since
for
and vanishes otherwise, (PI7) gives
For
the sum and derivative are zero. To verify the bound term by term,
divide
by
.
The quotient is
.
Thus the actual polynomial belongs to
.
For clarity all inverse constants can now be written with the bracket
weights. Use a combined derivative multiindex
.
Section 2 of Inverting mixed symbols
without commuting matrix factors, formula (MSI6), proves the exact
finite inverse derivative formula
for
,
on the open set of invertible matrices. It is obtained by taking the
finite Taylor polynomial of
,
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
Equations (PI8), (PI17), and (PI18)
prove
The
inverse factors and
polynomial derivative factors give exponent
;
the tangential exponents sum to
.
All orders and constants are therefore retained.
Choose
such that
,
and put
.
For a frequency multiindex
,
write
The derivative of
is supported in this ball whenever
.
Leibniz’ rule and (PI20) give
The weight correction on a nonzero
cutoff derivative is exactly
.
The function in (PI9) is smooth globally. Outside
,
is locally zero. At a point of
,
the invertible matrix
has a smooth local inverse by the determinant formula; its product with
agrees with (PI9) on that neighborhood, including points outside
.
This proves smoothness at its boundary and makes (PI21) a global
estimate. It also proves the global exact identities
4.
Re-expression in the unchanged complex normal coordinate
Substitute the literal identity
into the polynomial:
The scalar
commutes with matrices, so this binomial expansion does not move one
matrix past another. Each
has tangential order
.
In fact
The weight exponent in each term is
,
including all its possibly negative values.
Write
Let
denote the explicit right side of (PI24) with
.
It is a finite bound for every tangential derivative seminorm of
.
Define matrices
recursively by
This specifies the multiplication
order. A closed finite expression for the same coefficient is
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
This equality is a sum identity
obtained from the same ordered lists; it does not assert pairwise
commutation of its factors.
Each
is in
.
Explicit constants that prove every derivative bound are obtained as
follows. Put
and
for
.
For
,
set
Induction using the tangential Leibniz
identity shows
The exponent is
,
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
,
let
Multiplying (PI25) by this sum on the
right gives constant coefficient
,
and all coefficients of
for
vanish by (PI26). The complete remaining finite polynomial in
is
An empty sum is zero. The largest
possible total index is
,
which explains the precise last value
.
Each coefficient has the exact asserted order
For the second assertion, the
constraint
,
,
is exactly
and
,
which is the recursion for
.
The explicit all-derivative constants for these residual coefficients
are
Then
In particular this proves the required
coefficient order
,
not merely a bound after multiplication by a power of
.
The other product has its own ordered residual:
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):
Subtract
and use
.
The result is
Every factor here is a globally smooth
function already constructed. This avoids use of
in the discarded region. On the invertible region, the first term is
precisely
.
The ordered alternative is
obtained from (PI36). Both formulas
equal the same actual difference
,
although their matrix factors occupy different sides.
For full quantitative estimates, (PI14) and (PI30) imply
Before applying (PI16), the
-th
differentiated term has weight
.
Its ratio to the displayed target weight is
,
exactly.
Likewise,
The pre-comparison weight is
;
its ratio to
is
.
Thus
,
with every derivative and every negative exponent controlled.
For the inverse term in (PI37), the product bound (PI15) gives
where the explicit finite constant is
In particular the inverse contribution
has precisely the required mixed order, with the rightmost coefficient
factors never interchanged with
.
The cutoff contribution is better than required in every mixed order.
Put
.
For arbitrary real
,
direct Leibniz differentiation of
,
using (PI39), yields
To verify this exponent exactly, divide
the differentiated
weight
by the requested
.
The quotient is
.
On the support of each cutoff derivative,
,
so any negative power is at most one and any positive power is bounded
by its corresponding power of
.
This proves (PI42) for real
without discarding negative derivative shifts.
Set
,
in (PI42). Equations (PI37), (PI41), and (PI42) prove
Together with (PI30), (PI31), and
(PI37), this is the required expansion for every
:
The constants use only finitely many
indicated seminorms of the actual
,
the given
,
the actual cutoff derivatives and radius, and the fixed derivative
orders, dimension,
.
The same coefficient sequence works for every truncation. These finite
expansions need not be a convergent infinite series.
For
,
the sum is empty and
by (PI21). Thus this value is covered when the phrase “every
”
includes zero. If the polynomial degree is
,
then
,
,
and one takes
,
for
.
For
,
,
;
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
or
,
an integer
,
or
,
can be chosen because (PI44) holds for every nonnegative integer. For
example the choices
and
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
,
any
,
and
Here
,
,
and
.
Each of
has operator norm one, as follows by applying it to
and computing the Euclidean norm. The same is true of
,
which exchanges the two coordinates.
Keep
and
.
Define the actual degree-two polynomial, independent of
,
by
Thus
,
,
and
.
These membership assertions include every derivative: all positive-order
derivatives vanish, and (PI11) gives
The coefficient matrices themselves do
not commute:
Indeed
,
,
by the displayed matrices.
Nilpotence gives exact inverses of the two factors:
For instance multiplying the first
expression by
on either side cancels the two linear
-terms
and leaves a multiple of
.
Since
,
each inverse has norm at most
.
The original
is consequently invertible everywhere and obeys
The ordered product of those inverses
is
Every coefficient and sign follows from
multiplication in that written order; the final coefficient is
,
not
.
In the notation of (PI25),
The recursion gives
Next
,
since
.
The two-step recursion then gives
for every
.
This recovers (PI51) by the actual recursive coefficients rather than
assuming it from the factorization.
Take first the admissible cutoff
,
so
.
The remainders are exactly
All derivative estimates follow
explicitly from (PI11) and (PI14), followed, for the second term of
,
by the factor
.
This matches the target orders
with
.
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
,
the coefficients
stay exactly those in (PI53), because they depend on
rather than the cutoff. For
the exact remainder is then
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
.
Compare the true inverse with the expression obtained by reversing the
two inverse factors in (PI51). Verify the residual coefficient identity
before substituting this frequency.
Solution. At
,
;
at
,
.
These are the original frequency values. Equation (PI46) gives
Their product in either order is
,
by direct entry multiplication. The coefficients at this frequency are
Since
,
,
and
,
their terms add to
,
which is the inverse matrix in (PI56).
Reversing the inverse factors instead gives the different symbol
At the selected frequency its value and
left product with
are
The error is exactly the replacement of
the ordered matrix
by
;
scalar powers and frequency coordinates were unchanged.
For
,
the residual coefficient constraints in (PI32) give
Thus
,
with tangential orders
and
for the two residual coefficients. The other product has
and
.
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.