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 — Examples

1 · Prerequisites

2 · Summary

This companion is a dependency leaf: its three examples use only the theory of finite-reflection-length-and-orthogonal-moved-spaces and that page's prerequisite closure, and no other page or item depends on them. Each example is a complete finite computation.

Simple and reflection lengths of a long transposition in S5 works in type A4: under the isomorphism W→S5, si↦(i i+1), the reflections are exactly the transpositions, the simple length of a transposition (i j) with i<j is its inversion number 2(j−i)−1, and ℓT(φ−1(σ))=5−c(σ) is read off the fixed space of σ in the sum-zero hyperplane. The long transposition (1 5) therefore has ℓ=7 but ℓT=1, and the longest element w0=(1 5)(2 4) has ℓ=10 and ℓT=2, while every 5-cycle has ℓT=4=dim⁡V; the example also exhibits (1 5)=(2 5)(1 2)(2 5)−1 explicitly as a reflection.

A moved-space intersection in A3 that is not the meet works in type A3 inside the sum-zero hyperplane of R4, under the isometry esi↦12(ei−ei+1): the elements α=φ−1((1 2)(3 4)) and β=φ−1((1 4)(2 3)) both lie below the 4-cycle γ, and their moved spaces are the two planes {x2=−x1, x4=−x3} and {x2=−x3, x4=−x1}, which meet in the line R(e1−e2+e3−e4). That line contains no root of A3, so no element of W has it as moved space, the only common lower bound of α and β is 1, and the moved space of the meet, M(1)=0, is strictly smaller than the intersection M(α)∩M(β): arbitrary subspace intersection does not compute the meet.

The Wall form and line restrictions of a plane rotation, and the necessity of a common upper bound works in the rank-two system I2(m): for A=ρ(st)=rsrt the moved space is all of V, in oriented orthonormal coordinates SA=(A−id)−1 is multiplication by 1/(eiθ−1)=−12−i2cot⁡(θ/2) with θ=2π/m, and the line restrictions HL=ΠLSAΠL are the scalar −12, so L↦AL=id−2ΠL is the bijection from lines to reflections below A, with AL∈ρ(W) exactly for the m root lines. For m=4 the pair A and w0=A2 satisfies M(w0)=V=M(A) although w0̸≤TA, A̸≤Tw0, and no element of W lies above both; this shows that the common-upper-bound hypothesis in the rigidity statement is indispensable.

The results tested here are proved on the theory page: the Wall form, the subspace restriction and the prefix form of ≤O in The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order, the factorizations and independent normals in Root normals inside the moved space, factorizations into reflections, and independent normals, and Carter's formula together with the rigidity statement in Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound. The examples are evidence within their computed scope and do not replace those proofs.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

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

Simple and reflection lengths of a long transposition in S5

Example

Let W be the Coxeter group of type A4, with S={s1,…,s4}, reflection representation V=RS with positive definite Coxeter form B, reflection set T and lengths ℓ and ℓT (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, Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator, Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound); fix the isomorphism φ:W→S5 with si↦(i i+1) (Coxeter diagrams: edges, labels, components and finite type, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4), Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations). Then:

(i) T={φ−1(τ):τ a transposition of S5} and ℓT(w)=1 for the transpositions w; for a transposition (i j) with i<j one has ℓ(φ−1(i j))=2(j−i)−1.

(ii) For the long transposition φ−1(1 5) the two lengths are ℓ=2⋅4−1=7 while ℓT=1; explicitly (1 5)=(2 5)(1 2)(2 5)−1 is a reflection and has 7 inversions.

(iii) Under the linear isometry esi↦12(ei−ei+1) of (V,B) onto the hyperplane H={x∈R5:∑ixi=0} with the standard inner product (Real and complex inner-product spaces and their induced length, Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces), φ corresponds to the permutation action, so F(φ−1(σ)) corresponds to the fixed space {x∈H:σx=x}, of dimension c(σ)−1 for the cycle count c(σ) (fixed points included). Since dim⁡M=dim⁡V−dim⁡F (In finite dimension, W⊥⊥=W and dim⁡W+dim⁡W⊥=dim⁡V) and ℓT=dim⁡M, one has ℓT(φ−1(σ))=dim⁡H−(c(σ)−1)=5−c(σ) for every σ∈S5. In particular ℓT(φ−1(1 5))=1; for the longest element w0=φ−1((1 5)(2 4)) one has ℓ(w0)=10 while ℓT(w0)=5−3=2 (the reversal has three cycles), and every 5-cycle has ℓT=4=dim⁡V.

