Alphabeta Math
Pipeline-generated
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.

✓ 5 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Finite Coxeter Diagrams and Complete Classification — Examples

1 · Prerequisites

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 I2(m): Gram determinants, the infinite case, and the low-rank coincidences computes the matrix of the rank-two diagram I2(m) with m∈{3,4,… }∪{∞}, obtains det⁡B=sin⁡2(π/m)>0 in the finite case together with the exact order 2m of the group, and in the infinite case exhibits the kernel vector es+et; it also records the low-rank coincidences I2(3)=A2, I2(4)=B2=C2, I2(6)=G2, I2(5)=H2 and I2(2)=A1×A1. Gram determinants and principal minors of the non-crystallographic types H3 and H4 evaluates the leading principal minors of 2C for H3 and H4, including the second 2×2 principal minor (5−5)/2 of H3, and shows that the neighbouring overlong paths and the star with labels 3,3,5 have negative determinant or an explicit non-positive vector. Bn and Cn define the same Coxeter diagram and the same Coxeter group proves that the two names denote the same labelled path with one final label-4 edge, computes det⁡(2C)(Bn)=2 with leading minors 2,3,…,n, and identifies the standard parabolic An−1. A cycle and an overlong arm: explicit non-positive witnesses exhibits the cycle vector es1+⋯+esr with B(u,u)=0, the weighted vector of the overlong star (1,2,5), and the 2-weighted witnesses for two large labels. Path determinants dk=dk−1−cos⁡2(π/m)dk−2 and the three-arm inequality proves the path recursion dk=dk−1−cos⁡2(π/mk−1)dk−2 and the two-subpath determinant, and proves the three-arm criterion: for a star with arms of p,q,r vertices positive definiteness is equivalent to 1p+1+1q+1+1r+1>1, whose surviving triples (1,1,r), (1,2,2), (1,2,3), (1,2,4) and boundary triples (2,2,2), (1,3,3), (1,2,5) 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

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

A cycle and an overlong arm: explicit non-positive witnesses

Example

Throughout, S is finite, m is a Coxeter matrix with diagram Γ and Coxeter form B on V=RS (Coxeter diagrams: edges, labels, components and finite type, The real Coxeter form, its radical, reflections, and form-preserving maps), and one is asked whether B can be positive definite.

(i) Cycles. Let Γ be the cycle on r≥3 vertices s1,…,sr with all labels 3, so that B(esi,esi+1)=−12 for consecutive pairs (indices modulo r) and all other off-diagonal entries are 0. Then u=es1+⋯+esr satisfies B(u,u)=r−2⋅r⋅12=0, so the cycle is not positive definite; more generally, if the labels on the cycle are ≥3 then B(u,u)≤0.

(ii) An overlong arm. Let Γ=E9 be the star with central vertex c and arms of 1,2,5 vertices, all edges labelled 3, with arm vertices a (length 1), b1−b2 (length 2, b1 adjacent to c) and d1−⋯−d5 (length 5, d5 adjacent to c). Then u=ec+12ea+13(2eb1+eb2)+16(ed1+2ed2+3ed3+4ed4+5ed5) satisfies B(u,u)=0; hence the star (1,2,5), the one-vertex extension of E8, 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 (1,2,5) fails with equality.

(iii) Two large labels. The three-vertex path with both edges labelled 4 has the witness u=es1+2 es2+es3 with B(u,u)=0, and the four-vertex path with labels 4,3,4 has the witness u=es1+2 es2+2 es3+es4 with B(u,u)=0; 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 S with Coxeter matrix m and diagram Γ, the space V=RS with the Coxeter form B, and the specific diagrams of (i), (ii) and (iii).

[F1]

Distinct vertices s≠t of Γ are joined exactly when m(s,t)≥3 and carry the label m(s,t); the subdiagram ΓT is the induced labelled graph on T, so deleting vertices deletes exactly the incident edges; the neighbours of s are N(s)={t≠s:m(s,t)≥3} (Coxeter diagrams: edges, labels, components and finite type).

[F2]

B is the unique symmetric bilinear form on V with B(es,es)=1, B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t) and B(es,et)=−1 for m(s,t)=∞ (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F3]

If 0≠u∈VT for some T⊆S and B(u,u)≤0, then B is not positive definite; and if all coordinates of u are ≥0 while a labelled graph Γ0 on T has all labels at most the labels of ΓT, then BT(u,u)≤B0(u,u) (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (1)).

[F4]

With c(s,t):=−B(es,et) for s≠t: c(s,t)∈[0,1], c(s,t)=0 exactly when m(s,t)=2, and c(s,t)≥12 whenever m(s,t)≥3 (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms).

[F5]

For a vertex v of degree 3 whose edges all have label 3 and whose three arms have p,q,r≥1 vertices, 1p+1+1q+1+1r+1>1 is necessary for positive definiteness (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (6)).

[F6]

cos⁡(2x)=2cos⁡2x−1 for every real x (Double-angle and quadratic power-reduction identities).

[F7]

