Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Total transform equals strict transform plus multiplicity times the exceptional divisor

Statement

Assume the Axiom of Choice. Let S be a regular surface over a field k and let C⊆S be a reduced curve (an effective Cartier divisor) with a closed point p such that dim⁡OS,p=2, at which the multiplicity m=mult⁡p(C) of a local equation is finite and positive. Let π ⁣:S′→S be the blowup of the point p with exceptional curve E and let C′ be the strict transform of C. Then π∗C=C′+mE as effective Cartier divisors on S′; equivalently, the strict transform is defined by dividing a local equation of the total transform by the m-th power of an exceptional equation on each chart, and C′ meets E in the 0-cycle of degree m cut out by the degree-m leading form of a local equation of C at p (its degree over κ(p) is m; its degree over k is m[κ(p):k] when this residue degree is finite).

Facts & Assumptions

Given: A regular surface S over k, a reduced curve C⊆S that is an effective Cartier divisor, a closed point p∈S with dim⁡OS,p=2 at which a local equation f of C has finite positive multiplicity, the blowup π ⁣:S′→S of p, the exceptional curve E, and the strict transform C′ of C.

[A1]

Choice. The Axiom of Choice is assumed as inherited from the blowup and associated-graded constructions used below. (The Axiom of Choice).

[F1]

Total transform of a Cartier divisor: The total transform of an effective Cartier divisor is its effective Cartier pullback, with associated line bundle the pulled-back line bundle.

[F2]

Strict transform of a closed subscheme: The strict transform of a closed subscheme is the scheme-theoretic closure of the inverse image minus E; when the ideal of E is invertible on a chart, it is the closed subscheme defined by the saturation of the inverse-image ideal by the ideal of E.

[F3]

The pulled-back center ideal is the relative twist; the exceptional divisor is Cartier: The inverse image ideal of the blowup is invertible, and E=V(IOBl⁡) is an effective Cartier divisor cut locally by a generator of that ideal.

[F4]

Affine blowup algebras: normal form, nonzerodivisors, reducedness, domains: For a domain A and a≠0, the affine blowup algebra A[I/a] is a domain with I A[I/a]=a A[I/a].

[F5]

associated graded ring of a regular local ring: At the regular local ring A=OS,p of dimension two with regular parameters x,y, the associated graded ring is gr⁡mA=κ(p)[X,Y] with X,Y the initial classes of x,y.

[F6]

Cartier divisor local equation equivalence: Two effective Cartier divisors agree where their local equations differ by a unit; effective Cartier data are exactly principal ideals generated by regular sections.

[F7]

Affine blowup standard charts and overlaps: The blowup at p has the two charts Spec⁡A[y/x] and Spec⁡A[x/y], glued by inverting the ratio.

[F8]

Regular centers have projective-bundle exceptional divisors: At a closed point with two-dimensional regular local ring, the exceptional curve is Pκ(p)1. The quotient chart presentations are established directly in step 1.1.

[F9]

regular local rings are domains and cohen macaulay: The regular local ring A is a domain; its regular parameters x,y form a regular sequence, so x is a nonzerodivisor and y is a nonzerodivisor modulo x.

Proof

1.1A1F4F5F7F9

At p put A=OS,p, m=(x,y) and κ=κ(p). The equation f∈mm∖mm+1 has nonzero leading form fm(X,Y) in κ[X,Y]. Write the finite ideal-power expression f=∑i+j=mcijxiyj with cij∈A. By [F9], A is a domain and x,y form a regular sequence. The chart is Bx=A[T]/(xT−y)=A[y/x]: if xh=(xT−y)q, reduction modulo x and regularity of y modulo x give q=xq1, and cancellation gives h=(xT−y)q1; hence the incidence quotient has no x-power torsion and [F4, F7] identify it with the chart. In this chart, the ideal-power expression gives f=xmg, where g=∑cijTj and g mod x=fm(1,T)≠0. The ring Bx is a domain and Bx/xBx=κ[T], so x is prime and does not divide g.

2.1F1F2F3F6F8step 1.1

If xh=gq in Bx, primality of x forces q=xq1, and cancellation gives h=gq1. Therefore (g):x=(g), and iteration gives (xmg):x∞=(g). The strict-transform chart is thus V(g). Since g is a nonzero element of a domain, it is a Cartier equation, and the factorization f=xmg gives the total-transform identity there. In the second chart By=A[U]/(yU−x) the identical argument gives f=ymh, with h mod y=fm(U,1)≠0. On the overlap y=xT, so cancellation of xm gives g=Tmh; the equations differ by a unit and glue. Off the exceptional curve the blowup is the identity, as follows by inverting the chart denominators. Hence globally C′ is effective Cartier and π∗C=C′+mE.

3.1F5F8step 2.1∎

On E≅Pκ1, these equations cut the homogeneous divisor of the nonzero degree-m form fm. To include the entire projective line, set d=deg⁡fm(1,T)≤m. Its zeros in this affine chart have total degree d, since κ[T]/(fm(1,T)) has dimension d (zero if d=0); this counts local lengths times residue degrees. At the omitted point, U=0, the identity fm(U,1)=Umfm(1,1/U) gives order m−d. Thus the complete zero-cycle degree over κ is d+(m−d)=m. When [κ:k] is finite, each residue degree over k is that degree times its degree over κ, giving m[κ:k]. No splitting or separability assumption is used.

Depends on

Used by

Cited to discharge well-definedness by Total transform of a Cartier divisor.

Dependency tree · two levels

67 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