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

Generic cyclotomic local dictionaries glue to a tower

Statement

Let k have characteristic zero, let ξ∈k× have infinite multiplicative order, and let m1,…,mℓ be any finite integral multicharge. Write λi=#{j:mj=i} and S={mj}. Let Hddeg⁡ and Hdξ denote the arbitrary-base affine presentations with first-strand cyclotomic polynomials ∏j(x1−mj) and ∏j(X1−ξmj), respectively. Let Rdλ be the cyclotomic KLR algebra of the integer line i→i+1, with the dot/crossing convention of the local dictionaries in [F2].

The support and local inverse-table suppliers [F1]–[F2] apply to these actual presentations and the same integer-line convention, as proved in step 1.1. The formulas yre(ν)=(xr−νr)e(ν),ψre(ν)=(sr+pνr,νr+1(yr,yr+1))qνr,νr+1(yr,yr+1)−1e(ν) and yre(ν)=(1−ξ−νrXr)e(ν),ψre(ν)=(Tr+Pνr,νr+1(yr,yr+1))Qνr,νr+1(yr,yr+1)−1e(ν) give isomorphisms ϕddeg⁡:Rdλ→Hddeg⁡ and ϕdξ:Rdλ→Hdξ in every rank, including zero. Their inverses send the Hecke generators to xr=∑ν(νr+yr)e(ν),sr=∑ν(ψrqνr,νr+1−pνr,νr+1)e(ν) and Xr=∑νξνr(1−yr)e(ν),Tr=∑ν(ψrQνr,νr+1−Pνr,νr+1)e(ν). All series are multiplied on the right of the crossing, as displayed.

These isomorphisms respect the maps appending a strand on the right and the last-color projectors. Consequently ϕdξ(ϕddeg⁡)−1 is an actual isomorphism of the two ungraded cyclotomic towers, and its module equivalences intertwine every color induction and restriction functor, including their composites and every finite rank truncation. Here the degenerate color i corresponds to the nondegenerate eigenvalue ξi. No finite-quantum-characteristic theorem is an input.

Facts & Assumptions

Given: The parameters, presentations, and the following two proved supplier contracts, whose exact presentation binding is checked below.

[F1]

Generic cyclotomic type-A support is bounded by rank supplies the support theorem: at positive level, the algebras in rank d>0 are finite-dimensional, their dots are nilpotent, and every surviving color lies in Bd=[min⁡S−d+1,max⁡S+d−1]∩Z. Hecke joint spectral projectors eH(ν) exist over k, with eigenvalues νr or ξνr. The full-line KLR rank algebra is unchanged by any finite interval containing Bd. At level zero all positive ranks are zero and rank zero is k.

[F2]

There are fixed pairwise formal series pab,qab,Pab,Qab for every a,b∈Z, independent of rank, multicharge, content and window; qab,Qab are units. On every finite integer window, the local replacements displayed in the Statement satisfy all affine mixed, quadratic, distant and braid relations in both directions, with the same KLR convention. This contract is proved locally by Integer-color degenerate Hecke–KLR local inverse tables and Generic nondegenerate local inverse tables on integer colors, including all five equality patterns of three colors in the same native convention ψ=−τ; the cited article and a finite-e instantiation do not replace these local proofs. The first direction uses the actual Hecke joint projectors and dots; the reverse uses the KLR word idempotents and dots. No cyclotomic relation, cyclotomic inverse composite, cyclotomic spectral identification or tower assertion is assumed from these local suppliers.

Proof

1.1F1F2givenalgebra

