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.
The balanced Ext bifunctor
Definition
Assume the Axiom of Dependent Choice, The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain. 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 Projective and injective constructions of Ext agree for supplied resolutions. The independence and naturality statements in The Ext balance isomorphism is independent of resolution comparison data and The Ext balance isomorphism is natural in both variables apply under the stated DC assumption. This is a bifunctor contravariant in and covariant in , up to the canonical identifications below; it is not a definition by equality of the two complexes.
Well-definedness under changes of resolution
For projective resolutions of the same , use Projective comparison maps exist under DC to choose lifting the identity. Precomposition induces a map . Any two such are chain-homotopic by Projective comparison maps are unique up to chain homotopy. If , precomposition by is the cochain homotopy between the two Hom maps: in degree it sends a cochain to . Thus the induced map on cohomology is independent of . An identity comparison induces the identity. If is a third resolution, the composite of comparisons lifts the same identity as a direct comparison; uniqueness up to homotopy gives . In particular opposite-direction comparisons induce inverse isomorphisms.
For injective resolutions of , use Injective comparison maps exist to obtain under . Postcomposition gives on . The cochain-homotopy uniqueness of Injective comparison maps are unique up to cochain homotopy makes this map independent of : postcomposing with a homotopy gives a Hom cochain homotopy. Identities and composites of the comparison maps prove and , including invertibility.
Write for the balance isomorphism from the projective presentation to the injective presentation. The augmentation-compatible Hom double-complex squares in the cited independence and naturality results give This square, together with the two comparison composition laws, proves coherence of changing either presentation, including successive mixed changes. It is the change map or that is an identity when its resolution is unchanged. The balance map between different presentations need not be a literal identity. No uniqueness theorem for arbitrary delta-functor morphisms is used in this justification.
The specified resolution systems are hypotheses, not a global selection deduced here from DC. For fixed resolutions and explicitly supplied comparison maps and homotopies, the Hom and cohomology calculations above are choice-free; DC is used for existence of the arbitrary comparison data.
Depends on
- Projective and injective constructions of Ext agree for supplied resolutions
- The Ext balance isomorphism is independent of resolution comparison data
- The Ext balance isomorphism is natural in both variables
- Projective comparison maps exist
- Projective comparison maps are unique up to chain homotopy
- Injective comparison maps exist
- Injective comparison maps are unique up to cochain homotopy
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
Used by
- Ext can be computed from any injective resolution of the second variable Corollary
- Ext can be computed from any projective resolution of the first variable Corollary
- Extension classes form a set whenever derived Ext one does Corollary
- Positive Ext need not vanish for an injective first variable Counterexample
- The derived Ext-one class of an extension Definition
- Ext zero as Hom in both constructions Example
- Every Ext-one class is represented by an extension Lemma
- Ext degree zero identifies ideal-annihilated elements Lemma
- Ext one of Z modulo n by Z is Z modulo n Lemma
- Hom to costandards counts Verma-flag factors Lemma
- minimal free matrix induces zero on residue ext Lemma
- Standard-costandard Hom and Ext-one orthogonality Lemma
- The cohomological universal-coefficient extension map Lemma
- Two extensions with the same Ext class are equivalent Lemma
- Chevalley–Eilenberg cohomology computes Ext of the trivial module Proposition
- Exact functors compatible with Hom transport Ext under stated adjunction hypotheses Proposition
- Semisimple rings have vanishing positive Tor and Ext Proposition
- Ext dimension shifting in the first variable Theorem
- Projective dimension at most n iff higher Ext vanishes Theorem
- The long exact Ext sequence in the first variable Theorem
- The long exact Ext sequence in the second variable Theorem
- Yoneda Ext one is naturally isomorphic to derived Ext one Theorem
Dependency tree · two levels
36 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
- Charles A. Weibel, An Introduction to Homological Algebra, Chapter 2 (standard reference, not scraped)