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.

18 results · all verified · 16 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Homomorphisms Between Verma Modules and Linkage

1 · Prerequisites

2 · Summary

Singular vectors control maps out of Verma modules. The PBW and Jantzen arguments establish the precise directed strong-linkage criterion, while central-character coincidence remains only a necessary coarse condition.

3 · Logical flowchart

4 · Definitions, theorems and proofs

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-07Open item page →

Verma homomorphisms and singular vectors

Statement

For weights λ,μ, evaluation at the highest-weight vector gives a natural vector-space isomorphism Homg(M(μ),M(λ)){vM(λ)μ:n+v=0}.

Facts & Assumptions

Given: The universal property of The universal property of Verma modules.

Proof

technique · direct
1.1

A homomorphism f sends the highest-weight vector vμ to a vector of weight μ killed by n+; evaluation is therefore a linear map into the displayed space.

given
2.1

Conversely, a vector v in that space is a highest-weight vector of weight μ, so the universal property supplies a unique homomorphism M(μ)M(λ) sending vμ to v. The two constructions are inverse.

givenconstruct
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The enveloping algebra of the negative nilpotent Lie algebra is a domain

Statement

The algebra U(n) has no zero divisors.

Facts & Assumptions

Proof

technique · direct
1.1

Filter U(n) by PBW degree. PBW identifies its associated graded algebra with the symmetric algebra S(n), a polynomial algebra and hence a domain.

given
2.1

If nonzero x,y had xy=0, their nonzero leading symbols would have product zero in S(n), impossible. Thus U(n) is a domain.

step 1.1contradiction
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A nonzero homomorphism between Verma modules is injective

Statement

Every nonzero g-homomorphism M(μ)M(λ) is injective.

Proof

technique · direct
1.1

In the PBW identifications, the image of the highest vector is avλ for a nonzero aU(n), and equivariance makes the map uvμuavλ.

given
2.1

If uvμ is in the kernel, then ua=0 in U(n); the domain property gives u=0. Hence the kernel is zero.

step 1.1contradiction
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Every Verma module contains a simple Verma submodule

Statement

Every Verma module contains a submodule isomorphic to a simple Verma module.

Proof

technique · contradiction
1.1

If no embedded Verma submodule were simple, repeatedly choose a nonzero proper submodule and then a singular vector in it; injectivity gives an infinite strictly descending chain of embedded Vermas M(λβj)M(λ).

givenassume-contra
2.1

Their Casimir scalars equal that of M(λ), so 2(λ+ρ,βj)=(βj,βj). The βj lie in the positive lattice cone and strictly increase in height, while this positive-definite quadratic equation has only finitely many lattice solutions. This contradiction yields a simple embedded Verma module.

step 1.1algebradischarge-contradiction
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-07Open item page →

Homomorphisms from a simple Verma module have dimension at most one

Statement

If M(μ) is simple, then dimHomg(M(μ),M(λ))1.

Facts & Assumptions

Proof

technique · contradiction
1.1

Suppose that f,g:M(μ)M(λ) are linearly independent. They are injective. Every endomorphism of M(μ) is scalar: it preserves the one-dimensional highest-weight space (visible in the character formula), and that highest vector generates the module. If the two simple images meet nontrivially, their intersection equals both images, so f1g is such an endomorphism, contradicting independence. Thus f(M(μ))g(M(μ)) embeds in M(λ).

givenassume-contra
2.1

Write δ=λμQ+, since a nonzero map sends the highest vector to a target weight vector, and put d=ht(δ). List the positive roots as α1,,αm and set hj=ht(αj)>0. By the character formula, the sum of weight-space dimensions at heights at most N below any Verma highest weight is D(N)=#{(k1,,km)Z0m:jhjkjN}. Both copies of the source's height-at-most-N subspace map into the target's height-at-most-N+d subspace, giving 2D(N)D(N+d). To compare these counts, let St={xR0m:jhjxjt} and H=jhj. The union of unit cubes based at the integer points counted by D(N) contains SN and is contained in SN+H, up to boundaries of volume zero. Since vol(St)=tm/(m!jhj), this yields D(N)Nm/(m!jhj) and hence D(N+d)/D(N)1. If m=0, both counts are instead exactly 1. In either case 2D(N)D(N+d) is impossible for large N.

step 1.1algebradischarge-contradiction
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Homomorphism spaces between Verma modules have dimension at most one

Statement

For all weights λ,μ, dimHomg(M(μ),M(λ))1.

Facts & Assumptions

Given: A simple Verma submodule exists by Every Verma module contains a simple Verma submodule, and maps from one are unique up to scalar by Homomorphisms from a simple Verma module have dimension at most one.

[L1]

Every nonzero homomorphism between Verma modules is injective (A nonzero homomorphism between Verma modules is injective).

