Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 3 also cleared it.

Finite Reflection Length and Orthogonal Moved Spaces

1 · Prerequisites

2 · Summary

Reflection length counts arbitrary conjugate reflections rather than simple generators, and in a finite Coxeter group every element is a product of exactly dim⁡M(w) of them, where M(w)=im⁡(ρ(w)−id) is the moved space in the positive definite reflection representation. This page develops that equality, the absolute order it grades, and the geometry of moved spaces of orthogonal operators.

Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator fixes the conventions for a Coxeter system (W,S) of finite type: the reflection length ℓT(w) as the least number of elements of the conjugate reflection set T whose product is w (the minimum exists because S⊆T and S generates W), the absolute order u≤Tv defined by the length identity ℓT(v)=ℓT(u)+ℓT(u−1v), the moved and fixed spaces M(A)=im⁡(A−id), F(A)=ker⁡(A−id) of an arbitrary linear map on the inner product space (V,B), and the orthogonal relation B≤OA defined by rank additivity. Clause (4) records explicitly that the definition asserts no order property, no rank-length equality and no prefix description; those are proved by the items below.

The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order is the finite-dimensional linear algebra. It proves M(A)=F(A)⊥ with V=M(A)⊕F(A), that the Wall form χA(u,v)=B((A−id)∣M(A)−1u,v) satisfies χA(u,v)+χA(v,u)=−B(u,v) and is nondegenerate with symmetric part −12B, and it constructs for every subspace U⊆M(A) the operator AU=id+HU−1 on U and id on U⊥, where HU is the operator with B(HUu,v)=χA(u,v) and HU+HU∗=−idU. Its main theorem is that U↦AU is an order isomorphism from the subspaces of M(A) onto the set {B∈O(V):B≤OA}, with inverse B↦M(B); it also proves the rank-length equality and the prefix description of ≤O for products of reflections. The restriction AU is an element of O(V) and need not lie in ρ(W); the companion plane-rotation example exhibits this inside I2(4).

Root normals inside the moved space, factorizations into reflections, and independent normals passes back inside W. For w≠1 it produces a root α with F(w)⊆Hα and α∈M(w): a generic point of F(w) avoids the finitely many intersections Hα∩F(w), and its chamber stabiliser is a parabolic containing a conjugate simple reflection whose normal is a root. There follows ρ(tα)≤Oρ(w) and the rank drop dim⁡M(w)=1+dim⁡M(tαw), and induction factors every w into exactly dim⁡M(w) elements of T, giving ℓT(w)=dim⁡M(w). The telescoping identity ρ(t1⋯tm)−id=∑i=1mρ(t1⋯ti−1)(ρ(ti)−id) supplies the reverse inequality dim⁡M(t1⋯tm)≤m and shows that the transported normals ρ(t1⋯ti−1)αi are linearly independent whenever dim⁡M(t1⋯tm)=m. The argument uses the finite chamber tiling of the prerequisite page, and it is choice-free.

Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound assembles the order theory. It proves Carter's formula ℓT(w)=dim⁡M(w)=dim⁡V−dim⁡F(w), that ≤T is a partial order of finite rank with the prefix description of u≤Tv and with ℓT as rank function, the triangle inequality and the invariance of ℓT under inversion and conjugation, the inclusions M(u)⊆M(v) and F(v)⊆F(u) for u≤Tv, and the moved-space rigidity: for α,β≤Tδ one has α≤Tβ if and only if M(α)⊆M(β), so that u↦M(u) is an order isomorphism from [1,δ]T onto its image. The common upper bound δ is used through the restriction of ρ(δ) to M(α) and is indispensable; the companion rotation example shows that the converse implication fails without it.

Earlier pages: finite-reflection-arrangements-and-spherical-coxeter-complexes supplies the finite reflection arrangement, the chamber system wC, the open faces wCI and the point stabilisers Stab⁡W(x)=wWIw−1 used by the shortening argument, together with the root-reflection dictionary and the positive definite Coxeter form. The companion finite-reflection-length-and-orthogonal-moved-spaces-examples tests the constructions in S5, S4 and I2(4). All four items and the companion computations are choice-free.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order

Statement

Let (V,B) be a finite-dimensional real inner product space (Real and complex inner-product spaces and their induced length); on this page V=RS with the positive definite Coxeter form B of a Coxeter system of finite type (The real Coxeter form, its radical, reflections, and form-preserving maps, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), and O(V) is the group of B-preserving invertible linear maps (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces). Let M, F and ≤O be as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator. Then:

(1) Basic identities. For every A∈O(V) one has F(A)=F(A−1), M(A)=M(A−1), M(A)=F(A)⊥, V=M(A)⊕F(A), A(M(A))=M(A), A(F(A))=F(A), and (A−id)∣M(A):M(A)→M(A) is a bijection (In finite dimension, W⊥⊥=W and dim⁡W+dim⁡W⊥=dim⁡V, Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T). For all X,Y∈O(V), M(XY)⊆M(X)+X M(Y) and hence dim⁡M(XY)≤dim⁡M(X)+dim⁡M(Y).

(2) The Wall form. For A∈O(V) put

χA(u,v):=B((A−id)∣M(A)−1u, v)(u,v∈M(A)).

Then χA is a bilinear form on M(A) satisfying

χA(u,v)+χA(v,u)=−B(u,v)(u,v∈M(A));

