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.

The type-A support filtration multiplicities are intrinsic

Statement

Let M be a graded R-bimodule lying in FΔ∩F∇, so that it carries a Δ-flag and a ∇-flag. Then:

  1. the graded multiplicities (M:Δx(d)) and (M:∇x(d)) of Standard graph bimodules, support filtrations and characters are independent of the compatible enumeration of the flag, so that the character sums hΔ(M) and h∇(M) are functions of M alone;
  2. if M=M′⊕M′′ with M′,M′′∈FΔ∩F∇, then (M:Δx(d))=(M′:Δx(d))+(M′′:Δx(d)) and likewise for ∇; more generally the same holds for any direct summand N of M which itself lies in FΔ∩F∇.

Facts & Assumptions

Given: A graded R-bimodule M∈FΔ∩F∇, its length filtration Γ≥iM and Γ≤iM, and standard bimodules Rx{a} with graph index x∈Sn and generator degree a.

[F1]

A Δ-flag refines the length filtration Γ≥iM, a ∇-flag refines Γ≤iM, and (M:Δx(d)) is the multiplicity of Δx(d) in Γ≥iM/Γ≥i+1M for i=ℓ(x), with Δx(d)=Rx{ℓ(x)−d}, and (M:∇x(d)) the multiplicity of ∇x(d)=Rx{−ℓ(x)−d} in Γ≤iM/Γ≤i−1M (Standard graph bimodules, support filtrations and characters).

[F2]

Imported from Soergel Bemerkung 5.5 (with Krull–Schmidt 1.3 there): FΔ is stable under finite direct sums and under direct summands, and the same holds for F∇ (Standard graph bimodules, support filtrations and characters).

[F3]

Imported (Soergel Lemma 6.3 with its proof, recorded in the definition item): let B∈F∇, let y0,y1,… be an enumeration of Sn in which Bruhat-larger elements have larger index, put C(k)={y0,…,yk} and yk=y. Then the evident map Γ≤yB/Γ<yB→ΓC(k)B/ΓC(k−1)B is an isomorphism, both sides are finite direct sums of objects of the form ∇y(μ), and ∇y(μ) occurs in this quotient exactly (B:∇y(μ)) times as a direct summand; for FΔ the corresponding enumeration is descending in Bruhat order and the canonical layer is Γ≥yB/Γ>yB, a direct sum of Δy(μ) with the Δ-multiplicities. The proof compares two such enumerations through finitely many steps swapping two adjacent incomparable elements: incomparable elements of Sn differ by no reflection, so Ext1 vanishes between the corresponding standard subquotients and the two filtrations have the same subquotients up to order (Standard graph bimodules, support filtrations and characters).

Proof

1.1

Intrinsicness: choose a Bruhat-compatible enumeration y0,y1,… of Sn, listing larger elements later, and group the flag quotients by their graph index. For each y, [F3] identifies the quotient at that position with the canonical Bruhat layer Γ≤yM/Γ<yM and says it is a direct sum of ∇y(μ) with multiplicities exactly (M:∇y(μ)). This canonical layer depends only on M, so the multiplicities are independent of the compatible enumeration; the analogous assertion for Δ follows from the FΔ clause of [F3] and its canonical upper Bruhat layer. For a fixed graph, the multiplicities of its shifts are determined by the graded dimension after quotienting its free graph module by R+; thus they are intrinsic even among repeated copies of that graph. The comparison in [F3] swaps distinct incomparable graph indices, with the extension-vanishing argument already included there; grouping by graph index means no swap of repeated copies of one standard is needed. Hence both character sums depend only on M.

F3
2.1

Additivity: for every support set A one has ΓA(M′⊕M′′)=ΓAM′⊕ΓAM′′. Indeed the support of (m′,m′′) is the union of the two component supports, so it lies in Gr(A) exactly when each component does. Taking consecutive length cutoffs therefore identifies every length layer of M with the direct sum of the corresponding layers of M′ and M′′. Decomposing these layers into shifted graph modules adds their multiplicities. Equivalently one interleaves the two flags in length order, preserving the order within each flag. This proves additivity for both charts.

F1step 1.1
3.1

Direct summands: if N is a direct summand of M and N∈FΔ∩F∇, write M=N⊕N′. By [F2], the complement N′ is also in FΔ∩F∇. Additivity from step 2.1 shows that each multiplicity in M is the sum of the corresponding multiplicities in N and N′, and therefore the intrinsic formulas also apply to the summands. The flags are finite by the definition of these classes. ∎

F2step 2.1

Depends on

Used by

Dependency tree · two levels

14 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