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.
Finitely presented modules and finitely presented algebras
Definition
Let be a commutative ring. For write for the free -module on an -element set, with standard basis (The free module on a set and its standard basis); at the index set is empty and .
Finitely presented modules. An -module is finitely presented when there are and module homomorphisms making
an exact sequence (Exact sequences and short exact sequences of modules): that is, and is surjective (Module homomorphism and isomorphism, kernel, image and cokernel).
The equivalent quotient form. is finitely presented exactly when for some and some finitely generated submodule (Generated submodule, cyclic and finitely generated modules, module basis and free module). Given a presentation, put , which is generated by , and First isomorphism theorem for modules: gives . Conversely, given with generated by , the universal property of the free module (Universal property of the free module on a set) supplies with , whose image is , and composing the canonical projection with the isomorphism gives ; the displayed sequence is then exact.
Finitely presented algebras. A commutative -algebra is finitely presented when there are and a finitely generated ideal (The ideal generated by a subset and principal ideals) with as an -algebra.
Finitely presented implies finitely generated, in both senses. A finitely presented module is generated by , since is surjective. A finitely presented algebra is of finite type (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras), being a quotient of .
The boundary values are admitted. Taking presents the zero module, and taking with arbitrary presents the free module ; taking presents the polynomial algebra itself.
Remarks
-
What finite presentation adds to finite generation is a bound on the relations. Finite generation says is a quotient of some ; finite presentation says the kernel of that quotient map is itself finitely generated. Over an arbitrary commutative ring the second is strictly stronger.
-
The two notions carry the same name and are not the same condition. A finitely presented algebra is finitely presented as an algebra, which constrains a defining ideal in a polynomial ring, and says nothing on its own about the underlying module.
Depends on
- Subalgebra generated by a subset, algebras of finite type, and module-finite algebras
- The free module on a set and its standard basis
- Exact sequences and short exact sequences of modules
- Module homomorphism and isomorphism, kernel, image and cokernel
- The ideal generated by a subset and principal ideals
- Generated submodule, cyclic and finitely generated modules, module basis and free module
- First isomorphism theorem for modules: $M/\ker f\cong\operatorname{im}f$
- Universal property of the free module on a set
Used by
Dependency tree · two levels
24 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
- J. S. Milne, A Primer of Commutative Algebra, v4.03, §1 (standard reference, not scraped)
- A. Altman and S. Kleiman, A Term of Commutative Algebra, 13th ed., (16.19) (standard reference, not scraped)