I am trying to show that two distinct irreducible conics $X$ and $Y$ in $\mathbb{A}^2$ intersect in at most four points without relying on Bézout's Theorem. I would appreciate any insight into elementary methods that could be used to achieve this result.
Here's what I attempted:
- Let $X = Z(f)$ and $Y = Z(g)$ for irreducible polynomials $f, g \in k[x,y]$, where $f$ and $g$ define the conics $X$ and $Y$ respectively. Since $X \neq Y$ and both $f$ and $g$ are irreducible, it follows that $X \cap Y$ is a finite set.
- Then, letting $b$ denote the second coordinate of a point in $X \cap Y$, I considered the system \begin{align*} \begin{cases} f(x,b) = 0, \\ g(x,b) = 0. \end{cases} \end{align*}
My idea was that the finiteness of $X \cap Y$, together with this system, would somehow lead to an upper bound of four points, but I don't know how to make the argument work.
Could someone suggest a more solid, elementary approach that might lead to the desired conclusion of at most four intersection points? Any guidance would be greatly appreciated.