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.

Integral quantum highest modules are the normalized q-Schur Weyl cells

Statement

Assume the Axiom of Choice, inherited only through the integral highest-lattice supplier. Put A=Z[v,v−1], q=v2, N≥1, and r≥0. Use the integral UA(glN), its surjection ρ:UA→SA(N,r), and τ(Ei(a))=Fi(a), τ(Kj)=Kj of Integral divided-power tensor actions generate the type-A q-Schur algebra. For a partition λ of r with at most N parts, padded by zeros, set mi=λi−λi+1 and QA(λ)=UA−/∑i=1N−1∑a>miUA−Fi(a). Equip this quotient with its integral highest-module action and highest vector z=1+∑UA−Fi(a), with Kjz=vλjz and the integral toral binomials acting by the corresponding integer-weight characters. Let WAλ be the actual fixed-first-index right Weyl cell of The type-A q-Schur algebra and its Weyl modules, with semistandard basis wT, cellular form Bcell and h=wTλ. Give its underlying module the left action u⋅w=wρ(τ(u)). Then the unique highest-vector map f:QA(λ)→WAλ, z↦h, is an isomorphism. In particular bT=f−1(wT) is a complete integral semistandard basis, of weight type⁡(T), and the displayed divided-right-power relations are the entire negative-half presentation. This does not identify bT with a particular ordered root monomial.

Set cμ=v−∑j(μj2). There is a unique homogeneous normalized τ-contravariant form B on QA(λ), explicitly B(xz,yz)=[z](τ(x)yz). Here [z] means projection onto the free highest-weight line followed by its coefficient in z. It is integral and symmetric, and for homogeneous a,b of weight μ satisfies B(a,b)=cλcμBcell(f(a),f(b)). Different weights are orthogonal. Every ratio in this formula is a Laurent unit. The module, basis, quotient presentation, highest-coefficient formula and form comparison commute with arbitrary commutative A-algebra base change, including fields at roots of unity and singular Gram matrices. Form radicals agree under f in every such fibre; no assertion that radicals commute with arbitrary base change is made.

Over every commutative A-algebra R, every cyclic left UR-module with nonnegative composition-label support of total degree r and the full integer toral characters, generated by a vector of weight λ killed by every positive divided generator, is a quotient of QR(λ). Equivalently, the left Weyl cell is the polynomial highest-induced module SR⊗SR+Rλ, where SR+ is the image of the integral toral-positive subalgebra and Rλ is its highest character. This includes every polynomial Schur module and the zero module. The full toral-character label convention is the one specified in Polynomial quantum highest vectors satisfy every divided-power highest relation; no factorization through the Schur quotient is assumed for this stronger cyclic-highest assertion.

Facts & Assumptions

Given: The ring, degree, partition, integral hyperalgebra and actual normalized cells in the Statement.

[F1]

The surjection and weight projections hold integrally and after arbitrary base change, and, with C=∑μcμ1μ, the involutions obey ρ(τ(u))=C−1ρ(u)∗C (Integral divided-power tensor actions generate the type-A q-Schur algebra).

[F2]

The right cell has the semistandard weight basis, star-contravariant symmetric form and Bcell(h,h)=1. The canonical partition projection is 1λ=φTλTλ; the cell product has coefficient Bcell (The type-A q-Schur algebra and its Weyl modules).

[F3]

The displayed negative-half quotient is the free integral highest lattice, with finite free weight pieces and the finite Weyl character, with inherited Choice (Finitely generated free integral weight lattices and deformation of the classical weight character). For type AN−1 extend its labels to composition labels of fixed total r by Kj acting as vμj on weight μ; the integer-weight toral characters and root shifts give the stated glN action. At N=1 this is the free rank-one module directly.

[F4]

The finite type-A Weyl character is the bialternant Schur character, whose coefficient at xμ is Kλμ (Semistandard tableaux expand Schur characters). The Bender–Knuth bijections permute composition contents (Bender--Knuth involutions permute the weights of semistandard tableaux).

[F5]

Integral triangular spanning is UA=UA−UA0UA+; the same spanning holds after every base change (Divided-power multiplication, toral binomials and the Ei(a)Fi(b) reordering identity). Positive and negative divided generators shift composition labels by their root degrees.

[F6]

Every highest vector with nonnegative composition-label support satisfies all Fi(a)x=0 for a>mi, over every coefficient ring; integral reordering makes its negative-quotient map a full UR-module map (Polynomial quantum highest vectors satisfy every divided-power highest relation).

[C1]

The Axiom of Choice is used only as inherited by [F3] and [F4]. The finite cellular constructions and ring arguments below make no additional choice assumption.

Proof

1.1F2F4algebra

Tableau support. In any semistandard tableau, each column has at most k entries in {1,…,k}; summing over columns gives ∑j≤kμj≤∑j≤kλj. By [F4] the same inequality holds after permuting the content. Thus no weight λ+aαi, a>0, occurs. No weight λ−aαi occurs when a>mi: swapping its ith and (i+1)st coordinates makes its first i coordinates sum to ∑j≤iλj+a−mi, violating that inequality. Negative coordinates also cannot occur. The type-λ tableau is uniquely Tλ: the first content inequality is an equality forcing all 1's into row one, and successively equality for k forces all k's into row k. Hence the top weight line is Ah.

2.1F1F2F3step 1.1constructalgebra

