Confluence and Koszulity (Q1268097)

Let \(V\) be finite dimensional vector space over a field \(K\) and denote \(V^{(n)}=V^{\otimes n}\). Fix a totally ordered basis \(X\) of \(V\) and let \(X^{(n)}\) be the corresponding lexicographically ordered basis of \(V^{(n)}\). If \(E\) is a subspace of \(V^{(2)}\) consider the ideal \(I(E)\) generated by \(E\) in the tensor algebra \(\text{Tens}(V)\) of \(V\). The quotient \(\text{Tens}(V)/I(V)\) is a quadratic algebra on \(V\). It inherits the natural grading on \(\text{Tens}(V)\). Call \(E\) the space of relations of \(A\). An \(X\)-reduction operator \(T\in\hom V\) is an idempotent such that for every \(X\)-generator \(a\) either \(T(a)=a\) (and \(a\) is reduced) or \(T(a)<a\) (and \(a\) is nonreduced). Since the tensor product of reduction operators is a reduction operator too, the notion of reducibility carries over to quadratic algebras. If the classes of the reduced monomials are linearly independent then \(A\) is a polynomial algebra and moreover the above classes form a basis of \(A\). This basis is the PBW basis of \(A\) [see \textit{S. B. Priddy}, Trans. Am. Math. Soc. 152, 39-60 (1970; Zbl 0261.18016)]. Polynomial algebras in this paper are called confluent. First the author provides a new proof of Priddy's theorem that every confluent quadratic algebra is Koszul. Then he obtains descriptions of polynomiality in terms of confluence from the computational algebra point of view. Another proof of Priddy's theorem is given, using an explicit construction of a homotopy of the Koszul complex. Finally the author considers the meet and the join of two reduction operators from the algorithmic point of view, and gives a geometric characterisation of the confluence.