cos⁡(x+π)=−cos⁡x and cos⁡(−x)=cos⁡x for every real x (Quarter-turn values and shifts by pi/2 and pi, Parity and the Pythagorean identity for sine and cosine).

[F9]

cos⁡(π/4)=2/2 and this factor is positive (The finite Viete cosine product and its positive nested-radical factors).

Verification

1.1F6F7F8F9algebra

(The two numerical values.) cos⁡(π/4)=2/2 is [F9]. For cos⁡(π/3), put c=cos⁡(π/3): the shift formula gives cos⁡(2π/3)=cos⁡(π−π/3)=−cos⁡(−π/3)=−c by [F7], while the double-angle formula gives cos⁡(2π/3)=2c2−1 by [F6]; hence 2c2−1=−c, i.e. (2c−1)(c+1)=0. Since 0<π/3<π and cosine is strictly decreasing on [0,π] with cos⁡π=−1, one has c>−1 [F8], so c=cos⁡(π/3)=1/2.

2.1F2step 1.1algebra

(Weighted arms.) Let a path arm on vertices s1,…,sp have all its edges labelled 3 and let sp be the vertex adjacent to the centre c; put up=∑k=1pk esk. Every internal edge {sk,sk+1} contributes k(k+1)B(esk,esk+1)=−k(k+1)/2 twice, so B(up,up)=∑k=1pk2−∑k=1p−1k(k+1)=p2−∑k=1p−1k=p(p+1)/2, by [1.1] and [F2]; and B(ec,up)=−p/2 since among the pairs (c,sk) only {c,sp} is an edge, with coefficient p.

2.2F1F2F3F4step 1.1algebra

(The cycle witness (i).) For the cycle of (i) put u=∑i=1resi≠0, a non-negative vector. Its diagonal contribution is r; each of the r consecutive pairs contributes 2B(esi,esi+1)=−2c(si,si+1)≤−1 because c≥12 on edges [F4], and every other pair is a non-edge, contributing 0 [F2, F4]; hence B(u,u)≤r−r=0, so B is not positive definite by [F3]. If the labels on the cycle are any values ≥3, the same computation gives B(u,u)≤0 because each consecutive c is still ≥12 while every other pair contributes ≤0 (an edge of label ≥3 gives ≤−1, a non-edge gives 0), and the conclusion is unchanged.

2.3F2F3step 1.1F10algebra

(Two large labels (iii).) For the path with labels 4,4 and u=es1+2es2+es3: the diagonal is 1+2+1=4 [F2], and the two edges contribute 2⋅(−cos⁡(π/4))⋅2=−22cos⁡(π/4)=−2 each by [F10] and [1.1]; hence B(u,u)=4−4=0. For the path with labels 4,3,4 and u=es1+2es2+2es3+es4: the diagonal is 1+2+2+1=6, the two label-4 edges contribute −2 each, and the middle label-3 edge contributes 2⋅(−12)⋅2⋅2=−2 by [1.1]; hence B(u,u)=6−6=0. In both cases u≠0 has non-negative coordinates, so B is not positive definite by [F3].

3.1F1F2F3step 2.1algebra

(The star witness (ii).) In the star of (ii) the three arms meet only at c [F1], so the three arm vectors u1=12ea, u2=13(2eb1+eb2) and u3=16(ed1+2ed2+3ed3+4ed4+5ed5), in which the centre-adjacent vertices a,b1,d5 carry the weights 1,2,5, are pairwise B-orthogonal; step 2.1 with p=1,2,5 gives B(u1,u1)=14, B(u2,u2)=19⋅3=13, B(u3,u3)=136⋅15=512, and B(ec,u1)=−12⋅12=−14, B(ec,u2)=−13⋅22=−13, B(ec,u3)=−16⋅52=−512. Therefore u=ec+u1+u2+u3 satisfies B(u,u)=1+14+13+512+2(−14−13−512)=1−(14+13+512)=0, and u≠0 with all coordinates ≥0, so B is not positive definite by [F3].

4.1F5step 3.1step 2.3algebra∎

(Agreement with the general exclusions.) The triple (1,2,5) of arm lengths in (ii) gives 11+1+12+1+15+1=12+13+16=1, 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 ≥4, 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 2-weighted on the interior of the chain, exactly as in [2.3].

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Dihedral diagrams I2(m): Gram determinants, the infinite case, and the low-rank coincidences

Example

