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.

Actual partial Frobenius caps satisfy all two-color terminal contractions

Statement

Use the standard first-strand cyclotomic KLR quotient over a degree-zero field, any real symmetrizable datum and every homogeneous (Q1)–(Q4) parameter family. The same ungraded assertions hold for arbitrary monic field specializations ai of degrees ⟨hi,Λ⟩. Let η be any downward prefix of root weight γ, let i≠j, and put A=RaΛ(γ), B=RaΛ(γ+αi+αj), eij=e(ηij) and eji=e(ηji). Use the actual caps Tiγ of Cyclotomic induction and restriction have compatible Frobenius dual bases. There is an explicitly computed linear residual map Dη:eijBeji⟶e(η)Ae(η) such that, with p=τn+1eij∈ejiBeij and n=∣η∣, TiγTjγ+αi(ap)=tjiDη(a),TjγTiγ+αj(pa)=tijDη(a). These are exact corner identities after the arbitrary prefix, before any prefix closure. They hold separately on every reduced matching with k=0,1,2 distinguished terminals connected to distinguished terminals; all shorter-crossing terms are included. In particular, composing with any fixed prefix functional gives the same residual evaluation in all three terminal patterns. No common finite coefficient ring for the separately transported distinguished-color actions is assumed.

The computation uses a downward generic PBW lift, expands its faithful polynomial operator by root-labeled permutations, cancels the quadratic factor attached to the distinguished pair, and extracts the two terminal Laurent coefficients. This produces an element of the old algebra and is independent of the lift. It uses no Frobenius symmetry or full two-color action premise. The typed formulas specify the scalar orientation without an implicit reversal of source and target corners.

Facts & Assumptions

Given: The datum, monic quotient, prefix, actual caps and typed corner maps of the Statement, with right append.

[F1]

Actual caps are bimodule maps, their canonical first-adjoint transport preserves the ordinary first unit, and their transported diagrams have both adjunction triangles (Cyclotomic induction and restriction have compatible Frobenius dual bases). The formal partial-category normal forms are jointly faithful in the universal flag models before quotienting, and their downward quotient transport identifies actual generator append maps (Oriented minimal-parabolic normal forms and the cyclotomic cap ideal).

[F2]

The actual terminal-dot formula and central bubble coefficients are Actual terminal dot caps have a prefix residue formula. Write h=⟨hi,Λ−γ⟩ and Riη(z)=z−hHη(z−1). Appending a distinct color j gives Riηj(u)=tijRiη(u)/Qij(u,v).

[F3]

Ordinary PBW and the faithful polynomial representation are The PBW (monomial) basis theorem for KLR algebras and Faithful polynomial representation of a KLR algebra. Choose its factorization with one Pij=Qij and the opposite Pji=1, for each unordered pair. A distinct crossing switches labeled variables with a P factor; an equal crossing is (1−s)/(x−y). The generic algebra embeds in rational permutation operators; their coefficients have denominators only differences between same-color labeled variables when no P is inverted.

[F4]

In the actual normalized flag maps, for an old i-subset J and a new root v∉J, the first unit has coefficient cJ(v) and the second cap has coefficient 1/bJ′(v); cups/caps are zero on paths with different endpoint subsets. Moreover the polynomial part of cJ(z)/bJ(z) is ∑a+ℓ=−hzaHJ,ℓ (The polynomial flag comparison has the prescribed second-mate inverse). The formal bubble and native-dot conventions are The minimal-parabolic KLR diagram proof category and The quiver Hecke (KLR) algebra of a symmetrizable Cartan datum; in particular τnv=uτn−1 for equal terminal colors. The quotient is The cyclotomic KLR quotient at a dominant integral weight.

Proof

Proof technique: compute the same-color transfer cap, identify every actual relative cap by two PBW double cosets, and compare the two terminal orders in one faithful generic downward permutation representation.

1.1F1F4givenconstructalgebra

