Lagrangian intersection and the Cauchy problem. (English) Zbl 0396.58006

A symbolic calculus for distributions associated to a pair of Lagrangian manifolds intersecting cleanly with codimension one is developed and applied to give a purely symbolic construction of global parametrices for pseudodifferential operators of real principal type on a pseudoconvex manifold. A calculus of distributions associated to a more complicated arrangement of Lagrangians is used to get global parametrices for pseudodifferential operators with double involutive characteristics under the Levi condition. The Cauchy problem for weakly hyperbolic operators of this type is solved using such parametrices.
Reviewer: R. B. Melrose


58J40 Pseudodifferential and Fourier integral operators on manifolds
58J45 Hyperbolic equations on manifolds
35S05 Pseudodifferential operators as generalizations of partial differential operators
47G30 Pseudodifferential operators
Full Text: DOI


[1] Chazarain, Ann. Inst. Fourier 24 pp 173– (1974) · Zbl 0274.35045
[2] Duistermaat, Acta Math. 128 pp 183– (1972)
[3] Singular symbols, manuscript.
[4] and , Geometric Asymptotics, Mathematical Surveys No. 14, Amer. Math. Soc., Providence, R.I. 1977.
[5] Guillemin, Advances in Math.
[6] Hörmander, Acta Math. 127 pp 89– (1971)
[7] Hörmander, Journal d’Analyse, Math. 32 pp 118– (1978)
[8] Spectral analysis of singularities, Seminar in Linear Differential Equations, 1977, IAS.
[9] Ivrii, Russian Math. Surveys 5 pp 1– (1974)
[10] Hyperbolic Differential Equations, Institute for Advanced Study, Princeton, 1952.
[11] Melrose, Inventiones Math. 37 pp 165– (1976)
[12] Boundary value problems of principal type, Seminar in Linear Differential Equations, 1977, IAS.
[13] Uhlmann, Comm. in P.D.E. 2 pp 713– (1977)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.