Facts & Assumptions

Given: The type-A4 Coxeter datum W,S,V,B,ρ,Φ,T and the isomorphism φ:W→S5 with si↦(i i+1); a permutation σ∈S5 acts on R5 by permuting coordinates.

[F1]

si↦(i i+1) extends to an isomorphism φ:W→S5, ℓ(w)=inv⁡(φ(w)) for the inversion number, and S generates W. Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification

[F2]

ρ(si)=resi, T={wsw−1:w∈W, s∈S}, Φ={ρ(w)es:w∈W, s∈S}, and B(es,et)=−cos⁡(π/m(s,t)) with m(si,sj)=3 for adjacent and 2 for non-adjacent generators of A4. The canonical reflection homomorphism, roots, reflections, and the positive cone The real Coxeter form, its radical, reflections, and form-preserving maps

[F3]

ℓT(w)=dim⁡M(w)=dim⁡V−dim⁡F(w), M(w)=F(w)⊥ and V=M(w)⊕F(w); every line of V is the moved space of a unique reflection of the orthogonal group of (V,B). Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order

[F4]

F(w)=ker⁡(ρ(w)−id) and M(w)=im⁡(ρ(w)−id) for w∈W, and T is the reflection set in which ℓT is computed. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator

[F5]

The inversion number of a permutation is the number of pairs a<b with σ(a)>σ(b). Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations

[F6]

Each ρ(si) is an inner-product-preserving involution with normal esi. An orthogonal operator with moved line L equals id−2ΠL and fixes L⊥ pointwise. Descent of the reflection representation, unit root norms, and conjugation of reflections (1), (2), (4), The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order (3).

[F7]

Write γ=π/2 for the smallest positive cosine zero; 0<γ<2, and cosine is strictly decreasing on [0,2]. Also cos⁡(π/2)=0, cos⁡(π−x)=−cos⁡x, and cos⁡(2x)=2cos⁡2x−1. Pi as twice the smallest positive zero of cosine Cosine has a smallest positive zero, lying strictly between zero and two Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3 Quarter-turn values and shifts by pi/2 and pi Double-angle and quadratic power-reduction identities Parity and the Pythagorean identity for sine and cosine

Verification

technique · direct
1.1F1F2F3F6F7

Put c:=cos⁡(π/3). By [F7], 0<π/3<γ<2 gives c>cos⁡γ=0, while 2c2−1=cos⁡(2π/3)=−c, so (2c−1)(c+1)=0 and c=12; also cos⁡(π/2)=0 by [F7]. Put vi:=12(ei−ei+1)∈H for 1≤i≤4. Then ⟨vi,vi⟩=1, ⟨vi,vi+1⟩=−12 and ⟨vi,vj⟩=0 for ∣i−j∣≥2, matching B(esi,esj)=−cos⁡(π/m(si,sj)) by [F2] and [F7]; since the vi are linearly independent (their coordinates in the order (e1,…,e5) are (a,−a+b,−b+c,−c+d,−d)/2 for av1+bv2+cv3+dv4) and every x∈H equals 2∑i=14(x1+⋯+xi)vi, they form a basis of H, so dim⁡H=4 and the map Θ:V→H with Θ(esi)=vi is a linear isometry onto H. For each i the transposition (i i+1) preserves H, reverses vi and fixes vi⊥∩H pointwise, so it is the reflection with normal line Rvi; the image Θρ(si)Θ−1 is by [F2] and [F6] likewise an inner-product-preserving involution of H that reverses vi and fixes vi⊥∩H pointwise, so the two agree on all of H. Since φ is an isomorphism and S generates W [F1], the homomorphisms ΘρΘ−1 and σ↦σ∣H agree on S, hence everywhere: Θρ(w)Θ−1=φ(w)∣H for all w∈W. The permutation action on H is faithful, because if σ acts trivially then σ(ei−ek)=ei−ek for all i≠k, and choosing k∉{i,σ(i)} forces σ(i)=i. Therefore for t=wsw−1∈T the permutation φ(t) has moved line ΘRρ(w)es=R(ep−eq) for some p≠q and fixes the orthogonal hyperplane pointwise, so φ(t)(p q)−1 acts trivially on H and φ(t)=(p q); conversely every transposition (p q)=σ(1 2)σ−1 equals φ(us1u−1) for u:=φ−1(σ), so T={φ−1(τ):τ a transposition}.