Proof

technique · direct
1.1

Choose a simple Verma submodule SM(μ). The restrictions of any two maps f,g:M(μ)M(λ) are proportional, say fS=cgS.

givenchoose
2.1

Then (fcg)S=0. If fcg were nonzero, [L1] would make it injective, so it could not vanish on nonzero S. Hence f=cg, proving the bound.

L1step 1.1contradiction
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The simple-root singular vector in a Verma module

Statement

Let αi be simple and put m=λ+ρ,αi. If mZ>0, then fimvλ is a singular vector in M(λ) of weight siλ.

Facts & Assumptions

Given: The Verma convention Verma modules, the reflection and Weyl-vector conventions Root reflections and the Weyl group action and The Weyl vector rho for a chosen positive system, and the root sl2 line Opposite root spaces bracket to the Killing-dual line.

[L1]

The PBW model identifies M(λ) with U(n)vλ as a vector space (The PBW model of a Verma module).

Proof

technique · direct
1.1

Choose nonzero eigαi and scale figαi so that [ei,fi]=αi; the cited opposite-root bracket line permits this normalization. The resulting sl2 relations give, by induction, eifirvλ=r(λ,αir+1)fir1vλ. At r=m=λ,αi+1 this is zero, while [L1] shows fimvλ0.

L1givenalgebra
2.1

For ji, [ej,fi]=0 because αjαi is not a root; hence every ej also kills fimvλ. Its weight is λmαi=si(λ+ρ)ρ, so it is singular of the stated dot weight.

step 1.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Simple-reflection embeddings of Verma modules

Statement

If λ+ρ,αiZ>0, there is an embedding M(siλ)M(λ).

Facts & Assumptions

Proof

technique · direct
1.1

The singular vector fimvλ has weight siλ, so the universal property gives a homomorphism M(siλ)M(λ) taking its highest vector to it.

givenconstruct
2.1

In the PBW model the vector fimvλ is nonzero. If uvsiλ lay in the kernel, then ufim=0 in U(n). The PBW-degree associated graded is the domain S(n), so u=0. Thus the nonzero homomorphism in step 1.1 is injective and is the asserted embedding.

step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Verma embedding for an arbitrary positive root

Statement

For αΦ+, if λ+ρ,αZ>0, then M(sαλ)M(λ).

Facts & Assumptions

Given: Simple-reflection embeddings Simple-reflection embeddings of Verma modules and the fixed reflection and dot-action conventions Root reflections and the Weyl group action and The Weyl vector rho for a chosen positive system.

[L1]

Etingof's Theorem 15.11: when two shifted weights differ by a positive-integral root reflection, the corresponding Verma module embeds uniquely in the other; its proof uses the Shapovalov determinant generically and then takes a limit.

Proof

technique · direct
1.1

Put ν=λ+ρ and n=ν,α. Then nZ>0 and sαν=νnα, so sαν is related to ν by one positive-integral root reflection.

givenalgebra
2.1

The source theorem [L1] applies to this one-reflection relation and gives a unique embedding M(sανρ)M(νρ). Since sανρ=sαλ, this is the asserted embedding.

step 1.1L1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The strong linkage order on weights

Definition

For the shifted (dot) action sαη:=sα(η+ρ)ρ, write μλ if there are weights λ=η0η1ηr=μ and positive roots αj such that ηj=sαjηj1andηj1+ρ,αjZ>0 for every j. The empty chain is allowed, so λλ.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A Verma composition factor has the same central character

Statement

If [M(λ):L(μ)]0, then χλ=χμ.

Facts & Assumptions

Proof

technique · direct
1.1

Every zZ(U(g)) acts on the cyclic highest-weight module M(λ) by the scalar χλ(z).

given
2.1

The same scalar action descends to each subquotient; on the composition factor L(μ) it is by definition χμ(z). Hence the two characters agree on every z.

step 1.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Verma composition multiplicities are finite

Statement

For any weights λ,μ, the composition multiplicity [M(λ):L(μ)] is finite.

Proof

technique · direct
1.1

A factor L(μ) can occur only when μ is both a weight below λ and in the dot orbit fixed by its central character. The Casimir equality restricts the possible lattice differences in each bounded weight cone to a finite set.

given
2.1

In particular, the μ-weight space of M(λ) is finite-dimensional and every copy of L(μ) contributes its one-dimensional highest-weight line there. Therefore the multiplicity is bounded by dimM(λ)μ<.

step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The Jantzen deformation and filtration of a Verma module

Definition

