Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: 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.

The Soergel character grading alone does not prove category-O Koszulity

Statement refuted

Refuted claim: 'The auxiliary grading on the polynomial Soergel lifts transports to category O and makes each regular integral block graded (indeed Koszul), so that the coefficients of the Kazhdan–Lusztig polynomials are the graded decomposition numbers; in particular, for every comparable pair, the leading coefficient of Py,w(q) is the ordinary Verma-flag multiplicity (P(w⋅λ):Δ(y⋅λ)).'

Counterexample: let λ be dominant regular integral for sl4 (for instance λ=0) and take y=1324=s2 and w=3412=s2s1s3s2 in S4, so that ℓ(w)−ℓ(y)=3. On the ten-element interval [1324,3412] the only comparable-pair Kazhdan–Lusztig polynomial different from 1 is P1324,3412(q)=1+q; its leading coefficient is 1, but the multiplicity theorem gives (P(w⋅λ):Δ(y⋅λ))=Py,w(1)=2≠1. Hence the leading coefficient of the Kazhdan–Lusztig polynomial is not the ordinary multiplicity, and an individual coefficient of Py,w need not equal its ordinary category-O multiplicity. Moreover the page constructs no grading on O at all: the grading in play is the auxiliary grading of the polynomial lifts, normalised on the Soergel side and passed to by the ungraded reduction of the projective dictionary, so the character theorem alone cannot establish Koszulity; the graded/Ext refinement is reserved for the separate Koszul-duality frontier.

Facts & Assumptions

Given: The Axiom of Choice (inherited from the multiplicity theorem cited below), sl4 with a dominant regular integral weight λ (for instance λ=0), the permutations b:=1324=s2 and w:=3412=s2s1s3s2 in one-based S4, and the classical Kazhdan–Lusztig polynomials Py,z(q) with q=v−2.

[F1]

Multiplicity theorem (Projective Verma multiplicities are Kazhdan–Lusztig values at one): in the regular integral type-A block Oλ one has (P(w⋅λ):Δ(y⋅λ))=Py,w(1) for all y,w∈W, and the multiplicity vanishes unless y≤w.

[F2]

Block and grading conventions (The regular integral dot-orbit labelling convention, Finite Verma flags and their multiplicities): (P(w⋅λ):Δ(y⋅λ)) is the ordinary Verma-flag multiplicity of the standard Δ(y⋅λ), the projective dictionary is the ungraded reduction V(P(w⋅λ))=Bˉw−1, and the auxiliary grading lives on the polynomial Soergel lifts.

[F3]

Classical Kazhdan–Lusztig polynomials (Kazhdan–Lusztig polynomials in the classical q-normalization): Py,z has constant term 1, and for y<z its degree is at most (ℓ(z)−ℓ(y)−1)/2; the μ-coefficient μ(y,z) is the coefficient of q(ℓ(z)−ℓ(y)−1)/2, defined as 0 when ℓ(z)−ℓ(y) is even; Py,z=0 unless y≤z.

[F4]

Descent recursion (The Kazhdan–Lusztig polynomial descent recursion): for a simple reflection s with sz<z and y≤z, Py,z(q)=q1−cPsy,sz(q)+qcPy,sz(q)− ⁣ ⁣ ⁣∑y≤u≤szsu<u, μ(u,sz)≠0 ⁣ ⁣ ⁣μ(u,sz) q(ℓ(z)−ℓ(u))/2Py,u(q), where c=1 if sy<y and c=0 if sy>y.

[F5]

Bruhat order of S4 (Basic properties of the Bruhat order on Sn, Bruhat intervals and the R-coefficients): y≤z holds exactly when y is a reduced subword of every reduced expression of z; the order is graded by inversion length; intervals are finite.

Counterexample

technique · direct
1.1F5algebra

The interval. The word s2s1s3s2 has length 4 and is reduced, since 3412 has exactly the four inversions (3,1),(3,2),(4,1),(4,2). Its reduced subwords give: 1234 at length 0; 2134,1324,1243 at length 1; 1342,1423,2314,3124,2143 at length 2; 1432,2413,3142,3214 at length 3; and 3412 at length 4. The four elements 1234,2134,1243,2143 contain no reduced subword equal to s2=1324, so they are not above b by the reduced-subword criterion; the remaining ten elements are exactly [b,w].

1.2F3F5algebra

