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 graph-bimodule extension vanishing

Statement

Let x≠y∈Sn and let r:=n−dim⁡Vx−1y be the codimension in either graph of the intersection Gr(x)∩Gr(y); here x−1y acts on V=kn by place permutation, so r=1 exactly when x−1y is a reflection.

  1. If r≥2, then every graded short exact sequence of graded R-bimodules 0→Ry(b)→E→Rx(a)→0 splits.
  2. If y=xt for a reflection t, then r=1 and every such extension splits after inverting the equation of the hyperplane fixed by the reflection xtx−1=yx−1, i.e. after inverting x(αt) (a unit multiple of αyx−1); restricted to the case x=e this is localizing in the hyperplane equation αt itself.

Facts & Assumptions

Given: Distinct x,y∈Sn, the graph bimodules Rx,Ry, the graded bimodules Rx(a)=Rx shifted by a and Ry(b), and, for the reduction, the generators ℓi:=xi⊗1−1⊗xx−1i of the graph ideal I(Gr(x)).

[F1]

Rw is R as a graded k-space with left action f⋅g=fg and right action g⋅h=w(h)g, and its support is Gr(w)={(wλ,λ)}; also Hom⁡R-R(Rv(a),Rw(b))≅R(b−a) for v=w and 0 for v≠w (Standard graph bimodules, support filtrations and characters).

[F2]

For s=si one has R=Rsi⊕αiRsi, the Demazure operator ∂i(f)=(f−si(f))/αi satisfies ∂i(αih)=2h for h∈Rsi, and the realization is faithful with all 2mst invertible in k=Q (The standard type-A reflection realization and its polynomial ring).

Proof

1.1

Set I:=I(Gr(x))=Ann⁡(Rx), generated by ℓ1,…,ℓn, and fix a homogeneous lift e∈E of the generator 1Rx(a), so that the sub identifies with Ry(b) through a chosen generator ι of degree −b. Since every h∈I kills the image of e in Rx(a), one has h⋅e∈Ry(b), so h⋅e=c(h)ι for a unique homogeneous element c(h)∈R, and E is generated over R by e and ι with the single family of relations h⋅e=c(h)ι.

F1
2.1

The assignment h↦c(h) is additive and satisfies c(hh′)=(action of h on Ry)⋅c(h′) because (hh′)⋅e=h⋅(c(h′)ι)=h⋅(c(h′)ι) in the sub-bimodule Ry(b); writing ui for the image of ℓi under R⊗R→Ry, h↦h⋅1Ry, one has ui c(ℓj)=uj c(ℓi) for all i,j, since ℓiℓj=ℓjℓi and c(ℓiℓj)=ui c(ℓj). Writing mi:=c(ℓi), the extension is thus encoded by elements m1,…,mn∈R with uimj=ujmi for all i,j, and nothing else.

step 1.1F1
2.2

The forms ℓi lie in the linear span of the variables of R⊗R, and their images are ui=xi−xyx−1i: acting on 1Ry one has xi⋅1=xi and (1⊗xx−1i)⋅1=xyx−1i. Hence the ideal generated by the ui is the ideal of the subspace Vyx−1 of V, the rank of the family (ui) is r=n−dim⁡Vyx−1=n−dim⁡Vx−1y, and Gr(x)∩Gr(y)={(xλ,λ):x−1yλ=λ}, of dimension dim⁡Vx−1y in either graph.

step 1.1F1F2
3.1

Splitting: the extension splits iff there is m∈R with mi=uim for all i. Indeed a splitting of the sequence is exactly a homogeneous R-bimodule section of E→Rx(a), which has the form 1Rx(a)↦e′ with e′∈E lifting the generator; writing e′=e−mι for some m∈R, the section is well defined iff I⋅e′=0, i.e. iff ℓi⋅(e−mι)=0 for all i, that is mi=uim for all i. Conversely such an m makes h↦h⋅e′ a well-defined splitting.

step 2.1F1
3.2

Reduction of the r≥2 case to two coprime forms: view σ:=yx−1 as a permutation of the coordinate set, so ui=xi−xσi. If some cycle of σ has length ≥3, two consecutive forms of that cycle, xi−xσi and xσi−xσ2i, are distinct irreducible elements of the polynomial ring and hence coprime in the UFD R; if all cycles have length ≤2 and r≥2, there are at least two transposition cycles and one form from each is a pair with disjoint supports, again coprime. In both cases pick such indices p,q.

step 2.2
4.1

Conclusion in the case r≥2: from upmq=uqmp and gcd⁡(up,uq)=1 in the UFD R we get up∣mp and uq∣mq; write mp=upm and mq=uqm′; substituting gives upuqm′=uqupm, hence m′=m as R is a domain. For every index i, upmi=uimp=uiupm forces mi=uim, since up≠0 and R is a domain. By step 3.1 the extension splits.

step 2.1step 3.1step 3.2
4.2

The case r=1: then σ=yx−1 is a reflection, so it exchanges two coordinates p≠q and fixes the rest; hence up=xp−xq, uq=−up and ui=0 for all other i. The relations uimj=ujmi give mi=0 for i∉{p,q} and mq=−mp, and by step 3.1 the extension splits iff up∣mp. In the localization at up the obstruction dies because up becomes a unit; moreover up is a unit multiple of ασ, the equation of the hyperplane of fixed points of σ=yx−1, and for y=xt that reflection is xtx−1 with equation x(αt).

step 3.1step 2.2F2
5.1

Both assertions follow: for r≥2 every extension splits by step 4.1, and for r=1 with y=xt every extension splits in the stated localization by step 4.2. All constructions were made on homogeneous lifts, so the argument applies degree by degree in the graded category. ∎

step 4.1step 4.2

Depends on

Used by

Dependency tree · two levels

10 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