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.

A minimal numerical Serre kernel obeys the quantum Casimir constraint

Statement

Let ν=pa>1, K=Q(ν), t∈{ν,ν−1}, and let Ut be the actual integral-form specialization from The nondegenerate integral specialization has a quantum Casimir. Let T=K⟨Fi:i∈I⟩ be the free negative tensor algebra, let J=ker⁡(T→Ut−), and let S⊆J be the two-sided numerical quantum Serre ideal at parameter t. If J/S≠0 and β∈Q+ has least height with (J/S)[−β]≠0, then (β,β)=2ht⁡β>0. The quantum Casimir is used only on the already established actual specialization Ut, whose pairing is nondegenerate; it is not assumed to act on the numerical Serre-only algebra.

Facts & Assumptions

Given: The free half T, its map to the actual integral-specialized half Ut−, the ideals J and S at parameter t, and a least-height residual degree −β.

[F1]

The actual specialization Ut has triangular decomposition, MUt(λ)=Ut−vλ, and on every subquotient of ⨁iMUt(−αi) a nonzero highest vector of label −β has (β,β)=2ht⁡β (The nondegenerate integral specialization has a quantum Casimir).

[F2]

The explicit Serre-free crossing calculation and opposite-Serre commutator calculation of The generic quantum halves form a Drinfeld–Jimbo crossed double use only Laurent monomials, quantum Gaussian identities and the denominators q−q−1. In its opposite-generator commutator computation, the opposite commutator of every Serre generator is zero by the identities Cr[N−r]=Cr+1[r+1] and ∑r(−1)rCrq±(N−1)r=0. These identities remain valid at q=t, since t>0, t≠1, and their sole denominator is nonzero. No field PBW dimension assertion is being specialized.

Proof

1.1givenalgebra

Let U~ be the algebra generated by all Ei,Fi,Kh with the toral, toral-action and mixed relations, and no relations within either root half. For every integral label λ, its universal highest module is freely based by Tvλ. To verify this without a presentation freeness assumption, define Fi by left concatenation, Kh on the word of degree −γ by t⟨λ−γ,h⟩, and, for w=Fi1⋯Fin, define Ejwvλ to be the sum over r with ir=j of [⟨λ−∑s>rαis,hj⟩]t times the word with its rth letter deleted. The deletion formula satisfies EiFjw=FjEiw+δij(Ki−Ki−1)w/(t−t−1); its labels verify both toral action relations. There are no further root-half relations to check. Thus these are U~-modules. Conversely the crossing relations move every positive and toral letter to the right in a highest module, so negative words span; the displayed representation makes them independent and proves the universal property. Denote this module by M~(λ).

2.1F1step 1.1algebra

The actual algebra Ut is a quotient of U~: by [F1] its undivided roots and torus generate it and satisfy all the required mixed and toral relations. The canonical module map M~(λ)→MUt(λ) is, on negative coordinates, exactly T→Ut−. Its kernel is consequently Jvλ for every λ, so this subspace is a U~-submodule. At λ=0 the augmentation subspace T+v0 is also a submodule: the deletion formula cannot produce a scalar except from a single letter, whose coefficient is [0]t=0. Each Fiv0 is highest of label −αi. Therefore the maps M~(−αi)→T+v0, v−αi↦Fiv0, are module maps, and their direct sum is an isomorphism because T+=⨁iTFi is the unique last-letter decomposition.

3.1F1step 2.1algebra

Induce that direct sum along U~→Ut. The universal property, or the mutually inverse maps u⊗(avλ)↦uavλ and avλ↦a⊗vλ, gives V:=Ut⊗U~(T+v0)≅⨁iMUt(−αi). Define ℓ:J→V by ℓ(a)=1⊗av0. Since Jv0 is a submodule by step 2.1, its image ℓ(J) is a Ut-submodule of V. For a=∑iuiFi, the direct-sum coordinates of ℓ(a) are (π(ui)v−αi)i. By [F1], this is zero if and only if each ui∈J. Consequently ker⁡ℓ=∑iJFi=JT+; the last equality follows by splitting the last letter of a nonempty right factor and using that J is a two-sided ideal. No flatness of tensor induction was assumed: its kernel is computed directly in the known Verma coordinates.

4.1F1F2step 1.1step 3.1algebra

The subspace Sv0 is a U~-submodule. Multiplication by a negative generator and toral action preserve it. For a positive generator, the specialized opposite-Serre commutator of [F2] vanishes on every Serre generator s. Expanding [Ei,asb]=[Ei,a]sb+as[Ei,b] leaves a Serre factor in each term; moving its toral factors across this homogeneous factor multiplies it only by a scalar. The deletion formula therefore sends Sv0 into itself. It follows that ℓ(S) is a Ut-submodule of V, contained in ℓ(J), and ℓ(J)/ℓ(S) is a submodule of V/ℓ(S). By [F1], the Casimir acts by 1 throughout this quotient.

5.1F1step 2.1step 3.1step 4.1givenalgebra∎

Choose a∈J[−β] with a∉S. Its image ℓ(a)+ℓ(S) is nonzero. Otherwise a−s∈ker⁡ℓ=JT+ for a homogeneous s∈S[−β]; writing a−s=∑iuiFi gives ui∈J[−β+αi] of smaller height, hence ui∈S by minimality. This would give a∈S, a contradiction. Moreover Eiav0 belongs to Jv0 in lower degree by step 2.1, and therefore belongs to Sv0. Thus the nonzero image of a in ℓ(J)/ℓ(S) is highest of label −β. Apply [F1] to the containing subquotient V/ℓ(S): (β,β)=2ht⁡β. Degree zero and every pure simple-root polynomial component survive T→Ut− by the integral rank-one half, so in particular β≠0; its positive height makes the right side strictly positive. This proves the claim.

Depends on

Used by

Dependency tree · two levels

14 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