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.

✓ 8 results · all verified · 3 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 5 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 here supply the ingredients for the directed strong-linkage criterion proved after finite length on the Category O page. Central-character coincidence remains only a necessary coarse condition.

The general strong-linkage and BGG homomorphism statements assume AC where they use the central-character and finite-length results. Direct PBW calculations retain the hypotheses stated in their individual items.

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 Hom⁡g(M(μ),M(λ))≅{v∈M(λ)μ:n+v=0}.

Facts & Assumptions

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

Proof

technique · direct
1.1given

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.

2.1givenconstruct∎

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)Open 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.1givenassume-contra

Suppose no embedded Verma submodule of M(λ) is simple. Any proper nonzero submodule of an embedded Verma contains a singular vector; its generated submodule is another embedded Verma by injectivity. A proper inclusion strictly lowers the highest weight, so successive such submodules have weights λ−βj with strictly increasing heights of βj∈Q+.

2.1step 1.1algebra

Every such embedded Verma has the same Casimir scalar as M(λ), so its nonzero βj satisfies 2(λ+ρ,βj)=(βj,βj). Taking real parts in the real span of the roots places βj on a bounded sphere centred at the real part of λ+ρ. The root lattice is discrete, so the set F of its solutions is finite.

3.1step 1.1step 2.1discharge-contradiction∎

