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.
Positive radical, corank one, positive definiteness of proper submatrices, and domination exclusions
Statement
Let be a finite set with Coxeter matrix , let be the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), let be its diagram (Coxeter diagrams: edges, labels, components and finite type), and let carry the Coxeter form (The real Coxeter form, its radical, reflections, and form-preserving maps). Assume that is connected, that for distinct , and that is positive semidefinite (Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form) with . These are the raw hypotheses; no corank-one condition is assumed.
(1) Positive radical and corank one. If and , then for every . The set of with for all is nonempty and consists of the positive multiples of one vector ; in particular and . [No Perron-Frobenius theorem is used.]
(2) Proper principal submatrices and parabolics. For every proper subset , the principal submatrix is positive definite, with the case vacuous. For nonempty , the standard parabolic (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups) has the Coxeter presentation with restricted matrix (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)); its Coxeter form is the displayed principal submatrix, so is finite by Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1). For , is finite by definition.
(3) Domination. Let and let be a Coxeter diagram on , with edge labels in , whose underlying graph is a subgraph of the induced subdiagram and whose retained edge labels are no larger than the corresponding labels of . For a nonedge use label ; put , and let be the symmetric form on with , for finite , and when . Thus nonedges have entry . If (a strict instance of the usual label/subgraph domination relation), then its cosine matrix is positive definite. Here the relation is applied to even when it is disconnected; when , it is the relation of [Davis, Appendix C.3]. Consequently, if the cosine matrix of some such is not positive definite - for instance if it has a nonzero vector with , or, when , if its determinant is while some proper principal submatrix is positive definite (Sylvester's criterion: a real symmetric matrix with is positive definite if and only if all leading principal minors are positive, For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix) - then cannot strictly dominate .
(4) Use. Clauses (1)-(3) supply the positive-radical structure and domination exclusion used to enumerate connected diagrams of the affine form type defined in Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1). This reference supplies terminology only: the hypotheses above are raw and the proof does not assume corank one.
Facts & Assumptions
Given: A finite set with Coxeter matrix , presented group , diagram (connected) and the form on , with , for and exactly when ; is positive semidefinite, for all , and .
is symmetric and bilinear, with , the stated cosine entries, and the given inequalities for (The real Coxeter form, its radical, reflections, and form-preserving maps, Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms). The coordinate functions form a basis of : each is , and evaluation at each index gives uniqueness.
The radical is closed under linear combinations by bilinearity, hence is a linear subspace; vanishes on (The real Coxeter form, its radical, reflections, and form-preserving maps, The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space, Linear subspace of a vector space).
By the hypothesis of positive semidefiniteness, for every ; positive definiteness means for every (Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
Two vertices of are adjacent exactly when (Coxeter diagrams: edges, labels, components and finite type).
For a real symmetric matrix with , positive definiteness is equivalent to positivity of all leading principal minors; in particular, a nonpositive determinant rules out positive definiteness (Sylvester's criterion: a real symmetric matrix with is positive definite if and only if all leading principal minors are positive, For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
Cosine is strictly decreasing on (Signs, monotonicity intervals, and ranges of sine and cosine).
The singleton is a basis of the line , so that this line has dimension (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear combination of a finite list, and the span as the smallest linear subspace containing , Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis).
The standard parabolic is (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups); (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups); and the group presented by the restricted matrix maps isomorphically to , making a Coxeter system (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)).
For a Coxeter system, its group is finite if and only if its Coxeter form is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)).
Connectedness of means its underlying graph is connected (Coxeter diagrams: edges, labels, components and finite type).
Proof
(The absolute-value inequality.) For put and . Expanding in the basis , , where the sum runs over unordered pairs of distinct indices. Each summand is because and ; hence [F1].
(The radical of a positive semidefinite form.) If then : for every and every one has . If then choosing gives , so ; if then for every , so again .
(Propagation of zeros along the diagram.) Let with for all , and suppose for some . Since is symmetric and is radical, [F1, F2]. Each summand is : this follows from and for , while the term is [F1]. Hence every summand is ; in particular for every neighbour of , because neighbours have by [F1, F4, F7, F12]. Iterating along the connected diagram [F11] gives for all .
(Full support of nonzero radical vectors.) Let , , and put . By step 1.1, , and by positive semidefiniteness , so [F3]; by step 1.2, , and because . If some were , then and step 1.3 would give , a contradiction. Hence for every .
(Existence, uniqueness and full span of the positive radical vector.) Replacing any nonzero by gives a nonzero radical vector with nonnegative coordinates; step 1.3 shows every coordinate is positive. Thus the positive radical set is nonempty. If both belong to it and were linearly independent, let and . Bilinearity shows ; some coordinate of is , and , contradicting step 2.1. Hence any two positive radical vectors are positive scalar multiples. Fix one such vector . For an arbitrary , if some put and ; otherwise put . In either case every coordinate of is positive. Bilinearity puts this vector in , so the uniqueness just proved gives for some . Therefore . This proves and by [F8].
(Proper principal submatrices are positive definite.) Let and let be nonzero. Pad its coordinates by zero to obtain . Since is positive semidefinite, . If equality held, step 1.2 would put in ; it is nonzero and has a zero coordinate outside , contradicting step 2.1. Hence for every nonzero , exactly positive definiteness of the principal submatrix. If , this condition is vacuous and the zero-dimensional form is positive definite by definition.
(Domination.) Let , and be as in (3), and write for its cosine matrix. Let be the matrix of ; after reordering the vertices so that comes first, is indexed by the same first vertices. For an edge of with label , the entry is by [F7]; if the labels differ, the inequality is strict, including the convention . For a pair not joined in , its entry is . Thus for all distinct , while both diagonals are [F1, F4]. Suppose is not positive definite. By [F3], some nonzero satisfies . Pad by zero outside . Then . The first inequality is positive semidefiniteness; the second follows termwise from and nonnegative coordinate products; the third follows termwise because off the diagonal and . Equality throughout gives , so by step 1.2. Since , step 2.1 forces every coordinate of to be nonzero, hence and every . Equality in the second inequality then forces for every distinct pair, so the strict monotonicity in [F7] gives the same edges and labels: , contrary to the hypothesis. Therefore is positive definite.
(The proper standard parabolics are finite.) Let . If , step 3.2 makes its restricted Coxeter form positive definite, and [F9] identifies as a Coxeter system with that restricted form; [F10] then gives that is finite. If , [F9] gives , also finite.
(The exclusion consequence.) If has a nonzero vector with , then it is not positive definite by definition [F3]. If and , then its last leading principal minor is nonpositive, so is not positive definite by Sylvester's criterion [F5]; this also covers the statement's example that additionally assumes a proper principal submatrix is positive definite. By step 3.3, neither obstruction is compatible with strict domination.
Depends on
- Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Coxeter diagrams: edges, labels, components and finite type
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
- Positive and negative definiteness, the inertia $(p,q,r)$, rank $p+q$, and signature $p-q$ of a real symmetric bilinear or quadratic form
- Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms
- The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- Linear subspace of a vector space
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Sylvester's criterion: a real symmetric $n\times n$ matrix with $n\geq1$ is positive definite if and only if all leading principal minors are positive
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- Signs, monotonicity intervals, and ranges of sine and cosine
- Quarter-turn values and shifts by pi/2 and pi
Used by
- An indefinite Coxeter form: infinite, but not of affine type Example
- The radical vector of A-tilde 2 and its Euclidean slice Example
- Crystallographic alcove diagrams: the affine list realized by Weyl types A–G Lemma
- Enumeration of the connected positive semidefinite corank-one diagrams Lemma
- The affine slice: faithful isometric action, the alcove simplex, and its facet reflections Lemma
- Classification of affine Coxeter diagrams and their Euclidean simplex realization Theorem
Cited to discharge well-definedness by Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice.
Dependency tree · two levels
136 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.