Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Support of a finite-type quasi-coherent sheaf is closed

Statement

Assume the Axiom of Choice, inherited from the construction of associated sheaves and from the stalk identification used below. Let X be a scheme and let F be a quasi-coherent OX-module of finite type (Finite type and finitely presented module sheaves), with support Supp⁡(F)={x∈X:Fx≠0} (Support of a module sheaf).

Then Supp⁡(F) is a closed subset of X. Moreover, if U=Spec⁡A is an affine open with F∣U≅M~ for a finitely generated A-module M, then Supp⁡(F)∩U={p∈Spec⁡A:Ann⁡A(M)⊆p}=V(Ann⁡A(M)), the zero set of the annihilator ideal of M; in particular Supp⁡(F)∩U is closed in U, and F∣U=0 exactly when M=0.

Facts & Assumptions

Given: The Axiom of Choice; a scheme X; a finite-type quasi-coherent OX-module F.

[F1]

The support is Supp⁡(F)={x:Fx≠0}, and for an open U⊆X one has Supp⁡(F∣U)=Supp⁡(F)∩U (Support of a module sheaf).

[F2]

For an affine scheme Spec⁡A with associated sheaf M~ one has (M~)p≅Mp for every prime p (The stalk of an associated sheaf is the localisation).

[F3]

If M is a finitely generated A-module, then Supp⁡A(M)={p:Ann⁡A(M)⊆p} (For a finite module, support is the set of primes containing the annihilator).

[F4]

F is of finite type: every point of X has an affine open neighbourhood U=Spec⁡A with F∣U≅M~ for a finitely generated A-module M (Finite type and finitely presented module sheaves).

[F5]

A subset Z⊆X is closed exactly when its complement is open, and openness of a subset can be checked on the members of any open cover: if every W∩Ui is open in Ui for a cover X=⋃iUi by open sets, then W is open in X (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[F6]

Axiom of Choice: every family of nonempty sets has a choice function (The Axiom of Choice).

Proof

Proof technique: direct; compute the support on affine charts and use that closedness can be checked on an open cover.

1.1F1F2F3

Let U=Spec⁡A be an affine open with F∣U≅M~ for a finitely generated A-module M; then Supp⁡(F)∩U=Supp⁡(F∣U) by [F1] equals {p:(M~)p≠0}, which by [F2] is {p:Mp≠0}=Supp⁡A(M), and by [F3] this is {p:Ann⁡A(M)⊆p}=V(Ann⁡A(M)), the zero set of an ideal and hence closed in U=Spec⁡A.

1.2F4given

Let {Ui}i∈I be the family of all affine open subsets Ui of X with F∣Ui≅Mi~ for a finitely generated module Mi; by [F4] every point of X lies in such a chart, so this family covers X, and it is the family of all such charts, determined without selecting anything.

2.1F5step 1.1step 1.2

For every chart U of the cover of step 1.2 the intersection Supp⁡(F)∩U is closed in U by step 1.1, so its complement U∖Supp⁡(F) is open in U, and since the U cover X the complement X∖Supp⁡(F)=⋃U(U∖Supp⁡(F)) is open in X by [F5]; hence Supp⁡(F) is closed in X, as claimed.

3.1F2F3F6step 1.1step 2.1∎

The identification of the affine support with V(Ann⁡A(M)) is step 1.1, and the Axiom of Choice is used only through [F2], inherited from the associated-sheaf construction, and through the supplier [F3]; the cover of step 1.2 is the family of all admissible charts, so no selection occurs there.

Depends on

Used by

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