Let S={s,t} with m(s,t)=r∈{3,4,… }∪{∞} and m(s,s)=m(t,t)=1; let W be the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), B the Coxeter form on V=RS (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 st labelled r, and the matrix of B in the basis (es,et) is (1−c−c1) with c=cos⁡(π/r) for finite r and c=1 for r=∞.

(ii) Finite case. For finite r one has det⁡B=sin⁡2(π/r)>0 and the 1×1 principal minors are 1, so B is positive definite and W is finite; it is the dihedral group I2(r) of order 2r, and the canonical product ρ(s)ρ(t) has exact order r on V (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 r=∞ one has det⁡B=0 and the kernel vector u=es+et satisfies B(u,u)=0; hence B is not positive definite and W is infinite, namely the infinite dihedral group.

(iv) Low-rank coincidences and products. As Coxeter systems I2(3)=A2, I2(4)=B2=C2, I2(6)=G2, I2(2)=A1×A1 (no edge for m=2), I2(5)=H2, and A1=B1 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 A1 has B=(1) positive definite and W≅Z/2; the disconnected two-vertex diagram A1×A1 is the direct product of two such groups, of order 4 (The external direct product G×H with componentwise multiplication, G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections).

Facts & Assumptions

Given: S={s,t}, a Coxeter matrix with m(s,t)=r and m(s,s)=m(t,t)=1, the presented group W with canonical homomorphism ρ, the space V=RS with Coxeter form B, and the diagram Γ; write c:=cos⁡(π/r) for finite r.

[F1]

In a diagram with two distinct vertices s,t, an edge is drawn exactly when m(s,t)≥3 and it carries the label m(s,t); when m(s,t)=2 no edge is drawn, and the subdiagram on a single vertex is the one-vertex diagram (Coxeter diagrams: edges, labels, components and finite type).

[F2]

B(es,es)=B(et,et)=1, B(es,et)=−cos⁡(π/r) for finite r and B(es,et)=−1 for r=∞; more generally m(s,t) is the order of st in W (The real Coxeter form, its radical, reflections, and form-preserving maps, Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F3]

The reflection ra is linear and an involution, fixes ker⁡B(−,a) pointwise, and B(rau,raw)=B(u,w); on the plane P=Res+Ret the product rsrt has exact order m(s,t) for finite m(s,t), fixing P⊥ pointwise, while for m(s,t)=∞ it is id+N on P with N≠0, N2=0, so it has infinite order (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2),(3)(ii),(3)(iv)).

[F5]

W is finite if and only if B 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 >0 on every nonzero vector, so a nonzero u with B(u,u)≤0 excludes positive definiteness (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite, Sylvester's criterion: a real symmetric n×n matrix with n≥1 is positive definite if and only if all leading principal minors are positive, Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form).

[F6]

cos⁡(π/2)=0; sin⁡2x+cos⁡2x=1 and sin⁡x>0 for 0<x<π; sin⁡2(π/r)>0 for every finite Coxeter label r≥3 (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].

[F7]

An external direct product G×H is a group and is finite exactly when both factors are, with ∣G×H∣=∣G∣ ∣H∣; for a disconnected diagram the group is the direct product of the standard parabolics of its components (The external direct product G×H with componentwise multiplication, G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections, Disconnected diagrams, direct products, and comparison of invariant forms (1)).

Verification

1.1F2F3F5F6algebra

(The matrix, the finite determinant and the infinite kernel vector.) Since m(s,t)=r≥3, or r=∞, the diagram Γ is the single edge st labelled r [F1], and in the basis (es,et) the matrix of B is (1−c−c1) with c=cos⁡(π/r) for finite r and c=1 for r=∞ [F2]; this is (i). Its determinant is 1−c2. For finite r the Pythagorean identity gives 1−c2=sin⁡2(π/r), which is positive because 0<π/r≤π/3<π [F6]; the 1×1 principal minors are the diagonal entries 1>0. For r=∞ we have c=1 and det⁡B=0, while u=es+et≠0 satisfies B(u,u)=1+1−2⋅1⋅1=0 [F2]; by [F5] the form is not positive definite, giving (iii) for the form.

2.1F3F4F5step 1.1algebra

(Finite case: positive definiteness, order 2r.) Let r<∞. The leading principal minors of B are 1 and 1−c2=sin⁡2(π/r)>0 by 1.1 [step 1.1], so B is positive definite by [F5] and W is finite by the criterion [F5]. By [F3] the product ρ(s)ρ(t)=resret acts on P=Res+Ret as a rotation of exact order r and fixes P⊥ pointwise, so ρ(s)ρ(t) has exact order r on V. Put A:=ρ(s)ρ(t)=ρ(st), of exact order r; every element of W is of the form A0k or sA0k with A0:=st∈W and k∈Z, because every alternating word in the two involutions is a power of st possibly preceded by s. Hence ρ(W)={Ak, ρ(s)Ak:0≤k<r}: the Ak are distinct because A has exact order r, the ρ(s)Ak are distinct for the same reason, and Ak≠ρ(s)Al because det⁡Ak=1 while det⁡(ρ(s)Al)=−1; so ∣ρ(W)∣=2r and injectivity of ρ [F4] gives ∣W∣=2r, W being the dihedral group I2(r). For r=∞ the same factorisation with ρ(s)ρ(t) of infinite order [F3] exhibits infinitely many distinct elements and W is the infinite dihedral group, completing (ii) and (iii).

3.1F1F5F7step 2.1algebra∎

(The low-rank coincidences and the products (iv).) Reading the labelled graphs: I2(3) is a single edge labelled 3, which is the one-edge path A2; I2(4) is a single edge labelled 4, which is B2, also written C2; I2(6) is a single edge labelled 6, conventionally G2; m(s,t)=2 draws no edge [F1], so the two-vertex diagram with m=2 is the disconnected diagram A1×A1, which is the direct product of two one-vertex groups by the component statement [F7]; and I2(5)=H2 by the rank-two naming convention. The one-vertex diagram A1 has B=(1), which is positive definite [F5], and presentation ⟨s∣s2=1⟩, so W≅Z/2; the disconnected two-vertex diagram has group (Z/2)×(Z/2), of order 2⋅2=4 [F7]. These coincidences and the group orders are (iv), and the group I2(r) of 2.1 [step 2.1] is the dihedral group appearing under both names in the classification.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Gram determinants and principal minors of the non-crystallographic types H3 and H4

Example

Let Γ=H3 be the path s1−s2−s3 with labels m(s1,s2)=3, m(s2,s3)=5, and let Γ=H4 be the path s1−s2−s3−s4 with labels 3,3,5 (Coxeter diagrams: edges, labels, components and finite type); let B be the Coxeter form and C the cosine matrix (The real Coxeter form, its radical, reflections, and form-preserving maps). Using cos⁡(π/5)=(1+5)/4 (derived in Verification 1.1):

(i) H3. The leading principal minors of 2C are 2, 3 and det⁡(2C)=3−5>0; the 2×2 principal minor on the label-5 edge equals 4sin⁡2(π/5)=(5−5)/2>0; the minor on {s1,s3} equals 4. Hence B is positive definite and the Coxeter group of type H3 is finite.

(ii) H4. The leading principal minors of 2C are 2,3,4 (the first three vertices form type A3) and det⁡(2C)=7−352>0. Hence B is positive definite and the Coxeter group of type H4 is finite.

(iii) Excluded neighbours. The overlong paths with labels 3,5,3 and 3,3,5,3 have negative determinant, and the star with a degree-3 vertex whose three incident edges have labels 3,3,5 has the negative witness value 1−(14+14+cos⁡2(π/5))<0; 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 H3, H4 and the three excluded diagrams above, with the Coxeter form B and its cosine matrix C=(B(es,et)); write dk for the determinant of the leading k×k principal submatrix of C.

[F1]

B(es,es)=1, B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t) and B(es,et)=−1 for m(s,t)=∞, without any positivity assumption; non-adjacent distinct vertices have m(s,t)=2 and hence matrix entry 0 (The real Coxeter form, its radical, reflections, and form-preserving maps, Coxeter diagrams: edges, labels, components and finite type).

[F2]

T5(cos⁡θ)=cos⁡(5θ) for every real θ, and the Chebyshev polynomials of the first kind satisfy T0=1, T1=t, Tn+2=2tTn+1−Tn; cos⁡(x+π)=−cos⁡x, cos⁡π=−1; cos⁡(2x)=2cos⁡2x−1; 1−cos⁡2x=sin⁡2x and sin⁡x>0 for 0<x<π; cosine is strictly decreasing on [0,π]; and 2<5<3, 35<7 (Tn(cos⁡θ)=cos⁡(nθ) and Un(cos⁡θ)sin⁡θ=sin⁡((n+1)θ) for every n∈N, 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 a≥0 with (a)2=a; the positives are {x2:x≠0}).

[F4]

Scaling an n×n matrix by 2 multiplies its determinant by 2n, and dk is the determinant of the leading k×k 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).

