Alphabeta Math
PropositionStatement: AI-adaptedProof: 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.

Cyclotomic Hecke algebras of level one are finite Hecke algebras

Statement

Let Λ=Λj be a level-one fundamental weight and keep the conventions of Affine type-A presentations and charged cyclotomic quotients. Then the assignments Tr↦Tr (1≤r<d) in the nondegenerate case and sr↦sr in the degenerate case extend to F-algebra isomorphisms HF,q(Sd)⟶HdΛ,FSd⟶HdΛ respectively (The generic type-A Hecke algebra, The standard basis of the generic type-A Hecke algebra).

Facts & Assumptions

Given: A field F, the level-one fundamental weight Λ=Λj, the cyclotomic quotient HdΛ of Affine type-A presentations and charged cyclotomic quotients, and the finite type-A Hecke algebra HF,q(Sd) with quadratic relation Tr2=(q−1)Tr+q, q=qH, respectively the group algebra FSd.

[F1]

At level one the cyclotomic relation reads X1=qj in the nondegenerate branch and x1=j⋅1F in the degenerate branch; the mixed relations give Xr+1=q−1TrXrTr and xr+1=srxrsr+sr, so every polynomial generator is expressible in the first one and the finite generators (Affine type-A presentations and charged cyclotomic quotients).

[F2]

The finite Hecke algebra has standard basis {Tw:w∈Sd}; the Jucys–Murphy elements Lr=∑a<r(a r) in FSd commute and satisfy srLr+1=Lrsr+1 and srLt=Ltsr for t∉{r,r+1}, with the analogous multiplicative identities in HF,q(Sd) (The Hecke Jucys-Murphy action is dominance triangular, The standard basis of the generic type-A Hecke algebra).

Proof

technique · direct

Given: The level-one quotient HdΛ and the finite generators

Tr (respectively sr).

1.1F1algebra

Surjectivity of the natural map. By [F1] the first polynomial generator is the scalar qj (respectively j), and the recursion expressing every Xr+1 (respectively xr+1) in Xr and Tr (respectively sr) shows that the algebra generated by the finite generators and X1 is already generated by the finite generators alone. Hence the assignment of the Statement is a surjective algebra homomorphism.

1.2F1F2construct

The inverse in the nondegenerate branch. Let Lr be the additive Jucys–Murphy element and put Mr:=1+(q−1)Lr=q1−rTr−1⋯T1 2⋯Tr−1, a product of units, so every Mr is invertible; the Mr commute because the Lr do, and TrMrTr=qMr+1 while TrMt=MtTr for t∉{r,r+1} follow from [F2] by separating the term a=r in Lr+1 and using the finite braid relation on the three affected transpositions. Setting Xr:=qjMr therefore produces commuting units with TrXrTr=qXr+1, distant mixed commutation, the finite Hecke relations and X1=qj. These elements satisfy the complete affine presentation, so the assignment defines a homomorphism HdΛ→HF,q(Sd) fixing the Tr.

1.3F1F2construct

The inverse in the degenerate branch. Put xr:=j+Lr with Lr=∑a<r(a r)∈FSd. Direct transposition multiplication gives srLr+1sr=Lr+sr, hence srxr+1=xrsr+1, and the xr commute and commute with distant generators by [F2]; at r=1 this gives x1=j. These elements satisfy the degenerate affine relations, so the assignment defines a homomorphism HdΛ→FSd fixing the sr.

2.1step 1.1step 1.2step 1.3algebra∎

Mutual inverses. The two constructions of steps 1.2 and 1.3 fix every finite generator, and the composites with the surjection of step 1.1 fix every presentation generator: the finite generators by construction, and the polynomial generators because both sides satisfy the same recursion from X1=qj (respectively x1=j) and the mixed relations. Hence both composites are the identity on a generating set, so the maps are mutually inverse isomorphisms; rank zero gives F on both sides. This removes any late-basis or dimension dependency and introduces no BK or primitive-block input.

Remarks

The identification is proved by an explicit inverse rather than by comparing dimensions, so it does not depend on the later cyclotomic basis theorem, the BK isomorphism or any block-primitivity statement. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

17 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