All gaps at most two have P=1. Suppose y<z and d:=ℓ(z)−ℓ(y)≤2. By [F3] the degree of Py,z is at most (d−1)/2≤1/2, hence at most 0; together with constant term 1 this forces Py,z=1. If d=0 then y=z and Py,y=1; if y and z are incomparable, Py,z=0 by [F3]. In particular Pb,2413=1 and P1234,1423=1, both pairs having gap 2.

2.1F4F5step 1.1step 1.2algebra

The recursion at (id,2413). Write id=1234 and use 2413=s1s3s2, a reduced word with left descent s1. With s=s1 one has s 2413=1423 and s id=2134, so c=0 in [F4] and Pid,2413(q)=q P2134,1423(q)+Pid,1423(q)− ⁣ ⁣ ⁣∑id≤u≤1423s1u<u, μ(u,1423)≠0 ⁣ ⁣ ⁣μ(u,1423) q(3−ℓ(u))/2Pid,u(q). The first summand vanishes: 1423=s3s2 has no reduced subword s1, so 2134≰1423 and P2134,1423=0 by [F3] and [F5]. The correction sum is empty as well: [id,1423]={1234,1324,1243,1423} by step 1.1, and for each of these four elements left multiplication by s1 swaps the values 1 and 2, raising the length from 0,1,1,2 to 1,2,2,3 respectively, so no element of the interval has the required left descent s1. By step 1.2 the remaining term is Pid,1423=1, hence Pid,2413=1.

3.1F3F4step 1.1step 1.2step 2.1algebra

The main recursion. Apply [F4] to b=1324, w=3412 and the left descent s=s2: s2w=2413 and s2b=1234, so c=1 because s2b has length 0<1=ℓ(b), and Pb,w(q)=Pid,2413(q)+q Pb,2413(q)− ⁣ ⁣ ⁣∑b≤u≤2413s2u<u, μ(u,2413)≠0 ⁣ ⁣ ⁣μ(u,2413) q(4−ℓ(u))/2Pb,u(q). By step 1.1 the interval [b,2413] is {1324,1423,2314,2413}; left multiplication by s2 swaps the values 2 and 3, turning these into 1234,1432,3214,3412 of lengths 0,3,3,4, so only u=b has the required descent, and there μ(b,2413)=0 because ℓ(2413)−ℓ(b)=2 is even by [F3]. The correction sum is therefore empty; step 2.1 gives Pid,2413=1 and step 1.2 gives Pb,2413=1, so Pb,w=1+q, with μ(b,w)=1 and ℓ(w)−ℓ(b)=3.

4.1F1F2step 3.1algebra

The comparison. The polynomial Pb,w(q)=1+q has leading coefficient 1 (the coefficient of q1, its degree being 1) while its value at q=1 is 2. The multiplicity theorem [F1] computes the ordinary Verma-flag multiplicity as (P(w⋅λ):Δ(b⋅λ))=Pb,w(1)=2, with 0 dominant regular integral in sl4 (indeed ⟨ρ,αi∨⟩=1≠0 for every simple root and 0 is integral). Hence the leading coefficient 1 of the Kazhdan–Lusztig polynomial differs from the multiplicity 2: the refuted claim's coefficientwise clause is false, and neither individual coefficient of this polynomial equals the ordinary multiplicity; its total value at one does. This is a genuine failure of the claim and not an artefact of undefined quantities: b≤w, all polynomials are classical Kazhdan–Lusztig polynomials, and the multiplicity is that of the ordinary block O0.

5.1F1F2step 4.1∎

The grading clause. The remaining structural clause of the refuted claim is not supplied by the cited results either: the multiplicity of [F1] is the ordinary (ungraded) Verma-flag multiplicity, and the projective dictionary of [F2] is the ungraded reduction V(P(w⋅λ))=Bˉw−1, whose auxiliary grading lives on the polynomial lift and is not a grading of Oλ. Thus the character identity at q=1 cannot establish that the block is graded or Koszul; the graded and Ext refinements belong to the separate Koszul-duality frontier, and step 4.1 refutes only the identification of an individual coefficient with an ordinary multiplicity. It does not refute graded decomposition numbers or the possibility of a Koszul grading: those require additional constructions and proofs, and graded multiplicities may sum to the ordinary multiplicity. The stated conjunction is refuted by its false leading-coefficient clause, with witness (y,w)=(1324,3412) in sl4.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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