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 geometric representation on the simple-root basis over a common splitting field, and the root set
Definition
Let be a finite Coxeter matrix and let be the group presented by it as in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups.
A common splitting field. Put , the product over all unordered pairs with and (an empty product when ). Let be a splitting field of over (The rationals as equivalence classes of pairs of integers, The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution, Over an integral domain, degrees add under multiplication of nonzero polynomials, For every field , is a unique factorisation domain, Every nonzero polynomial over a field has a splitting field, Every finite family of nonzero polynomials has a splitting field, obtained from their product, Polynomials that split and splitting fields of a polynomial or a family of polynomials). The prime subfield of is (A field's prime subfield is isomorphic to in characteristic zero and to in characteristic , The characteristic of a ring: the least with when one exists, and otherwise, The rationals form a field), so (The characteristic of a field is zero or a prime number) and is separable over for every ( is separable over exactly when the characteristic does not divide , and then a splitting field carries distinct -th roots of unity). For each finite edge, is a factor of (Over an integral domain, degrees add under multiplication of nonzero polynomials), so all its roots lie in and, being separable of degree , it has exactly distinct roots there ( is separable over exactly when the characteristic does not divide , and then a splitting field carries distinct -th roots of unity, Polynomials that split and splitting fields of a polynomial or a family of polynomials); the group of such roots is therefore finite of order and hence cyclic, so it contains a primitive -th root of unity ( is cyclic of order dividing , and has a primitive -th root of unity exactly when its order is , The group of -th roots of unity in a field, and primitive -th roots of unity). Fix one primitive -th root of unity for each unordered finite edge (a finite selection, since is finite) and put
The representation on the simple-root basis. Let be the -vector space with basis (Vector space over a field, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis). For each let be the unique -linear map with Directly from the definition each is an involution: and, for , . Hence every is invertible with , and the group these maps generate acts on (Linear map between vector spaces over the same field, Invertible linear maps, linear isomorphisms, and inverse linear maps, Identity maps and composites of linear maps are linear).
The root set. The root set of the construction is the orbit of the simple roots under the group generated by the (each generator is an involution). Writing for the representation supplied by The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness ↗, one has , the -orbit of the simple roots.
Conventions and limits. (i) ; exactly when ; when ; replacing by leaves unchanged, so the construction depends on the chosen primitive roots only through the numbers . (ii) No positivity of , no integrality of roots over , no identification of roots with reflections, and no faithfulness or definiteness of any form is asserted; those are separate matters, not part of this construction. (iii) is finite throughout, so the basis is finite and every linear map is specified by finitely many values.
Remarks
The single recorded justifier of this definition is The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness ↗, which proves , the exact order of , and the induced homomorphism ; only after that lemma is literally the -orbit of the simple roots.
No choice is used. The splitting field and the maps are constructions, and one primitive -th root is fixed for each of finitely many edges; the convention for introduces no root of unity at all.
Depends on
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- The rationals as equivalence classes of pairs of integers
- The rationals form a field
- The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution
- Polynomials that split and splitting fields of a polynomial or a family of polynomials
- Every nonzero polynomial over a field has a splitting field
- Every finite family of nonzero polynomials has a splitting field, obtained from their product
- Over an integral domain, degrees add under multiplication of nonzero polynomials
- For every field $F$, $F[x]$ is a unique factorisation domain
- The characteristic of a ring: the least $n \ge 1$ with $n \cdot 1_R = 0$ when one exists, and $0$ otherwise
- The characteristic of a field is zero or a prime number
- A field's prime subfield is isomorphic to $\mathbb Q$ in characteristic zero and to $\mathbb F_p$ in characteristic $p$
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- $\mu_n(K)$ is cyclic of order dividing $n$, and has a primitive $n$-th root of unity exactly when its order is $n$
- $t^{n}-1$ is separable over $K$ exactly when the characteristic does not divide $n$, and then a splitting field carries $n$ distinct $n$-th roots of unity
- Vector space over a field
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Linear map between vector spaces over the same field
- Invertible linear maps, linear isomorphisms, and inverse linear maps
- Identity maps and composites of linear maps are linear
Used by
- Reduced words in rank one Example
- The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness Lemma
- Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action Theorem
- Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups Theorem
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification Theorem
Dependency tree · two levels
95 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
- George Lusztig, Hecke Algebras with Unequal Parameters (revised 2014 book text, arXiv:math/0208154v2) (standard reference, not scraped)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (Princeton University Press 2008; author's complete PDF) (standard reference, not scraped)