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.
A small parabolic category O character formula
Example
For , , , the genuine regular parabolic category has minimal-left labels , with highest weights . Its generalized-standard/simple matrix is Thus , and .
For comparison retain the singular antidominant block with and right-minimal labels : its composition matrix has inverse , giving , , and . The latter coefficients are Mobius values in this all-one singular chain only. The two blocks exemplify distinct spherical and antispherical formulas; the singular example is not the generalized-Verma character formula of the parabolic category.
Facts & Assumptions
Given: The data: dominant regular and for the parabolic block; with for the singular block; the label sets and (Parabolic category O for a standard parabolic, The singular integral block and its dot stabilizer).
Regular parabolic multiplicities: for (Parabolic category O multiplicities are parabolic Kazhdan–Lusztig values), and the character formula with (The parabolic Kazhdan–Lusztig character formula).
The antispherical values of Parabolic Kazhdan–Lusztig polynomials for S_3 modulo S_2 in the order are the matrix displayed above; its inverse is the integer matrix displayed (verified by the two matrix products in the Verification below).
Singular multiplicities: in the singular block of with , exactly for and otherwise (Singular category O multiplicities are parabolic Kazhdan–Lusztig values, Translation to a singular wall in type A_2); BGG reciprocity gives the projective version (BGG reciprocity).
Grothendieck-group and inversion data: the simple and generalized-standard classes are bases, characters are injective, and inverse matrices are computed by the finite signed chain inversions of the unitriangular multiplicity matrix (Parabolic category O is a highest weight category (4) for generalized standards, The Grothendieck group and character of O, Simple and standard bases of K0(O) for ordinary standards, and Inverse Kazhdan–Lusztig polynomials, The Kazhdan–Lusztig inversion formula for the ordinary inverse comparison).
The parabolic highest weights: , , , and the singular labels for are , , with the dominance chain of Translation to a singular wall in type A_2.
Verification
The parabolic matrix. By [F2] the matrix in the order is the displayed upper unitriangular matrix. The displayed matrix is its inverse: has entries , which equal for and otherwise (the only nonzero contributions are from with the alternating coefficients), and similarly . Both products are finite integer calculations.
The singular matrix. By [F3] the composition matrix in the order is (entry is exactly when ). The displayed matrix satisfies by the same finite chain computation, so .
The parabolic characters. By [F1] and step 1.1, . Reading the rows of in the order gives exactly the three displayed character identities, using , , as the labels of , , by [F5]: with , the type- reflection relations give and , hence the stated dot translates after subtracting .
The singular characters and the comparison. By [F3] and [F4], ; the rows of give the three displayed singular identities, in which the nonzero off-diagonal coefficients are the Mobius values of this all-one chain only. The parabolic coefficients of step 2.1 include the value in the position of , which the singular inverse does not have: the two formulas are different character formulas for different blocks, and the singular one is not the generalized-Verma character formula of the parabolic category.
Remarks
The example is the smallest case in which both inversions can be written down explicitly: the spherical/antispherical distinction of the companion counterexample persists in the inverse matrices, and no singular/parabolic category equivalence or grading is used. The two blocks have different label orders (left-minimal versus right-minimal representatives), which is why both index dictionaries are displayed.
Depends on
- Singular category O multiplicities are parabolic Kazhdan–Lusztig values
- The singular integral block and its dot stabilizer
- The parabolic Kazhdan–Lusztig bases and polynomials
- Parabolic Kazhdan–Lusztig polynomials are alternating sums of ordinary ones
- The Grothendieck group and character of O
- Simple and standard bases of K0(O)
- Inverse Kazhdan–Lusztig polynomials
- The Kazhdan–Lusztig inversion formula
- The Axiom of Choice
- Parabolic category O multiplicities are parabolic Kazhdan–Lusztig values
- The parabolic Kazhdan–Lusztig character formula
- Parabolic category O for a standard parabolic
- Translation to a singular wall in type A_2
- Parabolic Kazhdan–Lusztig polynomials for S_3 modulo S_2
- BGG reciprocity
- Parabolic category O is a highest weight category
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
82 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
- Lin Chen, lecture notes (Spring 2024), Lecture 9: standard filtrations, BGG reciprocity and translation functors (complete 7-page lecture) (standard reference, not scraped)
- Anders Bjoerner and Francesco Brenti, Combinatorics of Coxeter Groups, Graduate Texts in Mathematics 231, Springer 2005 (author-hosted complete 370-page PDF) (standard reference, not scraped)
- Anne Moreau, M2 Representation Theory 2025–2026 (current complete 129-page author notes) (standard reference, not scraped)