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.
minimal free matrix induces zero on residue ext
Statement
For a nonzero commutative Noetherian local ring , let be a map between finite free modules all of whose matrix entries lie in . Then for every .
Facts & Assumptions
Given: The objects and hypotheses in the statement. We work with the Axiom of Choice; cited dependent-choice and resolution-existence hypotheses are retained.
The balanced Ext bifunctor: Assume the Axiom of Dependent Choice. Let be an abelian category with enough projectives and enough injectives, and fix supplied projective and injective resolution data on all objects of . For each , define to mean either or , identified by the natural comparison isomorphism already proved. This notation is justified by the comparison theorem, its independence of comparison data, its two-variable naturality, and its change-of-resolution cocycle law; it is not a definition by equality of the two complexes.
Module categories have enough injectives: Assume the Axiom of Choice. For every unital ring and every left -module , there is an injective left -module and a monomorphism . Thus left -modules have enough injectives. For commutative , one explicit functorial target is where ; the embedding is . Here is a left -module by .
Proof
Choose an injective resolution of . Finite direct sums and are injective resolutions of the free modules. The same coefficient matrix defines a chain map between them extending . Enough injectives is used with AC, and the balanced Ext convention with its supplied data and DC.
For and , . Consequently that matrix induces the zero map on every term of . It therefore induces zero on cohomology in every degree. This includes and or .
Depends on
Used by
Dependency tree · two levels
12 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
- Theorem 1.53 proof, Claim, p.25 (standard reference, not scraped)