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.

The cyclotomic cap-off quotient has no extra downward relations

Statement

Let Λ be dominant, λj=⟨hj,Λ⟩, and let Pi be The minimal-parabolic KLR diagram proof category, with its homogeneous polynomial realization and PBW/bubble normal form. Fix monic aj(u)=uλj+∑r<λjcj,rur; for the standard graded cyclotomic quotient take aj(u)=uλj as in The cyclotomic KLR quotient at a dominant integral weight. More generally first take universal graded coefficients of degree 2dj(λj−r); arbitrary monic specializations over the field are interpreted as ungraded.

In the representable category Pi(Λ), let J be the ideal generated by 1HivΛ and aj(x)1GjvΛ for every j, closed under arbitrary vertical pre/postcomposition and horizontal whiskering by the allowed 1-morphisms. For downward words μ,ν of the same weight β, include their ordinary KLR corner by the PBW/bubble normal form. Then J∩e(ν)R(β)e(μ)=e(ν)Ia(β)e(μ),Ia(β)=∑jR(β)aj(x1)e(j,β−αj)R(β). The vacuum bubble specialization is forced by these generators: AΛ(t)=1+ci,λi−1t+⋯+ci,0tλi and HΛ=AΛ−1. Consequently the map from the ordinary monic cyclotomic corner to the downward-word Hom corner of Pi(Λ)/J is an isomorphism, with composition corresponding to multiplication. This holds over every degree-zero field for the entire admissible homogeneous Q family, without finite-type or characteristic-zero restrictions. Inhomogeneous monic specializations assert the ungraded corner equality, not a graded quantum-action conclusion.

Facts & Assumptions

Given: A dominant Λ, the formal category Pi of The minimal-parabolic KLR diagram proof category with its model and normal form, and the monic polynomials aj of the Statement.

[F1]

The formal relations of Pi — the two triangles, the rho inverse blocks, mixed dot compatibility, the cross-and-cap identities and the normalized bubble slides — are realized in the polynomial flag model (The minimal-parabolic polynomial flag model realizes the graded diagram relations).

[F2]

The PBW/bubble normal form (PBW and bubble normal form in the minimal-parabolic diagram category): reduced matchings, dot monomials and independent far-left bubble monomials form a basis; specializing the central vacuum bubble coefficients alone gives the all-downward corner R(β) with its ordinary polynomial/crossing part unchanged.

[F3]

The cyclotomic quotient RΛ(β) of The cyclotomic KLR quotient at a dominant integral weight is the quotient by the two-sided ideal generated by aν1(x1)e(ν); the ordinary unquotiented PBW spanning family of The PBW (monomial) basis theorem for KLR algebras descends to the quotient. No cyclotomic PBW basis or quotient-faithfulness assertion is assumed.

[F4]

The constructive exact ideal-intersection and word-retract theorem of Oriented minimal-parabolic normal forms and the cyclotomic cap ideal proves the forced coefficient specialization, correctly typed crossed closure, complete two-double-coset reduction of every killed-upward factor, and finite marked-monic normalization in both signs of the rank-one weight. It depends on the independent flag realization and ordinary PBW, and uses no cyclotomic Frobenius or quotient-faithfulness premise.

Proof

Proof technique: use the proved typed cap computation and complete finite normalization of all representable ideal generators.

1.1F1F2F4algebra

Coefficient specialization. The lawful closure of ai(x)xℓ−1 for ℓ≥1 gives the finite recurrence hℓ+ci,λi−1hℓ−1+⋯+ci,0hℓ−λi=0, with h0=1 and negative indices zero, as proved in [F4]. Hence HΛ=(airev)−1 and AΛ=airev. The resulting coefficient ideal S belongs to J. The tensor-product basis [F2] shows that passing to Pi/S leaves each ordinary downward element unchanged. Actual clockwise vacancy closures have coefficient index λi+1+r for r≥0 and vanish; fake coefficients of indices 1,…,λi retain the prescribed monic values. The case λi=0 gives A=H=1.

2.1step 1.1F1F2F3F4constructalgebra

Every killed-upward factor. The crossed closure at the first physical Gi input Λ is the first-adjunction mate of the exact RΛ composite, whose Hi input is Λ−αi and bubble region is Λ. Its native value is −∑m=0λiAmxλi−m=−ai(x); with extra dots P(u,x) it is −ai(x)P(x,x) because the dot-crossing correction is a zero straight closure. This is the typed local calculation of [F4], with no ambient weight substituted by analogy. Bend a factor through any WHivΛ at its vacuum Hi endpoint; the triangles give a composite with all-downward boundaries and one added first i strand at source Λ+αi. This does not require W to be downward. Apply [F2], slide its bubble coefficients across the added root by AΛ+αi=(1−zt)2AΛ, and specialize S. With the stabilizer WP of position one in Sn+1, [F4] uses exactly the two double cosets WP and WPs1WP, with a length-additive word us1v in the second. The first gives the zero vacancy loop; the second has its sole s1 crossing equal-colored, since the first boundary color is i on both sides. Exterior diagrams pull past the closure, whose value lies in the ordinary first-strand i ideal. Thus every such factor lands in Ia, including arbitrary internal words and factor maps.

3.1step 1.1step 2.1F1F2F4constructalgebra

Every marked monic whisker. At the dominant vacuum the actual dotted columns and bubble-convolution dual rows of the positive matrix, modulo the killed-upward factor, identify HiGivΛ with Dλi. A raw cap row with s extra dots evaluates ai(x)v0 by the zero recurrence at index s+1. Every actual dual row is a finite combination of those rows, so the inverse matrix kills ai(x) on the entire direct sum. To normalize an arbitrary marked whisker, move its earliest Hi toward the initial marked strand. Mixed dot-natural isomorphisms preserve that marker; a nonnegative same-color branch uses the matrix decomposition, while a negative branch uses the actual retract ι=rh−1jH, π=pHrh and (HiGi)(b)=π(GiHi)(b)ι. Absorb retract maps into the factor maps. The intermediate word's pair (number of Hi letters, distance of its earliest one from the vacuum) decreases on every finite branch. At the marked first strand, a different color gives a killed-upward factor; color i gives the zero vacuum matrix calculation. Once the intermediate word is downward, [F2] reduces its factor maps. This complete normalization of [F4] leaves only ordinary first-strand ideal insertions and the factors already treated in step 2.1.

4.1step 1.1step 2.1step 3.1F2F3F4algebra∎

Exact intersection and corners. Expand x∈J∩e(ν)R(β)e(μ) as a finite sum of vertically factored whiskers of the defining generators and pass first to Pi/S. Steps 2.1–3.1 put every surviving generator summand in e(ν)Iae(μ), while coefficient-specialization summands vanish. Step 1.1 leaves the ordinary x unchanged, proving the reverse inclusion. Every ordinary first-strand ideal insertion belongs to J by its definition, proving the forward inclusion. The basis [F2] and the coefficient specialization represent every downward quotient morphism by an ordinary downward element, so the resulting monic cyclotomic corner map is bijective and respects multiplication. All computations hold over the universal graded coefficient ring and then under arbitrary monic specialization with grading forgotten; no finite-type, characteristic-zero, quotient-faithfulness or generic Frobenius assumption is used.

Depends on

Used by

Dependency tree · two levels

16 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