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.
Effective divisors have nonnegative degree
Statement
Let be a field and let be a proper geometrically integral curve over . Let be an effective divisor on . Then is a nonnegative integer, and if and only if . The residue field of every closed point is a finite extension of , so each degree is at least one.
Facts & Assumptions
Given: A field , a proper geometrically integral curve over , and an effective divisor on .
A curve over is geometrically integral, separated and of finite type of chain dimension one; a proper curve over is in particular an integral -scheme whose structure morphism is proper and whose underlying space has chain dimension one, hence of dimension one. (Curves over a field, Degree divisor proper curve)
A divisor on the proper curve is a finite formal sum over the closed points of with integer coefficients all but finitely many of which vanish; for each closed point the residue field is a finite extension of , and the degree is , a group homomorphism . (Degree divisor proper curve)
The support, positive part and negative part of are defined by , and , so that ; all coefficients of and are nonnegative, their supports are disjoint, and is effective if and only if . (Divisor support positive negative parts)
A divisor on a smooth proper geometrically integral curve over is a finite -linear combination of closed points, its degree is over the finite support, with finite, and is effective, written , when for every . (Divisors on a smooth proper curve)
Proof
Unwinding hypotheses. By [F2] the divisor has finite support, so the sum in the definition of is a finite sum over the finite set . By [F3] effectiveness of means for every .
Residue degrees are positive. For each closed point of the residue field is a finite extension of [F2], and the structure map is injective with image a subfield, so ; being finite over , that dimension is an integer at least one. Therefore for every .
Nonnegativity. Every summand of is a product of the nonnegative integer from step 1.1 and the positive integer from step 1.2, hence is nonnegative; the sum is finite by step 1.1, so .
Vanishing. If then all coefficients vanish and is the empty sum ; conversely if while is effective, then step 2.1 exhibits as a sum of finitely many nonnegative terms, so every summand vanishes, and since each by step 1.2 we get for all ; hence .
Conclusion. For an effective divisor on a proper geometrically integral curve over the degree is a nonnegative integer by step 2.1, and it vanishes exactly when is the zero divisor by step 3.1. The claim was stated for the proper curve , whose underlying space has dimension one by [F1], so the residue fields entering the sum are those of the closed points as in [F2] and the alternative smooth-case description of [F4] is not needed here. ∎
Depends on
Used by
- A degree-zero line bundle with a nonzero section is trivial Corollary
- No sections in negative degree Corollary
- A nontrivial degree-zero line bundle has no nonzero section Counterexample
- Adding points never raises h¹, and h¹ stabilizes Lemma
- An effective divisor of degree zero is empty Lemma
- Euler characteristic changes by the residue degree Lemma
- Every divisor is a finite signed sum of points Lemma
- The exact sequence for adding one point to a divisor Lemma
- Negative-degree line bundles have no nonzero sections Theorem
Dependency tree · two levels
27 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
- William Fulton, Algebraic Curves (Internet Archive copy), Chs. 6-8 (standard reference, not scraped)
- The Stacks Project, Algebraic Curves (tag 0BRV) (standard reference, not scraped)