Analytic polyhedron

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

In mathematics, especially several complex variables, an analytic polyhedron is a subset of the complex space Cn of the form

\{ z \in D : |f_j(z)| < 1, 1 \le j \le N \}\,

where D is a bounded connected open subset of Cn and f_j are holomorphic on D.[1] If f_j above are polynomials, then the set is called a polynomial polyhedron. Every analytic polyhedron is a domain of holomorphy and it is thus pseudo-convex.

The boundary of an analytic polyhedron is the union of the set of hypersurfaces

 \sigma_j = \{ z \in D : |f_j(z)| = 1 \}, 1 \le j \le N.

An analytic polyhedron is a Weil polyhedron, or Weil domain if the intersection of k hypersurfaces has dimension no greater than 2n-k.[2]

See also

Notes

<templatestyles src="Reflist/styles.css" />

Cite error: Invalid <references> tag; parameter "group" is allowed only.

Use <references />, or <references group="..." />

References

  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found. (also available as ISBN 0-387-17004-9).
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found.. Notes from a course held by Francesco Severi at the Istituto Nazionale di Alta Matematica (which at present bears his name), containing appendices of Enzo Martinelli, Giovanni Battista Rizza and Mario Benedicty. An English translation of the title reads as:-"Lectures on analytic functions of several complex variables – Lectured in 1956–57 at the Istituto Nazionale di Alta Matematica in Rome".

<templatestyles src="Asbox/styles.css"></templatestyles>

  1. See (Åhag et al. 2007, p. 139) and (Khenkin 1990, p. 35).
  2. (Khenkin 1990, pp. 35-36).