[F5]

H3 and H4 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)).

[F6]

Laplace expansion along any row or column expresses the determinant as the sum of entries times their cofactors; the cofactor sign is (−1)i+j and the determinant of the empty deleted matrix is 1 (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

1.1F2algebra

(The three trigonometric values and the small determinants.) cos⁡(π/3)=1/2 follows from the double-angle formula cos⁡(2x)=2cos⁡2x−1 at x=π/3 together with cos⁡(2π/3)=cos⁡(π−π/3)=−cos⁡(π/3), which gives 2c2−1=−c, i.e. (2c−1)(c+1)=0, and c=cos⁡(π/3)>−1 because π/3∈(0,π) and cosine is strictly decreasing on [0,π] with cos⁡π=−1 [F2]; thus c=1/2. Also cos⁡(π/5)=(1+5)/4: with c5=cos⁡(π/5), iterating the recurrence of [F2] gives T5(t)=16t5−20t3+5t, so T5(c5)=cos⁡π=−1, i.e. 16c55−20c53+5c5+1=(c5+1)(4c52−2c5−1)2=0 by expansion, while 0<π/5<π/2 gives 0<c5<1 [F2], so c5≠−1, 4c52−2c5−1=0 and (c5−14)2=516; by uniqueness of nonnegative square roots c5=14±54, and the positive value is (1+5)/4 because the other is negative as 2<5 [F2]. Thus sin⁡2(π/5)=1−cos⁡2(π/5)=(5−5)/8>0 [F2]; also 5<3 and 35<7 [F2], by squaring the positive quantities (5<9 and 45<49).

1.2F1F6algebra

(The recurrence without positivity.) For any of the paths in the Example, let Ck be its leading k×k cosine matrix and set d0:=1, d1=1. For k≥2 put a:=cos⁡(π/mk−1). By [F1] the last row has only the potentially nonzero entries −a in column k−1 and 1 in column k. In the deleted matrix for the first entry, the last column has only the bottom entry −a, whose cofactor is dk−2; its determinant is therefore −adk−2 by [F6]. The last-row cofactor sign at (k,k−1) is −1, while the diagonal cofactor is dk−1. Thus Laplace expansion yields dk=dk−1−a2dk−2 [F6]. This identity uses no definiteness assumption and applies equally to the excluded paths.

2.1F1F2F3F4step 1.1step 1.2algebra

(The H3 minors and positive definiteness.) With d0=1, d1=1 and dk=dk−1−cos⁡2(π/mk−1)dk−2 by 1.2 [step 1.2]: d2=1−cos⁡2(π/3)=34, d3=34−cos⁡2(π/5)⋅1=34−3+58=3−58>0 by 1.1 [step 1.1]. Multiplying by 2k [F4] gives for 2C the leading minors 2d1=2, 4d2=3, 8d3=3−5>0, and det⁡(2C)=3−5; the principal submatrix of C on the label-5 edge {s2,s3} is (1−cos⁡(π/5)−cos⁡(π/5)1) with determinant sin⁡2(π/5), so the determinant of the corresponding submatrix of 2C is 4sin⁡2(π/5)=(5−5)/2>0 [F1, F2]. The submatrix of 2C on {s1,s3} is diag⁡(2,2) with determinant 4. All leading principal minors of 2C are positive, so 2C and hence C is positive definite by [F3], and H3 has finite Coxeter group.

2.2F1F2F3F4step 1.1step 1.2algebra

(The H4 minors and positive definiteness.) Using the recurrence of 1.2 [step 1.2] for the path with labels 3,3,5: d1=1, d2=34, d3=34−14⋅1=12, d4=12−cos⁡2(π/5)⋅34=12−3+58⋅34=16−9−3532=7−3532>0 by 1.1 [step 1.1]. The first three vertices carry the all-3 path A3 with the computed doubled leading minors 2,3,4 [F4], and det⁡(2C)=16d4=(7−35)/2>0 because 35<7 [F2]; all leading principal minors of 2C are positive, so C is positive definite by [F3] and H4 has finite Coxeter group.

2.3F1F2F3step 1.1step 1.2algebra

(The excluded neighbours.) The unconditional recurrence of 1.2 [step 1.2] for the path with labels 3,5,3 gives d4=d3−cos⁡2(π/3)d2=3−58−14⋅34=3−2516<0 because 25>3, i.e. 5>3/2, follows from 5>2 [F2]; for the path with labels 3,3,5,3 it gives d5=d4−cos⁡2(π/3)d3=7−3532−14⋅12=3−3532<0 because 5>1 [F2]; a negative leading minor excludes positive definiteness by [F3]. For the star with centre c and neighbours a,b,d, edges ca,cb labelled 3 and cd labelled 5, the vector u=ec+12(ea+eb)+cos⁡(π/5)ed≠0 has non-negative coordinates and satisfies B(u,u)=1+14+14+cos⁡2(π/5)+2(−14−14−cos⁡2(π/5))=1−(14+14+cos⁡2(π/5))=1−58<0 because cos⁡2(π/5)=(3+5)/8 [F2]; by [F3] this star is not positive definite either.

3.1F3F5step 2.1step 2.2step 2.3algebra∎

(Conclusion.) The leading principal minors of 2C computed in 2.1 and 2.2 [step 2.1, step 2.2] are all positive, so B is positive definite for H3 and for H4 by Sylvester's criterion [F3]; by the finiteness criterion [F3] the Coxeter groups of types H3 and H4 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).

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Bn and Cn define the same Coxeter diagram and the same Coxeter group

Example

Let n≥2 and let Bn and Cn denote the Coxeter systems whose diagram is the path on n vertices with labels 3,…,3,4 (Coxeter diagrams: edges, labels, components and finite type). Then:

(i) Same diagram, same system. The Coxeter matrices of Bn and Cn are equal, so the two names denote the same Coxeter system, the same diagram and the same group W; the distinction between the B and C families belongs to root-system data (a long and a short simple root), not to the Coxeter presentation.

(ii) Positivity and determinant. With C the cosine matrix, det⁡(2C)(Bn)=2, while the leading principal minors of 2C are those of the paths Ak (1≤k≤n−1), namely 2,3,…,n, and the full determinant 2. Hence Bn is positive definite, Bn is of finite type, and the groups Bn, Cn are finite of the same order (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite).

(iii) Small ranks. B2=C2=I2(4), and Bn contains An−1=Sn as a standard parabolic; type Cn has the same Coxeter system and the same Coxeter diagram as Bn for every n≥2 (Classification of finite Coxeter systems, including the H and dihedral families (4)).

Facts & Assumptions

Given: n≥2, the path Bn=Cn on vertices s1,…,sn with labels m(sk,sk+1)=3 for k≤n−2 and m(sn−1,sn)=4, the Coxeter form B on V=R{s1,…,sn}, its cosine matrix C=(B(es,et)), and the presented group W.

[F1]

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).

