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 triangular restriction on projective Verma flags
Statement
Assume the Axiom of Choice (The Axiom of Choice). If is nonzero then , that is, . Moreover , so exactly one factor of every Verma flag of has label .
Facts & Assumptions
Given: The Axiom of Choice, weights , and the Verma-filtered projective cover of .
, where the right-hand side is the composition multiplicity of the simple module in the Verma module (BGG reciprocity, Projectives in category O have finite Verma flags).
The weights of are exactly and ; is the unique simple quotient of , with highest weight (Weights of a Verma module lie below lambda, A Verma module has a unique simple quotient).
means , and the order is a partial order (Root order on weights).
Proof
If , then by [F1] the simple module is a composition factor of , hence its highest weight is a weight of ; by [F2] every weight of lies in , so , that is, .
: the kernel of the quotient map is the sum of all proper submodules, so contains no highest-weight vector of weight and ; since by [F2], this gives . The highest weight of any composition factor of is a weight of and is therefore different from , so no factor is isomorphic to ; from the multiplicity is exactly one.
Thus a nonzero multiplicity forces , and the label occurs exactly once in every Verma flag of .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
29 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 2.2 (standard reference, not scraped)
- Pavel Etingof, Representations of Lie Groups (18.757, Fall 2023), Corollary 20.5 and Sec. 20.3 (standard reference, not scraped)