Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-09-24 (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.

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.

Depends on

Used by

Dependency tree · two levels

21 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