Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 induction and restriction have compatible Frobenius dual bases

Statement

For the standard first-strand cyclotomic quotient of a real symmetrizable KLR datum over any degree-zero field and every homogeneous (Q1)–(Q4) parameter family, put A=RΛ(β), B=RΛ(β+αi), e=e(β,i), X=Be, Y=eB, h=⟨hi,Λ−β⟩ and t=2di(1−h). There are explicit, compatible homogeneous maps Ti:eBe⟶A,deg⁡Ti=t, and finite homogeneous tensors Ci=∑αxα⊗Ayα∈X⊗AY,deg⁡xα+deg⁡yα=−t, such that Ti is an A-bimodule map, bCi=Cib for every b∈B, and x=∑αxαTi(yαx),y=∑αTi(yxα)yα. In particular X{t}≅HOM⁡A(Y,A) as (B,A)-bimodules, where Hom is left-A-linear, the left B-action is precomposition with right multiplication on Y, and the right A-action is multiplication on values. The second unit is b↦bCi and the second counit is y⊗Bx↦Ti(yx), giving Ei{t}⊣Fi⊣Ei on all graded modules. They are obtained by finite normal-form/cap transport, not by assuming an actual Frobenius trace. Dots and same-color crossing mates have the native cyclic normalization. Each specified distinguished-i different-color sideways pair has both composites tij times the identity. The separately distinguished-j construction has both composites tji times the identity. These are different partial actions, not two different scalar values for the two orders of one pair; their full word-closure comparison is not inferred here. Arbitrary monic field specializations have the same ungraded construction, with grading shifts forgotten. No finite-type, characteristic-zero, geometric-global-basis or symmetric-trace premise is used.

Facts & Assumptions

Given: The algebras, corner bimodules and shift in the Statement, with right append and the first-strand cyclotomic ideal.

[F1]

The fully typed formal category and its independently constructed flag inverse/cap maps (The minimal-parabolic KLR diagram proof category, The polynomial flag comparison has the prescribed second-mate inverse): both rank-one inverse equations, both formal adjunction triangles, dot/same-color cyclicity, and the normalized partial different-color mate pairs. At outside weight h the first unit and second counit have degree s=di(1−h); at the adjacent outside weight h−2 the first counit and second unit have degree −s. The same distinguished-i pair has both composites tij; the separately distinguished-j construction has scalar tji.

[F2]

The normal-form/cap-ideal supplier (Oriented minimal-parabolic normal forms and the cyclotomic cap ideal): the quotient representable category has the exact cyclotomic downward Hom corners, its ideal is stable under all allowed whiskers, and every mixed word is a retract of a finite sum of downward words by its specified finite rank-one reduction. No extra downward relation occurs. Its corner identifications respect composition, word idempotents and generator append maps, also for arbitrary monic specializations.

[F3]

The actual basic functors and ordinary adjunction are Cyclotomic KLR induction and restriction functors; Cyclotomic induction is projective on the right independently proves that they preserve finite graded projectives. Tensor/Hom and shifts are those of Graded balanced tensor product and homogeneous Hom and Associative graded algebras, bimodules, and internal shifts.

Proof

Proof technique: explicitly extend the downward-corner equivalence to projectives, identify the first right adjoint with restriction, evaluate the transported second unit/counit on regular modules, and read both dual-basis identities from their triangles.

1.1F1F2constructalgebra

The concrete projective equivalence. For each root γ let Qγ be the finite direct sum of all downward words of weight γ from the vacuum. Its cyclotomic quotient endomorphism algebra is RΛ(γ) by [F2]. A mixed word is reduced by moving its earliest upward letter toward the vacuum. An unequal-color step uses the normalized mixed isomorphism; a nonnegative equal-color step replaces it by the prescribed finite direct sum, while a negative step uses the prescribed inclusion/projection to exhibit the needed summand as a retract. Every term decreases the pair consisting of the number of upward letters and their distance from the vacuum; an upward letter at the vacuum is killed by the quotient ideal. Thus the stated finite downward retraction is an actual matrix of formal maps, with its two retraction equations. Apply the downward Hom identification entrywise to such matrices and their idempotents. For the target-first corner convention, downward Yoneda first sends a word ν to the right module e(ν)RΛ(γ); twisting by the generator-fixing anti-involution sends it to the left module RΛ(γ)e(ν). A diagram p then acts by right multiplication by ψ(p). This explicit double reversal makes composition correct; it is not an implicit opposite-algebra identification. Full faithfulness on sums follows entrywise from the corner isomorphism, on retracts by cutting the matrix with its idempotents, and essential surjectivity from the definition of a finite projective as a finite free retract. Denote this equivalence by Ξγ.

2.1step 1.1F1F3constructalgebra

Induction and its actual right adjoint. Appending Gi sends every downward generator and old algebra action to its right-append image. Hence Ξβ+αiGiΞβ−1 is F=X⊗A− on the regular-word summands, their morphisms, finite sums and retracts. The formal Hi on this pair is normalized restriction shifted by s=di(1−h): its input weight is h−2, so its defining shift is −di(1+h−2)=s. Put Eˉ=ΞβHiΞβ+αi−1{−s}. The first formal unit/counit, after this deshift, give F⊣Eˉ in degree zero. The actual functor E=Y⊗B− is also a right adjoint by [F3] and takes finite projectives to finite projectives. If (ηˉ,εˉ) and (η,ε) are these two first adjunctions, define αN=E(εˉN)ηEˉN:EˉN→EN and βN=Eˉ(εN)ηˉEN:EN→EˉN. Substitution and the two first triangles give αNβN=1 and βNαN=1; the same substitutions show these isomorphisms preserve the first units/counits. This identifies Hi with actual E{s} by explicit maps.

