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.
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].
Depends on
- In finite dimension, $W^{\perp\perp}=W$ and $\dim W+\dim W^\perp=\dim V$
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Coxeter diagrams: edges, labels, components and finite type
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Inversions, inversion number, the sign $\operatorname{sgn}(\sigma)=(-1)^{\operatorname{inv}(\sigma)}$, and even and odd permutations
- Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
- Real and complex inner-product spaces and their induced length
- The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- 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
- Cosine has a smallest positive zero, lying strictly between zero and two
- Pi as twice the smallest positive zero of cosine
- Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
93 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
- R. W. Carter, Conjugacy classes in the Weyl group, Compositio Mathematica 25 (1972) 1-59 (Numdam full text) (standard reference, not scraped)
- A. Bjorner and F. Brenti, Combinatorics of Coxeter Groups, Springer GTM 231 (2005), author/class-hosted complete PDF (standard reference, not scraped)