in particular χA is nondegenerate and its symmetric part is −12B∣M(A) (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V, Adjoints satisfy (S+T)∗=S∗+T∗, (λT)∗=λ‾T∗, (ST)∗=T∗S∗, and T∗∗=T).

(3) Subspace restriction. Let A∈O(V), let U⊆M(A) be a subspace and let ΠU:V→U be the orthogonal projection (The orthogonal projection PWv is the W-component in V=W⊕W⊥, For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥). There is a unique HU∈End⁡(U) with B(HUu,v)=χA(u,v) for all u,v∈U, and it satisfies HU+HU∗=−idU, so that HU is invertible. Define AU∈O(V) by AUu=u+HU−1u for u∈U and AU=id on U⊥. Then M(AU)=U and

(AU−id)∣U−1=HU,HUu=ΠU((A−id)∣M(A))−1u  (u∈U).

An element A∈O(V) is a reflection (that is, dim⁡M(A)=1) if and only if A=id−2ΠL for the line L=M(A); in particular every line L⊆V is the moved space of exactly one reflection of O(V) (For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and T∗T=I are equivalent).

(4) The restriction theorem. For every subspace U⊆M(A) one has AU≤OA, that is dim⁡M(A)=dim⁡U+dim⁡M(AU−1A); and for U⊆U′⊆M(A) one has (AU′)U=AU, hence AU≤OAU′. Conversely every B∈O(V) with B≤OA satisfies M(B)⊆M(A), χA∣M(B)=χB and B=AM(B). Consequently the assignment U↦AU is a bijection from the set of subspaces of M(A) onto {B∈O(V):B≤OA}, with inverse B↦M(B), and it is an order isomorphism for inclusion of subspaces and ≤O.

(5) Rank-length equality and prefixes. Let A∈O(V) and let r1,…,rk∈O(V) be reflections with A=r1r2⋯rk. Then k≥dim⁡M(A), and A is a product of exactly dim⁡M(A) reflections. Moreover B≤OA if and only if there are a shortest factorization A=r1⋯rm (so m=dim⁡M(A)) and an index k with B=r1⋯rk.

Facts & Assumptions

Given: A finite-dimensional real inner product space (V,B) with the positive definite Coxeter form of a finite-type Coxeter system, an element A∈O(V), and the moved space M(A)=im⁡(A−id), the fixed space F(A)=ker⁡(A−id) and the relation ≤O of Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator.

[F1]

For a linear map T:V→W with V finite-dimensional, dim⁡V=dim⁡ker⁡T+dim⁡im⁡T; in particular an injective endomorphism of a finite-dimensional vector space is bijective. Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T

[F2]

For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥, W⊥⊥=W and dim⁡W+dim⁡W⊥=dim⁡V. For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥ In finite dimension, W⊥⊥=W and dim⁡W+dim⁡W⊥=dim⁡V

[F3]

The orthogonal projection PW:V→W sends v=w+z with w∈W, z∈W⊥ to PWv=w; equivalently PWv is the unique vector of W with v−PWv∈W⊥, and PWw=w for every w∈W. The projection is linear: combining the unique decompositions of x and y gives PW(ax+by)=aPWx+bPWy. The orthogonal projection PWv is the W-component in V=W⊕W⊥

[F4]

A∈O(V) means that A is invertible and B(Au,Av)=B(u,v) for all u,v∈V; equivalently B(Au,v)=B(u,A−1v) for all u,v∈V. Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and T∗T=I are equivalent

[F5]

B is symmetric and bilinear, and positive definite: B(u,u)≥0 with B(u,u)=0 only for u=0; consequently B is nondegenerate, so B(x,y)=0 for all y∈V implies x=0, and the same holds for the restriction of B to any subspace. Real and complex inner-product spaces and their induced length Finiteness criterion: W is finite exactly when the Coxeter form is positive definite

[F6]

M(A)=im⁡(A−id), F(A)=ker⁡(A−id) and B≤OA holds if and only if dim⁡M(A)=dim⁡M(B)+dim⁡M(B−1A); no order property of ≤O is asserted by the definition. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator

Proof

technique · direct
1.1F2F4F5algebra

For y∈V one has B((A−id)x,y)=B(x,(A−1−id)y) for all x∈V by [F4], so y∈M(A)⊥ holds exactly when (A−1−id)y=0 and hence exactly when A−1y=y, that is, when y∈F(A−1); thus M(A)⊥=F(A−1). Since A−1y=y holds exactly when Ay=y, one has F(A−1)=F(A), and A−1−id=−A−1(A−id) shows M(A−1)=M(A). Consequently M(A)⊥=F(A), and [F2] gives M(A)=M(A)⊥⊥=F(A)⊥, V=M(A)⊕F(A) and dim⁡M(A)+dim⁡F(A)=dim⁡V. Moreover A(A−id)=(A−id)A, so A(M(A))=M(A); and A(F(A))⊆F(A) with equality because A is injective.

1.2F1F4algebra

For X,Y∈O(V) the identity XY−id=(X−id)+X(Y−id) gives M(XY)⊆M(X)+X M(Y); the invertible X restricts to an injective map M(Y)→X M(Y), whose image therefore has dimension dim⁡M(Y) by [F1]; consequently dim⁡M(XY)≤dim⁡M(X)+dim⁡M(Y).

2.1step 1.1F1