The typed transfer base. Suppose the old prefix ends in i, with last old dot u, and append another i with dot v. Closing the appended strand on τn is the natural transformation K=(εμ′Gi)(HiτGG)(ημGi) on Gi whose input is μ+αi and output is μ=Λ−γ; its intermediate word is HiGiGi. The first unit is at the old output weight μ, and the second cap deletes the marked appended flag. First evaluate with an independent universal monic flag polynomial, on the root path K0→J=K0∪{u}. The unit sums paths adding v∉J, with coefficient cJ(v). The retained term of the native crossing on ordered additions (u,v) has coefficient 1/(u−v), and the subsequent marked deletion returns to J with second-cap coefficient 1/bJ′(v). Its switched term instead gives the old subset K0∪{v}; the cap-to-identity component at J is zero by [F4]. Thus the diagonal coefficient of the actual composite is ∑v∉JcJ(v)/(bJ′(v)(u−v)). Polynomial interpolation subtracts these simple poles from cJ(z)/bJ(z); since cJ(u)=0, this sum is minus its polynomial part at u, hence −∑a+ℓ=−huaHJ,ℓ. Both sides are integral flag maps; the generic-root computation descends by the projectivity and injection proved in [F4], and then specializes to every framing/spectator polynomial, including repeated spectator factors. Joint faithfulness of the universal partial models in [F1] gives this identity of formal maps on Gi, with its bubble in the output region μ. Transport through the quotient and the first-unit-preserving identification of [F1] therefore gives Tiγ(τne(ηi))=−∑a+ℓ=−huaHη,ℓ in the actual old corner. No faithfulness of the cyclotomic quotient under localization is used.

1.2F3F4constructalgebra

Two relative PBW summands. Work now in the ordinary generic algebras A~=R(γ) and B~i=R(γ+αi), with the same scalar monic framing coefficients used in the series. Choose PBW reduced words adapted to the two double cosets of Sn in Sn+1. A permutation fixing the appended position gives the summand A~[v]. Every other permutation has a length-additive expression w1snw2, with w1,w2∈Sn, giving old factors sandwiching τnvm. In the append-i corner, the two colors meeting at this middle crossing must both be i: the exterior permutations fix the appended position, whose color is i at both boundaries. Thus these two sorts span the entire append corner as an old-algebra bimodule, by [F3]. Dot powers and coefficients can be moved to the indicated locations with the native dot relations, whose correction terms belong to the same span.

2.1step 1.1F1F2F4algebra

All transfer powers. Put Km=Tiγ(τnvme(ηi)). The native dot relation in [F4], old-algebra bilinearity of [F1], and the actual dot formula in [F2] give Km=uKm−1−Hη,m−h for m≥1. With step 1.1 this yields Km=−∑a+ℓ=m−huaHη,ℓ. All indices in the sum are nonnegative. Equivalently Km=[v−1]vmRiη(v)/(u−v), with (u−v)−1=−∑a≥0uav−a−1. This is a finite coefficient computation even for h≤0.

3.1step 2.1step 1.2F1F2F3algebra

A single generic lift of the actual cap. Expand a generic downward element in the faithful rational permutation representation of [F3]. Discard the permutation terms that move the appended position, delete that position from all retained permutations, multiply their coefficients by the corresponding word series Riη(v), and extract [v−1]. Denote this explicitly defined map by T~i. Its output initially lies in rational old permutation operators. The coefficient-by-coefficient centrality calculation in [F2] uses only the generic dot and crossing relations, so it also holds before the cyclotomic quotient. It is an old-algebra bimodule map: old permutations fix v, the word-indexed coefficients of Ri(v) commute with the old algebra by [F2], and projection to the subgroup fixing v commutes with multiplication by old permutation operators. On the first summand of step 1.2 it is exactly the dot-cap formula. On the second summand, τn=(1−sn)/(u−v) has retained coefficient 1/(u−v); its switched term cannot fix the appended position after multiplication by either old exterior permutation. Therefore it is exactly the transfer formula of step 2.1, including both old exterior factors. Both summands consequently have outputs in the ordinary polynomial algebra A~, not merely its rational localization. The actual quotient cap agrees with this generic map followed by the cyclotomic quotient on every spanning term. Hence Ti has this one downward lift, and T~i sends the generic cyclotomic kernel into the old cyclotomic kernel. This last assertion follows from equality with the actual quotient map, not from localization of the quotient.

4.1step 3.1F3constructalgebra

A common representation for both colors. For the original prefix use the one ordinary generic algebra B~=R(γ+αi+αj) and its representation of [F3]. Give the two terminal labeled variables names u of color i and v of color j, independently of their position. Let a~∈eijB~eji lift a. For a term retained after both terminal projections in a~p or pa~, its permutation in a~ must be sπ=πs, where s switches these two terminal positions and π fixes them both. It maps the ji word to the ij word and induces the old prefix permutation π. All other terms are discarded in both orders. This is an exact condition on labeled permutations; it does not require that the original reduced matching itself preserve the terminal pair. In particular, the no-switch terms in equal-color divided differences are retained where necessary in the zero-return and one-return patterns.

