Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Principal cartier divisor

Definition

Let X be a scheme. For a global meromorphic unit f∈Γ(X,KX×), its principal Cartier divisor is div⁡C(f):=qX(f)∈CaDiv⁡(X), where qX is the global-section map induced by the quotient sheaf KX×→KX×/OX× (Cartier divisor). Equivalently, use the single local equation f on the open set X.

We use additive notation for Cartier divisors, even though their local equations multiply. The quotient map is a group homomorphism, so div⁡C(fg)=div⁡C(f)+div⁡C(g), div⁡C(1)=0, and div⁡C(f−1)=−div⁡C(f). In particular, principal Cartier divisors form a subgroup of CaDiv⁡(X). Multiplying f by a global regular unit leaves its divisor unchanged, since that unit has zero image in the quotient sheaf.

The sign convention is zeros positive, poles negative: a regular local equation cutting out a zero contributes positively; replacing it by its inverse reverses the sign. This is the convention of Cartier divisor, without asserting that a numerical order exists at every point of an arbitrary scheme.

On the empty scheme the groups of units and of Cartier divisors are trivial, so this definition gives only the zero divisor.

Depends on

Used by

Dependency tree · two levels

5 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