To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Pseudoconvexity

From Wikipedia, the free encyclopedia

In mathematics, more precisely in the theory of functions of several complex variables, a pseudoconvex set is a special type of open set in the n-dimensional complex space Cn. Pseudoconvex sets are important, as they allow for classification of domains of holomorphy.

Let

be a domain, that is, an open connected subset. One says that is pseudoconvex (or Hartogs pseudoconvex) if there exists a continuous plurisubharmonic function on such that the set

is a relatively compact subset of for all real numbers In other words, a domain is pseudoconvex if has a continuous plurisubharmonic exhaustion function. Every (geometrically) convex set is pseudoconvex. However, there are pseudoconvex domains which are not geometrically convex.

When has a (twice continuously differentiable) boundary, this notion is the same as Levi pseudoconvexity, which is easier to work with. More specifically, with a boundary, it can be shown that has a defining function, i.e., that there exists which is so that , and . Now, is pseudoconvex iff for every and in the complex tangent space at p, that is,

, we have

The definition above is analogous to definitions of convexity in Real Analysis.

If does not have a boundary, the following approximation result can be useful.

Proposition 1 If is pseudoconvex, then there exist bounded, strongly Levi pseudoconvex domains with (smooth) boundary which are relatively compact in , such that

This is because once we have a as in the definition we can actually find a C exhaustion function.

YouTube Encyclopedic

  • 1/5
    Views:
    1 049
    391
    400
    349
    1 916
  • Jacob Tsimerman - o-minimality and complex analysis
  • Mathematical Research Lecture -- Kyle Broder -- Curvature and Moduli
  • Miroslav Englis: Analytic continuation of Toeplitz operators
  • Bruno Iochum: Spectral triples and Toeplitz operators
  • Developments in Kaehler Geometry from Mostow's Strong Rigidity

Transcription

The case n = 1

In one complex dimension, every open domain is pseudoconvex. The concept of pseudoconvexity is thus more useful in dimensions higher than 1.

See also

References

  • Bremermann, H. J. (1956). "Complex Convexity". Transactions of the American Mathematical Society. 82 (1): 17–51. doi:10.1090/S0002-9947-1956-0079100-2. JSTOR 1992976.
  • Lars Hörmander, An Introduction to Complex Analysis in Several Variables, North-Holland, 1990. (ISBN 0-444-88446-7).
  • Steven G. Krantz. Function Theory of Several Complex Variables, AMS Chelsea Publishing, Providence, Rhode Island, 1992.
  • Siu, Yum-Tong (1978). "Pseudoconvexity and the problem of Levi". Bulletin of the American Mathematical Society. 84 (4): 481–513. doi:10.1090/S0002-9904-1978-14483-8. MR 0477104.
  • Catlin, David (1983). "Necessary Conditions for Subellipticity of the -Neumann Problem". Annals of Mathematics. 117 (1): 147–171. doi:10.2307/2006974. JSTOR 2006974.
  • Zimmer, Andrew (2019). "Characterizing strong pseudoconvexity, obstructions to biholomorphisms, and Lyapunov exponents". Mathematische Annalen. 374 (3–4): 1811–1844. arXiv:1703.01511. doi:10.1007/s00208-018-1715-7. S2CID 253714537.
  • Fornæss, John; Wold, Erlend (2018). "A non-strictly pseudoconvex domain for which the squeezing function tends to 1 towards the boundary". Pacific Journal of Mathematics. 297: 79–86. arXiv:1611.04464. doi:10.2140/pjm.2018.297.79. S2CID 119149200.

This article incorporates material from Pseudoconvex on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.

External links

This page was last edited on 23 June 2023, at 07:42
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.