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.
Sylvester resultant of two positive-degree binary forms
Definition
Let be a commutative ring (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution) and let . For let be the -module of homogeneous polynomials of total degree in , with the ordered basis
Fix homogeneous elements and of the nominated degrees and ; the zero polynomial is allowed, and it is homogeneous of every degree. The Sylvester resultant is the determinant (For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix) of the -linear map in the ordered bases above: the basis vectors of the -block are listed first, then the basis vectors of the -block . The target has basis vectors, so the matrix is square.
Since and have no constant term when they are nonzero and positive degree, the map is well defined and -linear, and no hypothesis on the leading coefficients of or is imposed. For two linear forms and the definition gives , because and are the two matrix columns.
The degrees belong to the data: if the coefficient of in vanishes, then is still read off the degree- Sylvester matrix. In particular dehomogenising to and never replaces or by the actual degrees of or .
Depends on
Used by
- A binary resultant detects a common root at infinity lost by naive dehomogenization Example
- Resultant of two binary linear forms Example
- Scaling, specialization, and the affine and infinite charts of a binary resultant Lemma
- The binary Sylvester resultant detects a common geometric projective root Theorem
Dependency tree · two levels
12 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
- J. S. Milne, Algebraic Geometry v6.10, elimination theory, p. 166 (standard reference, not scraped)