Terao’s Freeness Conjecture
OPENMajorConjectureProposed 1983 · Standard version
Canonical statement
Let be a finite central hyperplane arrangement in a finite-dimensional complex vector space . For each , choose with , and define the module of logarithmic derivations
Call free when is a free -module, and let
be its intersection lattice, ordered by reverse inclusion. If two such arrangements and have isomorphic intersection lattices, then is free if and only if is free.
View source LaTeX
Let \(\mathcal A\) be a finite central hyperplane arrangement in a finite-dimensional complex vector space \(V\). For each \(H\in\mathcal A\), choose \(\alpha_H\in V^*\) with \(H=\ker\alpha_H\), and define the module of logarithmic derivations
\[
D(\mathcal A)=\{\theta\in\operatorname{Der}_{\mathbb C}\mathbb C[V]:
\theta(\alpha_H)\in\alpha_H\mathbb C[V]
\text{ for every }H\in\mathcal A\}.
\]
Call \(\mathcal A\) free when \(D(\mathcal A)\) is a free \(\mathbb C[V]\)-module, and let
\[
L(\mathcal A)=\left\{\bigcap_{H\in S}H:S\subseteq\mathcal A\right\}
\]
be its intersection lattice, ordered by reverse inclusion. If two such arrangements \(\mathcal A\) and \(\mathcal A'\) have isomorphic intersection lattices, then \(\mathcal A\) is free if and only if \(\mathcal A'\) is free.Notes
Freeness is combinatorial for many classes of arrangements, and addition–deletion and characteristic-polynomial criteria settle extensive families. In characteristic zero, no proof or counterexample is known for arbitrary arrangements with the same intersection lattice.
Counterexamples exist over fields of positive characteristic. This record fixes the classical characteristic-zero form over .
References (3)
- [Terao1983Exponents]
The exponents of a free hypersurface
Open ↗Hiroaki Terao · 1983 · misc
- [OrlikTerao1992Arrangements]
Arrangements of Hyperplanes
Open ↗Peter Orlik and Hiroaki Terao · 1992 · misc
- [Yoshinaga2014Freeness]
Freeness of hyperplane arrangements and related topics
Open ↗Masahiko Yoshinaga · 2014 · misc
The boxed statement is the canonical open formulation — not a stronger variant or a related research program. The status reflects the catalog's last review; do your own literature search before investing serious effort.