Can the intersection multiplicity for plane curves be defined computationally?

73 Views Asked by At

Wikipedia says

There is a unique function ... $I_{p}(P,Q)$ called the intersection multiplicity of $P$ and $Q$ at $p$ that satisfies the following [six] properties:

...

Although these properties completely characterize intersection multiplicity, in practice it is realised in several different ways.

and then goes on to list a few realizations:

  1. the dimension of $K[[x, y]]/(P, Q)$ (assuming $p = (0, 0)$)
  2. the highest power of $y$ dividing the resultant of $P$ and $Q$
  3. using pertubations of the curves

Other sources (e.g., Fulton) also define it as the dimension of a quotient of the local ring at $p$.

However, why not define it purely computationally? It seems simple enough to enumerate all the cases where the degrees of $P$ and $Q$ are $\le 1$, and then define a procedure where you can reduce the degree of whichever of $P$ and $Q$ has the highest-degree term, using the given properties.

Are there textbooks that take such a computational approach? It's probably most suitable for a more introductory course, but it would avoid having to depend on a bunch of commutative algebra.