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 finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset

Definition

Let (W,S) be a Coxeter system of finite type with S finite, n:=∣S∣, and length function ℓ; thus W is a finite group (Coxeter diagrams: edges, labels, components and finite type, clause (4), Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups). On V:=RS let B be the Coxeter form, let ra be the reflection with normal a (defined when B(a,a)≠0), and let ρ:W→GL(V) be the canonical reflection homomorphism with root system Φ={ρ(w)es:w∈W, s∈S}⊂V and reflection set T={wsw−1:w∈W, s∈S}⊂W (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone). Let V∗ be the algebraic dual with its dual action, its closed chamber C, its interior C∘ and its root hyperplanes Hα (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).

Since W is finite, B is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite, clause (1), Disconnected diagrams, direct products, and comparison of invariant forms, clause (4)); hence b:V→V∗, b(v):=B(v,⋅), is a linear isomorphism with b(ρ(w)v)=w⋅b(v) for all w∈W and v∈V, because B is ρ-invariant (Descent of the reflection representation, unit root norms, and conjugation of reflections, Invertible linear maps, linear isomorphisms, and inverse linear maps). Identify V with V∗ by b only now, and transfer C, C∘ and the Hα along b−1; with the same letters

C={v∈V:B(v,es)≥0 for every s∈S},C∘={v∈V:B(v,es)>0 for every s∈S},Hα={v∈V:B(v,α)=0}.

Give V the metric topology of the inner product B (Real and complex inner-product spaces and their induced length, Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement); it is canonical because B is determined by (W,S), and b is an isometry for B and its transferred form, so topological notions may be moved across the identification.

(1) The finite reflection arrangement. Put A:={Hα:α∈Φ}. Each α∈Φ satisfies B(α,α)=1≠0 (Descent of the reflection representation, unit root norms, and conjugation of reflections, clause (3)), so Hα is the kernel of the nonzero linear functional B(⋅,α) and in particular contains 0; A is finite because Φ is the image of the finite set W×S under (w,s)↦ρ(w)es; and A is permuted by ρ(W), since ρ(w)Hα=Hρ(w)α for all w∈W, α∈Φ (the form B is ρ-invariant). A chamber of A is a connected component of V∖⋃α∈ΦHα, and a closed chamber is the closure of a chamber (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, Connected components, quasicomponents, and totally disconnected spaces, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement). For I⊆S put CI‾:={v∈C:B(v,es)=0 for s∈I},CI:={v∈C:B(v,es)=0 for s∈I and B(v,es)>0 for s∉I}, the closed face and the open face of C of type I; for w∈W put wC:=ρ(w)C, wCI‾:=ρ(w)CI‾ and wCI:=ρ(w)CI.

(2) The spherical chamber complex. The form B is an inner product on V; let ∥v∥B:=B(v,v)1/2 and let Sn−1:={v∈V:∥v∥B=1} be the unit sphere, with the subspace topology (The induced length is a norm, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace, Euclidean spheres and closed balls as subspaces of Rn); the exponent is notation for the unit sphere of the n-dimensional inner-product space (V,B), and no dimension theory of spheres is claimed here. The spherical chamber belonging to w∈W is wC∩Sn−1, and its spherical faces are the sets wCI‾∩Sn−1.

(3) The coset face poset. For I⊆S put WI:=⟨s:s∈I⟩≤W (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups) and let wWI:={wu:u∈WI} be a left coset (Left and right cosets gH and Hg of a subgroup). The coset face poset is the set {wWI:w∈W, I⊊S} of cosets of proper standard parabolics, ordered by reverse inclusion as subsets of W: σ⪯τ if and only if σ⊇τ.

(4) Abstentions. This definition asserts neither that the sets wC∘ are the connected components of V∖⋃αHα nor that they cover it, neither that the cosets wWI index the faces wCI‾ nor that the spherical faces triangulate Sn−1; those assertions are proved in The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere ↗, the recorded justifier of this definition. Separately, the B-dual family of the basis (es) is provided by The dual family (b∗)b∈B associated to a Hamel basis B, defined by b∗(c)=δbc, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis and The dual family of a finite basis is a basis of the dual space, with the same dimension, and no Choice is used: S and W are finite and all objects here are finite-dimensional or set-theoretic.

Depends on

Used by

Dependency tree · two levels

135 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