Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

Elementary ideals of a finitely presented module

Definition

Let R be a commutative ring (Commutative ring) and let M be a finitely presented R-module (Finitely presented modules and finitely presented algebras), so that there are m,n∈N and a presentation

Rm→ A Rn→ β M⟶0.

Fix the standard bases e1,…,em of Rm and f1,…,fn of Rn (Finitely presented modules and finitely presented algebras) and let A=(aij) be the n×m matrix of the R-linear map α with respect to them: the j-th column of A is the coordinate vector of α(ej), so α(ej)=∑i=1naijfi. Such a matrix is called a presentation matrix of M (for the chosen presentation). A minor of A of size r×r is the determinant det⁡(aisjt)s,t=1r (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix) of the square submatrix obtained by choosing rows i1<⋯<ir and columns j1<⋯<jr; determinants of 1×1 and 0×0 submatrices are allowed, with the empty determinant equal to 1.

For k≥0 the k-th elementary ideal Ek(M) of the presented module M is the ideal of R generated by the determinants of all (n−k)×(n−k) minors of A (The ideal generated by a subset and principal ideals, Left, right and two-sided ideals): if n−k>n or n−k>m there is no such minor, and the ideal generated by the empty set is 0. In particular no minor is nonzero-by-convention: the conventions are Ek(M)=Rfor k≥n,Ek(M)=0for k<n−m. For 0≤k≤min⁡(n,m) the ideal Ek(M) is the ideal generated by the (n−k)×(n−k) minors; e.g. E1(M) is generated by the (n−1)×(n−1) minors of A, and En(M)=R because the 0×0 minor is 1. This is the k-th Fitting ideal Fit⁡k(M) of the Stacks Project (Tag 07Z6, Lemma 15.8.2 and Definition 15.8.3), which is indexed by the size n−k of the complementary minors; the two conventions 0=E−1⊂E0⊂⋯ agree on the range 0≤k≤min⁡(n,m).

Caveats. (i) The notation Ek(M) suppresses the chosen presentation; the ideal defined here is a priori attached to the presentation and it is the content of Elementary ideals are independent of the presentation that it is in fact an invariant of M. (ii) The conventions in the degenerate ranges are conventions, not theorems; they are the ones compatible with the Stacks numbering and with independence of the presentation.

Depends on

Used by

Dependency tree · two levels

25 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