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.

Degree divisor proper curve

Definition

Let k be a field. A proper curve over k is an integral k-scheme C (Integral schemes) whose structure morphism C→Spec⁡k is proper (Proper morphisms) and whose underlying topological space has chain dimension one (Chain dimension and the empty-space convention). Thus C is of finite type over k. No normality, regularity, projectivity, or smoothness is assumed.

For a closed point x∈C, its residue field κ(x) (The residue field at a point of an affine scheme) is finite over k. Indeed, choose an affine open neighborhood U=Spec⁡A of x (Affine schemes and their coordinate rings). Since C→Spec⁡k is of finite type, A is a finite-type k-algebra; the closed point x corresponds to a maximal ideal m⊂A, so κ(x)≅A/m is finite over k (A maximal ideal of an affine algebra has finite residue field over the base field). Write [κ(x):k]=dim⁡kκ(x).

We use divisor on C to mean a finite formal integral linear combination of closed points, D=∑x∈C closednx[x],nx∈Z, where only finitely many nx are nonzero. These divisors form the free abelian group Div⁡(C) on the closed points. Define the k-degree by deg⁡kD=∑x∈C closednx[κ(x):k]∈Z. This is well-defined because the support is finite, and coefficientwise addition makes deg⁡k:Div⁡(C)→Z a group homomorphism.

Depends on

Used by

…and 23 more results.

Dependency tree · two levels

22 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