Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Truncation at a finite downward-closed ideal of a linkage class

Definition

Assume the Axiom of Choice (The Axiom of Choice). Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=h⊕n+ with the conventions of The classical BGG category O: positive roots Φ+, simple roots αi, Q+=∑iZ≥0αi, the root order μ≤λ meaning λ−μ∈Q+, Weyl vector ρ, the dot action w⋅λ=w(λ+ρ)−ρ, and category O.

For a weight λ let C=Wλ⋅λ be its integral-reflection linkage class in the sense of The integral Weyl group of a weight; it is contained in the full dot orbit W⋅λ, hence finite because W is finite (The Weyl group is finite and faithful, with the identification of the abstract reflections with the sα of The roots form a reduced crystallographic Euclidean root system). A finite downward-closed ideal of C is a finite subset Γ⊆C such that ν∈Γ and μ∈C and μ≤ν ⟹ μ∈Γ, where ≤ is the root order of The classical BGG category O and not the strong linkage order ↑ of The strong linkage order on weights. It is a lower set in the restriction of the partial order ≤ to C. The empty ideal is allowed; every nonempty such ideal has minimal elements.

For such a Γ, the truncation OΓ is the full subcategory of O whose objects are those X all of whose simple composition factors are L(μ) with μ∈Γ; composition factors are those of Composition series and composition factors of an object and the simple objects of O are the L(μ) of The simple objects of O. Because every object of O has finite length (Every object of O has finite length) and composition factors of a composition series are independent of the chosen series (Jordan-Holder theorem in an abelian category), membership in OΓ depends only on the isomorphism class of the object and not on a chosen composition series. Consequently OΓ contains the zero object and is closed in O under finite direct sums, subobjects, quotients and extensions (Category O is abelian and extension closed among weight modules); it is the truncation of the finite label poset of one linkage class.

The Verma-placement claim below also has a direct justification. The highest weight line of M(μ) is one-dimensional and generates the whole module; hence it cannot be distributed among two nonzero direct summands. The linkage-block decomposition of Central-character summands refine into linkage blocks therefore places this Verma in the block of its unique simple quotient L(μ) (A Verma module has a unique simple quotient), so all its composition labels lie in C. A label η of a composition factor is a weight of M(μ): in a short exact sequence of h-semisimple modules, a weight vector in the quotient lifts in that same weight by extracting that component of any finite weight decomposition of a lift. Iterating through a composition series and using Weights of a Verma module lie below lambda gives η≤μ. Thus μ∈Γ and lower closure within C force every such η∈Γ, proving M(μ)∈OΓ without a bound by one greatest label.

Two boundaries are part of the definition. First, OΓ is a condition on the highest-weight labels of simple composition factors, not a bound on all weights of a Verma module: a Verma module M(μ) with μ∈Γ lies in OΓ although its weights run over the whole cone μ−Q+. Second, Γ is a finite ideal inside a single linkage class C, not the infinite lower ideal generated by λ in the whole weight lattice; in particular a discrete series truncation is a different construction.

Depends on

Used by

Dependency tree · two levels

61 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