Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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 R be a commutative ring. For nN write Rn for the free R-module R({1,,n}) on an n-element set, with standard basis e1,,en (The free module on a set and its standard basis); at n=0 the index set is empty and R0=0.

Finitely presented modules. An R-module M is finitely presented when there are m,nN and module homomorphisms making

Rm α Rn β M0

an exact sequence (Exact sequences and short exact sequences of modules): that is, imα=kerβ and β is surjective (Module homomorphism and isomorphism, kernel, image and cokernel).

The equivalent quotient form. M is finitely presented exactly when MRn/K for some nN and some finitely generated submodule KRn (Generated submodule, cyclic and finitely generated modules, module basis and free module). Given a presentation, put K=kerβ=imα, which is generated by α(e1),,α(em), and First isomorphism theorem for modules: M/kerfimf gives MRn/K. Conversely, given MRn/K with K generated by k1,,km, the universal property of the free module (Universal property of the free module on a set) supplies α ⁣:RmRn with α(ej)=kj, whose image is K, and composing the canonical projection with the isomorphism gives β; the displayed sequence is then exact.

Finitely presented algebras. A commutative R-algebra A is finitely presented when there are nN and a finitely generated ideal aR[x1,,xn] (The ideal generated by a subset and principal ideals) with AR[x1,,xn]/a as an R-algebra.

Finitely presented implies finitely generated, in both senses. A finitely presented module is generated by β(e1),,β(en), 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 R[x1,,xn].

The boundary values are admitted. Taking m=n=0 presents the zero module, and taking m=0 with n arbitrary presents the free module Rn; taking a=0 presents the polynomial algebra itself.

Remarks

  • What finite presentation adds to finite generation is a bound on the relations. Finite generation says M is a quotient of some Rn; 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

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