Bind the actual proved suppliers. The arbitrary-base affine presentations in the Statement specialize the common defining generators and relations over k, with first-strand monic polynomials ∏j(t−mj) and ∏j(t−ξmj); the latter has unit constant term. Thus the finite-dimensional spanning and spectral-support proof [F1] applies at every level and rank. Its line datum satisfies the native quadratic symmetry and homogeneous extremal conditions with di=1, and its standard exponents are exactly λi=#{j:mj=i}. On every finite interval its support proof gives actual whole-algebra equality, global nilpotent dots and polynomial projectors over k, not just a supported corner. The two local suppliers in [F2] use the SAME native τ and set ψ=−τ: both have ψu−vψ=−1, ψv−uψ=1, quadratic Qa,a+1=v−u, Qa+1,a=u−v, and braid difference ψ1ψ2ψ1−ψ2ψ1ψ2=[Q(u,v)−Q(w,v)]/(w−u) on (a,b,a). Their pair series are fixed for all integer pairs and all ranks; the nondegenerate symbol q is our ξ. Their proofs give faithful ACTUAL affine polynomial presentations before completion and before any quotient, then identify the true central completions with one formal dot ring per word. They prove both map directions on all five equality patterns of three colors, including all equal, and inverse composites with the displayed right multiplication order. Therefore they apply to exactly the affine blocks under consideration; no finite cyclic quantum characteristic, generic-rank faithfulness or cyclotomic polynomial faithfulness is assumed.

2.1F1F2step 1.1algebra

Evaluate a formal series in commuting nilpotent dots by its finite Taylor sum. This evaluation is independent of the nilpotence exponent chosen: every larger truncation differs only by zero monomials. A series with nonzero constant term is a unit by a terminating geometric expansion. Thus all replacements in the Statement are defined. By [F1] only finitely many words survive in any rank. The local relation verifications in [F2], applied on those words, give homomorphisms between the affine presentations before checking the first-strand quotient. No cyclic wraparound or reduction of integer colors is used.

3.1givenstep 2.1algebra

On a first color i, write the degenerate cyclotomic polynomial as f(i+y)=yλiUi(y), where Ui(y)=∏mj≠i(i−mj+y). Its constant term is nonzero in characteristic zero. In the other branch g(ξi(1−y))=(−ξi)λiyλiVi(y), where Vi(y)=∏mj≠i(ξi−ξmj−ξiy). Infinite multiplicative order makes its constant term nonzero. Both auxiliary factors are units after nilpotent evaluation. Thus the Hecke cyclotomic relation on each projector is equivalent to y1λie(i,…)=0. If λi=0, the unit polynomial kills the entire projector. This proves both directions of cyclotomic IDEAL transport: in each completed word corner the transformed Hecke generator is an invertible scalar and unit power series times y1λie(i,…). Multiplication by that factor gives containment in the KLR-generated two-sided ideal; multiplication by its inverse gives the reverse containment. Summing the finitely many orthogonal first-color corners proves equality of the full two-sided ideals. On either nilpotent quotient these units evaluate by finite Taylor sums, so the actual affine maps descend to homomorphisms of the entire cyclotomic algebras in both directions. This does not assume that a restricted supported subalgebra is the full quotient.

4.1F1step 3.1algebra

Denote the descended reverse map by σd:Hd→Rdλ. On eR(ν)Rdλ, each σd(xr) has sole generalized eigenvalue νr, or σd(Xr) has sole generalized eigenvalue ξνr. Distinct colors have distinct values, and the orthogonal word idempotents sum to one. The simultaneous primary projector is therefore precisely left multiplication by eR(ν). The Hecke polynomial projector maps to this idempotent: its Chinese-remainder polynomial is one modulo the corresponding primary factors and zero modulo all other factors. Hence σd(eH(ν))=eR(ν). The forward map already sends eR(ν) to eH(ν).

5.1step 2.1step 4.1algebra

Both composites fix the word projectors by step 4.1 and the dots by direct substitution xr−νr=yr, or 1−ξ−νrXr=yr. On a word, the crossing composite is (ψrqab−pab+pab)qab−1=ψr, or (ψrQab−Pab+Pab)Qab−1=ψr. Conversely the Hecke composite sends sreH(ν) to ((sr+pab)qab−1qab−pab)eH(ν)=sreH(ν); the formula with T,P,Q is identical. The polynomial generators are fixed, and the units Xr−1 are fixed because inverses are unique. Thus the homomorphisms are inverse on every generator, without commuting a crossing through its series.

6.1F1F2step 5.1construct

