Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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 ideals do not depend on a presentation

Statement

Let A be a commutative ring with 1 and let M be a finitely generated A-module (Generated submodule, cyclic and finitely generated modules, module basis and free module). Let k≥0 and let A(J)→ φ An→ π M⟶0 be a presentation in which n≥0 is finite and the index set J is arbitrary, possibly infinite. For r≥0 let Ir(φ) be the ideal of A generated by the r×r minors of the matrix of φ, with the conventions Ir(φ)={A,r≤0,0,r>n, and with Ir(φ)=0 also when r exceeds a finite number of columns. Then In−k(φ) depends only on M and k, not on the presentation; it is written Fitt⁡k(M).

Moreover Fitt⁡k is compatible with base change. If A→B is a ring homomorphism, then Fitt⁡k(M⊗AB)=Fitt⁡k(M)⋅B, the ideal of B generated by the image, and if f∈A, then Fitt⁡k(Mf)=Fitt⁡k(M)⋅Af, so the ideals localise. No choice principle is used.

Facts & Assumptions

Given: A commutative ring A; a finitely generated A-module M; an integer k≥0; a presentation A(J)→An→M→0 with n finite.

[F1]

A module is finitely generated when it is generated by a finite subset, and An is the free module on n standard basis elements (Generated submodule, cyclic and finitely generated modules, module basis and free module).

[F2]

Localisation of modules is exact: every short exact sequence of R-modules localises to a short exact sequence of S−1R-modules (Localisation of modules is exact).

[F3]

Tensoring is right exact, so it preserves cokernels and surjections (Tensoring is right exact).

Proof

Proof technique: direct comparison of two presentations by elementary shears.

1.1F1givenalgebra

Put F=An and K=ker⁡(F→πM)=im⁡φ, and for a submodule N⊆F and r≥0 let Jr(N) be the ideal generated by the determinants of all r×r matrices whose columns are r elements of N, with Jr(N)=A for r≤0 and Jr(N)=0 for r>n; multilinearity of the determinant in the columns shows that the ideal generated by the r×r minors of a matrix whose columns generate N equals Jr(N), so Ir(φ)=Jr(K) for every r and the stated conventions match, and it suffices to prove Jn−k(K)=Jn′−k(K′) for the kernels of two surjections F=An↠M and F′=An′↠M from finite free modules.

1.2givenalgebra

Determinant calculus, three elementary facts. (a) Nestedness: Jr(N)⊆Js(N) for s≤r, by Laplace expansion of an r×r determinant along a row. (b) Cauchy--Binet: every r×r minor of a product of matrices CA is an A-linear combination of r×r minors of A, obtained by expanding the determinant of the product and regrouping terms according to the r rows of A used; consequently Jr(CN)=Jr(N) for every automorphism C of F, by applying this inclusion to C and to C−1. (c) Block Laplace expansion: for a square submatrix of (M10M2M3) with h selected lower rows, expand its determinant along those h rows. Every term is a product of an h×h minor from the selected lower rows and a complementary minor from M1; expanding the former further in columns separates contributions from M2 and M3. In particular, whenever a term uses j columns from the M3 block, its other columns contribute a minor of M1 of size equal to the number of selected upper rows.

2.1givenalgebrastep 1.2

Augmentation identity: for N⊆An and m≥0, with N⊕Am⊆An⊕Am, one has Jr(N⊕Am)=Jr−m(N), and the same identity holds with the two blocks interchanged, Jr(Am⊕N)=Jr−m(N). If r≤m, the right side is A by convention and an r×r identity minor in the free block shows that the left side is A. If r>m, adjoining the m standard free-block vectors to any r−m vectors of N gives a block identity minor, so Jr−m(N)⊆Jr(N⊕Am). Conversely, expand any r×r minor of vectors (vi,ci)∈N⊕Am along its selected free-block rows. Every resulting term is a free-block minor times a minor of the vi of size at least r−m, hence lies in Jr−m(N) by nestedness in step 1.2(a); thus Jr(N⊕Am)⊆Jr−m(N). Swapping the two blocks proves the second identity.

2.2F1givenstep 1.1

Now let p:F↠M and p′:F′↠M be two surjections from finite free modules, with kernels K and K′ as in step 1.1; choose an A-linear lift w:F′→F with p∘w=p′ by choosing values on the n′ standard basis elements of F′ one at a time, a finite and choice-free construction, and define L={(x,y)∈F⊕F′:p(x)=p′(y)}⊆F⊕F′, which is the kernel of the A-linear map p−p′∘pr2 on F⊕F′.

3.1givenstep 2.2

The endomorphisms C(x,y)=(x−w(y),y) and D(x,y)=(x,y−u(x)) of F⊕F′, where u:F→F′ is an A-linear lift with p′∘u=p (which exists by choosing values on the finite standard basis of F), are automorphisms with inverses (x,y)↦(x+w(y),y) and (x,y)↦(x,y+u(x)); for (x,y)∈L one has p(x−w(y))=p(x)−p′(y)=0, so C(L)⊆K⊕F′, while p(k+w(y))=p′(y) for k∈K shows C(L)=K⊕F′, and likewise p′(y−u(x))=p′(y)−p(x)=0 on L gives D(L)=F⊕K′.

4.1step 1.1step 1.2step 2.1step 2.2step 3.1

By step 1.2(b) applied to the automorphisms C and D of step 3.1, Jn+n′−k(L)=Jn+n′−k(C(L))=Jn+n′−k(K⊕F′) and Jn+n′−k(L)=Jn+n′−k(D(L))=Jn+n′−k(F⊕K′); the augmentation identity of step 2.1, with m=n′ and m=n respectively, gives Jn+n′−k(K⊕F′)=Jn−k(K) and Jn+n′−k(F⊕K′)=Jn′−k(K′), whence Jn−k(K)=Jn′−k(K′); combined with step 1.1, this proves In−k(φ)=In′−k(ψ) for any two presentations.

5.1F2F3step 1.1step 4.1∎

Base change: let A→B be a ring homomorphism and apply −⊗AB to the presentation, so that by [F3] the sequence B(J)→Bn→M⊗AB→0 is exact, hence is a presentation of M⊗AB whose matrix has the images of the entries of φ; its (n−k)×(n−k) minors are the images of those of φ, and the two ideals are generated by these images, giving Fitt⁡k(M⊗AB)=Fitt⁡k(M)⋅B; for the localisation statement apply [F2] to the presentation, so that the localised sequence Af(J)→Afn→Mf→0 is exact, its matrix is the localisation of the matrix of φ, and minors commute with the coefficient map, giving Fitt⁡k(Mf)=Fitt⁡k(M)⋅Af; all steps used finitely many choices on standard bases and universal constructions only, so no choice principle is invoked.

Depends on

Used by

Dependency tree · two levels

16 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