Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedaudited 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 divisors on the projective line have degree zero

Example

Assume the Axiom of Choice, inherited from the properness of projective space. Let k be a field and let p,q∈k[t] be coprime monic polynomials of degrees m and n. On the projective line Pk1, with affine coordinate t on U0=Spec⁡k[t] and point at infinity ∞=V(u) in U∞=Spec⁡k[u], u=1/t, the rational function f=p(t)/q(t)∈k(t)× has principal divisor div⁡(f)=∑iai[ri]−∑jbj[sj]+(n−m)[∞], where p=∏iriai and q=∏jsjbj are the factorisations into monic irreducibles: the only nonzero coefficients away from infinity come from the zeros and poles of p and q. Its degree is deg⁡kdiv⁡(f)=m−n+(n−m)=0, so on Pk1 every principal divisor has degree zero, computed here directly from the factorisations without invoking the general degree-zero theorem.

Facts & Assumptions

Given: the Axiom of Choice, a field k, the two-affine projective line Pk1 with charts U0=Spec⁡k[t] and U∞=Spec⁡k[u] glued along tu=1, the point ∞=V(u), coprime monic polynomials p,q∈k[t] of degrees m,n, and f=p(t)/q(t)∈k(t)×.

[F1]

Under the Axiom of Choice, Pk1 is obtained by gluing the two affine schemes Spec⁡k[t] and Spec⁡k[u] along their basic opens D(t) and D(u), identified through t↦u−1 and u↦t−1; the two charts are open subschemes covering Pk1, their overlap is D(t)≅D(u), and the coordinate functions are mutually inverse units on the overlap (Two-affine projective line and its twists).

[F2]

Points of an affine scheme Spec⁡A correspond to prime ideals of A, and the structure-sheaf stalk at the point p is the localisation Ap (The underlying space of an affine spectrum, Affine schemes and their coordinate rings, The stalk of the affine structure sheaf at a prime is A_p).

[F3]

A field has exactly the two ideals (0) and (1), hence is a Noetherian ring; by Hilbert's basis theorem k[t] and k[u] are Noetherian (Field, Left and right Noetherian rings, Hilbert basis theorem: if R is Noetherian then R[x] is Noetherian).

[F4]

k[t] and k[u] are integrally closed domains (Finite-variable polynomial algebras over fields are integrally closed) and dim⁡k[t]=dim⁡k[u]=1 (A polynomial ring in n variables over a field has dimension n); for a prime p the localisation Ap is local with maximal ideal pAp and dimension ht⁡(p) (Localisation at a prime ideal: Rp=(R∖p)−1R, The height of a prime ideal, Krull dimension of a nonzero ring). A scheme whose local rings are integrally closed domains and which has a finite affine open cover by spectra of Noetherian rings is a normal Noetherian scheme (Weil divisor normal noetherian scheme, Integral closure in an extension ring and integrally closed domains).

[F5]

Pk1 is an integral k-scheme of finite type; for its generic point η and every nonempty affine open U, the function field K(Pk1)=OPk1,η is canonically isomorphic to Frac⁡Γ(U,O), and k(t)=k(u) with t=u−1 (Function field of an integral finite-type scheme, Integral schemes, Locally finite type and finite type morphisms, The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain).

[F6]

Assume the Axiom of Choice. For every scheme S and n≥0 the structure morphism PSn→S is proper (Finite-dimensional projective space is proper over every base, Proper morphisms, The Axiom of Choice); consequently Pk1 is an integral proper k-scheme of chain dimension one, i.e. a proper curve over k, and its divisors are the finite formal sums of closed points with deg⁡k(∑xnx[x])=∑xnx[κ(x):k] (Degree divisor proper curve, Chain dimension and the empty-space convention).

[F7]

Let X be a normal Noetherian integral scheme and f∈Γ(X,KX×) a global meromorphic unit. For a prime divisor Z with generic point ξ the local ring OX,ξ is a discrete valuation ring with fraction field K(X), and ord⁡Z(f)=vξ(fξ), where vξ is the normalised valuation, vξ(π)=1 for an element generating the maximal ideal, and units have valuation 0; the order is additive and ord⁡Z(f−1)=−ord⁡Z(f). The principal divisor is the locally finite Weil sum div⁡(f)=∑Zord⁡Z(f)[Z] (Order codimension one rational function, Discrete valuation rings, Discrete valuations, Equivalent characterizations of a DVR, Weil divisor normal noetherian scheme).

[F8]

In the unique factorisation domain k[t] every nonzero nonunit is a unit multiple of a finite product of irreducibles, uniquely up to order and associates; the units are the nonzero constants, and an irreducible element generates a prime ideal (Unique factorisation domain, For every field F, F[x] is a unique factorisation domain, Irreducible and prime elements of an integral domain).

[F9]

For a closed point x of the affine scheme Spec⁡k[t] the residue field is κ(x)=k[t]/mx; for x=[r]=V(r) attached to a monic irreducible r of degree e this is the field k[t]/(r) of k-dimension e, and for ∞=V(u) the residue field is k[u]/(u)≅k (The residue field at a point of an affine scheme, A maximal ideal of an affine algebra has finite residue field over the base field).

Verification