For ranks through D>0 at positive level use the common interval WD=[min⁡S−D,max⁡S+D]∩Z. It contains the support through rank D and one unused ghost color beyond each endpoint of BD. A crossing permutes existing colors and never creates one; nevertheless these endpoint colors keep every boundary edge of a surviving color represented by the integer-line convention. For operations reaching rank D+t, use WD+t, and enlarge further to contain any specified color and its neighbors. All extra word idempotents vanish by [F1]. Since [F2] fixes the same series for each ordered pair in every interval, evaluation on surviving words is unchanged by enlargement. The resulting maps are independent of windows and glue across all finite rank bounds.

7.1F1givenstep 6.1algebra

Let ιH:Hd→Hd+1 send each existing Hecke generator to the generator with the same index. It is a homomorphism because all rank-d relations, including the first-strand relation, hold in rank d+1. Its spectral projector satisfies ιH(eH(ν))=∑aeH(ν,a): the first d polynomial generators give a representation of Hd on the rank-d+1 regular module, so their primary projector is the sum of exactly these joint projectors. The minimal polynomial of each rank-d algebra generator on its regular module annihilates that algebra element itself, hence every representation of Hd; the same is true of the polynomial primary projectors. Thus the first-d primary decomposition on the rank-d+1 regular module contains exactly the rank-d allowed eigenvalues, and every prefix violating rank-d support is zero. This is the algebra-identity consequence of [F1], rather than an unsupported extension of a regular-module assertion. This argument also holds for d=0, where the empty projector is one.

8.1F2step 5.1step 7.1algebra

Define ιR=σd+1ιHϕd. The established inverse maps make this a homomorphism. Steps 4.1 and 7.1 give ιR(eR(ν))=∑aeR(ν,a). The unchanged polynomial generators give the usual prefix dots. For r<d, the rank-independent pair series in [F2] and cancellation in step 5.1 give ιR(ψreR(ν))=∑aψreR(ν,a). These are exactly the standard right-appending KLR maps, so the individually constructed isomorphisms commute with the actual tower maps. Injectivity of the tower maps is neither needed nor inferred.

9.1step 4.1step 8.1construct

Put ϵiR=∑νeR(ν,i) in rank d+1, and define ϵiH by the analogous spectral sum. Step 4.1 gives ϕd+1(ϵiR)=ϵiH. Each last-color projector commutes with every prefix generator, since prefix crossings permute only the first d colors and prefix dots preserve all colors. On left modules color restriction is N↦ϵiN, with the rank-d action through its prefix map. Color induction is M↦Ad+1ϵi⊗AdM. Step 8.1 identifies both prefix actions, and the algebra isomorphism identifies these induction bimodules on both sides. Explicitly aϵi⊗m↦ϕd+1(a)ϵi⊗m is a balanced bijection, with inverse obtained from σd+1. Restriction agrees by the same projector equality. These formulas are natural in module maps.

10.1F1step 6.1step 9.1∎

Composing the two comparisons through the same Rdλ proves the claimed degenerate/nondegenerate tower equivalence. Naturality from step 9.1 intertwines repeated induction and restriction, while step 6.1 covers every specified finite rank cut. At level zero use the identity on rank zero and the unique maps between zero algebras in positive rank; the sole map from rank zero to rank one is the map to zero, and all positive-rank functors vanish. Thus all ranks and levels are included. The actual presentation and convention binding in step 1.1 discharges [F1]–[F2], so this proves the entire all-rank, all-level tower comparison. No based or standard-class theorem is inferred merely from these algebra isomorphisms.

Remarks

The facts [F1] and [F2] are the actual proved local support and inverse-table suppliers. All displayed formulas use their native convention ψ=−τ and the same dots. The proof binds their hypotheses and establishes the entire gluing conclusion; a based categorification or standard-class dictionary still requires its own proved suppliers.

For finite-dimensional modules the tower equivalence preserves simples and indecomposable projectives up to isomorphism and intertwines their ungraded G0 and K0 residue operators. This follows from the exact equivalence and the bimodule identification, and permits transport of an actually proved parameter-one based theorem over C. It does not identify Specht standard classes, graded decomposition polynomials, or a quantum parameter different from one. Those claims require their own dictionaries and proofs.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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