English

A Miyaoka-Yau inequality for hyperplane arrangements in $\mathbb{CP}^n$

Algebraic Geometry 2026-03-19 v3 Combinatorics Differential Geometry Symplectic Geometry

Abstract

Let H\mathcal{H} be a hyperplane arrangement in CPn\mathbb{CP}^n. We define a quadratic form QQ on RH\mathbb{R}^{\mathcal{H}} that is entirely determined by the intersection poset of H\mathcal{H}. Using the Bogomolov-Gieseker inequality for parabolic bundles, we show that if aRH\mathbf{a} \in \mathbb{R}^{\mathcal{H}} is such that the weighted arrangement (H,a)(\mathcal{H}, \mathbf{a}) is stable, then Q(a)0Q(\mathbf{a}) \leq 0. As an application, we consider the symmetric case where all the weights are equal. The inequality Q(a,,a)0Q(a, \ldots, a) \leq 0 gives a lower bound for the total sum of multiplicities of codimension 22 intersection subspaces of H\mathcal{H}. The lower bound is attained when every HHH \in \mathcal{H} intersects all the other members of H{H}\mathcal{H} \setminus \{H\} along (12/(n+1))H+1(1-2/(n+1))|\mathcal{H}| + 1 codimension 22 subspaces; extending from n=2n=2 to higher dimensions a condition found by Hirzebruch for line arrangements in the complex projective plane.

Keywords

Cite

@article{arxiv.2411.09573,
  title  = {A Miyaoka-Yau inequality for hyperplane arrangements in $\mathbb{CP}^n$},
  author = {Martin de Borbon and Dmitri Panov},
  journal= {arXiv preprint arXiv:2411.09573},
  year   = {2026}
}

Comments

120 pages. Accepted for publication in J. Lon. Math. Soc