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.
Jordan-Holder factors of Verma modules dominate the head (BGG 8.12)
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let and . If a simple module occurs in a composition series of , then for some in Bruhat order; moreover occurs exactly once. Consequently every composition factor of has length at least .
Facts & Assumptions
Given: The Axiom of Choice, a dominant integral weight , an element , and the Verma module .
If , then in the strong linkage order (The strong linkage principle for Verma modules, The strong linkage order on weights) and the central characters agree, (A Verma composition factor has the same central character); central characters of highest weight modules agree exactly on dot-Weyl orbits, if and only if for some (Central characters are dot-Weyl orbits).
means that there are weights and positive roots with and ; equivalently, by The BGG criterion for homomorphisms between Verma modules, each consecutive pair is joined by a nonzero (hence injective) homomorphism (The strong linkage order on weights).
Strong exchange deletes one letter from a reduced expression for to represent when is a root reflection and ; deletion of pairs of letters reduces any nonreduced expression to a reduced one (Finite Weyl strong exchange and deletion). The reduced-subword criterion then gives (Bruhat order on a finite Weyl group). Thus every increasing reflection chain, even with length jumps greater than one, witnesses Bruhat comparison.
For a dominant integral weight and a positive root one has , and is regular (Positive coroot pairings of a dominant integral weight).
is the unique simple quotient (head) of (A Verma module has a unique simple quotient); the simple objects of are exactly the , and forces (The simple objects of O); objects of have finite length (Every object of O has finite length).
The weight space is one dimensional, spanned by the highest weight vector , and generates ; the sum of all proper submodules of is the unique maximal submodule and does not contain (A Verma module has a unique simple quotient).
Proof
Let be a composition factor of . By [F1] and ; by the orbit description of central characters, for some . Since , we may write with .
For the multiplicity of the head, write for the sum of all proper submodules of , the unique maximal submodule, so is simple by [F5]. The highest weight vector of spans the one-dimensional weight space and generates the module, so and hence . Refine the filtration to a composition series; its top factor is , and any further factor isomorphic to would be a subquotient of with , hence would force and so , a contradiction. Therefore .
Use the witnessing linkage chain of [F2]: with and positive integral pairings. By step 1.1 and induction each lies in ; write . Then , so , with and . Moreover , so the pairing condition reads . If were a negative root with , then by [F4], contradiction; hence and the length criterion of Finite Weyl strong exchange and deletion gives .
Thus is an increasing reflection chain, so in Bruhat order by [F3] and . This proves the domination and length assertions.
Combining steps: every composition factor of is with in Bruhat order, , and the factor occurs exactly once.
Depends on
- The BGG criterion for homomorphisms between Verma modules
- The strong linkage principle for Verma modules
- A Verma composition factor has the same central character
- The simple objects of O
- Verma composition multiplicities are finite
- A Verma module has a unique simple quotient
- Composition series and composition factors of an object
- Every object of O has finite length
- Bruhat order on a finite Weyl group
- The Axiom of Choice
- Positive coroot pairings of a dominant integral weight
- The strong linkage order on weights
- Central characters are dot-Weyl orbits
- Finite Weyl strong exchange and deletion
Used by
Dependency tree · two levels
42 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
- Fan Zhou, The classical and the functorial BGG resolutions (Columbia thesis 2021), Part I Sec. 4.2.2, Theorem 8.12, p. 22 (standard reference, not scraped)
- P. Etingof, Representations of Lie Groups (18.757, Fall 2023), Theorem 20.13, p. 104 (standard reference, not scraped)