Alphabeta Math
TheoremStatement: 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.

The Casselman–Osborne constraint on weights of nilradical cohomology

Statement

Assume the Axiom of Choice. Let g be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra h, positive system Φ+, n+=⨁α∈Φ+gα, λ∈Λ+ dominant integral, and V=L(λ) the finite-dimensional irreducible module of highest weight λ (Highest-weight classification). If μ∈h∗ is an h-weight of Hp(n+,V) for some p≥0, then χμ=χλ, where χν ⁣:Z(U(g))→C is the central character z↦ν(pr⁡(z)) attached to the highest weight ν. Equivalently, μ∈W⋅λ={w(λ+ρ)−ρ:w∈W} by Central characters are dot-Weyl orbits. This constrains every degree independently of the harmonic computation below.

Facts & Assumptions

Given: The Axiom of Choice; the finite-dimensional g-module V=L(λ); a central element z∈Z(U(g)); and a class ω∈Hp(n+,V) of h-weight μ.

[F1]

The module V is finite-dimensional and irreducible with highest weight λ, and every central element acts on a cyclic highest-weight module by a scalar; for the highest vector vλ one has zvλ=pr⁡(z)(λ)vλ (Highest-weight classification, Central elements act by scalars on cyclic highest-weight modules, The Harish-Chandra projection computes the highest-weight scalar, The Harish-Chandra projection).

[F2]

A central character of a module M is a unital algebra homomorphism χ:Z(U(g))→C such that every z acts by χ(z)id⁡M (Central character of a Lie algebra module).

[F3]

For every z∈Z(U(g)), every p≥0 and every class ω∈Hp(n+,V), z⋅ω=pr⁡(z)⋅ω, where the left side multiplies cochain values by z and the right side is the h-action of the normalizer-action proposition applied to pr⁡(z)∈S(h) (Central actions on nilradical cohomology factor through the Harish–Chandra projection, The normalizer acts on Lie algebra cohomology).

[F4]

The cohomology Hp(n+,V) is an h-module, so its h-weight spaces are defined; for a weight vector of weight μ, every h∈h acts by the scalar μ(h), hence every polynomial f∈S(h) acts by μ(f) (The normalizer acts on Lie algebra cohomology, Weight and weight space, Finite-dimensional modules decompose into weight spaces).

[F5]

The central characters obtained from highest weights are equal exactly on dot-Weyl orbits: χν=χξ if and only if ξ∈W⋅ν (Central characters are dot-Weyl orbits, Integral, dominant, and strictly dominant weights, The Harish-Chandra projection is multiplicative on the center).

Proof

technique · compare the central action on the coefficient module with the Cartan action on a cohomology weight vector
1.1F1F2

The central element z acts on the whole finite-dimensional irreducible module V by the scalar χλ(z)=pr⁡(z)(λ): by [F1] it acts on the highest vector by that scalar, and cyclicity propagates the scalar to every vector because z commutes with the action of U(g).

2.1F3F4step 1.1

On the other hand, step 1.1 identifies the left-hand action of z on cochain values with the scalar χλ(z), so for the cohomology class ω of weight μ the identity of [F3] gives χλ(z) ω=z⋅ω=pr⁡(z)⋅ω, while the h-action of the polynomial pr⁡(z)∈S(h) on the weight vector ω is multiplication by the scalar μ(pr⁡(z))=χμ(z) by [F4].

3.1F5step 2.1∎

Since ω≠0, step 2.1 forces χλ(z)=χμ(z) for every z∈Z(U(g)), that is χλ=χμ. By [F5] equality of central characters is equivalent to μ∈W⋅λ, which is the displayed reformulation.

Depends on

Used by

Nothing in the library uses this result yet.

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