Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

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

Sources