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.
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).
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
- 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
- Root normals inside the moved space, factorizations into reflections, and independent normals
- 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
100 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)