[F2]

B(es,es)=1, B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t) and B(es,et)=−1 for m(s,t)=∞, without any positivity assumption (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F3]

cos⁡(π/4)=2/2; cos⁡(2x)=2cos⁡2x−1, cos⁡(x+π)=−cos⁡x, cosine is even and strictly decreasing on [0,π], and cos⁡π=−1 (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).

[F4]

Laplace expansion along any row or column expresses a determinant in terms of cofactors, with the empty minor assigned determinant 1; scaling an n×n matrix by 2 multiplies its determinant by 2n; and induction on N 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 N (von Neumann)).

[F6]

B2, C2 and I2(4) name the two-vertex diagram with label 4, and the standard parabolic WAn−1 of type An−1 is isomorphic to the symmetric group Sn (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

1.1F1F2F3F4algebra

(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 Ck be its leading k×k submatrix and dk:=det⁡Ck, with d0:=1 and d1=1. For k≥2 put a:=cos⁡(π/mk−1). The last row has only −a and 1 as potentially nonzero entries [F2]. Its diagonal cofactor is dk−1; deleting row k and column k−1 leaves a matrix whose last column has only the bottom entry −a, so a second Laplace expansion gives deleted-matrix determinant −adk−2. The off-diagonal cofactor has sign −1, and therefore dk=dk−1−a2dk−2 [F4], without assuming positivity. To compute the all-3 prefix, put c:=cos⁡(π/3): [F3] gives 2c2−1=cos⁡(2π/3)=−c and c>−1, hence (2c−1)(c+1)=0 and c=1/2. Thus for 2≤k≤n−1 the recurrence is dk=dk−1−14dk−2. Induction, starting with d0=d1=1, gives dk=(k+1)/2k for 0≤k≤n−1, since k2k−1−k−12k=k+12k [F4]. At the final label-4 edge, [F3] gives dn=n2n−1−12n−12n−2=21−n. Consequently the leading minors of 2C are 2kdk=k+1 for 1≤k<n, and det⁡(2C)=2ndn=2 [F4]. This also covers n=2, using d0=1.

1.2F1F6algebra

(Small ranks and the parabolic An−1.) For n=2 the path has the single edge labelled 4, which is the diagram I2(4), and this is the same labelled graph as B2=C2=I2(4) [F1, F6]. The subdiagram on {s1,…,sn−1} is the all-3 path An−1; hence WAn−1=⟨s1,…,sn−1⟩ is a standard parabolic subgroup of W, isomorphic to the Coxeter group of type An−1, which is the symmetric group Sn [F6]. Since the two names share the same labelled graph, type Cn has the same Coxeter system and the same standard parabolic An−1, which is (iii).

2.1F1F5step 1.1algebra

(Positive definiteness, finiteness, and the same order.) By 1.1 [step 1.1] the leading principal minors of 2C are 2,3,…,n and the full determinant is 2, all positive; scaling by the positive factor 2 does not change definiteness, so C has all leading principal minors positive and is positive definite by Sylvester's criterion [F5]. By the finiteness criterion [F5] the group of Bn is finite, and since Cn 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).

3.1step 2.1step 1.2algebra∎

(Conclusion.) The Coxeter matrices of Bn and Cn are equal, so the two names denote the same Coxeter diagram, the same Coxeter system and the same group, and the distinction between the B and C families lies in root-system data rather than in the presentation; the doubled cosine determinant is det⁡(2C)(Bn)=2 with leading minors 2,3,…,n, so Bn and Cn are positive definite and of finite type; and B2=C2=I2(4) while Bn has An−1=Sn as a standard parabolic, with Cn identical.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Path determinants dk=dk−1−cos⁡2(π/m)dk−2 and the three-arm inequality

Example

(i) Path recursion. Let Γ be the path s1−⋯−sn with labels m1,…,mn−1 (n≥1) and cosine matrix C (The real Coxeter form, its radical, reflections, and form-preserving maps, Coxeter diagrams: edges, labels, components and finite type), and let dk be the determinant of the leading k×k principal submatrix of C. Then cos⁡(π/∞):=1 is the coefficient convention. Then d0=1, d1=1, and dk=dk−1−cos⁡2(π/mk−1) dk−2(2≤k≤n). For the path with all labels 3 this gives dk=(k+1)/2k and det⁡(2C)=n+1; for a path whose only label ≥4 is m on the edge between the i-th and (i+1)-st vertices, positive definiteness requires the constraint (i+1)(j+1)>4ijcos⁡2(π/m) of Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (5)(ii), with j=n−i.

(ii) The three-arm inequality. For the star with central vertex v and three arms of p,q,r≥1 vertices, all edges labelled 3, positive definiteness is equivalent to 1p+1+1q+1+1r+1>1.

(iii) Numerical checks. The triples satisfying the inequality are, up to order, (1,1,r) for every r≥1 (type Dr+3), (1,2,2) (type E6), (1,2,3) (type E7) and (1,2,4) (type E8); the boundary cases (1,2,5) (type E9), (2,2,2) and (1,3,3) give equality 1, and the overlong star (1,2,5) 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 V=RS with Coxeter form B and cosine matrix C=(B(es,et))s,t∈S, the standard basis vectors es, and the leading minors dk of C.

[F1]

An edge of the diagram is present exactly when m(s,t)≥3 and carries the label m(s,t); the subdiagram on a vertex subset is the induced labelled graph (Coxeter diagrams: edges, labels, components and finite type).

[F2]

B(es,es)=1 and B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t); B(es,et)=−1 for m(s,t)=∞; B is symmetric and bilinear, so B(u,w)=∑s,t∈Su(s)w(t)B(es,et), and the es form a basis of V (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F4]

For every row i the determinant expands as det⁡A=∑kaikCik(A), where Cik(A) is the cofactor and A(i,k), the matrix with row i and column k 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).