3.1step 1.1step 2.1F1constructalgebra

Actual second maps, including their shifts. Write εˉM′:EˉFM→M and ηˉN′:N→FEˉN for the transported second maps after deshifting Hi. Their degrees are 2s=t and −2s=−t: the second counit originally has degree s on HiGi=EˉF{s}, whereas the second unit at the adjacent weight has degree −s into GiHi=FEˉ{s}. Define εM′=εˉM′βFM and ηN′=F(αN)ηˉN′. The equations αβ=1, naturality, and the second triangles in [F1] give the second triangles for these actual maps, with precisely the indicated degrees. This construction involves only applying the explicit matrices of step 1.1 and the displayed maps of step 2.1 to the diagram units/caps; the cup/cap images are not assumed to be a previously named coefficient trace.

4.1step 1.1step 2.1step 3.1F2F3constructalgebra

Evaluation on the regular modules constructs the bimodule functional and tensor. Identify EFA=Y⊗BX=eBe and FEB=X⊗AY. Set Ti=εA′ under the first identification and Ci=ηB′(1B) under the second. These are explicit finite normal-form computations: use the specified retraction matrices for HiGiQβ and GiHiQβ+αi, the corner isomorphisms, the first-adjoint maps α,β, and finally the second cap or cup. For an input z∈eBe, the target-first convention uses the formal normal-form lift of ψ(z), so its left-projective image is right multiplication by z. Different generic lifts differ by the exact cyclotomic ideal of [F2] and hence give the same quotient computation. Left A-linearity of εA′ gives Ti(ι(a)z)=aTi(z); naturality with right multiplication by a on A gives Ti(zι(a))=Ti(z)a. Similarly ηB′ is left B-linear, so ηB′(b)=bCi, and naturality with right multiplication by b on B gives bCi=Cib. The degrees in step 3.1 give deg⁡Ti=t, deg⁡Ci=−t. A tensor element has a finite expression by the definition of the balanced tensor product; taking its homogeneous components gives the asserted finite sum Ci=∑xα⊗yα.

4.2step 1.1step 2.1step 3.1F1algebra

Native compatibility and the two partial constructions. All transformations were transported through a fully faithful equivalence preserving append generators and the first adjunction. Therefore the actual dot and same-color mate equations are exactly the realized equations of [F1], with κ=−τ throughout. For the i-partial different-color pair, its maps are the concrete cup--κij--cap and opposite cup--κji--cap contractions in [F1]; both composites are tij times their respective identities. Passing to native crossings negates each of these single-crossing maps, so the two signs cancel in either composite. Repeating the entire construction with distinguished color j gives its actual pair with scalar tji in both orders. This proves the stated partial mate compatibilities at their actual source/target weights, without identifying an Hj inside Pi, which contains only Hi. A full word-closure comparison between the two separately constructed partial actions requires an additional calculation.

5.1step 3.1step 4.1algebra

Both dual-basis identities and the actual perfect pairing. Evaluate the second triangle for F at A: x↦∑xα⊗yα⊗x↦∑xαTi(yαx) is the identity on X. Evaluate the second triangle for E at B: y↦∑y⊗xα⊗yα↦∑Ti(yxα)yα is the identity on Y. Thus the claimed identities are actual bimodule equations. Define Φ:X{t}→HOM⁡A(Y,A) by Φ(x)(y)=Ti(yx). The bimodule properties in step 4.1 give the specified B,A-actions, and the degrees give a degree-zero map. Its inverse sends f to ∑xαf(yα), regarded in X{t}. The first identity proves this inverse composed with Φ fixes x, and left A-linearity of f and the second identity prove Φ composed with it fixes f. Hence the pairing is perfect without a symmetric-algebra or dimension argument.

6.1step 4.1step 5.1F3algebra

Extension to all modules. At regular modules, naturality identifies the second counit with y⊗Bx↦Ti(yx) and the unit with b↦bCi. A natural transformation between tensor functors on finite projectives is determined by its regular-module bimodule map: finite sums and shifts follow additively and retracts follow by cutting with their idempotents. The displayed maps therefore reproduce the transported transformations there. Define them on arbitrary modules by tensoring these actual bimodule maps. Their balancing uses A-bilinearity of Ti and B-centrality of Ci, and their two triangle composites are the exact identities of step 5.1 tensored with the input. They consequently give E{t}⊣F on all modules, including infinitely generated ones, together with the independently existing F⊣E. No projective-presentation limit or assumed quotient flatness is used.

7.1step 4.1step 5.1step 6.1F1F2F3algebra∎

Boundaries and monic specializations. If A=0, unital right append forces e=0; if e=0 for any other reason, X=Y=0, Ti=Ci=0, the pairing is the zero-to-zero isomorphism and both functor triangles are identities of zero functors. At the vacuum the actual construction is the monic coefficient trace on k[z]/ai(z) and its monic dual-power Casimir from [F1], including ai=1 and degree-zero quotients. In the standard case its degree is 2di(1−λi), agreeing with t at β=0. All reductions use finitely many words, matrices and polynomial remainder coefficients; no arbitrary-index choice, factorial denominator, splitting field or separability argument is used. The two independent suppliers and the ordinary adjunction/projectivity in [F3] work for arbitrary monic specializations, so forgetting grading gives the same actual maps and identities there. No trace theorem was used to construct its own adjunction.

Depends on

Used by

Dependency tree · two levels

27 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