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.
Finite weight spaces and bounded support do not replace finite generation
Statement refuted
Fix a finite-dimensional complex semisimple Lie algebra , a Cartan subalgebra , and a positive Borel . Write , when , and .
False claim: local -finiteness, finite-dimensional weight spaces and support in finitely many downward cones suffice for membership in without finite generation.
For , has these three local properties, with and for , but is not finitely generated.
Facts & Assumptions
Given: The setting above and the hypotheses in the statement refuted.
Fix a finite-dimensional complex semisimple Lie algebra , a Cartan subalgebra , and a positive Borel . Write , when , and . The BGG category is the full subcategory of left -modules satisfying all three conditions: is finitely generated; where ; and is finite dimensional for each . Its morphisms are all -linear maps. The zero module is included, generated by the empty set. The enveloping and triangular conventions are those of thm-pbw-ordered-monomial-basis-for-the-enveloping-algebra and thm-triangular-decomposition-from-a-chosen-positive-root-system. (The classical BGG category O)
The weights of are exactly for ; every weight space is finite dimensional, and . (Weights of a Verma module lie below lambda)
Counterexample
Each Verma has one basis vector at each weight , : the negative root algebra has the single generator , so the induced Verma basis is . At weight the contributing summands are exactly , proving the count . The direct sum is a weight module supported in the single cone .
The operator raises the Verma weight, so it kills every vector after sufficiently many applications inside each summand. A vector of the direct sum has nonzero coordinates in finitely many summands; taking the maximum of their bounds proves local -finiteness.
Any finite list of vectors is supported in a finite set of summands. Those summands form a -submodule, so the submodule generated by the list remains there. There is always a further nonzero Verma summand outside that finite set. Hence the list cannot generate , which fails the finite-generation axiom of . The empty list generates zero, not .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Lecture 2 Definition 3.1; direct explicit hypothesis test (standard reference, not scraped)