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.
Homomorphisms Between Verma Modules and Linkage — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Harish Chandra Isomorphism Casimir and Central Characters
- Homomorphisms Between Verma Modules and Linkage
- Permutation Statistics, Inversions and Eulerian Numbers
- Relations, Functions, and Quotients
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The ZFC Axioms and the Basic Set Constructions
- Verma Modules and Shapovalov Forms
2 · Summary
These rank-one and type- checks make the direction, integrality, and regularity conditions in the Verma homomorphism criterion explicit.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The sl2 Verma embedding chain
Example
For and , the dot reflection sends to , and the singular vector gives . At this is ; when there is no nontrivial reflection embedding from into .
Facts & Assumptions
Given: The simple-reflection embedding Simple-reflection embeddings of Verma modules and the BGG criterion The BGG criterion for homomorphisms between Verma modules.
Verification
Since and , the relevant pairing is , which is positive integral exactly when .
The embedding proposition gives the displayed inclusion, including ; if the pairing is not positive integral, the BGG criterion rules out that reflection map.
The A2 regular integral-dominant Verma embedding poset
Example
Let be regular dominant integral in type . The six distinct weights are indexed by , and there is an embedding exactly when in Bruhat order. Thus the directed Hasse diagram runs from the longest element's Verma module down through the two length-two, two length-one, and identity vertices as inclusions into .
Facts & Assumptions
Given: Strong linkage The strong linkage order on weights the BGG criterion The BGG criterion for homomorphisms between Verma modules, Bruhat order The Bruhat order on by rank inequalities, and injectivity A nonzero homomorphism between Verma modules is injective.
Verification
Put . Regularity makes the dot orbit free, so its members are indexed by the six elements of . For and a positive root , is positive exactly when is positive; integrality makes every such positive value a positive integer.
Write , , and . The positive-reflection pairs are . The rank inequalities defining Bruhat order give precisely these reflection comparisons (all except are covers). Thus checking the three positive roots of shows that the reflections satisfying step 1.1 are exactly the pairs in Bruhat order. In particular every strong-linkage edge lies in Bruhat order, while every Bruhat cover is one of these positive-integral reflection edges. Taking transitive closures and applying the BGG criterion proves the nonzero-homomorphism equivalence; the cited injectivity lemma turns every such map into an embedding. This proves both directions of the stated embedding equivalence.
A singular A2 dot orbit collapses
Example
In type , choose with and . Then , so the dot orbit has distinct weights rather than six.
Facts & Assumptions
Given: The dot-action and linkage conventions The strong linkage order on weights.
Verification
The zero pairing means the shifted weight is fixed by , hence .
Its stabilizer contains and is exactly this subgroup for a generic point on that wall, so orbit-stabilizer gives three distinct translates. The regular six-vertex diagram therefore cannot be used unchanged.
Equal central character does not give every Verma embedding direction
Statement refuted
Equal central character of and implies both and are nonzero.
Counterexample
Given: Dot-orbit central characters Central characters are dot-Weyl orbits and the BGG criterion The BGG criterion for homomorphisms between Verma modules.
Proof technique: direct.
In a regular dominant integral dot orbit take . The weights have equal central character because they are dot conjugate.
The BGG criterion gives , but not the reverse map: , since the only directed reflection lowers the dominant weight. Thus central-character equality does not determine both directions.
A nonintegral reflection does not produce a singular power
Statement refuted
For every complex , the formal power is a singular vector in the Verma module.
Counterexample
Given: The Verma-module convention Verma modules.
Proof technique: direct.
In , take , so . PBW gives vectors only for integers ; is not a vector of .
Thus the asserted formal power does not even define a candidate singular vector. The integrality condition is necessary before the rank-one singular-vector calculation can begin.