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.
Simply-laced braid symmetries preserve the full divided-power form
Statement
Assume the inherited Axiom of Choice. For a finite simply-laced root datum with full weight lattice and , the generic algebra has automorphisms with They fix for , while for , They satisfy for nonneighbors and for neighbors. They and their inverses preserve the entire divided-power form , including its toral binomials, and the ordinary-generator form over . They consequently specialize to inverse automorphisms whenever the indicated denominators are invertible. For neighbors, No root-of-unity PBW or small-quantum-group theorem is assumed in this assertion.
Facts & Assumptions
Given: The finite ADE datum and its generic and integral algebras.
The generic algebra has the toral, mixed and Serre presentation of The Drinfeld-Jimbo quantized enveloping algebra by generators and relations. Rank-one divided reordering and Gaussian identities hold (Divided-power multiplication, toral binomials and the reordering identity, The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality, Divided-power commutation and the simple string modules).
Finite generic integrable modules are semisimple highest-weight modules, and their one-color strings have the displayed divided-power formulas (Integrable bounded-above quantum modules with finite-dimensional weight spaces are direct sums of simple highest weight modules, Divided-power commutation and the simple string modules). This includes restrictions to one- and two-color finite-type subalgebras.
Generic triangular decomposition holds; actual finite highest lattices have finite classical characters and exact half kernels generated by the divided powers beyond their highest limits (Triangular decomposition of a quantized enveloping algebra, The based quotient: projection of the lower global basis to a highest weight module, Finitely generated free integral weight lattices and deformation of the classical weight character).
The full form has generators (The Lusztig divided-power integral form ). The Axiom of Choice is inherited from [F2]–[F3], as declared in The Axiom of Choice.
Proof
Given: These data. The anti-semilinear involution sends to , exchanges , sends to , and reverses products. Each defining relation in [F1] is preserved, so this is an actual involution. For neighbors put , , , and .
The Serre relation gives and . Mixed reordering gives and . For the first, expand and move the torus to the right; its coefficient is . The second similarly has coefficient . Put and . These identities give , and . Thus , and the other Serre relation follows by using . These are exactly the positive relations involving color after the proposed assignment. Applying gives the negative relations with their stated orders and coefficients.
Here are all other positive Serre checks. On a homogeneous element use , with . For a neighbor, and ; for a nonneighbor . If commuting colors both neighbor , apply to their commutator, obtaining ; if just one neighbors , apply once. If are neighbors, the ADE diagram has no triangle, so at most one neighbors . Apply to the Serre relation with that color repeated and to the other Serre relation. For example the three terms with repeated become respectively , and . Their Serre combination vanishes. These cases exhaust the pairs away from ; applying gives all negative pairs.
For the mixed checks put . For distinct neighbors , expansion using their commuting opposite colors gives . Move the torus left. Since has -weight zero, the coefficient is . For , step 1.1 instead gives , exactly the required mixed relation after multiplying by . Pairs involving commute because and ; the exchanged calculation handles the other half. The repeated mixed relation becomes . Pairs with fewer neighboring colors commute immediately. Toral relations follow from the reflected weights. Thus the assignment preserves the full presentation.
We record an exact normal-order calculation. Write , , and , including in the generic algebra. Then Indeed and . Writing , multiplication by gives , where nonexistent terms are zero. Substitution reduces this to . This proves the formula by induction including both endpoints. In particular : both expand as the sum over on with coefficient .
Its inverse assignment is , , , and for a neighbor , . The same checks with orders reversed prove it is a homomorphism. On a neighboring positive generator one composition is from step 1.1. For the other put , ; mixed reordering gives , hence and . The negative checks apply , and the and toral compositions cancel directly. Both compositions are the identity on all generators.
On a finite generic rank-one string of highest label define . It is invertible and conjugates its one-color action by . For a neighbor, commutes , and . By [F2], splits into a highest vector of label and , with highest of label . On the component, with , the coefficient of is . Multiplication by gives , exactly the ratio between the two string coefficients. On the component it is ; multiplication by and the original string coefficient gives , again the coefficient of . Therefore .
From step 2.3 and quantum Pascal induction one gets . Multiplying by and exchanging gives the stated divided formula for ; applying gives the negative formula. On color ordinary multiplication gives and . Inverses have the same integral formulas with order reversed. Thus they preserve the subalgebra generated by divided powers and .
For the negative generator start at a lowest vector of label . Then , where . Now splits into a lowest of label and , with lowest of label . The coefficient of on the first is , and . On the second it is , and . Thus . Nonneighbors commute with the full rank-one action and hence with its explicit . We have proved on every generator.
In the identity also gives and its exchanged version. Applying gives the negative identities. Thus the two three-term products of the maps agree on the rank-two algebra; both send to and to . On its highest module of label the corresponding products send the highest vector to and , equal by step 2.3. Each intermediate vector is highest for the next color: for example , since the latter intermediate highest label for color is . Their conjugations agree, so the products agree on the entire cyclic module. By [F2] this holds on every finite module after rank-two restriction. For nonneighbors, restrictions are direct sums of tensor products of two independent strings, on which the two operators commute.
Finite generic integrable modules separate the algebra. For a nonzero element in triangular form choose an integral toral label at which one nonzero Laurent coefficient stays nonzero; a Laurent polynomial cannot vanish on every grid . On a lowest-highest tensor of labels , , an ordered positive-negative half product has the corresponding pure tensor as leading term, with a Laurent unit coefficient and corrections of smaller total half degree, by the triangular coproduct. Choose large enough that the exact highest/lowest half kernels in [F3], generated by divided singular powers beyond their limits, have degrees greater than every half degree in this finite expression. The leading term survives, giving a finite module on which the element acts nontrivially. Therefore the operator braid relations from step 6.1, together with the conjugations in steps 4.1 and 5.1 and invertibility of , imply the algebra braid relations on every generator, including colors outside the rank-two pair.
This is the full form. The toral product gives the adjacent-shift identity for . Indeed, factor the common numerator factors with shifts and compare the remaining two terms; their difference is , which cancels the last denominator. Induct on , starting with for every . In the equal-exponent reordering , all terms except belong to by the induction hypothesis, so . The shift identity gives every positive shift successively. Solving it as gives every negative shift successively; all coefficients lie in . Hence every toral binomial belongs to . Preservation of really is preservation of , so specialization induces inverse automorphisms of the actual algebra. Their generator formulas also preserve the ordinary form and its inverse map over the stated localization. This proves every assertion, with exactly the inherited Choice in [F4].
Depends on
- The Drinfeld-Jimbo quantized enveloping algebra by generators and relations
- The Lusztig divided-power integral form $U_A$
- Divided-power multiplication, toral binomials and the $E_i^{(a)}F_i^{(b)}$ reordering identity
- The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality
- Divided-power commutation and the simple $U_{q_i}(\mathfrak{sl}_2)$ string modules
- Integrable bounded-above quantum modules with finite-dimensional weight spaces are direct sums of simple highest weight modules
- Triangular decomposition of a quantized enveloping algebra
- The based quotient: projection of the lower global basis to a highest weight module
- Finitely generated free integral weight lattices and deformation of the classical weight character
- The Axiom of Choice
Used by
Dependency tree · two levels
48 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
- George Lusztig, Introduction to Quantum Groups (standard reference, not scraped)