Alphabeta Math
Pipeline-generated
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.

Verma Modules and Shapovalov Forms — Examples

1 · Prerequisites

2 · Summary

These calculations fix the rank-one conventions, show a two-dimensional A2 determinant block, and separate bilinear contravariance from positivity.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The sl2 Verma action in the PBW basis

Example

For sl2=⟨e,f,h⟩ with [h,f]=−2f and [e,f]=h, the PBW basis of M(λ) is fnvλ (n≥0), and

hfnvλ=(λ−2n)fnvλ,ffnvλ=fn+1vλ(n≥0),

and

evλ=0,efnvλ=n(λ−n+1)fn−1vλ(n≥1).

Facts & Assumptions

Given: The induced highest vector Verma modules and its PBW model The PBW model of a Verma module.

Verification

technique · direct
1.1givenalgebra

The first two identities follow by [h,f]=−2f and multiplication; at n=0, evλ=0.

2.1givenalgebra∎

Induction using efn+1=fefn+hfn transforms the nth coefficient into (n+1)(λ−n), which is the stated formula for n+1.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The sl2 Shapovalov norm product

Example

For the normalized form on the sl2 Verma module,

Sλ(fnvλ,fnvλ)=n!∏j=0n−1(λ−j)(n≥0),

where the empty product is 1.

Facts & Assumptions

Verification

technique · direct
1.1givenalgebra

For n=0 the formula is the normalization. For n>0, contravariance gives S(fnv,fnv)=S(fn−1v,efnv)=n(λ−n+1)S(fn−1v,fn−1v).

2.1givenalgebra∎

Iterating that recurrence from 0 to n gives exactly the displayed factorial product, including its empty-product boundary.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-09-23 (gpt-6-sol)Open item page →

Reducible and generic sl2 Verma modules

Example

M(λ) for sl2 is reducible exactly when λ=m∈Z≥0; then fm+1vm is a singular vector. When λ∉Z≥0 it is simple.

Facts & Assumptions

Given: The sl2 relations [h,f]=−2f and [e,f]=h, the highest vector vλ with evλ=0 and hvλ=λvλ (Verma modules), and the PBW basis wn=fnvλ for n≥0 (The PBW model of a Verma module).

Verification

technique · direct
1.1givenalgebra

The commutator [h,f]=−2f gives hwn=(λ−2n)wn by induction. Similarly [e,f]=h gives ewn+1=fewn+hwn. Starting with ew0=0, induction yields ewn=n(λ−n+1)wn−1 for n≥1. PBW makes every wn nonzero, and their h-eigenvalues are pairwise distinct.

2.1step 1.1algebra

If λ=m∈Z≥0, step 1.1 gives ewm+1=0. The tail W=span⁡{wn:n≥m+1} is invariant under f and h, and under e because ewm+1=0 and ewn is a scalar multiple of wn−1 for larger n. It is nonzero and proper by PBW, so M(m) is reducible and wm+1=fm+1vm is singular.

3.1step 1.1step 2.1algebra∎

Conversely, suppose λ∉Z≥0 and let N be a nonzero submodule. A nonzero vector of N is a finite sum of basis vectors wn. Since their h-eigenvalues are distinct, a finite Lagrange interpolation polynomial in h extracts one nonzero wn∈N. Each coefficient k(λ−k+1) for 1≤k≤n is nonzero, so applying en gives a nonzero multiple of w0∈N. Applying powers of f then gives every wj∈N. Thus N=M(λ) and M(λ) is simple. Together with step 2.1 this proves the asserted classification without a determinant criterion.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

A two-dimensional A2 Verma weight space

Example

In type A2, choose Chevalley generators and f12=[f2,f1], with PBW order f1,f12,f2. At weight λ−α1−α2 the basis is f1f2vλ,f12vλ. Writing λi=λ(hi), its Shapovalov matrix is

(λ2(λ1+1)−λ2−λ2λ1+λ2),

and its determinant is λ1λ2(λ1+λ2+1).

Facts & Assumptions

Given: The induced module Verma modules, the prescribed PBW basis from The PBW model of a Verma module, and its normalized contravariant form Existence and uniqueness of the Shapovalov form.

Verification

technique · direct
1.1givenalgebra

PBW gives exactly the two displayed monomials. The Chevalley relations give e1f1f2vλ=(λ1+1)f2vλ, e1f12vλ=−f2vλ, e12f1f2vλ=−λ2vλ, and e12f12vλ=(λ1+λ2)vλ. Contravariance, together with Sλ(f2vλ,f2vλ)=λ2, gives the four displayed matrix entries.

2.1givenalgebra∎

Taking the 2×2 determinant gives λ2(λ1+1)(λ1+λ2)−λ22=λ1λ2(λ1+λ2+1).

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The Shapovalov form need not be positive on its real PBW span

Statement refuted

For every real λ, the normalized Shapovalov form is positive definite on the real span of the PBW basis of M(λ).

Take sl2 and λ=−1. On MR:=span⁡R{fnv−1:n≥0}, the restricted bilinear form has fv−1≠0 but S−1(fv−1,fv−1)=−1.

Facts & Assumptions

Given: The norm product The sl2 Shapovalov norm product.

Counterexample

technique · direct
1.1givenalgebra

At n=1 the product formula gives S−1(fv−1,fv−1)=1!(−1)=−1.

2.1givencontradiction∎

A positive-definite real bilinear form cannot take a negative value on a nonzero vector; hence this refutes positivity on the specified real PBW span, without asserting degeneracy or turning the complex-bilinear form into a Hermitian form.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-09-23 (gpt-6-sol)Open item page →

The finite-dimensional sl2 quotient of a Verma module

Example

For m∈Z≥0,

L(m)=M(m)/U(sl2)fm+1vm

has basis v‾m,fvm‾,…,fmvm‾ and dimension m+1.

Facts & Assumptions

Given: The highest-vector relations of Verma modules, the PBW basis wn=fnvm of The PBW model of a Verma module, the sl2 commutators [h,f]=−2f, [e,f]=h, and the unique simple quotient A Verma module has a unique simple quotient.

Verification

technique · direct
1.1givenalgebra

Write wn=fnvm. Induction from [h,f]=−2f, [e,f]=h, ew0=0, and hw0=mw0 gives hwn=(m−2n)wn and ewn=n(m−n+1)wn−1 for n≥1. In particular ewm+1=0. The tail W=span⁡{wn:n≥m+1} is stable under e,f,h and equals U(sl2)wm+1: it contains that generated submodule by invariance, while every tail vector is fkwm+1. Hence the quotient has the displayed m+1 surviving, distinct-weight PBW vectors.

2.1step 1.1givenalgebra∎

Any nonzero submodule of the quotient contains a nonzero finite combination of its basis vectors. Their h-eigenvalues are distinct, so a finite interpolation polynomial in h extracts some w‾r. Applying er reaches a nonzero multiple of w‾0, because all coefficients k(m−k+1) for 1≤k≤r≤m are nonzero. Applying f then gives every displayed basis vector, so the quotient is simple. The unique-simple-quotient theorem identifies its kernel with J(m) and the quotient with L(m).

Sources