Solving the Gleason problem on linearly convex domains (Q1849430): Difference between revisions

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.