By step 1.1 the direct sum V=M(A)⊕F(A) gives F(A)∩M(A)={0}, so the restriction (A−id)∣M(A):M(A)→M(A), whose image lies in the A-stable space M(A), has trivial kernel and is therefore injective; by [F1] it is bijective, and SA:=((A−id)∣M(A))−1∈GL(M(A)) is defined.

2.2step 1.1F3F4F5algebra

Let A∈O(V) with dim⁡M(A)=1, put L:=M(A) and let ΠL be the orthogonal projection onto L [F3]. By step 1.1 the line L and the space F(A)=L⊥ are A-stable, so A fixes L⊥ pointwise; for 0≠u∈L one has Au=cu with c∈R, and since A preserves B by [F4] and B(u,u)≠0 by [F5], c2B(u,u)=B(Au,Au)=B(u,u) forces c2=1, while c=1 would put u∈L∩F(A)={0}; hence c=−1 and A=id−2ΠL. Conversely if L is a line then A′:=id−2ΠL acts as −1 on L and as the identity on L⊥, so it preserves B and is invertible, and M(A′)=L has dimension one; if A′∈O(V) is a reflection with M(A′)=L, the first part applied to A′ gives A′=id−2ΠL. Hence every line L⊆V is the moved space of exactly one reflection of O(V), namely id−2ΠL.

3.1step 1.1step 2.1F4F5algebra

Applying step 2.1 to the orthogonal element A−1, whose moved space is M(A) by step 1.1, gives the bijection TA:=((A−1−id)∣M(A))−1:M(A)→M(A). For u,v∈M(A) put w:=SAu and z:=TAv, so that (A−id)w=u and (A−1−id)z=v; then B(SAu,v)=B(w,(A−1−id)z)=B(w,A−1z)−B(w,z)=B(Aw,z)−B(w,z)=B((A−id)w,z)=B(u,TAv), using [F4] and symmetry of B. Moreover A−1−id=−A−1(A−id) on the A-stable space M(A), so the inverse there is TA=−SAA and SA+TA=SA(id−A)=−((A−id)∣M(A))−1(A−id)∣M(A)=−idM(A).

4.1step 1.1step 3.1F4F5algebra

The Wall form χA(u,v)=B(SAu,v) is bilinear on M(A), and for u,v∈M(A) the transpose identity of step 3.1 gives B(SAv,u)=B(v,TAu)=B(TAu,v), so χA(u,v)+χA(v,u)=B(SAu,v)+B(TAu,v)=B((SA+TA)u,v)=−B(u,v). If χA(u,v)=0 for all v∈M(A), then B(SAu,⋅) vanishes on M(A) and, since SAu∈M(A)=F(A)⊥, also on F(A), hence on V; by [F5] SAu=0, and SA is injective, so u=0: the form χA is nondegenerate, and its symmetric part is 12(χA(u,v)+χA(v,u))=−12B(u,v) on M(A).

5.1step 3.1step 4.1F1F3F5algebra

Let U⊆M(A) and define HU:=ΠUSA∣U:U→U. For u,v∈U, [F3] gives B(HUu,v)=B(SAu,v)=χA(u,v); if another operator has these pairings, its difference from HU pairs to zero with every v∈U, so it equals HU by [F5]. Define HUt:=ΠUTA∣U, with TA from step 3.1. That step and [F3] give B(HUtu,v)=B(TAu,v)=B(u,SAv)=B(u,HUv), so HUt is the adjoint HU∗ of The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V. Since SA+TA=−idM(A), compression to U gives HU+HUt=−idU. If HUu=0, then 0=B(HUu,u)=χA(u,u)=−12B(u,u) by step 4.1, hence u=0; thus HU is injective and invertible by [F1], including when U=0.

6.1step 5.1F1F2F5algebra

Define AU∈End⁡(V) by AUu=u+HU−1u for u∈U and AU=id on U⊥; this is well defined and linear because V=U⊕U⊥ [F2]. Then AU−id=HU−1ΠU has image U, so M(AU)=U and (AU−id)∣U−1=HU. Put T:=HU−1∈GL(U) and Tt:=(HUt)−1; inverting the transpose relation of step 5.1 shows that Tt is the transpose of T, that is, B(Tx,y)=B(x,Tty) for all x,y∈U. Multiplying HU+HUt=−idU on the left by T and on the right by Tt, and also on the left by Tt and on the right by T, gives T+Tt=−TTt=−TtT, hence (id+T)(id+Tt)=idU=(id+Tt)(id+T). Therefore B(AUu,AUv)=B((id+Tt)(id+T)u,v)=B(u,v) for all u,v∈U, the transpose of id+T being id+Tt; on U⊥ the operator AU is the identity, and U⊥U⊥, so AU preserves B on V. If AUx=0, then B(x,y)=B(AUx,AUy)=0 for every y∈V, so x=0 by [F5] and AU is injective, hence invertible by [F1]: thus AU∈O(V).

7.1step 1.1step 5.1step 6.1F1F6algebra