1.2F5algebra

For a permutation σ∈S5 the inversion number of the transposition (i j), i<j, is 2(j−i)−1: the pairs a<b with (i j)a>(i j)b are exactly the j−i−1 pairs (i,k) with i<k<j, the single pair (i,j), and the j−i−1 pairs (k,j) with i<k<j. In particular the transposition (1 5) has 2⋅4−1=7 inversions, and the reversal (1 5)(2 4) inverts every one of the (52)=10 pairs, so it has 10 inversions, the maximal value; in S5 this is the longest element.

2.1step 1.1F3F4

By step 1.1 the fixed space of ρ(w) corresponds to {x∈H:σx=x} for σ=φ(w), and ℓT(w)=4−dim⁡{x∈H:σx=x} by [F3]. The fixed space of σ in R5 is spanned by the incidence vectors of its cycles, so it has dimension c(σ) and its intersection with H is defined by the single equation ∑C∣C∣aC=0 on the cycle coefficients aC. Every ∣C∣ is positive, so fixing one cycle lets its coefficient be solved uniquely from the other c(σ)−1 coefficients; the intersection therefore has dimension c(σ)−1; hence ℓT(w)=4−(c(σ)−1)=5−c(σ), with c(σ) the number of cycles of σ (fixed points included). In particular a transposition has c=4 and ℓT=1, the long transposition (1 5) has c=4 and ℓT=1, the reversal (1 5)(2 4) has c=3 and ℓT=2, and a 5-cycle has c=1 and ℓT=4=dim⁡V.

3.1step 1.1step 1.2step 2.1F1F3∎

Collecting the results: by step 1.1 the reflections of W are exactly the φ−1(τ) with τ a transposition, and each has ℓT=1 by step 2.1, which is claim (i)'s first part, while claim (i)'s second part is the inversion count of step 1.2. For the long transposition, ℓ(φ−1(1 5))=7 by steps 1.2 and [F1] and ℓT(φ−1(1 5))=1 by step 2.1, and φ−1(1 5)∈T because (1 5)=(2 5)(1 2)(2 5)−1 exhibits (1 5) as φ(us1u−1) for the element u:=φ−1(2 5); this is claim (ii). Claim (iii)'s dimension formula, the values ℓ(w0)=10 and ℓT(w0)=2, and ℓT=4 for every 5-cycle are steps 1.2, 2.1 and [F1].

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

The Wall form and line restrictions of a plane rotation, and the necessity of a common upper bound

Example

Let m≥3, c=cos⁡(π/m), V=Res+Ret with the positive definite Coxeter form B of the rank-two system I2(m), and let A:=ρ(st)=rsrt (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3), The canonical reflection homomorphism, roots, reflections, and the positive cone, Classification of finite Coxeter systems, including the H and dihedral families); let ℓT, M 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 and The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order, and let T, Φ be the reflection set and root system (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)). Use faithfulness of The root-length criterion and faithfulness of the canonical reflection representation (3) to identify W with ρ(W) when writing ℓ, ℓT and ≤T for these operators. Then:

(i) tr⁡A=2cos⁡(2π/m)≠2=tr⁡id, so 1 is not an eigenvalue of A, F(A)=0 and M(A)=V. In oriented orthonormal coordinates adapted to A it is the rotation by θ=2π/m, and

SA=(A−id)−1 is multiplication by 1eiθ−1=−12−i2cot⁡θ2,

so the Wall form χA(u,v)=B(SAu,v) satisfies χA(u,v)+χA(v,u)=−B(u,v) with symmetric part −12B.

