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.
Finite Reflection Length and Orthogonal Moved Spaces — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Canonical Roots, Signs, and Faithful Reflections
- Chains, Antichains, Sperner and Dilworth
- 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
- 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 Fields and Cyclotomic Extensions
- Finite Reflection Arrangements and Spherical Coxeter Complexes
- Finite Reflection Length and Orthogonal Moved Spaces
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Fundamental Trigonometric Identities
- Further Trigonometric Identities and Inverse Functions
- 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
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- 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
- Roots, Rational Powers, and Classical Inequalities
- 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
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- 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 Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Tits Cones, Chambers, and Parabolic Stabilizers
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This companion is a dependency leaf: its three examples use only the theory of finite-reflection-length-and-orthogonal-moved-spaces and that page's prerequisite closure, and no other page or item depends on them. Each example is a complete finite computation.
Simple and reflection lengths of a long transposition in works in type : under the isomorphism , , the reflections are exactly the transpositions, the simple length of a transposition with is its inversion number , and is read off the fixed space of in the sum-zero hyperplane. The long transposition therefore has but , and the longest element has and , while every -cycle has ; the example also exhibits explicitly as a reflection.
A moved-space intersection in that is not the meet works in type inside the sum-zero hyperplane of , under the isometry : the elements and both lie below the -cycle , and their moved spaces are the two planes and , which meet in the line . That line contains no root of , so no element of has it as moved space, the only common lower bound of and is , and the moved space of the meet, , is strictly smaller than the intersection : arbitrary subspace intersection does not compute the meet.
The Wall form and line restrictions of a plane rotation, and the necessity of a common upper bound works in the rank-two system : for the moved space is all of , in oriented orthonormal coordinates is multiplication by with , and the line restrictions are the scalar , so is the bijection from lines to reflections below , with exactly for the root lines. For the pair and satisfies although , , and no element of lies above both; this shows that the common-upper-bound hypothesis in the rigidity statement is indispensable.
The results tested here are proved on the theory page: the Wall form, the subspace restriction and the prefix form of in The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order, the factorizations and independent normals in Root normals inside the moved space, factorizations into reflections, and independent normals, and Carter's formula together with the rigidity statement in Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound. The examples are evidence within their computed scope and do not replace those proofs.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Simple and reflection lengths of a long transposition in
Example
Let be the Coxeter group of type , with , reflection representation with positive definite Coxeter form , reflection set and lengths and (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, Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator, Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound); fix the isomorphism with (Coxeter diagrams: edges, labels, components and finite type, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4), Inversions, inversion number, the sign , and even and odd permutations). Then:
(i) and for the transpositions ; for a transposition with one has .
(ii) For the long transposition the two lengths are while ; explicitly is a reflection and has inversions.
(iii) Under the linear isometry of onto the hyperplane with the standard inner product (Real and complex inner-product spaces and their induced length, Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces), corresponds to the permutation action, so corresponds to the fixed space , of dimension for the cycle count (fixed points included). Since (In finite dimension, and ) and , one has for every . In particular ; for the longest element one has while (the reversal has three cycles), and every -cycle has .
Facts & Assumptions
Given: The type- Coxeter datum and the isomorphism with ; a permutation acts on by permuting coordinates.
extends to an isomorphism , for the inversion number, and generates . Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
, , , and with for adjacent and for non-adjacent generators of . The canonical reflection homomorphism, roots, reflections, and the positive cone The real Coxeter form, its radical, reflections, and form-preserving maps
, and ; every line of is the moved space of a unique reflection of the orthogonal group of . Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
and for , and is the reflection set in which is computed. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
The inversion number of a permutation is the number of pairs with . Inversions, inversion number, the sign , and even and odd permutations
Each is an inner-product-preserving involution with normal . An orthogonal operator with moved line equals and fixes pointwise. Descent of the reflection representation, unit root norms, and conjugation of reflections (1), (2), (4), The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order (3).
Write for the smallest positive cosine zero; , and cosine is strictly decreasing on . Also , , and . Pi as twice the smallest positive zero of cosine Cosine has a smallest positive zero, lying strictly between zero and two Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3 Quarter-turn values and shifts by pi/2 and pi Double-angle and quadratic power-reduction identities Parity and the Pythagorean identity for sine and cosine
Verification
Put . By [F7], gives , while , so and ; also by [F7]. Put for . Then , and for , matching by [F2] and [F7]; since the are linearly independent (their coordinates in the order are for ) and every equals , they form a basis of , so and the map with is a linear isometry onto . For each the transposition preserves , reverses and fixes pointwise, so it is the reflection with normal line ; the image is by [F2] and [F6] likewise an inner-product-preserving involution of that reverses and fixes pointwise, so the two agree on all of . Since is an isomorphism and generates [F1], the homomorphisms and agree on , hence everywhere: for all . The permutation action on is faithful, because if acts trivially then for all , and choosing forces . Therefore for the permutation has moved line for some and fixes the orthogonal hyperplane pointwise, so acts trivially on and ; conversely every transposition equals for , so .
For a permutation the inversion number of the transposition , , is : the pairs with are exactly the pairs with , the single pair , and the pairs with . In particular the transposition has inversions, and the reversal inverts every one of the pairs, so it has inversions, the maximal value; in this is the longest element.
By step 1.1 the fixed space of corresponds to for , and by [F3]. The fixed space of in is spanned by the incidence vectors of its cycles, so it has dimension and its intersection with is defined by the single equation on the cycle coefficients . Every is positive, so fixing one cycle lets its coefficient be solved uniquely from the other coefficients; the intersection therefore has dimension ; hence , with the number of cycles of (fixed points included). In particular a transposition has and , the long transposition has and , the reversal has and , and a -cycle has and .
Collecting the results: by step 1.1 the reflections of are exactly the with a transposition, and each has by step 2.1, which is claim (i)'s first part, while claim (i)'s second part is the inversion count of step 1.2. For the long transposition, by steps 1.2 and [F1] and by step 2.1, and because exhibits as for the element ; this is claim (ii). Claim (iii)'s dimension formula, the values and , and for every -cycle are steps 1.2, 2.1 and [F1].
The Wall form and line restrictions of a plane rotation, and the necessity of a common upper bound
Example
Let , , with the positive definite Coxeter form of the rank-two system , and let (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3), The canonical reflection homomorphism, roots, reflections, and the positive cone, Classification of finite Coxeter systems, including the H and dihedral families); let , and be as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator and The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order, and let , be the reflection set and root system (The inversion formula , the root-reflection dictionary and strong exchange (1)). Use faithfulness of The root-length criterion and faithfulness of the canonical reflection representation (3) to identify with when writing , and for these operators. Then:
(i) , so is not an eigenvalue of , and . In oriented orthonormal coordinates adapted to it is the rotation by , and
so the Wall form satisfies with symmetric part .
(ii) For every line the operator is the scalar on , so is the reflection of the plane with normal line , , and is a bijection from the lines of onto the reflections . Moreover lies in if and only if is one of the root lines , ; so for a line that is not a root line, is an orthogonal reflection whose moved space is but .
(iii) Take and put (the rotation by , the longest element of ). Then , so , while
so and ; in fact and have no common upper bound in , since every has (Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)), so a common upper bound would have to equal both and . Hence the implication fails without the common-upper-bound hypothesis of the rigidity theorem.
Facts & Assumptions
Given: The rank-two datum , , , , , , and the elements , ; , , , , , are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator and The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order.
In the ordered basis one has and with , and is positive definite for finite ; the product has the matrix of determinant , trace and order (that is, and for ). The real Coxeter form, its radical, reflections, and form-preserving maps Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
The type , , is the finite-type diagram with two vertices joined by a single edge labelled ; the corresponding Coxeter system has exactly the two simple reflections , and . Classification of finite Coxeter systems, including the H and dihedral families Coxeter diagrams: edges, labels, components and finite type The canonical reflection homomorphism, roots, reflections, and the positive cone
The Wall form lemma holds on the positive definite plane : (1) and ; (2) satisfies , is nondegenerate, and has symmetric part ; (3) for a line the operator with on satisfies and is invertible, on and on has , and the reflections of the orthogonal group of are exactly the maps for lines ; (4) , and is a bijection from the subspaces of onto with inverse , order-preserving and order-reflecting for inclusion and . The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
Every nonzero moved space of an element of contains a root; for every root the reflection with normal equals with ; the map , , is a bijection, so the root lines are in bijection with ; and is injective. Root normals inside the moved space, factorizations into reflections, and independent normals The inversion formula , the root-reflection dictionary and strong exchange The root-length criterion and faithfulness of the canonical reflection representation
Trigonometry: is twice the smallest positive zero of , which lies in , so , and has no zero in ; for and is strictly decreasing on ; ; and ; ; and where defined. Pi as twice the smallest positive zero of cosine Cosine has a smallest positive zero, lying strictly between zero and two Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3 Parity and the Pythagorean identity for sine and cosine Double-angle and quadratic power-reduction identities , , and Tangent, cotangent, secant, and cosecant on their exact natural domains
Verification
By [F1] the matrix of in the basis has determinant and trace , and has order ; the trace differs from because by [F6], as gives .
Put and ; the square roots are nonzero because and , since and has no zero in by [F6]. A direct computation with [F1] gives and , so is an oriented orthonormal basis, and computing , with : indeed , , and , using and the double-angle identities of [F6]. Hence in these coordinates is the rotation by , and is not an eigenvalue of : the matrix of has determinant , since . Therefore and by F3. Moreover , computed from the displayed rotation matrix, is with , because by the double-angle identities; under the identification of the oriented plane with , the matrix is multiplication by , so is multiplication by , and by the displayed identity together with and , so is multiplication by . The identity with symmetric part is F3.
Part (iii). Take , so and the rotation matrix of step 1.2 gives ; hence for , so . By [F4] and step 1.2, and ; also and , and has moved space because , so . Hence and , so and by [F7]. If some satisfied and , then and by [F4], so [F7] gives and hence ; then , since forces and by [F5], so , contradicting ; thus and have no common upper bound. Finally is the unique longest element. Since and , every word reduces to or with . The four rotations are distinct by the order of ; the four are distinct by cancellation, and the two lists cannot overlap: overlap would give , whereas has moved dimension one by [F3] and [F5], and has moved dimension zero for and two for by the displayed rotation matrices. These eight elements are , because , , and (the relation gives ). A word of length at most three reduces, by cancelling adjacent equal generators, to one of the first seven words; these are distinct from . Thus , and every other element has length at most three.
Part (ii), first half. Let be a line; since by step 1.2, , so the operator of F3 is defined. As is one-dimensional, is multiplication by a real scalar , and the identity of F3 gives , so ; hence acts on as and on as the identity, that is . By F3 , and by F3. The assignment is a bijection from the lines of onto the reflections : F3 gives a bijection from the subspaces of onto whose inverse is and which satisfies , and the one-dimensional subspaces of are the lines, while the elements with are exactly the reflections (the elements and correspond to and and are not reflections, as ).
has exactly elements. Since one has and , and the set contains , , and and is closed under multiplication and inversion, since for every : it is a subgroup of containing and , so . Conjugation by the elements of gives , and , so every element of lies in , while conversely and are conjugates of and ; hence , and these elements are distinct because has order by [F1]. By the bijection of [F5] the plane has exactly root lines, and the lines for are pairwise distinct, so there are infinitely many lines and some are not root lines.
Part (ii), second half. If for a root , then by [F5] the reflection with normal equals ; by step 2.2 this operator is , so . Conversely suppose , say ; then by step 2.2, so the nonzero moved space contains a root by [F5], and is a root line. Hence lies in exactly when is one of the root lines, and for every other line the operator is an orthogonal reflection with moved space such that .
Collecting the verified claims: (i) is steps 1.1 and 1.2; (ii) is steps 2.2, 2.3 and 3.1; (iii) is step 2.1. In particular the converse implication of the rigidity theorem fails in when no common upper bound is available: and satisfy by step 1.2, while and and have no common upper bound in , both by step 2.1.
A moved-space intersection in that is not the meet
Example
Let be the Coxeter group of type , with , with positive definite Coxeter form, reflection set and lengths , and let , , be the type-A isomorphism (Coxeter diagrams: edges, labels, components and finite type, The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4), Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator, Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound). Put
Then:
(i) , , and , : indeed and are reflections, so and display the rank additivity .
(ii) Under the isometry of with and the standard inner product, one has
and is a line containing no root of .
(iii) No element of has moved space : a nonzero moved space of an element of contains a root (Root normals inside the moved space, factorizations into reflections, and independent normals (1)), while this line contains none. Moreover the greatest common lower bound of and in is : any common lower bound satisfies (Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (2)(iv)), so by the same root-existence clause; hence the moved space of the meet, , is strictly smaller than the intersection of the two moved spaces, and arbitrary subspace intersection does not compute the meet.
Facts & Assumptions
Given: The type- Coxeter datum and the isomorphism with ; , , are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator, and acts on by permuting coordinates.
extends to an isomorphism , and generates . Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
If for , then contains a root of . Root normals inside the moved space, factorizations into reflections, and independent normals
, and each line of is the moved space of a unique reflection of the orthogonal group of . The canonical reflection homomorphism, roots, reflections, and the positive cone The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
, , and with for adjacent and for non-adjacent generators of . Also means , and holds exactly when , since only the empty product has length zero. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator The canonical reflection homomorphism, roots, reflections, and the positive cone The real Coxeter form, its radical, reflections, and form-preserving maps Coxeter diagrams: edges, labels, components and finite type
Write for the smallest positive cosine zero; , and cosine is strictly decreasing on . Also , , and . Pi as twice the smallest positive zero of cosine Cosine has a smallest positive zero, lying strictly between zero and two Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3 Quarter-turn values and shifts by pi/2 and pi Double-angle and quadratic power-reduction identities Parity and the Pythagorean identity for sine and cosine
Verification
Put . By [F7], gives , while , so and ; also by [F7]. Put for . Then , and whenever , which by [F6] and [F7] matches ; the are linearly independent, since the coordinates of are , and every equals , so they form a basis of the three-dimensional space and the linear map with is a linear isometry onto . For each the permutation preserves , fixes pointwise and sends to , so it acts on as an orthogonal involution with moved space ; the image is an orthogonal involution with the same moved space by [F5], and by the uniqueness in [F5] the two are equal. Since is an isomorphism [F1] and generates , the two homomorphisms and from to the orthogonal group of agree on , hence everywhere: for all . In particular , because is onto and the transpositions of are the images of the conjugate reflections.
Under the identification of step 1.1, and by [F2]. For the fixed space in of the -cycle is , which meets in , so . For the fixed space in is , whose intersection with is , of dimension ; hence , and the same computation with , gives fixed space of dimension and . Finally and by the multiplication convention applied in : for instance sends , , , , so it is the transposition ; and for a transposition the fixed space in has dimension (inside its coordinates satisfy and for the remaining indices , leaving two free parameters), so .
Since is the line in the model of step 1.1 and is an isometry, is, inside , the orthogonal complement of , namely ; likewise gives . Intersecting the two sets gives , , (the sum condition is then automatic), so is a line.
Since because is an involution, step 2.1 gives , so by the definition of in [F6], and the analogous computation with gives .
By step 1.1 the roots of in the model are the twelve vectors , , and none of these is a real multiple of , so the line of step 2.2 contains no root; hence no has , because a nonzero moved space contains a root by [F3].
Let be a common lower bound of and , so by [F4] and step 2.2. If , then equals that line and is an element with moved space the line, contradicting step 3.2; hence and by [F2]; since , the greatest common lower bound of and is , and is strictly smaller than the line . This verifies (i), (ii) and (iii).
Sources
- R. W. Carter, Conjugacy classes in the Weyl group, Compositio Mathematica 25 (1972) 1-59 (Numdam full text)
- A. Bjorner and F. Brenti, Combinatorics of Coxeter Groups, Springer GTM 231 (2005), author/class-hosted complete PDF
- T. Brady and C. Watt, Lattices in finite real reflection groups (arXiv:math/0501502)