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.
Pullback of a Cartier divisor
Definition
Let be a morphism of schemes. Write and for the sheaves of meromorphic functions (Sheaf total quotient rings), so that over an open the value is the sheafification at of , where consists of the sections of that are nonzerodivisors at every stalk of . The structure maps and are injective. Call a section of over an open regular when its germ at every point of that open is a nonzerodivisor; these are exactly the elements of . A Cartier divisor on is a global section of (Cartier divisor).
Pullback of meromorphic functions. We say that pullbacks of meromorphic functions are defined for if for all opens and with the ring homomorphism carries regular sections of to regular sections of , that is, . In that case the universal property of localisation turns into ring homomorphisms , compatible with restriction; these assemble into a morphism of presheaves , where , and sheafifying gives a morphism of sheaves of rings the pullback map on meromorphic functions. Since ring homomorphisms carry units to units, it restricts to a morphism of sheaves of abelian groups , and it carries into .
Pullback of a Cartier divisor. Let be represented by a local-equation datum , so the cover , each is a meromorphic unit, and for all (Cartier divisor). Because is the sheafification of , after refining the cover we may assume that each is the image of an element with and ; the refinement changes neither the datum nor the divisor. Say that the datum is -admissible when Since is regular, its image in is a unit, so is a unit of automatically once the representation exists. We say that the pullback is defined if admits an -admissible local-equation datum on some open cover of .
In that case, on the two sections and are regular, so is a unit of , hence a unit of ; we denote it by . On an overlap the ratio is a unit of , and multiplying the identity by and using that are the images of and gives that the function has image in ; since is injective, this function is , so in . Applying and dividing by the regular sections gives in , and is a unit of ; hence is a unit of . Therefore the family is a local-equation datum on and determines a Cartier divisor (Cartier divisor); we define to be that divisor.
This is well defined. Indeed, if are two representations with all four pullbacks regular, then multiplying by shows that the function has image in , hence is ; applying and dividing by the regular sections gives in . Similarly, if two -admissible data represent the same and on a common refinement their equations satisfy with , the same clearing-denominators argument gives with a unit of , so the two resulting local-equation data determine the same Cartier divisor after refinement. In particular is independent of the chosen -admissible datum, and restriction of an admissible datum to a refinement is again admissible with the same pullback.
Effective divisors. Suppose is effective, with local regular equations (Effective cartier divisor); choose the representation with numerator and denominator . Then the datum is -admissible exactly when each pulled-back regular equation is again regular on , and in that case is the effective Cartier divisor cut out locally by the equations . If the pullback of an effective is defined through some other representation of with regular pullbacks, then in by the clearing-denominators argument, so with both factors on the right regular, and hence is regular and is effective. Thus for effective the assertion " is defined" is equivalent to the regularity of the pulled-back regular equations.
Flat morphisms. If is flat (Flat morphism of schemes), then pullbacks of meromorphic functions are defined for and every Cartier divisor on has a defined pullback. Indeed, let , , and let for an open . Flatness at says that is a flat -module; tensoring the injective multiplication map with over therefore gives the injective map , so the germ is a nonzerodivisor. As was arbitrary, is regular. Hence for all , every local-equation datum is -admissible (regularity of the numerator is automatic as recalled above), and is defined on all of ; this is the flat case of the source's list of sufficient conditions. When pullbacks of meromorphic functions are defined for in the sense above, the map descends to and recovers the same pullback of every Cartier divisor.
Boundary cases. The zero Cartier divisor is represented by the equation ; its pullback is represented by and is the zero divisor, so it is defined for every morphism . If then and the only pullback is ; if then every local-equation datum is -admissible vacuously and is the unique Cartier divisor of the empty scheme. The sign convention is that of Cartier divisor: zeros of the pulled-back equations are recorded with positive coefficients, poles with negative ones.
Depends on
Used by
- Finite morphisms from a curve to the projective line Corollary
- A torsion-only extension of the canonical formula fails for Frobenius Counterexample
- Pulling back the equation of a Weil divisor can give zero Counterexample
- Pulling a divisor back along the cusp normalization Example
- Fibres, pullbacks and degrees of divisors under a finite morphism of curves Lemma
- Pullback of a Cartier divisor computes the pullback of its line bundle Lemma
- Weil pullback not automatic Remark
- Canonical bundle formula with the different Theorem
- Line bundles of degree at least 2g are base-point-free Theorem
- Line bundles of degree at least 2g+1 are very ample Theorem
Dependency tree · two levels
28 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
- The Stacks Project, Divisors, §31.14 Definition 14.12 and Lemma 14.13, §31.24 Definitions 24.1, 24.4 and Lemma 24.5 (standard reference, not scraped)
- Ravi Vakil, The Rising Sea, Ch. 15 §§15.2–15.3 (standard reference, not scraped)