Alphabeta Math
TheoremStatement: 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.

Quantum Frobenius and its kernel in the good odd-order regime

Statement

Assume the Axiom of Choice inherited by the integral highest-weight and freeness suppliers. Let A=(aij) be a finite-type Cartan matrix, g=g(A) its complex semisimple Serre Lie algebra, and di the standard componentwise relatively prime positive symmetrizers. Choose any semisimple isogeny lattice Qroot⊆P⊆Pfull and its dual P∨, with simple coroots hi and Ki=Kdihi. Let ζ have primitive odd order ℓ>1, with gcd⁡(ℓ,di)=1 for every i. Thus ζi=ζdi and ζi2 both have exact order ℓ; in particular 3∤ℓ in type G2. Use the actual Lusztig root specialization UζL of De Concini–Kac, Lusztig, and small quantum-group forms at roots of unity.

There is a unique surjective Hopf homomorphism Fr⁡:UζL→U(g) given by Fr⁡(Ei(n))={ein/ℓ/(n/ℓ)!,ℓ∣n,0,ℓ∤n,Fr⁡(Fi(n))={fin/ℓ/(n/ℓ)!,ℓ∣n,0,ℓ∤n,Fr⁡(Kh)=1. Its algebra kernel is exactly the two-sided Hopf ideal J=⟨Ei,Fi,Kh−1:i∈I, h∈P∨⟩. For c=ℓc1+c0, t=ℓt1+t0, with 0≤c0,t0<ℓ, its toral values are Fr⁡(Ti,c,t)=(hi+c1t1)[c0t0]ζi. This is an algebra-kernel assertion, distinct from any statement identifying Hopf coinvariants or the dimension of a small quantum group. The theorem permits reducible finite type and every stated isogeny lattice, and asserts no extension to bad or even root order or to a different Frobenius target root datum.

Facts & Assumptions

Given: The finite Cartan datum, lattice, root order and actual specialization above.

[F1]

Quantum Lucas and divided-power generation are proved in Quantum Lucas and generation of specialized divided powers. The quotient of the torus by all Kh−1 is C[Hi:i∈I], with Hi=Ti,0,ℓ and the exact shifted-binomial formulas; the toral formulas are proved in The root-specialized toral quotient by group-like generators. The actual integral form is Hopf-stable, including every toral binomial, in the library convention by The full divided-power integral form is a Hopf form.

[F2]

For i≠j, a=−aij, and m>an, the actual integral halves satisfy ∑r+s=m(−1)rqir(an−m+1)Ei(r)Ej(n)Ei(s)=0, and the analogous negative identity (Higher divided quantum Serre relations from a skew derivation). Complete mixed reordering, toral shifts, and triangular spanning are supplied by Divided-power multiplication, toral binomials and the Ei(a)Fi(b) reordering identity.

[F3]

For every dominant label λ, the actual UA-stable highest lattice VA(λ)=UAvλ=UA−vλ has a global basis, finite free weight pieces and a rank-one top piece; its generic character is the classical finite Weyl character in finite type. Its integral presentation is the based quotient by all divided right powers beyond the highest limits (Finitely generated free integral weight lattices and deformation of the classical weight character, The based quotient: projection of the lower global basis to a highest weight module). The finite classical support consequently makes the whole lattice finite free in finite type.

[F4]

The Serre Lie algebra of A is finite-dimensional semisimple with the stated simple generators (Serre Lie algebra of a finite-type Cartan matrix, Serre presentation theorem). PBW and classification of its finite-dimensional simples by dominant integral highest weights are proved in Finite semisimple PBW and highest-weight construction. Its finite-dimensional representations are completely reducible (Weyl's complete reducibility theorem).

[C1]

The Axiom of Choice is inherited through the actual integral global-basis/freeness suppliers in [F1] and [F3], as declared in The Axiom of Choice. The new finite-word, polynomial and finite-dimensional quotient arguments add no further choice requirement.

Proof

Given: The data above. Put B=UζL/J and denote images of Ei(ℓ),Fi(ℓ),Ti,0,ℓ by eˉi,fˉi,Hˉi.

1.1F1F2givenalgebra

By [F1], every divided power in B vanishes unless its index is divisible by ℓ, and the remaining ones are ordinary divided powers of eˉi,fˉi. Every toral generator is a polynomial in the Hˉi, with its exact formula given in [F1]; further relations in B are not yet excluded. Thus eˉi,fˉi,Hˉi generate B. In the complete mixed formula at exponents ℓ,ℓ, all intermediate contraction indices 0<t<ℓ have remaining divided factors of nonzero residue and vanish in B. Its two surviving terms give [eˉi,fˉi]=Hˉi; opposite colors commute. Iterating the toral shift through an ℓth divided power and using Ti,−ℓaij,ℓ=Hi−aij gives [Hˉi,eˉj]=aijeˉj and [Hˉi,fˉj]=−aijfˉj. The Hˉi commute.

2.1F1F2F4step 1.1constructalgebra

For i≠j, put a=−aij. Apply [F2] with n=ℓ, m=(a+1)ℓ. In B only r,s divisible by ℓ survive. For such r, ζir(aℓ−(a+1)ℓ+1)=1 and (−1)r=(−1)r/ℓ because ℓ is odd. By [F1] the resulting relation is ∑b+c=a+1(−1)beˉibeˉjeˉic/(b!c!)=0, precisely the ordinary Serre relation after multiplying by (a+1)!. The negative relation is identical with fˉ in place of eˉ. Thus [F4]'s Serre presentation and step 1.1 give a surjective homomorphism ψ:U(g)→B. No presentation theorem for the divided-power specialization has been assumed.

3.1F1F3C1step 2.1algebra

Fix any dominant μ∈P and specialize the actual lattice VA(ℓμ) of [F3] at q=ζ. Finite freeness gives a finite-dimensional module with a nonzero rank-one top weight and its actual integral weight decomposition; the highest vector still generates it, since VA=UA−v. The toral character of a weight ν has Ki value ζiν(hi) and Hi value ⌊ν(hi)/ℓ⌋, by [F1] including negative upper indices. These values determine each integer ν(hi): the first gives its residue and the second its quotient. Since simple coroot coordinates distinguish weights in a semisimple lattice, the full toral characters of distinct weights are distinct. Finite polynomial interpolation in commuting toral operators therefore projects onto each actual weight space and preserves every submodule. A simple quotient M of this finite-dimensional cyclic module exists by choosing a proper submodule of maximal dimension. It retains a nonzero top vector v of weight ℓμ, since a submodule containing v would be the entire module; it also retains the weight decomposition and toral characters.

4.1F1F2step 3.1algebra

Every positive divided power kills v. For every i, also Fiv=0. Indeed for j≠i the positive jth divided powers commute past Fi and kill it on v. For color i, the complete mixed reordering gives Ei(r)Fiv=0 for r>1, since the possible contraction has right factor Ei(r−1)v=0; at r=1 its coefficient is [ℓμ(hi)]ζi=0. Hence, if Fiv were nonzero, it would be a highest-weight vector of weight ℓμ−αi. Triangular spanning then puts its entire generated submodule in weights at most this weight, so it misses the original top weight and is proper. Simplicity of M excludes this. Thus all small generators Ei,Fi kill v.

5.1F1F2step 4.1algebra

Let N⊆M be the common kernel of all Ei,Fi. It contains v. It is a sum of actual weight spaces: each small operator shifts the actual weight by its simple root, and distinct input weights give distinct output weights. Since the torus acts diagonally on those spaces, N is toral-stable. It is also stable under every Ei(ℓ),Fi(ℓ). For same-sign distinct colors, the good-order assumptions give ℓ>−aij: finite-type off-diagonal entries have absolute values at most 3, odd order is at least 3, and the only possible equality 3 in G2 is excluded by 3∤ℓ. Apply [F2] with n=1,m=ℓ to a vector of N. Its r=0 term is EjEi(ℓ) applied to that vector; the r=ℓ term has rightmost Ej, and every intermediate term has rightmost Ei(s) with 0<s<ℓ. These all vanish by [F1], leaving the desired zero; the negative proof is identical. Same-color same-sign operators commute. Opposite distinct colors commute. For opposite signs in the same color, mixed reordering gives an error factor of degree ℓ−1, which vanishes on N after its toral factor acts diagonally; hence these small operators also annihilate the image of N under the big divided generator. Finally [F1] generates all divided powers from the small and big generators. Thus N is a full submodule, and simplicity yields N=M.

6.1F1F4step 2.1step 5.1algebra

The cyclic module M is now generated from v by big divided generators and the torus alone, so all its weights differ from ℓμ by multiples of ℓ times roots. Every Kh therefore acts as 1, and step 5.1 shows that J kills M. Along ψ, it is a finite-dimensional simple classical module, since ψ is onto, with highest vector v and Hˉiv=μ(hi)v by [F1]. Classification in [F4] identifies it with L(μ). Consequently every classical dominant simple with highest weight in P occurs as a ψ-pullback. This does not assert simplicity of the specialized Weyl module before taking its quotient.

7.1F4step 6.1algebra

These classical modules separate U(g). For completeness, set V=g and let ρ:g→End⁡(V) be its faithful adjoint representation; semisimplicity makes its kernel the zero center. On the polynomial algebra of the matrix space End⁡(V), define the linear vector field Dx by Dx(M)=Mρ(x). On coordinate functions its bracket is [Dx,Dy](M)=M[ρ(x),ρ(y)], so this is a Lie representation and extends to U(g). If u≠0 has PBW degree m, its top symbol is nonzero in Sym⁡mg by [F4]. At the identity matrix the principal symbol of Du is its image under Sym⁡mρ, which is injective because ρ is injective and a finite basis of its image extends to a basis of the matrix space. Choose a homogeneous degree-m polynomial in the shifted matrix coordinates, paired nontrivially with this symbol. Its lower derivatives vanish at the identity, so Dup has nonzero value there. Thus u acts nontrivially on this polynomial representation.

8.1F4step 6.1step 7.1algebra

Polynomials of bounded total degree form finite-dimensional stable subspaces for these linear vector fields. By [F4] each decomposes into classical simples. All its weights lie in the root lattice: the adjoint weights, their duals and their tensor or symmetric powers have this property. Hence every highest weight of these constituents belongs to Qroot⊆P. If an element killed every simple supplied by step 6.1, it would kill every finite polynomial subspace and hence the entire polynomial representation, contradicting step 7.1. The intersection of their annihilators is therefore zero. Since ker⁡ψ annihilates all of them, ψ is injective and hence an isomorphism. If g=0, U(g)=C acts faithfully on the constant polynomial module, giving the same conclusion directly.

9.1F1step 8.1constructalgebra

Compose the quotient map UζL→B with ψ−1. This constructs a surjective algebra map with exact kernel J. Its divided-power values follow from [F1], and its toral values follow from the toral quotient formula there. These formulas cover every generator of the actual integral form, so the map is unique. In particular this construction proves well-definedness on all relations of the actual specialized subalgebra, rather than checking only a possibly incomplete proposed list of divided-power relations.

10.1F1C1step 9.1algebra∎

The actual root Hopf structure in [F1] makes J a Hopf ideal. On its generators, Δ(Ei) and Δ(Fi) lie in J⊗U+U⊗J; Δ(Kh−1)=(Kh−1)⊗Kh+1⊗(Kh−1); and counit and antipode preserve their ideal. In B, the interior terms of the divided-power coproduct of Ei(ℓ),Fi(ℓ) vanish by [F1], and Kh=1, so eˉi,fˉi are primitive. Their commutators Hˉi are primitive as well. Therefore ψ preserves the usual classical Hopf maps on all its generating Lie elements and is a Hopf isomorphism. Its inverse composed with the quotient is the claimed Hopf Frobenius map. The inherited Choice assumptions are exactly [C1]; no rank-one restriction, integral-presentation shortcut, or unidentified small-quantum-group kernel was used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

73 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