Coprime polynomials 2026-10-06
Two polynomials over a field are coprime if their only common factors are nonzero constants. Equivalently, their greatest common divisor is a unit in the polynomial ring. In one variable this is equivalent to a Bezout identity with polynomial coefficients. Independent members of a pencil spanned by coprime polynomials are themselves coprime.
An elliptic curve in characteristic zero admits no nonconstant rational map of projective varieties from the projective line. Over , write its equation as with distinct . Substituting with coprime polynomials gives . These four pairwise coprime factors must all be squares. The polynomial pencil with four square members forces constant, ruling out a nonconstant rational parametrization of an algebraic curve.
Here is an elementary polynomial pencil with four square members argument. Suppose first that are linearly dependent. Their coprimality of polynomials then forces both to be constant. Otherwise write the four distinct members as . They are nonzero and pairwise coprime polynomials: a common nonconstant factor of two members would divide both and .
Put . At most one member of the pencil has degree of a polynomial smaller than , since cancellation of its leading coefficient determines a unique projective pair. Choose a member of minimal degree and any independent member of degree . The polynomial
is nonzero: otherwise the rational function would have zero derivative, hence would be constant in characteristic zero. Its degree is at most ; if both members have degree zero the original assumption has already failed.
Replacing this pair by any other independent pair changes only by a nonzero scalar. Since , each divides . The pairwise coprimality of polynomials therefore gives . But three members have degree , so
a contradiction. Consequently and are constant. The possibility that a member is zero was already covered by linear dependence.
To apply this to an elliptic curve, complete the square in its Weierstrass equation of an elliptic curve and work over . Nonsingularity gives three distinct roots , so the equation becomes . A nonconstant rational parametrization of an algebraic curve would have with coprime polynomials. Clearing denominators gives
The four factors are pairwise coprime polynomials. A rational function whose square is a polynomial is itself a polynomial, by comparing numerator and denominator in lowest terms. Unique factorization, and the fact that every nonzero complex constant has a square root, make each of these four factors a square in . They correspond to four distinct projective pairs. The result just proved forces to be constant, and the equation then forces to be constant as well. This proves the nonparametrizability of an elliptic curve.
Let be coprime polynomials. If is a square for four distinct , then are constant. For independent , the four square members are pairwise coprime polynomials. Let and be their maximal and minimal degrees; at least three have degree . For independent members of degrees , the nonzero polynomial has degree at most . Each divides , giving , a contradiction. The dependent case follows directly from coprimality of polynomials.