Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The binary Sylvester resultant detects a common geometric projective root

Statement

Let k be any field, let K be any algebraic closure of k (An algebraic closure of a field), and let F,G∈k[X,Y] be homogeneous forms of nominated positive degrees d,e, including the zero forms. Then Res⁡d,e(F,G)=0 in k if and only if F and G vanish together at some point of P1(K) (projective space points).

No k-rational common point is asserted, and K is supplied by hypothesis rather than constructed here.

Facts & Assumptions

Given: A field k, an algebraic closure K of k, integers d,e≥1, homogeneous forms F,G∈k[X,Y] of nominated degrees d,e (zero forms allowed), and the ordered monomial bases of the resultant definition.

[L1]

Res⁡d,e(F,G) is the determinant of the matrix M of the map (A,B)↦AF+BG from k[X,Y]e−1⊕k[X,Y]d−1 to k[X,Y]d+e−1 in the ordered descending monomial bases, with the e F-block basis vectors first; domain and target therefore both have dimension d+e (Sylvester resultant of two positive-degree binary forms).

[L2]

The resultant commutes with coefficientwise application of every unital ring homomorphism between commutative rings, and over a field k with algebraically closed extension K the common zeros in P1(K) of forms of nominated positive degrees are exactly the points [a:1] with F(a,1)=G(a,1)=0, together with [1:0] when the Xd-coefficient of F and the Xe-coefficient of G both vanish, the zero forms included (Scaling, specialization, and the affine and infinite charts of a binary resultant).

[L3]

K is a field extension of k and is algebraically closed (An algebraic closure of a field), so every nonconstant polynomial over K has a root in K (An algebraically closed field: every nonconstant polynomial has a root in the field).

[L4]

For commutative rings R,S and every unital ring homomorphism R→S and every s∈S there is a unique unital ring homomorphism R[x]→S extending it with x↦s, sending ∑iaixi to ∑iφ(ai)si (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism).

[L5]

A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit (A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit), and the units of a field are exactly its nonzero elements (Every field is a commutative ring with 1≠0; it is an integral domain, and it is a commutative division ring).

[L6]

A square matrix over a field is invertible exactly when its multiplication map is a linear isomorphism (A square matrix is invertible exactly when its multiplication map is a linear isomorphism; matrices preserve inverses of linear isomorphisms), and in ordered bases a linear map acts on coordinates by [T(v)]C=[T]BC[v]B ([T(v)]C=[T]BC[v]B).

[L7]