Let m=∣F∣. Starting with M(λ), apply step 1.1 only m+1 times. Finite induction and finite choice suffice to obtain m+1 proper, strictly nested embedded Vermas. Their distinct nonzero weights give m+1 distinct members of F, a contradiction. Hence some embedded Verma is simple.

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 λ,μ, dim⁡Hom⁡g(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.1givenchoose

Choose a simple Verma submodule S⊂M(μ). The restrictions of any two maps f,g:M(μ)→M(λ) are proportional, say f∣S=cg∣S.

2.1L1step 1.1contradiction∎

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

PropositionStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-26 (gpt-6-sol)Open item page →

Simple-reflection embeddings of Verma modules

Statement

If ⟨λ+ρ,αi∨⟩∈Z>0, there is an embedding M(si⋅λ)↪M(λ).

Facts & Assumptions

Given: The positive integer m=⟨λ+ρ,αi∨⟩, the singular vector of The simple-root singular vector in a Verma module, and the universal property The universal property of Verma modules.

[F1]

The PBW model identifies M(μ) with U(n−)vμ as a vector space for every μ (The PBW model of a Verma module).

[F2]

The PBW filtration has gr⁡U(n−)≅S(n−) (PBW gives an ordered monomial basis for the enveloping algebra).

Proof

technique · direct
1.1givenconstruct

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

2.1F1F2step 1.1algebra∎

By [F1], every source vector is uniquely uvsi⋅λ with u∈U(n−). Its image is ufimvλ, which vanishes only if ufim=0 in U(n−), again by [F1]. If u≠0, its highest nonzero PBW symbol and the symbol of fim have nonzero product in the polynomial domain S(n−) of [F2]. Therefore ufim≠0, and the map is injective.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Verma embedding for an arbitrary positive root

Statement

For α∈Φ+, if ⟨λ+ρ,α∨⟩∈Z>0, then M(sα⋅λ)↪M(λ).

Facts & Assumptions

[F1]

A singular vector yields a Verma homomorphism (The universal property of Verma modules), and every nonzero Verma homomorphism is injective (A nonzero homomorphism between Verma modules is injective).

Proof

technique · direct
1.1givenalgebra

Put n=⟨λ+ρ,α∨⟩>0 and μ=λ−nα=sα⋅λ. At weight λ−nα, the determinant formula has the factor ⟨λ+ρ,α∨⟩−n with exponent K(0)=1. Thus its hyperplane is a factor hyperplane, and at generic points η on it the generic-radical lemma supplies a nonzero singular vector in M(η)η−nα.

2.1step 1.1algebra

In fixed PBW coordinates the maps ei:M(η)η−nα→M(η)η−nα+αi have matrix entries polynomial in η. Stack them to form one matrix E(η). Step 1.1 says it has a nonzero kernel at a dense set of points on the affine hyperplane Hα,n. Hence every maximal minor of E vanishes identically on that hyperplane: a polynomial that vanishes outside a countable union of proper affine subspaces there is zero. In particular E(λ) has a nonzero kernel. A vector in it is killed by every simple positive-root vector, hence by all of n+, and has weight μ.

3.1F1step 2.1∎

By [F1] this vector defines a nonzero map M(μ)→M(λ), which is injective. Since μ=sα⋅λ, this is the required embedding.

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⋅ηj−1and⟨ηj−1+ρ,αj∨⟩∈Z>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.1given

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

2.1step 1.1algebra∎

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.

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=C⟦t⟧ and bR=b⊗CR. Let Rλ+tρ be the free rank-one bR-module on which nR+ acts by zero and h∈h 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 C⟦t⟧-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.1given

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.

2.1step 1.1∎

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

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

The Jantzen sum formula for a Verma module

Statement

For every λ, ∑i>0ch⁡Mi(λ)=∑α∈Φ+ ∑n>0⟨λ+ρ,α∨⟩=nch⁡M(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.

[F1]

The Weyl vector pairs to 1 with every simple coroot (The Weyl vector in fundamental coordinates). Every positive root has a nonzero nonnegative integral expansion α=∑iniαi (Simple roots form a signed integral basis). Since α∨=2α/(α,α) (Coroot and dual root system), one has (ρ,αi)=(αi,αi)/2>0 and hence ⟨ρ,α∨⟩=2(ρ,α)/(α,α)>0 for every positive root α.

Proof

technique · direct
1.1givenF1algebra

On a finite free weight block over C⟦t⟧, the determinant formula and [F1] show that the deformed determinant is a nonzero power series: every factor is either a nonzero constant plus a linear term or a nonzero linear term. Smith normal form therefore has nonzero diagonal entries tajuj(t) with uj(0)≠0. Both the order of its determinant and ∑i>0dim⁡Mi(λ)λ−β equal ∑jaj: each aj contributes once for each 1≤i≤aj.

2.1givenF1step 1.1algebra∎

Substitute the determinant formula along λ+tρ. For each factor ⟨λ+tρ+ρ,α∨⟩−n, [F1] makes its t-coefficient nonzero, so it contributes valuation one exactly when ⟨λ+ρ,α∨⟩=n and zero otherwise. Thus the determinant order 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.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-24 (gpt-6-sol)Open 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.1given

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

2.1step 1.1∎

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

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

Antidominant regular Verma modules are simple

Statement

Assume the Axiom of Choice.

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

Facts & Assumptions

Given: The Axiom of Choice (The Axiom of Choice) and the strict antidominant inequalities in the statement.

[L1]

Every nonzero Verma submodule has a singular vector (Every nonzero Verma submodule contains a singular vector), and the weights of M(λ) are λ−Q+, with one-dimensional highest-weight space (Weights of a Verma module lie below lambda).

[L2]

The quadratic Casimir acts on a cyclic highest-weight module of highest weight η by (η,η+2ρ) (The quadratic Casimir eigenvalue on a highest-weight module is (λ,λ+2ρ)).

[L3]

Under Choice, the root span has a positive-definite inner product with 2(γ,α)/(α,α)=⟨γ,α∨⟩ for each root α (The roots form a reduced crystallographic Euclidean root system); the simple roots form a basis and each positive root is a nonnegative integral combination of them (Simple roots form a signed integral basis).

Proof

technique · contradiction
1.1givenL1assume-contra

Suppose a proper nonzero submodule N⊂M(λ) exists. By [L1], it contains a nonzero singular vector vμ of weight μ=λ−β for some β∈Q+. The highest-weight space has dimension one, so β≠0: otherwise vμ would generate M(λ), contrary to N being proper. The cyclic submodule U(g)vμ is a highest-weight module of weight μ.

2.1L2step 1.1algebra

By [L2], the Casimir acts on M(λ) with scalar (λ,λ+2ρ) and on its cyclic submodule U(g)vμ with scalar (μ,μ+2ρ). These scalars agree on the nonzero vector vμ. Substituting μ=λ−β and expanding gives 2(λ+ρ,β)=(β,β).

3.1givenL3step 1.1step 2.1contradictiondischarge-contradiction∎

Write β=∑iniαi in the simple-root basis, where ni∈Z≥0 and some ni>0. By [L3], 2(λ+ρ,αi)=(αi,αi)⟨λ+ρ,αi∨⟩<0 for every i. Therefore (λ+ρ,β)<0, whereas positive definiteness gives (β,β)>0, contradicting step 2.1. Thus M(λ) has no proper nonzero submodule and is simple.

5 · Examples, counterexamples and false statements

None yet.

Sources