Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 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.

Central-character summands refine into linkage blocks

Statement

Assume the Axiom of Choice.

Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=h⊕n+. Write Q+=∑iZ≥0αi, μ≤λ when λ−μ∈Q+, and w⋅λ=w(λ+ρ)−ρ.

For a linkage class C=Wλ⋅λ, let OC be the full subcategory of objects all of whose simple composition factors have labels in C. Then O=⨁COC, and each nonzero OC is indecomposable as a categorical direct summand. These are precisely the blocks. Each OC lies in Oχλ; a central-character summand can contain several blocks. Independently, grouping weights by cosets of the root lattice Q gives a canonical coarser decomposition by weight cosets.

Facts & Assumptions

Given: The Axiom of Choice (The Axiom of Choice), 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=h⊕n+. Write Q+=∑iZ≥0αi, μ≤λ when λ−μ∈Q+, and w⋅λ=w(λ+ρ)−ρ. For a weight λ, define Φλ={α∈Φ:⟨λ+ρ,α∨⟩∈Z},Wλ=⟨sα:α∈Φλ⟩⊂W. Reflections and coroots are those of def-root-reflections-and-the-weyl-group-action, with the shift from def-weyl-vector-rho-for-a-chosen-positive-system. The integral-reflection linkage class through λ is Wλ⋅λ. The word integral includes zero and negative integral pairings. If Φλ is empty the generated group is {1}. This definition uses generating reflections; no identification with a root-lattice-coset stabilizer is assumed. (The integral Weyl group of a weight)

[F2]

Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=h⊕n+. Write Q+=∑iZ≥0α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)

[F3]

Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=h⊕n+. Write Q+=∑iZ≥0αi, μ≤λ when λ−μ∈Q+, and w⋅λ=w(λ+ρ)−ρ. A short exact sequence 0→L(μ)→E→L(λ)→0 in O splits whenever λ and μ belong to distinct integral-reflection linkage classes. (Simple extensions cannot cross linkage classes)

[F4]

Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=h⊕n+. Write Q+=∑iZ≥0αi, μ≤λ when λ−μ∈Q+, and w⋅λ=w(λ+ρ)−ρ. Partition the isomorphism classes of simple objects of O into parts Pt. Suppose every extension of two simples from different parts splits, in either order. Then each M∈O has a unique decomposition M=⨁tMt into submodules whose composition factors lie in Pt, with finitely many nonzero terms. This decomposition is functorial, and maps between modules supported on disjoint collections of parts are zero. (Splitting finite-length modules across separated simple classes)

[F5]

For α∈Φ+, if ⟨λ+ρ,α∨⟩∈Z>0, then M(sα⋅λ)↪M(λ). (Verma embedding for an arbitrary positive root)

[F6]

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)

[F7]

Under the Axiom of Choice, let χλ and χμ be the central characters obtained from highest weights λ and μ. Then χλ=χμif and only ifμ∈W⋅λ, where W⋅λ:={w(λ+ρ)−ρ:w∈W}. (Central characters are dot-Weyl orbits)

Proof

1.1F1F2F3F4

Integral-reflection orbits partition the simple labels, and extensions between simples in distinct parts split. The finite-length splitting lemma therefore gives the stated functorial decomposition with no cross-part morphisms. Each part contains its simple L(λ) and is nonzero.

2.1F6step 1.1

A Verma module is indecomposable: if it were a sum of two nonzero submodules, neither could be the whole module, and their sum would lie in the unique maximal proper submodule, a contradiction. Thus the decomposition just constructed places M(η) entirely in the part containing its simple quotient L(η).

3.1F1F5F6algebrastep 2.1

Let α∈Φη and replace it by its positive choice of sign, which leaves the reflection unchanged. Set k=⟨η+ρ,α∨⟩∈Z. If k>0, F5 embeds M(sα⋅η) in M(η). If k<0, the pairing at sα⋅η is −k>0, so F5 gives the reverse embedding. If k=0, the labels agree. In any categorical refinement the containing indecomposable Verma stays in one summand, so its two simple subquotients L(η) and L(sα⋅η) stay together.

4.1F2F4step 3.1

Every pair of labels in C is joined by a finite word of these moves. Hence all its simples stay together under any categorical refinement. A nonzero object of a putative second summand has a simple composition factor, which is impossible. Therefore OC is indecomposable, and the displayed direct sum lists all blocks.

5.1F7algebrastep 4.1

Every label in C lies in the full dot orbit, so under the stated Choice premise its simple module has character χλ. If a module has r such composition factors, each element of mχλ lowers its composition filtration by at least one step. Therefore mχλr annihilates the module; for zero use exponent 1. This proves OC⊂Oχλ.

6.1F1algebrastep 5.1∎

For each coset c∈h∗/Q the sum M(c)=⨁μ∈cMμ is a submodule, because root operators shift weights by roots and Cartan operators preserve weights. Their sum is direct and exhausts M; only finitely many occur, since finitely many weight generators occupy finitely many cosets. An integral-reflection move changes a label by an integral multiple of a root. Thus each linkage part occupies a single coset, but no converse identification with a coset stabilizer was used.

Depends on

Used by

Dependency tree · two levels

25 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