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.
Verma filtrations are not closed under quotients
Statement refuted
Every quotient of a Verma-filtered object of is Verma-filtered; in particular the quotient of the standard module by the image of is Verma-filtered.
Facts & Assumptions
Given: The Axiom of Choice, with and dot action , and the standard modules .
The rank-one computation of the parent example gives the nonsplit sequence in which is simple because for , while is infinite-dimensional with basis and weights (The two projectives in the principal sl2 block, Antidominant regular Verma modules are simple).
A finite Verma flag of gives in with nonnegative integers , and the standard classes form a -basis; the class is additive on short exact sequences (Finite Verma flags and their multiplicities, Simple and standard bases of K0(O), Verma-flag multiplicities are independent of the flag).
Counterexample
Assume the Axiom of Choice (The Axiom of Choice).
Proof technique: direct: compute the Grothendieck class of the simple quotient and read off a negative flag multiplicity.
The inclusion of [F1] is the map sending the highest-weight generator of to the singular vector , and is simple, so the quotient has weights only in weight : the -coordinates of the weights of are and those of are , and . The quotient is therefore the one-dimensional simple module with the image of the highest-weight generator, and the sequence is nonsplit: a splitting would exhibit as a one-dimensional submodule of , necessarily spanned by the weight-zero vector , but the submodule generated by is all of the infinite-dimensional module .
Both and are Verma-filtered: each has the one-step flag .
The simple module is not Verma-filtered. If it had a finite Verma flag, [F2] would give with all . On the other hand the exact sequence of step 1.1 gives in . Since the standard classes form a -basis, comparing the two expressions forces and , contradicting .
Thus and are Verma-filtered while their quotient is not, refuting the statement; the quotient in the standard-filtration theorem for projectives is a direct summand rather than an arbitrary quotient, which is what makes that argument work.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
33 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, Warning 1.9 (standard reference, not scraped)
- Pavel Etingof, Representations of Lie Groups (18.757, Fall 2023), Sec. 20.2 (standard reference, not scraped)