Let . In the vertex order along the displayed -- path, the Coxeter Gram matrix has diagonal entries and successive off-diagonal entries . Its leading principal determinants satisfyThe last determinant is nonzero, so the form is nondegenerate. Its negative determinant rules out positive semidefiniteness and hence also positive definiteness. Thus the answers are respectively no, no, and yes.
The displayed simply-laced tree has arms of lengths , , and from its trivalent vertex, so it is the finite type Coxeter graph. Its Gram matrix is the Cartan matrix, which has positive leading principal minors in a leaf-removal ordering and determinant . By Sylvester's criterion it is positive definite. It is therefore positive semidefinite and nondegenerate as well: the three answers are yes, yes, and yes.
For the four-cycle, the quadratic form isIt is nonnegative, but it vanishes on the nonzero vector . Equivalently, the Gram eigenvalues are . The form is positive semidefinite, not positive definite, and degenerate: the three answers are no, yes, and no. This is the affine Coxeter graph .
Articles by others on the same topic
There are currently no matching articles.