AN-04 proof edition · CC0; linked GFDL prerequisites retain notices
The sharp lower bound for a finite system
The boundary energy argument uses a positive 2×2 matrix symbol. This companion proves its full sharp lower bound by applying the already proved scalar moving probe to each component. The result holds for every fixed finite matrix size N. Constants may depend on N; no dimension-independent or infinite-dimensional assertion is made.
This connecting exposition is dedicated to CC0 1.0. The linked scalar probe and its cancellation proof are separately licensed under GFDL 1.2 only; their original notices remain with those components.
M1. Matrix Sobolev bounds and ordered remainders
Use D=−i∂, left quantization and the inner product linear in its first argument. For u=(u1,…,uN), define
∥u∥s,N2=j=1∑N∥uj∥s2,pr,L(N)(a)=j,kmaxpr,L(ajk).(MG1)
The scalar seminorm and norm are those in the complete scalar companion, G1. That proof gives completeness, Schwartz density and the scalar global operator bound. Finite sums give completeness and simultaneous density in these vector norms. Applying the scalar bound entry by entry and Cauchy–Schwarz to the finite row sum gives
∥Op(a)u∥s−r,N≤NCr,s,npr,J(N)(a)∥u∥s,N.(MG2)
Indeed each row is bounded by Cp∑k∥uk∥s≤CpN∥u∥s,N, and summing the N squared row bounds gives MG2. The Fourier dual pairing therefore gives
∣(Op(d)u,u)∣≤NCm,np2m,J(N)(d)∥u∥m,N2(d∈S2m).(MG3)
The ordinary composition and adjoint proof O3 also applies entry by entry: the (j,k) entry of a composition is the finite sum over ℓ of the scalar composition of ajℓ and bℓk. Every differentiated term keeps this order. The (j,k) entry of the adjoint is the scalar adjoint of akj. Each finite remainder has its stated order with a constant multiplied by at most a finite power of N. Thus a Hermitian symbol B∈Sr satisfies
Op(B)−Op(B)∗∈Op(Sr−1).(MG4)
No diagonalization depending on phase space is required.
Use the even normalized bump, scalar B=Op(φ), scalar Schwartz symbol ψ of B∗B, and scalar unitary Uy,η,q from the included probe proof, G4. There ∫ψ=1, the exact conjugation identity P26 holds, and q(η)=⟨η⟩1/2. Apply B,U separately to each of the N entries. A constant matrix commutes with both scalar kernels.
For a Hermitian pointwise nonnegative matrix symbol A∈Sr, define A+=IψA entry by entry by P29. The scalar convergence estimate P30 proves that each entry is smooth and every differentiated integral is locally absolutely convergent. The quadratic form identity is
(Op(A+)u,u)=∬R2n(A(y,η)BUy,η,q(η)∗u,BUy,η,q(η)∗u)L2(Rn;CN)dydη≥0.(MG5)
Here the matrix is constant in the inner t variable of the L2 pairing. To justify the integral, apply the full P32 integration-by-parts estimate to each uj. For every M it bounds each Lt2 norm of BU∗uj by Cu,M⟨y⟩−M⟨η⟩−M. There are finitely many entries, and ∥A(y,η)∥≤Npr,0(N)(A)⟨η⟩r. The quadratic integrand is therefore absolutely integrable, including for positive r.
For compact parameter cutoffs, expand the finite matrix pairing and use the scalar kernel identity P26, ordinary Fubini and polarization on its finitely many pairs of scalar inputs. This proves the equality with the cutoff integral. P30 on the symbol side and P32 on the form side permit dominated convergence as the cutoffs tend to one. This proves MG5. Its nonnegativity follows pointwise from A≥0, integrated first in t and then in (y,η). It is a statement on Schwartz vectors, with no prior boundedness assertion for a positive-order operator.
M3. The full one-order improvement and lower bound
The exact scalar cancellation proof G5, P33–P42, with ρ=1,δ=0, applies to each entry. In particular, with every differentiated remainder and finite-seminorm bound,
A−A+∈Sr−1(R2n;CN×N).(MG6)
For a general complex matrix symbol a∈S2m+1, suppose its Hermitian part A=(a+a∗)/2 is nonnegative. Write a=A+iB, where B=(a−a∗)/(2i) is Hermitian. MG5 and MG6, followed by MG3, give the lower bound for Op(A). For B, MG4 and the convention that the inner product is linear in its first argument give
Re(iOp(B)u,u)=2i((Op(B)−Op(B)∗)u,u).(MG7)
The right side is real and is bounded in absolute value by MG3. Both matrix parts have seminorms controlled by those of a. We conclude that for every real m, with a fixed finite J,
Re(Op(a)u,u)≥−Cm,n,Np2m+1,J(N)(a)∥u∥m,N2,u∈S(Rn;CN).(MG8)
The constant is uniform over bounded symbol families. All estimates are global in the base variable because the earlier scalar proofs have that scope.
M4. The two energy receivers and time dependence
For a∈S2 with nonnegative Hermitian part, choose m=1/2 in MG8. For a∈S0 choose m=−1/2. Thus
Re(Op(a)u,u)Re(Op(a)u,u)≥−C∥u∥1/2,N2≥−C∥u∥−1/2,N2(a∈S2),(a∈S0).(MG9)
These statements retain their half-derivative losses.
More generally conjugate by the scalar weight EsIN. The ordered composition just proved gives a full symbol
EsOp(a)E−s=Op(a+ds),ds∈Sr−1,(MG10)
for a∈Sr, uniformly in bounded families. The zeroth term is a; every other term and the finite remainder lose an order, since a frequency derivative of a scalar weight lowers its order. Apply MG8 to a, and MG3 to ds, with m=(r−1)/2. With v=Esu,
Re(EsOp(a)u,Esu)≥−Cr,s,n,N∥u∥s+(r−1)/2,N2.(MG11)
This starts on Schwartz vectors; simultaneous approximation passes to any Sobolev class where the pairing is defined. For a bounded time-dependent symbol family the same finite seminorm bounds make the constants uniform. If each entry is distributionally continuous in (x,ξ), the complete scalar G7 argument gives strong continuity Hs→Hs−r for each entry; the finite sum and MG2 give it for the matrix operator.
For example z∈C and ε≥0 give
A=(1zˉz∣z∣2+ε),(Aw,w)=∣w1+zw2∣2+ε∣w2∣2≥0.(MG12)
The identity follows by expanding the squared modulus with the stated inner product convention. It supplies a non-diagonal positive matrix at each point when z,ε vary; only the appropriate symbol bounds are then additionally required. This pointwise example illustrates the hypothesis, while MG5–MG11 prove the operator estimates.
The mathematical antecedent of the scalar probe is Hörmander, The Analysis of Linear Partial Differential Operators III, approved 2007 eBook, Theorem 18.1.14. The actual earlier programme proof, including its full convergence and cancellation estimates, is the linked CE companion. This finite-matrix adapter proves every additional finite-sum step. It does not supply the scalar Fefferman–Phong estimate, whose order-two L2 error is stronger than MG9.