The highest map. The action in the Statement is a left action since τ reverses products. It has the stated weight labels by [F1]. Step 1.1 kills every Ei(a)h for a>0 and every Fi(a)h for a>mi; the toral characters are those of weight λ. Thus [F3] gives a highest-module map f:QA(λ)→WAλ. By the cell product and Bcell(h,h)=1, hφTλT=wT. Surjectivity in [F1] supplies an integral preimage under ρτ of each of these endomorphisms, so h generates the whole cell and f is onto.

2.2F1F2step 1.1algebraconstruct

Cellular highest induction over any R. Put I>λ equal to the span of cellular shapes strictly dominating λ. This ideal is generated by the 1η for η>λ: choose a finite order with larger shapes first, and use φS,Tη1ηφTη,T≡φST modulo higher shapes, whose coefficient is 1 by [F2]. Induction absorbs those higher terms in the already generated ideal; conversely each 1η lies in I>λ. The quotient SR1λ/I>λ1λ has exactly the basis φT,Tλ of shape λ: any semistandard type λ in shape η forces η⊵λ by the column count in step 1.1, and shape λ has the single second tableau Tλ. Star identifies this left cell with the right cell acted on by s∗; the weight-unit map sending its weight-μ basis vector to (cμ/cλ)wT instead identifies it with the action s⋅w=wC−1s∗C of the Statement. Its highest vector maps to h.

3.1F1F3F4F5step 2.1algebraconstruct

Integral isomorphism. In type AN−1 the finite Weyl alternating quotient of [F3], on composition labels of fixed total r, is det⁡(xiλj+N−j)/det⁡(xiN−j): the Weyl group permutes the N coordinates, and multiplying numerator and denominator by the common monomial removes the half-sum shifts. This is the bialternant of [F4]. Consequently, for each weight μ, [F3] and [F4] make the source and target finite free of the same rank Kλμ. The map in step 2.1 is graded, hence onto on each weight. Choose finite free bases and write its square matrix D; lifting the finitely many target basis vectors gives a matrix P with DP=I. Therefore det⁡(D)det⁡(P)=1, and the adjugate formula gives an inverse matrix over A. Zero-rank weights have the unique empty inverse. Only finitely many weights occur, so these inverses assemble to f−1. This proves the entire quotient presentation and the basis bT. Concretely a preimage under the surjection of φTλT, followed by integral triangular spanning and highest-character evaluation, gives a representative of bT in UA−; different preimages give the same quotient class. No generic-rank argument replaces the proved integral surjection.

4.1F1F5F6step 2.2step 3.1constructalgebra

Let X=URx be the cyclic highest module with the composition support and full toral characters in the Statement. By [F6], every divided highest relation holds, and the highest-vector map QR(λ)→X is a surjective UR-module map. The integral isomorphism of step 3.1 and its inverse remain inverses after arbitrary base change. Thus this is a quotient of the actual normalized Weyl cell. In particular X factors through SR: [F1] makes ker⁡ρ stable under τ, so it annihilates that cell and every quotient. No factorization of X was assumed. Via the unit identification of step 2.2, the corresponding left-cell quotient map preserves the highest generator. Apply this argument also to Y=SR⊗SR+Rλ: its canonical generator has the stated toral character, is killed by all positive divided powers, and is fixed by 1λ. The last assertion follows because the integral toral projection ∏j[Kj;0λj] is 1λ and has highest-character value 1. Thus Y is a quotient of the left cell. Conversely the highest vector of that cell defines a surjection Y onto it. Both compositions fix the cyclic highest generators, hence are identities, proving the induction equivalence. This is a direct cellular proof of the universal property.

4.2F1F2step 3.1algebraconstruct

Construct the form on the actual cell first. Give weight μ the scalar dμ=cλ/cμ times Bcell and pair distinct weights by zero. Weight spaces are orthogonal for Bcell because its self-adjoint projections 1μ are orthogonal; thus the new form is symmetric and integral and has value 1 on h. For s=ρ(u), [F1] gives ρ(τ(u))∗=CsC−1. On a homogeneous component, right multiplication by this conjugate contributes cν/cμ when s takes right weight ν to right weight μ. Hence dν(cν/cμ)=dμ, and cellular contravariance gives B(u⋅a,b)=B(a,τ(u)⋅b). Linearity handles sums of homogeneous components. Pull this form back by the integral isomorphism f.

5.1F3step 1.1step 3.1step 4.2algebra

Highest coefficient and uniqueness. For x,y∈UA−, contravariance gives B(xz,yz)=B(z,τ(x)yz). Orthogonality and the top line Az make the last expression exactly [z](τ(x)yz). This proves the displayed coefficient construction descends through the complete quotient, including both arguments, because the already constructed form is defined on that quotient. Conversely the same equality is forced for any homogeneous normalized contravariant form, and negative words span by [F3], proving uniqueness. The construction has used only Laurent units and the integral action; it has not restricted a tensor form or divided by a tensor highest norm.

6.1C1step 3.1step 4.2step 5.1step 2.2step 4.1algebra∎

Base change and singular forms. Tensor the proved isomorphism and its inverse with any R; the quotient is its specialized presentation by right exactness of tensor product, the basis remains the specialized bT, and the integral form matrices and highest projection specialize entrywise. The weight factors dμ remain units. Thus a vector pairs to zero for the specialized form exactly when its image pairs to zero for the specialized cellular form, even if the Gram determinant is zero. Steps 2.2 and 4.1 used the same free cellular basis and unit coefficients over R, so their universal property also holds without flatness. At r=0 the unique empty highest cell and quotient are R with form 1; at N=1 the only degree-r cell and quotient are likewise rank one. These prove all claims with only the inherited Choice of [C1].

Depends on

Used by

Dependency tree · two levels

54 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