(ii) For every line L⊆V the operator HL=ΠLSAΠL is the scalar −12 on L, so AL=id−2ΠL is the reflection of the plane with normal line L, AL≤OA, and L↦AL is a bijection from the lines of V onto the reflections B≤OA. Moreover AL lies in ρ(W) if and only if L is one of the m root lines Rβ, β∈Φ; so for a line L that is not a root line, AL is an orthogonal reflection whose moved space is L but AL∉ρ(W).

(iii) Take m=4 and put w0:=A2 (the rotation by π, the longest element of W=I2(4)). Then M(A)=M(w0)=V, so M(w0)⊆M(A), while

ℓT(w0−1A)=ℓT(A−1w0)=ℓT(A)=2,

so w0̸≤TA and A̸≤Tw0; in fact A and w0 have no common upper bound in W, since every δ∈W has ℓT(δ)=dim⁡M(δ)≤2 (Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)), so a common upper bound would have to equal both A and w0. Hence the implication M(α)⊆M(β)⇒α≤Tβ fails without the common-upper-bound hypothesis of the rigidity theorem.

Facts & Assumptions

Given: The rank-two datum m≥3, c=cos⁡(π/m), V=Res+Ret, B, ρ, T, Φ and the elements A=ρ(st)=rsrt, w0=A2; ℓT, M, F, ΠL, HL, AL are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator and The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order.

[F1]

In the ordered basis (es,et) one has B(es,es)=B(et,et)=1 and B(es,et)=−c with c=cos⁡(π/m), and B∣V is positive definite for finite m; the product A=rsrt has the matrix (4c2−1−2c2c−1) of determinant 1, trace 2cos⁡(2π/m) and order m (that is, Am=idV and Ak≠idV for 0<k<m). The real Coxeter form, its radical, reflections, and form-preserving maps Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order

[F2]

The type I2(m), 3≤m<∞, is the finite-type diagram with two vertices joined by a single edge labelled m; the corresponding Coxeter system has exactly the two simple reflections s,t, and ρ(st)=rsrt. Classification of finite Coxeter systems, including the H and dihedral families Coxeter diagrams: edges, labels, components and finite type The canonical reflection homomorphism, roots, reflections, and the positive cone

[F3]

The Wall form lemma holds on the positive definite plane (V,B): (1) M(X)=F(X)⊥ and V=M(X)⊕F(X); (2) χX(u,v)=B((X−id)∣M(X)−1u,v) satisfies χX(u,v)+χX(v,u)=−B(u,v), is nondegenerate, and has symmetric part −12B; (3) for a line L⊆M(X) the operator HL with B(HLu,v)=χX(u,v) on L satisfies HL+HL∗=−idL and is invertible, AL=id+HL−1 on L and id on L⊥ has M(AL)=L, and the reflections of the orthogonal group of V are exactly the maps id−2ΠL for lines L; (4) AL≤OX, and U↦XU is a bijection from the subspaces of M(X) onto {Y:Y≤OX} with inverse Y↦M(Y), order-preserving and order-reflecting for inclusion and ≤O. The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order

[F5]

Every nonzero moved space of an element of W contains a root; for every root β the reflection with normal β equals ρ(tβ) with tβ∈T; the map {±α:α∈Φ}→T, {±α}↦tα, is a bijection, so the root lines Rα are in bijection with T; and ρ is injective. Root normals inside the moved space, factorizations into reflections, and independent normals The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange The root-length criterion and faithfulness of the canonical reflection representation

[F6]

Trigonometry: π is twice the smallest positive zero of cos⁡, which lies in (0,2), so 0<π<4, cos⁡(π/2)=0 and cos⁡ has no zero in [0,π/2); sin⁡x>0 for 0<x≤2 and cos⁡ is strictly decreasing on [0,2]; sin⁡2x+cos⁡2x=1; sin⁡2x=2sin⁡xcos⁡x and cos⁡2x=1−2sin⁡2x; eiθ=cos⁡θ+isin⁡θ; and cot⁡=cos⁡/sin⁡ where defined. Pi as twice the smallest positive zero of cosine Cosine has a smallest positive zero, lying strictly between zero and two Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3 Parity and the Pythagorean identity for sine and cosine Double-angle and quadratic power-reduction identities exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0 Tangent, cotangent, secant, and cosecant on their exact natural domains

[F7]

