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.
Cartan-number products, allowed edge labels, tree scalings and reflection stability
Statement
Let be a finite set, a Coxeter matrix, the presented group, , the Coxeter form, the canonical reflection homomorphism and the diagram (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Coxeter diagrams: edges, labels, components and finite type), and let be a scaling with scaled simple roots , coroots and Cartan numbers (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
(1) Products. for every ; for distinct with , and for one has and . Moreover if and only if .
(2) Allowed labels and length ratios. Assume that is positive definite and that is crystallographic. Then for all distinct and , according to . If is connected and has an edge of label (respectively ), then that is its only edge of label , and (respectively ) for all ; if has no edge of label , then for all in the same connected component.
(3) Realizations on trees. Let be a forest (disjoint union of trees) all of whose edge labels lie in . Choose a root vertex in each component, set at each root, and for every edge with on the root side and the other endpoint set . Then is positive and crystallographic: on every edge with the root-side endpoint, while for non-adjacent and .
(4) Lattices, integrality and stability. Assume that is crystallographic. Then for all hence and . Consequently and are -stable lattices of rank , , , , and . Here, for , write ; this is defined because preserves and , and . Moreover every element of is an integral linear combination of the whose nonzero coefficients all have the same sign, and for all .
Facts & Assumptions
Given: A finite set , a Coxeter matrix on , the presented group , the space with its Coxeter form , the canonical reflection homomorphism , the diagram , and a scaling with scaled simple roots , coroots and Cartan numbers . In (2) and in the ratio clause below, is assumed positive definite and crystallographic; in (3) is assumed to be a forest with all edge labels in ; in (4) is assumed crystallographic.
is finite and , while for (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
Every element of is a product of elements of , by the definition of the length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
is the unique symmetric bilinear form on with , for finite and for (The real Coxeter form, its radical, reflections, and form-preserving maps).
For , the reflection with normal is (The real Coxeter form, its radical, reflections, and form-preserving maps).
Such a reflection is linear, satisfies , and for all (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).
is the positive cone (The canonical reflection homomorphism, roots, reflections, and the positive cone).
preserves : for all and (Descent of the reflection representation, unit root norms, and conjugation of reflections).
Every root of lies in or in (Root sign coherence and the action of simple reflections on positive roots).
The scaling data: , , and (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
The scaling is crystallographic when all are integers (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
A basis of is linearly independent and spans (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
The functions () form a basis of (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).
In a real inner product space, , with equality if and only if are linearly dependent (Cauchy–Schwarz: , with equality exactly for linearly dependent vectors).
A real inner product space is a real vector space with a positive definite inner product (Real and complex inner-product spaces and their induced length).
A symmetric bilinear form is positive definite when for every (Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
The Coxeter diagram has vertex set , with an edge between exactly when , labelled ; connectivity and components are those of the underlying graph (Coxeter diagrams: edges, labels, components and finite type).
A connected positive definite diagram has at most one edge of label (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms).
A forest is a graph containing no cycle, and a tree is a connected forest (Trees, forests, leaves and isolated vertices).
Every two vertices of a finite nonempty tree are joined by a unique path (Equivalent characterisations of a nonempty tree by unique paths, edge count, minimal connectivity and maximal acyclicity).
and are the power series functions, so (Sine and cosine defined by their real power series).
Cosine is strictly decreasing on (Signs, monotonicity intervals, and ranges of sine and cosine).
for all real (Double-angle and quadratic power-reduction identities).
A connected positive definite diagram contains no cycle (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (2)).
Proof
For all one has ; in particular and .
For distinct with one has and ; for one has and ; and exactly when . Indeed gives , where and only at because is strictly decreasing on with .
The values , , and hold, and for . For the first, ; putting , the supplementary identity at gives while the double-angle identity gives , so and (as and decreases from ) force ; the double-angle identity at gives , and at it gives .
If is positive definite then is a real inner product space, and for linearly independent one has ; moreover for distinct the vectors and are linearly independent.
Let be a forest whose edge labels lie in , with a root chosen in each component. Then each component is a tree, every vertex other than its root has a unique neighbour on its path to that root, and the prescription , determines a unique positive value for every vertex.
Writing for , the reflection formula gives, for all , and .
Assume positive definite and crystallographic. Then for distinct one has , so ; and , with for respectively. The bound uses strict Cauchy-Schwarz in the basis-independent pair ; the four values use step 1.3; and no other occurs because gives (from by decrease of ), so , while gives , so , and gives the product .
Let be a forest with edge labels in and let be the tree scaling of step 1.5. Then is crystallographic: on every edge with the root-side endpoint, and ; for non-adjacent distinct one has ; and .
Assume crystallographic. In the formulas of step 1.6, the coefficients and are integers by [F11], so each generator matrix has integer entries in both bases and . Every is a finite product of elements of [F2], and is a homomorphism with [F6]; therefore the matrices of in both bases have integer entries. In particular, for every and , is an integral linear combination of the . The -basis coefficients of all have one sign because has, in the -basis, coefficients of one sign by [F9] and [F7], and re-expressing in the -basis multiplies the -th coefficient by the positive factor .
Assume crystallographic. Step 1.6 and [F11] give and for all , hence and ; since by [F5], applying gives the reverse inclusions, so both are equalities. Since is generated by and [F2, F6], every preserves and . Because and are bases of , their -spans and are free abelian groups of rank and are -stable.
Assume positive definite and crystallographic, and let be an edge of with label ; put . Then and are negative integers with product , so and ; in particular every edge of label has .
Assume crystallographic. By step 2.3, , hence , and since each also , so . Likewise, for the identity (using preservation of ) shows that each element of lies in by step 2.4, so , while with gives the reverse inclusion; hence . Finally , since for by bilinearity and integrality of the , so each lies in and is an additive subgroup.
Assume crystallographic. For and in one has and , where has integer coefficients by step 2.3.
Assume positive definite, crystallographic and connected. Then has at most one edge of label , every other edge has label and hence squared length ratio ; for any two vertices the squared ratio is the product of the edge ratios along a path, and by [F28] contains no cycle, so such a path meets the unique multi-edge at most once and the product equals when the path avoids the multi-edge and or when it crosses a label- or label- edge. Consequently for all when an edge of label exists, when an edge of label exists, and for all when no edge of label exists.
This completes all four clauses: (1) is steps 1.1 and 1.2; (2) is step 2.1 together with the ratio alternatives of steps 3.1 and their global form 4.1; (3) is steps 1.5 and 2.2; and (4) is steps 1.6, 2.3, 2.4, 3.2 and 3.3.
Remarks
No Axiom of Choice is used. The forest in step 1.5 is finite, so its components form a finite family; choosing one vertex from each nonempty component is finite choice, provable by induction on the number of components. Every path and sum used in the proof is finite, and no arbitrary-index selection is made.
Depends on
- Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- Root sign coherence and the action of simple reflections on positive roots
- Coxeter diagrams: edges, labels, components and finite type
- Exclusions for positive definite diagrams: trees, valency, labels, chains and arms
- Cauchy–Schwarz: $|\langle u,v\rangle|\leq\lVert u\rVert\lVert v\rVert$, with equality exactly for linearly dependent vectors
- Positive and negative definiteness, the inertia $(p,q,r)$, rank $p+q$, and signature $p-q$ of a real symmetric bilinear or quadratic form
- Real and complex inner-product spaces and their induced length
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Quarter-turn values and shifts by pi/2 and pi
- Signs, monotonicity intervals, and ranges of sine and cosine
- Sine and cosine defined by their real power series
- Pi as twice the smallest positive zero of cosine
- Double-angle and quadratic power-reduction identities
- Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions
- Trees, forests, leaves and isolated vertices
- Equivalent characterisations of a nonempty tree by unique paths, edge count, minimal connectivity and maximal acyclicity
Used by
- I₂(5) admits no crystallographic scaling and no reduced crystallographic root system with that base pairing Counterexample
- G2 from I2(6): the scaled realization and its twelve roots Example
- The A₂ root and weight lattices: P/Q has order three Example
- The two realizations of I₂(4): B₂ and C₂ with their lattices and duality Example
- Crystallographic alcove diagrams: the affine list realized by Weyl types A–G Lemma
- Point stabilizers, vertex residues, and rank-two boundary words Lemma
- Crystallographic finite type: the Weyl types, reduced realizations and lattice stability Theorem
Dependency tree · two levels
115 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
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (author-hosted digital edition) (standard reference, not scraped)
- J. S. Milne, Lie Algebras, Algebraic Groups, and Lie Groups (course notes, version 2.00) (standard reference, not scraped)
- Jean Michel, Lectures on Coxeter groups (Beijing lecture notes, April-May 2014) (standard reference, not scraped)