Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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 quantum Serre halves have classical PBW ranks and a nondegenerate Hopf pairing

Statement

Let R=C⟦ℏ⟧, K=C((ℏ)), q=eℏ, and qi=ediℏ for a finite symmetrizable Cartan datum. Let H+=Uℏn+, ⟨V⟩ and the shuffle product be as in The formal quantum shuffle Borel and its Cartan crossed product, and put H−=T(V∗)/J− using The quantum Serre sums vanish in the shuffle algebra, and the opposite Serre ideal annihilates the shuffle half. Assume AC (The Axiom of Choice), used only through the formal embedding theorem. For an indeterminate z, let Hz± be the algebras over C(z) presented by the separate symmetric quantum Serre relations, with parameters zi=zdi.

(i) Each H±[±α] is finite free over R, and rank⁡RH±[±α]=dim⁡CU(n±)[±α]=dim⁡C(z)Hz±[±α]. Every family of homogeneous lifts of a basis of the classical component is an R-basis. Likewise, homogeneous word expressions with coefficients rational in z, regular at z=1, which reduce to a classical component basis form a basis of the corresponding generic component. In particular, for a supplied ordered homogeneous basis of n±, ordered monomials in any such regular lifts form a generic PBW basis.

(ii) Both formal halves are graded braided Hopf algebras. Their generators are primitive, their counits kill positive height, and their tensor squares use (u⊗v)(u′⊗v′)=q−⟨deg⁡u′,deg⁡v⟩uu′⊗vv′,⟨ϵi,ϵj⟩=diaij, with negative degrees for H−. The word pairing restricts and descends to a nondegenerate K-valued pairing H+×H− with ⟨ei,fj⟩=δij/(ℏdi) and ⟨1,1⟩=1. It is zero on unequal opposite degrees and satisfies the braided Hopf adjunctions ⟨x,yy′⟩=∑⟨x(1),y⟩⟨x(2),y′⟩,⟨xx′,y⟩=∑⟨x,y(1)⟩⟨x′,y(2)⟩. The generic halves have the same braided Hopf structures and a nondegenerate C(z)-valued pairing normalized by ⟨ei,fj⟩z=δij/(zi−zi−1). Thus opposite graded components are dual. All generic assertions also hold for the corresponding Q(z)-presentations and their rational pairing, with the PBW lift clause using bases of the rational classical Serre form.

Facts & Assumptions

Given: The finite symmetrizable datum, its formal and generic Serre presentations and the formal parameter.

[F1]

The positive formal half is isomorphic to ⟨V⟩, its intrinsic reduction is U(n+), and its finite free components have the stated classical and generic ranks; AC enters only in its coideal argument (The formal quantum Serre half embeds in the shuffle algebra and is degreewise free, The Axiom of Choice).

[F2]

The negative Serre ideal annihilates ⟨V⟩ under the diagonal pairing of word bases with value ℏ−k∏tdit−1 on matching length-k words. The cut coproduct is an algebra map to the scalar-braided tensor square and preserves the generated half (The quantum Serre sums vanish in the shuffle algebra, and the opposite Serre ideal annihilates the shuffle half).

[F3]

The formal word space is degreewise finite free, its scalar form is symmetric, and the Serre coefficients are symmetric Gaussian Laurent polynomials (The formal quantum shuffle Borel and its Cartan crossed product, The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality).

[F4]

The classical half admits an ordered homogeneous basis obtained by enumerating its finite bracket words, and ordered monomials in that basis form its enveloping-algebra basis (PBW for countably presented Kac Moody Lie algebras).

[F5]

Tensoring is right exact, so the tensor quotient kernel is the sum of the two factor kernels; over a field every injection remains injective after scalar extension (Tensoring is right exact, Restriction of scalars and extension of scalars S⊗RM along a ring homomorphism R→S).

[F6]

The fraction field of R is K, and a domain embedding into a field extends to its fraction field (The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain).

Proof

1.1F1F3algebra

