Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Highest-weight characters are unitriangular in Weyl orbit sums

Statement

For a finite-dimensional complex semisimple Lie algebra with a fixed Cartan and positive system, let L(λ) be the finite-dimensional simple module of dominant integral highest weight λ. Its formal character is ch⁡L(λ)=∑ν∈P(dim⁡L(λ)ν)eν∈C[P]. Then ch⁡L(λ)=mλ+∑μ dominantμ<λnλ,μmμ, where the coefficients are nonnegative integers and the support is finite. The inverse expansion expressing mλ in these characters has integral coefficients, coefficient one at ch⁡L(λ), and finite support on the same dominant ideal. In particular the characters form a basis of C[P]W. All statements include singular dominant weights and rank zero, without AC.

Facts & Assumptions

Given: The indicated Cartan, positive system and formal character.

[F1]

The modules L(λ) exist, are finite-dimensional, have one-dimensional top and support in λ−Q+, and their weight multiplicities are W-invariant, by Finite semisimple PBW and highest-weight construction.

[F2]

Orbit sums form the invariant basis, are indexed uniquely by dominant weights, and each dominant ideal below a fixed dominant weight is finite by Weyl orbit sums form a basis of finite Weyl invariants.

[F3]

The group algebra and distinct-element orbit-sum convention are Weyl orbit sum in a group algebra.

Proof

1.1F1F2F3givenalgebra

By F1 the character is a finite sum with nonnegative integral coefficients constant on each Weyl orbit, hence lies in C[P]W. F2 and F3 group these coefficients into orbit sums with the same nonnegative integral coefficient at each orbit. If its dominant representative μ occurs, then μ itself is a support weight and F1 gives λ−μ∈Q+. The orbit of λ has coefficient one because the top space is one-dimensional. Every other dominant representative is distinct from λ, so is strictly below it. This proves exactly the displayed expansion, including its finiteness.

2.1step 1.1F2F3algebra

Fix λ and let D={μ dominant:μ≤λ}. It is finite by F2 and is downward closed among dominant weights by transitivity of Q+ addition. On its finite free span with basis mμ, step 1.1 gives the character change-of-basis matrix 1+N, where N strictly lowers this partial order and has integer entries. A product of ∣D∣ strictly lowering entries would require a chain of ∣D∣+1 distinct points in D, which is impossible; hence N∣D∣=0. Its inverse is the finite integer matrix 1−N+N2−⋯+(−N)∣D∣−1. It has diagonal one and only lower entries. This proves the asserted finite inverse on each ideal.

3.1step 1.1step 2.1F1F2F3givenalgebra∎

F2 says every invariant is a finite combination of orbit sums. Replacing each by its finite inverse expansion in step 2.1 proves character spanning. A finite relation among characters is supported in the union of finitely many finite dominant ideals; the same nilpotent triangular argument on that finite downward-closed union proves independence. Distinct-element orbit sums ensure no stabilizer factor appears at a wall weight. For rank zero only λ=0 exists, L(0)=C and ch⁡L(0)=m0=1; for λ=0 the dominant ideal is the singleton by F2's norm bound. All matrices and sums used are finite and no AC is involved.

Depends on

Used by

Dependency tree · two levels

9 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