Triangular arrangements on the projective plane

This paper investigates triangular line arrangements on the projective plane by proving their combinatorics are always realized by Roots-of-Unity-Arrangements, establishing conditions for their freeness, and demonstrating that freeness is not determined solely by weak combinatorics.

The Gist

Imagine you are an architect designing a city made entirely of straight roads. In the world of mathematics, specifically Algebraic Geometry, these roads are called "lines," and when you arrange them on a flat surface (like a piece of paper or a digital screen), you create what is known as a Line Arrangement.

The paper you are asking about, "Triangular arrangements on the projective plane," by Simone Marchesi and Jean Vallès, is like a detective story about these road networks. The authors are trying to solve a mystery: Can we predict the "stability" of a city just by looking at a map of its intersections?

Here is the breakdown of their work using simple analogies.

1. The Setting: The Triangular City

Most road networks are chaotic. But this paper focuses on a very specific, organized type of city called a Triangular Arrangement.

Imagine three major landmarks (let's call them North, East, and South). In this city, every single road must pass through at least one of these three landmarks.

• Some roads go through North.
• Some go through East.
• Some go through South.
• Some might go through two of them (these are the "side roads" connecting the landmarks).

The authors call this a "Triangular Arrangement" because all the traffic flows through the corners of a giant triangle.

2. The Mystery: "Free" vs. "Stuck"

In this mathematical world, a city is called "Free" if its traffic flow (mathematically, the "vector fields") is perfectly smooth and predictable. If a city is "Free," it means the roads are arranged in such a harmonious way that you can calculate exactly how traffic behaves everywhere without getting stuck in a gridlock.

If a city is not Free, it has hidden "knots" or "bottlenecks" that make the traffic flow messy and unpredictable.

The Big Question (Terao's Conjecture):
The mathematicians have a famous hypothesis (Terao's Conjecture) that says: "If two cities have the exact same map of intersections (combinatorics), then either both are Free, or neither is."
Think of it like this: If you have two blueprints that look identical on paper, the buildings built from them should have the same structural stability.

3. The Discovery: The "Roots-of-Unity" Magic Trick

The authors discovered a special class of cities called Roots-of-Unity-Arrangements (RUAs).

Imagine you have a magical compass that only points in directions based on the numbers on a clock face (like 12, 1, 2, 3...). If you build your roads using only these specific, rhythmic angles, you get a "Roots-of-Unity" city.

The Key Finding:
The authors proved that no matter how messy your triangular city looks, you can always find a "Roots-of-Unity" version of it that has the exact same map.
It's like saying: "If you have a weird, irregular city, I can build a perfect, rhythmic version of it using only clock-face angles, and it will look exactly the same from above."

This is huge because these rhythmic cities are much easier to study. If we can figure out the rules for the rhythmic ones, we might understand the messy ones too.

4. The Rules for Stability

The paper spends a lot of time figuring out exactly when these rhythmic cities are "Free." They found that it depends on the "inner triple points."

• Inner Triple Points: These are spots where a road from North, a road from East, and a road from South all cross at the exact same spot in the middle of the city (not at the landmarks).
• The Rule: The authors found that if these crossing points are arranged in a very specific, "complete" pattern (like a perfect grid), the city is Free. If they are scattered or missing, the city might get stuck.

They even created a "recipe book" (Corollary 4.3) showing how to build a perfectly balanced, Free city for almost any number of roads you want, as long as you follow their rhythmic rules.

5. The Twist: The Weak Combinatorics Trap

Here is the most exciting part of the paper. The authors decided to test Terao's Conjecture with a slightly weaker rule.

• Strong Combinatorics: Knowing exactly which specific roads cross each other.
• Weak Combinatorics: Just knowing how many roads cross at each point (e.g., "There are 5 spots where 3 roads cross, and 2 spots where 4 roads cross").

The Shocking Result:
The authors found two cities that have the exact same Weak Combinatorics (the same number of crossings of each type), but:

• City A is Free (Perfectly stable).
• City B is Not Free (It has hidden knots).

The Analogy:
Imagine two different puzzle boxes.

• Box A has 10 pieces that fit together perfectly.
• Box B also has 10 pieces that fit together perfectly.
• If you just count the pieces (Weak Combinatorics), they look identical.
• But if you look at how the pieces connect (Strong Combinatorics), Box A is a solid cube, while Box B is a wobbly mess that falls apart.

This proves that you cannot predict stability just by counting the intersections. You need to know the exact map. This is a major blow to the idea that "counting is enough."

6. The Conclusion

The paper ends by asking: "If we have a messy city and a rhythmic city with the same map, are they both Free or both Not Free?"

They suspect the answer is Yes. If this is true, it would be a massive step forward in solving the bigger mystery of Terao's Conjecture. It suggests that the "rhythmic" cities are the perfect test subjects for understanding the whole universe of line arrangements.

Summary in One Sentence

The authors showed that while you can always turn a messy triangular road network into a rhythmic one with the same map, simply counting the traffic intersections isn't enough to tell you if the city is stable; you need the full map to know if the traffic will flow freely or get stuck.

Technical Summary

Here is a detailed technical summary of the paper "Triangular arrangements on the projective plane" by Simone Marchesi and Jean Vallès.

1. Problem Statement and Context

The paper investigates line arrangements in the complex projective plane $\mathbb{P}^2$, specifically focusing on triangular arrangements. A triangular arrangement is defined as a set of lines where every line passes through one of three fixed non-aligned points (vertices of a triangle).

The central problem addressed is Terao's Conjecture, which posits that the freeness of a hyperplane arrangement depends solely on its combinatorics (the intersection lattice $L(\mathcal{A})$). While proven for arrangements with up to 13 lines, the conjecture remains open in general.

The authors aim to:

1. Understand the structure and freeness conditions of triangular arrangements.
2. Introduce and utilize Roots-of-Unity-Arrangements (RUAs) as a combinatorial model.
3. Investigate whether Terao's conjecture holds for weak combinatorics (the sequence of integers $t_i$ representing the number of points of multiplicity $i$).

2. Methodology and Key Concepts

Triangular Arrangements and Inner Triple Points

Let $A, B, C$ be the three vertices. A triangular arrangement $\mathcal{A}$ consists of lines passing through these vertices.

• Side lines: The lines connecting the vertices ($AB, BC, CA$).
• Inner lines: Lines passing through a vertex but not being a side.
• Inner Triple Points ($T$): Points formed by the intersection of one line from each of the three families (one through $A$, one through $B$, one through $C$). These are distinct from the vertices.

The authors utilize the Addition-Deletion Theorem (relating the logarithmic sheaf $\mathcal{T}_{\mathcal{A}}$ of an arrangement to that of a sub-arrangement) and exact sequences involving ideal sheaves to analyze the freeness of the arrangement.

Roots-of-Unity-Arrangements (RUA)

A RUA is a specific type of triangular arrangement where the coefficients of the line equations are powers of a fixed root of unity $\zeta$.

• Key Theorem (3.2): For any triangular arrangement, there exists a RUA with the exact same combinatorics (isomorphic intersection lattice). This establishes RUAs as a universal combinatorial model for triangular arrangements.

Complementary Arrangements

The authors study RUAs obtained by deleting lines from a full monomial arrangement $\mathcal{A}^3_3(N)$ (defined by $(x^N-y^N)(y^N-z^N)(x^N-z^N)=0$).

• Let $\mathcal{A}$ be the resulting arrangement and $\mathcal{A}^c$ be the complementary arrangement (the set of deleted lines).
• They define $T_{rem}$ as the set of inner triple points of the complementary arrangement $\mathcal{A}^c$.
• The freeness of $\mathcal{A}$ is linked to the geometry of $T_{rem}$ (specifically, whether it is empty or a complete intersection).

3. Key Contributions and Results

A. Characterization of Free RUAs

The paper provides necessary and sufficient conditions for a RUA to be free based on the properties of $T_{rem}$:

• Theorem 4.1:
  • If $T_{rem} = \emptyset$, the arrangement $\mathcal{A}$ is free.
  • Under specific numerical constraints on the number of lines ($2N - a - b - c + 2 \leq 0$),$\mathcal{A}$is free **if and only if**$T_{rem} = \emptyset$.
  • In the case where $c \geq a+b-1$, freeness is equivalent to $T_{rem}$ being a complete intersection with a specific cardinality.
• Corollary 4.3: The authors explicitly construct free equilateral RUAs (where the number of lines through each vertex is equal) for any admissible pair of exponents $(d_1, d_2)$.

B. Free Arrangements in Non-Complete Triangles

The study extends to "incomplete" triangular arrangements where one or more side lines of the triangle are removed.

• Theorem 5.1: The authors classify when such incomplete arrangements are free.
  • A key finding is that for an incomplete arrangement to be free, its set of inner triple points must be a complete intersection.
  • Specific constraints on the number of lines through each vertex ($a, b, c$) are required (e.g., if two sides are removed, the arrangement is free only if $a=b=c$ and $T$ is a complete intersection).

C. Refutation of Terao's Conjecture for Weak Combinatorics

The paper addresses a weaker version of Terao's conjecture: Does freeness depend only on the weak combinatorics (the counts $t_i$ of points with multiplicity $i$)?

• Theorem 6.2: The authors prove that freeness is NOT determined by weak combinatorics.
• Counter-example: They construct two arrangements, $\mathcal{A}_0$ and $\mathcal{A}_1$, both in $\text{Tr}(5,5,5)$ with 15 lines.
  • Both have identical weak combinatorics: $t_3=12, t_6=3$, and $t_i=0$ for other $i$.
  • $\mathcal{A}_0$ is free (exponents 7, 7).
  • $\mathcal{A}_1$ is not free (it is "nearly free" with generic splitting $(6,8)$ and a jumping point).
• Geometric Explanation: The difference lies in the geometric configuration of the triple points. In the non-free case, the 12 triple points lie on a cubic curve, creating a syzygy with a common zero (the jumping point), whereas the free case avoids this.

4. Significance and Implications

1. Universal Combinatorial Model: The proof that any triangular arrangement has a RUA with the same combinatorics simplifies the study of Terao's conjecture for this class. It suggests that if the conjecture fails for triangular arrangements, it can be detected within the specific, algebraic framework of RUAs.
2. Counter-Example to Weak Combinatorics: The paper provides a definitive negative answer to the question of whether weak combinatorics determines freeness. This is a significant result because weak combinatorics is a much coarser invariant than the full intersection lattice; showing that even this coarse data fails to predict freeness highlights the deep geometric nature of the problem.
3. Explicit Constructions: The paper offers explicit constructions of free arrangements with arbitrary exponents, contributing to the catalog of known free arrangements, which is crucial for testing conjectures in arrangement theory.
4. Connection to Syzygies: The work deeply connects the freeness of arrangements to the existence of syzygies (relations between partial derivatives) and the geometry of the singular locus (specifically, whether the syzygy bundle has a zero section).

5. Conclusion

Marchesi and Vallès establish that while the full combinatorics of triangular arrangements can be modeled by Roots-of-Unity-Arrangements, the weaker invariant of "weak combinatorics" is insufficient to determine freeness. They provide a rigorous classification of free triangular arrangements (both complete and incomplete) based on the geometry of their inner triple points and complementary arrangements, offering a concrete counter-example to the extension of Terao's conjecture to weak combinatorics.