On polynomial generators in the algebra of complex functions on a compact space (Q1078376): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.2140/pjm.1986.121.83 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2009558124 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:30, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On polynomial generators in the algebra of complex functions on a compact space |
scientific article |
Statements
On polynomial generators in the algebra of complex functions on a compact space (English)
0 references
1986
0 references
The author proves the following Theorem. Let 3k\(\leq 2n\). In the space \(Map(X^ k,{\mathbb{C}}^ n)\) of all continuous mappings of a k-dimensional compact space \(X^ k\) into the complex linear space \({\mathbb{C}}^ n\) consider the mappings \(F: X^ k\to {\mathbb{C}}^ n\) satisfying the following properties: 1) F is an imbedding; 2) any continuous function on \(X^ k\) may be approximated by complex polynomials in the multiplicative generators \(f_ 1=z_ 1\circ F,...,f_ n=z_ n\circ F\), where \(z_ 1,...,z_ n\) are the complex coordinate functions on \({\mathbb{C}}^ n\); 3) in particular, \(F(X^ k)\) is polynomially convex in \({\mathbb{C}}^ n\). These mappings form a dense subset of type \(G_{\delta}\) in \(Map(X^ k,{\mathbb{C}}^ n).\) In particular, for 2-dimensional compact spaces \(X^ 2\) one has the following result: There are three multiplicative generators in the algebra \(C(X^ 2)\); in fact, starting with any \(f_ 1,f_ 2,f_ 3\in C(X^ 2)\) one can perturb them by an arbitrarily small amount to get multiplicative generators for \(C(X^ 2).\) The main step in the proof of the theorem is the next lemma, where the author shows that given a totally real and perfectly generic family \({\mathcal L}\) of real affine subspaces of \({\mathbb{C}}^ n\), dim \({\mathcal L}<n\), and any compact subset \(K\subset | {\mathcal L}| =\cup_{\alpha \in {\mathcal L}}V_{\alpha}\), then any continuous complex function on K may be uniformly approximated by complex polynomials in the coordinate functions \(z_ 1,...,z_ n\) on \({\mathbb{C}}^ n.\) The only place where the author must use the dimensional restriction dim \(X\leq \frac{2}{3}n\) is Lemma 3 which says that for dim \({\mathcal L}\leq \frac{2}{3}n\), then \({\mathcal L}\) totally real and generic implies that \({\mathcal L}\) is perfectly generic.
0 references
totally real and perfectly generic families of affine subspaces
0 references
polynomial approximation
0 references
continuous mappings
0 references
k-dimensional compact space
0 references
imbedding
0 references
multiplicative generators
0 references
polynomially convex
0 references