Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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.

Hard Lefschetz and the Hodge-Riemann signs for the coinvariant algebra of S_3

Example

For n=3 identify the centered reduced longest-element module with C(3), where C=R[x1,x2,x3]/(e1,e2,e3) has dimensions 1,2,2,1 in degrees 0,2,4,6, so that the centered degrees are −3,−1,1,3. For every strictly dominant ρ hard Lefschetz is the pair of isomorphisms ρ3:C(3)−3→C(3)3 and ρ:C(3)−1→C(3)1. The primitive spaces used in the Hodge-Riemann relations are P−3=C(3)−3 of dimension one and P−1=ker⁡(ρ2:C(3)−1→C(3)3) of dimension one; their Lefschetz forms are respectively positive and negative definite, and the primitive decomposition consists of one length-four ρ-string and one length-two ρ-string. For an explicit strictly dominant choice let x=x1, y=x2, x3=−x−y, ρ=x1−x3=2x+y and normalize Tr⁡(x2y)=1. Then C=R[x,y]/(x2+xy+y2,x3), with basis 1;x,y;x2,xy;x2y; the ρ-map from degree 2 to degree 4 has the matrix (2−111), ρ3(1)=6x2y, P−1=Ry and Tr⁡(yρy)=−2. These computations verify hard Lefschetz and the primitive signs directly in rank two.

Verification

technique · direct; elimination of the linear invariant, reduction to a two-variable model, and explicit matrix and trace computations in both the special and the general dominant chamber

Given: The coinvariant algebra C=R[x1,x2,x3]/(e1,e2,e3) and the identification with the centered reduced module of Bw0 (The coinvariant algebra of S_3 as the Soergel bimodule of the longest element), the operator ρ⋅(−) of left multiplication by a strictly dominant degree-two element and the trace normalization (The reduced Soergel module and the dominant Lefschetz operator, The trace, the invariant intersection form on Bott-Samelson bimodules and its reduction), and the hard-Lefschetz and Hodge-Riemann dictionary with the sign (−1)(d−i)/2 for lowest degree −d (Primitive subspaces, hard Lefschetz and the Hodge-Riemann signs: the dictionary of hypotheses S, hL and HR, Hard Lefschetz gives the primitive decomposition, orthogonality and the signature formula).

[F1] The centered module C(3) has lowest degree −3, graded dimensions 1,2,2,1 in degrees −3,−1,1,3 and a non-degenerate invariant form normalized by the positive bottom value; for it, hard Lefschetz is ρ3:C−3→C3 together with ρ:C−1→C1, and the standard sign in degree −i is (−1)(3−i)/2, so the primitive space P−1⊂C−1 must be negative definite and P−3=C−3 positive definite (The coinvariant algebra of S_3 as the Soergel bimodule of the longest element, Primitive subspaces, hard Lefschetz and the Hodge-Riemann signs: the dictionary of hypotheses S, hL and HR).

[F2] In the quotient the relations e1=e2=e3=0 hold and, after the substitution x3=−x−y, are equivalent to x2+xy+y2=0 and x3=0; the reduction of the intersection form is the standard top trace with Tr⁡(x2y)=1, and C is spanned by the six monomials of the display (The coinvariant algebra of S_3 as the Soergel bimodule of the longest element; the trace identification is checked in step 2.1).

1.1givenF2

The two-variable model. Put x=x1, y=x2 and x3=−x−y. Then e1=x+y+x3=0, while e2=x1x2+x1x3+x2x3=xy+x(−x−y)+y(−x−y)=−(x2+xy+y2) and e3=x1x2x3=−x2y−xy2; hence the coinvariant ideal is generated by x2+xy+y2 and x2y+xy2, and since x3=x(x2+xy+y2)−x2y−xy2 the second relation can be replaced by x3=0, giving C=R[x,y]/(x2+xy+y2,x3). The monomials 1;x,y;x2,xy;x2y span it: the relations x2=−xy−y2 and x3=0, together with xy2=−x2y and y3=0, reduce every monomial of degree ≥2 in x to one of them, and their independence follows by monic division by y2+xy+x2 over R[x]/(x3), which gives the free basis 1,y over that ring.

2.1step 1.1givenF2algebra

