Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedverified 2026-09-23 (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.

A singular integral A2 central-character summand

Example

Assume the Axiom of Choice (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(λ+ρ)−ρ.

In type A2, take λ=−ω1, with fundamental-weight coordinates ρ=(1,1). Then λ+ρ=ω2 has Weyl stabilizer ⟨s1⟩. The dot orbit consists of

−ω1,−2ω2,−2ω1−ω2.

These three simple labels form a single singular integral central-character block. Only labels and stabilizer are computed here.

Facts & Assumptions

Given: The Axiom of Choice, the setting above, and the hypotheses in the example.

[F1]

The category O is the categorical direct sum of its generalized central-character subcategories Oχ, with exact component projections (Generalized central-character decomposition of O).

[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(λ+ρ)−ρ. 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)

[F3]

Under the given Choice premise, 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)

[F4]

Let Φ be the root system from thm-the-root-set-is-a-reduced-crystallographic-root-system. For a root α, define the corresponding coroot by α∨:=2Hαα(Hα)∈h, where Hα is the vector from def-killing-dual-vector-attached-to-a-root. The associated root reflection is the linear map sα(λ):=λ−λ(α∨)α(λ∈h∗). The subgroup of GL⁡(h∗) generated by these reflections is the Weyl group W, acting on h∗ in the usual way. (Root reflections and the Weyl group action)

[F5]

Every simple object of O is L(η) for a unique highest weight η (The simple objects of O). Its generalized-character membership means each z−χ(z) acts locally nilpotently (Generalized central-character subcategories), while z acts on any cyclic highest-weight module by the scalar χη(z) (The Harish-Chandra projection computes the highest-weight scalar).

[F6]

Under the given Choice premise, every object of O has a finite composition series (Every object of O has finite length). Every Verma module M(η) has a unique simple quotient L(η) (A Verma module has a unique simple quotient).

[F7]

A positive integral simple-root pairing gives a nonzero Verma embedding in the reflected direction (Simple-reflection embeddings of Verma modules).

Verification

1.1F4algebra

With α1=2ω1−ω2 and α2=−ω1+2ω2, the reflection formula gives s1(a,b)=(−a,a+b) and s2(a,b)=(a+b,−b). Acting on (0,1) produces exactly (0,1),(1,−1),(−1,0): both reflection formulas permute this set and the three displayed points are reachable. Subtracting (1,1) gives (−1,0),(0,−2),(−2,−1), the claimed labels.

2.1algebrastep 1.1

Type A2 has six Weyl elements, as is also seen by the six distinct matrices 1,s1,s2,s1s2,s2s1,s1s2s1: multiplication by either generator permutes these six matrices. Exactly 1 and s1 fix (0,1), by evaluating them. Thus the stabilizer is ⟨s1⟩, and the orbit is singular.

3.1F2F3F5step 1.1step 2.1

The pairings of (0,1) with the positive coroots are 0,1,1. All are integers, so Φλ=Φ and Wλ=W by F2; the zero pairing does not remove its reflection from the integral group. By F3 the three computed labels have one central character χ. Conversely, a simple object of Oχ is L(η) by F5. On it every z acts both by χη(z) and locally with generalized eigenvalue χ(z), so χη=χ; F3 restricts η to the three labels in step 1.1. Thus these are exactly the simple objects of Oχ.

4.1F1F6F7step 3.1algebra∎

Write the labels as λ=−ω1, μ=−2ω2=s2⋅λ, and ν=−2ω1−ω2=s1⋅μ. Their shifted simple-root pairings are ⟨λ+ρ,α2∨⟩=1 and ⟨μ+ρ,α1∨⟩=1, so F7 gives M(ν)↪M(μ)↪M(λ). By F3 and the highest-weight scalar action in F5, all three Vermas lie in Oχ. The unique-simple-quotient property in F6 makes M(λ) indecomposable: in a decomposition into two nonzero submodules both would be proper, and their sum would lie in its unique maximal proper submodule. In any categorical direct-sum refinement of Oχ, M(λ) must lie in one component; its subquotients L(λ),L(μ),L(ν) therefore lie there too. These are all the simple objects by step 3.1, and F6 makes every nonzero object have a simple factor. Hence no other nonzero component exists: Oχ is indecomposable. F1 makes it a direct summand of O, so it is one singular integral block with exactly the three stated simple labels.

Notes

The source gives a typical three-element singular A2 class with an antidominant representative. This item chooses the explicit representative -omega1 of such a class and computes its coordinates; statement provenance is ai-altered to record that specialization.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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