Problem 2 - Algebraic Geometry

Question

Let \(C\) and \(D\) be curves on a surface \(X,\) meeting at a point \(P .\) Let \(\pi: \tilde{X} \rightarrow X\) be the monoidal transformation with center \(P .\) Show that \(\dot{C} . \tilde{D}=C . D-\mu_{P}(C) \cdot \mu_{P}(D)\) Conclude that \(C . D=\sum \mu_{P}(C) \cdot \mu_{P}(D),\) where the sum is taken over all intersection points of \(C\) and \(D\), including infinitely near intersection points.

Step-by-Step Solution

Answer

The given relation \(\dot{C} . \tilde{D} = C . D - \mu_P(C) . \mu_P(D)\) implies that the interaction of curves \(C\) and \(D\) on surface \(X\) under the monoidal transformation \(\pi\) with center \(P\) can be expressed using the multiplicities of \(C\) and \(D\) at \(P\). By accumulating these values over all intersection points of \(C\) and \(D\), we find the total intersection product \(C . D\). It is noteworthy that this sum includes infinitely near intersection points, hence accounting for all possible intersection events.

Step 1: Understand Monoidal Transformation

A monoidal transformation with center \(P\) on a surface \(X\) modifies only the local behavior of the surface at the point \(P\). It maintains the simplicity of the point and merely changes its local parameters.

Step 2: Define \(\mu_P(C)\) and \(\mu_P(D)\)

\(\mu_P(C)\) and \(\mu_P(D)\) represent the multiplicity of the curves \(C\) and \(D\) at the intersection point \(P\). In simpler terms, multiplicity shows the number of times a curve passes through an intersection point. The higher the multiplicity, the 'more times' a curve is intersecting the point.

Step 3: Derive Equation for \(\dot{C}. \tilde{D}\)

Now, we symbolize the curves \(C\) and \(D\) on the transformed surface as \(\dot{C}\) and \(\tilde{D}\) respectively. Going by the transformation rules of intersection multiplicity under a standard monoidal transformation, we can write \(\dot{C} . \tilde{D} = C.D - \mu_P(C) . \mu_P(D)\)

Step 4: Derive the relation for the sum of multiplicities

Taking the result from Step 3, sum over all intersections of the original curves \(C\) and \(D\), we find that: \(C.D=\sum \mu_P(C).\mu_P(D)\). This sum includes all points of intersection—even if they are 'infinitely near points', or points that are limit points of a sequence of distinct points of intersection.

Key Concepts

Monoidal Transformation

In algebraic geometry, a monoidal transformation, also known as a blowup, is a fascinating tool for modifying a surface. Imagine you have a surface and precisely at a single point, denoted as \(P\), you want to alter how it behaves. A monoidal transformation changes the local geometry around this point without affecting the larger structure of the surface.
The process substitutes the point \(P\) with a new structure, often a curve, called the exceptional divisor. This transformation is very handy in resolving singularities or simplifying complex intersections on a surface. When applying a monoidal transformation, curves that initially intersect at a point \(P\) may no longer intersect on the transformed surface at that point, leading to simpler geometrical configurations.
Overall, monoidal transformations are versatile techniques in algebraic geometry, enhancing our capability to handle complex curves and intersections on surfaces.

Intersection Multiplicity

Intersection multiplicity is a measure of how many times two curves intersect each other at a given point. Consider two curves \(C\) and \(D\) intersecting at a point \(P\) on a surface. Here, the multiplicity tells you not just that they intersect, but provides an indication of how "strongly" they intersect.

• The intersection multiplicity at a point \(P\) is denoted as \(\mu_P(C)\) for curve \(C\) and \(\mu_P(D)\) for curve \(D\).
• If \(\mu_P(C)\) or \(\mu_P(D)\) is greater than 1, it implies the curves pass through point \(P\) multiple times, perhaps tangentially.

After a monoidal transformation, the intersection multiplicity can be reduced in a predictable way. You can calculate the new multiplicity by subtracting the product of the original multiplicities from the original count, as seen in \(\dot{C} . \tilde{D} = C.D - \mu_P(C) \cdot \mu_P(D)\). This helps in quantifying intersections' complexities even post-transformation.

Curves on Surfaces

Curves on surfaces play a crucial role in algebraic geometry by representing the loci of solutions to polynomial equations on that surface. Each curve is not just a line on the surface but a set of points meeting certain criteria defined by its equation. When discussing intersections of curves, it's paramount to consider where and how these curves meet on the surface.
Intersecting curves can form various angles or be tangent to each other, and these intersections carry significant importance. They can be analyzed using the concept of multiplicity, quantifying how curves pass through common points.

• For any two curves \(C\) and \(D\) on the surface \(X\), intersection points occur where \(C\) and \(D\) meet.
• 'Infinitely near points' refer to those that can be perceived as limits of sequences of intersection points, providing insights into complex intersection behaviors.

Understanding how curves interact on surfaces helps depict geometric transformations and relations in intricate detail, aiding in solving theoretical questions in algebraic geometry.