u≤Tv means ℓT(v)=ℓT(u)+ℓT(u−1v), and B≤OX means dim⁡M(X)=dim⁡M(B)+dim⁡M(B−1X). Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator

Verification

technique · direct
1.1F1F2F6

By [F1] the matrix of A in the basis (es,et) has determinant 1 and trace 2cos⁡(2π/m), and A has order m; the trace differs from tr⁡id=2 because 1−cos⁡(2π/m)=2sin⁡2(π/m)>0 by [F6], as π/m∈(0,π/3]⊂(0,2] gives sin⁡(π/m)>0.

1.2F1F3F6

Put u:=(es+et)/2−2c and w~:=(et−es)/2+2c; the square roots are nonzero because 2−2c=4sin⁡2(π/(2m))>0 and 2+2c=4cos⁡2(π/(2m))>0, since 0<π/(2m)≤π/6<2 and cos⁡ has no zero in [0,π/2) by [F6]. A direct computation with [F1] gives B(u,u)=B(w~,w~)=1 and B(u,w~)=0, so (u,w~) is an oriented orthonormal basis, and computing Au=cos⁡θ u+sin⁡θ w~, Aw~=−sin⁡θ u+cos⁡θ w~ with θ:=2π/m: indeed B(Au,u)=2c2−1=cos⁡θ, B(Au,w~)=2csin⁡(π/m)=sin⁡θ, B(Aw~,u)=−sin⁡θ and B(Aw~,w~)=2c2−1=cos⁡θ, using 1−c2=sin⁡2(π/m) and the double-angle identities of [F6]. Hence in these coordinates A is the rotation by θ=2π/m, and 1 is not an eigenvalue of A: the matrix of A−id has determinant (cos⁡θ−1)2+sin⁡2θ=2−2cos⁡θ=4sin⁡2(θ/2)≠0, since θ/2=π/m∈(0,2]. Therefore F(A)=ker⁡(A−id)=0 and M(A)=F(A)⊥=V by F3. Moreover SA=(A−id)−1, computed from the displayed rotation matrix, is 12(−1sin⁡θ/(1−cos⁡θ)−sin⁡θ/(1−cos⁡θ)−1)=−12id−12cot⁡(θ/2)J with J=(0−110), because sin⁡θ/(1−cos⁡θ)=cot⁡(θ/2) by the double-angle identities; under the identification of the oriented plane with C, the matrix J is multiplication by i, so SA is multiplication by −12−i2cot⁡(θ/2), and (eiθ−1)(−12−i2cot⁡(θ/2))=1 by the displayed identity eiθ=cos⁡θ+isin⁡θ together with sin⁡2θ+cos⁡2θ=1 and sin⁡θ/(1−cos⁡θ)=cot⁡(θ/2), so SA is multiplication by 1/(eiθ−1). The identity χA(u,v)+χA(v,u)=−B(u,v) with symmetric part −12B is F3.

2.1step 1.2F1F3F4F5F7

Part (iii). Take m=4, so θ=π/2 and the rotation matrix of step 1.2 gives A2=(−100−1)=−idV; hence M(w0)=im⁡(−2id)=V=M(A) for w0:=A2, so M(w0)⊆M(A). By [F4] and step 1.2, ℓT(A)=dim⁡M(A)=2 and ℓT(w0)=dim⁡M(w0)=2; also w0−1A=A−2A=A−1 and A−1w0=A−1A2=A, and A−1=A3 has moved space V because F(A−1)=F(A)=0, so ℓT(w0−1A)=ℓT(A−1w0)=ℓT(A)=2. Hence ℓT(A)=2≠4=ℓT(w0)+ℓT(w0−1A) and ℓT(w0)=2≠4=ℓT(A)+ℓT(A−1w0), so w0̸≤TA and A̸≤Tw0 by [F7]. If some δ∈W satisfied A≤Tδ and w0≤Tδ, then 2=ℓT(A)≤ℓT(δ) and ℓT(δ)=dim⁡M(δ)≤dim⁡V=2 by [F4], so [F7] gives ℓT(δ)=ℓT(A)+ℓT(A−1δ)=2 and hence ℓT(A−1δ)=0; then A−1δ=1, since ℓT(x)=dim⁡M(x)=0 forces ρ(x)=id and x=1 by [F5], so δ=A, contradicting w0̸≤TA; thus A and w0 have no common upper bound. Finally w0=A2 is the unique longest element. Since sAs=A−1 and t=A−1s, every word reduces to Ak or Aks with 0≤k≤3. The four rotations are distinct by the order of A; the four Aks are distinct by cancellation, and the two lists cannot overlap: overlap would give s=Aj, whereas s has moved dimension one by [F3] and [F5], and Aj has moved dimension zero for j=0 and two for j=1,2,3 by the displayed rotation matrices. These eight elements are 1,s,t,st,ts,sts,tst,stst, because As=sts, A3s=t, and A2s=tst (the relation A4=1 gives stst=tsts). A word of length at most three reduces, by cancelling adjacent equal generators, to one of the first seven words; these are distinct from A2=stst. Thus ℓ(A2)=4, and every other element has length at most three.

