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.
A reduced finitely generated -algebra
Definition
A reduced finite-type -algebra is a commutative unital -algebra admitting a finite list such that every element is a polynomial in that list with coefficients from , and such that , , implies . With the terminology of The nilradical and reduced rings and Subalgebra generated by a subset, algebras of finite type, and module-finite algebras, equivalently finite type means admitting a surjection . The zero algebra is included. “Module-finite” instead means finitely generated as a -module; finite type does not impose that condition.
Sources
Source comparison: Milne, Algebraic Geometry, v6.10, §3e pp. 65–66. Conventions here distinguish arbitrary affine algebraic sets from nonempty irreducible varieties.
Depends on
Used by
Dependency tree · two levels
8 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, Algebraic Geometry v6.10, §3e pp. 65–66 (standard reference, not scraped)