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 ,
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.
The Weyl vector pairs to with every simple coroot (The Weyl vector in fundamental coordinates). Every positive root has a nonzero nonnegative integral expansion (Simple roots form a signed integral basis). Since (Coroot and dual root system), one has and hence for every positive root .
Proof
On a finite free weight block over , 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 with . Both the order of its determinant and equal : each contributes once for each .
Substitute the determinant formula along . For each factor , [F1] makes its -coefficient nonzero, so it contributes valuation one exactly when and zero otherwise. Thus the determinant order in the block is , 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
- Pavel Etingof, Representations of Lie Groups, Exercises 20.11–20.12 (standard reference, not scraped)