OctoInformBeta

OpenAI preprint, September 2026 Β· Β§2. A bundle defined by three graphs

Lemma 2.2 [The graph divisor]: On the product SS of two projective lines, the local product is nonzero and has the transition law of π’ͺS(3,3)\mathcal O_S(3,3)

Three graph equations define a reduced divisor.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

The graph divisor DD on S=β„™1Γ—β„™1S=\mathbb P^1\times\mathbb P^1 is the union of three matrix graphs. Its defining data are complex 2Γ—22\times2 matrices, with homogeneous coordinates in each projective factor.

A standard chart index is a pair i=(i1,i2)∈{0,1}2i=(i_1,i_2)\in\{0,1\}^2, specifying one of the four standard affine charts on SS.✦ The base coordinate space on a chart is β„‚2\mathbb C^2, with coordinates z=(z1,z2)z=(z_1,z_2)✦, and the base polynomial ring is β„‚[z1,z2]\mathbb C[z_1,z_2].✦ For a base polynomial pp, the notation p(z)p(z) denotes its evaluation at the coordinate pair zz.✦

For an index ϡ\epsilon equal to 00 or 11 and a complex number tt, the normalized homogeneous representative rϡ(t)r_\epsilon(t) is the vector with coordinate ϡ\epsilon equal to 11 and its other coordinate equal to tt, as in (1); the same formula applies to a coordinate indeterminate.✦ r0(t)=(1t),r1(t)=(t1).r_0(t)=\begin{pmatrix}1\\t\end{pmatrix}, \qquad r_1(t)=\begin{pmatrix}t\\1\end{pmatrix}.(1)

The projective line coordinate change τϡη\tau_{\epsilon\eta} and the homogeneous transition factor ρϡη\rho_{\epsilon\eta}, for Ο΅,η∈{0,1}\epsilon,\eta\in\{0,1\}, are the scalar functions defined by (2). (τϡη(t),ρϡη(t))={(t,1),Ο΅=Ξ·,(tβˆ’1,t),Ο΅β‰ Ξ·.\bigl(\tau_{\epsilon\eta}(t),\rho_{\epsilon\eta}(t)\bigr) =\begin{cases} (t,1),&\epsilon=\eta,\\ (t^{-1},t),&\epsilon\ne\eta. \end{cases}(2)

The quadric coordinate change Ξ¦ij:β„‚2β†’β„‚2\Phi_{ij}:\mathbb C^2\to\mathbb C^2, for standard chart indices i,ji,j, applies (2) independently in the two factors.✦ The first and second coordinate transition factors of the quadric coordinate change Ξ¦ij\Phi_{ij} are the functions uiju_{ij} and vijv_{ij} in (3). Ξ¦ij(z)=(Ο„i1j1(z1),Ο„i2j2(z2)),uij(z)=ρi1j1(z1),vij(z)=ρi2j2(z2).\begin{aligned} \Phi_{ij}(z)&= \bigl(\tau_{i_1j_1}(z_1),\tau_{i_2j_2}(z_2)\bigr),\\ u_{ij}(z)&=\rho_{i_1j_1}(z_1), &v_{ij}(z)&=\rho_{i_2j_2}(z_2). \end{aligned}(3)

The chart overlap polynomial qijβˆˆβ„‚[z1,z2]q_{ij}\in\mathbb C[z_1,z_2] is the product of the coordinate indeterminates for which the chart indices differ.✦ The affine chart overlap Ξ©ijβŠ‚β„‚2\Omega_{ij}\subset\mathbb C^2 is the nonvanishing locus of the chart overlap polynomial qijq_{ij}, as specified in (4); an empty product is 11.✦ qij=βˆβ„“βˆˆ{1,2}iβ„“β‰ jβ„“zβ„“,Ξ©ij={zβˆˆβ„‚2:qij(z)β‰ 0}.q_{ij}=\prod_{\substack{\ell\in\{1,2\}\\i_\ell\ne j_\ell}}z_\ell, \qquad \Omega_{ij}=\{z\in\mathbb C^2:q_{ij}(z)\ne0\}.(4)

Graph parameters T=(a,s,ΞΌ,Ξ½)T=(a,s,\mu,\nu) are four complex numbers satisfying (5).✦ The scalar aa is the diagonal parameter of the second graph matrix; ss is the first diagonal entry of the third graph matrix, whose off-diagonal entries are ΞΌ\mu and Ξ½\nu. a3=βˆ’1,s(1βˆ’s)=1+ΞΌΞ½,s+a2(1βˆ’s)+2a=0,ΞΌβ‰ 0,Ξ½β‰ 0.\begin{gathered} a^3=-1,\qquad s(1-s)=1+\mu\nu,\\ s+a^2(1-s)+\sqrt2\,a=0,\qquad \mu\ne0,\quad\nu\ne0. \end{gathered}(5)

The three graph matrices associated to TT are the complex 2Γ—22\times2 matrices M0,M1,M2M_0,M_1,M_2 defined in (6).✦ M0=I2,M1=(a00aβˆ’1),M2=(sΞΌΞ½1βˆ’s).M_0=I_2,\qquad M_1=\begin{pmatrix}a&0\\0&a^{-1}\end{pmatrix},\qquad M_2=\begin{pmatrix}s&\mu\\\nu&1-s\end{pmatrix}.(6)

For a complex 2Γ—22\times2 matrix MM, the matrix graph equation gM,iβˆˆβ„‚[z1,z2]g_{M,i}\in\mathbb C[z_1,z_2] is the determinant in (7).✦ Here x=ri1(z1)x=r_{i_1}(z_1) and y=ri2(z2)y=r_{i_2}(z_2) are the normalized homogeneous representatives from (1), with components indexed by 0,10,1; each matrix entry is regarded as a constant polynomial. gM,i=det⁡(y0(Mx)0y1(Mx)1)=y0(M10x0+M11x1)βˆ’y1(M00x0+M01x1).\begin{aligned} g_{M,i} &=\det\begin{pmatrix}y_0&(Mx)_0\\y_1&(Mx)_1\end{pmatrix}\\ &=y_0(M_{10}x_0+M_{11}x_1)-y_1(M_{00}x_0+M_{01}x_1). \end{aligned}(7)

The three-graph divisor equation diβˆˆβ„‚[z1,z2]d_i\in\mathbb C[z_1,z_2] is the product (8) of the graph equations for the matrices in (6).✦ di=gM0,igM1,igM2,i.d_i=g_{M_0,i}\,g_{M_1,i}\,g_{M_2,i}.(8)

A polynomial pβˆˆβ„‚[z1,z2]p\in\mathbb C[z_1,z_2] is squarefree if no square of an irreducible polynomial divides pp.

The Claim

Theorem 1. Let TT be graph parameters satisfying (5), and let did_i be the local equations defined by (8). For every standard chart ii, the assertions are (9) and (10): di is squarefree.d_i\text{ is squarefree}.(9)✦ diβ‰ 0.d_i\ne0.(10)✦ For standard charts i,ji,j and z∈Ωijz\in\Omega_{ij}, the overlap identity is (11): di(z)=(uij(z)vij(z))3dj(Ξ¦ij(z)).d_i(z)=\bigl(u_{ij}(z)v_{ij}(z)\bigr)^3 d_j\bigl(\Phi_{ij}(z)\bigr).(11)✦

In the paper, the result reads: DD has bidegree (3,3)(3,3) 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 SS, using polynomial evaluation on β„‚2\mathbb C^2, the overlaps in (4), and the coordinate changes and transition factors in (3).