Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-07
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.

Simple extensions cannot cross linkage classes

Statement

Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=hn+. Write Q+=iZ0αi, μλ when λμQ+, and wλ=w(λ+ρ)ρ.

A short exact sequence 0L(μ)EL(λ)0 in O splits whenever λ and μ belong to distinct integral-reflection linkage classes.

Facts & Assumptions

Given: The setting above and the hypotheses in the statement.

[F1]

Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=hn+. Write Q+=iZ0αi, μλ when λμQ+, and wλ=w(λ+ρ)ρ. Restricted Chevalley duality is an exact contravariant equivalence D:OOop, with a natural isomorphism D2id. It preserves each weight-space dimension, the formal character, and every simple composition multiplicity. (Restricted duality is exact and involutive on O)

[F2]

For a g-module V, sending a homomorphism T:M(λ)V to T(vλ) is a bijection onto the vectors vV of weight λ annihilated by n+. Here M(λ) is def-verma-module. The nonzero vectors in this target are precisely the highest-weight vectors of weight λ from def-highest-weight-vector-and-cyclic-highest-weight-module; the zero vector corresponds to the zero homomorphism. (The universal property of Verma modules)

[F3]

If [M(λ):L(μ)]0, then μλ. (The strong linkage principle for Verma modules)

[F4]

Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=hn+. Write Q+=iZ0αi, μλ when λμQ+, and wλ=w(λ+ρ)ρ. The set Φλ is preserved by its root reflections. If μWλλ, then Φμ=Φλ and Wμ=Wλ. The equivalence classes generated by moves ηsαη with αΦη are exactly Wλλ. Every strong-linkage chain stays in one such class. (Integral reflection linkage is an equivalence relation)

[F5]

The proper submodule J(λ) which is the sum of all proper submodules is the unique maximal submodule of M(λ). The quotient L(λ):=M(λ)/J(λ) is simple and is its unique simple quotient. (A Verma module has a unique simple quotient)

Proof

1.1

If λ<μ, dualize the sequence; exact self-duality of simples reverses the two labels, and splitting of the dual implies splitting of the original by biduality. Thus it is enough to treat the orientation λμ, which includes incomparable labels.

F1
2.1

Lift the highest vector of L(λ) to a vector vEλ. Such a weight lift exists because the sequence consists of weight modules. If a positive-root operator acted nontrivially on v, its image would lie in the submodule L(μ) at weight λ+α, forcing λ+αμ and hence λ<μ. Therefore v is singular, and the Verma universal property gives a map M(λ)E whose image H surjects onto L(λ). Here the support bound for each simple follows from its being the highest-weight Verma quotient.

F2F5algebrastep 1.1
3.1

The intersection HL(μ) is either zero or all of the simple submodule. In the latter case H=E, so E is a length-two quotient of M(λ) and L(μ) is a composition factor of that Verma. Strong linkage would imply μλ, and hence equality of integral-reflection classes, contrary to the hypothesis. Thus the intersection is zero, and HL(λ) is an isomorphism whose inverse is a section.

F3F4algebrastep 2.1

Depends on

Used by

Dependency tree · two levels

19 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