Proof technique: factor p and q, read off the orders at the finitely many points they determine and at infinity, and sum the weighted degrees.

1.1F1F2

Charts and points. By [F1], Pk1=U0∪U∞, the overlap D(t)⊆U0 is identified with D(u)⊆U∞, and tu=1 on it; every point of Pk1 other than ∞=(u) lies in U0 and corresponds to a prime p⊆k[t] with OPk1,x=k[t]p. Since (u)⊆k[u] is maximal with k[u]/(u)≅k, every prime of k[u] containing u equals (u); hence U∞∖{∞}=D(u)=U0∩U∞.

1.2F1F3F4F5

Integrality, normality, function field, dimension. Pk1 is an integral finite-type k-scheme of chain dimension one, every local ring of it is an integrally closed domain, and its function field is k(t)=k(u) with t=u−1. U0 and U∞ are integral and glued along the nonempty open D(t)≅D(u), so Pk1 is integral, and finite type over k because its affine charts are. Localisations of integrally closed domains are integrally closed: if x∈Frac⁡(A) is integral over S−1A with monic equation xn+∑i<n(ai/si)xi=0, then with s=∏i<nsi the element sx satisfies the monic equation (sx)n+∑i<nai(sn−i/si)(sx)i=0 over A, so sx∈A and x∈S−1A. Hence every local ring is an integrally closed domain and Pk1 is a normal Noetherian scheme [F4]; by [F5] its function field is k(t)=k(u). For the dimension, U0=Spec⁡k[t] is a Noetherian space of chain dimension dim⁡k[t]=1 whose proper closed subsets are finite unions of points; since U0 is dense in Pk1, the only proper irreducible closed subsets of Pk1 are the points, so its chain dimension is one (Chain dimension and the empty-space convention).

1.3F8

Factorisations and the degree count. p=∏iriai and q=∏jsjbj with pairwise distinct monic irreducibles ri and sj, no ri equal to any sj, and m=∑iaideg⁡ri, n=∑jbjdeg⁡sj. The monic polynomial p factors as a product of monic irreducibles: a factorisation p=c∏riai has leading coefficient c∏(leading coefficients)=c if each ri is monic, so c=1; the same holds for q. Coprimality of p and q says no monic irreducible divides both, so the two families are disjoint. Degrees add: m=deg⁡p=∑iaideg⁡ri and n=deg⁡q=∑jbjdeg⁡sj.

1.4F7F91.11.3

Orders at the finite points. For every monic irreducible r∈k[t], ord⁡[r](f) equals ai if r=ri, equals −bj if r=sj, and is 0 otherwise. Let r be monic irreducible and p=(r). The local ring OPk1,[r]=k[t]p is a one-dimensional local domain [F4] and hence a discrete valuation ring whose maximal ideal is generated by the uniformiser r [F7]. If r=ri then ri∣p and ri∤q, so q is a unit of k[t]p and additivity gives ord⁡[r](f)=ai⋅1−0=ai; if r=sj then p is a unit and q=rbj⋅(unit), giving ord⁡[r](f)=−bj; and if r divides neither p nor q, both are units and the order is 0.

1.5F71.21.3

Order at infinity. ord⁡∞(p)=−m, ord⁡∞(q)=−n, and hence ord⁡∞(f)=n−m. On U∞ one has t=u−1, so for a monic polynomial g(t)=td+cd−1td−1+⋯+c0 of degree d, g=u−d(1+cd−1u+⋯+c0ud) with the second factor equal to 1 at u=0, hence a unit of k[u](u)=OPk1,∞; with the uniformiser u this gives ord⁡∞(g)=−d. Applying this to p and q and using additivity yields ord⁡∞(f)=(−m)−(−n)=n−m.

1.6F6F71.41.5

The divisor. div⁡(f)=∑iai[ri]−∑jbj[sj]+(n−m)[∞], a finite Weil sum, and all its terms are closed points, so it is an element of Div⁡(Pk1). By steps 1.4 and 1.5 these are exactly the nonzero orders of f at prime divisors; the remaining prime divisors have order zero. The support is finite, so the locally finite sum of [F7] is this finite sum, and since Pk1 has chain dimension one its prime divisors are closed points [F6].

1.7F6F91.31.51.6

Degree. deg⁡kdiv⁡(f)=∑iaideg⁡ri−∑jbjdeg⁡sj+(n−m)=m−n+(n−m)=0. By step 1.3 the finite terms have total degree ∑iaideg⁡ri−∑jbjdeg⁡sj=m−n, by [F9] the residue degree of [r] is [κ([r]):k]=deg⁡r and [κ(∞):k]=1, and by [F6] the degree is additive over the coefficients; adding the coefficient ord⁡∞(f)=n−m of step 1.5 gives m−n+(n−m)=0.

2.1F1F61.61.7∎

Conclusion. On Pk1 the principal divisor of f=p/q is ∑iai[ri]−∑jbj[sj]+(n−m)[∞] and has degree zero; the Axiom of Choice is inherited from the two-affine projective-line construction [F1] and the properness theorem [F6]. The finite factorisation and valuation computation make no further choice.

Every nonzero rational function in k(t) is cp/q with c∈k× and coprime monic p,q. The constant c is a unit at every point, so its orders vanish and the computation applies to every principal divisor.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

127 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