A Miyaoka-Yau inequality for hyperplane arrangements in CPn
Abstract
Let H be a hyperplane arrangement in CPn. We define a quadratic form Q on RH that is entirely determined by the intersection poset of H. Using the Bogomolov-Gieseker inequality for parabolic bundles, we show that if a ∈ RH is such that the weighted arrangement (H, a) is stable, then Q(a) ≤ 0. As an application, we consider the symmetric case where all the weights are equal. The inequality Q(a, …, a) ≤ 0 gives a lower bound for the total sum of multiplicities of codimension 2 intersection subspaces of H. The lower bound is attained when every H ∈ H intersects all the other members of H \H\ along (1-2/(n+1))|H| + 1 codimension 2 subspaces; extending from n=2 to higher dimensions a condition found by Hirzebruch for line arrangements in the complex projective plane.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.