Deletion theorem and combinatorics of hyperplane arrangements (Q1741830)

In this interesting paper the author shows that the deletion theorem of a free arrangement is combinatorial in its nature. In order to explain this slogan, let us recall basic definitions. A hyperplane arrangement \(\mathcal{A}\) is a finite set of linear hyperplanes in \(V = \mathbb{K}^{\ell}\). Let \(S = \mathbb{K}[x_{1}, \dots, x_{\ell}]\) and \(\mathrm{Der}(S) = \sum_{i=1}^{\ell} S\partial_{x_{i}}.\) The logarithmic vector field of \(D(\mathcal{A})\) of \(\mathcal{A}\) is defined as \[ D(\mathcal{A}) = \big\{\theta \in D(\mathcal{A}) \, | \, \theta(\alpha_{H}) \in S\alpha_{H}, \, \forall \, H \in \mathcal{A} \big\}, \] where \(\alpha_{H}\) is a defining linear form for each \(H \in \mathcal{A}\). We say that \(\mathcal{A}\) is free if \(D(\mathcal{A})\) is a free \(S\)-module of rank \(\ell\). Denote by \(L(\mathcal{A})\) the intersection lattice of \(\mathcal{A}\), for \(X \in L(\mathcal{A})\) we define the localization \(\mathcal{A}_{X} = \{H \in \mathcal{A} : X \subseteq H\}\) and the restriction \(\mathcal{A}^{X} = \{ H \cap X : H \in \mathcal{A} \setminus \mathcal{A}_{X}\}\). For \(H \in \mathcal{A}\) and \(X \in L(\mathcal{A})\) we use the following convention: \(\mathcal{A}_{X}^{H}\) means \((\mathcal{A}_{X})^H\). Finally, for an arrangement \(\mathcal{A}\) we denote by \(\chi(\mathcal{A};t)\) its characteristic polynomial. Main Result. Let \(\mathcal{A}\) be a free arrangement and \(H \in \mathcal{A}\). Then \(\mathcal{A}' := A \setminus \{H\}\) is free if and only if \(\chi(\mathcal{A}_{X}^{H};t)\) divides \(\chi(\mathcal{A}_{X};t)\) for all \(X \in L(\mathcal{A}^{H})\). Corollary A. Assume that \(\mathcal{A}\) is free and take \(H \in \mathcal{A}\). Then the freeness of \(\mathcal{A}\setminus \{H\}\) depends only on \(L(\mathcal{A})\). We say that an arrangement \(\mathcal{A}\) has a free filtration \[ \emptyset = \mathcal{A}_{0} \subset \dots \subset \mathcal{A}_{n} = \mathcal{A} \] if \(\{\mathcal{A}_{i}\}\) satisfies \(|\mathcal{A}_{i}| = i\) and \(\mathcal{A}_{i}\) is free for all \(i\). Corollary B. For a free arrangement \(\mathcal{A}\), whether it has a free filtration depends only on \(L(\mathcal{A})\).