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.
B-tilde versus C-tilde: the n=2 coincidence and the duality behind the difference
Example
Compare the standard affine diagrams and (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (2),(3)) and the crystallographic scalings that produce them:
(i) The coincidence at . is the three-vertex path with edge labels : the member is defined by the coincidence convention, and both its edges carry label . Both arise from the same finite type: and are the same Coxeter system (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (1) and the finite coincidence of Classification of finite Coxeter systems, including the H and dihedral families (4)), and the - and -scalings with are exchanged by duality (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (4)).
(ii) The difference for . has a vertex of degree (the vertex carrying the extra ) and exactly one edge labelled , namely ; is a path and has exactly two edges labelled , at its two ends. Hence for the two diagrams are not isomorphic: any graph isomorphism maps each vertex's neighbor set bijectively to the corresponding neighbor set and therefore preserves degrees, but the degree sequences disagree.
(iii) Both are affine. By Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (3), the cosine matrices of and are positive semidefinite of corank one with positive kernel vectors; concretely, for the vector (first and last entry ) lies in the kernel, and for with the vector (entries ordered , i.e. , , ) lies in the kernel; in both cases the entries are positive.
(iv) Why the Coxeter diagram alone does not decide the lattice. and have the same finite Coxeter diagram but their two crystallographic scalings are dual (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (4), Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices); the fundamental alcoves are bounded -simplices (triangles when ) (Highest-root dominance and the fundamental alcove (2)), but the affine Weyl groups and (Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group, Affine reflections: translation form, involutivity, local finiteness, and (4)) realize the two different Coxeter diagrams and for (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1),(5), Alcove transitivity, the affine Coxeter presentation, and the length function (2)), and for they are not isomorphic even as abstract groups: has a maximal finite subgroup of order , whereas has none, as proved below. Thus the Coxeter diagram of the finite system does not determine which lattice acts.
(v) Convention warning. The labels here are orders of facet-reflection products, i.e. Coxeter labels () (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1)), not Lie-theoretic bond multiplicities; the extended affine Weyl group is a further, different object (Alcove transitivity, the affine Coxeter presentation, and the length function (4)).
Facts & Assumptions
Given: The two affine families and their finite root-system scalings.
The coincidence is a definition, and for the recipe has one branch and one -edge, while the recipe is a path with two -edges (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (2),(3),(7)).
The cosine matrices of both standard affine diagrams are positive semidefinite of corank one and have positive kernel vectors (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (3)).
The affine facet-product labels give the standard affine diagrams of the corresponding root systems, which occur in the list; their convention is shared (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1),(4)).
The finite systems have the same Coxeter diagram and its label- path admits the two dual crystallographic scalings (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (1),(4)).
By the finite-type and crystallographic theorems, the standard finite Coxeter groups of types , and for are isomorphic to Weyl groups of based crystallographic root systems with the standard generators matched to simple-root reflections. The based-root uniqueness theorem identifies these with the coordinate root systems of [F6] when the Cartan matrices agree (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (2), The Cartan matrix determines a based root system).
The coordinate root sets and simple roots for are those displayed in Classical root systems in coordinates.
The coroot is , and the affine Weyl group has the Euclidean decomposition (Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group, Affine reflections: translation form, involutivity, local finiteness, and (4)).
The affine-Gram classification theorem supplies the faithful slice model, its affine relation and intersection formula, strict closed fundamental domains, and finiteness of proper standard parabolics (Classification of affine Coxeter diagrams and their Euclidean simplex realization (2)–(4)).
The finite Coxeter classification gives , and (Classification of finite Coxeter systems, including the H and dihedral families (4)).
Support determines standard-parabolic membership and the restricted Coxeter presentation (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)–(2)).
The affine facet reflections generate the affine Weyl group, have the exact Coxeter presentation and act simply transitively on alcoves; the comparison clauses distinguish the extended lattice group (Alcove transitivity, the affine Coxeter presentation, and the length function (1)–(4)).
, , cosine is strictly decreasing on , , , and every nonnegative real has a unique nonnegative square root (Pi as twice the smallest positive zero of cosine, Quarter-turn values and shifts by pi/2 and pi, Signs, monotonicity intervals, and ranges of sine and cosine, Double-angle and quadratic power-reduction identities, Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions, Square roots exist: a unique with ; the positives are ).
Proof
At , [F1] specifies the common path; [F3] realizes it from each dual root-length assignment. The finite systems coincide by [F9], and their two scalings are exchanged by [F4]. For , the graph has a degree-three vertex and one -edge, whereas the graph has degrees at most two and two -edges. A graph isomorphism would biject each vertex's neighbors and preserve degree, which is impossible for these degree sequences.
By [F12], if and , then and : positivity follows from and strict decrease to ; for the double-angle identity gives , and for it gives , so and . Put . For , take endpoint coordinates and all interior coordinates . Each endpoint equation is ; at the central equation is ; for , a vertex next to an end has equation , and any other interior vertex has equation . For , , use , , . At each branch leaf the equation is . At , the equation is when , and when . Every intervening chain vertex (if any) has equation ; the vertex for has equation , and the final vertex has equation . Thus the displayed vectors are positive kernel vectors; [F2] independently gives the semidefinite corank-one assertion. At use the vector for both names.
In the coordinate models [F6], for the finite Coxeter groups of type or are identified by [F5] with the Weyl groups on the displayed root sets. Their simple reflections interchange neighboring coordinates or change the last coordinate's sign; conjugating by permutations permits each sign change. Every root reflection is a signed permutation, and these generators give all signed permutations, so the group has order . For , , [F5,F6] identify the finite Coxeter group with the Weyl group of roots . Its adjacent swaps and the reflection in generate exactly the permutations with an even number of sign changes: composing that reflection with the swap gives a double sign change, and conjugates give all pairs. Every root reflection has even sign parity, so the group has order . For , the remaining all- path is by [F9]; its coordinate roots on the sum-zero subspace of give all transpositions of four coordinates, so its group is of order . A one-vertex factor has the sign reflection group of order , and the rank-zero group is trivial.
Every finite subgroup of either affine group fixes a point: average the finite orbit for any ; affine linearity makes its barycentre fixed by . By [F8]'s strict closed fundamental domain, conjugate this point into . For , let be the types of facets containing . The affine relation in [F8] gives . The intersection formula in [F8] and support criterion [F10] show : if , then , so every type in is in , hence ; conversely every generator indexed by fixes . This stabilizer is finite by [F8]'s proper-parabolic clause. The face containing has a vertex ; all its containing facet reflections fix , so . Applying the same stabilizer identity to shows , a finite proper parabolic. At a vertex , the incident facets have a unique intersection, so their normals span the ambient direction space and their reflections have common fixed-point set exactly . If a finite group contained , its barycentre would be fixed by this stabilizer, hence would equal ; the group would then be contained in . Thus every vertex stabilizer is maximal finite, and every maximal finite subgroup is conjugate to one.
Set and let . Deleting the endpoint of the -edge from leaves the finite all- graph (at , the path ). Its parabolic is the stabilizer of the opposite vertex, hence maximal finite by Step 1.4, and has order by Step 1.3. Deleting vertex , , from leaves two finite terminal- paths of ranks and , interpreted as or rank-zero trivial blocks at the ends. Its vertex stabilizer has order by the restricted presentation [F10] and Step 1.3; the two blocks commute and their presented group is the direct product. At this is . For , : the ratio shows the binomial coefficients increase to the middle and then decrease symmetrically, so their minimum on these indices is . Hence the order is at most . By Step 1.4 these are all maximal finite subgroup orders in . The two groups therefore cannot be abstractly isomorphic, since an isomorphism preserves finiteness, maximality and subgroup order.
The different coroot lattices can also be seen directly. For with short roots , its coroots are and , whose integer span is : the generators have even sum, and subtracting for leaves an even multiple of . For with long roots , their coroots include all , so the lattice is . Both finite Weyl groups are the same signed permutation group by [F6], and [F3] identifies their affine facet diagrams with the standard diagrams; Step 1.1 shows these differ in degree data. Step 2.1 proves the stronger abstract distinction for . Their chambers have dimension ; when the common affine diagram yields isomorphic Coxeter groups by [F3,F11] despite the dual coordinate normalizations. The decomposition [F7] identifies the translation lattices in these semidirect products with the two coroot lattices just computed. Finally, label is the actual product order by [F3], not a bond multiplicity, and the extended weight-lattice group is a distinct comparison object by [F11]. All comparisons use finite coordinates and averaging, without Choice.
Depends on
- The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde
- Crystallographic alcove diagrams: the affine list realized by Weyl types A–G
- Crystallographic finite type: the Weyl types, reduced realizations and lattice stability
- The Cartan matrix determines a based root system
- Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices
- Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group
- Highest-root dominance and the fundamental alcove
- Alcove transitivity, the affine Coxeter presentation, and the length function
- Classical root systems in coordinates
- Classification of finite Coxeter systems, including the H and dihedral families
- Affine reflections: translation form, involutivity, local finiteness, and $W_a=Q^\vee\rtimes W$
- Classification of affine Coxeter diagrams and their Euclidean simplex realization
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- 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
- Quarter-turn values and shifts by pi/2 and pi
- Signs, monotonicity intervals, and ranges of sine and cosine
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
150 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
- M. W. Davis, The Geometry and Topology of Coxeter Groups (first-edition author manuscript, Princeton University Press, 2008; 600 PDF pages) (standard reference, not scraped)
- R. Xiong, Lectures on Affine Weyl Groups (complete lecture notes, October 2024; 77 PDF pages) (standard reference, not scraped)