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

Positive Rouquier complexes are Delta-split

Facts & Assumptions

Given: A reduced expression x‾=s1⋯sm for x, the positive generator complex Fs=[Bs→μR(1)] in degrees 0,1, and the upper Bruhat support-layer functors (The positive and negative Rouquier generator complexes, The Rouquier complex of a braid word, Standard graph bimodules, support filtrations and characters).

[F1]

Graph flags are locally proved and have their intrinsic canonical Bruhat layers. An extension between the pair Ry,Rys splits when the right action is restricted to Rs: in its right-linear presentation the anti-invariant coordinate has matrix (ah0−a), whose square is a2I, while right-s-invariants have identical diagonal action (Bott–Samelson bimodules carry delta and nabla support filtrations, The type-A support filtration multiplicities are intrinsic, Type-A graph-bimodule extension vanishing).

[F2]

The right tensor with Bs is exact on these carriers and preserves finite right freeness; support is changed from a set A to at most A∪As (Soergel generators and Bott–Samelson products are finite free on both sides, Bott–Samelson bimodules carry delta and nabla support filtrations).

[F3]

Minimalization removes split contractible two-term complexes and leaves a homotopy-equivalent direct summand (Radical quotients, minimal complexes and perverse filtrations in the Soergel category). Applying any additive support-layer functor preserves its contracting homotopy.

Statement

Let x‾ be a reduced expression for x∈Sn and let Fx‾ be the Rouquier complex Fs1⋯Fsm (or its minimal subcomplex). Then for every y∈Sn there is an isomorphism in the homotopy category of graded bimodules Γ≥y(Fx‾)/Γ>y(Fx‾)  ≅  {Δx,y=x,0,y≠x, where Δx=Rx(−ℓ(x)). Equivalently: the Bruhat support subquotient of a positive Rouquier complex is contractible except in the top layer Δx; Fx‾ is Δ-split in the sense that each of its support subquotients is a direct sum of standard bimodules, and the top layer is a single Δx. No positivity of characters and no assumption S is used; the statement is unconditional for every finite type-A Coxeter group and the coordinate reflection realization.

Proof

1.1basegivenF1

Induct on the word length. For the empty word Fe=R has just Δe; for one letter the exact rank-one sequence is 0→Rs(−1)→Bs→μR(1)→0. Its upper s layer is Rs(−1)=Δs, and its identity layer is the isomorphism R(1)→R(1), hence contractible. This starts the induction directly for positive complexes; no inverse generator is identified with a positive one.

1.2F1F2algebra

Choose a Bruhat-compatible enumeration grouped into right-s cosets, listing y before ys when y<ys. This exists by ordering the minimal representatives of the finite cosets in Bruhat order and refining each pair; the lifting property from reduced subwords ensures that different coset comparisons respect this order. Every union of complete initial or terminal cosets is right-s-stable. For such a set A, ΓA(MBs)=ΓA(M)Bs: the cut and quotient have graph flags, whose free layers split on the right; after exact tensoring, their generic graph supports lie respectively in A and its stable complement. The quotient remains right-free by its flag, so an A-supported element of it is generically zero and hence zero. This proves the cut identity and its analogous consecutive-coset quotient identity.

2.1step 1.1step 1.2F1F2ih

Write x=zs with ℓ(x)=ℓ(z)+1. Every term of Fz is supported on subexpressions of a reduced word for z, hence on labels at most z. In particular its x layer is zero termwise, not merely contractible. Its paired layer on {z,x} is therefore its single z layer, homotopy equivalent as a full bimodule complex to Δz by induction. The cut identity of step 1.2 identifies the paired layer of FzFs with the cone of the natural multiplication map from this paired layer tensored with Bs to its shift (1). A full bimodule homotopy equivalence commutes with this natural counit and induces a homotopy equivalence of the cones. Thus this paired layer is the rank-one graph complex [Rz(−ℓ(z))Bs→Rz(−ℓ(z)+1)]. Its high x layer is the kernel graph Rx(−ℓ(x))=Δx, and its low z layer is an isomorphism onto Rz(−ℓ(z)+1) and contracts. The two single-layer functors of the paired layer are the original canonical single layers: the support cut and quotient flag, in the chosen enumeration, contain exactly those two labels, so their submodule and quotient are respectively its high and low graph layers. This proves the two required layers with the counit compatibility retained.

3.1step 1.2step 2.1F1F2ih

On any other pair, both single layers of Fz contract by induction. Their paired sequence becomes termwise split after restriction to right Rs, by [F1]. Tensoring with Bs yields a triangle with contractible outside terms, so its paired tensor layer contracts. Applying either single-layer functor preserves its homotopy and gives contractible single layers of FzBs. The same single layers of Fz(1) contract already by induction. Since FzFs is the cone of the natural multiplication map FzBs→Fz(1) with its standard shift, and an additive layer functor commutes with cones, both resulting single layers also contract. This treats every non-top pair without claiming that arbitrary complexes with zero Euler character contract.

4.1step 2.1step 3.1F1F3discharge-induction: step 3.1∎

The paired enumeration covers every graph; its single layers equal the canonical Bruhat layers by [F1]. Steps 2.1 and 3.1 prove the asserted homotopy isomorphism for the word complex. By [F3] every layer of a removed contractible summand remains contractible, so the same isomorphism holds for its minimal summand. This is exactly the stated Δ-split property, obtained without any S or Hodge assumption.

Depends on

Used by

Dependency tree · two levels

42 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