2.2step 1.2F3

Part (ii), first half. Let L⊆V be a line; since M(A)=V by step 1.2, L⊆M(A), so the operator HL=ΠLSAΠL of F3 is defined. As L is one-dimensional, HL is multiplication by a real scalar λ, and the identity HL+HL∗=−idL of F3 gives 2λ=−1, so λ=−12; hence AL=id+HL−1 acts on L as −idL and on L⊥ as the identity, that is AL=id−2ΠL. By F3 M(AL)=L, and AL≤OA by F3. The assignment L↦AL is a bijection from the lines of V onto the reflections B≤OA: F3 gives a bijection U↦AU from the subspaces of M(A)=V onto {B:B≤OA} whose inverse is B↦M(B) and which satisfies M(AU)=U, and the one-dimensional subspaces of V are the lines, while the elements B≤OA with dim⁡M(B)=1 are exactly the reflections B≤OA (the elements B=id and B=A correspond to U=0 and U=V and are not reflections, as dim⁡M(A)=2).

2.3step 1.2F1F5

T has exactly m elements. Since A=st one has sA=t and A−1=ts, and the set W0:={Aj,Ajs:0≤j<m} contains 1, A, s=A0s and t=Am−1s and is closed under multiplication and inversion, since sAjs=A−j for every j: it is a subgroup of W containing s and t, so W0=W. Conjugation by the elements of W0 gives AksA−k=A2ks, AktA−k=A2k−1s and (Aks)t(Aks)−1=A2k+1s, so every element of T lies in {Ajs:0≤j<m}, while conversely A2ks=AksA−k and A2k−1s=AktA−k are conjugates of s and t; hence T={Ajs:0≤j<m}, and these m elements are distinct because A has order m by [F1]. By the bijection {±α:α∈Φ}→T of [F5] the plane has exactly m root lines, and the lines R(es+aet) for a∈R are pairwise distinct, so there are infinitely many lines and some are not root lines.

3.1step 2.2F5

Part (ii), second half. If L=Rβ for a root β∈Φ, then by [F5] the reflection id−2ΠL with normal β equals rβ=ρ(tβ)∈ρ(W); by step 2.2 this operator is AL, so AL∈ρ(W). Conversely suppose AL∈ρ(W), say AL=ρ(w); then dim⁡M(w)=dim⁡M(AL)=1 by step 2.2, so the nonzero moved space M(w)=L contains a root β by [F5], and L=Rβ is a root line. Hence AL lies in ρ(W) exactly when L is one of the m root lines, and for every other line L the operator AL is an orthogonal reflection with moved space L such that AL∉ρ(W).

4.1step 1.1step 1.2step 2.1step 2.2step 2.3step 3.1∎

Collecting the verified claims: (i) is steps 1.1 and 1.2; (ii) is steps 2.2, 2.3 and 3.1; (iii) is step 2.1. In particular the converse implication M(α)⊆M(β)⇒α≤Tβ of the rigidity theorem fails in W=I2(4) when no common upper bound is available: α:=w0 and β:=A satisfy M(α)=V=M(β) by step 1.2, while w0̸≤TA and A and w0 have no common upper bound in W, both by step 2.1.

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

A moved-space intersection in A3 that is not the meet

Example

