Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedverified 2026-09-23 (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 A2 regular integral-dominant Verma embedding poset

Example

Let λ be regular dominant integral in type A2. The six distinct weights w⋅λ are indexed by W=S3, and there is an embedding M(w⋅λ)↪M(v⋅λ) exactly when v≤w 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 M(λ).

Facts & Assumptions

Given: The supplied A2 triangular decomposition for the Verma modules, Bruhat order The Bruhat order on Sn by rank inequalities, the PBW weight model The PBW model of a Verma module, simple-root embeddings Simple-reflection embeddings of Verma modules, the Verma universal property The universal property of Verma modules, and injectivity of nonzero Verma maps A nonzero homomorphism between Verma modules is injective. The supplied decomposition makes the Cartan maximal toral, so the finite root/string structure Finite semisimple Cartan, root and string structure applies.

Verification

technique · direct
1.1givenalgebra

Put p=⟨λ+ρ,α1∨⟩ and q=⟨λ+ρ,α2∨⟩. Both are positive integers. Write s=sα1, t=sα2, and w0=sts=tst. In the simple-root basis, the displacements λ−w⋅λ for w=e,s,t,st,ts,w0 are respectively (0,0),(p,0),(0,q),(p+q,q),(p,p+q),(p+q,p+q). These are six distinct points. Their coordinatewise order is exactly Bruhat comparability: e is below all, s,t are incomparable, st,ts are incomparable, and each length-one vertex lies below each length-two vertex, with w0 above all.

2.1step 1.1givenalgebra

The simple-root singular-vector theorem gives embeddings for six of the eight Bruhat covers: e<s, e<t, s<ts, t<st, st<w0, and ts<w0. Their positive integral exponents are respectively p,q,p+q,p+q,p,q. The two remaining covers are s<st and t<ts, each a reflection in α1+α2.

2.2step 1.1givenalgebra

To construct the s<st embedding directly, work in M(s⋅λ) with highest vector v. Choose normalized A2 root vectors ei,fi,hi from the supplied finite root structure, and put F=[f2,f1]. The A2 root spaces give [f1,F]=[f2,F]=0; Jacobi and [ei,fj]=δijhi give [e1,F]=−f2 and [e2,F]=f1. The shifted Dynkin coordinates of s⋅λ are (−p,p+q), so h1v=(−p−1)v and h2v=(p+q−1)v. Set ck=(−1)k(qk)(p)k, where (p)0=1 and (p)k=p(p+1)⋯(p+k−1), and define Xp,q=∑k=0qckf1q−kFkf2q−kv. The displayed PBW monomials are distinct and c0=1, so Xp,q≠0. It has weight s⋅λ−q(α1+α2)=st⋅λ. Using the four commutators above, the coefficient of f1q−k−1Fkf2q−kv in e1Xp,q is −(q−k)(p+k)ck−(k+1)ck+1; the coefficient of f1q−kFkf2q−k−1v in e2Xp,q is its negative, for 0≤k<q. Both vanish because ck+1=−(q−k)(p+k)ck/(k+1). Thus Xp,q is singular, and the Verma universal property gives a nonzero map M(st⋅λ)→M(s⋅λ), which is injective by the cited Verma-map lemma. Interchanging the simple-root indices and p,q constructs the t<ts embedding.

3.1step 1.1step 2.1step 2.2given∎

Composing the eight cover embeddings from steps 2.1 and 2.2 gives an embedding whenever v≤w in Bruhat order. Conversely, any nonzero map M(w⋅λ)→M(v⋅λ) sends its highest vector to a nonzero vector of weight w⋅λ in the target. The PBW weight model therefore requires v⋅λ−w⋅λ∈Q+, which by the six displacements in step 1.1 is equivalent to v≤w. This proves the exact embedding poset.

Depends on

Used by

Nothing in the library uses this result yet.

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