The identification of free generators ei↦fi carries the positive Serre presentation onto the negative one, reversing degrees; the same holds classically and generically. Thus [F1] gives all three rank equalities and finite freeness on both sides. In a fixed finite free component, lifts of a classical basis have a coordinate matrix whose reduction is invertible over C, so its determinant has nonzero constant term and is an R-unit. The adjugate identity makes this matrix invertible over R, proving the formal lift assertion.

1.2F1F2F3F5algebra

Give the free positive tensor algebra the primitive-generator coproduct into its scalar-braided tensor square. Its map to ⟨V⟩ commutes with the cut coproduct: both are algebra maps by [F2] and agree on each letter. By [F1] its kernel is precisely the positive Serre ideal. Hence the composite of the tensor coproduct with the two quotient maps kills that ideal, and [F5] gives its coideal inclusion and descended coproduct. The same presentation identification gives the negative coproduct. Coassociativity and counit follow on primitive generators and hence on the generated algebras. The color-height grading is connected, so the reduced coproduct of a positive-height homogeneous element has both factors of strictly smaller height. The recursion S(x)=−x−∑S(x′)x′′ and its right-handed counterpart provide left and right convolution inverses by height induction; associativity of convolution makes them equal. Thus both quotients are braided Hopf algebras.

2.1F1F3F4F5F6step 1.1algebra

The substitution z↦eℏ embeds C(z) into K: a nonzero polynomial is (z−1)mp(z) with p(1)≠0, and its value is the nonzero product (eℏ−1)mp(eℏ) in the domain R; fractions then embed by [F6]. In each color degree the generic and formal quotients after extension to K have the same finite word presentation, since the Serre coefficients specialize as in [F3]. A regular rational lift of a classical component basis therefore gives the formal basis of step 1.1 and, after field extension, a generic basis. Applying this degree by degree to the ordered monomials of [F4] proves the PBW monomial clause.

2.2F1F2F3step 1.2algebra

By [F2], the diagonal pairing restricts to ⟨V⟩×H−, and [F1] identifies the first factor with H+. The cut adjunction is the wordwise concatenation identity. For the other adjunction, the coefficient of a word w in a shuffle u∗v equals the coefficient of u⊗v in the primitive braided tensor coproduct of w: both sum over the assignments of letters to the two blocks with inversion scalar q−⟨deg⁡u′,deg⁡v⟩. The degree form is symmetric by [F3], and the diagonal generator weights multiply in the same way on both sides. Thus both adjunctions hold on free representatives, and step 1.2 and the descended pairing make them adjunctions on the quotient coproducts themselves. The empty word gives ⟨1,1⟩=1 and all positive-degree counit pairings vanish.

2.3F1F2F5step 1.1algebra

Fix α∈Q+. If an element of H+[α]⊗RK pairs to zero with every negative class, its realization in the shuffle word space pairs to zero with every negative tensor word, since all those words map to quotient classes. The diagonal word pairing has zero left annihilator, so that realization is zero. The realization remains injective after extension to K by [F1] and [F5]. The opposite components have equal finite dimension by step 1.1; an injective map from one into the other's dual is consequently bijective. Thus both annihilators vanish. For nonhomogeneous elements, separate the finitely many homogeneous components, proving the asserted nondegeneracy.

3.1F3F5step 2.1step 1.2step 2.2step 2.3algebra∎

Define the generic word pairing using shuffle coefficients and matching-word weights ∏t(zit−zit−1)−1. These are rational functions, and under z=eℏ their ratio to the formal pairing in a fixed color degree α is ∏iuiαi, where ui=ℏdi/(ediℏ−e−diℏ) is an R-unit with constant term 1/2. This color-multiplicative rescaling preserves the two adjunctions and nondegeneracy. The specialized generic pairing therefore kills the Serre ideals and is nondegenerate by steps 2.2–2.3; the field embedding of step 2.1 implies the same descent and invertible pairing matrices over C(z). Likewise, coassociativity, coideal inclusions and the coproduct formulas descend generically: in each finite degree their errors vanish after the injective field extension, and the antipode recursion applies there as well. All generic presentations and word pairing coefficients lie in Q(z), so the same injective extension to K proves the statements over that field. This establishes the full braided Hopf pairing with the rational normalization needed for the Drinfeld–Jimbo commutator.

Depends on

Used by

Dependency tree · two levels

58 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