The Setting
The graph divisor on is the union of three matrix graphs. Its defining data are complex matrices, with homogeneous coordinates in each projective factor.
A standard chart index is a pair , specifying one of the four standard affine charts on .β¦ The base coordinate space on a chart is , with coordinates β¦, and the base polynomial ring is .β¦ For a base polynomial , the notation denotes its evaluation at the coordinate pair .β¦
For an index equal to or and a complex number , the normalized homogeneous representative is the vector with coordinate equal to and its other coordinate equal to , as in (1); the same formula applies to a coordinate indeterminate.β¦ (1)
The projective line coordinate change and the homogeneous transition factor , for , are the scalar functions defined by (2). (2)
The quadric coordinate change , for standard chart indices , applies (2) independently in the two factors.β¦ The first and second coordinate transition factors of the quadric coordinate change are the functions and in (3). (3)
The chart overlap polynomial is the product of the coordinate indeterminates for which the chart indices differ.β¦ The affine chart overlap is the nonvanishing locus of the chart overlap polynomial , as specified in (4); an empty product is .β¦ (4)
Graph parameters are four complex numbers satisfying (5).β¦ The scalar is the diagonal parameter of the second graph matrix; is the first diagonal entry of the third graph matrix, whose off-diagonal entries are and . (5)
The three graph matrices associated to are the complex matrices defined in (6).β¦ (6)
For a complex matrix , the matrix graph equation is the determinant in (7).β¦ Here and are the normalized homogeneous representatives from (1), with components indexed by ; each matrix entry is regarded as a constant polynomial. (7)
The three-graph divisor equation is the product (8) of the graph equations for the matrices in (6).β¦ (8)
A polynomial is squarefree if no square of an irreducible polynomial divides .
The Claim
Theorem 1. Let be graph parameters satisfying (5), and let be the local equations defined by (8). For every standard chart , the assertions are (9) and (10): (9)β¦ (10)β¦ For standard charts and , the overlap identity is (11): (11)β¦
In the paper, the result reads: has bidegree and exactly six singular points, all ordinary transverse intersections of two components, with no triple intersections.
What Is Checked
The assertions are stated over complex graph parameters satisfying (5) and the four standard affine charts on , using polynomial evaluation on , the overlaps in (4), and the coordinate changes and transition factors in (3).