Put R=Ct and bR=bCR. Let Rλ+tρ be the free rank-one bR-module on which nR+ acts by zero and hh acts by λ(h)+tρ(h). The Jantzen deformation is Mt(λ):=U(gR)U(bR)Rλ+tρ. PBW makes each of its weight blocks finite free over R. Applying the same PBW-projection construction as for the Shapovalov form, now over R, gives a contravariant R-bilinear form and hence a deformed Shapovalov map St:Mt(λ)Mt(λ), where the dual is taken weight-spacewise. Reduction modulo t recovers the usual Shapovalov map on M(λ). Define Mi(λ)={vˉM(λ):some lift v has St(v)tiMt(λ)}. Thus M0(λ)=M(λ)M1(λ); the definition is made weight-spacewise, where the PBW blocks are finite free Ct-modules.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The first Jantzen filtration term is the maximal Verma submodule

Statement

The first Jantzen term satisfies M1(λ)=J(λ), the maximal proper submodule of M(λ).

Facts & Assumptions

Proof

technique · direct
1.1

Reducing the condition St(v)tMt(λ) modulo t says exactly that the specialized Shapovalov form pairs vˉ with every vector as zero. Thus M1(λ) is its radical.

given
2.1

The radical is J(λ) by the radical theorem, so the two submodules agree.

step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The Jantzen sum formula for a Verma module

Statement

For every λ, i>0chMi(λ)=αΦ+ n>0λ+ρ,α=nchM(sαλ).

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.

Proof

technique · direct
1.1

On a finite free weight block, Smith normal form has diagonal entries tajuj(t). Both the order of its determinant and i>0dimMi(λ)λβ equal jaj: each aj contributes once for each 1iaj.

givenalgebra
2.1

Substitute the determinant formula along λ+tρ. Its order at t=0 in the λβ block is α,n:λ+ρ,α=nK(βnα), exactly the coefficient of that weight in the right-hand character sum. Equality coefficientwise for every β proves the formula.

step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The strong linkage principle for Verma modules

Statement

If [M(λ):L(μ)]0, then μλ.

Facts & Assumptions

Proof

technique · induction
1.1

Induct on the height of λμ. Height zero gives L(λ) and the empty linkage chain.

givenbase
1.2

For positive height, the factor is in the maximal submodule M1(λ). The Jantzen sum and finite multiplicities place it in some M(sαλ) with λ+ρ,αZ>0.

givenih
2.1

The new difference has smaller height, so induction gives μsαλ; appending the indicated positive-integral reflection gives μλ.

step 1.2ihdischarge-induction
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A Verma embedding implies strong linkage

Statement

An embedding M(μ)M(λ) implies μλ.

Proof

technique · direct
1.1

The image of the embedding is a submodule isomorphic to M(μ), so its simple quotient L(μ) is a subquotient, hence a composition factor, of M(λ).

given
2.1

Applying the strong linkage principle to that factor gives μλ.

step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The BGG criterion for homomorphisms between Verma modules

Statement

For weights λ,μ, a nonzero homomorphism M(μ)M(λ) exists if and only if μλ.

Facts & Assumptions

Proof

technique · direct
1.1

If μλ, each edge in a witnessing chain gives a positive-root embedding; composing them gives a nonzero homomorphism M(μ)M(λ).

givenconstruct
2.1

Conversely, write the image of the source highest vector as avλ in the PBW model. For a0, a kernel vector uvμ would give ua=0 in U(n), impossible because its PBW-degree associated graded algebra is the domain S(n). Thus the map is an embedding, and the necessity lemma gives μλ.

givenalgebra
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Generic Verma modules are simple

Statement

If λ+ρ,αZ>0 for every αΦ+, then M(λ) is simple. In particular this holds on the complement of the countable union of positive-integral reflection hyperplanes.

Facts & Assumptions

Given: The determinant irreducibility criterion The Verma irreducibility criterion from Shapovalov determinants.

Proof

technique · direct
1.1

The hypothesis is precisely the absence of the positive-integral pairings in the criterion.

given
2.1

The criterion therefore says that M(λ) is simple.

step 1.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Antidominant regular Verma modules are simple

Statement

If λ+ρ,α<0 for every αΦ+, then M(λ) is simple. Thus every regular antidominant weight, in this explicit sense, has simple Verma module.

Facts & Assumptions

[L1]

Every nonzero homomorphism between Verma modules is injective (A nonzero homomorphism between Verma modules is injective).

Proof

technique · contradiction
1.1

If a proper nonzero submodule existed, it would contain a singular vector of some weight μλ; the universal property gives a nonzero map M(μ)M(λ).

givenassume-contra
2.1

By [L1] the map from step 1.1 is an embedding, so μλ. A nonempty linkage chain begins with a positive-integral pairing for λ, contradicting the strictly negative antidominant inequalities. Thus no proper nonzero submodule exists.

L1step 1.1contradictiondischarge-contradiction

5 · Examples, counterexamples and false statements

None yet.

Sources