Alphabeta Math
LemmaStatement: AI-adaptedProof: 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 universal cyclotomic Hecke canonical trace is perfect and symmetric

Statement

For the universal cyclotomic presentation of Universal cyclotomic Hecke ordered monomials form a basis, extract the coefficient of the zero-dot identity-permutation PBW word to define the R-linear map τ. Then τ(ab)=τ(ba) and the pairing (a,b)↦τ(ab) is a perfect R-bilinear associative pairing. Both properties hold after every commutative unit-parameter base change, including the LM deformation DVR. Rank zero is R with τ(1)=1R. For the separate level-zero positive-rank zero algebra the zero pairing is perfect; no nonzero τ(1)=1 assertion is made.

Facts & Assumptions

Given: The universal parameter ring R=Z[qH±1,Q1±1,…,Qℓ±1] with ℓ≥1, the nondegenerate cyclotomic quotient Hn with first polynomial f(X1)=∏a=1ℓ(X1−Qa), and the PBW basis B={X1a1⋯XnanTw:0≤ai<ℓ, w∈Sn} (Universal cyclotomic Hecke ordered monomials form a basis).

[F1]

B is an R-basis of Hn, valid over every commutative R-algebra (Universal cyclotomic Hecke ordered monomials form a basis); the finite Hecke algebra has standard basis Tw with TwTsi=Twsi for increasing length and qHTwsi+(qH−1)Tw for decreasing length (The standard basis of the generic type-A Hecke algebra).

[F2]

The mixed relation can be written TjXj=Xj+1(Tj−qH+1) and gives the Bernstein straightening identity TjXjm=Xj+1m(Tj−qH+1)−(qH−1)∑b=1m−1XjbXj+1m−b, with Tj−1=qH−1(Tj−qH+1) (Universal cyclotomic Hecke ordered monomials form a basis).

[F3]

Determinants are multiplicative, and block-triangular determinants multiply over their diagonal blocks (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix, For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)). For a square matrix over the commutative ring R, cofactor expansion gives Gadj⁡(G)=adj⁡(G)G=(det⁡G)I, so a unit determinant gives an inverse (det⁡G)−1adj⁡(G) over R.

Proof

technique · direct

Given: The universal PBW presentation and the data of [F1]–[F3].

1.1F1construct

The trace and its dual basis. Define τ ⁣:Hn→R by τ(B)=1 at the zero-dot identity word and 0 at every other PBW basis element, extended R-linearly; by [F1] this is well defined over R and after base change. Put J1=1 and Ji=qH−1Ti−1Ji−1Ti−1 in the finite Hecke subalgebra; the Ji are units. Define the second family C={TvJ1δ(c1)⋯Jnδ(cn)X1c1⋯Xncn:0≤ci<ℓ, v∈Sn},δ(0)=0, δ(c)=−1 (c>0). The standard anti-involution fixing the presentation generators fixes each Xi, so B∗={TvXc} is a basis; at each fixed profile c, multiplying the finite Hecke factor by the unit J1δ(c1)⋯Jnδ(cn) is an invertible R-linear change of the finite Hecke basis. Hence C is an R-basis of Hn.

1.2F1F2algebra

Cyclicity for X1 via the tower. At rank one the algebra is commutative, so cyclicity is immediate; for the induction assume n≥2. Identify Hn−1 with the subalgebra on X1,…,Xn−1,T1,…,Tn−2; its bounded words are a subset of B. Put vk=sn−1⋯sk for 1≤k<n and vn=1; the decomposition w=uvk with u∈Sn−1 is length additive, so {XnaTvk:0≤a<ℓ, 1≤k≤n} is a left Hn−1-basis of Hn. Define the left-linear projection En ⁣:Hn→Hn−1 to be 1 on Xn0Tvn and 0 on the other basis elements, and τn=τn−1∘En. With V=Tn−1⋯T1 and U=(Tn−1−qH+1)⋯(T1−qH+1), the mixed relation gives VX1=XnU, and [F2] gives VX1m=XnmU+Jm, where every term of Jm has total dot degree m and Xn-degree between 1 and m−1 (the leading branch transfers the full exponent, each correction transfers a strictly smaller positive exponent, and no variable above n occurs). For m≤ℓ every lower exponent in Jm is below ℓ, so En(Jm)=0; likewise En(XnmU)=0 for 1≤m<ℓ. Multiplying the first-dot relation f(X1)=0 by V gives 0=XnℓU+Jℓ+∑m=1ℓ−1cm(XnmU+Jm)+c0V, and applying En yields En(XnℓU)=0, which completes the missing case m=ℓ. To verify right X1-linearity, test the displayed left tower basis XnaTvk. For k≥2, Tvk and Xn commute with X1; its projection is zero unless a=0,k=n, where the equality is immediate. For k=1, VX1=XnU gives En(XnaVX1)=En(Xna+1U)=0 for 0≤a<ℓ: bounded positive exponents project to zero, and the endpoint a+1=ℓ was just established. Left Hn−1-linearity then extends the equality to every h. Hence En(hX1)=En(h)X1 for all h, and by left linearity En(X1h)=X1En(h); induction on n gives τn(X1h)=τn(hX1).