Let W be the Coxeter group of type A3, with S={s1,s2,s3}, V=RS with positive definite Coxeter form, reflection set T and lengths ℓT,ℓ, and let φ:W→S4, si↦(i i+1), be the type-A isomorphism (Coxeter diagrams: edges, labels, components and finite type, The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4), Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator, Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound). Put

γ=φ−1(1 2 3 4),α=φ−1((1 2)(3 4)),β=φ−1((1 4)(2 3)).

Then:

(i) ℓT(γ)=3, ℓT(α)=ℓT(β)=2, and α≤Tγ, β≤Tγ: indeed αγ=φ−1(2 4) and βγ=φ−1(1 3) are reflections, so γ=α⋅α−1γ and γ=β⋅β−1γ display the rank additivity 3=2+1.

(ii) Under the isometry esi↦12(ei−ei+1) of V with H={x∈R4:∑ixi=0} and the standard inner product, one has

M(α)={x∈H:x2=−x1, x4=−x3},M(β)={x∈H:x2=−x3, x4=−x1},

and M(α)∩M(β)=R(e1−e2+e3−e4) is a line containing no root of A3.

(iii) No element of W has moved space M(α)∩M(β): a nonzero moved space of an element of W contains a root (Root normals inside the moved space, factorizations into reflections, and independent normals (1)), while this line contains none. Moreover the greatest common lower bound of α and β in (W,≤T) is 1: any common lower bound τ satisfies M(τ)⊆M(α)∩M(β) (Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (2)(iv)), so τ=1 by the same root-existence clause; hence the moved space of the meet, M(1)=0, is strictly smaller than the intersection of the two moved spaces, and arbitrary subspace intersection does not compute the meet.

Facts & Assumptions

Given: The type-A3 Coxeter datum W,S,V,B,ρ,Φ,T and the isomorphism φ:W→S4 with si↦(i i+1); ℓT, M, F are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator, and σ∈S4 acts on R4 by permuting coordinates.

[F1]

si↦(i i+1) extends to an isomorphism φ:W→S4, and S generates W. Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification

[F3]

If M(w)≠0 for w∈W, then M(w) contains a root of Φ. Root normals inside the moved space, factorizations into reflections, and independent normals

[F5]
[F6]

Φ={ρ(w)es:w∈W, s∈S}, T={wsw−1:w∈W, s∈S}, and B(es,et)=−cos⁡(π/m(s,t)) with m(s,t)=3 for adjacent and 2 for non-adjacent generators of A3. Also u≤Tv means ℓT(v)=ℓT(u)+ℓT(u−1v), and ℓT(u)=0 holds exactly when u=1, since only the empty product has length zero. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator The canonical reflection homomorphism, roots, reflections, and the positive cone The real Coxeter form, its radical, reflections, and form-preserving maps Coxeter diagrams: edges, labels, components and finite type

[F7]

Write γ=π/2 for the smallest positive cosine zero; 0<γ<2, and cosine is strictly decreasing on [0,2]. Also cos⁡(π/2)=0, cos⁡(π−x)=−cos⁡x, and cos⁡(2x)=2cos⁡2x−1. Pi as twice the smallest positive zero of cosine Cosine has a smallest positive zero, lying strictly between zero and two Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3 Quarter-turn values and shifts by pi/2 and pi Double-angle and quadratic power-reduction identities Parity and the Pythagorean identity for sine and cosine

Verification

technique · direct
1.1F1F5F6F7given

Put c:=cos⁡(π/3). By [F7], 0<π/3<γ<2 gives c>cos⁡γ=0, while 2c2−1=cos⁡(2π/3)=−c, so (2c−1)(c+1)=0 and c=12; also cos⁡(π/2)=0 by [F7]. Put vi:=12(ei−ei+1)∈H for i=1,2,3. Then ⟨vi,vi⟩=1, ⟨vi,vi+1⟩=−12 and ⟨vi,vj⟩=0 whenever ∣i−j∣≥2, which by [F6] and [F7] matches B(esi,esj)=−cos⁡(π/m(si,sj)); the vi are linearly independent, since the coordinates of av1+bv2+cv3 are (a,−a+b,−b+c,−c)/2, and every x∈H equals 2(x1v1+(x1+x2)v2+(x1+x2+x3)v3), so they form a basis of the three-dimensional space H and the linear map Θ:V→H with Θ(esi)=vi is a linear isometry onto H. For each i the permutation (i i+1) preserves H, fixes vi⊥∩H pointwise and sends vi to −vi, so it acts on H as an orthogonal involution with moved space Rvi; the image Θρ(si)Θ−1 is an orthogonal involution with the same moved space Rvi by [F5], and by the uniqueness in [F5] the two are equal. Since φ is an isomorphism [F1] and S generates W, the two homomorphisms ΘρΘ−1 and σ↦σ∣H from W to the orthogonal group of H agree on S, hence everywhere: Θρ(w)Θ−1=φ(w)∣H for all w∈W. In particular ΘΦ={σvi:σ∈S4, i≤3}={±12(ep−eq):p≠q}, because φ is onto and the transpositions of S4 are the images of the conjugate reflections.

