Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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 characters are dot-Weyl orbits

Statement

Let χλ and χμ be the central characters obtained from highest weights λ and μ. Then

χλ=χμif and only ifμWλ,

where Wλ:={w(λ+ρ)ρ:wW}.

Facts & Assumptions

Given: Weights λ,μh.

[F1]

For a finite Weyl group, two points of h lie in the same ordinary W-orbit exactly when every polynomial in S(h)W takes the same value on them.

Proof

technique · direct
1.1

If μ=wλ for some wW, then μ+ρ=w(λ+ρ). By Harish-Chandra isomorphism for the center, every central element z determines a Weyl-invariant polynomial HCρ(z)S(h)W, and The Harish-Chandra projection computes the highest-weight scalar gives χλ(z)=pr(z)(λ)=HCρ(z)(λ+ρ),χμ(z)=HCρ(z)(μ+ρ). Since HCρ(z) is ordinarily W-invariant, HCρ(z)(μ+ρ)=HCρ(z)(λ+ρ). Hence χμ(z)=χλ(z) for every central z, so χμ=χλ.

given
2.1

Conversely, if χμ=χλ, then the equalities from step 1.1 show that HCρ(z)(λ+ρ)=HCρ(z)(μ+ρ) for every central z. Because Harish-Chandra isomorphism for the center identifies the image of HCρ with all of S(h)W, every Weyl-invariant polynomial takes the same value at λ+ρ and μ+ρ. By [F1], those two points lie in the same ordinary W-orbit, so μ lies in the dot orbit of λ.

F1step 1.1
3.1

Therefore equal central characters are exactly the dot-Weyl orbits.

step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

13 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