Skip to main content
removed deprecated tag 'geometry'; replaced mathjax in title
Link
Ricardo Andrade
  • 6.2k
  • 5
  • 42
  • 69

Bézout's theorem for arcs in ${\mathbb R}^2$the plane

Source Link
Adam Sheffer
  • 1.1k
  • 1
  • 8
  • 19

Bézout's theorem for arcs in ${\mathbb R}^2$

Consider two polynomials $p,q \in {\mathbb R}[x,y]$, both of degree $d$. Let $\gamma_p$ and $\gamma_q$ be the two curves in ${\mathbb R}^2$ that are defined by these polynomials, and assume that these curves have no common components. As is well known, by Bézout's theorem the two curves intersect in at most $d^2$ points.

We cut $\gamma_p$ at each point where $\frac{\partial p}{\partial y} =0$, and similarly for $\gamma_q$. We obtain a set of arcs that behave like functions in the sense that each arc has at most one point for every $x$-coordinate.

Consider one such arc of $\gamma_p$ and one such arc of $\gamma_q$. My question is: Is the number of intersection points between two such arcs at most $d$? Or at least significantly smaller than $d^2$?

At first glance this may seem false. However, when $d=2$ it is clear that the two arcs have at most two intersection points. I played with the case of $d=3$ for a while and could not get more than three intersection points.

Many thanks! Adam