Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Cyclotomic Murphy elements

Definition

Fix r,n≥1 and work in the universal cyclotomic algebra Hr,n of The multiplicative cyclotomic Hecke algebra, with parameters Q,u1,…,ur, commuting Jucys–Murphy generators Li=Xi, and finite generators Ti. For an r-multipartition λ, put ac=∑d<c∣λ(d)∣ and define uλ=∏c=2r ∏i=1ac(Li−uc). Let tλ be the row-standard initial multitableau from Cell data, multipartition dominance, and higher-cell ideals. Let Sλ be the subgroup of Sn that permutes labels within each row of tλ, and set xλ=∑w∈SλTw and mλ=uλxλ. The anti-involution ∗ is the generator-fixing map of The cyclotomic anti-involution fixes the affine and Murphy generators.

For a standard multitableau t, use the right entry action t⋅w:=w−1⋅t, where the left action applies w to every entry. Let d(t) be the unique permutation with tλ⋅d(t)=t. Standardness implies that d(t) is the distinguished minimal representative for its row-stabilizer coset. For standard s,t of shape λ, define mst=Td(s)∗mλTd(t). These are specified elements of Hr,n; this definition does not assert their linear independence or cellularity.

Facts & Assumptions

Given: r,n≥1, the universal parameters, the presentation of Hr,n, and a multipartition λ of n with standard multitableaux s,t.

[F1]

L1,…,Ln commute, Li=Xi, and for every polynomial f in these variables, Tif(L)=f(siL)Ti−(Q−1)Li+1(f(L)−f(siL))/(Li−Li+1); the quotient is a polynomial. (Cyclotomic Jucys–Murphy generators and their transport relations)

[F2]

The affine Hecke generators Ti are units, the cyclotomic parameters are units, and the quotient relation is imposed on L1 only. (The multiplicative cyclotomic Hecke algebra)

[F3]

The finite type-A elements Tw are well-defined from reduced words, and parabolic row subgroups have unique distinguished coset representatives with length additivity. (The standard basis of the generic Hecke algebra and base change, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification)

[F4]
[F5]

In component c, the labels of tλ form the consecutive interval ac+1,…,ac+∣λ(c)∣; each row of tλ is a consecutive subinterval. (Multipartitions, standard multitableaux, and generic contents, Cell data, multipartition dominance, and higher-cell ideals)

Verification

technique · direct
1.1givenF1F2F3F5construct

The commuting property in [F1] makes each product in uλ a defined polynomial element. The presentation [F2] supplies the coefficient ring, unit parameters, and quotient in which these polynomials live. The row subgroup Sλ is a product of finite symmetric groups on consecutive row intervals, so every Tw in xλ is a defined finite Hecke element by [F3]. For standard t, the equality tλ⋅d(t)=t determines d(t) uniquely because the entry action is free; row-increasing entries mean that this representative is minimal in the row-stabilizer coset, by the parabolic description in [F3]. Thus all displayed expressions are elements of Hr,n.

2.1givenF1F5step 1.1algebra

It remains to verify the stated commutation. Let Ti generate a row factor belonging to component k, so i,i+1 lie in that component's label interval. For a factor with index c≤k, [F5] gives ac<i, so every Lj in ∏j≤ac(Lj−uc) is distant from Ti and commutes with it by [F1]. For a factor with c>k, [F5] gives ac≥i+1, so the factor contains both (Li−uc) and (Li+1−uc); the entire product over j≤ac is invariant under swapping Li,Li+1. The divided-difference term in [F1] is then zero, and [F1] gives commutation with Ti. Therefore uλ commutes with every generator of Sλ, hence with every Tw in that group and with their sum xλ.

3.1F4step 2.1algebra∎

Since the row subgroup is closed under inversion, xλ∗=∑w∈SλTw−1=xλ. Also uλ∗=uλ by [F4]. The commutation proved in step 2.1 gives mλ∗=(uλxλ)∗=xλuλ=uλxλ=mλ. Applying the anti-involution to the defining formula for mst now yields mst∗=Td(t)∗mλTd(s)=mts.

Depends on

Used by

Dependency tree · two levels

36 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