Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: 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.

Ordinary Weyl orbits do not classify central characters

Statement refuted

Ordinary Weyl orbits do not classify central characters. In sl2, the weights 0 and −2ω have the same central character, but they are not in the same ordinary Weyl orbit.

Facts & Assumptions

Given: The Lie algebra sl2 with Weyl group W={1,s} and Weyl vector ρ=ω.

Counterexample

technique · direct
1.1given

The dot action gives s⋅0=s(ρ)−ρ=−2ω=−α. Since ⟨ρ,α∨⟩=1, the singular-vector lemma The simple-root singular vector in a Verma module gives a nonzero highest vector fv0 of weight −2ω in M(0). By The universal property of Verma modules it induces a nonzero map M(−2ω)→M(0). Every central element acts by a scalar on either Verma module by The Harish-Chandra projection computes the highest-weight scalar; the nonzero map intertwines these actions, so their central characters are equal.

2.1step 1.1algebra

Under the ordinary Weyl action, s(0)=0, so the ordinary orbit of 0 is just {0}, while the orbit of −2ω is {±2ω}. Thus the two weights are not ordinarily conjugate.

3.1step 1.1step 2.1∎

Therefore ordinary Weyl orbits are too fine here: they separate weights that have the same central character. The ρ-shifted dot action is essential.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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