Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

Resultant of two plane forms, viewed in one variable

Definition

Let k be a field and let F,G∈k[x0,x1,x2] be nonzero homogeneous forms of positive total degrees d,e homogeneous polynomial and homogeneous ideal, Monomials, coefficients, degree in each variable and total degree in F[x1,…,xn]. Write F=∑i=0dai(x0,x1)x2i, G=∑i=0ebi(x0,x1)x2i. Over R=k[x0,x1] introduce auxiliary variables X,Y and homogenise with the nominated degrees:

HF(X,Y)=∑i=0daiXiYd−i,HG(X,Y)=∑i=0ebiXiYe−i.

Define the resultant eliminating x2 by

Res⁡x2(F,G):=Res⁡d,e(HF,HG)∈k[x0,x1],

using the Sylvester determinant and ordered bases of Sylvester resultant of two positive-degree binary forms. Thus HF(X,1)=F(x0,x1,X), but the nominations remain d,e even if the actual degrees in X drop.

The resultant is zero or homogeneous of total degree de in x0,x1. To see this, index matrix rows by the exponent r=0,…,d+e−1 of X in the target monomial, and index the F-columns by multiplier exponents j=0,…,e−1 and the G-columns by j=0,…,d−1. An F-entry is ar−j of degree d−r+j and a G-entry is br−j of degree e−r+j. Every nonzero determinant term therefore has total degree

ed+de+e(e−1)2+d(d−1)2−(d+e−1)(d+e)2=de.

Specialisation. Coefficient specialisation sends the determinant to the determinant of HF(a,b;X,Y) and HG(a,b;X,Y), for any (a,b)≠(0,0) Scaling, specialization, and the affine and infinite charts of a binary resultant. Over an algebraically closed extension, its vanishing detects a common projective root of these binary forms The binary Sylvester resultant detects a common geometric projective root. Such a root is either [c:1], with F(a,b,c)=G(a,b,c)=0, or [1:0], when both coefficients ad,be vanish. Consequently the value need not detect a finite root when both leading coefficients vanish. The later detection lemma excludes that case by assuming [0:0:1] lies on neither curve.

Remarks

  • The elimination coordinate is fixed; the resultant polynomial depends on it. The underlying projective curves do not depend on a choice of coordinates.
  • The scaling rule gives Res⁡x2(uF,vG)=uevdRes⁡x2(F,G) for u,v∈k Scaling, specialization, and the affine and infinite charts of a binary resultant. In particular it is not a scalar-independent function of the curves.

Depends on

Used by

Dependency tree · two levels

30 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