5.1step 4.1F3algebra

The complementary factor is present. Track the two distinguished labeled roots through any expanded generator word contributing the permutation sπ of step 4.1. Their relative order is reversed, so they undergo an odd number of distinct-color switches. Equal-color retained terms do not switch labels; equal-color switched terms switch roots of the same color and cannot supply this distinguished i,j reversal. With the Q/1 factorization of [F3], the net reversed path contains the complementary factor of the reverse terminal crossing; every extra pair of switches contributes a further quadratic factor. Thus the coefficient of sπ is divisible by that complementary P factor. The only denominators in this expansion are differences of same-color labeled roots. They cannot involve both u,v, since i≠j. The divisibility holds termwise and therefore after adding all generator-word contributions. Multiplying by the singled-out crossing in either order gives its complementary factor times its own factor, exactly Qij(u,v), with the same residual coefficient gπ after the variables are identified by color. Indeed sπ=πs and π fixes u,v, so the two operator products have coefficients Qij(u,v)gπ on the same old permutation π. The equality includes all native divided-difference signs.

6.1step 3.1step 5.1F2F3algebra

Cancel before taking coefficients. In the ij corner the two actual generic cap weights of step 3.1 have product Riη(u)Rjηi(v)=tjiRiη(u)Rjη(v)/Qij(u,v). In the ji corner their product is tijRiη(u)Rjη(v)/Qij(u,v) by [F2]. Cancel the Q factor of step 5.1 before coefficient extraction. Every remaining terminal-dependent denominator of gπ is a same-color difference involving one terminal variable and old variables of its own color, or an old difference; there is no denominator coupling u,v. Expand the first kind at its own terminal infinity and localize only the old same-color differences. The two coefficient operations then commute: each monomial contributing to [u−1v−1] uses finitely many coefficients, and all coefficients lie in the same commutative localized old-dot ring. Consequently the common old permutation operator is ∑π[u−1v−1]gπRiη(u)Rjη(v) π. It equals the first actual generic cap composition divided by tji, and the second divided by tij. By step 3.1 these cap compositions belong to e(η)A~e(η). Faithfulness of the generic representation implies they are equal there; the rational computation introduces no new relation. This constructs the common polynomial downward residual map.

7.1step 3.1step 4.1step 6.1F2constructalgebra

Actual quotient descent and the three typed patterns. Define Dη(a) by quotienting the common generic residual of step 6.1. If another lift differs by the cyclotomic ideal, the first cap composition of its product with p has zero image by step 3.1, so division by the nonzero tji gives zero residual. Thus the map is well defined on the actual opposite corner, and its two compositions are precisely the typed identities in the Statement. To isolate a terminal pattern, expand a~ in reduced PBW matchings and partition them by how many of the two distinguished top terminals meet distinguished bottom terminals, namely k=0,1,2. Apply the same projection and coefficient rule of steps 4.1–6.1 to each individual matching term. Restrict the already well-defined map Dη to the image of the span of the kth matching family; this gives Dη,k with the same input and output corners and the same scalar factors. These images may intersect; no direct-sum decomposition of the cyclotomic quotient by matching types is asserted. The expansions include every lower permutation term of the original crossing word. Therefore no unproved slide of external maps or identification of separately transported flag modules is needed for either k=0 or k=1. For k=2 and polynomial terminal inputs the rule is exactly the explicit Dη(g) of [F2]. Prefix crossings and dots are part of the same common downward lift throughout.

8.1step 1.1step 2.1step 6.1step 7.1F1F2algebra∎

Boundary, specialization and scope. Only the generic ordinary polynomial representation is localized, and its equality has already descended to the ordinary old algebra before taking the quotient. No claim of cyclotomic faithfulness after localization is made. At empty prefix the same computation is monic coefficient extraction; zero corners give zero residuals by step 7.1. Negative h, ai=1, repeated roots and arbitrary field characteristic are covered by the finite series formulas and universal integral descent in steps 1.1–2.1. The construction uses only finitely many PBW terms and Laurent coefficients, so no choice principle is needed. Arbitrary monic specialization preserves the identities with grading forgotten; in the homogeneous branch every actual map retains its stated adjunction degree. Finally one may compose both corner identities with the identical actual prefix closure: this gives their crossing scalar ratio without assuming symmetry. Diagonal inversion weights can subsequently cancel those ratios along adjacent exchanges; that global trace assembly and the full adjunction-mate interpretation are separate consequences, not premises of this proof.

Depends on

Used by

Dependency tree · two levels

24 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