Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-23 (gpt-6-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.

The Harish-Chandra projection computes the highest-weight scalar

Statement

Let M be a cyclic highest-weight module with highest vector v of weight λ, and let z∈Z(U(g)). Then

zv=pr⁡(z)(λ) v,

so the scalar by which z acts on M is obtained by evaluating the Harish-Chandra projection at λ.

Facts & Assumptions

Given: A cyclic highest-weight module M=U(g)v of highest weight λ and a central element z∈Z(U(g)).

Proof

technique · direct
1.1givenalgebra

By Central elements lie in the zero-weight subspace of U(g), z lies in U(g)0. Fix the PBW order n−,h,n+ used in The Harish-Chandra projection. Every PBW monomial is an h-weight vector, with weight equal to the sum of its root weights. In the expansion of the zero-weight element z, only zero-weight monomials occur.

2.1step 1.1givenalgebra

A zero-weight ordered monomial with a nontrivial n− factor must also have a nontrivial n+ factor: without the latter its weight is a nonzero negative sum of positive roots. Thus every zero-weight PBW monomial outside U(h) has a rightmost factor in n+ and annihilates v. Consequently zv=pr⁡(z)v. Merely having a left n− factor would not imply annihilation; the zero-weight restriction supplies the needed right factor.

3.1step 1.1step 2.1∎

The element pr⁡(z) lies in U(h), so it acts on v by the scalar obtained from the polynomial pr⁡(z) by evaluation at the weight λ. Combining this with step 2.1 gives zv=pr⁡(z)(λ)v.

Depends on

Used by

Dependency tree · two levels

6 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