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.

Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator

Definition

Let (W,S) be a Coxeter system of finite type with S finite and length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Coxeter diagrams: edges, labels, components and finite type), with canonical reflection representation ρ:W→GL(V) on V=RS, Coxeter form B, root system Φ and reflection set T={wsw−1:w∈W, s∈S} (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone). Since W is finite, B is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), so (V,B) is a real inner product space (Real and complex inner-product spaces and their induced length), and ρ(w) preserves B for every w∈W (Descent of the reflection representation, unit root norms, and conjugation of reflections (2)). Write O(V) for the group of B-preserving invertible linear maps V→V (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).

(1) Reflection length. For w∈W put

ℓT(w):=min⁡{k∈N: there are t1,…,tk∈T with w=t1t2⋯tk},

where the empty product (k=0) is the identity. The minimum exists because S⊆T and S generates W (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), so the admitted k form a nonempty subset of N, which has a least element (The well-ordering principle).

(2) Absolute order. For u,v∈W define u≤Tv if and only if

ℓT(v)=ℓT(u)+ℓT(u−1v).

(3) Moved and fixed spaces. For a linear map A:V→V (Linear map between vector spaces over the same field) define the moved space and the fixed space

M(A):=im⁡(A−idV),F(A):=ker⁡(A−idV)

(Kernel and image of a linear map). For A,B∈O(V) define the relation B≤OA if and only if

dim⁡M(A)=dim⁡M(B)+dim⁡M(B−1A).

(4) Conventions and abstentions. For u∈W write M(u):=M(ρ(u)) and F(u):=F(ρ(u)). This definition asserts no property of ≤T and ≤O beyond the displayed formulas: it asserts neither that either relation is a partial order, nor that ℓT(w)=dim⁡M(w), nor that B≤OA means that a shortest reflection factorization of B is a prefix of one of A. Those properties are proved in Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound ↗, the recorded justifier of this definition, and by the restriction and factorization lemmas of this page. No Choice is used: S, W, Φ and T are finite and every object is finite-dimensional or set-theoretic.

Depends on

Used by

Dependency tree · two levels

90 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