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 be a field and let be nonzero homogeneous forms of positive total degrees homogeneous polynomial and homogeneous ideal, Monomials, coefficients, degree in each variable and total degree in . Write , . Over introduce auxiliary variables and homogenise with the nominated degrees:
Define the resultant eliminating by
using the Sylvester determinant and ordered bases of Sylvester resultant of two positive-degree binary forms. Thus , but the nominations remain even if the actual degrees in drop.
The resultant is zero or homogeneous of total degree in . To see this, index matrix rows by the exponent of in the target monomial, and index the -columns by multiplier exponents and the -columns by . An -entry is of degree and a -entry is of degree . Every nonzero determinant term therefore has total degree
Specialisation. Coefficient specialisation sends the determinant to the determinant of and , for any 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 , with , or , when both coefficients vanish. Consequently the value need not detect a finite root when both leading coefficients vanish. The later detection lemma excludes that case by assuming 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 for 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
- homogeneous polynomial and homogeneous ideal
- Monomials, coefficients, degree in each variable and total degree in $F[x_1,\dots,x_n]$
- Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree
- Sylvester resultant of two positive-degree binary forms
- Scaling, specialization, and the affine and infinite charts of a binary resultant
- The binary Sylvester resultant detects a common geometric projective root
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
- Michael Artin, MIT 18.721 Notes for a Course in Algebraic Geometry (January 26, 2022 version), Chapter 1 (standard reference, not scraped)
- Andreas Gathmann, Algebraic Geometry class notes (2002), Sections 6.1-6.2 (standard reference, not scraped)