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

Translation to the wall on Verma, simple and projective objects

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let (λ,μ) be as in The facet tensor-weight exclusion lemma: λ integral dot-antidominant and dot-regular, μ integral dot-antidominant with Fμ in the closure of the chamber Fλ, J=J(μ), Wμ=WJ. Let ν be the unique dominant weight of W(μ−λ) and let T:=Tλμ=pr⁡χμ∘(L(ν)⊗−)∘incl⁡χλ ⁣:Oλ⟶Oμ,T′:=Tμλ, be the translation functors of Translation functors by tensoring and projection, which are exact and biadjoint (Translation functors are exact and biadjoint). Then:

(1) TΔ(w⋅λ)≅Δ(w⋅μ) and T∇(w⋅λ)≅∇(w⋅μ) for every w∈W.

(2) TL(w⋅λ)≅L(w⋅μ) if w∈WJ, and TL(w⋅λ)=0 otherwise; equivalently TL(w⋅λ)≠0 if and only if w lies in the set WJ of minimal representatives of the cosets wWJ.

(3) (Big projective on the wall.) Let Ξμ:=T−ρμL(−ρ) be the translate of the simple object of the most singular block. Then Ξμ is projective and injective in Oμ, it is the projective cover P(1⋅μ) of L(μ), and (Ξμ:Δ(w⋅μ))=1 for every distinct orbit label (equivalently for its representatives w∈WJ); consequently (P(μ):Δ(y⋅μ))=1 for every distinct label y∈WJ and [Δ(w⋅μ):L(μ)]=1 for all w∈W.

Facts & Assumptions

Given: The facet data (λ,μ) of The facet tensor-weight exclusion lemma with J=J(μ), Wμ=WJ, the translating weight ν and E=L(ν); the functors T=Tλμ, T′=Tμλ of Translation functors by tensoring and projection with E∗=L(ν)∗; write λ∙=λ+ρ, μ∙=μ+ρ.

[F1]

T=pr⁡χμ∘(E⊗−)∘incl⁡χλ and T′=pr⁡χλ∘(E∗⊗−)∘incl⁡χμ; inclusions and projections are exact, and O is the direct sum of its central-character blocks (Translation functors by tensoring and projection, Generalized central-character decomposition of O, Central characters are dot-Weyl orbits).

[F2]

T and T′ are exact and each is both a left and a right adjoint of the other; they send projectives to projectives and injectives to injectives (Translation functors are exact and biadjoint).

[F3]

The unique-factor clause: for every w∈W, the tensor E⊗Δ(w⋅λ) has exactly one Verma factor with central character χμ, namely Δ(w⋅μ), of multiplicity one (The facet tensor-weight exclusion lemma).

[F4]

Tensoring with E preserves finite Verma flags: E⊗Δ(η) has a finite Verma flag with factors Δ(η+γ), γ running over the weights of E with multiplicity dim⁡Eγ; the flag factors of E⊗X for Verma-filtered X are computed by convolution (Finite-dimensional tensoring preserves Verma flags).

[F5]

The block Oμ: J(μ) indexes the vanishing simple coroot pairings of μ∙, WJ is the dot stabilizer of μ, the labels w⋅μ depend only on wWJ, and WJ is the set of minimal right coset representatives (The singular integral block and its dot stabilizer, Dot-Weyl facets and single-wall translation data).

[F6]

Restricted Chevalley duality: D(M)η=Mη∗ with the τ-twisted action; D is an exact contravariant involution of O, preserves weight-space dimensions, simple composition multiplicities and central-character blocks, and D(L(η))≅L(η), D(Δ(η))=∇(η) (Restricted duality is exact and involutive on O, Standard and costandard objects). For finite-dimensional E, the natural tensor-dual identification is D(E)⊗D(M)≅D(E⊗M), with the Chevalley-twisted dual D(E), not the ordinary dual E∗.

[F8]

For a dominant integral weight ν, every weight γ of L(ν) satisfies ∣γ∣≤∣ν∣, with equality exactly when γ∈Wν, and every weight of the orbit Wν occurs in L(ν) with multiplicity one (Weights of a finite-dimensional simple module lie in the norm ball).

[F7]

