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.

Finite Verma flags and their multiplicities

Definition

Assume the Axiom of Choice (The Axiom of Choice). Work in category O with the conventions of The classical BGG category O, and write Δ(μ)=M(μ) for the standard objects of Standard and costandard objects, i.e. the Verma modules of Verma modules.

A finite Verma flag of an object X of O — also called a standard flag or a Δ-flag — is a finite increasing sequence of subobjects 0=X0⊆X1⊆⋯⊆Xn=X such that each quotient Xi/Xi−1 is isomorphic to a Verma module Δ(μi)=M(μi), for i=1,…,n. An object admitting such a flag is called Verma-filtered. Since the flag is exhausted by its factors, its class in the Grothendieck group K0(O) of The Grothendieck group and character of O is [X]=∑i=1n[Δ(μi)].

For a Verma-filtered object X and a weight μ, the multiplicity (X:Δ(μ)) is the number of indices i with μi=μ in a Verma flag of X. This number is independent of the chosen flag by Verma-flag multiplicities are independent of the flag ↗, so the notation (X:Δ(μ)) is well-defined for Verma-filtered X.

The zero object has the empty flag, and every multiplicity of the zero object is zero; a nonzero Verma-filtered object has at least one factor. A one-step flag of X is exactly an isomorphism X≅Δ(μ) for a single weight μ, so the objects with a one-step flag are the Verma modules themselves. The flag is a chain of subobjects of X in the module category; it is not required to split, and later examples show that it need not.

Depends on

Used by

Dependency tree · two levels

16 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