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.
Finite Coxeter Diagrams and Complete Classification — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Canonical Roots, Signs, and Faithful Reflections
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Coxeter Diagrams and Complete Classification
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Fundamental Trigonometric Identities
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Finite Abelian Groups
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Tits Cones, Chambers, and Parabolic Stabilizers
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This companion is a dependency leaf: its examples use the theory of finite-coxeter-diagrams-and-complete-classification, that page's prerequisite closure and earlier examples in this companion; no item outside this companion depends on them.
Dihedral diagrams : Gram determinants, the infinite case, and the low-rank coincidences computes the matrix of the rank-two diagram with , obtains in the finite case together with the exact order of the group, and in the infinite case exhibits the kernel vector ; it also records the low-rank coincidences , , , and . Gram determinants and principal minors of the non-crystallographic types and evaluates the leading principal minors of for and , including the second principal minor of , and shows that the neighbouring overlong paths and the star with labels have negative determinant or an explicit non-positive vector. and define the same Coxeter diagram and the same Coxeter group proves that the two names denote the same labelled path with one final label- edge, computes with leading minors , and identifies the standard parabolic . A cycle and an overlong arm: explicit non-positive witnesses exhibits the cycle vector with , the weighted vector of the overlong star , and the -weighted witnesses for two large labels. Path determinants and the three-arm inequality proves the path recursion and the two-subpath determinant, and proves the three-arm criterion: for a star with arms of vertices positive definiteness is equivalent to , whose surviving triples , , , and boundary triples , , are then computed.
The computations test the determinant table and the exclusions of the theory page; they are evidence within their stated scope and do not replace the proofs there.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A cycle and an overlong arm: explicit non-positive witnesses
Example
Throughout, is finite, is a Coxeter matrix with diagram and Coxeter form on (Coxeter diagrams: edges, labels, components and finite type, The real Coxeter form, its radical, reflections, and form-preserving maps), and one is asked whether can be positive definite.
(i) Cycles. Let be the cycle on vertices with all labels , so that for consecutive pairs (indices modulo ) and all other off-diagonal entries are . Then satisfies , so the cycle is not positive definite; more generally, if the labels on the cycle are then .
(ii) An overlong arm. Let be the star with central vertex and arms of vertices, all edges labelled , with arm vertices (length ), (length , adjacent to ) and (length , adjacent to ). Then satisfies ; hence the star , the one-vertex extension of , is not positive definite, in agreement with the arm inequality of Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (6), which the triple fails with equality.
(iii) Two large labels. The three-vertex path with both edges labelled has the witness with , and the four-vertex path with labels has the witness with ; these are the first members of the family excluded in Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (4)(ii).
Facts & Assumptions
Given: A finite set with Coxeter matrix and diagram , the space with the Coxeter form , and the specific diagrams of (i), (ii) and (iii).
Distinct vertices of are joined exactly when and carry the label ; the subdiagram is the induced labelled graph on , so deleting vertices deletes exactly the incident edges; the neighbours of are (Coxeter diagrams: edges, labels, components and finite type).
is the unique symmetric bilinear form on with , for finite and for (The real Coxeter form, its radical, reflections, and form-preserving maps).
If for some and , then is not positive definite; and if all coordinates of are while a labelled graph on has all labels at most the labels of , then (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (1)).
With for : , exactly when , and whenever (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms).
For a vertex of degree whose edges all have label and whose three arms have vertices, is necessary for positive definiteness (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (6)).
for every real (Double-angle and quadratic power-reduction identities).
Cosine is strictly decreasing on , and (Signs, monotonicity intervals, and ranges of sine and cosine, Pi as twice the smallest positive zero of cosine, Quarter-turn values and shifts by pi/2 and pi).
and this factor is positive (The finite Viete cosine product and its positive nested-radical factors).
Verification
(The two numerical values.) is [F9]. For , put : the shift formula gives by [F7], while the double-angle formula gives by [F6]; hence , i.e. . Since and cosine is strictly decreasing on with , one has [F8], so .
(Weighted arms.) Let a path arm on vertices have all its edges labelled and let be the vertex adjacent to the centre ; put . Every internal edge contributes twice, so , by [1.1] and [F2]; and since among the pairs only is an edge, with coefficient .
(The cycle witness (i).) For the cycle of (i) put , a non-negative vector. Its diagonal contribution is ; each of the consecutive pairs contributes because on edges [F4], and every other pair is a non-edge, contributing [F2, F4]; hence , so is not positive definite by [F3]. If the labels on the cycle are any values , the same computation gives because each consecutive is still while every other pair contributes (an edge of label gives , a non-edge gives ), and the conclusion is unchanged.
(Two large labels (iii).) For the path with labels and : the diagonal is [F2], and the two edges contribute each by [F10] and [1.1]; hence . For the path with labels and : the diagonal is , the two label- edges contribute each, and the middle label- edge contributes by [1.1]; hence . In both cases has non-negative coordinates, so is not positive definite by [F3].
(The star witness (ii).) In the star of (ii) the three arms meet only at [F1], so the three arm vectors , and , in which the centre-adjacent vertices carry the weights , are pairwise -orthogonal; step 2.1 with gives , , , and , , . Therefore satisfies , and with all coordinates , so is not positive definite by [F3].
(Agreement with the general exclusions.) The triple of arm lengths in (ii) gives , so it fails the necessary inequality [F5] with equality, and the star of (ii) is the first diagram at which the arm inequality becomes non-strict; the equality in the computation of [3.1] is the same equality. The paths of (iii) are the two shortest diagrams with two edges of label , so they are the first members of the family excluded in Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (4)(ii), whose witness vector is -weighted on the interior of the chain, exactly as in [2.3].
Dihedral diagrams : Gram determinants, the infinite case, and the low-rank coincidences
Example
Let with and ; let be the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), the Coxeter form on (The real Coxeter form, its radical, reflections, and form-preserving maps) and its diagram (Coxeter diagrams: edges, labels, components and finite type).
(i) The diagram and the matrix. is the single edge labelled , and the matrix of in the basis is with for finite and for .
(ii) Finite case. For finite one has and the principal minors are , so is positive definite and is finite; it is the dihedral group of order , and the canonical product has exact order on (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)(iv), Finiteness criterion: W is finite exactly when the Coxeter form is positive definite).
(iii) Infinite case. For one has and the kernel vector satisfies ; hence is not positive definite and is infinite, namely the infinite dihedral group.
(iv) Low-rank coincidences and products. As Coxeter systems , , , (no edge for ), , and is the one-vertex diagram; these are the only overlaps among the rank-two families, and in the classification Classification of finite Coxeter systems, including the H and dihedral families they appear under both names. The one-vertex diagram has positive definite and ; the disconnected two-vertex diagram is the direct product of two such groups, of order (The external direct product with componentwise multiplication, is a group with identity , coordinatewise inverses, and homomorphic coordinate projections).
Facts & Assumptions
Given: , a Coxeter matrix with and , the presented group with canonical homomorphism , the space with Coxeter form , and the diagram ; write for finite .
In a diagram with two distinct vertices , an edge is drawn exactly when and it carries the label ; when no edge is drawn, and the subdiagram on a single vertex is the one-vertex diagram (Coxeter diagrams: edges, labels, components and finite type).
, for finite and for ; more generally is the order of in (The real Coxeter form, its radical, reflections, and form-preserving maps, Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The reflection is linear and an involution, fixes pointwise, and ; on the plane the product has exact order for finite , fixing pointwise, while for it is on with , , so it has infinite order (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2),(3)(ii),(3)(iv)).
is a homomorphism with ; it is injective (The root-length criterion and faithfulness of the canonical reflection representation (3), Descent of the reflection representation, unit root norms, and conjugation of reflections).
is finite if and only if is positive definite; a symmetric matrix is positive definite if and only if all its leading principal minors are positive; the form is positive definite when its quadratic form is on every nonzero vector, so a nonzero with excludes positive definiteness (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite, Sylvester's criterion: a real symmetric matrix with is positive definite if and only if all leading principal minors are positive, Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
; and for ; for every finite Coxeter label (Quarter-turn values and shifts by pi/2 and pi, Parity and the Pythagorean identity for sine and cosine, Sine and cosine defined by their real power series, Pi as twice the smallest positive zero of cosine, Signs, monotonicity intervals, and ranges of sine and cosine); sine positivity also follows from the positive rank-two quadratic coefficient in [F3].
An external direct product is a group and is finite exactly when both factors are, with ; for a disconnected diagram the group is the direct product of the standard parabolics of its components (The external direct product with componentwise multiplication, is a group with identity , coordinatewise inverses, and homomorphic coordinate projections, Disconnected diagrams, direct products, and comparison of invariant forms (1)).
Verification
(The matrix, the finite determinant and the infinite kernel vector.) Since , or , the diagram is the single edge labelled [F1], and in the basis the matrix of is with for finite and for [F2]; this is (i). Its determinant is . For finite the Pythagorean identity gives , which is positive because [F6]; the principal minors are the diagonal entries . For we have and , while satisfies [F2]; by [F5] the form is not positive definite, giving (iii) for the form.
(Finite case: positive definiteness, order .) Let . The leading principal minors of are and by 1.1 [step 1.1], so is positive definite by [F5] and is finite by the criterion [F5]. By [F3] the product acts on as a rotation of exact order and fixes pointwise, so has exact order on . Put , of exact order ; every element of is of the form or with and , because every alternating word in the two involutions is a power of possibly preceded by . Hence : the are distinct because has exact order , the are distinct for the same reason, and because while ; so and injectivity of [F4] gives , being the dihedral group . For the same factorisation with of infinite order [F3] exhibits infinitely many distinct elements and is the infinite dihedral group, completing (ii) and (iii).
(The low-rank coincidences and the products (iv).) Reading the labelled graphs: is a single edge labelled , which is the one-edge path ; is a single edge labelled , which is , also written ; is a single edge labelled , conventionally ; draws no edge [F1], so the two-vertex diagram with is the disconnected diagram , which is the direct product of two one-vertex groups by the component statement [F7]; and by the rank-two naming convention. The one-vertex diagram has , which is positive definite [F5], and presentation , so ; the disconnected two-vertex diagram has group , of order [F7]. These coincidences and the group orders are (iv), and the group of 2.1 [step 2.1] is the dihedral group appearing under both names in the classification.
Gram determinants and principal minors of the non-crystallographic types and
Example
Let be the path with labels , , and let be the path with labels (Coxeter diagrams: edges, labels, components and finite type); let be the Coxeter form and the cosine matrix (The real Coxeter form, its radical, reflections, and form-preserving maps). Using (derived in Verification 1.1):
(i) . The leading principal minors of are , and ; the principal minor on the label- edge equals ; the minor on equals . Hence is positive definite and the Coxeter group of type is finite.
(ii) . The leading principal minors of are (the first three vertices form type ) and . Hence is positive definite and the Coxeter group of type is finite.
(iii) Excluded neighbours. The overlong paths with labels and have negative determinant, and the star with a degree- vertex whose three incident edges have labels has the negative witness value ; none of these diagrams is of finite type (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite, Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (3),(4)).
Facts & Assumptions
Given: The paths , and the three excluded diagrams above, with the Coxeter form and its cosine matrix ; write for the determinant of the leading principal submatrix of .
, for finite and for , without any positivity assumption; non-adjacent distinct vertices have and hence matrix entry (The real Coxeter form, its radical, reflections, and form-preserving maps, Coxeter diagrams: edges, labels, components and finite type).
for every real , and the Chebyshev polynomials of the first kind satisfy , , ; , ; ; and for ; cosine is strictly decreasing on ; and , ( and for every , Chebyshev polynomials of the first and second kinds by their three-term recurrences, Quarter-turn values and shifts by pi/2 and pi, Double-angle and quadratic power-reduction identities, Signs, monotonicity intervals, and ranges of sine and cosine, Pi as twice the smallest positive zero of cosine, Parity and the Pythagorean identity for sine and cosine, Squaring is monotone on the nonnegatives, Square roots exist: a unique with ; the positives are ).
A symmetric real matrix is positive definite if and only if its leading principal minors are positive; the form is positive definite when for every , and is finite if and only if is positive definite (Sylvester's criterion: a real symmetric matrix with is positive definite if and only if all leading principal minors are positive, Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite).
Scaling an matrix by multiplies its determinant by , and is the determinant of the leading principal submatrix (Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring, The determinant is the unique normalized alternating multilinear function on the columns).
and are among the standard diagrams of the classification, and every proper principal submatrix of a listed diagram is a block diagonal matrix whose blocks are listed diagrams of smaller rank (Classification of finite Coxeter systems, including the H and dihedral families (3)).
Laplace expansion along any row or column expresses the determinant as the sum of entries times their cofactors; the cofactor sign is and the determinant of the empty deleted matrix is (Laplace expansion computes the determinant along every row and every column over a commutative ring, Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring).
Verification
(The three trigonometric values and the small determinants.) follows from the double-angle formula at together with , which gives , i.e. , and because and cosine is strictly decreasing on with [F2]; thus . Also : with , iterating the recurrence of [F2] gives , so , i.e. by expansion, while gives [F2], so , and ; by uniqueness of nonnegative square roots , and the positive value is because the other is negative as [F2]. Thus [F2]; also and [F2], by squaring the positive quantities ( and ).
(The recurrence without positivity.) For any of the paths in the Example, let be its leading cosine matrix and set , . For put . By [F1] the last row has only the potentially nonzero entries in column and in column . In the deleted matrix for the first entry, the last column has only the bottom entry , whose cofactor is ; its determinant is therefore by [F6]. The last-row cofactor sign at is , while the diagonal cofactor is . Thus Laplace expansion yields [F6]. This identity uses no definiteness assumption and applies equally to the excluded paths.
(The minors and positive definiteness.) With , and by 1.2 [step 1.2]: , by 1.1 [step 1.1]. Multiplying by [F4] gives for the leading minors , , , and ; the principal submatrix of on the label- edge is with determinant , so the determinant of the corresponding submatrix of is [F1, F2]. The submatrix of on is with determinant . All leading principal minors of are positive, so and hence is positive definite by [F3], and has finite Coxeter group.
(The minors and positive definiteness.) Using the recurrence of 1.2 [step 1.2] for the path with labels : , , , by 1.1 [step 1.1]. The first three vertices carry the all- path with the computed doubled leading minors [F4], and because [F2]; all leading principal minors of are positive, so is positive definite by [F3] and has finite Coxeter group.
(The excluded neighbours.) The unconditional recurrence of 1.2 [step 1.2] for the path with labels gives because , i.e. , follows from [F2]; for the path with labels it gives because [F2]; a negative leading minor excludes positive definiteness by [F3]. For the star with centre and neighbours , edges labelled and labelled , the vector has non-negative coordinates and satisfies because [F2]; by [F3] this star is not positive definite either.
(Conclusion.) The leading principal minors of computed in 2.1 and 2.2 [step 2.1, step 2.2] are all positive, so is positive definite for and for by Sylvester's criterion [F3]; by the finiteness criterion [F3] the Coxeter groups of types and are finite, agreeing with their appearance in the classification [F5]. The three diagrams of 2.3 [step 2.3] either have a negative leading principal minor or a nonzero non-negative vector with non-positive value, so none of them is positive definite and none of their Coxeter groups is finite [F3], which is (iii).
and define the same Coxeter diagram and the same Coxeter group
Example
Let and let and denote the Coxeter systems whose diagram is the path on vertices with labels (Coxeter diagrams: edges, labels, components and finite type). Then:
(i) Same diagram, same system. The Coxeter matrices of and are equal, so the two names denote the same Coxeter system, the same diagram and the same group ; the distinction between the and families belongs to root-system data (a long and a short simple root), not to the Coxeter presentation.
(ii) Positivity and determinant. With the cosine matrix, , while the leading principal minors of are those of the paths (), namely , and the full determinant . Hence is positive definite, is of finite type, and the groups , are finite of the same order (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite).
(iii) Small ranks. , and contains as a standard parabolic; type has the same Coxeter system and the same Coxeter diagram as for every (Classification of finite Coxeter systems, including the H and dihedral families (4)).
Facts & Assumptions
Given: , the path on vertices with labels for and , the Coxeter form on , its cosine matrix , and the presented group .
A diagram is determined by its Coxeter matrix and conversely: two Coxeter systems with the same labelled graph have the same matrix and hence are the same diagram and the same presented group; the subdiagram on a vertex subset is the induced labelled graph (Coxeter diagrams: edges, labels, components and finite type).
, for finite and for , without any positivity assumption (The real Coxeter form, its radical, reflections, and form-preserving maps).
; , , cosine is even and strictly decreasing on , and (The finite Viete cosine product and its positive nested-radical factors, Double-angle and quadratic power-reduction identities, Quarter-turn values and shifts by pi/2 and pi, Parity and the Pythagorean identity for sine and cosine, Signs, monotonicity intervals, and ranges of sine and cosine).
Laplace expansion along any row or column expresses a determinant in terms of cofactors, with the empty minor assigned determinant ; scaling an matrix by multiplies its determinant by ; and induction on is available (Laplace expansion computes the determinant along every row and every column over a commutative ring, Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring, The determinant is the unique normalized alternating multilinear function on the columns, The principle of mathematical induction, The natural numbers (von Neumann)).
A symmetric real matrix is positive definite if and only if its leading principal minors are positive; is finite if and only if is positive definite (Sylvester's criterion: a real symmetric matrix with is positive definite if and only if all leading principal minors are positive, Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite).
, and name the two-vertex diagram with label , and the standard parabolic of type is isomorphic to the symmetric group (Classification of finite Coxeter systems, including the H and dihedral families (4), Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2),(4)).
Verification
(The diagram and the leading minors.) The two names denote the same labelled path, hence the same Coxeter matrix, presented group and form [F1]. Let be its leading submatrix and , with and . For put . The last row has only and as potentially nonzero entries [F2]. Its diagonal cofactor is ; deleting row and column leaves a matrix whose last column has only the bottom entry , so a second Laplace expansion gives deleted-matrix determinant . The off-diagonal cofactor has sign , and therefore [F4], without assuming positivity. To compute the all- prefix, put : [F3] gives and , hence and . Thus for the recurrence is . Induction, starting with , gives for , since [F4]. At the final label- edge, [F3] gives . Consequently the leading minors of are for , and [F4]. This also covers , using .
(Small ranks and the parabolic .) For the path has the single edge labelled , which is the diagram , and this is the same labelled graph as [F1, F6]. The subdiagram on is the all- path ; hence is a standard parabolic subgroup of , isomorphic to the Coxeter group of type , which is the symmetric group [F6]. Since the two names share the same labelled graph, type has the same Coxeter system and the same standard parabolic , which is (iii).
(Positive definiteness, finiteness, and the same order.) By 1.1 [step 1.1] the leading principal minors of are and the full determinant is , all positive; scaling by the positive factor does not change definiteness, so has all leading principal minors positive and is positive definite by Sylvester's criterion [F5]. By the finiteness criterion [F5] the group of is finite, and since has the same Coxeter matrix it has the same Coxeter system, the same form and the same finite group, in particular the same order [F1]. This is (i) and (ii).
(Conclusion.) The Coxeter matrices of and are equal, so the two names denote the same Coxeter diagram, the same Coxeter system and the same group, and the distinction between the and families lies in root-system data rather than in the presentation; the doubled cosine determinant is with leading minors , so and are positive definite and of finite type; and while has as a standard parabolic, with identical.
Path determinants and the three-arm inequality
Example
(i) Path recursion. Let be the path with labels () and cosine matrix (The real Coxeter form, its radical, reflections, and form-preserving maps, Coxeter diagrams: edges, labels, components and finite type), and let be the determinant of the leading principal submatrix of . Then is the coefficient convention. Then , , and For the path with all labels this gives and ; for a path whose only label is on the edge between the -th and -st vertices, positive definiteness requires the constraint of Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (5)(ii), with .
(ii) The three-arm inequality. For the star with central vertex and three arms of vertices, all edges labelled , positive definiteness is equivalent to
(iii) Numerical checks. The triples satisfying the inequality are, up to order, for every (type ), (type ), (type ) and (type ); the boundary cases (type ), and give equality , and the overlong star has an explicitly non-positive vector, as treated in A cycle and an overlong arm: explicit non-positive witnesses.
Facts & Assumptions
Given: The paths of (i) and the three-arm star of (ii), with their labelled diagrams, the space with Coxeter form and cosine matrix , the standard basis vectors , and the leading minors of .
An edge of the diagram is present exactly when and carries the label ; the subdiagram on a vertex subset is the induced labelled graph (Coxeter diagrams: edges, labels, components and finite type).
and for finite ; for ; is symmetric and bilinear, so , and the form a basis of (The real Coxeter form, its radical, reflections, and form-preserving maps).
For every row the determinant expands as , where is the cofactor and , the matrix with row and column deleted, is the deleted matrix (Laplace expansion computes the determinant along every row and every column over a commutative ring, Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring).
Determinant is multilinear in the columns and normalized, so multiplying an matrix by the scalar multiplies its determinant by , and the determinant of a block triangular matrix is the product of the determinants of its diagonal blocks (The determinant is the unique normalized alternating multilinear function on the columns, Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring).
A symmetric real matrix is positive definite if and only if all its leading principal minors are positive; the form is positive definite when for every (Sylvester's criterion: a real symmetric matrix with is positive definite if and only if all leading principal minors are positive, Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
For one has and , cosine is strictly decreasing on and (Double-angle and quadratic power-reduction identities, Quarter-turn values and shifts by pi/2 and pi, Signs, monotonicity intervals, and ranges of sine and cosine, Parity and the Pythagorean identity for sine and cosine); and for a real symmetric positive definite form on a subspace, with equality exactly when are linearly dependent (Cauchy–Schwarz: , with equality exactly for linearly dependent vectors).
The strong induction principle on holds (The principle of mathematical induction, The natural numbers (von Neumann)).
The standard irreducible diagrams of the classification are (all labels ), (arms ), (arms ; ; ), and the types , carry those diagrams (Classification of finite Coxeter systems, including the H and dihedral families (1)).
The star with arms has the explicit non-positive vector of A cycle and an overlong arm: explicit non-positive witnesses (ii), and the triple fails the inequality of (ii) with equality.
Verification
(The recursion by expansion.) Set ; the leading matrix is , so [F2]. For let be the leading submatrix and put , with for an infinite label. By [F1, F2] its diagonal entries are , its adjacent off-diagonal entries are and all others are . In the last-row Laplace expansion [F4], the diagonal entry contributes . Deleting row and column leaves a matrix whose last column has only its bottom entry ; expanding that column gives determinant , also for with the empty minor. The last-row cofactor sign at is , so the other contribution is . Therefore without any positivity assumption.
(The integer cases.) Let satisfy the inequality of (ii). If then with equality only for , so . Then : for this holds for every ; for it says , i.e. , so ; and for the sum is at most , a contradiction. Hence the triples are for , , and up to order. The equality cases are found the same way: gives a sum ; forces ; and forces , i.e. or . Thus , and are exactly the boundary triples.
(The all- path.) First : putting , [F7] gives , so , and because , cosine is strictly decreasing on and [F7], hence . If every label is , then , so the recursion of 1.1 reads with ; by the induction principle [F8] the formula holds for all , since . Hence for every , the leading principal minors of are by [F5], and and are positive definite by [F6]; in particular .
(One large edge: the two-subpath formula.) Let the path have all labels except one edge labelled between the -th and -st vertices, and put , . Write for the determinant of an all- path on vertices, including , as proved in 2.1 [step 2.1]; these are distinct from the leading minors of the labelled path. Then Proof by induction on [F8], writing for this matrix: for the large edge is the last one and expansion along the last row [F4] gives ; for the last edge has label , so the recurrence of 1.1 [step 1.1] gives , which is since ; for the last edge again has label , so , and substituting the induction hypothesis and the recursion of 2.1 [step 2.1] gives the formula. With of 2.1 [step 2.1] this is and since positive definiteness of the path would give by [F6], such a path satisfies , which is the constraint of Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (5)(ii).
(The arm vectors.) For the star of (ii) with centre and arm spans on the three arms, and the arm spans are pairwise -orthogonal, because distinct arms share no edge [F1, F2]. On the arm with vertices ( adjacent to ) put . Then and by [F2], and for every the identity holds, because the coefficient of in is for (also for when ), while the coefficient of is ; for the coefficient is directly. In particular on the arm span. By 2.1 and [F6] the form restricted to each arm span (an all- path) is positive definite; hence is positive definite on all of , since a nonzero element has some nonzero component and .
(Completing the square: equivalence of positive definiteness and the inequality.) Keep the notation of 3.2 [step 3.2] with arms of vertices and vectors , put and , so that because its components in the distinct summands are the nonzero multiples . Then for every by the last identity of 3.2 [step 3.2], and . Since is a nonzero vector of , on which is positive definite [step 3.2], every has a unique form with , and : the -coordinate is forced, and has the unique orthogonal decomposition along in the inner product space , with and . Then because and [F2]. If then is a sum of three terms that are and is only when , and , i.e. only for ; conversely, if , then (its -coordinate is ) has , so is not positive definite [F6]. Hence is positive definite if and only if , and is equivalent to , i.e. to , which is the inequality of (ii). When is positive definite, the same identity exhibits the strict Cauchy-Schwarz bound of the projection of onto used in Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (6), strict because [F7].
(Conclusion.) The recursion and the all- values of (i) are steps 1.1 and 2.1 [step 1.1, step 2.1], and the two-subpath determinant formula giving the constraint is step 3.1 [step 3.1]. The equivalence of (ii) is step 4.1 [step 4.1], proved by completing the square along the three positive definite arms of 3.2 [step 3.2]. The list of triples of (iii) and the boundary triples are step 1.2 [step 1.2], and the boundary star is the one with the non-positive vector of A cycle and an overlong arm: explicit non-positive witnesses [F10]; the names of the surviving triples are those of the classification [F9].