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

Coherent graded biadjunction and the crossing mates

Statement

For the standard homogeneous first-strand cyclotomic quotient over any field and every homogeneous (Q1)-(Q4) datum, use basic right-append induction Fi from β to β+αi and basic restriction Ei in the reverse direction. Put h=⟨hi,Λ−β⟩ and ti(β)=2di(1−h)=(αi∣αi)−2(Λ−β∣αi). Then there are explicit homogeneous bimodule units and counits with both triangle identities giving Ei{ti(β)}⊣Fi⊣Ei on all graded module categories. They preserve the standard dot-cyclic and same-color crossing-mate identities and the coherent different-color double-mate identity: for pν=τre(ν) with bottom adjacent colors (i,j), i≠j, its double right mate is (tij/tji)pν, where tij is the coefficient of u−aij in Qij(u,v) and the strand of color i runs SW to NE. Equivalently the associated right closure satisfies cl⁡(pνa)=(tij/tji)cl⁡(apν) for a∈e(ν)RΛ(β)e(srν); dots, idempotents and equal-color crossings have ratio 1. The corresponding arbitrary monic field quotients have the same underlying ungraded biadjunction and ordered crossing-mate identities after forgetting internal shifts. No Frobenius, integral Grothendieck-module or crystal theorem is a premise.

Facts & Assumptions

Given: The standard right-append induction and basic restriction of Cyclotomic KLR induction and restriction functors, with the algebra diagram convention of The KLR grading and the diagrammatic multiplication.

[F1]

The actual cap Ti:eBe→A, finite central Casimir Ci=∑xα⊗Ayα, both dual-basis equations and actual dot/same-color cyclicity of Cyclotomic induction and restriction have compatible Frobenius dual bases. They are constructed by independent flag/normal-form transport, preserving the first adjunction, without a trace premise.

[F2]

The actual word pairings and ordered closure/double-mate calculation of Cyclotomic word traces assemble a perfect symmetric form. Its full two-color terminal supplier constructs a common old-corner residual map from generic PBW lifts before quotienting, rather than equating the scalars of two separately distinguished partial pairs.

Proof

technique · use the constructed regular-module bimodule maps and dual-basis identities for the second adjunction, and apply the proved typed all-pattern closure calculation to its actual crossing mates
1.1F1constructalgebra

Explicit units, counits and triangles. Put A=RΛ(β), B=RΛ(β+αi), e=e(β,i), X=Be, Y=eB and t=ti(β). The ordinary first unit is the append homomorphism ιi:A→eBe, a↦ιi(a), and its counit is multiplication; the map need not be injective. On a module the unit is m↦e⊗m, and both triangles follow from tensor balancing and multiplication, including when e=0. For the second adjunction use the actual map y⊗Bx↦Ti(yx) and unit b↦bCi of [F1], tensoring with the input module. The balancing uses A-bilinearity of Ti and B-centrality of Ci. Its two triangle composites send x to ∑xαTi(yαx)=x and y to ∑Ti(yxα)yα=y. Their degrees are respectively t and −t, so the resulting degree-zero adjunction is Ei{t}⊣Fi, together with Fi⊣Ei. These exact bimodule identities hold after tensoring with every graded module; no finite-projective-only extension or quotient flatness is assumed.

2.1step 1.1F1F2algebra

Actual crossing compatibility. The cap/Casimir maps in step 1.1 were transported through the canonical first-adjoint comparison, so [F1] gives native dot and equal-color mate cyclicity. For unequal colors, let pν=τre(ν)∈e(srν)Be(ν) with bottom pair (i,j) and a∈e(ν)Be(srν). The common residual in [F2] evaluates apν in the ij corner with scalar tji and pνa in the ji corner with scalar tij. Close a suffix first using actual cap bilinearity and then the unchanged prefix to obtain cl⁡(pνa)=(tij/tji)cl⁡(apν). The constructed perfect opposite-corner word pairing and unit/counit evaluation compatibility identify the double right mate with (tij/tji)pν. This fixes its direction under bottom-to-top operator composition; reversing the chosen crossing exchanges the ratio. Passing from source κ to native τ=−κ negates both paired single crossings and does not change the ratio. No conclusion is inferred from assigning different scalars to the two orders of one fixed partial pair. Apply the actual mate equality to every vacuum word projective of the input algebra. Their finite sum is its regular module, so the equality is one of tensor-bimodule maps, and tensoring gives it on arbitrary modules.

3.1step 1.1step 2.1F1F2algebra∎

Boundaries, monic quotients and conclusion. The construction of [F1] includes zero append corners, where both functors and tensors are zero, and the vacuum monic coefficient cap and dual-power Casimir. All maps and both triangles are integral monic coefficient identities, and the full terminal comparison of [F2] descends to the ordinary polynomial algebra before quotienting. Arbitrary monic field specialization therefore retains the same maps, triangles and ordered mates with shifts forgotten. In the standard homogeneous branch the cap/Casimir degrees in step 1.1 give the displayed ti(β) at every weight. Thus the full stated biadjunction and native ordered mate identities hold on all graded modules, with no finite-type, characteristic-zero, Frobenius, Grothendieck-module or crystal premise.

Depends on

Used by

Dependency tree · two levels

39 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