Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 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 Jantzen sum formula for a Verma module

Statement

For every λ, ∑i>0ch⁡Mi(λ)=∑α∈Φ+ ∑n>0⟨λ+ρ,α∨⟩=nch⁡M(sα⋅λ).

Facts & Assumptions

Given: The filtration The Jantzen deformation and filtration of a Verma module, the Shapovalov determinant formula The Shapovalov determinant formula, and the Verma character The formal character of a Verma module.

[F1]

The Weyl vector pairs to 1 with every simple coroot (The Weyl vector in fundamental coordinates). Every positive root has a nonzero nonnegative integral expansion α=∑iniαi (Simple roots form a signed integral basis). Since α∨=2α/(α,α) (Coroot and dual root system), one has (ρ,αi)=(αi,αi)/2>0 and hence ⟨ρ,α∨⟩=2(ρ,α)/(α,α)>0 for every positive root α.

Proof

technique · direct
1.1givenF1algebra

On a finite free weight block over C⟦t⟧, the determinant formula and [F1] show that the deformed determinant is a nonzero power series: every factor is either a nonzero constant plus a linear term or a nonzero linear term. Smith normal form therefore has nonzero diagonal entries tajuj(t) with uj(0)≠0. Both the order of its determinant and ∑i>0dim⁡Mi(λ)λ−β equal ∑jaj: each aj contributes once for each 1≤i≤aj.

2.1givenF1step 1.1algebra∎

Substitute the determinant formula along λ+tρ. For each factor ⟨λ+tρ+ρ,α∨⟩−n, [F1] makes its t-coefficient nonzero, so it contributes valuation one exactly when ⟨λ+ρ,α∨⟩=n and zero otherwise. Thus the determinant order in the λ−β block is ∑α,n:⟨λ+ρ,α∨⟩=nK(β−nα), exactly the coefficient of that weight in the right-hand character sum. Equality coefficientwise for every β proves the formula.

Depends on

Used by

Dependency tree · two levels

20 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