Solving the Gleason problem on linearly convex domains (Q1849430): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2154390589 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0106235 / rank | |||
Normal rank |
Latest revision as of 23:23, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving the Gleason problem on linearly convex domains |
scientific article |
Statements
Solving the Gleason problem on linearly convex domains (English)
0 references
1 December 2002
0 references
Let \(\Omega\) be a bounded linearly convex domain in \(\mathbb{C}^n\) with \(C^{1+\varepsilon}\) boundary. The authors solve the Gleason problem for \(H^\infty(\Omega)\). That is, they prove that the maximal ideal in \(H^\infty(\Omega)\) consisting of all functions vanishing at \(p\in \Omega\) is generated by the coordinate functions \(z_j-p_j\), \(j=1, \dots, n\). They also use the same method to solve the Gleason problem for \(A^m(\Omega):=H^\infty(\Omega)\cap C^m(\Omega)\), \(0\leq m\leq\infty\). In the course of the proofs, the authors adapt the original method of Leibenson [\textit{G. M. Khenkin}, Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 19, 37-42 (1971; Zbl 0214.33701)] who was the first to solve a non-trivial Gleason problem.
0 references
Gleason problem
0 references
linearly convex domains
0 references