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.

Reflexive surface modules and codimension-one lattice extension

Statement

Assume AC and DC. On a regular Noetherian surface a coherent reflexive module is locally free. For a finite module M over a normal Noetherian domain, a generic vector belonging to M∗∗ at every height-one localization belongs to M∗∗. For a coherent generic-rank-r module on a regular surface, (∧rM)∗∗ is the determinant line of M∗∗.

Facts & Assumptions

Given: A regular Noetherian surface X (a regular Noetherian scheme of pure dimension two) and a coherent sheaf M on X of generic rank r; for the height-one assertion, a finite module over a normal Noetherian domain.

[F1]

def-axiom-of-choice. The Axiom of Choice (AC) is the following statement. > Every family of nonempty sets has a choice function > (def-choice-function). Written out: for every set F all of whose members are nonempty, there exists a function g with domain F satisfying g(S)∈S for all S∈F. (The Axiom of Choice)

[F2]

def-dependent-choice. Let X be a set and let R⊆X×X be a binary relation on X. Call R entire on X when for every x∈X there is y∈X with xRy. The Axiom of Dependent Choice, written DC, is the following statement. (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain)

[F3]

cor-localisations-of-regular-local-rings-are-regular. Assume the Axiom of Choice (The Axiom of Choice). Every prime localization Rp of a regular local ring R is regular, and edim⁡Rp=ht⁡p. (localisations of regular local rings are regular)

[F4]

thm-regular-local-rings-are-domains-and-cohen-macaulay. Assume the Axiom of Choice (The Axiom of Choice). A regular local ring R of dimension d is a domain and Cohen–Macaulay. For every regular system (x1,…,xd), the tuple is R-regular and R/(x1,…,xc) is regular local of dimension d−c for all 0≤c≤d. (regular local rings are domains and cohen macaulay)

[F5]

thm-auslander-buchsbaum-formula. Assume the Axiom of Choice (The Axiom of Choice). For a nonzero finite module M of finite projective dimension over a nonzero Noetherian local ring R, pd⁡RM+depth⁡RM=depth⁡R. Consequently such an M with depth⁡M=depth⁡R is free. (auslander buchsbaum formula)

[F6]

thm-long-exact-ext-sequence-in-the-second-variable. Assume the Axiom of Dependent Choice. Let A be abelian with enough projectives and enough injectives, and fix supplied projective and injective resolution data on all its objects. (The long exact Ext sequence in the second variable)

[F7]

lem-r-one-s-two-intersection-of-height-one-localisations. Assume the Axiom of Choice. If R is a commutative Noetherian domain satisfying (S2), then inside its fraction field K one has R=⋂ht⁡p=1Rp. For a field the empty intersection is interpreted as K=R. (r one s two intersection of height one localisations)

[F8]

thm-auslander-buchsbaum-serre-regularity-criterion. Assume the Axiom of Choice (The Axiom of Choice). For a nonzero Noetherian local ring (R,m,k) the following are equivalent: R is regular; pd⁡Rk<∞; gldim⁡R<∞; and every finite R-module has finite projective dimension. When these hold, gldim⁡R=pd⁡Rk=dim⁡R. (auslander buchsbaum serre regularity criterion)

[F9]

thm-depth-zero-associated-prime-criterion. Assume the Axiom of Choice. Let (R,m) be a Noetherian local ring and let M≠0 be a finite R-module. Then depth⁡(M)=0⟺m∈Ass⁡R(M). (The local depth-zero associated-prime criterion)

[F10]

A normal Noetherian ring satisfies (S2); conversely (R1) and (S2) imply normality. (serre normality criterion)

Proof

1.1F3F4given

At a point x∈X with dim⁡OX,x=2 the local ring A=OX,x is a regular local ring of dimension two, hence a domain with depth two; the localizations of A are regular by [F3], and those of dimension at most one are fields or discrete valuation rings in which finite torsion-free modules are free.

1.2F7F10given

For the second assertion, let A be the given normal Noetherian domain, K its fraction field, and v∈M∗∗⊗AK. By [F10], A satisfies (S2), so [F7] applies. For every φ∈M∗=Hom⁡A(M,A), evaluation of v on φ belongs to each Ap of height one, because v∈(M∗∗)p. It therefore lies in A by [F7]. Thus φ↦v(φ) is an A-linear map M∗→A, that is, an element of M∗∗ with generic value v. This also treats a field, using the empty-intersection convention.

2.1F4F6F9step 1.1

Let N be a finite A-module with a finite presentation Ab→Aa→N→0 for A=OX,x. Dualizing gives an exact sequence 0→N∗→Aa→Ab whose image I is torsion-free. If I=0, then N∗=Aa is free, and the asserted depth bound holds (with the zero module treated separately). Otherwise I is a nonzero finite module over the domain A, hence has depth at least one by the depth-zero criterion for torsion-free modules over a domain; applying the long exact sequence of Ext groups from the residue field to 0→N∗→Aa→I→0 gives depth⁡N∗≥2.

3.1F5F8step 2.1

If N∗∗=0, it is already free. Otherwise applying the same computation to the finite module N∗ shows depth⁡N∗∗≥2. Since A is regular, every finite module over it has finite projective dimension by the Auslander--Buchsbaum--Serre criterion, so the Auslander--Buchsbaum formula gives pd⁡N∗∗=2−depth⁡N∗∗=0; a finite module of projective dimension zero over a local ring is free, so N∗∗ is free.

4.1F3step 3.1

A coherent reflexive module equals its double dual, so on an affine cover of X the module of sections of M is isomorphic to its double dual and is free at every point of local dimension two by step 3.1, free at points of local dimension one because their local rings are discrete valuation rings and the module is torsion-free, and free at points of local dimension zero because their local rings are fields. Over a DVR, a finite torsion-free module is free: in a nonzero relation between a minimal generating family divide the coefficients by their common lowest uniformizer power and cancel that power by torsion-freeness; one coefficient is a unit, contradicting minimality. Hence M is locally free.

5.1F3F7step 3.1step 4.1step 1.2

Work locally on an integral component of the regular surface and put N=M/tors⁡(M). A map from a torsion module to the domain A vanishes, so N∗=M∗ and N∗∗=M∗∗. At every height-one point N is finite torsion-free over a DVR and hence free; there N→N∗∗ is an isomorphism. The surjection ∧rM→∧rN has torsion kernel, since it becomes an isomorphism over K, so its double dual is an isomorphism. The map ∧rN→∧rN∗∗ is also generically an isomorphism and an isomorphism at height one. Applying step 1.2 to these two finite modules identifies their double duals inside their common generic exterior power. By steps 3.1 and 4.1, N∗∗=M∗∗ is locally free; hence ∧rM∗∗ is already an invertible sheaf. The canonical identifications glue, giving (∧rM)∗∗≅det⁡(M∗∗). For r=0, both sides are OX.

6.1F1F2step 3.1step 5.1∎

The Axiom of Choice and the Axiom of Dependent Choice are inherited from the cited commutative-algebra and Ext suppliers; no further choice is used.

Remarks

  • The two-dimensional hypothesis is used exactly at step 3.1, where depth two forces projective dimension zero; in dimension one the analogous statement is that finite torsion-free modules are free over discrete valuation rings.
  • The determinant statement is the surface case of the usual identification of top exterior powers with determinants after reflexive hulls.

Depends on

Used by

Dependency tree · two levels

50 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