Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Central-character cuts of a typed module are typed by the matching weights

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let M∈O be Verma-filtered with type Typ⁡M, and for a central character χ let Mχ be the generalised central-character component (Generalized central-character subcategories). Then Mχ is Verma-filtered and Typ⁡Mχ={ψ∈Typ⁡M:χψ=χ}, where χψ is the central character of M(ψ). In particular, by the Harish-Chandra theorem in the form Central characters are dot-Weyl orbits, Typ⁡Mχ consists of the elements of Typ⁡M in the dot-Weyl orbit defining χ.

Facts & Assumptions

Given: The Axiom of Choice, a Verma-filtered module M∈O with a fixed filtration 0=M0⊆M1⊆⋯⊆Mn=M and weights ψ1,…,ψn with Mj/Mj−1≅M(ψj), and a central character χ.

[F1]

Every M∈O decomposes canonically as M=⨁χ′Mχ′ into finitely many generalised central-character submodules, and the canonical projections M→Mχ′ are exact functors (Generalized central-character summands, Generalized central-character decomposition of O).

[F2]

If 0→A→B→C→0 is an exact sequence in O, applying the exact projection functor gives an exact sequence 0→Aχ→Bχ→Cχ→0, and the quotients of a filtration are computed by (Bj/Bj−1)χ≅Bj,χ/Bj−1,χ (F1, Type of a module with a Verma filtration).

[F3]

Every cyclic highest-weight module has a well-defined central character; on M(ψ) every z∈Z(U(g)) acts by the scalar χψ(z), and therefore M(ψ)χ′=M(ψ) if χ′=χψ while M(ψ)χ′=0 if χ′≠χψ (Central elements act by scalars on cyclic highest-weight modules, Generalized central-character subcategories).

[F4]

χψ=χψ′ if and only if ψ′ lies in the dot-Weyl orbit of ψ (Central characters are dot-Weyl orbits).

Proof

1.1F1F2givenalgebra

Apply the exact projection functor (−)χ to each short exact sequence 0→Mj−1→Mj→M(ψj)→0. By [F2] the result is an exact sequence 0→Mj−1,χ→Mj,χ→M(ψj)χ→0, so the modules Mj,χ form an increasing filtration of Mχ with successive quotients M(ψj)χ.

2.1F2F3step 1.1

By [F3] the quotient M(ψj)χ equals M(ψj) when χ=χψj, and is 0 when χ≠χψj. Deleting the redundant equalities Mj,χ=Mj−1,χ from the filtration of step 1.1 leaves a finite filtration of Mχ whose successive quotients are exactly the Verma modules M(ψ) for those j with χψj=χ. Hence Mχ is Verma-filtered and Typ⁡Mχ={ψ∈Typ⁡M:χψ=χ}.

3.1F4step 2.1∎

The final description of that set is [F4]: membership χψ=χ is exactly the condition that ψ lies in the dot-Weyl orbit defining the central character.

Depends on

Used by

Dependency tree · two levels

20 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