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.
Injectives have costandard filtrations
Statement
Assume the Axiom of Choice (The Axiom of Choice). For every weight the restricted dual of the projective cover is an injective object of (Injective object) and has a finite costandard (-)flag, with multiplicities in the sense of Finite Verma flags and their multiplicities and BGG reciprocity; the functor exchanges Verma flags of projectives with costandard flags of injectives. Every injective object of has a finite costandard flag: it is a finite direct sum of indecomposable injectives, and induces a bijection between the indecomposable projectives and the indecomposable injectives of (Restricted duality is exact and involutive on O); each indecomposable injective is the dual of an indecomposable projective and hence of the form .
Facts & Assumptions
Given: The Axiom of Choice, weights , the Verma-filtered projective cover , and the exact contravariant involution of restricted duality with and .
is an exact contravariant involution of , hence carries projectives to injectives and injectives to projectives, preserves finite direct sums, finite length and multiplicities, and maps a flag of to a flag of with the dual factors: the exact sequences become (Restricted duality is exact and involutive on O, Standard and costandard objects).
has a finite Verma flag with multiplicities , and every indecomposable projective is a projective cover of its simple head (Projectives in category O have finite Verma flags, BGG reciprocity, Projective covers in O are indecomposable and unique).
The category is abelian, and every object has finite length (Category O is abelian and extension closed among weight modules, Every object of O has finite length). These hypotheses allow Fitting decomposition in a finite-length abelian category to be applied: every object is a finite direct sum of indecomposable objects, including the empty sum for zero.
Proof
is injective by [F1]. If is a Verma flag with factors , then applying the exact contravariant functor to the defining sequences gives exact sequences ; by induction on , a finite costandard flag of concatenated with the subobject gives a finite costandard flag of , because extensions of objects with finite costandard flags again have finite costandard flags. For this gives a finite costandard flag of with the factors , hence by [F2].
Let be injective. By [F3] it has finite length and with each indecomposable. Applying the exact contravariant involution gives with each an indecomposable projective: is an equivalence, so it preserves indecomposability and exchanges projectives with injectives. Each is therefore a projective cover of its simple head by [F2], hence by uniqueness of projective covers and .
By step 1.1 each has a finite costandard flag, and a finite direct sum of objects with finite costandard flags again has one, by concatenating flags along the summands; hence every injective object has a finite costandard flag, and the bijection between indecomposable projectives and indecomposable injectives is induced by .
Depends on
- The Axiom of Choice
- Injective object
- Standard and costandard objects
- Finite Verma flags and their multiplicities
- Fitting decomposition in a finite-length abelian category
- Projective covers in O are indecomposable and unique
- Restricted duality is exact and involutive on O
- BGG reciprocity
- Projectives in category O have finite Verma flags
- Category O is abelian and extension closed among weight modules
- Every object of O has finite length
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
38 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
- Lin Chen, lecture notes (Spring 2024), Lecture 9, Theorem-Definition 1.2, Theorem 1.4 and Theorem 2.2 (standard reference, not scraped)
- Pavel Etingof, Representations of Lie Groups (18.757, Fall 2023), Sec. 20.1-20.2 (standard reference, not scraped)