An almost complexe Bloch's theorem

From MaRDI portal



Abstract: We proove a Bloch's theorem in an almost complex projective plane.


The aim of this article is the proof of the following almost complex version of the Bloch theorem: Let \(L_1,L_2,L_3,L_4\) be four lines in general position in the almost complex projectif plane \(({\mathbb P}^2({\mathbb C}),J)\). This means that the configuration \(C=L_1\cup L_2\cup L_3\cup L_4\) does not have a third point. Denote by \(\Delta\) the union of the three diagonals of the configuration \(C\). Then, any sequence of \(J\)-disks \(f_n : {\mathbb D}\longrightarrow{\mathbb P}^2({\mathbb C})\smallsetminus C\) is either normal, or, for all \(r\in]0,1[\), it has a subsequence \((f_{n_p})\) such that for every neighborhood \(U\) of \(\Delta\), there exists an integer \(p_0\) such that \(f_{n_p}(D(0,r))\subset U\) for all \(p\geq p_0\). When \(J\) is the standard structure, the author recovers the Bloch theorem proved partially by Bloch in 1926 and definitely established by Cartan in 1928.











This page was built for publication: An almost complexe Bloch's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486758)