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?