Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Divided powers and the Lusztig form in quantized sl2

Example

Work in the rank-one subalgebra Ai generated by E=Ei, F=Fi, K±1=Ki±1 inside Uq(g) (Divided-power commutation and the simple Uqi(sl2) string modules), with q:=qi and [m]:=[m]i (Quantum integers, factorials, Gaussian binomials and divided powers at qi), and let x(a):=xa/[a]! denote divided powers.

(a) Divided powers multiply. E(2)E(1)=[3]E(3) and F(2)F(2)=(42)iF(4)=[4]!/([2]!)2 F(4), since x(a)x(b)=(a+ba)ix(a+b); numerically (42)i=q−4+q−2+2+q2+q4, a nonzero element of A=Z[q,q−1] because q is transcendental.

(b) The commutator is the first toral binomial. E(1)F(1)−F(1)E(1)=[E,F]=K−K−1q−q−1=Ti,0,1, and for b≥1 the published reordering gives EF(b)=F(b)E+F(b−1)1qb−q−b∑s=0b−1(q−2sK−q2sK−1); for b=2 the toral factor is K−K−1+q−2K−q2K−1q2−q−2, a combination of the integral toral binomials Ti,c,t.

(c) Reordering at a=b=2. E(2)F(2)=F(2)E(2)+F(1)Ti,−2,1E(1)+Ti,0,2, where Ti,−2,1=Kq−2−K−1q2q−q−1 and Ti,0,2=(K−K−1)(Kq−1−K−1q)(q−q−1)(q2−q−2); all three toral binomials are elements of the integral form UA (The Lusztig divided-power integral form UA), and on a weight vector of weight μ their q=1 values are μ(hi), μ(hi)−2 and (μ(hi)2) (The q=1 toral specialization identifies the classical Cartan generators).

Facts & Assumptions

Given: The rank-one algebra Ai with its presentation, the divided powers and the toral binomials.

[F1]

[a]!≠0 in Q(q) and x(a)x(b)=(a+ba)ix(a+b) for all a,b≥0 (Quantum integers, factorials, Gaussian binomials and divided powers at qi, Divided-power commutation and the simple Uqi(sl2) string modules (ii)).

[F2]

EF−FE=(K−K−1)/(q−q−1) and, for b≥1, EF(b)=F(b)E+F(b−1)qb−q−b∑s=0b−1(q−2sK−q2sK−1) (Divided-power commutation and the simple Uqi(sl2) string modules (ii)).

[F3]

The general divided-power reordering identity E(a)F(b)=∑t=0min⁡(a,b)F(b−t)Ti,2t−a−b,tE(a−t) with Ti,c,t=∏s=1tKqc−s+1−K−1q−c+s−1qs−q−s (Divided-power multiplication, toral binomials and the Ei(a)Fi(b) reordering identity (iii), The Lusztig divided-power integral form UA).

[F4]

The toral binomials lie in UA, commute with one another and with the Kh, and on a weight vector of weight μ act by the Gaussian value (μ(hi)+ct)i, whose value at q=1 is (μ(hi)+ct) (The Lusztig divided-power integral form UA, The q=1 toral specialization identifies the classical Cartan generators (b)).

[F5]

(42)i=[4][3]/[2]=q−4+q−2+2+q2+q4, a nonzero Laurent polynomial, and q is transcendental, so this element of A is not zero (Quantum integers, factorials, Gaussian binomials and divided powers at qi).

Verification

technique · expand the divided powers by definition, apply the published rank-one commutation and reordering formulas at a=b=2, and evaluate the toral binomials on weights
1.1F1algebra

Divided powers multiply. By definition E(2)E(1)=E2[2]!⋅E=E3[2]!=[3]![2]!E(3)=[3]E(3) and F(2)F(2)=F4([2]!)2=[4]!([2]!)2F(4)=(42)iF(4), using [a]!≠0 and x(a)=xa/[a]! from [F1]; the general identity x(a)x(b)=(a+ba)ix(a+b) is the same computation.

1.2F2F3algebra

The commutator and the first binomial. By [F2] and [F3], EF−FE=K−K−1q−q−1, which is exactly Ti,0,1 by the definition of the toral binomial; more generally the displayed formula for EF(b) is [F2], and at b=2 the toral factor is (K−K−1)+(q−2K−q2K−1)q2−q−2, which equals Ti,−1,1=(Kq−1−K−1q)/(q−q−1): use 1+q−2=q−1[2] and 1+q2=q[2] with q2−q−2=[2](q−q−1). It is an integral toral binomial.

1.3F3algebra

Reordering at a=b=2. Setting a=b=2 in the general identity of [F3] gives E(2)F(2)=∑t=02F(2−t)Ti,2t−4,tE(2−t)=F(2)E(2)+F(1)Ti,−2,1E(1)+Ti,0,2 with Ti,−2,1=Kq−2−K−1q2q−q−1 and Ti,0,2=(K−K−1)(Kq−1−K−1q)(q−q−1)(q2−q−2) by the product definition. The nontrivial toral factors Ti,−2,1 and Ti,0,2 are generators of the integral form, hence lie in UA.

2.1F3F4F5step 1.1step 1.3algebra∎

Values on weights and integrality. On a weight vector of weight μ, Ti,0,1 acts by [μ(hi)]i, Ti,−2,1 by [μ(hi)−2]i and Ti,0,2 by (μ(hi)2)i by [F4]; at q=1 these are the integers μ(hi), μ(hi)−2 and (μ(hi)2). The numerical value (42)i=q−4+q−2+2+q2+q4 is nonzero in A by [F5], so the product formula of step 1.1 exhibits a nonzero integral coefficient, and no division by a vanishing denominator occurs: every expression used is an element of UA or a polynomial identity valid in Q(q). No choice is used; the computation is a finite expansion in Ai, with the a=b=2 identity justified by the locally proved reordering supplier.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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