The trace and pairing. The rank-two summand map j(p⊗q)=p⊗1⊗1⊗q pulls the Bott–Samelson trace back to ∂1∂2∂1(p)q, as follows by taking the right-coefficient trace successively in the three slots; this is the explicit trace calculation in the rank-two decomposition proof, also obtained directly from the rank-one trace convention. After right reduction it is the top trace on C, since ∂1(x12x2)=x1x2, ∂2(x1x2)=x1 and ∂1(x1)=1. Hence Tr⁡(x2y)=1 and all degrees other than 6 have zero trace. The complementary-degree pairings are 1 in degrees 0,6 and (011−1) in degrees 2,4, of determinant −1; they prove nondegeneracy directly. The form used below is therefore the actual induced reduced intersection form, without invoking the general Hodge theorem.

3.1step 1.1step 2.1

The special dominant element. For ρ=2x+y one computes ρx=2x2+xy and ρy=2xy+y2=−x2+xy using y2=−x2−xy; the matrix of ρ from the degree-2 block with basis (x,y) to the degree-4 block with basis (x2,xy) is therefore (2−111), whose determinant is 3≠0, so ρ:C−1→C1 is an isomorphism. Moreover ρ2x=3x2y and ρ2y=0: indeed x2ρ=x2(2x+y)=2x3+x2y=x2y, xyρ=xy(2x+y)=2x2y+xy2=x2y; hence ρ2x=2⋅x2y+x2y=3x2y and ρ2y=−x2y+x2y=0; hence P−1=ker⁡(ρ2)=Ry and ρ3(1)=ρ2(2x+y)=6x2y≠0, so ρ3:C−3→C3 is an isomorphism as both sides are one-dimensional.

4.1step 3.1F1

The signs for the special element. With the normalization Tr⁡(x2y)=1, the bottom primitive form is (1,1)=Tr⁡(1⋅ρ3(1))=Tr⁡(6x2y)=6>0, positive as required in degree −3; the middle primitive form is (y,y)=Tr⁡(y⋅ρy)=Tr⁡(y(−x2+xy))=Tr⁡(−x2y+xy2)=−1−1=−2<0, negative as required in degree −1, where the standard sign is (−1)(3−1)/2=−1. The primitive decomposition is read off from the two strings: 1↦2x+y↦3x2+3xy↦6x2y spans the four degrees with one vector each, and y↦−x2+xy spans degrees −1 and +1; together they account for all four graded pieces and their dimensions, so there are exactly one length-four string and one length-two string.

5.1step 4.1F1

The general dominant chamber. Let ρ=c1x1+c2x2+c3x3 be strictly dominant, so c1>c2>c3; subtracting a multiple of e1 (which is zero in C) writes its class as ρ=ax+by with a=c1−c3>b=c2−c3>0. Then ρx=ax2+bxy and ρy=−bx2+(a−b)xy, so the middle matrix is (a−bba−b) with determinant D=a2−ab+b2>0, and ρ3(1)=3ab(a−b)x2y: indeed ρ2x=b(2a−b)x2y and ρ2y=a(a−2b)x2y, so p:=a(a−2b)x−b(2a−b)y satisfies ρ2p=0, and expanding gives Tr⁡(pρp)=A2b−B2a+2AB(b−a) with A=a(a−2b), B=b(2a−b), which simplifies to −3ab(a−b)(a2−ab+b2)<0. Hence P−1=Rp (one-dimensional, since p≠0 for a>b>0) carries a negative definite Lefschetz form, the bottom form Tr⁡(3ab(a−b)x2y)>0 is positive, and every strictly dominant ρ satisfies hard Lefschetz with the standard signs on both primitive spaces.

6.1step 4.1step 5.1F1∎

Conclusion. Steps 2.1 and 3.1 verify the displayed isomorphisms, the two primitive spaces and their signs for the explicit choice, and step 5.1 shows the same for every strictly dominant element; the primitive decomposition has the two strings claimed. This verifies the example by its quotient and trace calculations.

Remarks

  • Define the top trace to be zero off degree 6 and to send x2y to 1. Its multiplication pairing is non-degenerate: the degree-0 and degree-6 pieces pair by 1, and the degree-2 and degree-4 pairing in the displayed bases has matrix (011−1), of determinant −1. The divided-difference normalization agrees, since ∂1(x12x2)=x1x2, ∂2(x1x2)=x1 and ∂1(x1)=1. This is a positive scalar normalization of the invariant form, as its bottom Lefschetz value is positive.
  • The example is an illustration in rank two and is not used as a supplier in the simultaneous induction; the general statement for w0 is proved on the axiom page by the induction itself.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

26 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