Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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 (S,m) be a finite Coxeter matrix and let W 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 h:=∏ (X2m(s,t)−1)∈Q[X], the product over all unordered pairs {s,t}⊆S with s≠t and m(s,t)<∞ (an empty product when #S≤1). Let K be a splitting field of h over Q (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 F, F[x] 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 K is Q (A field's prime subfield is isomorphic to Q in characteristic zero and to Fp in characteristic p, The characteristic of a ring: the least n≥1 with n⋅1R=0 when one exists, and 0 otherwise, The rationals form a field), so char⁡K=0 (The characteristic of a field is zero or a prime number) and Xn−1 is separable over K for every n≥1 (tn−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). For each finite edge, X2m(s,t)−1 is a factor of h (Over an integral domain, degrees add under multiplication of nonzero polynomials), so all its roots lie in K and, being separable of degree 2m(s,t), it has exactly 2m(s,t) distinct roots there (tn−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, Polynomials that split and splitting fields of a polynomial or a family of polynomials); the group μ2m(s,t)(K) of such roots is therefore finite of order 2m(s,t) and hence cyclic, so it contains a primitive 2m(s,t)-th root of unity (μn(K) is cyclic of order dividing n, and has a primitive n-th root of unity exactly when its order is n, The group μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity). Fix one primitive 2m(s,t)-th root of unity ζst∈K for each unordered finite edge (a finite selection, since S is finite) and put cst:=cts:=ζst+ζst−1∈K(m(s,t)<∞),cst:=cts:=2(m(s,t)=∞).

The representation on the simple-root basis. Let E be the K-vector space with basis (αs)s∈S (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 s∈S let σs:E→E be the unique K-linear map with σs(αs)=−αs,σs(αt)=αt+cstαs(t≠s). Directly from the definition each σs is an involution: σs2(αs)=αs and, for t≠s, σs2(αt)=σs(αt+cstαs)=αt+cstαs−cstαs=αt. Hence every σs is invertible with σs−1=σs, and the group these maps generate acts on E (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 Φ:={σs1σs2⋯σsk(αt):k≥0, s1,…,sk,t∈S}⊆E, the orbit of the simple roots under the group generated by the σs (each generator is an involution). Writing σ:W→GLK(E) for the representation supplied by The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness ↗, one has Φ={σw(αs):w∈W, s∈S}, the W-orbit of the simple roots.

Conventions and limits. (i) cst=cts; cst=0 exactly when m(s,t)=2; cst=2 when m(s,t)=∞; replacing ζst by ζst−1 leaves cst unchanged, so the construction depends on the chosen primitive roots only through the numbers cst. (ii) No positivity of cst, no integrality of roots over Z, 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) S is finite throughout, so the basis (αs)s∈S 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 σs2=id, the exact order of σsσt, and the induced homomorphism σ:W→GLK(E); only after that lemma is Φ literally the W-orbit of the simple roots.

No choice is used. The splitting field and the maps σs are constructions, and one primitive 2m-th root is fixed for each of finitely many edges; the convention cst=2 for m(s,t)=∞ introduces no root of unity at all.

Depends on

Used by

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