AN-04 proof edition · CC0; exact source credit and separately licensed prerequisites
Boundary tests, lacunary symbols and all normal jets
These connected components retain AN03-U032, Totally characteristic operators on the half space, Sections 2–5, Section 6 through Example 6.7, and Sections 7–13. Original author: Claude Opus 5.5 (Anthropic), September 2026; editorial additions: Codex, September 2026. Both were dedicated to the public domain (CC0). Current prerequisite connections and proof clarifications: AN-04 course-writing task and OpenAI Codex, 5 October 2026, also CC0. The selected components retain every mathematical display, the full scalar and finite-matrix hypotheses, and all five original solved exercises.
The approved mathematical antecedent is Hörmander III, 2007 eBook, ISBN 978-3-540-49938-1, Section 18.3. Its use and ordinary citation are valid. Complete proofs are supplied in the components and the exact earlier programme proofs. The earlier linked components retain their individual licences.
The four components, in proof order, are Boundary tests, lacunary symbols and all normal jets, Resolved corner kernels and their exact inverse, Boundary adjoints, complete composition and distributional action, Boundary operator bounds, conormal action and the residual obstruction. Original section and equation numbers are retained across them. Sections 6.8 (polyhomogeneous corner characterization) and 14 (arbitrary positive-order Sobolev loss) are separate unadopted obligations; the theorems below do not substitute for those results or for the global compressed wave-front calculus.
1. Exact prerequisites and full test-space topology
Use D=−i∂, forward Fourier exponential e−ix⋅ξ, inverse factor (2π)−n, and Hilbert pairing (u,v)=∫uv, linear in the first slot. Every bar on a scalar symbol in the adjoint formulas becomes conjugate transpose for finite matrices; products keep the displayed order and source/target dimensions. Complex-linear distribution pairings are used explicitly as functionals on test functions; Hilbert antidual formulas insert the indicated complex conjugation. When n=1, tangential space is the single point R0, with measure one; its Fourier transform is the identity and its test functions are scalars. This includes the tensor tests in Section 12.
The ordinary quadratic multiplier and operator calculus O0–O6 gives Schwartz quantization, the exact Gauss multiplier, its full pre-diagonal estimate (O9), all parameter derivatives and convergence on bounded symbol sets. The Fourier and measure proofs supply inversion, Plancherel, Fubini and dominated convergence. The Lebesgue Schur and dyadic estimates, Hahn–Banach and integral inequalities, and half-space Hilbert duality are exact earlier proofs. All kernel bounds used here are on Lebesgue measure spaces.
The conormal amplitude and test-space proofs give all-real Besov norms (C2), coordinate and coefficient bounds, amplitude characterization, tangent generators and complete conormal spaces. The supported conormal companion gives the actual supported topology and distribution conventions. In ambient dimension N, codimension k, conormal order μ means tangent-word Besov order −μ−N/4; its reduced amplitude has order μ+(N−2k)/4. In Section 11 below Aκ uses the Besov index κ, rather than the conormal index used by the companion. Thus its conormal order is exactly −κ−n/4.
We use the following full topological facts so that no quotient-completeness citation is left in place of a proof.
1.1. Schwartz completeness and a complete quotient
Let pj be the increasing Schwartz seminorms consisting of the suprema of all weighted derivatives through index j. A sequence Cauchy in every pj converges uniformly, with every derivative, on each compact set. The fundamental theorem of calculus on coordinate segments shows that its derivative limits are derivatives of its function limit. Its weighted bounds and the Cauchy bounds pass to the limit pointwise and then by taking suprema. Thus the limit is Schwartz and convergence holds in every pj. The metric
∑j≥02−j−1min(1,pj(u−v)) induces precisely the seminorm topology and Cauchy notion: finite initial sums control a fixed seminorm, and the geometric tail is uniformly small. This proves Schwartz Fréchet completeness directly.
Here is the quotient argument in the needed generality. For a closed subspace N of a complete space with increasing seminorms pj, put
pˉj([x])=infn∈Npj(x+n).
These seminorms induce the quotient topology: a basic ball for one increasing seminorm maps to exactly the corresponding strict quotient ball, and its inverse image is the union of its translates by N, an open set. They separate points. Indeed if all pˉj([x])=0, choose nj with pj(x+nj)<1/j; then −nj→x, so closedness gives x∈N.
If zl is Cauchy in every pˉj, choose a subsequence zlj so that
pˉj(zlj+1−zlj)<2−j−1.
For each difference choose a representative hj with pj(hj)<2−j, and a representative x1 of zl1. For every fixed k, the tail of ∑jhj is Cauchy in pk, since pk≤pj when j≥k. Completeness gives x=x1+∑jhj; its partial sums represent the chosen subsequence. Thus the subsequence converges to [x], and the original Cauchy sequence does too, by the triangle inequality. The same countable-seminorm metric proves that this is a Fréchet quotient. This applies to the closed subspace of Schwartz functions vanishing in the positive half-space.
1.2. Fourier kernels without an unproved representation theorem
For the explicitly polynomially bounded compressed symbol a♭, its partial inverse Fourier transform in frequency is a tempered distribution in (x,z); the invertible linear substitution z=x−y gives Ka. Pairing it with v(y)φ(x) and using Fourier inversion gives the operator integral (4.3), with the appropriate complex conjugation for the Hilbert pairing. These operations are inverse, so its kernel determines a♭. Product tests determine the kernel: O0.1 proves density by Fourier inversion, frequency truncation and finite Riemann sums on compact supports. Therefore the action on Schwartz tests also determines a♭, and hence a(x,ξ′,ξn) for xn>0; continuity determines it at zero. Only this explicitly constructed kernel is used. No general Schwartz kernel representation theorem is needed.
All-real Besov completeness and the endpoint sequence inequalities are the exact proofs in the conormal companion. Local smooth and symbol completeness follows by the same uniform derivative limit argument above, with each specified weight. Every asymptotic formula below means its actual finite expansion with a remainder at each requested order; the complete quadratic-multiplier estimate proves those remainders. Construction of prescribed infinite symbol sums is a separate step of the later global calculus.
1.3. Conventions for the retained calculus
Throughout n≥1, x=(x′,xn)∈Rn−1×R, and
R±n={x:±xn>0},R+n={x:xn≥0}.
We write D=−i∂, u(ξ)=∫e−ix⋅ξu(x)dx (inverse factor (2π)−n), ⟨ξ⟩=(1+∣ξ∣2)1/2, and (u,v)=∫uv, linear in the first argument. For a function of (x,ξ) we write a(β)(α)=∂ξα∂xβa.
C∞(R+n) denotes the functions on R+n that are smooth in R+n and whose derivatives all extend continuously to R+n. Compactly localized such functions admit Schwartz extensions by Lemma 3.2(c) below, whose proof uses only the just-proved quotient completeness; a partition gives the local smooth extension assertion. Cb∞ means smooth with all derivatives bounded.
Sobolev and Besov spaces. H(s) is the space of tempered distributions u whose Fourier transform is locally square integrable and for which the norm ∥u∥(s)2=(2π)−n∫⟨ξ⟩2s∣u∣2dξ is finite. With the sharp annuli A0={∣ξ∣<1}, Aj={2j−1≤∣ξ∣<2j} and the Fourier projections Πj onto them, the dyadic Besov norm is
∥u∥B2,ps=(2js∥Πju∥L2)j≥0ℓp,1≤p≤∞.(1.1)
B2,ps is the space of tempered distributions with locally square-integrable Fourier transform for which this norm is finite. Since ⟨ξ⟩ is comparable to 2j on Aj, B2,2s=H(s) with equivalent norms. A distribution u on an open set Ω⊂Rn lies in the local space B2,p,locs(Ω) if χu, extended by zero, lies in B2,ps for every χ∈C0∞(Ω).
Values of symbols. All symbols may take values in L(Cp,Cq) for fixed finite p,q. Then ∣⋅∣ is the operator norm, products keep their order, and complex conjugation of a symbol is replaced by the conjugate transpose a∗. Every statement below holds in this generality with the same proof, except the square-root step in the proof of Theorem 10.1, where we say what changes. The reader may keep p=q=1 in mind.
We also use Peetre's inequality (1+∣ξ+ζ∣)s≤(1+∣ξ∣)s(1+∣ζ∣)∣s∣ for real s, which follows from 1+∣ξ∣≤(1+∣ξ+ζ∣)(1+∣ζ∣).
2. Totally characteristic differential operators
Let Vb be the smooth vector fields V=∑jvj∂j, vj∈C∞(R+n), that are tangent to the boundary, that is, vn(x′,0)=0. Let Diffb(R+n) be the algebra of operators on C∞(R+n) generated by Vb and by multiplication with functions in C∞(R+n), and Diffbm the span of products containing at most m vector fields. Its elements are the totally characteristic differential operators.
Proposition 2.1 (Structure of totally characteristic differential operators).
(a) Vb is the C∞(R+n)-module generated by ∂1,…,∂n−1 and xn∂n.
(b) For every integer k≥0,
xnkDnk=j=0∏k−1(xnDn+ij)=:qk(xnDn).(2.1)
Hence {xnjDnj:j≤k} and {(xnDn)j:j≤k} span the same space, with constant coefficients.
(c) Diffbm consists exactly of the finite sums
P=∣α∣≤m∑cα(x)xnαnDα,cα∈C∞(R+n),(2.2)
equivalently of the sums ∑∣α∣≤mcα′(x)D′α′(xnDn)αn.
(d) For P as in (2.2) and u∈C∞(R+n), (Pu)(x′,0)=∑αn=0cα(x′,0)D′α′u(x′,0): the boundary value of Pu depends only on the boundary value of u.
Proof. (a) If vn(x′,0)=0, then vn(x)=xnw(x) with w(x)=∫01(∂nvn)(x′,θxn)dθ∈C∞(R+n). Thus V=∑j<nvj∂j+wxn∂n. Conversely each generator is tangent.
(b) For k≥0 and u smooth, xnDn(xnkDnku)=xnk+1Dnk+1u+xn(Dnxnk)Dnku=xnk+1Dnk+1u−ikxnkDnku, because Dnxnk=−ikxnk−1. So xnk+1Dnk+1=(xnDn+ik)xnkDnk, and induction gives (2.1). The polynomial qk is monic of degree k, so the triangular system can be inverted.
(c) Moving a function to the left across a generator produces only multiplication operators: ∂jc=c∂j+(∂jc) and xn∂nc=cxn∂n+xn(∂nc). So a product of at most m vector fields and functions is a sum of terms c(x)M1⋯Ml, l≤m, with each Mi one of the generators in (a). These generators commute pairwise, because [xn∂n,∂j]=0 for j<n. So each word is a constant times D′β′(xnDn)βn with ∣β∣≤m, and (b) rewrites it in the form (2.2). Conversely xnαnDα=D′α′qαn(xnDn) is a product of ∣α∣ generators.
(d) At xn=0 every term with αn>0 carries the factor xnαn, which vanishes. □
Part (d) is the motivation for the whole lesson. An operator that respects the boundary in this way can be followed by boundary operators. Theorem 5.1(c) below extends (d) to the pseudodifferential operators of this lesson and to normal derivatives of every order.
3. Function spaces on the half space
Restrictions and supports
Two ways to attach a space to the half space. Let F be a space of distributions on Rn.
- F(R+n) is the space of restrictions U∣R+n, U∈F, with the quotient topology of F/{U∈F:U=0 in R+n}.
- F˙(R+n) is the space of U∈F with suppU⊂R+n, with the topology of F.
These are different objects and must be kept apart. A restriction of a Schwartz function may have any boundary values. A Schwartz function supported in R+n vanishes to infinite order on xn=0, since all its derivatives are continuous and vanish for xn<0. The zero extension of an element of S(R+n) is an integrable function in S˙′(R+n); it lies in S˙(R+n) only when all its normal derivatives vanish at the boundary. In this notation, C∞(R+n)=C∞(R+n), by the locally applied Schwartz extension proof in Lemma 3.2(c).
Lemma 3.1 (Supports in the closed half space). Let U∈S′(Rn) with suppU⊂R+n, and let φ∈S(Rn) vanish in R+n. Then U(φ)=0.
Proof. First, U(ψ)=0 whenever ψ∈S vanishes on a neighbourhood W of suppU: for ψ∈C0∞ this is the definition of the support, and in general ψθ(⋅/R)→ψ in S for a cutoff θ equal to 1 near 0, while each ψθ(⋅/R) vanishes on W. Now put φδ(x)=φ(x′,xn+δ). It vanishes on {xn>−δ}, a neighbourhood of R+n, so U(φδ)=0; and φδ→φ in S as δ→0. □
Restricted Schwartz functions
For v∈S(R+n) and multi-indices α,β put
qα,β(v)=x∈R+nsup∣xαDβv(x)∣.
Lemma 3.2 (Restricted Schwartz functions).
(a) Each qα,β is finite and continuous on S(R+n). For every continuous seminorm q on S(R+n) there are k and C with
q(v)≤C∣α∣+∣β∣≤2k∑qα,β(v).(3.1)
So the qα,β define the quotient topology.
(b) S(R+n) is a Fréchet space.
(c) A function w∈C∞(R+n) is the restriction of a Schwartz function if and only if every qα,β(w) is finite.
(d) If g∈S(R+n), k≥1, and ∂njg(x′,0)=0 for j<k, then g=xnkh with h∈S(R+n).
Proof. (a) For every extension V of v, qα,β(v)≤supRn∣xαDβV∣; so qα,β is bounded by a quotient seminorm, hence finite and continuous. Conversely let q be continuous, and let π be the restriction map. Then q∘π is a continuous seminorm on S(Rn), so there are k,C with q(πV)≤C∑∣α∣+∣β∣≤ksupRn∣xαDβV∣. Fix V∈S. Put V~=V on xn≥0 and
V~(x)=θ(xn)j≤k∑∂njV(x′,0)j!xnj(xn<0),
with θ∈C0∞(R) equal to 1 on (−1,1). The two pieces have the same derivatives of order ≤k on xn=0, so V~∈Ck(Rn). For ∣α∣+∣β∣≤k, supRn(1+∣x∣)∣α∣∣DβV~∣ is bounded by a constant times ∑∣α′∣+∣γ∣≤2kqα′,γ(πV): on xn≥0 this is clear, and on xn<0 the derivatives are combinations of derivatives of θ(xn)xnj (bounded, with support in a fixed interval) and of D′β′∂njV(x′,0), ∣β′∣+j≤2k, whose weighted suprema are limits from R+n. Now take ϕ∈C0∞(R−n) with ∫ϕ=1, ϕε(x)=ε−nϕ(x/ε), 0<ε≤1. Then V~∗ϕε∈S(Rn). For x∈R+n the convolution only uses values at x−y with (x−y)n>xn>0, so π(V~∗ϕε)=π(V∗ϕε). For ∣β∣≤k, Dβ(V~∗ϕε)=(DβV~)∗ϕε, and 1+∣x∣≤(1+R)(1+∣x−y∣) for y∈suppϕε⊂{∣y∣≤R}. Hence q(π(V∗ϕε))≤C′∑∣α∣+∣β∣≤2kqα,β(πV), uniformly in ε. Since V∗ϕε→V in S, (3.1) follows.
(b) The subspace {V∈S:V=0 in R+n} is closed, since point evaluations are continuous. The full quotient construction in Section 1.1 above proves this assertion.
(c) Necessity is clear. Conversely let every qα,β(w) be finite, let w0 be the zero extension of w, and let ϕε be as in (a). Then Wε=w0∗ϕε∈S(Rn), because w0 is bounded and rapidly decreasing and all derivatives fall on ϕε. If suppϕ⊂{yn≤−c}, then for x near a point of R+n the integral ∫w0(x−y)ϕε(y)dy only involves points with (x−y)n≥xn+cε, so we may differentiate under it: DβWε(x)=∫(Dβw)(x−y)ϕε(y)dy. By the mean value theorem along segments, which stay in R+n,
∣xα(DβWε−Dβw)(x)∣≤Cε∣α′∣≤∣α∣,∣γ∣=∣β∣+1∑qα′,γ(w)(x∈R+n).
So πWε→w in every qα,β. By (a) the family is Cauchy in S(R+n), by (b) it converges to some πW, and since q0,0 is continuous the limit agrees with w on R+n.
(d) On xn>1 put h=g/xnk. On 0≤xn<2 Taylor's formula with integral remainder and the vanishing jets give g=xnkh with h(x)=(k−1)!1∫01(1−θ)k−1(∂nkg)(x′,θxn)dθ. The two definitions agree for 1<xn<2. The second one is smooth up to xn=0, and both have finite weighted suprema of all derivatives (on xn≤2 the weights are controlled by 1+∣x′∣). So h∈S(R+n) by (c). □
4. Symbols, compressed quantization and lacunarity
The symbol class and its quantization
Definition 4.1 (The class S+m). For m∈R, S+m is the set of a∈C∞(R+n×Rn) such that for all multi-indices α,β and all integers ν≥0
pα,β,νm(a)=x∈R+n, ξ∈Rnsup(1+∣ξ∣)∣α∣−m(1+xn)ν∣a(β)(α)(x,ξ)∣<∞.(4.1)
These seminorms make S+m a Fréchet space: a sequence that is Cauchy for all of them converges locally uniformly with all derivatives, and the weighted bounds pass to the limit. We put S+−∞=⋂mS+m. The estimates are uniform in x′, with no decay in x′, and require rapid decay in xn.
Compression and quantization. For a∈S+m put
a♭(x,ξ)=a(x,ξ′,xnξn)(xn≥0),a♭(x,ξ)=0(xn<0),(4.2)
and, for u∈S(Rn),
Tau(x)=(2π)−n∫eix⋅ξa♭(x,ξ)u(ξ)dξ.(4.3)
Since 1+∣(ξ′,xnξn)∣≤(1+xn)(1+∣ξ∣), the compressed symbol grows at most polynomially and the integral converges absolutely. We always write the last variable of a as ξn; thus ∂ξna is the derivative of a in its last slot, (∂ξna)♭ its compression, and ∂ξn(a♭)=xn(∂ξna)♭. We also write ξna for the symbol (x,ξ)↦ξna(x,ξ); its compression is xnξna♭.
Two remarks explain the choice of class. First, away from the boundary Ta is an ordinary pseudodifferential operator. Indeed, for xn≥1 the compressed symbol obeys the ordinary estimates of Sm uniformly. Each ∂ξn of a♭ brings a factor xn, and each ∂xn brings (∂xna)♭ or ξn(∂ξna)♭, where ∣ξn∣≤(1+∣(ξ′,xnξn)∣)/xn. Moreover (1+∣ξ∣)≤1+∣(ξ′,xnξn)∣≤xn(1+∣ξ∣). So every derivative obeys the estimate of Sm up to powers of xn, and the rapid decay in xn absorbs every power of xn. Second, near xn=0 the compressed symbol is not a classical symbol: ∂ξna♭=xn(∂ξna)♭ gains no power of ⟨ξ⟩.
If P=∑∣α∣≤mcα(x)xnαnDα with cα∈Cb∞(R+n) vanishing for xn≥R, then P=Tp with p(x,ξ)=∑cα(x)ξα∈S+m: indeed p♭=∑cα(x)ξ′α′(xnξn)αn, and left quantization places functions of x on the left. So Proposition 2.1 suggests the definition.
The kernel. The compressed symbol is a polynomially bounded measurable function. So, by the explicit Fourier-kernel construction in Section 1.2, the operator Ta:S→S′ has the tempered kernel Ka(x,y)=(2π)−n∫ei(x−y)⋅ξa♭(x,ξ)dξ. For xn>0 the substitution ηn=xnξn suggests
Ka(x,y)=xn−1A(x,x′−y′,xnxn−yn),A(x,z)=(2π)−n∫eiz⋅ξa(x,ξ)dξ.(4.4)
For residual symbols this is an identity of functions (Theorem 6.2(b)). We want Tau to depend only on u∣R+n, that is, Ka(x,y)=0 for yn<0. With zn=(xn−yn)/xn, the condition yn<0 means zn>1. So A(x,⋅) should vanish on zn>1; this is a condition on the Fourier transform of a in its last variable.
Lacunary symbols
Definition 4.2 (Lacunary symbols). For a∈S+m and fixed (x,ξ′), the function ξn↦a(x,ξ′,ξn) is tempered; let Fna(x,ξ′,⋅) be its Fourier transform, a tempered distribution in the dual variable t (formally ∫e−itξnadξn). We call a lacunary if
suppFna(x,ξ′,⋅)⊂[−1,∞)for all (x,ξ′)∈R+n×Rn−1,(4.5)
that is, ∫a(x,ξ′,ξn)φ(ξn)dξn=0 for every φ∈C0∞((−∞,−1)). We call a strongly lacunary if these supports lie in [−21,1]. Slam denotes the lacunary elements of S+m and Sla−∞=⋂mSlam.
Each defining condition is a continuous linear functional on S+m, since ∣∫aφ∣≤p(a)∫(1+∣ξ′∣+∣ξn∣)∣m∣∣φ(ξn)∣dξn. So Slam is a closed subspace and a Fréchet space.
The following closure properties are used constantly. If a is lacunary (strongly lacunary), then so are ∂xβa, ∂ξ′γa, ∂ξna, ξγa, and c(x)a for c∈Cb∞(R+n). Indeed Fn commutes with operations in x and ξ′, turns ∂ξn into multiplication by it, and turns multiplication by ξn into i∂t; none of these enlarges the support.
Proposition 4.3 (Lacunarity is exactly the support condition). For a∈S+m the following are equivalent.
- a is lacunary.
- Tav=0 in R+n for every v∈S(Rn) that vanishes in R+n.
- Tav=0 in R+n for every v∈C0∞(R−n).
Proof. Fix x∈R+n and v∈S. Let w(ξ′,yn)=∫e−iy′⋅ξ′v(y′,yn)dy′, so that v(ξ′,ξn)=∫e−iynξnw(ξ′,yn)dyn. By Fubini,
Tav(x)=(2π)−n∫eix′⋅ξ′J(x,ξ′)dξ′,J(x,ξ′)=∫a(x,ξ′,xnξn)eixnξnv(ξ′,ξn)dξn.
Substitute ηn=xnξn, and write eixnξnv(ξ′,ξn)=∫e−i(yn−xn)ξnw(ξ′,yn)dyn. With s=(yn−xn)/xn one finds
J(x,ξ′)=xn−1∫a(x,ξ′,ηn)ϕx,ξ′(ηn)dηn,ϕx,ξ′(s)=xnw(ξ′,xn(1+s)).(4.6)
(1 ⇒ 2) If v=0 in R+n, then w(ξ′,yn)=0 for yn>0, so ϕ=ϕx,ξ′ vanishes for s>−1. The translates ϕδ(s)=ϕ(s+δ) vanish on (−1−δ,∞), a neighbourhood of [−1,∞), and ϕδ→ϕ in S(R). Hence ∫aϕdηn=⟨Fna,ϕ⟩=limδ→0⟨Fna,ϕδ⟩=0. So J=0 and Tav(x)=0.
(2 ⇒ 3) is trivial.
(3 ⇒ 1) Take v(y)=v1(y′)v2(yn) with v1∈C0∞(Rn−1) and v2∈C0∞((−∞,0)). Then w=v1(ξ′)v2(yn) and J(x,ξ′)=v1(ξ′)j(x,ξ′) with j(x,ξ′)=xn−1∫a(x,ξ′,ηn)ψx(ηn)dηn, ψx(s)=xnv2(xn(1+s)). For fixed x, the continuous polynomially bounded function ξ′↦eix′⋅ξ′j(x,ξ′) annihilates every v1, and these are dense in S(Rn−1); so j(x,⋅)=0. As v2 runs through C0∞((−∞,0)), ψx runs through all of C0∞((−∞,−1)). This proves (4.5) for xn>0, and continuity in x gives it at xn=0. □
Every symbol is lacunary up to a residual symbol
Lemma 4.4 (Lacunary modification of a symbol). Let ρ∈S(R) with ρ∈C0∞((−21,1)) and ρ=1 near 0. For a∈S+m put
aρ(x,ξ)=∫a(x,ξ′,ξn−t)ρ(t)dt.(4.7)
Then:
(a) a↦aρ is continuous S+m→S+m, and aρ is strongly lacunary, with suppFnaρ(x,ξ′,⋅)⊂suppρ.
(b) a−aρ∈S+−∞, and a↦a−aρ is continuous from S+m into every S+m′.
(c) If a is lacunary (strongly lacunary), so is a−aρ.
(d) The kernel of Taρ vanishes on the open set {xn>0, yn/xn∈/[21,2]}.
(e) The natural map Slam/Sla−∞→S+m/S+−∞ is bijective.
Proof. (a) By Peetre's inequality,
∣(aρ)(β)(α)(x,ξ)∣≤∫∣a(β)(α)(x,ξ′,ξn−t)∣∣ρ(t)∣dt≤p(a)(1+xn)−ν(1+∣ξ∣)m−∣α∣∫(1+∣t∣)∣m−∣α∣∣∣ρ(t)∣dt.
By the convolution theorem Fnaρ=ρFna, whose support lies in suppρ⊂(−21,1).
(b) Since ρ(τ)=∫e−iτtρ(t)dt equals 1 near 0, ∫ρ=1 and ∫tjρ(t)dt=0 for j≥1. Hence, for every N,
aρ(x,ξ)−a(x,ξ)=∫(a(x,ξ′,ξn−t)−j<N∑∂ξnja(x,ξ)j!(−t)j)ρ(t)dt.(4.8)
Where ∣t∣<(1+∣ξ∣)/2, Taylor's formula bounds the bracket by ∣t∣N/N! times the supremum of ∣∂ξnNa∣ on the segment from ξ to ξ−ten; there 1+∣ξ∣ and the norm of the point differ by a factor at most 2, so the bracket is at most CNp(a)∣t∣N(1+∣ξ∣)m−N(1+xn)−ν. Where ∣t∣≥(1+∣ξ∣)/2, each term of the bracket is at most Cp(a)(1+∣t∣)∣m∣+N(1+xn)−ν, and 1+∣ξ∣≤2(1+∣t∣) gives (1+∣t∣)∣m∣+N≤2N+∣m∣(1+∣ξ∣)m−N(1+∣t∣)2N+2∣m∣. Integrating against the rapidly decreasing ∣ρ∣ gives ∣aρ−a∣≤CNp(a)(1+∣ξ∣)m−N(1+xn)−ν for all N,ν. Derivatives commute with the convolution, so the same argument applied to a(β)(α)∈S+m−∣α∣ proves (b), with every seminorm controlled by finitely many seminorms of a.
(c) Fn(a−aρ)=(1−ρ)Fna has support inside that of Fna.
(d) Fix x with xn>0 and let v∈S vanish on the closed slab {y:xn/2≤yn≤2xn}. In (4.6) the function ϕx,ξ′ then vanishes on [−21,1], which is a neighbourhood of the compact set suppρ. Hence J=0 and Taρv(x)=0. If ψ∈C0∞ and v∈C0∞ have suppψ×suppv inside the open set of (d), this gives (Taρv,ψ)=0; such products span a dense set of test functions by the complete O0.1 argument identified in Section 1.2, which proves (d).
(e) The kernel of the map is Slam∩S+−∞=Sla−∞; surjectivity is (a)–(b). □
By (e), the lacunary condition only restricts the residual part of a symbol. It has no effect on principal symbols or asymptotic expansions.
5. Action on restricted Schwartz functions
Continuity, commutators and boundary jets
Theorem 5.1 (Action, commutators and boundary jets). Let a∈Slam.
(a) For u∈S(R+n) and any U∈S(Rn) equal to u in R+n, the restriction (TaU)∣R+n depends only on u; we call it Tau. It lies in S(R+n), and (a,u)↦Tau is a continuous bilinear map Slam×S(R+n)→S(R+n). More precisely, for every (α,β) there are a seminorm p of S+m and a continuous seminorm pˉ of S(R+n), depending only on α,β,m,n, with qα,β(Tau)≤p(a)pˉ(u).
(b) As operators on S(R+n), for j<n,
[Ta,Dj]=iT∂xja,[Ta,xj]=−iT∂ξja,
and for the normal direction
[Ta,Dn]=iT∂xna+iT∂ξnaDn,[Ta,xn]=−ixnT∂ξna.(5.1)
(c) For every integer k≥0 and u∈S(R+n),
Dnk(Tau)(x′,0)=j=0∑k(jk)akj(x′,D′)(Dnju(⋅,0))(x′),akj(x′,ξ′)=i=0∑j(ij)(Dxnk−jDξnia)(x′,0,ξ′,0).(5.2)
Here akj∈Sm(Rn−1×Rn−1), its i-th summand has order m−i, and akj(x′,D′) is the left quantization on Rn−1.
(d) If Dnju(⋅,0)=0 for j<k, then Dnj(Tau)(⋅,0)=0 for j<k. In particular Ta maps S˙(R+n) into itself.
The normal commutator has precisely the factor xn, as the full calculation and Example 5.2 below show.
Proof. (a) Let U∈S and, for x∈R+n, put W(x)=(2π)−n∫eix⋅ξa♭(x,ξ)U(ξ)dξ, so W=TaU in R+n. From (4.2), for xn≥0,
Dxj(eix⋅ξa♭)=eix⋅ξ(ξja♭+(Dxja)♭) (j<n),Dxn(eix⋅ξa♭)=eix⋅ξ(ξna♭+(Dxna)♭+ξn(Dξna)♭).(5.3)
By induction, Dxβ(eix⋅ξa♭)=eix⋅ξ∑γξγcγ♭, a finite sum with ∣γ∣≤∣β∣, where each cγ is a constant times some ∂xμ∂ξnia∈S+m−i. Since 1+∣(ξ′,xnξn)∣≤(1+xn)(1+∣ξ∣), each term is at most ∣ξ∣∣γ∣p(cγ)(1+xn)m+−ν(1+∣ξ∣)m+, m+=max(m,0), for any ν. For the weight x′α′ we integrate by parts in ξ′, using x′α′eix⋅ξ=Dξ′α′eix⋅ξ; ξ′-derivatives of cγ♭ are compressions of ξ′-derivatives and obey the same bounds. For the weight xnαn we take ν≥αn+m+. Thus
x∈R+nsup∣xαDβW(x)∣≤p(a)p′(U)
with p a seminorm of S+m and p′ a Schwartz seminorm. The same bounds justify differentiation under the integral, and the integrands are continuous up to xn=0; so W∈C∞(R+n), and W∣R+n∈S(R+n) by Lemma 3.2(c). By Proposition 4.3, W∣R+n depends only on U∣R+n. Taking the infimum over all extensions gives qα,β(Tau)≤p(a)pˉ′(u) with the quotient seminorm pˉ′, and Lemma 3.2(a) turns this into joint continuity.
(b) For U∈S and xn>0, differentiation under the integral gives DjTaU=Op(ξja♭+Dxj(a♭))U, while TaDjU=Op(a♭ξj)U. Hence [Ta,Dj]=−Op(Dxj(a♭))=iOp(∂xj(a♭)). For j<n, ∂xj(a♭)=(∂xja)♭. For j=n, ∂xn(a♭)=(∂xna)♭+ξn(∂ξna)♭, and Op(c♭ξn)=TcDn. Next, xjU=−DξjU; integrating by parts in ξj gives Ta(xjU)=(2π)−n∫Dξj(eix⋅ξa♭)Udξ=xjTaU+Op(Dξj(a♭))U, so [Ta,xj]=−iOp(∂ξj(a♭)). For j<n this is −iT∂ξja. For j=n, ∂ξn(a♭)=xn(∂ξna)♭, and the factor xn stands on the left. The symbols on the right are lacunary, so the identities pass to S(R+n).
(c) By (5.3), Dxnk(eix⋅ξa♭)=eix⋅ξ(ξn+Dxn)ka♭ for xn≥0. Regard a as a function of (x,ξ′,ζ), with ζ=xnξn in the last slot and ξn as a parameter. Then Dxn(a♭)=[(Dxn+ξnDζ)a]♭, and Dxn, ξnDζ commute; so Dxnℓ(a♭)=∑i(iℓ)ξni(Dxnℓ−iDζia)♭. At xn=0 (where ζ=0),
(ξn+Dxn)ka♭xn=0=ℓ∑(ℓk)ξnk−ℓi≤ℓ∑(iℓ)ξni(Dxnℓ−iDξnia)(x′,0,ξ′,0).
The power ξnj occurs for j=k−ℓ+i, and (k−j+ik)(ik−j+i)=(jk)(ij). So Dnk(TaU)(x′,0)=∑j(jk)(2π)−n∫eix′⋅ξ′akj(x′,ξ′)ξnjU(ξ)dξ, and (2π)−1∫ξnjU(ξ′,ξn)dξn is the Fourier transform in x′ of DnjU(⋅,0). This is (5.2). The symbol DξniDxnk−ja lies in S+m−i, and its restriction to xn=0,ξn=0 lies in Sm−i(Rn−1×Rn−1).
(d) This is read off from (5.2). If all jets of u vanish, those of Tau vanish too; the zero extension of Tau is then smooth, with all weighted derivatives bounded, hence in S˙(R+n). □
Formula (5.2) is the purpose of the construction: the normal derivatives of the output at the boundary are obtained by letting pseudodifferential operators on the boundary act on normal derivatives of the input of the same or lower order. Proposition 2.1(d) is the case k=0 for differential operators.
Example 5.2 (The factor xn in the normal commutator). Take θ∈C0∞(R) with θ=1 near 0, and a(x,ξ)=θ(xn)ξn. This symbol lies in Sla1, because its normal Fourier transform is supported at t=0. Here Ta=θ(xn)xnDn, and [Ta,xn]u=θ(xn)xnDn(xnu)−xnθ(xn)xnDnu=−iθ(xn)xnu, while T∂ξna=θ(xn). So [Ta,xn]=−ixnT∂ξna, as (5.1) says, and there is no term −iT∂ξna=−iθ(xn) without the factor xn.
Composition with totally characteristic derivatives
Composing Tc on the right with a totally characteristic differential operator gives again an operator of the class, with an exact formula for its symbol.
Lemma 5.3 (Composition with totally characteristic derivatives). For c∈Slaμ, on S(R+n),
TcDj=Tξjc (j<n),TcxnDn=Tξn(1−i∂ξn)c,TcDnxn=T(ξn−i−iξn∂ξn)c,(5.4)
and more generally
TcxnkDnkD′β′=Tξ′β′ξnk(1−i∂ξn)kc.(5.5)
Proof. For j<n, TcDj=Op(c♭ξj) and c♭ξj=(ξjc)♭. By (5.1), Tcxn=xnT(1−i∂ξn)c, so Tcxnk=xnkT(1−i∂ξn)kc. Moreover xnkTgDnk=Op(xnkξnkg♭)=Tξnkg, because xnkξnkg♭=(ξnkg)♭. Together these give (5.5) and the first two identities in (5.4). The third identity in (5.4) follows from Dnxn=xnDn−i. □