Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 and from a single wall on standard modules

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let (λ,μ,α) be a single-wall translation datum with translating weight ν, wall reflection s=sα, and E=L(ν), and let Tλμ and Tμλ be the translation functors of Translation functors by tensoring and projection. Then:

  1. TλμΔ(w⋅λ)≅Δ(w⋅μ) for every w∈W;
  2. TμλΔ(w⋅μ) has a finite Verma flag with exactly two factors, Δ(w⋅λ) and Δ(w⋅(s⋅λ))=Δ(ws⋅λ), each occurring with multiplicity one; in particular its class in the Grothendieck group is [Δ(w⋅λ)]+[Δ(ws⋅λ)].

Facts & Assumptions

Given: The Axiom of Choice and a single-wall translation datum (λ,μ,α) with translating weight ν, wall reflection s, and E=L(ν); write λ∙=λ+ρ and μ∙=μ+ρ.

[F1]

The datum gives integral dot-antidominant λ,μ with λ∙ regular and Stab⁡W(μ∙)={1,s}; the functors are Tλμ=pr⁡χμ∘(E⊗−)∘incl⁡χλ and Tμλ=pr⁡χλ∘(E∗⊗−)∘incl⁡χμ with E∗=L(ν)∗=L(−w0ν) finite-dimensional and h-semisimple; central characters satisfy χη=χη′ exactly when η′∈W⋅η (Dot-Weyl facets and single-wall translation data, Translation functors by tensoring and projection, Highest weight of the dual representation, Central characters are dot-Weyl orbits).

[F2]

For every weight λ′ the tensor E⊗Δ(λ′) and E∗⊗Δ(λ′) have finite Verma flags with (E⊗Δ(λ′):Δ(η))=dim⁡Eη−λ′ and (E∗⊗Δ(λ′):Δ(η))=dim⁡Eη−λ′∗=dim⁡Eλ′−η; weights of E=L(ν) satisfy ∣γ∣≤∣ν∣ with equality exactly for γ∈Wν, and every weight of Wν has multiplicity one (Finite-dimensional tensoring preserves Verma flags, Weights of a finite-dimensional simple module lie in the norm ball).

[F3]

For dominant ξ,η in the real span of the roots, ∣ξ−wη∣≥∣ξ−η∣ with equality exactly when wη∈Stab⁡W(ξ)η (A dominant vector minimises its distance to a dominant weight, Integral, dominant, and strictly dominant weights).

[F4]

The central-character projections are exact (Generalized central-character decomposition of O). The center preserves a Verma module’s one-dimensional highest line and commutes with its cyclic generator action, so it acts by the highest weight central character on the whole Verma module. Thus applying pr⁡χ to a Verma flag keeps exactly its factors with character χ and sends the other factors to zero. Deleting repetitions gives a Verma flag of the projection. A one-factor flag identifies its object with that Verma module (Finite Verma flags and their multiplicities).

[F5]

If (λ,μ,α) is a single-wall datum with translating weight ν and E=L(ν), then w′⋅μ=w⋅λ+γ for a weight γ of E implies w′⋅μ=w⋅μ and γ=w(μ−λ), so among labels of central character χμ only Δ(w⋅μ) occurs in the flag of E⊗Δ(w⋅λ), once (The single-wall tensor-weight exclusion lemma).

[F6]

The functors Tλμ, Tμλ are exact (Translation functors are exact and biadjoint).

Proof

technique · direct: compute the Verma flags of the two tensors, keep the factors with the target central character, and read off the surviving factors
1.1F1F2F5algebra

Claim (1). Let η=w′⋅μ be a label in the dot orbit of μ with dim⁡Eη−w⋅λ≠0, and put γ:=η−w⋅λ; then w′⋅μ=w⋅λ+γ and γ is a weight of E, so [F5] gives η=w′⋅μ=w⋅μ and γ=w(μ−λ), which occurs in E with multiplicity one. Hence in the flag of E⊗Δ(w⋅λ) supplied by [F2], the only label of central character χμ (equivalently, the only label in the dot orbit of μ, by [F1]) is η=w⋅μ, with multiplicity one.

1.2F1F2F3algebra

Claim (2). Let η=w′⋅λ be a label in the dot orbit of λ with dim⁡Eη−w⋅μ∗≠0, and set γ:=w⋅μ−η; by [F2] the weight γ is a weight of E and ∣γ∣≤∣ν∣. Since w′⋅λ=w′(λ∙)−ρ and w⋅μ=w(μ∙)−ρ, setting x=(w′)−1w gives (w′)−1(−γ)=λ∙−xμ∙, so ∣λ∙−xμ∙∣=∣γ∣. By [F2] ∣ν∣=∣μ∙−λ∙∣, while [F3] applied to the dominant weights ξ=−λ∙ and η′=−μ∙ gives ∣μ∙−λ∙∣≤∣λ∙−xμ∙∣. Hence equality holds throughout, and the equality case of [F3] gives xη′∈Stab⁡W(ξ)η′, and regularity of λ∙ makes Stab⁡W(ξ)={1}. Consequently xμ∙=μ∙, and the datum Stab⁡W(μ∙)={1,s} forces x∈{1,s}. Therefore η=w′⋅λ=wx−1⋅λ equals w⋅λ or ws⋅λ, and in both cases (w′)−1(−γ)=λ∙−μ∙ (using sμ∙=μ∙ when x=s), so −γ=w′(λ∙−μ∙) and γ=w′(μ−λ) lies in W(μ−λ)=Wν; by [F2] it occurs in E with multiplicity one. Conversely, taking w′=w or w′=ws gives γ=w′(μ−λ)∈Wν, so both proposed factors occur once; their labels are distinct because λ∙ is regular.

2.1F4step 1.1

For claim (1), the object TλμΔ(w⋅λ)=pr⁡χμ(E⊗Δ(w⋅λ)) is Verma-filtered by [F4], and by step 1.1 its only nonzero multiplicity is (TλμΔ(w⋅λ):Δ(w⋅μ))=1; by [F4] it is therefore isomorphic to Δ(w⋅μ).

2.2F4step 1.2

For claim (2), the object TμλΔ(w⋅μ)=pr⁡χλ(E∗⊗Δ(w⋅μ)) is Verma-filtered by [F4]; by step 1.2 its nonzero multiplicities among labels of central character χλ are exactly one at Δ(w⋅λ) and one at Δ(ws⋅λ), and all other multiplicity vanish because their labels have different central character. Hence it has a finite Verma flag with exactly these two factors, each once, and its class in the Grothendieck group is [Δ(w⋅λ)]+[Δ(ws⋅λ)].

3.1F6step 2.1step 2.2∎

Steps 2.1 and 2.2 prove the two claims of the statement; with [F6] recording that the two translation functors are exact, the theorem follows.

Depends on

Used by

Dependency tree · two levels

57 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