Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

Type of a module with a Verma filtration

Definition

Assume the Axiom of Choice (The Axiom of Choice). Let M be an object of the category O of The classical BGG category O. A Verma filtration of M is a finite increasing filtration by g-submodules

0=M0⊆M1⊆⋯⊆Mn=M

such that for every j there is a weight ψj with Mj/Mj−1≅M(ψj), the Verma module of Verma modules. When such a filtration exists, M is called Verma-filtered and one writes

Typ⁡M={ψ1,…,ψn},

a finite multiset of weights, its type. The multiset is independent of the chosen filtration: passing to classes in the Grothendieck group of The Grothendieck group and character of O gives [M]=∑j[M(ψj)], and by Simple and standard bases of K0(O) the classes of the Verma modules involved have pairwise distinct characters and are linearly independent in the relevant block, so the multiset of weights is recovered from [M]. Consequently Typ⁡ is well defined. The standard example is a finite direct sum M=⨁r=1nM(ψr), which is Verma-filtered with type {ψ1,…,ψn} by taking the partial sums of the summands. Verma-filteredness is also preserved by tensoring with a finite-dimensional g-module: Finite-dimensional tensoring preserves O keeps the module in O, and the type of the tensor product is computed by the page's tensoring lemma. In particular the type of a Verma filtration is a coarser invariant than a composition series (Composition series and composition factors of an object): it records the successive Verma quotients, not the simple factors.

Depends on

Used by

Dependency tree · two levels

26 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