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.
The type-A quantum presentation descends to its coproduct tensor action
Statement
For the presented algebra and candidate assignments in The type-A quantum algebra and its tensor-action formulas, the matrices on satisfy every defining relation. The coproduct assignments descend to a coassociative algebra homomorphism and the counit assignments descend to an algebra homomorphism satisfying both counit identities. Consequently every tensor power has the action obtained by iterating ; all its generator matrices have entries in .
Facts & Assumptions
Given: , , the algebra presentation and candidate maps in The type-A quantum algebra and its tensor-action formulas.
A free associative algebra modulo the two-sided ideal of its displayed relations is a presented algebra, and assignments descend exactly when they annihilate every defining relation (The free associative R-algebra on a set and descent of relations).
The tensor product of algebras has multiplication , and maps agreeing on the displayed generators agree on the presented algebra (The tensor product of -algebras has multiplication , Presentation base change and transport of explicit bases to commutative specializations).
For , the defining -weight relations imply and ; in particular , , and for adjacent indices.
The associator is natural and satisfies the pentagon and unit triangle (Associator naturality, pentagon, unit triangle and symmetry hexagons on elementary tensors). The unit maps are and (The regular module is a tensor unit: and ). These maps are algebra isomorphisms for the tensor-algebra products, as is checked on elementary tensors using [F2].
Proof
Given: The data in [F1]–[F3].
On , each is diagonal and invertible, and the commute. Conjugating the matrix unit by multiplies its sole nonzero entry by ; conjugating gives the inverse exponent. Also has eigenvalue on , on and on every other basis vector, so is the diagonal matrix with entries in those positions. Directly, for and is that diagonal matrix. Products and (and the corresponding products) both vanish when ; , and each middle three-letter Serre product also vanishes because its matrix-unit indices do not compose. Thus every defining relation holds, and the quotient universal property [F1] gives the vector representation.
Define on the free generators by the displayed formulas in The type-A quantum algebra and its tensor-action formulas. The are mutually commuting units with the displayed inverses. Conjugation by gives the required weights on each of the two terms of and , since each is a Laurent monomial in the commuting 's. For any , expansion gives . The last cross term is zero: its first product can be reordered as , which is its reverse product by [F3]. If , the remaining terms vanish; if , they sum to . For , and the commute with ; expanding the two commutators therefore proves that the distant and relations are preserved.
Let and for adjacent . For the relation write with , . In each of the three words , choose an at each selected position and a at each other position, then move the selected factors to the right using . Grouping the resulting 24 terms by the number of selected positions gives: degree in the first factor is ; degree is ; degree has respective coefficients , , on , , ; degree has respective coefficients , , on , , . All six mixed coefficients are zero by the definition of , and the two pure terms vanish by the defining Serre relation. Thus preserves every positive Serre relation.
The assignment , , preserves the presentation: it exchanges the two weight relations, sends the mixed commutator to its negative with replaced by , and exchanges the distant and Serre relations. It is an involution. On generators , where is an algebra isomorphism. Since step 1.3 proves that the positive Serre polynomial maps to zero, applying the algebra maps and proves that the negative Serre polynomial maps to zero as well. Together steps 1.2–2.1 show every relation is killed, so [F1] descends to the quotient. The counit assignment kills the relations directly: each relation becomes either or , so it too descends.
Compare and as maps to , and compare and with . All these composites are algebra homomorphisms by [F2] and [F4], so it suffices to check generators. The two counit composites return . After applying the associator, both iterated coproducts on give ; on , both give ; on , both give . Hence is coassociative with counit . The vector representation of step 1.1 and the iterated coproduct therefore define actions on every . They are finite sums and products of matrices with entries , so all entries lie in .
Depends on
- The type-A quantum algebra and its tensor-action formulas
- The free associative R-algebra on a set and descent of relations
- Presentation base change and transport of explicit bases to commutative specializations
- Scalars, tensor powers, the empty tensor, opposite algebras and finite sums
- The tensor product of $R$-algebras has multiplication $(a\otimes b)(a'\otimes b')=aa'\otimes bb'$
- Associator naturality, pentagon, unit triangle and symmetry hexagons on elementary tensors
- The regular module is a tensor unit: $R\otimes_RN\cong N$ and $M\otimes_RR\cong M$
Used by
- Classical commutants bound the two generic tensor images Lemma
- Integral divided-power tensor actions generate the type-A q-Schur algebra Lemma
- The quantum and Hecke tensor actions commute Lemma
Cited to discharge well-definedness by The type-A quantum algebra and its tensor-action formulas.
Dependency tree · two levels
43 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
- Pavel Etingof and Mykola Semenyakin, A brief introduction to quantum groups (standard reference, not scraped)