×

zbMATH — the first resource for mathematics

CR singularities of real threefolds in \(\mathbb C^4\). (English) Zbl 1120.32024
The author first classifies the defining functions of 3-dimensional real analytic submanifolds in \(\mathbb C^4\), up to third order terms. Excluding the trivial totally real case, there are 13 types of quadratic terms. The author then finds normal forms under a formal change of coordinates for two types of quadratic terms.
More precisely, if \(M\subset\mathbb C^4\) is a graph over the \((z_1,x_2,x_3)\)-subspace of the form \(y_2=O(3), z_3=\overline z_1^2+O(3)\), and \( z_4=(z_1+x_2)\overline z_1+O(3)\), then the normal form of \(M\) under formal holomorphic transformation is defined by \(y_2=z_3-z_1^2=z_4-(z_1+x_2)\overline z_1=0\). If \(N\subset\mathbb C^4\) is defined by \(y_2=O(3), z_3=\overline z_1^2+O(3)\) and \(z_4=z_1\overline z_1+O(3)\), then the normal form of \(N\) under a formal transformation is defined by \(y_2=z_3-\overline z_1^2=z_4-z_1\overline z_1=0\), or by \(y_2=z_3-\overline z_1^2=z_4-z_1\overline z_1-\overline z_1x_2^k=0\) with \(k\geq 2\).
The author conjectures that the normal form of \(M\) can be achieved by a convergent transformation.

MSC:
32V40 Real submanifolds in complex manifolds
32S05 Local complex singularities
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Baouendi M. S., S.) 37 pp 309– (2000)
[2] Beloshapka V. K., Mat. Zametki 61 pp 931– (1997)
[3] DOI: 10.1215/S0012-7094-65-03201-1 · Zbl 0154.08501
[4] Co{\currency}man A., Houston J. Math. 30 pp 969– (2004)
[5] Harris G. A., Illinois J. Math. 25 pp 147– (1981)
[6] DOI: 10.2307/2000447 · Zbl 0574.32029
[7] Moser J., Ann. Acad. Sci. Fenn. Ser. A I Math. 10 pp 397– (1985)
[8] DOI: 10.1007/BF02567410 · Zbl 0566.32015
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.