[F5]

Determinant is multilinear in the columns and normalized, so multiplying an n×n matrix by the scalar 2 multiplies its determinant by 2n, 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).

[F7]

For c:=cos⁡(π/3) one has cos⁡(2π/3)=2c2−1 and cos⁡(2π/3)=−cos⁡(π/3)=−c, cosine is strictly decreasing on [0,π] and cos⁡π=−1 (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, B(u,w)2≤B(u,u)B(w,w) with equality exactly when u,w are linearly dependent (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

[F8]
[F9]

The standard irreducible diagrams of the classification are An (all labels 3), Dn (arms 1,1,n−3), E6,E7,E8 (arms 1,2,2; 1,2,3; 1,2,4), and the types Dr+3, E6,E7,E8 carry those diagrams (Classification of finite Coxeter systems, including the H and dihedral families (1)).

[F10]

The star with arms 1,2,5 has the explicit non-positive vector of A cycle and an overlong arm: explicit non-positive witnesses (ii), and the triple (1,2,5) fails the inequality of (ii) with equality.

Verification

1.1F1F2F4algebra

(The recursion by expansion.) Set d0:=1; the leading 1×1 matrix is (1), so d1=1 [F2]. For 2≤k≤n let Ck be the leading k×k submatrix and put a:=cos⁡(π/mk−1), with a=1 for an infinite label. By [F1, F2] its diagonal entries are 1, its adjacent off-diagonal entries are −cos⁡(π/mj) and all others are 0. In the last-row Laplace expansion [F4], the diagonal entry contributes dk−1. Deleting row k and column k−1 leaves a matrix whose last column has only its bottom entry −a; expanding that column gives determinant −adk−2, also for k=2 with the empty minor. The last-row cofactor sign at (k,k−1) is −1, so the other contribution is −a2dk−2. Therefore dk=dk−1−a2dk−2 without any positivity assumption.

1.2algebra

(The integer cases.) Let 1≤p≤q≤r satisfy the inequality of (ii). If p≥2 then 1p+1+1q+1+1r+1≤3⋅13=1 with equality only for p=q=r=2, so p=1. Then 1q+1+1r+1>12: for q=1 this holds for every r≥1; for q=2 it says 1r+1>16, i.e. r<5, so r∈{2,3,4}; and for q≥3 the sum is at most 14+14=12, a contradiction. Hence the triples are (1,1,r) for r≥1, (1,2,2), (1,2,3) and (1,2,4) up to order. The equality cases 1p+1+1q+1+1r+1=1 are found the same way: p≥3 gives a sum ≤34<1; p=2 forces q=r=2; and p=1 forces 1q+1+1r+1=12, i.e. q=2,r=5 or q=3,r=3. Thus (2,2,2), (1,2,5) and (1,3,3) are exactly the boundary triples.

2.1F5F6F7F8step 1.1algebra

(The all-3 path.) First cos⁡(π/3)=1/2: putting c=cos⁡(π/3), [F7] gives 2c2−1=cos⁡(2π/3)=−c, so (2c−1)(c+1)=0, and c>−1 because 0<π/3<π, cosine is strictly decreasing on [0,π] and cos⁡π=−1 [F7], hence c=1/2. If every label is 3, then cos⁡(π/mj)=1/2, so the recursion of 1.1 reads dk=dk−1−14dk−2 with d0=d1=1; by the induction principle [F8] the formula dk=(k+1)/2k holds for all k≥0, since k2k−1−14⋅k−12k−2=k+12k. Hence dk>0 for every k, the leading principal minors of 2C are 2kdk=k+1>0 by [F5], and 2C and C are positive definite by [F6]; in particular det⁡(2C)=2ndn=n+1.

3.1F4F6F8step 1.1step 2.1algebra

(One large edge: the two-subpath formula.) Let the path have all labels 3 except one edge labelled m between the i-th and (i+1)-st vertices, and put c:=cos⁡(π/m), j:=n−i≥1. Write δk:=(k+1)/2k for the determinant of an all-3 path on k vertices, including δ0=1, as proved in 2.1 [step 2.1]; these are distinct from the leading minors dk of the labelled path. Then det⁡C=δiδj−c2 δi−1δj−1. Proof by induction on j [F8], writing C(i,j) for this matrix: for j=1 the large edge is the last one and expansion along the last row [F4] gives det⁡C(i,1)=δi−c2δi−1=δiδ1−c2δi−1δ0; for j=2 the last edge has label 3, so the recurrence of 1.1 [step 1.1] gives det⁡C(i,2)=det⁡C(i,1)−14δi=δi(δ1−14δ0)−c2δi−1, which is δiδ2−c2δi−1δ1 since δ2=34; for j≥3 the last edge again has label 3, so det⁡C(i,j)=det⁡C(i,j−1)−14det⁡C(i,j−2), and substituting the induction hypothesis and the recursion δj=δj−1−14δj−2 of 2.1 [step 2.1] gives the formula. With δk=(k+1)/2k of 2.1 [step 2.1] this is det⁡C=(i+1)(j+1)−4ijc22 n; and since positive definiteness of the path would give det⁡C>0 by [F6], such a path satisfies (i+1)(j+1)>4ijcos⁡2(π/m), which is the constraint of Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (5)(ii).

3.2F1F2F6step 2.1algebra

(The arm vectors.) For the star of (ii) with centre v and arm spans A1,A2,A3 on the three arms, V=Rev⊕A1⊕A2⊕A3 and the arm spans are pairwise B-orthogonal, because distinct arms share no edge [F1, F2]. On the arm with vertices s1,…,sp (sp adjacent to v) put w:=∑k=1pk esk. Then B(w,w)=∑k=1pk2−∑k=1p−1k(k+1)=p2−∑k=1p−1k=p(p+1)2 and B(ev,w)=−p2 by [F2], and for every u=∑k=1pukesk the identity B(w,u)=p+12 up holds, because the coefficient of uk in B(w,u) is k−k−12−k+12=0 for 1<k<p (also for k=1 when p>1), while the coefficient of up is p−p−12=p+12; for p=1 the coefficient is 1=(p+1)/2 directly. In particular B(ev,u)=−up2=−B(w,u)p+1 on the arm span. By 2.1 and [F6] the form restricted to each arm span (an all-3 path) is positive definite; hence B is positive definite on all of A=A1⊕A2⊕A3, since a nonzero element z1+z2+z3 has some nonzero component and B(z,z)=∑iB(zi,zi)≥B(zj,zj)>0.

4.1F2F6F7step 3.2algebra

(Completing the square: equivalence of positive definiteness and the inequality.) Keep the notation of 3.2 [step 3.2] with arms of p1,p2,p3 vertices and vectors w1,w2,w3, put μ:=∑ipi2(pi+1) and wˉ:=−∑iwipi+1∈A:=A1⊕A2⊕A3, so that wˉ≠0 because its components in the distinct summands are the nonzero multiples −wi/(pi+1). Then B(wˉ,u)=B(ev,u) for every u∈A by the last identity of 3.2 [step 3.2], and B(wˉ,wˉ)=∑ipi(pi+1)/2(pi+1)2=μ. Since wˉ is a nonzero vector of A, on which B is positive definite [step 3.2], every u∈V has a unique form u=αev+γwˉ+z with α,γ∈R, z∈A and B(wˉ,z)=0: the ev-coordinate α is forced, and u−αev∈A has the unique orthogonal decomposition γwˉ+z along wˉ in the inner product space (A,B), with γ=B(u−αev,wˉ)/B(wˉ,wˉ) and z=u−αev−γwˉ. Then B(u,u)=α2+2α(γB(ev,wˉ)+B(ev,z))+γ2B(wˉ,wˉ)+B(z,z)=α2(1−μ)+μ(γ+α)2+B(z,z), because B(ev,wˉ)=B(wˉ,wˉ)=μ and B(ev,z)=B(wˉ,z)=0 [F2]. If 1−μ>0 then B(u,u) is a sum of three terms that are ≥0 and is 0 only when α=0, γ=−α=0 and z=0, i.e. only for u=0; conversely, if 1−μ≤0, then u=ev−wˉ≠0 (its ev-coordinate is 1) has B(u,u)=1−μ≤0, so B is not positive definite [F6]. Hence B is positive definite if and only if 1−μ>0, and 1−μ>0 is equivalent to ∑ipipi+1<2, i.e. to 3−∑i1pi+1<2, which is the inequality of (ii). When B is positive definite, the same identity exhibits the strict Cauchy-Schwarz bound B(wˉ,wˉ)<B(ev,ev)=1 of the projection of ev onto A used in Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (6), strict because ev∉A [F7].

5.1F9F10step 1.1step 1.2step 2.1step 3.1step 3.2step 4.1∎

(Conclusion.) The recursion and the all-3 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 (i+1)(j+1)>4ijcos⁡2(π/m) 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 (1,2,5) is the one with the non-positive vector of A cycle and an overlong arm: explicit non-positive witnesses [F10]; the names Dr+3,E6,E7,E8 of the surviving triples are those of the classification [F9].

Sources