In
mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, more precisely in the theory of functions of
several complex variables, a pseudoconvex set is a special type of
open set
In mathematics, an open set is a generalization of an Interval (mathematics)#Definitions_and_terminology, open interval in the real line.
In a metric space (a Set (mathematics), set with a metric (mathematics), distance defined between every two ...
in the ''n''-dimensional complex space C
''n''. Pseudoconvex sets are important, as they allow for classification of
domains of holomorphy.
Let
:
be a domain, that is, an
open
Open or OPEN may refer to:
Music
* Open (band), Australian pop/rock band
* The Open (band), English indie rock band
* ''Open'' (Blues Image album), 1969
* ''Open'' (Gerd Dudek, Buschi Niebergall, and Edward Vesala album), 1979
* ''Open'' (Go ...
connected subset
In mathematics, a Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they a ...
. 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 number
In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
s
In other words, a domain is pseudoconvex if
has a continuous plurisubharmonic
exhaustion function. Every (geometrically)
convex set
In geometry, a set of points is convex if it contains every line segment between two points in the set.
For example, a solid cube (geometry), cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is n ...
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.
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
*
Analytic polyhedron
*
Eugenio Elia Levi
*
Holomorphically convex hull
*
Stein manifold
References
*
*
Lars Hörmander, ''An Introduction to Complex Analysis in Several Variables'', North-Holland, 1990. ().
* Steven G. Krantz. ''Function Theory of Several Complex Variables'', AMS Chelsea Publishing, Providence, Rhode Island, 1992.
*
*
*
*
External links
*
*
{{Convex analysis and variational analysis
Several complex variables