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.

Universal cyclotomic Hecke ordered monomials form a basis

Statement

Let R=Z[z±1,U1±1,…,Uℓ±1] with ℓ≥1, and let Hn be the actual nondegenerate cyclotomic presentation of Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules at the first polynomial ∏a(X1−Ua). Then Hn is a free R-module with indexed R-basis XaTw,0≤ar<ℓ, w∈Sn. This basis specializes to every commutative R-algebra. Rank zero is R with the singleton empty word. The separate level-zero positive-rank quotient is zero with the empty family.

Facts & Assumptions

Given: The universal Laurent parameter ring R, the nondegenerate cyclotomic presentation Hn with the first-variable polynomial ∏a(X1−Ua), and the bounded ordered family B={XaTw:0≤ar<ℓ, w∈Sn}.

[F1]

The images of the bounded ordered monomials span Hn over any base ring with invertible parameter: the Bernstein product identities transport the first polynomial to a zero relation with leading coefficient zr−1Xrℓ and remainders of r-exponent below ℓ involving no variable above r, and reverse-lexicographic induction terminates because the leading coefficients are units of R; inverse variables are polynomials by the unit constant term of the first polynomial and the invertible finite Hecke generators (Bounded ordered monomials span the cyclotomic Hecke quotients).

[F2]

For a finite cyclic type-A field parameter, the sector isomorphism HαΛ≅RαΛ (Cyclotomic Hecke central sectors are isomorphic to type-A cyclotomic KLR algebras) combined with the KLR total dimension gives dim⁡FHnΛ=ℓnn! (Cyclic type-A KLR regular Hom norm gives the total dimension).

[F3]

For every prime power q there is a finite field Fq, whose multiplicative group is cyclic of order q−1 (For every prime p and n≥1, a field with pn elements exists, The multiplicative group Fq× of a finite field is cyclic); the Euler function satisfies φ(N)≥N/2, and a nonzero polynomial over a field has at most its degree roots (Division algorithm for polynomials over a field).

Proof

technique · direct

Given: The universal presentation, the bounded family B, and

the suppliers of [F1]–[F3].

1.1F1algebra

Spanning over R. By [F1] the family B spans Hn over the universal ring R: every element is an R-combination of the bounded ordered monomials with 0≤ar<ℓ and w∈Sn. The calculation uses no field division and therefore holds over R; for n=0 the singleton empty word gives H0=R, and for ℓ=0, n>0 the quotient is zero with the empty family.

1.2F1F3algebra

Independence by finite-field specialization. Suppose ∑bfbb=0 is a nontrivial relation in Hn with fb∈R, not all zero. Fix b0 with f:=fb0≠0 and multiply the relation by a Laurent monomial so that f∈Z[z,U1,…,Uℓ]; choose a prime p for which some nonzero integer coefficient of f survives modulo p, and view f as a polynomial in U1,…,Uℓ with coefficients in Fp[z]; let g(z)≠0 be one of those coefficients. By [F3] the number of primitive elements of Fpd× is φ(pd−1), which is unbounded and satisfies φ(N)≥N/2 (factor N over prime powers: each factor φ(ra)2/ra=ra−2(r−1)2≥1 except r=2, a=1, where it is 1/2). Choose d with φ(pd−1)>deg⁡g and pd−1 larger than every U-degree of f; then some primitive z∈Fpd× avoids the roots of g. Repeated one-variable root bounds on the nonzero-coordinate grid (each Ua is constrained to be a power zca≠0, and the remaining polynomial in the next variable has degree bounded by the U-degree of f) supply Ua=zca≠0 with f(z,U1,…,Uℓ)≠0 in Fpd. This specialization is exactly an allowed finite cyclic type-A field parameter: z has order e=pd−1≥2, and the cyclotomic charges ca lie in Z/eZ.

2.1F2step 1.1step 1.2algebra

The specialized basis forces a contradiction. Over the field Fpd with the parameter and charges of step 1.2, the early explicit BK maps identify the direct sum of the Hecke central sectors with the standard homogeneous cyclic KLR algebra, whose total dimension is ℓnn! by [F2]. The bounded spanning of step 1.1 provides exactly ℓnn! ordered words XaTw, so over the specialized field the family B is a basis; specializing the assumed relation forces fb(z,U)=0 for every b, and in particular f(z,U)=0, contradicting the choice of z,U in step 1.2. Hence the relation was trivial, the family B is R-linearly independent, and with step 1.1 it is an R-basis of Hn.

3.1step 1.1step 2.1∎

Base change and boundary cases. Formation of the presented algebra commutes with arbitrary base change: the presentation is a quotient of a free algebra and its specialized ideal is precisely the specialized relation ideal, so the R-basis B specializes to a basis of Hn⊗RR′ for every commutative R-algebra R′ (in particular for the LM deformation DVR with z=qHt and Ua=Qatna). No integral freeness was inferred from generic rank, no flatness was assumed, and no Schur or primitive-block classification was used.

Remarks

The independence proof is a density argument: algebraic relations over the universal Laurent ring are witnessed in arbitrarily large finite fields with primitive parameter, where the exact dimension ℓnn! is available from the independent KLR theory. The dependency order is essential: the primitive-free spectral/projector sectors and the explicit field maps precede the field norm, which precedes this universal PBW statement; the universal basis then feeds the local canonical trace and the Murphy/semistandard/Schur constructions. No choice principle is used (the finite fields and roots are chosen by explicit bounded searches).

Depends on

Used by

Dependency tree · two levels

40 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