Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge 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.

Kostant multiplicity in the sl3 adjoint module

Example

Assume the Axiom of Choice (The Axiom of Choice). Take g=sl3 with Φ+={α1,α2,α1+α2} and let θ=α1+α2 be the highest root, so that the adjoint module is L(θ) (The adjoint highest weight is the highest root, Highest-weight classification). Compute the multiplicity of μ=0 from Kostant's formula (Kostant's weight multiplicity formula): with ρ=θ, the terms are P(w(2θ)−θ) for w∈W=S3, and w(2θ)−θ∉Q+ for every w≠1, so only w=1 contributes and mθ(0)=P(θ)=2, the two partitions being θ itself and α1+α2; this matches the adjoint weights ±α1 (multiplicity one each), ±α2 (multiplicity one each), ±θ (multiplicity one each) and the zero weight of multiplicity two, for dim⁡L(θ)=8.

Facts & Assumptions

Given: The Axiom of Choice, the realization of sl3 with diagonal Cartan subalgebra and roots ±α1,±α2,±θ, where θ=α1+α2, the Weyl group W=S3 with simple reflections s1,s2, the Weyl vector ρ, and the adjoint module L(θ).

[A1]

The Axiom of Choice is assumed; it enters through the Kostant formula and the highest-weight suppliers below (The Axiom of Choice).

[F1]

In this realization the positive roots are α1,α2,θ and θ=α1+α2 is the highest root; the simple reflections act by s1θ=α2, s2θ=α1, s1α1=−α1, s2α2=−α2, and ρ=α1+α2=θ (Root systems of the classical complex Lie algebras, Classical complex matrix Lie algebras, Height and highest root, The Weyl vector rho for a chosen positive system).

[F2]

W=S3={1,s1,s2,s1s2,s2s1,w0} with lengths 0,1,1,2,2,3, and the adjoint module is the irreducible module L(θ) of highest weight θ; its weights are the roots together with 0, with the root spaces gα one-dimensional and h of dimension 2 (The adjoint highest weight is the highest root, Finite semisimple Cartan, root and string structure, Weyl length equals inversion number).

[F3]

P(θ)=2, because a family (nα1,nα2,nθ) with nα1α1+nα2α2+nθθ=θ is either (0,0,1) or (1,1,0), while P(ν)=0 for ν∉Q+ (The Kostant partition function).

[F4]

Kostant's formula reads mλ(μ)=∑w∈W(−1)ℓ(w)P(w(λ+ρ)−(μ+ρ)), and θ is dominant integral (Kostant's weight multiplicity formula, Integral, dominant, and strictly dominant weights).

Verification

1.1F1F2F3F4A1

With λ=θ, ρ=θ and μ=0 the arguments of [F4] are w(2θ)−θ; for w=1 this is θ with P(θ)=2 by [F3], while for w=s1 it is 2α2−θ=α2−α1, for w=s2 it is α1−α2, for w=s1s2 it is −2α1−θ, for w=s2s1 it is −2α2−θ and for w=w0 it is −3θ, none of which lies in Q+, so those partitions vanish by [F3].

1.2F3

The two partitions counted by P(θ)=2 are the family with nθ=1 and the family with nα1=nα2=1, both summing to θ.

2.1F2step 1.1step 1.2∎

Steps 1.1 and 1.2 give mθ(0)=P(θ)=2; the adjoint weights are the six roots, each with multiplicity one by [F2], and the zero weight whose multiplicity is the dimension 2 of h, so the weighted count is 6⋅1+2=8=dim⁡L(θ), matching the computed zero multiplicity.

Depends on

Used by

Dependency tree · two levels

60 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