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.
Dualizing biduality for finite algebras over a regular base
Statement
Assume AC and DC. Let be a regular Noetherian ring of finite dimension , and let be a module-finite -algebra. For any integer , is a dualizing complex over . For every the canonical evaluation is an isomorphism; both duals are bounded with finite cohomology. These constructions commute with localization on ; localization on preserves the dualizing conditions and coherent bidual evaluation.
Facts & Assumptions
Given: A regular Noetherian ring of finite dimension , a nonzero module-finite -algebra , an integer , and .
def-axiom-of-choice. The Axiom of Choice (AC) is the following statement. > Every family of nonempty sets has a choice function > (def-choice-function). Written out: for every set all of whose members are nonempty, there exists a function with domain satisfying for all . (The Axiom of Choice)
def-dependent-choice. Let be a set and let be a binary relation on . Call entire on when The Axiom of Dependent Choice, written , is the following statement. (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain)
def-dualizing-complex-on-projective-cm-scheme. A dualizing complex on a Noetherian scheme is an object such that, locally on affine open neighborhoods , its corresponding complex has finite injective dimension over and the homothety map is an isomorphism. (def-dualizing-complex-on-projective-cm-scheme)
lem-finite-closed-immersion-derived-coinduction-adjunction. Assume AC. For a finite homomorphism of Noetherian rings and , the complex has its natural -action and is right adjoint to restriction of scalars. (Derived adjunction for finite rings and closed immersions)
thm-localisation-and-polynomial-extension-of-regular-rings. Assume the Axiom of Choice (The Axiom of Choice). Localizations and finite polynomial extensions of a commutative regular Noetherian ring are regular. Regularity can equivalently be tested at maximal ideals. For every nonzero such ring, , allowing infinity. (localisation and polynomial extension of regular rings)
lem-global-dimension-is-detected-on-cyclic-modules. For a unital ring , its left global dimension equals over all left ideals , and equals the supremum of the injective dimensions of all left modules. The equalities allow infinity; in the commutative Noetherian case the cyclic modules are finite. (global dimension is detected on cyclic modules)
Proof
Every finite -module has a bounded resolution by finite projective modules: has finite global dimension by [F5], the resolution can be terminated at that bound, and the syzygies of a finite module over the Noetherian ring are again finite. Similarly every bounded complex of finite -modules has a bounded complex of finite projective modules, and the finite global dimension is detected on cyclic modules by [F6].
The free module of rank one has injective dimension at most over , because the global dimension of bounds both the projective and the injective dimensions of its modules; hence the shift has a bounded injective resolution of length at most , with injective terms that are -modules.
Applying to a bounded injective resolution of gives a bounded complex of -modules whose terms are injective over by the finite-ring coinduction adjunction [F4], so has finite injective dimension over .
Since is a finite -module, a bounded resolution of by finite projective -modules computes , so has bounded cohomology with finite -modules, hence finite -modules, in each degree.
For , coinduction along the finite map gives after forgetting the -structure; applying the same identity to the -module and substituting yields .
The right-hand side is the double dual of computed from a bounded resolution of by finite projective -modules: a finite projective module is canonically isomorphic to its double dual, so termwise double duality of the resolution is a quasi-isomorphism, and the evaluation at is the actual bidual map of -complexes; forgetting scalars reflects quasi-isomorphisms, so the canonical evaluation is an isomorphism and both duals are bounded with finite cohomology.
All constructions commute with localization on : finite projective resolutions and localize, and bounded injective resolutions localize by the ideal test for injectivity together with localization of Hom from finitely presented ideals; localization on preserves the dualizing conditions, the finite cohomology and the coherent bidual evaluation, computed from a degreewise finite free -resolution.
The Axiom of Choice is inherited from the resolution suppliers and the Axiom of Dependent Choice is retained from the Ext and resolution data; no further choice is made.
Remarks
- This is the finite-algebra case of the quotient statement used elsewhere on this page; the proof does not assume that is a quotient of by an ideal, only that is finite.
- The shift is carried through all identifications; biduality is shift-invariant because the two shifts cancel.
Depends on
- The Axiom of Choice
- Dualizing complexes and the normalized dualizing sheaf on a projective CM scheme
- Derived adjunction for finite rings and closed immersions
- localisation and polynomial extension of regular rings
- global dimension is detected on cyclic modules
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
Used by
Dependency tree · two levels
39 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
- The Stacks Project, Resolution of Surfaces, 54.8.8 and 54.11.6: exact imports replaced by the local argument (standard reference, not scraped)