Each Verma has the unique simple head L(η) (A Verma module has a unique simple quotient), whose dual is the simple socle of its costandard by [F6]. BGG data: a nonzero g-homomorphism M(η)→M(ζ) exists if and only if η↑ζ in the strong linkage order (The BGG criterion for homomorphisms between Verma modules), such a map is injective (A nonzero homomorphism between Verma modules is injective), BGG reciprocity (P(η):Δ(ζ))=[Δ(ζ):L(η)] holds with finitely many nonzero multiplicities (BGG reciprocity, Finite Verma flags and their multiplicities, Projectives in category O have finite Verma flags), and Hom⁡(Δ(η),∇(ζ)) is 0 or one-dimensional according as η≠ζ or η=ζ (Standard-costandard Hom and Ext-one orthogonality). Every object of O has finite length and finite-length objects decompose into indecomposables (The simple objects of O, Fitting decomposition in a finite-length abelian category, Projective covers in O are indecomposable and unique, Category O has enough projectives).

[F9]

Orbit and weight bounds: for dot-antidominant integral η, applying Dominant integral weights are maxima of their Weyl orbits to −η−ρ gives w⋅η≥η for every w. Verma weights lie in η−Q+ and the highest-weight space is one dimensional (Weights of a Verma module lie below lambda). By the central-character and simple-label facts in [F1], [F7], every composition factor of M(η) has its highest weight in W⋅η; the two bounds force that weight to equal η. Exactness of weight spaces and the one-dimensional top then force length one. Thus M(η)=L(η), including singular η and η=−ρ.

[F10]

Finite-Weyl root/length criterion (Finite Weyl strong exchange and deletion): ℓ(wsj)<ℓ(w) iff wαj<0, and ℓ(siv)>ℓ(v) iff v−1αi>0. Positive roots of a parabolic subsystem are nonnegative combinations of its simple roots, so wαj>0 for all j∈J implies wΦJ+⊆Φ+.

Proof

technique · direct: compute $T$ on standards by the unique surviving factor, transport to costandards by restricted duality, decide simple survival by the nonminimal Verma embedding, and manufacture the big projective from the most singular block
1.1F1F3F4algebra

Standards (first clause of (1)). By [F3], the tensor E⊗Δ(w⋅λ) has a finite Verma flag by [F4] in which the unique factor with central character χμ is Δ(w⋅μ), once. The exact projection pr⁡χμ applied to this flag kills every factor whose central character differs from χμ and carries the remaining Δ(w⋅μ) isomorphically, so TΔ(w⋅λ)≅Δ(w⋅μ) for every w.

1.2F1F2F4F5F6F7F8F9F10algebra

The big projective (3). By [F9], M(−ρ)=L(−ρ). Its dot orbit is a singleton, so BGG reciprocity [F7] gives a one-factor Verma flag for P(−ρ), proving P(−ρ)=L(−ρ). Simple-preserving duality makes it injective too. Put E0=L(w0μ∙) and S=T−ρμ, whose adjoint is S′=Tμ−ρ; the ordinary dual E0∗ has highest weight −μ∙. By [F2], Ξμ=SL(−ρ) is projective and injective. Tensoring M(−ρ) with E0 and projecting retains exactly the factors Δ(−ρ+γ) with γ∈Wμ∙, each once by [F4], [F8]. These are precisely the distinct standards Δ(y⋅μ). Likewise, since L(μ)=M(μ) by [F9], tensoring it with E0∗ and projecting to χ−ρ retains only Δ(−ρ), once, from the extremal weight −μ∙. Thus S′L(μ)=L(−ρ), and adjunction gives dim⁡Hom⁡(Ξμ,L(μ))=1. The resulting epimorphism splits off the projective cover P(μ): lift it through the cover, use essentiality to make the lift surjective, and split by projectivity. For every y, there is an injection M(μ)↪M(y⋅μ). Indeed induct on a reduced expression y=siv: [F10] gives v−1αi>0, so ⟨v(μ∙),αi∨⟩≤0. If it is zero the weights coincide; otherwise the positive integral pairing at siv⋅μ supplies the one-step strong linkage and the injection M(v⋅μ)↪M(siv⋅μ) by [F7]. Compose these injections. BGG then gives (P(μ):Δ(y⋅μ))≥1 for every distinct label. The direct-summand complement of P(μ) in Ξμ is projective and has a Verma flag by [F7]. Additivity and the already computed one-per-label flag of Ξμ force every flag multiplicity of the complement to vanish, so the complement is zero. Hence Ξμ=P(μ) and all the displayed standard and composition multiplicities are one.

2.1F5F7F10step 1.1algebra