Fix U⊆M(A) and let AU be as in step 6.1. In the direct sum V=M(A)⊕F(A) of step 1.1 write x=m+f; then (A−AU)x=(A−id)m−HU−1ΠUm, so x∈ker⁡(A−AU) exactly when (A−id)m=HU−1ΠUm. With u:=ΠUm∈U this equation reads m=SAHU−1u, and it is consistent because ΠUSAΠU=HU is step 5.1: the solutions are exactly the x=SAHU−1u+f with u∈U and f∈F(A) arbitrary. Hence ker⁡(A−AU)=SAHU−1(U)⊕F(A) has dimension dim⁡U+dim⁡F(A), so rank⁡(A−AU)=dim⁡M(A)−dim⁡U. Since AU−1A−id=AU−1(A−AU), the space M(AU−1A) is the image of A−AU under AU−1 and has the same dimension rank⁡(A−AU); therefore dim⁡M(A)=dim⁡U+dim⁡M(AU−1A), that is, AU≤OA by [F6].

7.2step 1.1step 5.1step 6.1F6algebra

Let B≤OA and put C:=B−1A, so that dim⁡M(A)=dim⁡M(B)+dim⁡M(C) by [F6]. Since A−id=(B−id)C+(C−id), one has M(A)⊆M(B)+M(C), and comparing dimensions gives M(A)=M(B)⊕M(C); in particular M(B)⊆M(A). Fix w∈U:=M(B) and write m:=SAw=mB+mC with mB∈M(B) and mC∈M(C); then w=(A−id)m=(B−id)(Cm)+(C−id)m with (B−id)(Cm)∈M(B) and (C−id)m∈M(C), so comparing the two direct summands gives Cm=m and (B−id)m=w. Hence m−SBw∈F(B)=M(B)⊥=U⊥, where the first equality uses step 1.1 applied to B; therefore for all u,v∈U one has χA(u,v)=B(SAu,v)=B(SBu,v)=χB(u,v), because SAu−SBu∈U⊥. Thus the operator defined by χA on U in step 5.1 is HU=SB, and the construction of step 6.1 for A and U gives AM(B)=id+SB−1 on U and id on U⊥, while B=id+SB−1 on U and B=id on U⊥=F(B) by step 1.1, so B=AM(B).

8.1step 5.1step 6.1step 7.1algebra

Let U⊆U′⊆M(A) and apply step 6.1 to AU′, whose moved space is M(AU′)=U′. Since (AU′−id)∣U′−1=HU′, the Wall form of AU′ on U′ is χAU′(x,y)=B(HU′x,y); for x,y∈U this equals B(ΠU′SAΠU′x,y)=B(SAx,y)=χA(x,y) by step 5.1, because ΠU′x=x and y∈U⊆U′. Hence the operator attached to AU′ and U by step 5.1 is again HU, and the construction of step 6.1 gives (AU′)U=AU; applying step 7.1 with AU′ in place of A and the subspace U⊆M(AU′)=U′ then gives AU≤OAU′.

8.2step 1.2step 2.2step 7.1

Let r1,…,rk∈O(V) be reflections and A=r1r2⋯rk; since dim⁡M(ri)=1 by step 2.2, the subadditivity of step 1.2 gives dim⁡M(A)≤k. Conversely every A∈O(V) is a product of exactly dim⁡M(A) reflections: if M(A)=0 then A=id is the empty product, and otherwise one picks a line L⊆M(A) and applies step 7.1 to U:=L, obtaining dim⁡M(AL−1A)=dim⁡M(A)−1, so by induction on dim⁡M(A) the element AL−1A is a product of dim⁡M(A)−1 reflections and A=AL⋅(AL−1A) is a product of dim⁡M(A) of them.

9.1step 6.1step 7.2step 8.1

The assignment U↦AU from subspaces of M(A) to {X∈O(V):X≤OA} is injective, because AU=AU′ forces U=M(AU)=M(AU′)=U′ by step 6.1, and surjective by step 7.2; with inverse X↦M(X) it is a bijection. It is an order isomorphism: if U⊆U′ then AU≤OAU′ by step 8.1, and conversely AU≤OAU′ gives U=M(AU)⊆M(AU′)=U′ by the inclusion clause of step 7.2.

9.2step 1.2step 2.2step 8.2F6algebra

Suppose A=r1⋯rm with m=dim⁡M(A) and B=r1⋯rk; the ri are involutions by step 2.2, so B−1A=rk+1⋯rm, whence dim⁡M(B)≤k and dim⁡M(B−1A)≤m−k by step 8.2, while dim⁡M(A)≤dim⁡M(B)+dim⁡M(B−1A) by step 1.2; both inequalities are therefore equalities and B≤OA by [F6].

10.1step 8.2F6∎

Conversely, if B≤OA, write B=r1⋯rk with k=dim⁡M(B) and B−1A=s1⋯sl with l=dim⁡M(B−1A), both by the factorization clause of step 8.2; then A=r1⋯rks1⋯sl is a product of k+l=dim⁡M(A) reflections by [F6], that is, a shortest factorization of A by step 8.2, of which B is the prefix of length k.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Root normals inside the moved space, factorizations into reflections, and independent normals

Statement

Let (W,S) be a Coxeter system of finite type with S finite, with V=RS, positive definite Coxeter form B, canonical reflection representation ρ, root system Φ and reflection set T (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), with the chamber system wC, the open faces wCI and the root hyperplanes Hα={x∈V:B(x,α)=0} of the transferred dual action (The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset), and let ℓT, M, F and ≤O be as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator; for u∈W write M(u)=M(ρ(u)) and F(u)=F(ρ(u)). Then:

