Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Finite modules with a connection on a complex polynomial open are vector bundles

Statement

Let R=C[x1,…,xn][f−1] with 0≠f, and let N be a finite R-module with operators ∇i satisfying ∇i(av)=(∂ia)v+a∇i(v). At every complex point p with f(p)≠0, Np is free over Rmp, and this basis extends to an algebraic open neighborhood of p. Thus its coherent sheaf on the complex principal open is an algebraic vector bundle. A finite submodule stable under these operators, and its quotient, have the same property. Integrability is unnecessary for local freeness; if the operators commute, these bundles carry the induced integrable connections. Short exact sequences of such bundles give exact fiber sequences.

Facts & Assumptions

Given: The ring, finite module and Leibniz operators in the Statement.

[F1]

Determinant trick for Nakayama: for a finite module Q with IQ=Q, some a∈I satisfies (1−a)Q=0.

[F2]

If R is Noetherian then R[x1,…,xn] is Noetherian for every n∈N and Finite modules over Noetherian rings are Noetherian: polynomial rings are Noetherian and submodules of finite modules are finite. Localizing generators proves the same for their localizations.

Proof

1.1F1givenchoosealgebra

Fix p and write A=Rmp, m=mpA, V=Np. Choose lifts v1,…,vr of a basis of V/mV. The quotient Q=V/∑Avi is finite and satisfies mQ=Q. By [F1], (1−a)Q=0 for some a∈m. Since 1−a is a unit, Q=0, so the lifts generate V. For r=0 this proves V=0.

2.1givenstep 1.1choosealgebra

Suppose ∑iaivi=0 is a nonzero relation. Fiber independence gives ai∈m. Let k be the least order of vanishing at p of a nonzero ai. This is finite: a nonzero rational regular germ is a quotient of polynomials with nonzero denominator at p, so its convergent Taylor series has a first nonzero coefficient. Choose a multi-index β of order k with some ∂βai(p)≠0. Apply the ordered connection derivatives prescribed by β to the relation. By repeated Leibniz, every term in which a derivative hits vi has fewer than k derivatives on its coefficient and vanishes modulo m. Reduction therefore gives ∑i∂βai(p)v‾i=0, contradicting the fiber basis. Hence there are no relations, and V is free.

3.1F2step 1.1step 2.1algebra

The local basis extends to a principal algebraic neighborhood. Lift its finitely many elements through denominators to sections on some neighborhood of p. Their cokernel and the kernel of the resulting finite free presentation are finite by [F2]. Since their localizations at p vanish, each finite generating set is killed after inverting a single element nonzero at p; multiply these finitely many elements. On the resulting smaller principal neighborhood the map is an isomorphism. The case n=0 is the finite-dimensional vector-space assertion over C and the same proof is valid.

4.1F2step 3.1algebra∎

A stable submodule and its quotient are finite by [F2] and inherit Leibniz operators; the proof just given applies to both without a category-O assumption. Commutators descend if initially zero. A surjection onto a locally free module splits locally by lifting a finite basis, so a short exact sequence gives an exact fiber sequence. This proves every assertion.

Depends on

Used by

Dependency tree · two levels

11 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