2.1step 1.1F1F2

Under the identification of step 1.1, F(w)=Θ−1{x∈H:φ(w)x=x} and ℓT(w)=dim⁡V−dim⁡F(w)=3−dim⁡{x∈H:φ(w)x=x} by [F2]. For γ=φ−1(1 2 3 4) the fixed space in R4 of the 4-cycle (1 2 3 4) is R(e1+e2+e3+e4), which meets H in 0, so ℓT(γ)=3. For α=φ−1((1 2)(3 4)) the fixed space in R4 is {x:x1=x2, x3=x4}, whose intersection with H is R(e1+e2−e3−e4), of dimension 1; hence ℓT(α)=2, and the same computation with x1=x4, x2=x3 gives fixed space R(e1−e2−e3+e4)∩H of dimension 1 and ℓT(β)=2. Finally αγ=φ−1(2 4) and βγ=φ−1(1 3) by the multiplication convention (στ)(x)=σ(τ(x)) applied in S4: for instance αγ sends 1↦1, 2↦4, 3↦3, 4↦2, so it is the transposition (2 4); and for a transposition (p q) the fixed space in R4 has dimension 3 (inside H its coordinates satisfy xp=xq=a and 2a+xr+xs=0 for the remaining indices r,s, leaving two free parameters), so ℓT(φ−1(p q))=3−2=1.

2.2step 1.1F2

Since F(α) is the line R(e1+e2−e3−e4) in the model of step 1.1 and Θ is an isometry, M(α)=F(α)⊥ is, inside H, the orthogonal complement of e1+e2−e3−e4, namely {x∈H:x1+x2−x3−x4=0}={x∈H:x2=−x1, x4=−x3}; likewise F(β)=R(e1−e2−e3+e4) gives M(β)={x∈H:x1−x2−x3+x4=0}={x∈H:x2=−x3, x4=−x1}. Intersecting the two sets gives x2=−x1, x3=−x2=x1, x4=−x1 (the sum condition is then automatic), so M(α)∩M(β)=R(e1−e2+e3−e4) is a line.

3.1step 2.1F6

Since α−1γ=αγ=φ−1(2 4) because α is an involution, step 2.1 gives ℓT(γ)=3=2+1=ℓT(α)+ℓT(α−1γ), so α≤Tγ by the definition of ≤T in [F6], and the analogous computation with βγ=φ−1(1 3) gives β≤Tγ.

3.2step 1.1step 2.2F3

By step 1.1 the roots of A3 in the model are the twelve vectors ±12(ep−eq), p≠q, and none of these is a real multiple of e1−e2+e3−e4, so the line R(e1−e2+e3−e4) of step 2.2 contains no root; hence no w∈W has M(w)=R(e1−e2+e3−e4), because a nonzero moved space contains a root by [F3].

4.1step 2.2step 3.1step 3.2F2F4F6∎

Let τ∈W be a common lower bound of α and β, so M(τ)⊆M(α)∩M(β)=R(e1−e2+e3−e4) by [F4] and step 2.2. If M(τ)≠0, then M(τ) equals that line and τ is an element with moved space the line, contradicting step 3.2; hence M(τ)=0 and τ=1 by [F2]; since 1≤Tα,β, the greatest common lower bound of α and β is 1, and M(1)=0 is strictly smaller than the line M(α)∩M(β). This verifies (i), (ii) and (iii).

Sources