Nonminimal vanishing (second half of (2)). Suppose w∉WJ; then there is a simple s∈J with ℓ(ws)<ℓ(w), equivalently wαs<0 by [F10]. Then w⋅λ−ws⋅λ=w(λ−s⋅λ)=⟨λ∙,αs∨⟩ wαs with ⟨λ∙,αs∨⟩<0 and wαs<0, so w⋅λ−ws⋅λ∈Q+∖{0}: ws⋅λ is strictly below w⋅λ. Put β=−wαs∈Φ+; then sβw=ws and ⟨wλ∙,β∨⟩=−⟨λ∙,αs∨⟩∈Z>0. This is a one-step strong linkage, so [F7] gives a nonzero (hence injective) map Δ(ws⋅λ)→Δ(w⋅λ) by [F7]. Applying the exact functor T and step 1.1 gives a map Δ(ws⋅μ)→Δ(w⋅μ); now ws⋅μ=w⋅(s⋅μ)=w⋅μ because s∈J fixes μ [F5], so this is an injective endomorphism of the finite-length module Δ(w⋅μ), hence an isomorphism. If N is the cokernel of Δ(ws⋅λ)→Δ(w⋅λ), exactness of T gives TN=0; since L(w⋅λ) is a quotient of N (the kernel of Δ(w⋅λ)↠L(w⋅λ) contains Δ(ws⋅λ) because the latter has no composition factor L(w⋅λ), its weights being strictly below), TL(w⋅λ)=0.

2.2F1F6step 1.1algebra

Costandards (second clause of (1)). The evaluation pairing gives D(E⊗M)≅D(E)⊗D(M) naturally, and D(E)≅E for the finite-dimensional simple E by [F6]. Hence E⊗∇(w⋅λ)=E⊗DΔ(w⋅λ)≅D(E⊗Δ(w⋅λ)). Since D preserves central-character blocks and is exact, it commutes with the inclusion and projection defining the translation functor, so T∇(w⋅λ)=pr⁡χμ(E⊗∇(w⋅λ))≅D(pr⁡χμ(E⊗Δ(w⋅λ)))≅DΔ(w⋅μ)=∇(w⋅μ) by step 1.1.

3.1F6F7step 1.1step 2.2algebra

A translated simple is simple or zero. For every x∈W, apply exact T to Δ(x⋅λ)↠L(x⋅λ)↪∇(x⋅λ). Steps 1.1 and 2.2 give a surjection Δ(x⋅μ)↠TL(x⋅λ) followed by an injection into ∇(x⋅μ). If the intermediate object is nonzero, the composite is nonzero; the one-dimensional standard-costandard Hom of [F7] makes its image the canonical simple L(x⋅μ). The injection identifies the intermediate object with that image. Thus TL(x⋅λ) is either zero or L(x⋅μ), without any unstated Bruhat support assertion.

4.1F5step 1.1step 2.1step 3.1algebra

Minimal survival. Let w∈WJ and translate a composition series of Δ(w⋅λ). Its image is Δ(w⋅μ), whose head L(w⋅μ) occurs as a composition factor. By step 3.1 that factor is the image of some L(x⋅λ) with x⋅μ=w⋅μ. Step 2.1 kills every nonminimal x, and [F5] says that the coset wWJ has exactly one minimal representative, namely w. Thus TL(w⋅λ) is nonzero and equals L(w⋅μ) by step 3.1. Together with step 2.1 this proves (2).

5.1step 1.1step 2.1step 1.2step 2.2step 3.1step 4.1∎

Part (1) is steps 1.1 and 2.2; part (2) is steps 2.1 and 3.1 together with the simplicity statement of step 4.1; part (3) is step 1.2.

Remarks

Upper closure. The upper closure in Dot-Weyl facets and single-wall translation data preserves strictly positive pairings and allows a negative pairing to become zero. Consequently Fw⋅μ⊆Fw⋅λ+ holds exactly when wΦJ+⊆Φ+: zeros at the translated walls are allowed precisely when the corresponding regular pairings were negative. This is equivalent to wαj>0 for all j∈J, hence to w∈WJ by [F10]. The criterion therefore agrees with (2). In sl2, F0+=(−1,∞) excludes the wall −1, whereas F−2+=(−∞,−1] includes it, in agreement with TL(0)=0 and TL(−2)=L(−1). This is Chen Definition 3.9, Theorem 3.12 and Example 3.16; ordinary closure must not be substituted for upper closure.

Only the big antidominant projective Ξμ=P(μ) carries every distinct singular standard exactly once; other singular projectives need not contain all standards, so no universal lower bound (P:Δ)≥1 is asserted for arbitrary projectives.

Depends on

Used by

Dependency tree · two levels

92 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