Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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.

Type-A top support layers are controlled by reflection localization

Statement

For a reflection t=(a b) with a<b, fix the hyperplane equation ct:=βab=xa−xb of The standard type-A reflection realization and its polynomial ring. For y∈Sn put py:=∏t: yt<yct∈R. Let M be a Bott–Samelson bimodule or a direct summand of one, with its support submodules ΓyM⊆Γ≤yM⊆M and ΓyM⊆Γ≥yM⊆M and the y-layer quotients Γ‾≤yM=Γ≤yM/Γ<yM and Γ‾≥yM=Γ≥yM/Γ>yM of Standard graph bimodules, support filtrations and characters, and write ΓyM:=M/Γ≠yM for Soergel's y-layer quotient. Then:

  1. the natural morphism ΓyM→Γ‾≤yM, the inclusion of the y-layer into the lower support submodule followed by the quotient map, is injective with image the submodule py⋅Γ‾≤yM obtained as the image of right multiplication by py, so it becomes an isomorphism after inverting py, that is ΓyM≅(Γ‾≤yM)py, and the y-layer is generated by the lower y-layer after inverting the hyperplane equations of the reflections t with yt<y;
  2. dually, the natural morphism Γ‾≥yM→ΓyM=M/Γ≠yM is injective with image the image py⋅ΓyM of right multiplication by py, so it becomes an isomorphism after the same inversion, that is Γ‾≥yM≅(ΓyM)py and the upper y-layer is determined by the y-layer quotient after inverting py;
  3. in particular the graded ranks satisfy rk⁡ΓyM=∑ν(M:∇y(ν))vℓ(y)−ν and rk⁡ΓyM=∑ν(M:Δy(ν))v−ℓ(y)−ν, so that each graded rank determines the corresponding y-multiplicities of its support flag.

The inclusion chains displayed above are two separate chains: the lower and the upper support submodule are not nested in general, and because the cutoffs of Standard graph bimodules, support filtrations and characters are the Bruhat principal sets {x:x≤y} and {x:x≥y} of Soergel's Notation 6.1, their intersection is exactly ΓyM=Γ≤yM∩Γ≥yM. This is Soergel's Satz 6.6 in the notation of his Notation 6.1; the localization input is his Lemma 6.10, quoted in the Facts block, and the rank identities are the computation of Satz 6.6's proof.

Facts & Assumptions

Given: An element y∈Sn, the polynomial ring R with the reflections of Sn and their fixed hyperplanes in V=Spec⁡R, a Bott–Samelson bimodule M or a direct summand of one, and the elements py=∏yt<yct.

[F1]

ΓyM is the support sub-bimodule on the single graph Gr(y); Γ≤yM=Γ{x:x≤y}M and Γ≥yM=Γ{x:x≥y}M are the Bruhat lower and upper support submodules, so that both contain ΓyM and their intersection is ΓyM; Γ‾≤yM=Γ≤yM/Γ<yM and Γ‾≥yM=Γ≥yM/Γ>yM are the two y-layer quotients and ΓyM=M/Γ≠yM is the y-layer quotient of Notation 6.1; the filtration multiplicity (M:Δy(d)) counts Δy(d) in the upper y-layer and (M:∇y(d)) counts ∇y(d) in the lower y-layer (Standard graph bimodules, support filtrations and characters).

[F2]

M has finitely many support layers, all of the form Gr(x) for x∈Sn, and each layer is a finite direct sum of standard bimodules, so every Γ-submodule of M is finitely generated and the multiplicities of [F1] are defined and intrinsic (The type-A support filtration multiplicities are intrinsic, Bott–Samelson bimodules carry delta and nabla support filtrations).

[F3]

The two y-layer quotients are finite direct sums of shifted standards, Γ‾≤yM≅⨁ν∇y(ν)(M:∇y(ν)) and Γ‾≥yM≅⨁νΔy(ν)(M:Δy(ν)), with the multiplicities of [F1] (Bruhat-refining enumeration of Soergel's Lemma 6.3, recorded in the definition) (Standard graph bimodules, support filtrations and characters).

[F4]

For a Bott–Samelson bimodule B, evaluation at the generator identifies Hom⁡R-R(Ry,B) with ΓyB, and the four y-layers Γ‾≤yB, Γ‾≥yB, ΓyB and ΓyB are free graded right R-modules on which R⊗kR acts through Ry (Soergel Proposition 6.4, recorded in the definition). These properties pass to a direct summand M=eB: the support functors, their quotients, and the evaluation map commute with the idempotent e, while a graded summand of a finite free module over the positively graded polynomial ring R is graded free by graded Nakayama. Thus the same evaluation and freeness statements hold for every M in the statement (Standard graph bimodules, support filtrations and characters).

[F5]

Imported (Soergel Satz 6.6, with the observation at the start of the proof of Lemma 6.13 that the isomorphism ΓyN≅(Γ‾≤yN)py of Satz 6.6 holds for every N in the additive closure of the Bott–Samelson bimodules as well): for M a Bott–Samelson bimodule or a direct summand of one the natural morphisms ΓyM→Γ‾≤yM and Γ‾≥yM→ΓyM are injective with images the images py⋅Γ‾≤yM and py⋅ΓyM of right multiplication by py, and they induce the isomorphisms ΓyM≅(Γ‾≤yM)py and Γ‾≥yM≅(ΓyM)py (Standard graph bimodules, support filtrations and characters).

Proof

1.1

Injectivity and image: [F5] provides both natural morphisms with their injectivity and their images, and the two localisation statements are equivalent to these: localising the inclusion pyΓ‾≤yM⊆Γ‾≤yM at py gives an equality because every element n of the localised target is (1/py)(pyn) with pyn in the image, and conversely a morphism which is injective with py-divisible image has localisation an isomorphism; the same argument applies to Γ‾≥yM→ΓyM. [F5] 1.2 Ranks of the layer quotients: by [F1] and [F3] the two y-layer quotients are direct sums of copies of ∇y(ν)=Ry{−ℓ(y)−ν} and of Δy(ν)=Ry{ℓ(y)−ν}, so their graded ranks are rk⁡Γ‾≤yM=∑ν(M:∇y(ν))v−ℓ(y)−ν and rk⁡Γ‾≥yM=∑ν(M:Δy(ν))vℓ(y)−ν; the element py is homogeneous of degree 2ℓ(y), because each ct is a linear form of degree 2 and the number of reflections t with yt<y equals ℓ(y), and multiplication by a nonzero homogeneous element of a free graded right R-module is injective and raises degrees by its own degree; the sums are finite and their coefficients are the intrinsic multiplicities of [F2]. [F1, F2, F3, F4] 2.1 The two rank identities: by step 1.1 the modules ΓyM and pyΓ‾≤yM are isomorphic, so by step 1.2 rk⁡ΓyM=v2ℓ(y)rk⁡Γ‾≤yM=∑ν(M:∇y(ν))vℓ(y)−ν; dually ΓyM is isomorphic to the quotient, inverse to the inclusion, of pyΓyM, so rk⁡ΓyM=v−2ℓ(y)rk⁡Γ‾≥yM=∑ν(M:Δy(ν))v−ℓ(y)−ν, both computations using that the four modules of [F4] are free and hence py-torsion-free. [F4, step 1.1, step 1.2] 3.1 Conclusion: claims (1) and (2) are steps 1.1 and 2.1 read together with [F5], and claim (3) is the pair of rank identities of step 2.1; the result is stated for Bott–Samelson bimodules and their direct summands because [F5] is, and no statement about the full Hom formula for arbitrary summands is used. ∎

step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

16 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