(1) Root normals in the moved space. Let w∈W with w≠1. Then dim⁡M(w)>0 and there is a root α∈Φ with F(w)⊆Hα. For every such root one has α∈M(w), and the reflection tα∈T with ρ(tα)=rα (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1), Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)) satisfies

ρ(tα)≤Oρ(w),dim⁡M(w)=1+dim⁡M(tαw).

(2) Factorizations and Carter's formula. Every w∈W is a product w=t1t2⋯tk of k=dim⁡M(w) reflections ti∈T, and no product of fewer elements of T represents w; equivalently

ℓT(w)=dim⁡M(w).

(3) Independent normals. Let t1,…,tm∈T and choose roots αi∈Φ with ρ(ti)=rαi. Then dim⁡M(t1⋯tm)≤m; and if dim⁡M(t1⋯tm)=m — in particular if t1⋯tm is a shortest reflection factorization of its product — then the m vectors

α1, ρ(t1)α2, ρ(t1t2)α3, …, ρ(t1t2⋯tm−1)αm

are linearly independent (Linear independence: a finite list v:n→V is independent when ∑i<nλivi=0V forces every λi=0F, and a subset S⊆V is independent when every injective finite list into S is independent) and span M(t1⋯tm).

Facts & Assumptions

Given: The finite-type Coxeter datum V=RS, B, ρ, Φ, T, W and the elements w,t1,…,tm above; M(u)=M(ρ(u)), F(u)=F(ρ(u)) and ℓT are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator.

[F1]

For I⊆S the open face is CI={v∈C:B(v,es)=0 for s∈I, B(v,es)>0 for s∉I}, the root hyperplane is Hα={v∈V:B(v,α)=0}, and wCI⊆wHes for s∈I; moreover V∖{0} is the disjoint union of the sets wCI over the left cosets wWI with I⊊S, and Stab⁡W(x)=wWIw−1 for every x∈wCI. The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere

[F2]

No finite family of proper subspaces of a finite-dimensional vector space over an infinite field covers the whole space. A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces

[F3]

Every root α∈Φ satisfies B(α,α)=1, and there is a unique tα∈T with ρ(tα)=rα. The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange

[F5]

For a∈V with B(a,a)≠0 the map ra is linear, preserves B, fixes every v with B(v,a)=0, and satisfies ra(a)=−a; consequently ra(v)−v∈Ra for every v, so M(ra)=Ra. Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order Descent of the reflection representation, unit root norms, and conjugation of reflections

[F6]

On the positive definite space (V,B) the Wall form lemma holds: (1) dim⁡M(XY)≤dim⁡M(X)+dim⁡M(Y) for X,Y∈O(V) and M(A)=F(A)⊥ for A∈O(V); (3) for every subspace U⊆M(A) the operator AU of the lemma satisfies M(AU)=U, and every line L⊆V is the moved space of exactly one reflection of O(V), namely id−2ΠL; (4) AU≤OA and dim⁡M(A)=dim⁡U+dim⁡M(AU−1A) for every U⊆M(A). The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order

[F7]

ρ is a group homomorphism, so ρ(uv)=ρ(u)ρ(v) and ρ(1)=idV (The canonical reflection homomorphism, roots, reflections, and the positive cone). ℓT(w) is the least k over products of k elements of T; M(u)=M(ρ(u)), F(u)=F(ρ(u)); and T={wsw−1:w∈W, s∈S} with (W,S) presented as in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator

[F8]

For a subspace U of a finite-dimensional space Z, dim⁡U≤dim⁡Z, with equality exactly when U=Z. A finite-dimensional space has a basis, obtained as the extension of any linearly independent subset; a basis is an independent spanning set and its cardinality is the dimension of the space. If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis

[F10]

A list of vectors is linearly dependent exactly when some nontrivial linear relation holds, and dependence of w1,…,wm lets one of the vectors be solved for as a combination of the others; the span of a set is the set of its finite linear combinations. Linear independence: a finite list v:n→V is independent when ∑i<nλivi=0V forces every λi=0F, and a subset S⊆V is independent when every injective finite list into S is independent Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S

Proof

technique · direct
1.1F1F2F4F5F6given

Let w≠1. First dim⁡M(w)>0: otherwise M(ρ(w))=0, so ρ(w)−id=0 and ρ(w)=id, whence w=1 by [F4], a contradiction. Next, a root α with F(w)⊆Hα exists. If F(w)=0 then F6 gives M(w)=F(w)⊥=V≠0, so S≠∅ and α:=es for any s∈S is a root with F(w)=0⊆Hα. Suppose now that F(w)≠0; let Φ′⊆Φ be the finite set of roots with F(w)⊈Hα, so that each Hα∩F(w) with α∈Φ′ is a proper subspace of the finite-dimensional real space F(w); the finite family consisting of those subspaces and {0} consists of proper subspaces of F(w), since F(w)≠0; by [F2] its union does not cover F(w), so there is 0≠x∈F(w) with x∉Hα for every α∈Φ′, including when Φ′=∅; for every root β the implication x∈Hβ⇒F(w)⊆Hβ holds, and x is fixed by w, so w∈Stab⁡W(x). By [F1] there are w0∈W and I⊊S with x∈w0CI and Stab⁡W(x)=w0WIw0−1; since w≠1 lies in this stabiliser, I≠∅, so for s∈I one has x∈w0CI⊆w0Hes=Hρ(w0)es by [F1], the equality following from the B-invariance of ρ(w0) [F5]; the implication above with β:=ρ(w0)es gives F(w)⊆Hρ(w0)es for the root ρ(w0)es∈Φ, so in this case a root with the required property exists as well. Finally, if F(w)⊆Hα, then B(f,α)=0 for all f∈F(w), so α∈F(w)⊥=M(w) by F6.