1.3F1F2algebra

Cyclicity for the finite generators. Let p=Xa be a bounded dot monomial and w∈Sn. By [F2], Tjp=(sjp)Tj+(1−qH)Xj+1p−sjpXj−Xj+1; for p=XjaXj+1b times the other variables, the correction monomials have the same total dot degree and both displayed exponents at most max⁡(a,b)<ℓ (the exponents run as (a−1−k,b+1+k) or (a+k,b−k)), so when the exponent profile is positive every term on either side of τ(TjpTw)=τ(pTwTj) has a positive bounded profile and evaluates to 0. When p=1, the finite Hecke multiplication formula [F1] gives coefficient of 1 in TjTw, respectively TwTj, equal to qH if w=sj and 0 otherwise. This proves τ(Tjh)=τ(hTj) without using the trace one is proving.

2.1step 1.2step 1.3algebra

Generation and symmetry. The elements X1,T1,…,Tn−1 generate Hn as an R-algebra: the constant term c0=(−1)ℓ∏aQa is a unit, so f(X1)=0 makes X1−1 a polynomial in X1; each Tj−1=qH−1(Tj−qH+1); and Xr=qH1−rTr−1⋯T1X1T1⋯Tr−1, with inverses expressed likewise. Moving the generators of a word one at a time around τ, using steps 1.2 and 1.3, gives τ(ab)=τ(ba) for every pair of words, hence for all a,b by R-bilinearity; the pairing (a,b)↦τ(ab) is associative and symmetric.

2.2F1F2step 1.1algebra

Restricted-profile zero values. For 0≤j≤n let Uj be the span of the PBW words whose dot entries above j vanish, all finite permutations included. It is a right finite-Hecke module. Multiplying its dot part by any polynomial in X1,…,Xj stays in Uj: transport the first cyclotomic relation successively only through T1,…,Tj−1, so each resulting relation reduces a power of Xi, i≤j, using variables of index at most i and finite words of indices below i; repeated Bernstein straightening and the bounded reduction of [F1] therefore never introduce a variable above j. In particular Uj is the dot algebra on its first j variables times the finite Hecke algebra. For 1≤k<ℓ and h∈Uj, τ(Xj+1kh)=0, directly from the bounded basis, since the new exponent is positive and bounded. This statement concerns h∈Uj, rather than arbitrary h∈Hn.

3.1F1F2step 2.1step 2.2algebra

Transferred restricted-profile powers. Write q=qH. For 1≤i≤j+1≤n, 1≤k≤ℓ and h∈Uj we claim τ(Xj+1kh)=qi−j−1τ(Tj⋯TiXikTi⋯Tjh), with empty chains when i=j+1. The mixed relations give Xik=q−1Ti−1Xi−1kTi−1+q−1(q−1)∑c=1k−1XicXi−1k−cTi−1, by induction on k using that Ti−1 commutes with Xi−1Xi. To descend from i to i−1, it suffices to show every correction has trace zero. Put A=Tj⋯Ti, B=Ti⋯Tj. For 0<c<k, the mixed relation and the formula Xj+1=qi−j−1AXiB give the exact identity AXicXi−1k−cTi−1Bh=qj−i+1AXic−1Xi−1k−c−1Ti−1A−1Xj+1Xi−1h: substitute B=qj−i+1Xi−1A−1Xj+1 and use XiTi−1Xi−1=Xi−1−1Ti−1Xi−1. Expand Xic−1Xi−1k−c−1Ti−1A−1 in the reversed PBW order ∑aw,bTwXb using Ta−1=q−1(Ta+1−q). Bernstein straightening swaps the two exponents or replaces them by intermediate exponents, so every exponent stays nonnegative and at most max⁡(c−1,k−c−1)≤k−2; variables have index at most j+1. Cyclicity from step 2.1 makes the trace of each correction a sum of traces of Xj+11+bj+1(X1b1⋯Xjbj)Xi−1hATw. The parenthesized remaining factor lies in Uj by step 2.2, and 1≤1+bj+1≤k−1<ℓ, so each trace is zero. Downward induction proves the claim, including k=1, whose correction sum is empty.

