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

The rank-one cyclotomic quotient has a monic basis

Statement

Let F be a field, let q,u1,…,ur∈F×, and let Ar,1(F;q,u1,…,ur) be the rank-one specialization of the multiplicative cyclotomic presentation The multiplicative cyclotomic Hecke algebra, with Q↦q and X1↦X. Then

Ar,1(F;q,u1,…,ur)≅F[X]/(∏a=1r(X−ua)),

and 1,X,…,Xr−1 is an F-basis. If r≥2 and u1=⋯=ur=c≠0, the change of variable ε=X−c identifies this algebra with F[ε]/(εr). In that case ε is a nonzero nilpotent.

Facts & Assumptions

Given: A field F, units q,u1,…,ur∈F, and the rank-one multiplicative cyclotomic presentation.

[F1]

The multiplicative cyclotomic Hecke algebra: the rank-one affine presentation includes the invertible generator X1.

[F2]

The multiplicative cyclotomic Hecke algebra: the cyclotomic quotient imposes p(X1)=∏a=1r(X1−ua)=0.

Proof

Given: F, q,u1,…,ur, and Ar,1(F;q,u1,…,ur) as in the statement.

1.1F1F2algebra

Write ek for the kth elementary symmetric polynomial in u1,…,ur and er=u1⋯ur≠0. By [F1] and [F2], the rank-one presentation is F[X±1]/(p(X)). Expanding p(X)=0 gives Xr−e1Xr−1+⋯+(−1)rer=0, so in F[X]/(p) the element X has inverse (−1)r+1er−1(Xr−1−e1Xr−2+⋯+(−1)r−1er−1). Thus the natural map F[X]/(p)→F[X±1]/(p) is onto, and the assignment of X−1 to this polynomial defines its inverse.

2.1step 1.1algebra

Since p is monic of degree r, division by p writes every polynomial uniquely as a multiple of p plus a polynomial of degree below r. Uniqueness follows because a nonzero multiple gp over the field F has degree deg⁡(g)+r≥r. Therefore the residue classes 1,X,…,Xr−1 are a basis of F[X]/(p) and hence of the Laurent quotient in step 1.1.

3.1step 2.1algebra∎

If all ua=c, then p(X)=(X−c)r. Substitution ε=X−c is an invertible change of polynomial variable, so it induces an isomorphism F[X]/((X−c)r)≅F[ε]/(εr). Because r≥2, step 2.1 gives the nonzero basis vector ε; its rth power is zero in this quotient.

Depends on

Used by

Dependency tree · two levels

5 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