1.2F3F5

Let t∈T and let α∈Φ satisfy ρ(t)=rα, as supplied by [F3]. Then rα(v)−v=−2B(v,α)α for every v by [F5], so M(t)=M(rα)=Rα and dim⁡M(t)=1; also ρ(t)−1=ρ(t)=ρ(t−1) because t2=1.

1.3F6

For X,Y∈O(V) one has dim⁡M(XY)≤dim⁡M(X)+dim⁡M(Y) by F6.

1.4F7algebragiven

For t1,…,tm∈T, the telescoping identity is ρ(t1⋯tm)−id=∑i=1mρ(t1⋯ti−1)(ρ(ti)−id): each summand is ρ(t1⋯ti)−ρ(t1⋯ti−1), by the homomorphism property of ρ. Thus M(t1⋯tm)⊆∑i=1mρ(t1⋯ti−1)M(ti).

1.5F8F9F10

Linear-algebra tool. Let Z be a finite-dimensional vector space spanned by vectors w1,…,wm. Then dim⁡Z≤m: by [F8] Z has a basis B with ∣B∣=dim⁡Z, and B is linearly independent while Z is spanned by w1,…,wm, so [F9] gives dim⁡Z≤m. If moreover dim⁡Z=m, then w1,…,wm are linearly independent: otherwise a nontrivial relation expresses some wj as a combination of the remaining m−1 vectors by [F10], those remaining vectors still span Z by [F10], and [F9] would give dim⁡Z≤m−1, a contradiction.

2.1step 1.2step 1.3

A product of k elements of T has moved dimension at most k: by step 1.2 each factor has moved dimension 1, and step 1.3 applied k times bounds the moved dimension of the product by the sum k.

2.2step 1.1step 1.2F3F6

Let α∈Φ satisfy F(w)⊆Hα and α∈M(w), as produced by step 1.1. Then Rα is a line contained in M(ρ(w)), and by F6 and [F3] the unique reflection of O(V) with moved space Rα is id−2ΠRα=rα=ρ(tα); hence ρ(tα)=(ρ(w))Rα in the notation of [F6]. Applying F6 with A=ρ(w) and U=Rα gives ρ(tα)≤Oρ(w) and dim⁡M(w)=dim⁡Rα+dim⁡M(ρ(tα)−1ρ(w))=1+dim⁡M(tαw), the last equality because ρ(tα)−1ρ(w)=ρ(tα−1w)=ρ(tαw) by steps 1.1 and 1.2.

2.3step 1.2step 1.4step 1.5F8

Let t1,…,tm∈T and put vi:=ρ(t1⋯ti−1)αi and Z:=span⁡{v1,…,vm}. Steps 1.2 and 1.4 give M(t1⋯tm)⊆Z. Since Z is spanned by these m vectors, step 1.5 gives dim⁡Z≤m; [F8] applied to the subspace M(t1⋯tm) of Z yields dim⁡M(t1⋯tm)≤dim⁡Z≤m.

3.1step 2.1step 2.2F7

Carter's formula and factorization: every w∈W satisfies ℓT(w)=dim⁡M(w), and w is a product of exactly dim⁡M(w) elements of T. If w=1, then dim⁡M(w)=0 and the empty product represents 1, giving both assertions. If w≠1 with dim⁡M(w)=k≥1, step 2.2 supplies t:=tα∈T with dim⁡M(tw)=k−1; by induction on k (applied to tw, whose moved dimension is k−1) there are t2,…,tk∈T with tw=t2⋯tk, so w=t⋅(tw)=tt2⋯tk is a product of k elements of T. For the reverse inequality let w=s1⋯sj with s1,…,sj∈T; then k=dim⁡M(w)=dim⁡M(ρ(s1)⋯ρ(sj))≤j by step 2.1, so no shorter product of elements of T represents w and ℓT(w)=k by [F7].

4.1step 1.5step 2.3step 3.1F8given∎

Suppose dim⁡M(t1⋯tm)=m and put vi:=ρ(t1⋯ti−1)αi as in step 2.3. Step 2.3 gives M(t1⋯tm)⊆Z with m=dim⁡M(t1⋯tm)≤dim⁡Z≤m, so dim⁡Z=m and M(t1⋯tm)=Z by [F8]. Thus the vi span M(t1⋯tm), and by step 1.5 the vectors v1,…,vm are linearly independent and hence form a basis of M(t1⋯tm): this is the independence and spanning assertion of (3). Finally, if t1⋯tm is a shortest reflection factorization of its product u:=t1⋯tm, then m=ℓT(u)=dim⁡M(u) by step 3.1, so the hypothesis dim⁡M(t1⋯tm)=m holds and the same conclusion applies. This proves (1), (2) and (3).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound

Statement

Let (W,S) be a Coxeter system of finite type with S finite, with V=RS, positive definite Coxeter form B, canonical reflection representation ρ, root system Φ, reflection set T and length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), and let ℓT, M, F and ≤T be as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator. Then:

(1) Carter's formula. For every w∈W,

