Skip to main content

Proof of Theorem 1.1

  • Chapter
  • First Online:
Boundary Value Problems and Markov Processes

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1499))

  • 1239 Accesses

Abstract

This chapter is devoted to the proof of Theorem 1.1. The idea of our proof is stated as follows. First, we reduce the study of the boundary value problem

$$ \left\{ \begin{array}{l} ({\rm A - }\lambda {\rm )u = f }\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,{\rm in D, } \\ {\rm Lu = }\mu {\rm (x')}\frac{{\partial {\rm u}}}{{\partial {\rm n}}} + \Upsilon (x')u = \varphi \,on\,\partial D \\ \end{array} \right. $$
(1.1)

to that of a first-order pseudo-differential operator T(λ) = LP(λ) on the boundary ∂D, just as in Section 4.3. Then we prove that conditions (A) and (B) are sufficient for the validity of the a priori estimate

$$\parallel u\parallel _{2,p} \le C(\lambda )(\parallel f\parallel _p + |\varphi| _{2 - 1/p,p} + \parallel u\parallel _p ).$$
(1.2)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kazuaki Taira .

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Taira, K. (2009). Proof of Theorem 1.1. In: Boundary Value Problems and Markov Processes. Lecture Notes in Mathematics(), vol 1499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01677-6_5

Download citation

Publish with us

Policies and ethics