Common Real Secants to Pairs of Real Twisted Cubic Curves

1. Problem Statement

The paper addresses two primary problems in algebraic geometry concerning twisted cubic curves (smooth rational curves of degree 3 in $\mathbb{P}^3$):

1. Complex Monodromy: While it is a classical result (via Schubert calculus) that two general twisted cubic curves in complex projective space $\mathbb{P}^3(\mathbb{C})$ share exactly 10 common secant lines, the structure of these solutions was not fully understood. The authors investigate the monodromy group of these 10 lines. Specifically, they ask: What is the permutation group generated by the 10 common secants as the pair of curves varies along a closed loop in the parameter space?
2. Real Secant Classification: The paper formulates a "real analogue" to the classical counting problem. Given two real twisted cubic curves (defined by real coefficients), how many of the 10 common secants are real? Furthermore, the authors introduce a refined classification based on the nature of the intersection points on the curves:
   • Totally Real: The secant intersects both curves at two real points each.
   • Partially Real: The secant intersects one curve at two real points and the other at a pair of non-real complex conjugate points.
   • Minimally Real: The secant intersects both curves at pairs of non-real complex conjugate points (yet the line itself is real).
   • Nonreal: The secant line itself is not real.

The core question is: Which combinations (3-tuples) of $(n_t, n_p, n_m)$—representing the counts of totally, partially, and minimally real secants—are realizable?

2. Methodology

The authors employ a hybrid approach combining computational algebraic geometry, numerical homotopy continuation, and combinatorics.

• Algebraic Formulation:

  • They parameterize the space of twisted cubics $\mathcal{H}$ using the group $PGL_4(\mathbb{C})$ acting on a standard twisted cubic $C_0$.
  • They derive a system of polynomial equations $F(t_1, t_2, s_1, s_2; M) = 0$ where $M$ represents the transformation matrix. The variables $t_1, t_2$ correspond to intersection points on the first curve, and $s_1, s_2$ on the second.
  • The system has 40 isolated nonsingular solutions, which group into 10 orbits of size 4 under the action of $S_2 \times S_2$ (swapping the two intersection points on each curve). Each orbit corresponds to one unique common secant line.

• Monodromy Analysis (Theorem 1.4):

  • Heuristic Search: Using the software Bertini, they generate random loops in the parameter space $PGL_4(\mathbb{C})$ and track the 10 solution orbits to observe the resulting permutations.
  • Certification: They identified two specific loops ($\gamma_1, \gamma_2$) whose induced permutations appeared to generate the full symmetric group $S_{10}$. They used CertifiedHomotopyTracking.jl (based on the Krawczyk method) to rigorously prove that the paths remain nonsingular and that the permutations are exactly as computed.
  • Verification: They confirmed in Mathematica that the subgroup generated by these two permutations has order $10!$, proving it is $S_{10}$.

• Real Classification (Theorems 1.6 & 1.7):

  • Combinatorial Bounds: They established that the number of real secants ($n_R = n_t + n_p + n_m$) must be even (0 to 10) because non-real secants come in conjugate pairs. This yields 161 admissible 3-tuples $(n_t, n_p, n_m)$.
  • Sampling Strategies:
    • Uniform Sampling: They sampled 100,000 points in the real parameter space $\mathcal{H}(\mathbb{R})$ to observe the distribution of realizable tuples.
    • Local Search: To find rare configurations, they used Algorithm 2, generating samples near specific parameter points to "nudge" the system toward un-realized tuples.
  • Certification: For every candidate tuple found, they used alphaCertified to rigorously verify the reality of the solutions and the specific counts of $n_t, n_p, n_m$.

3. Key Contributions and Results

A. Monodromy Group (Theorem 1.4)

The authors prove that the monodromy group of the 10 common secant lines to two general twisted cubic curves in $\mathbb{P}^3(\mathbb{C})$ is the full symmetric group $S_{10}$.

• Significance: This demonstrates that the 10 secants have no special algebraic structure or constraints over the complex numbers; any permutation of the 10 lines is possible via continuous deformation of the curves.

B. Realizable Configurations (Theorem 1.6)

They prove that for any integer $k$ between 0 and 10, there exist pairs of real twisted cubic curves with exactly $k$ totally real common secant lines.

• Significance: This resolves the question of whether the number of totally real secants is constrained. The answer is no; the count can be any integer from 0 to 10.

C. Admissible 3-Tuples (Theorem 1.7)

The authors provide a comprehensive classification of realizable 3-tuples $(n_t, n_p, n_m)$.

• They successfully realized and certified 128 out of 161 admissible 3-tuples.
• Theorem 1.7 states that a tuple is realizable if:
  • $n_R \in \{0, 2, 4, 6\}$ (any combination summing to these even numbers).
  • $n_R = 8$ and $n_t \neq 1$.
  • $n_R = 10$ and $n_t \in \{5, 6, 7, 8, 9, 10\}$.
• Open Cases: The realizability of tuples where $n_R=8$ with $n_t=1$, and $n_R=10$ with $n_t \in \{0, 1, 2, 3, 4\}$, remains an open problem.

D. Specific Examples

The paper provides explicit matrix parameters $M$ (in Examples 2.4 and 4.1–4.10) that generate curves realizing specific extreme cases, such as:

• 10 totally real secants.
• 9 totally real secants.
• 0 totally real secants.

4. Significance

• Advancement in Enumerative Geometry: The paper moves beyond simple counting (Schubert calculus) to a deeper structural understanding of the solution space, specifically addressing the "real" aspect of enumerative geometry, which is often more complex and less understood than the complex case.
• Computational Rigor: The work serves as a benchmark for numerical algebraic geometry. It demonstrates how heuristic numerical methods (homotopy continuation) can be combined with rigorous certification (Krawczyk method) to prove theorems about the existence of specific geometric configurations.
• Refined Classification: By distinguishing between totally, partially, and minimally real secants, the authors introduce a nuanced framework for analyzing real algebraic curves that captures the interaction between the curve's geometry and the field of definition.
• Open Problems: The paper clearly delineates the boundary between what is known and what remains open, providing a roadmap for future research in real enumerative geometry and rational normal curves.

5. Tools Used

• Bertini: For numerical homotopy continuation and path tracking.
• CertifiedHomotopyTracking.jl: For rigorous certification of path tracking.
• alphaCertified: For certifying the reality and nonsingularity of solutions.
• Macaulay2: For symbolic algebraic verification (e.g., degree of ideals).
• Mathematica: For group theory verification (calculating the order of permutation groups).
• Python: For automating the sampling and data processing.