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.
Affine Coxeter Diagrams and Semidefinite Classification — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Affine Coxeter Diagrams and Semidefinite Classification
- Affine Reflections, Coroot Translations, and Alcoves
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Banach Alaoglu Goldstine and Krein Milman
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Canonical Roots, Signs, and Faithful Reflections
- Cartan Subalgebras and Root Space Decompositions
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Crystallographic Root Lattices and Weyl Group Interfaces
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Coxeter Diagrams and Complete Classification
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lie Algebra Representations, Enveloping Algebras, and PBW
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Locally Convex Spaces and Continuous Separation
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Root Systems, Dynkin Diagrams, and the Cartan-Killing Classification
- Roots, Rational Powers, and Classical Inequalities
- Semidirect Products, Automorphism Groups and Split Extensions
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Sine, Cosine, and the Definition of Pi
- Solvable and Nilpotent Lie Algebras
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Finite Abelian Groups
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Tits Cones, Chambers, and Parabolic Stabilizers
- Topological Spaces and Continuity
- Topology of ℝ
- Trees, Forests and Spanning Trees
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Trigonometric and Oscillatory Examples in One Variable
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This companion page is a dependency leaf. Each example uses the theory on affine-coxeter-diagrams-and-semidefinite-classification and its established prerequisite closure. The earlier trigonometric-and-oscillatory-examples-in-one-variable supplies the Lipschitz estimate for cosine used in the finite-dihedral comparison. No theory page depends on examples homed here.
Examples
The examples are listed in current dependency order:
- Reducible positive semidefinite forms: factorwise treatment and the square alcove shows that a reducible semidefinite form and its radical split factorwise.
- The A-tilde 1 infinity edge, separated from finite dihedral families and from the 4-edge separates the infinite-dihedral infinity edge from finite dihedral labels.
- The radical vector of A-tilde 2 and its Euclidean slice computes the radical vector and its Euclidean affine slice.
- B-tilde versus C-tilde: the n=2 coincidence and the duality behind the difference compares the and diagrams, kernel vectors, translation lattices, and abstract affine groups.
- An indefinite Coxeter form: infinite, but not of affine type gives a nondegenerate indefinite form whose Coxeter group is infinite but not affine; it also proves the algebraic angle-sum determinant boundary for finite triangle diagrams without constructing a hyperbolic realization.
Each item states its hypotheses and checks its calculations locally. The page makes no hyperbolic realization claim.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Reducible positive semidefinite forms: factorwise treatment and the square alcove
Example
Let be a Coxeter system with finite and disconnected diagram , whose connected components have nonempty vertex sets (Coxeter diagrams: edges, labels, components and finite type (2)); let , , , and let be the Coxeter form on (The real Coxeter form, its radical, reflections, and form-preserving maps). Here positive semidefinite means for every , corank means , and indefinite means the form takes both positive and negative values. Write and . Then:
(i) Factorwise structure. The form is the orthogonal direct sum on , and with length additive (Disconnected diagrams, direct products, and comparison of invariant forms (1)-(2)). The form is positive semidefinite if and only if every is; it is positive definite if and only if every is; and , so .
(ii) The corank-one criterion. The form is positive semidefinite of corank one if and only if exactly one component form is positive semidefinite of corank one and every other component form is positive definite. The unique corank-one block has connected diagram, hence affine form type by Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1); each positive-definite component is finite by Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1) applied to its restricted Coxeter system. Thus reducible corank-one semidefinite forms consist of one affine component and finitely many finite components.
(iii) Two computations. For with , the block matrix is , its quadratic form is , and it has the positive radical vector . With an additional one-generator component , the block is and the full form has corank one with kernel . With a second two-generator component and , the full radical is , so the corank is two and , where is the infinite dihedral group (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1)).
(iv) The square chamber. Let with its Euclidean metric and . Let be reflection in the vertical sides , and reflection in the horizontal sides . The group is isomorphic to : the two parallel pairs give the two infinite-dihedral factors, and reflections from different pairs commute and have product of order two. The resulting Coxeter diagram is . The -translates of the closed square are all unit grid squares; they cover and have pairwise disjoint interiors. Moreover every -orbit meets in exactly one point, so is a strict fundamental domain in this stated sense. Its four walls form two parallel pairs, and its interior angle at each vertex is .
(v) Consequences. The connected-matrix affine classification applies factorwise: in the positive-semidefinite corank-one case there is exactly one affine component and all remaining components are finite. Any component on which takes a negative value makes indefinite: each component has a vertex with . Two components with nonzero radicals force . No connected affine-form-type condition is imposed on a reducible matrix as a whole.
Facts & Assumptions
Given: A finite-rank Coxeter system , its disconnected diagram with connected components , the coordinate subspaces and Coxeter form as above. In the square calculation, has distance .
For disconnected , commute, their product map is an isomorphism, length is additive, and is an orthogonal direct sum for (Disconnected diagrams, direct products, and comparison of invariant forms (1)-(2)). This is an in-run supplier whose current proof decision is still open; its use is provisional pending that item audit.
The component vertex sets are nonempty and partition , and is spanned by the coordinate vectors indexed by (Coxeter diagrams: edges, labels, components and finite type (2), The real Coxeter form, its radical, reflections, and form-preserving maps). The Coxeter form has and is symmetric bilinear.
The subgroup with generating set is the Coxeter system for the restricted matrix on (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)); for a Coxeter system, its group is finite exactly when its Coxeter form is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)). Both are current in-run suppliers; their uses remain provisional until their item decisions are reconciled.
The radical consists of vectors annihilating every vector, and corank is its dimension (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space).
A finite set of coordinate vectors is a basis of its coordinate span , a subspace of a finite-dimensional space is finite-dimensional, and dimensions of a finite internal direct sum add (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear combination of a finite list, and the span as the smallest linear subspace containing , Linear subspace of a vector space, Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis, If and is a linear subspace of , then is finite-dimensional, , and if and only if , Internal direct sum : the sum is everything and each summand meets the sum of the others only in , The sum of two linear subspaces and the sum of a finite family, If with every finite-dimensional, then is finite-dimensional and ; in particular ).
A Coxeter group is the quotient by the relators and for finite labels ; its universal property extends a generator assignment satisfying these relators to a homomorphism (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The external direct product has coordinatewise multiplication and is a group; a group isomorphism is a bijective group homomorphism; and a generated subgroup is the smallest subgroup containing its stated generators (The external direct product with componentwise multiplication, is a group with identity , coordinatewise inverses, and homomorphic coordinate projections, Group isomorphisms, automorphisms and the set , Monoid homomorphism and group homomorphism, The subgroup generated by a subset, the cyclic subgroup , and cyclic groups, Group and abelian group).
A Euclidean isometry is a bijective distance-preserving map (Isometry, isometric embedding, and the subspace metric on a subset); in particular the coordinate reflections and the explicit maps computed below are checked against the Euclidean distance directly.
The standard diagram is the two-vertex diagram with its single edge labelled (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1)).
Positive definiteness means for every nonzero (Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
Affine form type requires a connected diagram and a positive-semidefinite form of corank one (Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1)).
Every real has a unique integer with (Integer part: for every real there is exactly one integer with ).
Verification
(Definiteness is blockwise.) By [F1], if with , then . If is positive semidefinite, taking supported in one block shows each is positive semidefinite; conversely, if every block is positive semidefinite, every term in the sum is nonnegative. The same one-block test proves that positive definiteness of implies positive definiteness of each ; conversely, if each is positive definite and , at least one , so the corresponding term is positive and all other terms are nonnegative.
(Radicals and coranks add.) Bilinearity and orthogonality give for every . Thus exactly when for every , and the direct decomposition of makes . The vectors for are linearly independent by their coordinates and span by definition, so is finite-dimensional. Each radical is a linear subspace because its annihilation conditions are linear by bilinearity, hence it is finite-dimensional by the subspace dimension theorem. Applying the finite direct-sum dimension formula to these radical subspaces gives . This also covers : then and both sides are zero.
(Group and length factorization.) The factorwise group isomorphism and length-additivity assertion are precisely F1; their current supplier proof remains open for this run, so this citation is used provisionally and is recorded as an open obligation.
(The line reflection factors.) In define , , and . The identity, composites and inverses of bijective distance-preserving maps are again bijective and distance-preserving, so is a group under composition; the four displayed maps are involutive isometries by the coordinate distance formula. Put and . The maps in are exactly with and : composition sends parameters to , the identity has parameters , and the inverse of has parameters , so these maps form a subgroup. The translation is , and its powers, followed by , give every displayed map. By [F6], sending the two Coxeter generators of to defines a homomorphism to : both images are involutions, and the infinity label supplies no further relator. Every word in reduces by to an alternating word, hence to or for some . Their images are respectively and , which are pairwise distinct and exhaust the displayed maps, so the homomorphism is bijective and . The same coordinate calculation gives .
(Corank one.) Suppose first that is positive semidefinite with . Step 1.1 makes every positive semidefinite, and step 1.2 says the nonnegative integers sum to one; hence exactly one is one and all others are zero. For any positive-semidefinite block with zero radical, if , then for every and every real , ; if , sufficiently small of the opposite sign makes the right-hand side negative, a contradiction. Therefore such is in the radical, so zero radical implies for every nonzero , i.e. is positive definite. Conversely, if exactly one block is positive semidefinite of radical dimension one and all others are positive definite, step 1.1 gives positive semidefinite and step 1.2 gives radical dimension one. The forms are symmetric bilinear and the component diagrams are connected by Fact F2. Thus the unique block is of affine form type by Fact F11; the other blocks are finite type by Fact F3.
(The two block examples.) For , the defining entries of give , so it is positive semidefinite with positive radical vector and radical . A one-generator block has matrix , hence is positive definite and has zero radical; with this block the full radical is spanned by . With two blocks, the orthogonal sum has radical spanned by and and has corank two by step 1.2. The group factorization from step 1.3 and the identification in step 1.4 give .
(The square group and its product map.) Let . The groups and from step 1.4 commute elementwise because they act on separate coordinates, their intersection is the identity because a map acting trivially on both coordinates is the identity, and they generate . The map , , is a homomorphism by commutation, is surjective by generation, and is injective since implies . Thus it is an isomorphism by [F7], and step 1.4 identifies both factors with . Within either parallel pair the product is a nonzero translation by two units and has infinite order; across the pairs the reflections commute, and their product is a nonidentity involution because a vertical reflection moves some first coordinate while a horizontal reflection fixes every first coordinate. The products therefore give the disconnected diagram .
(Grid and strict fundamental domain.) The orbit of under is , exactly the unit intervals ; [F12] applied to each real gives , proving coverage of , and the interval interiors are pairwise disjoint. The corresponding statement holds for , so the -translates of are exactly all grid squares, covering with pairwise disjoint interiors. To prove the stronger orbit assertion including boundary points, apply [F12] to and put , ; then and . Its orbit under is ; if , its unique value in is : among the values only qualifies, and among the only possible additional values occur at or and equal that same point. If , the unique value there is . Applying this independently to both coordinates shows every -orbit meets in exactly one point.
(The remaining geometric and factorwise conclusions.) The four side walls are , , , and ; at each of the four vertices one vertical and one horizontal wall meet, so the interior angle is . Step 3.1 proves the precise closed-square tiling and orbit statement in (iv), including boundary points. Clauses (i)-(ii) give the positive-semidefinite corank-one factorization in (v); if one block has a vector of negative quadratic value, the same vector in shows that is indefinite, and if two blocks have nonzero radicals, step 1.2 gives radical dimension at least two. If , then and , so both sides of the equivalence in (ii) are false and the empty direct sums in (i) have value zero. All arguments use finite sums and explicit constructions, so no Choice is used.
The A-tilde 1 infinity edge, separated from finite dihedral families and from the 4-edge
Statement
Let , let , let with coordinate basis , and let be the real Coxeter form. Thus the diagram is the two-vertex standard affine diagram with its single -edge (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1)), and (The real Coxeter form, its radical, reflections, and form-preserving maps (2)). Then:
(i) The degenerate form. is positive semidefinite of corank one, with for . The product of the two generator reflections is represented by a nonidentity unipotent matrix of infinite order. Hence is of affine form type but its Coxeter group is infinite.
(ii) The slice and its reflection action. The slice has coordinate and . Its walls are and , its vertices are and , and is a Euclidean -simplex (The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (2)-(4)). The facet reflections are and . For the left dual action, and . Their group is the rank-one affine reflection group ; it acts simply transitively on the open alcoves
(iii) Finite rank-two labels. If instead , where , then so the Coxeter form is positive definite and has no radical. The presented group is finite: every word reduces to or , and the relation leaves at most elements. For these are the finite dihedral families ; for the diagram is disconnected and the group is . Thus among two-vertex Coxeter diagrams, the only affine one is .
(iv) The label is different. The two-vertex label- diagram is the finite diagram; it is not . In the standard affine extension of or , the added affine vertex gives the three-vertex path with labels , namely (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (7); Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1)).
(v) Source-hypothesis caveat. Davis's Euclidean simplex criterion, Theorem 6.8.12(ii), assumes that every Coxeter label is finite. The -edge case above is established directly. Numerically, the convention agrees with , but the infinite label imposes no finite relator and gives the degenerate matrix in (i).
Facts & Assumptions
Given: The two-element set , the Coxeter matrix with , the coordinate space , its real Coxeter form , and the dual affine slice of Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice.
The Coxeter form has and ; for a unit basis vector the reflection is (The real Coxeter form, its radical, reflections, and form-preserving maps (2)-(3)).
is symmetric and bilinear (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms).
The group is presented by and the relator only when ; an infinite label imposes no relator on the pair (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
Affine form type means a connected diagram and a positive-semidefinite Coxeter form of corank one (Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1)).
For this affine form, the closed slice is a Euclidean simplex with vertices , for , and each generator acts by reflection in its wall (The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (3)-(4)).
is the two-vertex graph with an -edge, and it is the only standard affine diagram with such an edge. The finite label- diagram is the two-vertex diagram, while is the three-vertex path (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1),(7)).
Cosine is strictly decreasing on , and sine is strictly increasing on (Signs, monotonicity intervals, and ranges of sine and cosine).
In the affine highest-root table, both and add a label- edge to their finite label- diagram, giving the path (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1)).
The functions form the coordinate basis of : every function is determined by its two values and is their corresponding linear combination of (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, The vector space of all functions with pointwise operations, and as the case ).
from the defining power series (Sine and cosine defined by their real power series).
Davis identifies the group generated by reflections in a Euclidean interval's endpoints as the infinite dihedral group (Example 6.4.1, printed p. 82).
In type , Xiong describes the affine Weyl group using the coroot lattice (Chapter 2, §§2.2–2.3, PDF p. 11).
Davis's Theorem 6.8.12 assumes that no Coxeter label is (printed p. 102).
Xiong records the low-rank finite Weyl-group coincidence (Chapter 1, Section 1.6, printed p. 4).
Xiong identifies the dihedral group of order with the Coxeter group of type (Chapter 1, Section 1.4, printed p. 3).
Cosine is -Lipschitz: for all real (Sine and cosine are -Lipschitz on ).
is a complete ordered field, so for every there is an integer with (The Cauchy-sequence reals have the least-upper-bound property, The reals form a totally ordered field, For every in a complete ordered field there is a natural with ).
Proof
The matrix in the statement gives . Also and , so the radical is exactly . Thus is positive semidefinite of corank one; the diagram is connected, so the pair is of affine form type by [F4].
In the ordered basis , direct substitution in [F1] gives Both square to the identity. Their product is Since , the presentation in [F3] has no relation beyond the two involutions, so the assignment , defines a representation of . For every integer , (use for ), which is never the identity when . Thus the product is a nonidentity unipotent of infinite order and is infinite.
Here . The slice condition is , so with its points are exactly for . The vertices from [F5] are and ; the alcove inequalities give , and its closure is the Euclidean segment . The two walls are its endpoints and .
For the left dual action, . Since each reflection is involutory, evaluating at gives . Also by [F1], so . Therefore and . Under the left-action convention, , while .
If , then and . By [F7]-[F8] and from [F12], . Therefore where the identity is [F9] and positivity follows from . Moreover the quadratic form is , positive for every nonzero ; thus it has no radical. From [F3], and every word reduces to an alternating word, hence to or ; the finite relator reduces modulo , leaving at most elements. At the generators commute; the presentation maps onto by sending them to the two factors, and the normal-form bound gives at most four elements, so . For , let and define permutations and . They are involutions and , which has exact order . The maps are distinct translations, and the maps are distinct reflections. No reflection is a translation: equality of and at would imply , contrary to . By [F3], these permutations define a homomorphic image of with elements. Together with the upper bound, this proves that is the finite dihedral group of order , with the standard Coxeter notation [F17].
Compositions of and are precisely the maps for : the product is translation by , and composing it with gives every orientation-reversing map of this form. The images of are all integer intervals: translations by give and composing those translations with gives . A positive-orientation map stabilizes only when ; a negative-orientation map sends it to , which cannot equal for integral . Hence the action is simply transitive on these alcoves. This is the rank-one affine reflection group ; its translation subgroup is and its linear part is , hence as in Xiong's rank-one affine Weyl group example.
For , the finite diagram has one label- edge, whereas has one label- edge by [F6]; these labelled graphs are distinct. Xiong's low-rank coincidence [F16] matches the two names and for this finite type. Their rank-two affine extensions have one additional label- edge by [F10], giving the three-vertex path , not .
The matrix entry for is the defining convention in [F1]. For any , [F20] gives , so apply [F19] to choose with . If , then , so . By the Lipschitz bound [F18] and [F12], ; hence , confirming that the matrix convention is the numerical limit. The infinite label still imposes no finite relator by [F3]. By [F15], Davis's cited Euclidean simplex criterion assumes every Coxeter label is finite, so the rank-one -edge case is established directly here. No choice principle is used.
The radical vector of A-tilde 2 and its Euclidean slice
Example
Let , for , so that (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1)), and let be the cosine matrix on (The real Coxeter form, its radical, reflections, and form-preserving maps). Then:
(i) is positive semidefinite of corank one, its kernel is with (Positive radical, corank one, positive definiteness of proper submatrices, and domination exclusions (1)), and all proper principal submatrices of (the rank-two principal minors) are positive definite. The eigenvalue statement behind the corank: for , and ; the determinant is zero and each principal submatrix has determinant (Sylvester's criterion: a real symmetric matrix with is positive definite if and only if all leading principal minors are positive).
(ii) The radical quotient is two-dimensional Euclidean; the affine slice is , i.e. with coordinate sum , and the three vertices of the alcove simplex (The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (3)) are , , (coordinate functionals). The alcove is the standard equilateral triangle: the three side vectors are differences of distinct vertices, each of dual -norm squared , so the side length is (the dual metric is the slice metric, rather than the quotient form applied to the same coordinate tuple).
(iii) The three walls meet pairwise at the angle (their normals are the classes of the , whose pairwise -pairing is ), so each facet-reflection product has order ; the facet reflections generate the faithful affine action of on (The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (4)), in agreement with the constant term -relation .
(iv) Comparison with the crystallographic alcove: is the alcove diagram of the root system by Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1); both alcoves have facet normals with the same Gram matrix and are therefore similar facet-to-facet by Euclidean simplices with the same facet-normal Gram matrix are similar facet to facet; the two reflection groups are conjugate. The alcove of Highest-root dominance and the fundamental alcove (2) in its ambient Euclidean plane is accordingly related to the slice triangle by a similarity matching facets, and the ratio of the side lengths gives the scale factor.
(v) The radical vector is exactly the positive relation among the facet normals: in (The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (2)-(3)), and the property that its coefficients are all positive is what makes a bounded simplex rather than an unbounded cone.
Facts & Assumptions
Given: The three-vertex all- diagram and its displayed form.
The form is the cosine form, whose generator reflections are (The real Coxeter form, its radical, reflections, and form-preserving maps).
The quotient and dual slice metric use and its inverse, not the same coordinate quadratic form on vectors and functionals (Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (3)–(4)).
The slice vertices, simplex normals, faithful action and reflection formulas are The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (1)–(4).
The root system has simple roots , highest root , and the alcove inequalities are , (Classical root systems in coordinates, Highest-root dominance and the fundamental alcove). Its affine facet-normal Gram matrix is the one displayed here (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1)–(2)).
Equal facet-normal Gram matrices give a facet-matching similarity conjugating the reflection groups (Euclidean simplices with the same facet-normal Gram matrix are similar facet to facet).
Proof
For , direct expansion gives . It is nonnegative and vanishes exactly on ; matrix multiplication also gives , so this is precisely the radical. Each two-coordinate principal form is , positive definite; the one-coordinate forms are and the empty case is vacuous. Their determinants are , and the full determinant is zero.
The slice relation is , and [F3] gives its coordinate vertices and triangular closure. Put . Every class in has a unique representative in , obtained by subtracting the mean of its coordinates, so is a linear isomorphism. The direction space consists of functionals with coordinate tuple ; under the representative identification, , so represents using the standard dot product on . For , the matrix in [F1] gives ; hence is represented by , and is represented by . Therefore . Each difference has tuple with one , one and one zero, so its squared length is . All three sides therefore have length in the prescribed Euclidean slice metric.
The inward unit normals are ; their pairings are for distinct indices by [F3]. The walls of the triangle thus meet at interior angle , and composing two line reflections gives rotation by , of exact order three. The facet reflections generate the faithful action by [F3]. The relation among the normals is , with all coefficients one. Its positivity gives the bounded coordinate simplex directly: and bound each coordinate.
In the coordinate plane , the closed root alcove is and . Its vertices are the intersections of pairs of its three wall equations. The equations and , together with the coordinate sum, give . For and , write , ; then , giving . For and , write , ; then , giving . Each point satisfies the remaining inequality. Each difference of two distinct vertices is, up to coordinate permutation and sign, , so its squared length is . By [F4,F5] the root alcove and slice triangle are similar facet to facet, and the similarity from root alcove to slice has scale , since . It conjugates the corresponding reflection groups. This proves all the stated radical, wall, metric and comparison data without Choice.
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.
An indefinite Coxeter form: infinite, but not of affine type
Example
Let with and , so that is the triangle with labels , and let be the cosine matrix Then:
(i) is indefinite: the vector satisfies because and (the value of is derived in the verification, not cited). Since , has both positive and negative values. Its leading principal minors are , , and .
(ii) is infinite, but is not of affine form type: affine form type requires positive semidefinite of corank one (Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1)), and by (i) is negative on some vector. It is infinite by the finite-type criterion (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)): an indefinite form is not positive definite.
(iii) The angle sum of the triangle is , and the form is indefinite and nondegenerate: by (i) while , and ; every nonempty proper principal submatrix is positive definite by Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)(i), whose rank-two computations give determinants and ; the empty principal matrix is vacuously positive definite. No geometric hyperbolic realization is constructed on this page; only the algebraic definiteness type is asserted. For this connected system, the positive-definite, affine-form, and indefinite cases are mutually exclusive: the first is finite, the second is positive semidefinite of corank one, and this example is the infinite indefinite case (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1), Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1), Positive radical, corank one, positive definiteness of proper submatrices, and domination exclusions (1)).
(iv) By contrast the triangle with labels is , positive semidefinite of corank one (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1), Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (3)). For any triangle Coxeter matrix with finite labels , the cosine-form determinant is zero exactly when , and is negative when the sum is below , as calculated in Proof Step 2.2. In particular, is indefinite: for , , where follows from the half-angle identity at (Half-angle identities with the sign determined by the quadrant).
(v) Consequently, in the classification statement of Classification of affine Coxeter diagrams and their Euclidean simplex realization (1) the hypothesis "positive semidefinite" cannot be replaced by "infinite", and a consumer testing a diagram for affine type must examine the definiteness of the whole form and not only the finiteness of proper subdiagrams: here has all proper subdiagrams of finite type (the rank-two subdiagrams , , are all finite), yet is not affine.
Facts & Assumptions
Given: The finite labelled triangle and its form.
The cosine form is a symmetric bilinear form with diagonal one and off-diagonal (The real Coxeter form, its radical, reflections, and form-preserving maps).
Affine form type means connected and positive semidefinite of corank one (Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1)).
A Coxeter diagram joins distinct vertices exactly when their label is at least ; thus this labelled triangle is connected (Coxeter diagrams: edges, labels, components and finite type).
A finite-rank Coxeter group is finite exactly when its Coxeter form is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)).
Every standard parabolic has the restricted Coxeter presentation; for an empty generator set it is the trivial group (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)).
Fifth roots of unity have the form , Euler's identity is , and the double-angle identities hold (The -th roots of a complex number and the distinct roots of unity for every , Euler's formula: for every real , Double-angle and quadratic power-reduction identities).
The defining power series give cosine even, sine odd and (Sine and cosine defined by their real power series).
Cosine strictly decreases on , , , , and sine is positive on (Signs, monotonicity intervals, and ranges of sine and cosine, Quarter-turn values and shifts by pi/2 and pi).
Nonnegative square roots exist uniquely and squaring is strictly increasing on nonnegative reals (Square roots exist: a unique with ; the positives are , Squaring is monotone on the nonnegatives).
The all- triangle is and has a positive-semidefinite corank-one form (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1), Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (3)).
Sine and cosine satisfy their addition formulas (The addition formulas for sine and cosine).
The half-angle identity with its sign determined by the quadrant gives (Half-angle identities with the sign determined by the quadrant).
For two distinct generators with finite label , their rank-two form is positive definite with determinant (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)(i)).
For a connected Coxeter diagram with nonpositive off-diagonal entries, a positive-semidefinite Coxeter form with nonzero radical has corank one and a positive radical vector (Positive radical, corank one, positive definiteness of proper submatrices, and domination exclusions (1)).
The connected positive-semidefinite corank-one Coxeter diagrams are exactly the standard affine diagrams (Classification of affine Coxeter diagrams and their Euclidean simplex realization (1)).
The standard angle constant satisfies (Pi as twice the smallest positive zero of cosine).
Proof
Put . Since and , multiplication by proves . Divide by and put to get . Euler's identity and parity [F6,F7] give , as and cosine is strictly decreasing to [F8]. Hence , so by positivity and uniqueness of square roots [F9]. Double angle [F6] gives ; by [F8] and , so . For , the double-angle identity gives , since the addition formula, parity, and give [F7,F8,F11]; thus and . Finally, for , the double-angle identity gives , so by [F9].
On the form has value , whereas on it has value one. It is therefore indefinite. Expansion of the determinant gives . The empty principal matrix is vacuously positive definite; a one-coordinate principal form is ; and a two-coordinate form is for or , with positive determinant or since . Thus every proper principal submatrix is positive definite. For , ; for nonempty proper , the restricted presentation [F5] and finite-type criterion [F4] make finite. The full group is infinite by [F4], and it is not affine by [F2]. The numerical angle sum is ; no hyperbolic realization is needed for these algebraic conclusions.
The all- triangle is affine by [F10]. For , the same evaluation on is , using [F12] (the value was also computed in Step 1.1); thus it is not positive semidefinite. For any triangle Coxeter matrix with finite labels , put , , and , , . Its cosine-form determinant is , using [F13] for . Since , all three cosines are at least and all three sines are positive [F8]; hence the second factor is positive. The first factor is by the addition formulas and angle-shift values [F7,F8,F11]. Strict decrease [F8] shows the determinant is zero exactly when , and negative when the sum is below . The sum is at most , with equality only for . If it is below , at least one , so its cosine exceeds while the others are at least ; therefore the sum-vector has value , proving indefiniteness. This proves the asserted angle-sum boundary without constructing a hyperbolic triangle.
The Coxeter diagram is connected by [F3]. For this system, the positive-definite case is finite by [F4]. If is positive semidefinite but not positive definite, choose with . For any , positive semidefiniteness gives for every real . If , then either and a of opposite sign makes the expression negative, or and a sufficiently small of opposite sign does so. Thus for all , so ; [F14] gives corank one, and the system is affine by [F2]. Otherwise the form is indefinite and the group is infinite by [F4], but not affine by [F2]. These cases are mutually exclusive. By Step 2.1, the system is in the last case and all its proper parabolics are finite. Thus neither infiniteness nor finiteness of proper subdiagrams can replace positive semidefiniteness in [F15]'s classification. The whole-form calculation, rather than only rank-two tests, is essential. All calculations are explicit and use no Choice.
Sources
- M. W. Davis and G. Moussong, Notes on nonpositively curved polyhedra (Turan Workshop lecture notes, 1998/1999; 65 PDF pages)
- M. W. Davis, The Geometry and Topology of Coxeter Groups (first-edition author manuscript, Princeton University Press, 2008; 600 PDF pages)
- R. Xiong, Lectures on Affine Weyl Groups (complete lecture notes, October 26, 2024; 77 PDF pages)
- R. Xiong, Lectures on Affine Weyl Groups (complete lecture notes, October 2024; 77 PDF pages)