Combinatorially equivalent hyperplane arrangements
Elisa Palezzato, Michele Torielli

TL;DR
This paper investigates the combinatorial properties of hyperplane arrangements over various fields, establishing conditions for lattice isomorphisms via Gr"obner bases and linking Terao's conjecture over finite fields to the rational case.
Contribution
It introduces a criterion for when arrangements and their reductions have isomorphic lattices and connects Terao's conjecture over finite fields with the conjecture over the rationals.
Findings
Determines when arrangements and their reductions modulo primes have isomorphic lattices.
Proves that Terao's conjecture over finite fields implies the conjecture over the rationals.
Abstract
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong -Gr\"obner bases. Moreover, we prove that the Terao's conjecture over finite fields implies the conjecture over the rationals.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Combinatorially equivalent hyperplane arrangements
Elisa Palezzato
Elisa Palezzato, Department of Mathematics, Hokkaido University, Kita 10, Nishi 8, Kita-Ku, Sapporo 060-0810, Japan.
and
Michele Torielli
Michele Torielli, Department of Mathematics, GI-CoRE GSB, Hokkaido University, Kita 10, Nishi 8, Kita-Ku, Sapporo 060-0810, Japan.
Abstract.
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong -Gröbner bases. Moreover, we prove that the Terao’s conjecture over finite fields implies the conjecture over the rationals.
1. Introduction
Let be a vector space of dimension over a field . Fix a system of coordinates of . We denote by the symmetric algebra of . A hyperplane arrangement is a finite collection of hyperplanes in . For a thorough treatment of the theory of hyperplane arrangements and recent developments, see [13], [16], [10] and [17].
The lattice of intersections is a fundamental combinatorial invariant of an arrangement . In fact one of the most studied topics in the theory of arrangements is to identify which topological and algebraic invariants of an arrangement are determined by its lattice of intersections.
To pursue this type of questions, Athanasiadis ([3], [4] and [5]), inspired by [9] and [8], initiated and systematically applied the “finite field method”, i.e. the study of the combinatorics of arrangements and their reduction modulo prime numbers. See also [7] for related work. After its introduction, this method has been used by several authors ([11], [12], [2] and [15]) to solve similar problems. The purpose of this paper is to study the combinatorics of arrangements over arbitrary fields and determine in which situation an arrangement and its reduction modulo a prime have isomorphic lattices.
The paper is organized as follows. In Section 2, we recall the basic notions on hyperplane arrangements. In Section 3, we describe how to characterize when two arrangements are combinatorially equivalent. In Section 4, we use the results of Section 3 to describe the primes for which and are combinatorially equivalent. In Section 5, we show that the knowledge of Terao’s conjecture in finite characteristic implies the conjecture over the rationals. In Section 6, we describe a method to compute good primes via minimal strong -Gröbner bases. In Section 7, we show that computing the good and -lucky primes for an arrangement is equivalent to compute all the primes that divide its -period (as defined in [12]).
2. Preliminaries
Let be a field. A finite set of affine hyperplanes in is called a hyperplane arrangement. For each hyperplane we fix a polynomial such that , and let . An arrangement is called central if each contains the origin of . In this case, each is a linear homogeneous polynomial, and hence is homogeneous of degree .
Define the lattice of intersections of by
[TABLE]
where if , we identify with . We endow with a partial order defined by if and only if , for all . Note that this is the reverse inclusion. Define a rank function on by . Moreover, we define . plays a fundamental role in the study of hyperplane arrangements, in fact it determines the combinatorics of the arrangement. Let
[TABLE]
we call essential if .
Let be the Möbius function of defined by
[TABLE]
The characteristic polynomial of is
[TABLE]
Given an arrangement in , the operation of coning allows to transform into a central arrangement in . The hyperplane corresponds to the hyperplane at infinity of . Moreover, denotes the projectivization of , which is an arrangement induced by in the projective space . We will say that is essential if .
Associated to each hyperplane arrangement , it can be naturally defined its Tutte polynomial
[TABLE]
As shown in [2], it turns out that the Tutte polynomial and the characteristic polynomial are related by
[TABLE]
It is sometimes useful to consider a simple transformation of the Tutte polynomial. The coboundary polynomial of is
[TABLE]
It is easy to check that
[TABLE]
and
[TABLE]
3. Combinatorial equivalence
The results in this section are a generalization of certain ones from [20]. Fix a pair with and . Let be the set of affine arrangements of distinct linearly ordered hyperplanes in . In other words, each element of is a collection , where are distinct affine hyperplanes in .
Definition 3.1**.**
Given , define
[TABLE]
where and .
The space allows us to check if and are essential.
Lemma 3.2**.**
Given , the following conditions are equivalent
- (1)
* is essential.* 2. (2)
* is essential.* 3. (3)
.
Proof.
We start by proving that (3) is equivalent to (2). If (3) is satisfied, then there exists such that , and hence is essential. On the other hand, if is essential then there exist hyperplanes in whose intersection is empty. This shows that the conditions (2) and (3) are equivalent.
We will now prove that (1) is equivalent to (3). Condition (3) is equivalent to the existence of such that . This happens if and only if there exist hyperplanes such that if and only if there exist hyperplanes such that is a point. This last fact is equivalent to (1). ∎
Let and be two fields (non necessarily distinct), and consider , for , two hyperplane arrangements.
Definition 3.3**.**
* and are combinatorially equivalent if*
[TABLE]
for all and , where the dimension of the empty set is equal to . In this case, we write .
The following result is a generalization of [20, Proposition 3].
Theorem 3.4**.**
Let be an essential arrangement in . Then determines , and vice versa.
Proof.
Consider . Since is essential, then if and only if there exist such that . Passing to the projectivization, this is equivalent to the existence of such that . This fact is then equivalent to the existence of such that . From the knowledge of which have , we can easily reconstruct . This shows that determines .
Consider . If , then . Moreover, is a point Suppose now that and let . We have and and is essential. By Lemma 3.2, this is equivalent to and is essential. This fact is then equivalent to and there exist hyperplanes in whose intersection is a point and hence it is zero dimensional. This shows that determines . ∎
4. Modular case
From now on we will assume that is a central and essential arrangement in . After clearing denominators, we can suppose that for all , and hence that . Moreover, we can also assume that there exists no prime number that divides any .
Let be a prime number, and consider the canonical homomorphism
[TABLE]
Since is central and we assume that there exists no prime number that divides any , this implies that is a non-zero linear homogeneous polynomial, for all . Since we are interested in the case when and its reduction modulo are both arrangements with the same number of hyperplanes, we call good for if is reduced. Clearly, this is equivalent to the requirement that and are not one multiple of the other, for all . Notice that the number of primes that are non-good for is finite, see [15].
Let now be a good prime for . Consider the arrangement in defined by and define . Hence, by construction, and . Moreover, since is central, also is central.
Definition 4.1**.**
Given , define
[TABLE]
Remark 4.2**.**
* is essential if and only if .*
Lemma 4.3**.**
The following facts are equivalent
- (1)
. 2. (2)
.
Proof.
If (1) is satisfied, since is essential, then by Lemma 3.2, also is essential. Similarly, if (2) is satisfied, then by Remark 4.2, also is essential.
Since both and are central, then for all , we have that . Now if and only if is a point. This is equivalent to and hence to . A similar proof shows that if and only if . Putting these three properties together we get our result. ∎
Since the goal of this section is to determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong -Gröbner bases, we will now recall some properties of ideals in .
Let be an ideal of and a term ordering. Given , we define the leading term of as , the leading coefficient of as the coefficient multiplying the in the writing of and we denote it by , and the leading monomial of as .
Definition 4.4**.**
Let be an ideal of , a term ordering and a set of non-zero polynomials in . We say that is a minimal strong -Gröbner basis for if the following conditions hold true
- (1)
* forms a set of generators of ;* 2. (2)
for each , there exists such that divides ; 3. (3)
if , then does not divide .
Remark 4.5** (c.f. [1], Lemma 4.5.8).**
The reduced -Gröbner basis of an ideal of is also a minimal strong -Gröbner basis of . Moreover, every minimal strong -Gröbner basis of is also a -Gröbner basis.
Proposition 4.6** ([1], Exercise 4.5.9).**
Let be a non-zero ideal of and a term ordering. Then there always exists a minimal strong -Gröbner basis of .
Lemma 4.7** ([15, Lemma 5.9]).**
Let be an ideal of , and a term ordering. Let and be two minimal strong -Gröbner bases of . Then . Consequently, we have and .
Remark 4.8**.**
The previous lemma implies that generates the monomial ideal , for any minimal strong -Gröbner basis of .
By Lemma 4.7, we can introduce the following definition. See [15] and [14], for more details.
Definition 4.9**.**
Let be an ideal of , and be a term ordering. If a prime number does not divide the leading coefficient of any polynomial in a minimal strong -Gröbner basis for , then we will say is -lucky for .
In other words, is -lucky for if and only if it is a non-zero divisor in .
Remark 4.10**.**
Given an ideal of and a term ordering, since a minimal strong -Gröbner basis is finite, then the number of primes that are not -lucky for is finite.
Now that we have all the tools to work with minimal strong -Gröbner basis, we can use them to study the combinatorics of arrangements.
Proposition 4.11**.**
Consider and a good prime for that is -lucky for the ideal . Then the following fact are equivalent
- (1)
. 2. (2)
.
Proof.
Consider the ideal and the ideal .
If , then is the origin, and hence . This implies that for each , there exists of degree such that . Since is an ideal in , we can transform the in such way that . This gives us that . Since is central, then is a homogenous ideal such that . This shows that and hence .
To show the opposite inclusion, assume that . This implies that is the origin, and hence is zero dimensional and . Since is a homogenous ideal generated in degree , . Consider now a minimal strong -Gröbner basis for . Since is zero-dimensional, then , where . Since we have , for some , then . Moreover, since is -lucky for , then and . This implies that for each , there exists such that . This shows that and hence . This implies that . ∎
As described in Proposition 4.11, we are interested in -lucky primes for certain ideals over the integers. This fact motivates the following definition.
Definition 4.12**.**
Consider an integer . A prime number is called -lucky for , if it is -lucky for all the ideals of the form , where .
Remark 4.13**.**
A prime number is -lucky for , if it is -lucky for all the ideals of the form , for .
We can now state the main result of the section.
Theorem 4.14**.**
Let be a central and essential arrangement in . The following facts are equivalent
- (1)
* is a good and -lucky prime number for .* 2. (2)
, i.e. and are combinatorially equivalent.
Proof.
Assume that is a good and -lucky prime number for . Since is -lucky for , by Proposition 4.11, . By Lemma 4.3, this implies that . We can then conclude that by Theorem 3.4.
Vice versa, assume now that . This clearly implies that and are both (simple) arrangements with . This then forces to be good for . Suppose that is not -lucky for . This implies that there exists such that divides a leading coefficient in a minimal strong -Gröbner basis of . Since , we can consider a minimal strong -Gröbner basis for such that , where for all . Consider . Since and , then and hence . In particular, , and hence there exists such that . Since does not divide with , there exist such that with for some . Clearly, does not divide and hence does not divide but this is impossible since is a minimal strong -Gröbner basis for . ∎
By the discussion at the beginning of Section 4 and Remark 4.10, the set of prime numbers that are good and -lucky for is infinite. This implies that Theorem 4.14 is a generalization of [19, Proposition 3.11.9], since our result describes explicitly how to compute the prime numbers for which and are not combinatorially equivalent.
Since the characteristic polynomial of an arrangement is determined by its lattice of intersections, we have the following
Corollary 4.15**.**
Let be a central and essential arrangement in , and a good and -lucky prime number for . Then .
Remark 4.16**.**
Let be a power of a prime and the arrangement in defined by the class of in . Then the same argument of Theorem 4.14 shows that if is good and -lucky for , then .
In [2], Ardila described a finite field method to compute the coboundary polynomial, and hence the Tutte polynomial, of a given arrangement. His result involved the use of powers of large enough primes to make sure that and are combinatorially equivalent. Thanks to Theorem 4.14, we can rewrite his result as follows.
Theorem 4.17**.**
Let be a central and essential arrangement in , and a good and -lucky prime number for . Then
[TABLE]
where denotes the number of hyperplanes of that contain .
5. On Terao’s conjecture
We first recall the basic notions and properties of free hyperplane arrangements.
We denote by the -module of polynomial vector fields on (or -derivations). Let . Then is said to be homogeneous of polynomial degree if are homogeneous polynomials of degree in . In this case, we write .
Let be a central arrangement in . Define the module of vector fields logarithmic tangent to (or logarithmic vector fields) by
[TABLE]
The module is obviously a graded -module and we have
[TABLE]
Definition 5.1**.**
A central arrangement in is said to be free with exponents if and only if is a free -module and there exists a basis of such that , or equivalently .
A lot it is known about free arrangements, however there is still some mystery around the notion of freeness. See [13], [21], [6] and [18] for more details on freeness. For example, Terao’s conjecture asserting the dependence of freeness only on the combinatorics is the longstanding open problem in this area.
Conjecture 5.2** (Terao).**
The freeness of a hyperplane arrangement depends only on its lattice of intersections.
In [15], we characterized the prime numbers for which the freeness of implies the freeness of and, vice versa, the ones for which the freeness of implies the freeness of . Specifically, we proved the following two results.
Theorem 5.3** ([15, Theorem 4.3]).**
If is a free arrangement in with exponents , then is free in with exponents , for all good primes except possibly a finite number of them.
Theorem 5.4** ([15, Theorem 6.1]).**
Let be a good prime number for that is -lucky for , for some term ordering , where denotes the Jacobian ideal of as ideal of . If is free in with exponents , then is free in with exponents .
Putting together Theorems 4.14, 5.3 and 5.4, we can now show that the knowledge of Terao’s conjecture in finite characteristic implies the conjecture over the rationals.
Theorem 5.5**.**
If Terao’s conjecture is true over all , then it is true over .
Proof.
Let and be two central arrangements in such that , and assume that is free with exponents .
Consider the set of prime numbers that are good and -lucky for and , and that are -lucky for . By the discussion at the beginning of Section 4 and Remark 4.10, is infinite. For every , Theorem 4.14 gives us . On the other hand, by Theorem 5.3, we can chose in such way that is free with exponents . If Terao’s conjecture is true over , then is free with exponents . Finally by definition of and Theorem 5.4, is free with exponents . ∎
It is a natural question to ask if, under the hypothesis of Theorem 5.4, and are combinatorially equivalent. In all the examples we considered so far, we obtained a positive answer. This is because in all considered examples, if is -lucky for , then it is -lucky for . However in general, the converse is not true.
Example 5.6**.**
Consider the arrangement in with defining polynomial . Now is the only prime that is not -lucky for . On the other hand a direct computation shows that , and are not -lucky for .
6. How to compute good primes via Gröbner bases
We will now describe a method to compute good primes for an arrangement using minimal strong -Gröbner bases.
Lemma 6.1**.**
Let . If for some , then is not -lucky for the ideal
Proof.
By construction and are distinct homogenous polynomials of degree , that are not one multiple of the other. This implies that there exist two homogenous polynomials of degree that form a minimal strong -Gröbner basis for . Notice that in this situation for with .
Assume by absurd that for some , but is -lucky for In this situation for some . On the other hand, since is -lucky for , we have , for . This implies that for , and hence that . However this is impossible. ∎
In general, the converse of Lemma 6.1 does not hold.
Example 6.2**.**
Consider and . Then a direct computation shows is a minimal strong -Gröbner basis for the ideal , and hence is not a -lucky prime. However, and are not one multiple of the other.
We can now show that in order to compute the good primes, it is enough to compute the -lucky ones.
Theorem 6.3**.**
If is -lucky for , then is good for .
Proof.
By definition, if is -lucky for , then is -lucky for all the ideals of the form for all pairs . By Lemma 6.1, and are not one multiple of the other for all pairs . Hence, is reduced. ∎
In general the statement of Theorem 6.3 is not an equivalence.
Example 6.4**.**
Consider the arrangement in with defining polynomial . Then a direct computation shows that and are not -lucky for . However, all prime numbers are good for .
7. On the period of arrangements
Let be a central and essential arrangement in , with for all . Moreover, assume that there exists no prime number that divides any . We can associate to a integer matrix
[TABLE]
consisting of column vectors , for , such that
[TABLE]
Similarly, for each non-empty , we consider the integer matrix
[TABLE]
For each prime number , we can consider and the reductions of and , respectively, modulo . Notice that is the matrix associated to the arrangement .
Since each is an integer matrix, we can consider its Smith normal form. In particular, there exist two unimodular matrices and such that
[TABLE]
where is the diagonal matrix , with , and . Denote simply by , and let the -period of be
[TABLE]
In [12, Theorem 2.4], the authors proved the following result.
Theorem 7.1**.**
The function is a monic quasi-polynomial in of degree with a period , where is the reduction of modulo .
In [12], the authors also defined
[TABLE]
and obtained the following result in Corollary 3.3
Theorem 7.2**.**
The lattice of intersections is periodic in with period . In other words,
[TABLE]
for all and .
As noted in [2], if is a large prime number, then and are combinatorially equivalent. Putting together this fact and Theorem 7.2, we get the following result.
Corollary 7.3**.**
Let be a prime number such that and is coprime with . Then and are combinatorially equivalent.
The rest of this section is devoted to show that the hypothesis is not necessary. Specifically, we will show that computing the good and -lucky primes for is equivalent to computing all the prime numbers that divide .
Proposition 7.4**.**
If is non-good for , then divides .
Proof.
Assume is non-good for . This implies that there exist a pair of indices such that
[TABLE]
for some . Consider now . Since is central, then (1) is equivalent to the fact that has rank but has rank . In particular, we have that the Smith normal form of is of the form
[TABLE]
where . By definition, a matrix and its Smith normal form have the same rank. On the other hand the Smith normal form of , up to transforming the elements on the main diagonal to , is the reduction modulo of . This implies that As a consequence, divides and hence . ∎
Proposition 7.5**.**
If is not -lucky for , then divides .
Proof.
Let be a non -lucky prime number for . This implies that there exists such that divides a leading coefficient in a minimal strong -Gröbner basis of the ideal . Since , we have that is a integer matrix of rank . Using the same strategy as when computing the Smith normal form of , there exists a unimodular matrix such that is lower triangular. Since , has only non-zero elements on the main diagonal. Seeing that multiplying on the right by is equivalent to perform only column operations on , we have that the columns of represent a minimal strong -Gröbner basis of . This implies that divides one of the elements on the main diagonal of , and hence its determinant. On the other hand, by construction, and have the same Smith normal form . This implies that the determinants of and of coincide up to a sign. However since divides the determinant of , divides the determinant of and hence . Finally, by definition of , this implies that divides . ∎
Theorem 7.6**.**
Let be a prime number. Then the following facts are equivalent
- (1)
* is non-good or not a -lucky prime number for .* 2. (2)
* divides .*
Proof.
By Propositions 7.4 and 7.5, (1) implies (2).
On the other hand, assume there exists a prime number that divides the period , but is good and -lucky for . This implies that there exists such that is divisible by . In particular, since the Smith normal form of , up to transforming the elements on the main diagonal to , is the reduction modulo of the Smith normal form of , this implies that and hence that . However, this implies that and are not combinatorially equivalent, contradicting Theorem 4.14. ∎
Corollary 7.7**.**
If is a square free integer, then it is the product of all prime numbers that are non-good or not -lucky for .
In general, is not a square free integer.
Example 7.8**.**
Consider the arrangement in with defining polynomial . In this situation, is the only non-good prime number for . Moreover, all prime numbers are -lucky for . A direct computation shows that .
Putting together Theorems 4.14 and 7.6, we obtain the following result that generalizes Corollary 7.3.
Corollary 7.9**.**
Let be a central and essential arrangement in . The following facts are equivalent
- (1)
* is coprime with .* 2. (2)
, i.e. and are combinatorially equivalent.
Acknowledgements
The authors would like to thank M. Yoshinaga for many helpful discussions. During the preparation of this article the second author was supported by JSPS Grant-in-Aid for Early-Career Scientists (19K14493).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] W. W. Adams, P. Loustaunau. An introduction to Gröbner bases , no. 3, American Mathematical Soc., (1994).
- 2[2] F. Ardila. Computing the Tutte polynomial of a hyperplane arragement. Pacific Journal of Mathematics , 230(1), 1–26 (2007).
- 3[3] C. Athanasiadis. Characteristic polynomials of subspace arrangements and finite fields. Advances in Mathematics , 122(2), 193–233 (1996).
- 4[4] C. Athanasiadis. Extended linial hyperplane arrangements for root systems and a conjecture of Postnikov and Stanley. Journal of Algebraic Combinatorics , 10(3), 207–225 (1999).
- 5[5] C. Athanasiadis. Generalized Catalan numbers, Weyl groups and arrangements of hyperplanes. Bulletin of the London Mathematical Society , 36(3), 294–302 (2004).
- 6[6] A. Bigatti, E. Palezzato, M. Torielli. New characterizations of freeness for hyperplane arrangements. Journal of Algebraic Combinatorics , 51(2), 297–315 (2020).
- 7[7] A. Björner, T. Ekedahl. Subspace arrangements over finite fields: cohomological and enumerative aspects. Advances in Mathematics , 129(2), 159–187 (1997).
- 8[8] A. Blass, B. Sagan. Characteristic and Ehrhart polynomials. Journal of Algebraic Combinatorics , 7(2), 115–126 (1998).
