Let $\mathcal{C}$ be a cubic curve in the complex projective plane given in terms of its defining equation. How can I systematically tell if $\mathcal{C}$ is irreducible? By “systematically” I mean “without being clever”, e.g. without eyeballing the polynomial and finding a factorization this way. However, the solution does not necessarily have to be algorithmic.
Some facts (please correct me if I’m wrong):
- $\mathcal{C}$ is non-singular $\Rightarrow \mathcal{C}$ is irreducible
- $\mathcal{C}$ has a ordinary double point (a “node”) $\Rightarrow \mathcal{C}$ is irreducible
- $\mathcal{C}$ has a triple point $\Rightarrow \mathcal{C}$ is reducible
- $\mathcal{C}$ has more than one singular point $\Rightarrow \mathcal{C}$ is reducible
But what if $\mathcal{C}$ has a non-ordinary double point? And are there other ways of telling if a curve is irreducible than considering its singularities?
As N.H. pointed out in his comment, $C$ is reducible if and only if there is a projective line $L$ which is completely contained in $C$, this follows from the complete classification of ternary cubics, see e.g. page 56 in this script by Victoria Hoskins.
Let $f\in\Bbb C[x_0,x_1,x_2]$ be the defining equation of $C$. I propose the following method to check if $C$ is reducible:
Pick three lines $L_1$,$L_2$,$L_3$ which do not have a common point of intersection. Compute the sets $X_i:=L_i\cap C$.
If $X_i = L_i$ for any $i$, you are done: $C$ is reducible.
In practice, I would probably always pick \begin{align*} L_1 &= [1:\Bbb C:0] & L_2 &= [1:0:\Bbb C] & L_3 &= [0:1:\Bbb C] \\ f_{L_1} &= f(1,T,0) & f_{L_2} &= f(1,0,T) & f_{L_3} &= f(0,1,T) \end{align*}