For a complex reduced plane curve of degree , the number of distinct singular points is at most . For an irreducible polynomial of degree , is nonzero, since a binary homogeneous polynomial over factors into linear factors. It has no common factor with . Each singular point contributes at least two to the intersection with the polar curve , so Bézout's theorem gives .
For an irreducible curve with , one can improve this to . Place a nonsingular point at . The Euler theorem for homogeneous functions gives and , so the polar curve is nonsingular and tangent to the curve at . This consumes at least two further units of intersection multiplicity. For a reducible curve with component degrees , add the irreducible bounds and at most intersections per component pair. The sum is because .

Articles by others on the same topic (0)

There are currently no matching articles.