ℓT(w)=dim⁡M(w)=dim⁡V−dim⁡F(w).

(2) The absolute order. ≤T is a partial order on W (Partial order and partially ordered set), and:

(i) u≤Tv holds if and only if there are reflections t1,…,tm∈T and an index k≤m such that u=t1⋯tk and v=t1⋯tm are shortest reflection factorizations, that is, k=ℓT(u) and m=ℓT(v) (a shortest reflection factorization of u is a prefix of one of v);

(ii) ℓT(1)=0, u<Tv implies ℓT(u)<ℓT(v), and ℓT(y)=ℓT(x)+1 whenever y covers x; hence ℓT is a rank function and every interval [u,v]T={x∈W:u≤Tx≤Tv} is finite (Graded poset, rank function, and rank levels);

(iii) ∣ℓT(u)−ℓT(v)∣≤ℓT(u−1v), ℓT(u−1)=ℓT(u) and ℓT(vuv−1)=ℓT(u) for all u,v∈W;

(iv) u≤Tv implies M(u)⊆M(v) and F(v)⊆F(u).

(3) Moved-space rigidity under a common upper bound. Let α,β,δ∈W with α≤Tδ and β≤Tδ. Then

α≤Tβ  ⟺  M(α)⊆M(β);

in particular M(α)=M(β) implies α=β, and u↦M(u) is an order isomorphism from [1,δ]T onto its image ordered by inclusion. The proof of the converse uses the common upper bound δ, through the restriction of δ to the subspace M(α); the converse is claimed only under this hypothesis (see the companion example of the I2(4) rotation, where the hypothesis fails).

Facts & Assumptions

Given: The finite-type Coxeter datum W,S,V,B,ρ,Φ,T and the elements α,β,δ∈W above; ℓT, M, F and ≤T are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator.

[F1]

Every w∈W is a product of k=dim⁡M(w) elements of T, no product of fewer elements of T represents w, and ℓT(w)=dim⁡M(w). Root normals inside the moved space, factorizations into reflections, and independent normals

[F2]

The Wall form lemma holds on the positive definite space (V,B): (1) M(A)=F(A)⊥ and V=M(A)⊕F(A) for A∈O(V); (4) for B≤OA one has M(B)⊆M(A) and B=AM(B), the assignment U↦AU is a bijection from subspaces of M(A) onto {B∈O(V):B≤OA}, and it is an order isomorphism for inclusion and ≤O, with (AU′)U=AU and AU≤OAU′ for U⊆U′; (5) an element of O(V) is a product of exactly dim⁡M reflections, and B≤OA holds exactly when B is a prefix of a shortest factorization of A. The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order

[F3]

u≤Tv means ℓT(v)=ℓT(u)+ℓT(u−1v), B≤OA means dim⁡M(A)=dim⁡M(B)+dim⁡M(B−1A), and T={wsw−1:w∈W, s∈S} is closed under inversion; for u∈W one has M(u)=M(ρ(u)) and F(u)=F(ρ(u)). Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator

[F4]

≤T is a relation on the finite set W; ≤T is a partial order exactly when it is reflexive, antisymmetric and transitive, and a rank function on a finite poset is a map ρ with ρ(minimal)=0 and ρ(y)=ρ(x)+1 across covers. Partial order and partially ordered set Graded poset, rank function, and rank levels

[F5]

The canonical reflection homomorphism, roots, reflections, and the positive cone (1): ρ:W→GL(V) is a group homomorphism into the group of invertible linear maps, so ρ(v)−1=ρ(v−1) and ρ(v)−1(V)=V.

Proof

technique · direct
1.1F1F2

For every w∈W the factorization lemma gives ℓT(w)=dim⁡M(w) [F1], and the Wall form lemma gives V=M(w)⊕F(w) F2, so dim⁡M(w)=dim⁡V−dim⁡F(w); this is Carter's formula (1).

1.2F1

For x,y∈W one has ℓT(xy)≤ℓT(x)+ℓT(y): shortest factorizations x=t1⋯tk and y=s1⋯sl with k=ℓT(x), l=ℓT(y) exist by [F1] and concatenate to xy=t1⋯tks1⋯sl, a product of k+l elements of T. Also ℓT(x−1)=ℓT(x), because if x=t1⋯tk then x−1=tk⋯t1, giving ℓT(x−1)≤ℓT(x), and applying this to x−1 gives equality.

1.3F1

ℓT(x)=0 if and only if x=1: by [F1] an element of reflection length 0 is a product of 0 elements of T, which is the identity, and conversely the empty product represents 1; in particular 1 is the only element of reflection length 0.

2.1step 1.1F3

For u,v∈W one has u≤Tv if and only if ρ(u)≤Oρ(v): by [F3] the two relations read ℓT(v)=ℓT(u)+ℓT(u−1v) and dim⁡M(v)=dim⁡M(u)+dim⁡M(u−1v), and ℓT=dim⁡M is step 1.1.

2.2step 1.1F3F5algebra

Conjugation invariance: for u,v∈W, [F5] gives ρ(vuv−1)−id=ρ(v)(ρ(u)−id)ρ(v)−1. Since ρ(v)−1(V)=V, taking images and using [F3] yields M(vuv−1)=ρ(v)M(u). The invertible map ρ(v) preserves the dimension of this subspace, so dim⁡M(vuv−1)=dim⁡M(u) and hence ℓT(vuv−1)=ℓT(u) by step 1.1.