A linear map is injective if and only if its kernel is {0} (The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial); for a linear map on a finite-dimensional space dim⁡V=dim⁡ker⁡T+dim⁡im⁡T (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T); and a subspace U of a finite-dimensional V satisfies dim⁡U=dim⁡V if and only if U=V (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

[L8]

Over a commutative ring, f(a)=0 if and only if x−a divides f (Factor theorem over a commutative ring); and for f,g over a field, not both zero, there are A,B with Af+Bg=gcd⁡(f,g), the monic gcd, which divides both f and g (Bézout identity and the Euclidean algorithm for polynomials over a field).

[L9]

If R is an integral domain then R[x] is an integral domain (A polynomial ring over an integral domain is an integral domain), and for nonzero f,g∈R[x] over a domain deg⁡(fg)=deg⁡f+deg⁡g (Over an integral domain, degrees add under multiplication of nonzero polynomials).

Proof

technique · direct
1.1

The inclusion k→K is a unital ring homomorphism, and an element of the field k is zero exactly when its image in K is zero, so Res⁡d,e(F,G)=0 in k if and only if its image in K is zero; by the specialization clause of [L2] that image is Res⁡d,e(FK,GK), where FK,GK∈K[X,Y] are the coefficientwise images, that is, the same forms viewed over K, homogeneous of the same nominated degrees. Evaluating F and G at a point of P1(K) gives the same field elements as evaluating FK and GK, so also the common-zero condition is unchanged. Hence it suffices to prove the equivalence for forms over the algebraically closed field K, and from here on we work over K.

L2L3suffices
1.2

For m≥0 let δm ⁣:K[X,Y]m→K[T] be the substitution H↦H(T,1), a K-linear map by [L4]. It carries the ordered monomial basis Xm,Xm−1Y,…,Ym to the ordered list Tm,Tm−1,…,1, and it is bijective onto the polynomials of degree ≤m, with two-sided inverse p(T)↦Ymp(X/Y); it is also multiplicative in the sense δm+n(HH′)=δm(H)δn(H′). Writing f:=δd(F) and g:=δe(G), of degrees ≤d and ≤e, the map Ψ ⁣:(u,v)↦uf+vg from P≤e−1⊕P≤d−1 to P≤d+e−1 (polynomials in K[T] of the indicated degree bounds) has, in the bases transported by δ, exactly the matrix M of the resultant map (A,B)↦AF+BG; hence Res⁡d,e(F,G)=det⁡M by [L1].

L1L4algebra
1.3

By [L6] the coordinates of Ψ(u,v) are M times the coordinates of (u,v); coordinates are unique, so Ψ is bijective if and only if the multiplication map x↦Mx on column vectors is bijective, which by [L6] holds if and only if M is invertible. By [L5] and the fact that K is a field, M is invertible if and only if det⁡M≠0. Since domain and target of Ψ both have dimension d+e by [L1], [L7] gives that Ψ is bijective if and only if Ψ is injective. Chaining these equivalences, Res⁡d,e(F,G)=0 if and only if Ψ is not injective.

L1L5L6L7
1.4

Suppose that f and g have a common root α∈K; if f=g=0 every α qualifies, and then Ψ is the zero map on a nonzero space by [L1], so it is not injective. Otherwise, by [L8] there are f1,g1∈K[T] with f=(T−α)f1 and g=(T−α)g1, where f1=0 if f=0 and g1=0 if g=0; by [L9] and deg⁡f≤d, deg⁡g≤e we get deg⁡f1≤d−1 and deg⁡g1≤e−1. Then (g1,−f1) lies in P≤e−1⊕P≤d−1 and is nonzero, because if f≠0 then f1≠0 by [L9], and if f=0 then g≠0 and g1≠0 by [L9]; and Ψ(g1,−f1)=g1f−f1g=g1(T−α)f1−f1(T−α)g1=0. So Ψ is not injective.

L1L8L9algebra
1.5

Suppose that f and g have no common root in K, that they are not both zero, and that deg⁡f=d or deg⁡g=e. By [L8] take A,B with Af+Bg=gcd⁡(f,g); the gcd is monic and divides both f and g. If the gcd were not 1, it would be nonconstant, hence by [L3] would have a root α∈K, and by [L8] applied to the divisibility that α would be a common root of f and g; so the gcd is 1 and Af+Bg=1. Now let Ψ(u,v)=uf+vg=0. Multiplying 1=Af+Bg by v gives v=A(vf)+B(vg)=A(vf)−B(uf)=f(Av−Bu), so f divides v; since deg⁡v≤d−1 and, when deg⁡f=d, a nonzero multiple v=fw would have deg⁡v=d+deg⁡w≥d by [L9], we get v=0 in that case. Symmetrically, multiplying 1=Af+Bg by u gives u=g(Bu−Av), so g divides u; since deg⁡u≤e−1 and, when deg⁡g=e, a nonzero multiple u=gw would have deg⁡u=e+deg⁡w≥e by [L9], we get u=0 in that case. At least one of the two cases holds. If both cases hold, the two conclusions just displayed give u=v=0. If only deg⁡f=d holds, then v=0 and therefore Ψ(u,0)=uf=0, which forces u=0 because K[T] is a domain by [L9] and f≠0; if only deg⁡g=e holds, the same argument with the roles of f and g interchanged gives u=0, and then vg=0 forces v=0 because g≠0. Hence (u,v)=(0,0) and Ψ is injective.

L3L8L9cases: deg f=d or deg g=ealgebra
2.1

Suppose the Xd-coefficient of F and the Xe-coefficient of G both vanish. In the homogeneous expansion only the pure terms Xd and Xe avoid a factor Y, so Y divides F and Y divides G; write F=YF′ and G=YG′ with F′,G′ homogeneous of degrees d−1 and e−1 (the zero polynomials allowed). Then f=F′(T,1) and g=G′(T,1), so Ψ(G′(T,1),−F′(T,1))=G′(T,1)F′(T,1)−F′(T,1)G′(T,1)=0: if (F,G)≠(0,0) this displays a nonzero kernel vector because F′ or G′ is nonzero, and if F=G=0 then Ψ is the zero map on a nonzero space by [L1]. Either way Ψ is not injective, so Res⁡d,e(F,G)=0 by 1.3; and conversely [1:0] is a common zero of F and G in P1(K) by the chart clause of [L2], because the two top coefficients vanish. Thus in this case the resultant vanishes and a common projective zero exists.

L1L2step 1.3algebra
2.2

Suppose now that the Xd-coefficient of F or the Xe-coefficient of G is nonzero, so that deg⁡f=d or deg⁡g=e and f,g are not both zero. If f and g have a common root in K, then Res⁡d,e(F,G)=0 by 1.4 and 1.3; if they do not, then Ψ is injective by 1.5 and Res⁡d,e(F,G)≠0 by 1.3. Hence Res⁡d,e(F,G)=0 if and only if f,g have a common root in K, and by the chart clause of [L2] the common roots of f and g are exactly the affine common zeros [a:1], the point [1:0] being excluded because it is a common zero only when both top coefficients vanish, which is not the case here. So Res⁡d,e(F,G)=0 if and only if F and G vanish together at a point of P1(K).

L2step 1.3step 1.4step 1.5
3.1

Every pair (F,G) satisfies the hypothesis of 2.2 or the hypothesis of 2.1, and in both cases Res⁡d,e(F,G)=0 is equivalent to the existence of a common zero in P1(K), which proves the equivalence over the algebraically closed field K; undoing the coefficient extension of 1.1 gives the equivalence over the original field k. No k-rational point was produced anywhere: the points obtained are points of P1(K) over the supplied algebraic closure.

step 1.1step 2.1step 2.2∎

Depends on

Used by

Dependency tree · two levels

80 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources