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.
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.
Depends on
- Laplace expansion computes the determinant along every row and every column over a commutative ring
- Double-angle and quadratic power-reduction identities
- Signs, monotonicity intervals, and ranges of sine and cosine
- Classification of finite Coxeter systems, including the H and dihedral families
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
- Coxeter diagrams: edges, labels, components and finite type
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- 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
- Quarter-turn values and shifts by pi/2 and pi
- Graph isomorphisms, automorphisms and graph complements
- Positive and negative definiteness, the inertia $(p,q,r)$, rank $p+q$, and signature $p-q$ of a real symmetric bilinear or quadratic form
- Exclusions for positive definite diagrams: trees, valency, labels, chains and arms
- The finite Viete cosine product and its positive nested-radical factors
- Parity and the Pythagorean identity for sine and cosine
- 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 $\mathbb{N}$ (von Neumann)
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
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
- Jean Michel, Lectures on Coxeter groups (Beijing lecture notes, April-May 2014) (standard reference, not scraped)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (first-edition author manuscript, 2007-2008) (standard reference, not scraped)