2.3step 1.2step 1.3

The relation ≤T is reflexive, antisymmetric and transitive, and the triangle inequality holds. Reflexive: ℓT(u)=ℓT(u)+ℓT(u−1u) by step 1.3. Antisymmetric: if u≤Tv and v≤Tu, then ℓT(u−1v)=ℓT(v)−ℓT(u) and ℓT(v−1u)=ℓT(u)−ℓT(v), while ℓT(v−1u)=ℓT((u−1v)−1)=ℓT(u−1v) by step 1.2, so ℓT(u−1v)=0 and u−1v=1, that is u=v, by step 1.3. Transitive: if u≤Tv≤Tw, then ℓT(w)=ℓT(u)+ℓT(u−1v)+ℓT(v−1w), while ℓT(u−1w)≤ℓT(u−1v)+ℓT(v−1w) and ℓT(w)≤ℓT(u)+ℓT(u−1w) by step 1.2; all inequalities are therefore equalities and ℓT(w)=ℓT(u)+ℓT(u−1w), that is u≤Tw. Triangle inequality: ℓT(v)≤ℓT(u)+ℓT(u−1v) and ℓT(u)≤ℓT(v)+ℓT(v−1u)=ℓT(v)+ℓT(u−1v) by step 1.2, so ∣ℓT(u)−ℓT(v)∣≤ℓT(u−1v).

2.4step 1.2F1

Prefix form: u≤Tv holds if and only if there are reflections t1,…,tm∈T and an index k≤m such that u=t1⋯tk and v=t1⋯tm are shortest factorizations, that is k=ℓT(u) and m=ℓT(v). If u≤Tv, then [F1] supplies shortest factorizations u=t1⋯tk and u−1v=s1⋯sl with l=ℓT(u−1v), and v=u⋅(u−1v)=t1⋯tks1⋯sl has length k+l=ℓT(v), so it is shortest and exhibits the required prefix. Conversely, given such factorizations, u−1v=(t1⋯tk)−1t1⋯tm=tk⋯t1t1⋯tm=tk+1⋯tm, so ℓT(u−1v)≤m−k and hence ℓT(u)+ℓT(u−1v)≤k+(m−k)=m=ℓT(v), while ℓT(v)≤ℓT(u)+ℓT(u−1v) by step 1.2; thus equality holds and u≤Tv.

3.1step 1.3step 2.3step 2.4F4

Part (ii). First ℓT(1)=0 by step 1.3. If u<Tv, then ℓT(v)=ℓT(u)+ℓT(u−1v) with u−1v≠1, so ℓT(u−1v)≥1 by step 1.3 and ℓT(u)<ℓT(v). Suppose now that y covers x, so x<Ty, and put d:=ℓT(y)−ℓT(x)=ℓT(x−1y)≥1; by step 2.4 there are t1,…,tm∈T with y=t1⋯tm and x=t1⋯tk shortest, so d=m−k. If d≥2, put z:=t1⋯tk+1; then z−1y=tk+2⋯tm is a product of m−k−1 elements of T, so ℓT(z−1y)≤m−k−1 and, by the triangle inequality of step 2.3, ℓT(z)≥ℓT(y)−ℓT(z−1y)≥m−(m−k−1)=k+1, while ℓT(z)≤k+1; hence ℓT(z)=k+1 and step 2.4 applied to the shortest factorizations x=t1⋯tk and z=t1⋯tk+1 gives x<Tz, and applied to z=t1⋯tk+1 and y=t1⋯tm gives z<Ty — contradicting that y covers x. Hence d=1. Every minimal element is 1: if x is minimal and x≠1, then 1<Tx because ℓT(x)=ℓT(1)+ℓT(x) by steps 1.3, a contradiction; and ℓT(1)=0. Consequently ℓT is a rank function on the finite poset (W,≤T) [F4], and every interval [u,v]T is contained in the finite set W.

3.2step 2.1F2F3

Part (iv): if u≤Tv, then ρ(u)≤Oρ(v) by step 2.1, so F2 gives M(u)⊆M(v), and then F(v)=M(v)⊥⊆M(u)⊥=F(u) by F2 and [F3].

4.1step 2.1step 2.3step 3.2F2∎

Let α≤Tδ and β≤Tδ. If α≤Tβ, then M(α)⊆M(β) by step 3.2. Conversely assume M(α)⊆M(β); by step 2.1 one has ρ(α)≤Oρ(δ) and ρ(β)≤Oρ(δ), so F2 gives ρ(α)=(ρ(δ))M(α), ρ(β)=(ρ(δ))M(β), and M(β)⊆M(δ); since the restriction assignment of F2 is an order isomorphism and M(α)⊆M(β), one has ρ(α)=((ρ(δ))M(β))M(α)=(ρ(β))M(α)≤Oρ(β), and step 2.1 gives α≤Tβ. Hence α≤Tβ if and only if M(α)⊆M(β); in particular M(α)=M(β) yields both α≤Tβ and β≤Tα, so α=β by antisymmetry in step 2.3, and the map u↦M(u) is an order isomorphism from [1,δ]T onto its image ordered by inclusion, being order-preserving and order-reflecting by the equivalence just proved and injective by the equality statement. This proves (1), (2) and (3).

5 · Examples, counterexamples and false statements

None yet.

Sources