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 vector with mixed signs is not a root, while every root has a sign
Example
Let with , , the Coxeter form and the root system of the canonical reflection representation (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone). Then:
(i) the vector has coefficient at , so : it has mixed signs;
(ii) consequently , although it is nonzero and -non-isotropic, because by Root sign coherence and the action of simple reflections on positive roots (2) every root lies in or in ; explicitly while every root has -norm (Descent of the reflection representation, unit root norms, and conjugation of reflections (3)), so fails both the sign test and the norm test;
(iii) for one has and the comparison case has and lies in ; for one has and still fails to be a root.
Facts & Assumptions
Given: a two-element set with , the space with basis , the Coxeter form , the canonical reflection homomorphism , the root system and the positive cone .
and with equal to when and to when ; the reflection with normal is , so ; and with (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone).
Every root lies in or in , and not in both; every root satisfies ; (Root sign coherence and the action of simple reflections on positive roots, Descent of the reflection representation, unit root norms, and conjugation of reflections).
For every and every generator one has or , and if and only if ; moreover for the root (The rank-two half-space alternative and the chamber-length induction , , Root sign coherence and the action of simple reflections on positive roots).
The simple generators are distinct in , so , and ; moreover implies (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action, Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The addition formulas , hold for all real ; , and ; and ; cosine is strictly decreasing on ; and (The addition formulas for sine and cosine, Parity and the Pythagorean identity for sine and cosine, Quarter-turn values and shifts by pi/2 and pi, Signs, monotonicity intervals, and ranges of sine and cosine, Pi as twice the smallest positive zero of cosine).
Every equals ; evaluating at and shows that these coordinates are unique (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (1)).
Verification
Set-up. By [F1] the vector has coordinates and in the basis , and . The constant is positive: for , while for finite one has and cosine is strictly decreasing on with by [F5], so . Hence , so and is -non-isotropic.
The vector has mixed signs. By [F6] the coordinates of a vector in the basis are unique, so exactly when both coordinates of are and exactly when both coordinates are . Since has the coordinates and , it lies in neither cone: . This is (i).
The value . For with and , the addition formulas and of [F5] give and , hence . Applied to and combined with this gives , that is . Since by 1.1, the factor does not vanish, so and . Consequently , , and ; moreover .
is not a root. By [F2] every root lies in or in , and every root has -norm . By 1.2 the vector lies in neither cone, so it is not a root; independently, by 1.1 its -norm is , so it also fails the norm test for roots. This is (ii).
The comparison vector is positive. By [F3] applied to either or . In the second case by [F3], so and hence by [F4], which gives and contradicts ; therefore , and the equivalence of [F3] with gives . By 2.1, when , so with .
The cases and . If then by 2.1, so , and is a positive root of -norm by 3.1. If then by [F1], so , and by 2.2. With (i) from 1.2 and (ii) from 2.2, all three clauses are verified: the sign theorem applies to the -orbit of the simple roots, not to arbitrary vectors of .
Depends on
- Root sign coherence and the action of simple reflections on positive roots
- The real Coxeter form, its radical, reflections, and form-preserving maps
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- The rank-two half-space alternative and the chamber-length induction $(P_n)$, $(Q_n)$
- Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action
- The addition formulas for sine and cosine
- Parity and the Pythagorean identity for sine and cosine
- Quarter-turn values and shifts by pi/2 and pi
- Signs, monotonicity intervals, and ranges of sine and cosine
- Pi as twice the smallest positive zero of cosine
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
83 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
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (Princeton University Press, 2008; author's complete institutional PDF) (standard reference, not scraped)
- Anders Bjorner and Francesco Brenti, Combinatorics of Coxeter Groups (Graduate Texts in Mathematics 231, Springer 2005; author-hosted full PDF) (standard reference, not scraped)