4.1step 2.1step 2.2step 3.1algebra

The cyclotomic endpoint. Apply step 3.1 with i=1, k=ℓ. In τ(q−jTj⋯T1X1ℓT1⋯Tjh) replace X1ℓ using its first cyclotomic relation. Each positive power X1k, k<ℓ, transfers back to Xj+1k by step 3.1 and contributes zero by step 2.2. The constant term contributes ατ(Jj+1h), where α=−f(0)=(−1)ℓ+1Q1⋯Qℓ and Jj+1=q−jTj⋯T1T1⋯Tj. Thus τ(Xj+1ℓh)=ατ(hJj+1) for every h∈Uj. For j=0 this follows directly from the first polynomial; for ℓ=1 there are no positive-power intermediate terms. The restriction on h is essential.

5.1F1F3step 1.1step 2.1step 2.2step 4.1algebra

The full Gram blocks. Let Bj and Cj be the parts of the two bases with entries above j zero, and let Gj=(τ(bc)) be their matrix, of size Nj=ℓjn!. For new profiles b,c at position j+1, cyclicity and commuting dots rewrite an entry as τ(Xj+1b+chJj+1δ(c)), where h=X1b1+c1⋯Xjbj+cjTwTvJ1δ(c1)⋯Jjδ(cj)∈Uj by step 2.2; earlier combined exponents may exceed ℓ−1, and that same reduction argument is why this remains in Uj. If b=c=0 the block is Gj. If 0<b+c<ℓ it is zero by step 2.2. If b+c=ℓ, then c>0 and step 4.1 cancels the last Jj+1−1, giving the block αGj. Order rows by b=0,1,…,ℓ−1 and columns by c=0,ℓ−1,…,1. The row and column at zero have only Gj at their intersection. Among positive rows and columns the blocks above the diagonal have b+c<ℓ and vanish, the diagonal has b+c=ℓ, and blocks below may be arbitrary. Hence Gj+1 is block lower triangular with diagonal Gj,αGj,…,αGj, so det⁡Gj+1=±α(ℓ−1)Nj(det⁡Gj)ℓ. At j=0, G0=(τ(TwTv)) has entry qlength⁡(w)δv,w−1 by [F1], and its determinant is a unit. Induction gives a unit determinant for Gn; since B and C are bases, the pairing identifies Hn with its R-dual.

6.1step 1.1step 5.1∎

Base change and boundary cases. Presentation base change commutes with forming Hn, and the universal PBW basis is free, so the trace coefficients and the inverse Gram matrix base-change to any commutative ring in which all parameters remain units; in particular they do so for the LM deformation DVR with qHt and Qatna. For n=0 use H0=R with τ(1)=1R; for ℓ=1 the family C consists of finite Tv and the same proof applies. The separate level-zero positive-rank quotient is 0, with the zero perfect pairing, and no claim τ(1)=1 is made for it. No generic faithfulness or imported Bremke–Malle trace statement is used.

Remarks

The trace is the canonical coefficient functional on the universal PBW basis; cyclicity is proved by the tower projection and the explicit Bernstein computation, and perfectness by exhibiting the dual basis C with a unimodular triangular Gram change. The scalar α=(−1)ℓ+1Q1⋯Qℓ is forced by the first cyclotomic polynomial. At rank one and level one it is Q1, which fixes the sign independently of a printed source formula. Exact universal PBW is a required input; unresolved prerequisites of that supplier hold this carrier and its consumers. All arguments are finite and use no choice principle.

Depends on

Used by

Dependency tree · two levels

25 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