Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Fitting ideal sheaves

Definition

Assume the Axiom of Choice (The Axiom of Choice), as used by the associated-module-sheaf existence theorem 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). Let k≥0 be an integer. The k-th Fitting ideal sheaf Fitt⁡k(F) is defined affine locally as follows.

Let U=Spec⁡A be affine and let F∣U≅M~ for a finitely generated A-module M; choose a finite generating set and the resulting presentation A(J)→ φ An→  M⟶0 with n finite and J an arbitrary index set (Finitely presented modules and finitely presented algebras). Let In−k(φ) be the ideal of A generated by the (n−k)×(n−k) minors of a matrix of φ, with the conventions Ir(φ)=A for r≤0 and Ir(φ)=0 once r exceeds the number of rows or the number of columns (Fitting ideals do not depend on a presentation). Then Fitt⁡k(F)∣U  :=  In−k(φ)~, the associated sheaf of that ideal, viewed as a subsheaf of OU=A~ (Module sheaf on an affine scheme). By Fitting ideals do not depend on a presentation the ideal In−k(φ) depends only on M and k, not on the chosen generating set, presentation or integer n, and it commutes with localisation; hence the local data are canonical and compatible on overlaps D(f), where they are given by In−k(φ)⋅Af (Localisation of modules is exact, The associated module sheaf exists). Gluing over an affine cover of X produces an ideal sheaf Fitt⁡k(F)⊆OX. It is quasi-coherent as an ideal sheaf (Quasi-coherent ideal sheaves), since on each affine chart it is the ideal sheaf associated to the A-module In−k(φ). The associated-sheaf existence and identification on distinguished opens use the stated Axiom of Choice through The associated module sheaf exists; presentation independence and localisation of minors use only the cited algebraic supplier.

Boundary values. The convention Ir=A for r≤0 records the empty product, a 0×0 minor being 1. For k=−1 the convention Ir=0 for r larger than the number of rows gives Fitt⁡−1(F)=0. For F=0 the presentation with n=0 gives Fitt⁡k(0)=OX for every k≥0. In general Fitt⁡0 is generated by the n×n minors of a relation matrix, so it need not be OX: if F is free of rank r on U, presented there with n=r generators and no relations, then Fitt⁡k(F)∣U=0 for k<r and Fitt⁡k(F)∣U=OU for k≥r; in particular Fitt⁡0(OU)=0. For 0≤k<n, the ideal Fitt⁡k(F)∣U is zero precisely when all (n−k)×(n−k) minors of the chosen relation matrix vanish. For k≥n it is OU by convention, so it is zero only when A is the zero ring.

Basic properties. Fitt⁡k(F) is defined for every k≥0 and depends only on F; it is compatible with base change and with restriction to open subschemes, and for k=0 it cuts out the support in the finite type case (the rank-locus theorem on this page). The ideals are nested in the sense Ir⊆Is for s≤r, since a larger minor is an A-linear combination of smaller ones by Laplace expansion; hence Fitt⁡k−1⊆Fitt⁡k for all k≥1, so the Fitting ideals increase with k and reach Fitt⁡n(F)=OX on a chart with n generators.

Depends on

Used by

Dependency tree · two levels

32 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