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 be any field, let be any algebraic closure of (An algebraic closure of a field), and let be homogeneous forms of nominated positive degrees , including the zero forms. Then in if and only if and vanish together at some point of (projective space points).
No -rational common point is asserted, and is supplied by hypothesis rather than constructed here.
Facts & Assumptions
Given: A field , an algebraic closure of , integers , homogeneous forms of nominated degrees (zero forms allowed), and the ordered monomial bases of the resultant definition.
is the determinant of the matrix of the map from to in the ordered descending monomial bases, with the -block basis vectors first; domain and target therefore both have dimension (Sylvester resultant of two positive-degree binary forms).
The resultant commutes with coefficientwise application of every unital ring homomorphism between commutative rings, and over a field with algebraically closed extension the common zeros in of forms of nominated positive degrees are exactly the points with , together with when the -coefficient of and the -coefficient of both vanish, the zero forms included (Scaling, specialization, and the affine and infinite charts of a binary resultant).
is a field extension of and is algebraically closed (An algebraic closure of a field), so every nonconstant polynomial over has a root in (An algebraically closed field: every nonconstant polynomial has a root in the field).
For commutative rings and every unital ring homomorphism and every there is a unique unital ring homomorphism extending it with , sending to (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
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 ; it is an integral domain, and it is a commutative division ring).
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 ().
A linear map is injective if and only if its kernel is (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 (Rank-nullity: ); and a subspace of a finite-dimensional satisfies if and only if (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
Over a commutative ring, if and only if divides (Factor theorem over a commutative ring); and for over a field, not both zero, there are with , the monic gcd, which divides both and (Bézout identity and the Euclidean algorithm for polynomials over a field).
If is an integral domain then is an integral domain (A polynomial ring over an integral domain is an integral domain), and for nonzero over a domain (Over an integral domain, degrees add under multiplication of nonzero polynomials).
Proof
The inclusion is a unital ring homomorphism, and an element of the field is zero exactly when its image in is zero, so in if and only if its image in is zero; by the specialization clause of [L2] that image is , where are the coefficientwise images, that is, the same forms viewed over , homogeneous of the same nominated degrees. Evaluating and at a point of gives the same field elements as evaluating and , so also the common-zero condition is unchanged. Hence it suffices to prove the equivalence for forms over the algebraically closed field , and from here on we work over .
For let be the substitution , a -linear map by [L4]. It carries the ordered monomial basis to the ordered list , and it is bijective onto the polynomials of degree , with two-sided inverse ; it is also multiplicative in the sense . Writing and , of degrees and , the map from to (polynomials in of the indicated degree bounds) has, in the bases transported by , exactly the matrix of the resultant map ; hence by [L1].
By [L6] the coordinates of are times the coordinates of ; coordinates are unique, so is bijective if and only if the multiplication map on column vectors is bijective, which by [L6] holds if and only if is invertible. By [L5] and the fact that is a field, is invertible if and only if . Since domain and target of both have dimension by [L1], [L7] gives that is bijective if and only if is injective. Chaining these equivalences, if and only if is not injective.
Suppose that and have a common root ; if every qualifies, and then is the zero map on a nonzero space by [L1], so it is not injective. Otherwise, by [L8] there are with and , where if and if ; by [L9] and , we get and . Then lies in and is nonzero, because if then by [L9], and if then and by [L9]; and . So is not injective.
Suppose that and have no common root in , that they are not both zero, and that or . By [L8] take with ; the gcd is monic and divides both and . If the gcd were not , it would be nonconstant, hence by [L3] would have a root , and by [L8] applied to the divisibility that would be a common root of and ; so the gcd is and . Now let . Multiplying by gives , so divides ; since and, when , a nonzero multiple would have by [L9], we get in that case. Symmetrically, multiplying by gives , so divides ; since and, when , a nonzero multiple would have by [L9], we get in that case. At least one of the two cases holds. If both cases hold, the two conclusions just displayed give . If only holds, then and therefore , which forces because is a domain by [L9] and ; if only holds, the same argument with the roles of and interchanged gives , and then forces because . Hence and is injective.
Suppose the -coefficient of and the -coefficient of both vanish. In the homogeneous expansion only the pure terms and avoid a factor , so divides and divides ; write and with homogeneous of degrees and (the zero polynomials allowed). Then and , so : if this displays a nonzero kernel vector because or is nonzero, and if then is the zero map on a nonzero space by [L1]. Either way is not injective, so by 1.3; and conversely is a common zero of and in 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.
Suppose now that the -coefficient of or the -coefficient of is nonzero, so that or and are not both zero. If and have a common root in , then by 1.4 and 1.3; if they do not, then is injective by 1.5 and by 1.3. Hence if and only if have a common root in , and by the chart clause of [L2] the common roots of and are exactly the affine common zeros , the point being excluded because it is a common zero only when both top coefficients vanish, which is not the case here. So if and only if and vanish together at a point of .
Every pair satisfies the hypothesis of 2.2 or the hypothesis of 2.1, and in both cases is equivalent to the existence of a common zero in , which proves the equivalence over the algebraically closed field ; undoing the coefficient extension of 1.1 gives the equivalence over the original field . No -rational point was produced anywhere: the points obtained are points of over the supplied algebraic closure.
Depends on
- Sylvester resultant of two positive-degree binary forms
- Scaling, specialization, and the affine and infinite charts of a binary resultant
- An algebraic closure of a field
- An algebraically closed field: every nonconstant polynomial has a root in the field
- projective space points
- Universal property of $R[x]$: a coefficient homomorphism and the image of $x$ determine a unique ring homomorphism
- A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit
- Every field is a commutative ring with $1 \ne 0$; it is an integral domain, and it is a commutative division ring
- A square matrix is invertible exactly when its multiplication map is a linear isomorphism; matrices preserve inverses of linear isomorphisms
- $[T(v)]_{\mathcal C}=[T]_{\mathcal B}^{\mathcal C}[v]_{\mathcal B}$
- The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- Factor theorem over a commutative ring
- Bézout identity and the Euclidean algorithm for polynomials over a field
- A polynomial ring over an integral domain is an integral domain
- Over an integral domain, degrees add under multiplication of nonzero polynomials
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
- J. S. Milne, Algebraic Geometry v6.10, Proposition 7.28, p. 167 (standard reference, not scraped)