Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-24 (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.

The Shapovalov determinant formula

Statement

For λ∈h∗ and β∈Q+, let K(γ) be the number of partitions of γ∈Q+ into positive roots, and set K(γ)=0 when γ∉Q+. Then

Dβ(λ)≐∏α∈Φ+∏n≥1(⟨λ+ρ,α∨⟩−n)K(β−nα).

For fixed β only finitely many exponents are nonzero.

Facts & Assumptions

Proof

technique · direct
1.1givenalgebra

The preliminary factorization gives nonnegative integers mα,n(β) supported where nα≤β. Its top PBW term gives deg⁡Dβ=∑α∈Φ+∑n≥1K(β−nα)=∑α∈Φ+∑n≥1mα,n(β). Both sums are finite.

2.1givenstep 1.1

Fix a pair (α,n) for which mα,n(β)>0. The hyperplane Hα,n is then a factor hyperplane of Dβ, so the generic-radical lemma applies. At a generic point of this hyperplane the kernel in weight λ−β has dimension K(β−nα), and the transverse-pairing lemma says the determinant's order along a transverse line is exactly this dimension. Other affine factors are nonzero at the chosen generic point. Thus mα,n(β)=K(β−nα).

3.1step 1.1step 2.1algebra∎

For every pair with mα,n(β)=0 one has mα,n(β)≤K(β−nα) trivially; step 2.1 gives equality for every positive multiplicity. The equality of finite total sums in step 1.1 therefore forces equality at every pair, including all pairs with vanishing preliminary multiplicity. Substituting these exponents into the factorization proves the formula.

Depends on

Used by

Dependency tree · two levels

17 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