Free associative algebra 2026-10-06
The free associative algebra has a basis of finite words in its generators, including the empty word as identity. Multiplication concatenates words without commutativity relations. It is the path algebra of the quiver with r loops. With one generator it is a polynomial algebra.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 3 2 b i Solution Created 2026-10-03 Updated 2026-10-06
There is one constant path and loop generators; every other path is a word in those loops. Distinct words are distinct basis paths, so there are no relations among the generators. Thereforethe free associative algebra on generators, with each loop sent to its corresponding generator. For this is ; for it is noncommutative. The quiver with one loop is the case of the quiver with r loops.