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.
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.
Depends on
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- Parity and the Pythagorean identity for sine and cosine
- 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
- Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
- Pi as twice the smallest positive zero of cosine
- Tangent, cotangent, secant, and cosecant on their exact natural domains
- The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
- Root normals inside the moved space, factorizations into reflections, and independent normals
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3
- Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound
- Classification of finite Coxeter systems, including the H and dihedral families
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- The root-length criterion and faithfulness of the canonical reflection representation
- Double-angle and quadratic power-reduction identities
- Cosine has a smallest positive zero, lying strictly between zero and two
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
130 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
- T. Brady and C. Watt, Lattices in finite real reflection groups (arXiv:math/0501502) (standard reference, not scraped)
- R. W. Carter, Conjugacy classes in the Weyl group, Compositio Mathematica 25 (1972) 1-59 (Numdam full text) (standard reference, not scraped)