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.
Only finitely many hyperplanes separate two Tits-cone points
PDF p. 8: Lemma 3.5
Statement
Let be a Coxeter system, with geometric roots in the real vector space with simple-root basis , and let be its algebraic dual with the contragredient action. Put and . For put and . Say that separates when and have opposite strict signs.
For , only finitely many hyperplanes in separate and . The generating set may be infinite; in finite rank these conventions agree with the stated Tits-cone and separation definitions.
Statement references
Facts & Assumptions
Each root has exactly one of the two signs, and . For every , the set has cardinality and is therefore finite. Root-sign and inversion-length facts
Every vector in the geometric representation is a finite linear combination of simple roots. Each root is the image of a simple-root basis vector under an invertible representation map, and for the contragredient action. Coxeter-system, roots, length and weak-order conventions
In finite rank, the nonnegative chamber, its translates, root hyperplanes and opposite-strict-sign separation are the conventions in the cited definitions. Reflecting hyperplanes, fundamental chamber and Tits cone Separation by a hyperplane
Proof
Given: The Coxeter system, root notation and points in the Statement.
Proof technique: direct.
Goal: Show that the set of separating root hyperplanes is finite.
Independence of the root representative. Every root is nonzero, since it is an invertible image of a basis vector by [F2]. A nonzero simple-root coefficient of gives, by scaling the corresponding coordinate functional, an with . For every , the vector belongs to ; hence and is a linear hyperplane. If another root has , applying evaluation at to this vector gives for all , where . Evaluation at is nonzero by the same coordinate argument, so . Consequently , and opposite strict signs are independent of the root representative. This argument works for any rank and uses only coordinate functionals on the given basis.
For any choose and with . If and , then by [F2]. A positive root is a finite nonnegative linear combination of simple roots, so evaluates it nonnegatively. By the sign decomposition in [F1], must therefore be negative. Hence is contained in the finite inversion set .
For each separating hyperplane , one of and is positive by [F1], and both define the same hyperplane. For that positive root , opposite strict signs imply or . Thus every separating hyperplane is the image, under , of a member of the union of the two finite sets obtained in 1.2 for and . That union and its image are finite, proving the claim. The identification in [F3] gives the finite-rank formulation in the article's geometric conventions.
Depends on
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.
Sources
- Normalisers of parabolic subgroups of Artin–Tits groups and Tits cone intersections · PDF p. 8, Lemma 3.5