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.

✓ 4 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. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Canonical Roots, Signs, and Faithful Reflections

1 · Prerequisites

2 · Summary

The canonical reflection representation of a Coxeter group presented by an abstract Coxeter matrix is not an extra hypothesis: this page proves, with no definiteness condition on the form, that s↦rs extends to a homomorphism whose kernel is trivial and whose chamber geometry mirrors the length function. The rank-two half-space alternative and the chamber-length induction (Pn), (Qn) first reduces to a rank-two plane, where the two standard dihedral pictures (finite and infinite) are read off from the explicit dual action, and then runs the simultaneous induction (Pn), (Qn) of Davis 4.8.3 with both implication steps: every chamber wC∘ lies wholly on one side of every simple wall, the negative side forcing the corresponding left descent, and every w admits a rank-two prefix u with wC∘⊆u(Bs∩Bt) and ℓ(w)=ℓs,t(u)+ℓ(u−1w). Only the open chamber and open half-spaces are used; equality on closed walls is never asserted.

From that induction, Root sign coherence and the action of simple reflections on positive roots completes the sign theory: every root lies in V+∖{0} or in −V+∖{0} and not in both, with no crystallographic integrality or assumed root-system axiom substituted for the real proof, and rs permutes Φ+∖{es} while sending es to −es. The root-length criterion and faithfulness of the canonical reflection representation then converts signs into lengths, ℓ(ws)>ℓ(w)  ⟺  ρ(w)es∈Φ+, deduces that the chambers wC∘ are pairwise disjoint, and concludes that ρ — and the dual action — is injective for every Coxeter matrix in finite rank, indefinite or degenerate B included.

The geometric inversion set N(w) of an element of a Coxeter group defines the geometric inversion set N(w)=Φ+∩ρ(w)−1Φ− with an explicit left/right convention (suffix roots for N(w), prefix roots for N(w−1)) and records its step recursion, asserting no finiteness in the definition itself; finiteness and independence are supplied by The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange, which proves ∣N(w)∣=ℓ(w) and the two root lists, identifies ±α with the conjugate reflection tα through faithfulness, and proves strong exchange: for t∈T with ℓ(tw)<ℓ(w), one letter of any reduced expression of w is deleted, and t is the corresponding prefix reflection.

Earlier pages: real-forms-and-reflection-geometry supplies the Coxeter form, the reflections ra, the canonical homomorphism, the dual chambers and the rank-two chamber tiling, and coxeter-presentations-exchange-and-reduced-word-theorems supplies the presented group with its length function, the dihedral root recurrences, exchange and deletion, the signed action and the parabolic minimal-representative theorem. The companion canonical-roots-signs-and-faithful-reflections-examples computes the roots, inversion sets and chamber images in I2(5), A2 and infinite dihedral type. Every argument on this page is choice-free.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

The rank-two half-space alternative and the chamber-length induction (Pn), (Qn)

Statement

Let S be a finite set, m a Coxeter matrix on S, W the group presented by (S,m) with length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), V=RS, B the Coxeter form, ρ:W→GL(V) the canonical reflection homomorphism with root system Φ (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let V∗ be the algebraic dual with its dual action, its chamber C, its interior C∘ and its root hyperplanes Hα (The dual action, chambers, faces, and root hyperplanes). For s∈S put Bs:={f∈V∗:f(es)>0}; then C∘=⋂s∈SBs and the translate sBs={f∈V∗:f(es)<0} is the opposite open half-space. For distinct s,t let Ws,t:=⟨s,t⟩≤W be the standard parabolic subgroup, with intrinsic length ℓs,t, which agrees with ℓ on Ws,t (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)). For s≠t and k≥0 let uk be the alternating word s t s⋯ of k letters beginning with s, so u0=1.

(1) Rank-two half-space alternative. Let s≠t and v∈Ws,t. For each s′∈{s,t} exactly one of v(Bs∩Bt)⊆Bs′,v(Bs∩Bt)⊆s′Bs′ holds, and if the second holds then ℓs,t(s′v)=ℓs,t(v)−1. Moreover, if m(s,t)<∞ then the elements u0,…,u2m(s,t)−1 exhaust Ws,t, with ℓs,t(uk)=min⁡(k,2m(s,t)−k), and the unique element of Ws,t having both s and t as left descents is um(s,t); if m(s,t)=∞ then ℓs,t(uk)=k for every k≥0, the elements uk are pairwise distinct, and no element of Ws,t has both s and t as left descents.

(2) The simultaneous induction. For n≥0 let (Pn): for all w∈W with ℓ(w)=n and all s∈S, wC∘⊆Bs, or wC∘⊆sBs and ℓ(sw)=ℓ(w)−1; (Qn): for all w∈W with ℓ(w)=n and all s≠t there is u∈Ws,t with wC∘⊆u(Bs∩Bt) and ℓ(w)=ℓs,t(u)+ℓ(u−1w). Then (Pn) and (Qn) hold for every n≥0. Explicitly: (P0) and (Q0) are immediate; (1) together with (Qn) yields (Pn+1); and (1) together with (Qn) and (Pm) for all m≤n+1 yields (Qn+1).

(3) Canonical factorisation. Let w∈W and s≠t. Write w=u d with u∈Ws,t and d the minimal representative of the right coset Ws,tw. Then ℓ(w)=ℓ(u)+ℓ(d) and ℓ(s′d)>ℓ(d) for s′∈{s,t} (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3)), and wC∘⊆u(Bs∩Bt),ℓ(w)=ℓs,t(u)+ℓ(u−1w).

(4) Chamber-descent equivalence. For every w∈W and s∈S one has wC∘⊆Bs or wC∘⊆sBs; moreover wC∘⊆sBs  ⟺  ℓ(sw)<ℓ(w).

Facts & Assumptions

Given: a finite set S, a Coxeter matrix m, the presented group W with length function ℓ, the space V=RS with its canonical basis (es), the Coxeter form B, the canonical reflection homomorphism ρ with root system Φ, the dual action on V∗ with chamber C, interior C∘ and root hyperplanes Hα, and for s≠t the standard parabolic subgroup Ws,t=⟨s,t⟩ with intrinsic length ℓs,t and alternating words uk=s t s⋯ of k letters beginning with s.

[F1]

For s≠t put c:=c(s,t), equal to cos⁡(π/m(s,t)) when m(s,t)<∞ and to 1 when m(s,t)=∞; then B(es,es)=1, B(es,et)=−c, and with P:=Res+Ret, P⊥={v∈V:B(v,es)=B(v,et)=0} the reflections rs,rt preserve P, fix P⊥ pointwise, and satisfy rs(es)=−es, rs(et)=et+2ces (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).

[F2]

The assignment s↦rs induces the group homomorphism ρ:W→GL(V), the root system is Φ={ρ(w)es:w∈W, s∈S}, every root satisfies B(α,α)=1, and ρ(wsw−1)=rρ(w)es for all w∈W, s∈S (The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections).

[F3]

The formula (w⋅f)(v):=f(ρ(w)−1v) defines a left action of W on V∗ by linear maps, C∘={f∈V∗:f(er)>0 for all r∈S} is nonempty, and Hα={f∈V∗:f(α)=0}. For s≠t, in the coordinates (ys,yt) of P∗=Rfs+Rft with dual basis fs(et)=δst, the dual generators act by (ys,yt)↦(−ys, 2cys+yt) for s and (ys,yt)↦(ys+2cyt, −yt) for t, each fixing the line Hes∩P∗ respectively Het∩P∗ pointwise; when m(s,t)=∞ the functional f↦f(es+et) is Ws,t-invariant (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).

[F4]

Let CP:={f∈P∗:f(es)≥0, f(et)≥0} and ΦP:=Ws,t{es,et}. If m:=m(s,t)<∞, then Ws,t has order 2m and the 2m chambers wCP (w∈Ws,t) are exactly the 2m closed sectors cut out in P∗ by the m root lines Hβ∩P∗ (β∈ΦP); they have pairwise disjoint interiors, their union is P∗, Ws,t acts simply transitively on them, and distinct chambers are separated by a root line. If m=∞, the chambers wCP have pairwise disjoint interiors with union {f∈P∗:f(es+et)>0}∪{0} (so every chamber meets the boundary line {f:f(es+et)=0} only in 0), distinct chambers are separated by a root line, and the traces of the root lines on the affine line {f:f(es+et)=1} are exactly the integers in the coordinate ys (The dual action, the faces, and the rank-two chamber tiling).

[F5]

There is a homomorphism sgn⁡:W→{±1} with sgn⁡(s)=−1 and sgn⁡(w)=(−1)ℓ(w) for all w∈W; hence ℓ(ws)=ℓ(w)±1 for all w∈W and s∈S. Also ℓ(s)=1 for every s∈S, so s≠1 in W. Distinct generators are distinct in W, the product st has order exactly m(s,t) in W, the standard parabolic subgroup Ws,t is the Coxeter system presented by the restricted matrix on {s,t} with intrinsic length ℓs,t equal to ℓ on Ws,t, and every right coset Ws,ta has a unique minimal-length representative d, characterized by ℓ(s′d)>ℓ(d) for s′∈{s,t} and satisfying ℓ(ud)=ℓ(u)+ℓ(d) for all u∈Ws,t (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness, Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).

[F6]

For s≠t and q≥1, if m(s,t)<∞ and q≤m(s,t), or if m(s,t)=∞, then the alternating word of length q beginning with s has length q in Ws,t (The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness); the same holds for the alternating word beginning with t.

[F7]

Induction principle on the natural numbers: if a property holds for 0 and its validity at all m≤n implies it at n+1, then it holds for every n≥0 (The principle of mathematical induction).

Proof

technique · direct
1.1F1F3F5given

Set-up. For the rank-two calculation fix s≠t in S and adopt the notation of [F1] and [F3]. For r∈S the sets Br={f∈V∗:f(er)>0} and rBr={f∈V∗:f(er)<0} are disjoint and C∘=⋂r∈SBr; the dual action satisfies v(Bs∩Bt)={v⋅f:f∈Bs∩Bt}, and the action of v∈Ws,t on V∗ is linear. By [F5] the intrinsic length satisfies ℓs,t(x)=ℓ(x) for x∈Ws,t.

1.2F1F3algebra

Reduction to the rank-two plane. Put CP∘:={g∈P∗:g(es)>0, g(et)>0} and let π:V∗→P∗, π(f):=f∣P. Then π is linear and surjective, because a functional prescribed on P extends to a functional on V by 0 on the remaining basis vectors. Every v∈Ws,t preserves P and fixes P⊥ pointwise by [F1], so for x∈P and f∈V∗ one has (v⋅f)(x)=f(ρ(v)−1x) with ρ(v)−1x∈P; hence π(v⋅f)=v⋅π(f) and π−1(CP∘)=Bs∩Bt, π−1{g:g(es′)>0}=Bs′, π−1{g:g(es′)<0}=s′Bs′ for s′∈{s,t}. Consequently v(Bs∩Bt)⊆Bs′ if and only if vCP∘⊆{g:g(es′)>0}, and v(Bs∩Bt)⊆s′Bs′ if and only if vCP∘⊆{g:g(es′)<0}.

1.3F4F2algebra

Sectors avoid the walls. By [F4] the interiors of the chambers wCP (w∈Ws,t) are convex open cones that are connected components of the complement of the union of the root lines in P∗ (respectively in {f∈P∗:f(es+et)>0} when m(s,t)=∞), so each is disjoint from every root line Hβ∩P∗ (β∈ΦP), and Hes∩P∗, Het∩P∗ are root lines because es,et∈ΦP. An open convex set disjoint from a line lies in exactly one of the two open half-planes bounded by it. Hence for every v∈Ws,t and s′∈{s,t} exactly one of vCP∘⊆{g:g(es′)>0} and vCP∘⊆{g:g(es′)<0} holds.

1.4F5F6algebra

The finite dihedral group. Assume m:=m(s,t)<∞ and write u:=st. Since um=1 by [F5], the set {u0,…,u2m−1} is closed under right multiplication by s and t: indeed u2js=u2j+1 and u2j+1s=u2j for 2j<2m; u2jt=u2j−1 for j≥1; u0t=u2m−1 because (st)m−1s=(st)−1s=(ts)s=t; and u2j+1t=u2j+2 for 2j+1<2m, u2m−1t=1. Since Ws,t is generated by s,t and contains 1, it equals {u0,…,u2m−1}. The uk are pairwise distinct: if uj=uk with j<k<2m, then 1=uj−1uk; for j,k of equal parity this equals u±(k−j)/2 with 0<(k−j)/2<m, contradicting the exact order m of u from [F5], while for parities differing it equals s up or ups with 2∣p∣<2m, so it would give up=s, impossible because sgn⁡(up)=1 while sgn⁡(s)=−1. Hence ∣Ws,t∣=2m, the uk are distinct, uk+2m=uk, and the pairs uk,uk+1 and u2m−1,u0 are edges of the Cayley graph of Ws,t for the generating set {s,t}. That graph is connected, and every vertex has degree exactly 2 because x≠xs and xs≠xt for all x (as s≠1 and s≠t by [F5]); it therefore is the displayed 2m-cycle, so ℓs,t(uk)=min⁡(k,2m−k) is the graph distance from u0. Moreover suk=uσ(k) and tuk=uτ(k) with σ(k)≡1−k(mod2m) and τ(k)≡−1−k(mod2m) for 0≤k<2m: these are s(st)j=u−js, t(st)j=u−jt=u−j−1s applied to u2j=uj and u2j+1=ujs, together with the case k=0.

1.5F3F5F6algebra

The infinite dihedral group. Assume m(s,t)=∞, write u:=st, and let uk′ be the alternating word of length k beginning with t. By [F5], u has infinite order, and by [F6] ℓs,t(uk)=k=ℓs,t(uk′) for all k≥0. The union X:={uk:k≥0}∪{uk′:k≥0} is closed under right multiplication by s and t (u2js=u2j+1, u2j+1s=u2j, u2jt=u2j−1 for j≥1, u0t=u1′, u2j+1t=u2j+2, symmetrically for uk′), so X=Ws,t; by [F6] the elements uk are pairwise distinct with ℓs,t(uk)=k for every k≥0, and likewise the uk′. The Cayley graph of Ws,t for {s,t} is connected, and every vertex has degree exactly 2 (as in 1.4), so it is the two-way infinite path ⋯u2′,u1′,1,u1,u2⋯, and the graph distance from 1 to uk, or to uk′, equals ℓs,t of that element, namely k. On the affine line {f∈P∗:f(es+et)=1}, parametrized by ys, the generators act by s:ys↦−ys and t:ys↦2−ys by [F3] (here c=1); consequently the affine map of uk is ys↦ys−2j for k=2j and ys↦−ys−2j for k=2j+1, and that of uk′ is ys↦ys+2j for k=2j and ys↦−ys+2j+2 for k=2j+1, by induction on k (each step composes with s or t alternately). Hence the trace of ukCP∘ is the interval (−k,−k+1) and that of uk′CP∘ is (k,k+1). Since these intervals are pairwise distinct, an element of Ws,t=X is determined by the trace of its chamber. Writing vj (j∈Z) for the element with trace (j,j+1), namely vj=u−j for j≤0 and vj=uj′ for j≥0, one therefore has ℓs,t(vj)=∣j∣ together with s⋅vj=v−j−1 and t⋅vj=v1−j, because the affine maps send the interval (j,j+1) to (−j−1,−j), respectively (1−j,2−j).

1.6F3algebra

Signs in the infinite case. In the situation of 1.5 the sign of ys on vjCP∘ is the sign of ys on the interval (j,j+1), hence negative exactly when j≤−1, and the sign of yt=1−ys is negative exactly when j≥1.

1.7F3given

(P_0) and (Q_0). For w=1 one has ℓ(w)=0, wC∘=C∘⊆Br for every r∈S by 1.1, and choosing u=1 gives C∘⊆Bs∩Bt and ℓ(1)=0=ℓs,t(1)+ℓ(1) for all s≠t.

2.1F3F4step 1.3step 1.4algebra

Signs of the finite sectors. In the finite case let Ck:=ukCP∘ (0≤k<2m); by [F4] these are the interiors of all 2m sectors. Consecutive uk differ by right multiplication by a generator r, so ukCP and ukrCP share the image under uk of the wall of CP fixed by r and lie on its opposite sides, by [F3]. They are adjacent sectors. The distinct vertices of the Cayley cycle in 1.4 therefore list the sectors in cyclic order. The sign of ys is constant on each Ck (no Ck meets the line ys=0 by 1.3), is + on C0, and is − on C1=sCP∘ because s negates ys by [F3]. It changes exactly at those transitions whose common boundary ray lies on the line ys=0: that line contains exactly two boundary rays of the arrangement, hence exactly two transitions; and the involution s maps each sector to the sector on the opposite side of ys=0 and fixes no sector, because s swaps the two half-planes and no sector meets the wall. Hence exactly m sectors lie on each side, and the negative side is the contiguous block of m sectors containing C1 but not C0, that is {k:ys<0 on Ck}={1,…,m}. Applying the same argument to t, which is u2m−1 and negates yt, gives {k:yt<0 on Ck}={m,…,2m−1}.

2.2step 1.5step 1.6algebra

Descents in the infinite case. In the situation of 1.5, let v=vj be the element with trace (j,j+1); by 1.5, ℓs,t(v)=∣j∣ and ℓs,t(sv)=∣j+1∣, so ℓs,t(sv)=ℓs,t(v)−1 exactly when j≤−1, which by 1.6 is exactly the side ys<0; and ℓs,t(tv)=∣j−1∣, so ℓs,t(tv)=ℓs,t(v)−1 exactly when j≥1, exactly the side yt<0. In particular no element has both left descents, and ℓs,t(uk)=k for all k≥0 with the uk pairwise distinct.

2.3step 1.2step 1.3

The dichotomy in the original space. Combining 1.2 with 1.3: for every v∈Ws,t and s′∈{s,t} exactly one of v(Bs∩Bt)⊆Bs′ and v(Bs∩Bt)⊆s′Bs′ holds, according to the side of Hes′∩P∗ carrying vCP∘.

3.1step 1.4step 2.1algebra

Descents in the finite case. Let m(s,t)<∞ and v=uk (0≤k<2m). By 1.4, ℓs,t(suk) equals the distance from 0 to σ(k)≡1−k, namely k−1 when 1≤k≤m and 2m+1−k when m<k<2m, and equals 1 when k=0; comparing with ℓs,t(uk)=min⁡(k,2m−k) gives ℓs,t(suk)=ℓs,t(uk)−1 exactly for 1≤k≤m. Likewise ℓs,t(tuk)=ℓs,t(uk)−1 exactly for m≤k≤2m−1, and ℓs,t(tuk)=ℓs,t(uk)+1 for 0≤k<m. Hence, by 2.1, the left descent for s occurs exactly on the side ys<0 and the left descent for t exactly on the side yt<0, and um is the unique element with both descents.

4.1step 1.4step 1.5step 3.1step 2.2step 2.3

Part (1). Let v∈Ws,t and s′∈{s,t}. The dichotomy is 2.3, and its two alternatives correspond to the signs of ys′ on vCP∘. If m(s,t)<∞ then v=uk for a unique k by 1.4 and ℓs,t(uk)=min⁡(k,2m−k); the negative side alternative holds exactly for k∈{1,…,m} when s′=s and for k∈{m,…,2m−1} when s′=t by 2.1, and exactly there s′v shortens by 3.1; the elements u0,…,u2m−1 exhaust Ws,t, and the unique double-descent element is um. If m(s,t)=∞ then every v has a trace (j,j+1) and ℓs,t(uk)=k with the uk pairwise distinct by 2.2; the negative side alternative for s′ holds exactly for j≤−1 (respectively j≥1), and exactly there s′v shortens by 2.2, and no element has both descents. This proves all clauses of (1) in both cases.

5.1step 4.1F3F5algebra

The conditional step for (P). Fix n≥0 and suppose only (Qn). If S is empty there is no s to check. If S={s} then W={1,s} by s2=1 and [F5], and the only positive-length chamber is sC∘⊆sBs, with ℓ(s)=1, proving (Pn+1) directly. Now suppose ∣S∣≥2. First (Qn) and (1) imply (Pn): for any a of length n and generator r, choose q≠r and use (Qn) to write a=ud, with aC∘⊆u(Br∩Bq) and n=ℓr,q(u)+ℓ(d). The rank-two dichotomy gives the positive alternative or the negative alternative with ℓr,q(ru)=ℓr,q(u)−1; in the latter case ℓ(ra)≤ℓr,q(ru)+ℓ(d)=n−1, hence equality by [F5]. This is (Pn). Let w∈W with ℓ(w)=n+1 and let s∈S; choose t with w=tw′ and ℓ(w′)=n. If s=t, then (Pn) applied to w′ gives w′C∘⊆Bs: the second alternative would give ℓ(sw′)=ℓ(w′)−1=n−1, whereas ℓ(sw′)=ℓ(w)=n+1 here. Hence wC∘=t(w′C∘)⊆tBs=sBs and ℓ(sw)=ℓ(w′)=n=ℓ(w)−1, the second alternative of (Pn+1). If s≠t, apply (Qn) to w′: there is u∈Ws,t with w′C∘⊆u(Bs∩Bt) and ℓ(w′)=ℓs,t(u)+ℓ(u−1w′). Put v:=tu∈Ws,t. If v(Bs∩Bt)⊆Bs, then wC∘⊆tu(Bs∩Bt)⊆Bs. Otherwise v(Bs∩Bt)⊆sBs and ℓs,t(sv)=ℓs,t(v)−1 by (1) from 4.1, so with d:=u−1w′ one has wC∘⊆sBs and ℓ(sw)=ℓ(stu d)≤ℓs,t(stu)+ℓ(d)=ℓs,t(v)−1+ℓ(d)≤ℓs,t(u)+ℓ(d)=ℓ(w′)=ℓ(w)−1, where ℓs,t(tu)≤1+ℓs,t(u) follows by prepending t to a shortest word for u. The reverse bound ℓ(sw)≥ℓ(w)−1 follows from [F5], so ℓ(sw)=ℓ(w)−1, the second alternative of (Pn+1).

6.1step 5.1F5algebra

The conditional step for (Q). Suppose (Qn) and (Pm) for all m≤n+1, as in the second conditional implication of (2), and let w∈W with ℓ(w)=n+1 and s≠t. By [F5] factor w=u d with u∈Ws,t and d the minimal representative of Ws,tw; then ℓ(w)=ℓ(u)+ℓ(d) and ℓ(s′d)>ℓ(d) for s′∈{s,t}. Since ℓ(d)≤n+1, (Pℓ(d)) is available: it is part of the stated supposition. Applying it to d and s′∈{s,t}, the second alternative would give ℓ(s′d)=ℓ(d)−1, contradicting ℓ(s′d)>ℓ(d); hence dC∘⊆Bs∩Bt. Therefore wC∘=u(dC∘)⊆u(Bs∩Bt) and ℓ(w)=ℓ(u)+ℓ(d)=ℓs,t(u)+ℓ(u−1w), which is (Qn+1).

7.1step 1.7step 5.1step 6.1F7

The induction. (P0) and (Q0) hold by 1.7, and 5.1 and 6.1 show that the validity of (Pm) and (Qm) for all m≤n implies (Pn+1) and (Qn+1), for every n≥0. By the induction principle [F7], (Pn) and (Qn) hold for every n≥0.

8.1step 7.1F5algebra

Part (3). Let w∈W and s≠t, and factor w=u d with u∈Ws,t and d the minimal representative of Ws,tw. By [F5], ℓ(w)=ℓ(u)+ℓ(d) and ℓ(s′d)>ℓ(d) for s′∈{s,t}; since ℓ(d)≤ℓ(w), (Pℓ(d)) from 7.1 applies to d, and the second alternative would give ℓ(s′d)=ℓ(d)−1, a contradiction; hence dC∘⊆Bs∩Bt and wC∘=u(dC∘)⊆u(Bs∩Bt), with ℓ(w)=ℓ(u)+ℓ(d)=ℓs,t(u)+ℓ(u−1w) because u−1w=d and ℓs,t(u)=ℓ(u).

8.2step 7.1

Forward direction of (4). Let w∈W and s∈S. By (Pℓ(w)) from 7.1, wC∘⊆Bs, or wC∘⊆sBs and ℓ(sw)=ℓ(w)−1; in particular wC∘⊆sBs implies ℓ(sw)<ℓ(w).

9.1step 8.2step 7.1step 4.1step 8.1∎

Converse direction of (4) and conclusion. Suppose ℓ(sw)<ℓ(w) and put w′:=sw, so that ℓ(w′)=ℓ(w)−1 and w=sw′. By (Pℓ(w′)) from 7.1 applied to w′, either w′C∘⊆Bs, or w′C∘⊆sBs and ℓ(sw′)=ℓ(w′)−1; the second alternative would give ℓ(w)=ℓ(sw′)=ℓ(w′)−1=ℓ(w)−2, which is impossible, so w′C∘⊆Bs. Applying the linear bijection f↦s⋅f of [F3] gives wC∘=s(w′C∘)⊆sBs. Together with 8.2 this is the equivalence (4); and (1) is 4.1, (2) is 7.1 and (3) is 8.1, so all four clauses of the statement hold.

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

Root sign coherence and the action of simple reflections on positive roots

Statement

Let S be a finite set, m a Coxeter matrix, W the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), V=RS with Coxeter form B, the reflections ra (The real Coxeter form, its radical, reflections, and form-preserving maps), the canonical reflection homomorphism ρ:W→GL(V), the root system Φ={ρ(w)es}, the reflections T, and the positive cone V+={∑sλses:λs≥0} (The canonical reflection homomorphism, roots, reflections, and the positive cone); every root satisfies B(α,α)=1 (Descent of the reflection representation, unit root norms, and conjugation of reflections (3)). Let C,C∘ be the chamber and its interior of the dual action and put Bs:={f∈V∗:f(es)>0} (The dual action, chambers, faces, and root hyperplanes).

(1) Sign criterion for the cone. For v∈V: v∈V+∖{0} if and only if f(v)>0 for every f∈C∘.

(2) Roots have a sign. Every root α∈Φ lies in V+∖{0} or in −V+∖{0}, and not in both. Hence, with Φ+:=Φ∩V+,Φ−:=Φ∩(−V+), one has Φ=Φ+⊔Φ−, Φ−=−Φ+, es∈Φ+ for every s∈S, and for every w∈W and s∈S ρ(w)es∈Φ+  ⟺  w−1C∘⊆Bs,ρ(w)es∈Φ−  ⟺  w−1C∘⊆sBs. In particular f(α)>0 for all f∈C∘ when α∈Φ+, and f(α)<0 for all f∈C∘ when α∈Φ−.

(3) Simple reflections act on positive roots. For every s∈S, rs(Φ+∖{es})=Φ+∖{es},rses=−es,rsΦ=Φ; equivalently rsΦ+=(Φ+∖{es})∪{−es}.

Facts & Assumptions

Given: a finite set S, a Coxeter matrix m, the presented group W with its universal property, the space V=RS with its canonical basis (es)s∈S, the Coxeter form B, the canonical reflection homomorphism ρ with root system Φ and reflection set T, the positive cone V+ and the negative cone −V+, and the dual action on V∗ with chamber C, interior C∘ and root hyperplanes Hα.

[F1]

For every w∈W and s∈S, exactly one of wC∘⊆Bs and wC∘⊆sBs holds, and in the second case ℓ(sw)=ℓ(w)−1; equivalently, wC∘⊆sBs if and only if ℓ(sw)<ℓ(w) (The rank-two half-space alternative and the chamber-length induction (Pn), (Qn)).

[F2]

The reflections ra are defined for B(a,a)≠0 by ra(v)=v−2B(v,a)B(a,a)a; one has B(es,es)=1 and rs(es)=−es, and the assignment s↦rs induces the homomorphism ρ:W→GL(V) (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).

[F3]

The root system is Φ={ρ(w)es:w∈W, s∈S}, every root satisfies B(α,α)=1, the set Φ is invariant under every ρ(w), and ρ(w)es=−ρ(ws)es for all w∈W, s∈S (The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections).

[F4]

The dual action is given by (w⋅f)(v)=f(ρ(w)−1v); the closed chamber is C={f∈V∗:f(es)≥0 for all s}, its interior is C∘={f∈V∗:f(es)>0 for all s} and is nonempty, Bs={f∈V∗:f(es)>0} and sBs={f∈V∗:f(es)<0} are disjoint open half-spaces, and the dual basis functionals fs∈V∗ satisfy fs(et)=δst and f(es)≥0 for every f∈C (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).

[F5]

On the finite-dimensional real vector space V with basis (es): every v∈V has unique coordinates v=∑sv(s)es with v(s)∈R, evaluation f↦f(v) is linear in v for fixed f∈V∗, and sums and nonnegative multiples of elements of V+ lie in V+ (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S, Linear functionals and the algebraic dual V∗=L(V,F)).

Proof

technique · direct
1.1F2F3F4given

Set-up. Every f∈C∘ satisfies f(es)>0 for all s∈S, so that C∘⊆Bs and C∘⊆Bs∩Bt for all s≠t; moreover C∘≠∅. Every root is of the form ρ(w)es with B(ρ(w)es,ρ(w)es)=1, hence nonzero, and −ρ(w)es=ρ(ws)es is again a root, so Φ=−Φ.

1.2F4F5given

The sign criterion, forward direction. Let v=∑sλses∈V+∖{0}, so all λs≥0 and some λr>0. For f∈C∘ linearity gives f(v)=∑sλsf(es)≥λrf(er)>0, since all summands are nonnegative and the summand at r is positive.

1.3F4F5algebra

The sign criterion, converse direction. Let v∉V+∖{0}. If v=0 then f(v)=0 for every f, so assume v∉V+; then some coordinate λr=v(r) is negative. Let g:=fr+ε∑sfs with ε>0 so small that ε ∣∑sv(s)∣<∣λr∣. Then g(et)=δrt+ε>0 for every t∈S, so g∈C∘, and g(v)=λr+ε∑sv(s)<0. Hence some element of C∘ evaluates v negatively, and the criterion of (1) holds in both directions.

2.1step 1.2step 1.3

The equivalence of the two criteria. By 1.2 and 1.3, for every v∈V: v∈V+∖{0} if and only if f(v)>0 for every f∈C∘.

3.1step 2.1F1F3algebra

Roots have a sign. Fix w∈W and s∈S. For f∈V∗ one has (w−1⋅f)(es)=f(ρ(w−1)−1es)=f(ρ(w)es); by [F1] applied to the element w−1 either w−1C∘⊆Bs or w−1C∘⊆sBs. In the first case f(ρ(w)es)>0 for every f∈C∘, so ρ(w)es∈V+∖{0} by 2.1 and hence in Φ+; in the second case f(ρ(w)es)<0 for every f∈C∘, so −f(ρ(w)es)=f(−ρ(w)es)>0 for every f∈C∘, whence −ρ(w)es∈V+∖{0} by 2.1 and ρ(w)es∈−V+∖{0}, so it lies in Φ−. The two alternatives are exclusive because V+∩(−V+)={0} while ρ(w)es≠0 by 1.1. Since every root is some ρ(w)es and −ρ(w)es=ρ(ws)es is a root, this gives Φ=Φ+⊔Φ− and Φ−=−Φ+; taking w=1 gives es=ρ(1)es∈V+∖{0} and hence es∈Φ+. Reading the two cases displayed above as equivalences with 2.1 gives ρ(w)es∈Φ+  ⟺  w−1C∘⊆Bs and ρ(w)es∈Φ−  ⟺  w−1C∘⊆sBs, and with 2.1 the last sentence of (2) follows.

4.1step 3.1F2F3algebra∎

Simple reflections act on positive roots. Fix s∈S. That rses=−es is [F2]. Let α∈Φ+∖{es}. Since rs=ρ(s) and Φ is ρ(W)-invariant by [F3], rsα∈Φ, so by 3.1 either rsα∈Φ+ or rsα∈Φ−. Suppose rsα∈Φ−, that is rsα∈−V+∖{0}, and write rsα=α−2B(α,es)es by [F2] with B(es,es)=1. In coordinates: (rsα)(r)=α(r) for r≠s and (rsα)(s)=α(s)−2B(α,es). Since α∈V+∖{0} all coordinates α(r) are nonnegative and not all vanish, and since rsα∈−V+∖{0} all its coordinates are nonpositive; for r≠s both statements apply to α(r), so α(r)=0 for all r≠s, that is α=α(s)es with α(s)>0. Then 1=B(α,α)=α(s)2B(es,es)=α(s)2, so α(s)=1 and α=es, contradicting the choice of α. Hence rsα∈Φ+; moreover rsα≠es, because rses=−es and rs is an involution, so rsα=es would give α=−es∉Φ+. Thus rs(Φ+∖{es})⊆Φ+∖{es}, and applying the involution rs once more gives equality. Finally rsΦ=Φ: indeed rs=ρ(s) maps Φ into Φ by [F3], and rs2=id by [F2], so this map is a bijection of Φ; consequently rsΦ+=(Φ+∖{es})∪{−es}. This is (3), while (1) is 2.1 and (2) is 3.1.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

The root-length criterion and faithfulness of the canonical reflection representation

Statement

Let S be a finite set, m a Coxeter matrix, W the presented group with length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), V=RS with Coxeter form B and canonical reflection homomorphism ρ:W→GL(V) with root system Φ (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let Φ+,Φ− be the positive and negative roots and C∘ the open chamber of the dual action (Root sign coherence and the action of simple reflections on positive roots).

(1) Root-length criterion. For all w∈W and s∈S, ℓ(ws)>ℓ(w)  ⟺  ρ(w)es∈Φ+,ℓ(ws)<ℓ(w)  ⟺  ρ(w)es∈Φ−.

(2) Disjoint chambers. If wC∘∩C∘≠∅ for some w∈W, then w=1. Equivalently, the chambers wC∘ (w∈W) are pairwise disjoint, that is, C∘ is prefundamental for the W-action on V∗ in the sense that wC∘∩C∘≠∅ forces w=1 for every w∈W.

(3) Faithfulness. The homomorphism ρ is injective, the dual action W→GL(V∗) is injective, and for every w≠1 there is s∈S with ρ(w)es∈Φ−.

Facts & Assumptions

Given: a finite set S, a Coxeter matrix m, the presented group W with length function ℓ, the space V=RS with Coxeter form B, the canonical reflection homomorphism ρ with root system Φ=Φ+⊔Φ−, and the dual action on V∗ with open chamber C∘ and half-spaces Bs={f∈V∗:f(es)>0}, sBs={f∈V∗:f(es)<0}.

[F1]

For every w∈W and s∈S: the chamber wC∘ satisfies wC∘⊆Bs or wC∘⊆sBs, and wC∘⊆sBs if and only if ℓ(sw)<ℓ(w); for s≠t the rank-two half-space alternative and the induction (Pn), (Qn) hold (The rank-two half-space alternative and the chamber-length induction (Pn), (Qn)).

[F2]

For every w∈W and s∈S: ρ(w)es∈Φ−  ⟺  w−1C∘⊆sBs and ρ(w)es∈Φ+  ⟺  w−1C∘⊆Bs; moreover C∘⊆Bs and Bs∩sBs=∅ for every s, and C∘≠∅ (Root sign coherence and the action of simple reflections on positive roots, The dual action, chambers, faces, and root hyperplanes).

[F3]

For all w∈W and s∈S one has ℓ(ws)=ℓ(w)±1, and ℓ is invariant under inversion: ℓ(w−1)=ℓ(w); every element w≠1 has a reduced expression w=s1⋯sn with n=ℓ(w)≥1, and then w=(s1⋯sn−1)sn has ℓ(wsn)=ℓ(w)−1 (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).

[F4]

The dual action (w⋅f)(v)=f(ρ(w)−1v) is a left action of W on V∗ by linear bijections, with ρ(w)−1=ρ(w−1) for every w (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).

Proof

technique · direct
1.1F1F2F4given

Set-up. Recall from [F2] that C∘⊆Bs and Bs∩sBs=∅ for every s∈S, and that the two sign equivalences of the root system hold; from [F4] that every w acts on V∗ as a bijection with inverse the action of w−1; and from [F1] that for every x∈W and every generator s exactly one of xC∘⊆Bs, xC∘⊆sBs holds.

1.2F1F2F3algebra

The two-sided root-length criterion. Fix w∈W and s∈S. By [F2], ρ(w)es∈Φ− if and only if w−1C∘⊆sBs; by [F1] applied to the element w−1 this holds if and only if ℓ(sw−1)<ℓ(w−1). Since (sw−1)−1=ws and ℓ is inversion invariant, [F3] gives ℓ(sw−1)=ℓ(ws) and ℓ(w−1)=ℓ(w), so ρ(w)es∈Φ−  ⟺  ℓ(ws)<ℓ(w). Finally ℓ(ws)=ℓ(w)±1 by [F3] and Φ=Φ+⊔Φ− by [F2], so this is equivalent to the statement that ℓ(ws)>ℓ(w) if and only if ρ(w)es∈Φ+; both claims of (1) follow.

1.3F1F2F3F4algebra

Disjoint chambers. Suppose wC∘∩C∘≠∅ and w≠1. Choose a reduced expression of w and let s be its first letter, so that w=sw′ with ℓ(w′)=ℓ(w)−1 by [F3]. The intersection point lies in C∘⊆Bs, so wC∘ meets Bs, whence wC∘⊈sBs because Bs∩sBs=∅; applying the bijection f↦s⋅f from [F4] and using that its square is the identity gives w′C∘⊈Bs. By [F1] applied to w′, therefore w′C∘⊆sBs and ℓ(sw′)=ℓ(w′)−1; but sw′=w, so ℓ(w)=ℓ(w′)−1=ℓ(w)−2, a contradiction. Hence w=1; and the stated equivalence holds because vC∘∩wC∘≠∅ if and only if (w−1v)C∘∩C∘≠∅ by [F4].

2.1step 1.2step 1.3F3F4∎

Faithfulness. If ρ(w)=idV, then ρ(w)−1=idV as well, so (w⋅f)(v)=f(ρ(w)−1v)=f(v) for all f∈V∗ and v∈V by [F4]; hence w⋅f=f for every f and wC∘=C∘ meets C∘, so 1.3 gives w=1. If the dual action of w is the identity, then for any f∈C∘ one has f=w⋅f∈wC∘∩C∘, which is nonempty, and 1.3 again gives w=1. Finally let w≠1 and let s be the last letter of a reduced expression of w, so that ℓ(ws)=ℓ(w)−1 by [F3]; by the criterion of 1.2, ρ(w)es∈Φ−.

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

The geometric inversion set N(w) of an element of a Coxeter group

Definition

Let S be a finite set, m a Coxeter matrix, W the presented group with length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), V=RS with Coxeter form B and canonical reflection homomorphism ρ:W→GL(V) (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let Φ=Φ+⊔Φ− be the signed root system (Root sign coherence and the action of simple reflections on positive roots).

(1) Definition. For w∈W the inversion set of w is N(w):={α∈Φ+:ρ(w)α∈Φ−}=Φ+∩ρ(w)−1Φ−. Its elements are the roots inverted by w. This is a subset of Φ+, defined before any finiteness or independence assertion; by construction ρ(w)N(w)⊆Φ−, and N(w) is determined by the linear map ρ(w).

(2) Elementary identities. N(1)=∅; for every w∈W N(w−1)=−ρ(w) N(w), and consequently ∣N(w−1)∣=∣N(w)∣ whenever one of the two sets is finite. For every u∈W and s∈S, with sN(u):={ρ(s)β:β∈N(u)}, ℓ(us)>ℓ(u) ⟹ N(us)={es}⊔sN(u),ℓ(us)<ℓ(u) ⟹ N(us)=s (N(u)∖{es}); in the first case sN(u)⊆Φ+∖{es} and es∉N(u), so the union is disjoint.

The identities are elementary: N(1)=∅ because ρ(1)=idV would force α∈Φ+∩Φ− for α∈N(1), and Φ+,Φ− are disjoint. For the second identity let α∈Φ+: then α∈N(w−1) means ρ(w)−1α∈Φ−, and with β:=−ρ(w)−1α one has β∈Φ+ and ρ(w)β=−α∈Φ−, so β∈N(w) and α=−ρ(w)β; conversely α=−ρ(w)β for some β∈N(w) gives α∈Φ+ because Φ−=−Φ+, and ρ(w)−1α=−β∈Φ−, so α∈N(w−1). Since β↦−ρ(w)β is a bijection, the cardinality statement follows. For the recursion, let β∈Φ+; then ρ(us)β=ρ(u)ρ(s)β, and ρ(s) maps Φ+∖{es} bijectively onto itself while ρ(s)es=−es (Root sign coherence and the action of simple reflections on positive roots (3)), so β↦ρ(s)β is a bijection of Φ+∖{es} that carries N(us)∖{es} onto N(u)∖{es}. By the root-length criterion (The root-length criterion and faithfulness of the canonical reflection representation (1)) one has es∈N(u)  ⟺  ρ(u)es∈Φ−  ⟺  ℓ(us)<ℓ(u) and es∈N(us)  ⟺  ρ(u)ρ(s)es=−ρ(u)es∈Φ−  ⟺  ρ(u)es∈Φ+  ⟺  ℓ(us)>ℓ(u). If ℓ(us)>ℓ(u) this gives es∈N(us), es∉N(u) and hence N(us)={es}⊔sN(u) with sN(u)⊆Φ+∖{es}; if ℓ(us)<ℓ(u) it gives es∉N(us), es∈N(u) and hence N(us)=s(N(u)∖{es}).

(3) Convention on reduced words. We keep the left action ρ of W on V. If w=s1⋯sn is a reduced expression, then the suffix roots ρ(si+1⋯sn)−1esi (1≤i≤n) are elements of N(w), and the prefix roots ρ(s1⋯si−1)esi are elements of N(w−1). That these lists are exactly N(w) and N(w−1), that their elements are pairwise distinct positive roots, and that in particular ∣N(w)∣=ℓ(w), is proved in The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange ↗; no finiteness or independence beyond the identities of (2) is asserted here.

For the two membership statements put wi−1:=s1⋯si−1 and αi:=ρ(si+1⋯sn)−1esi. Since ℓ(wi−1si)=i>ℓ(wi−1)=i−1 by reducedness of the expression, the root-length criterion gives γi:=ρ(wi−1)esi∈Φ+ and also, applied to the reversed reduced expression of w−1=sn⋯s1, gives αi∈Φ+. Moreover (s1⋯sn)(si+1⋯sn)−1=s1⋯si, so ρ(w)αi=ρ(s1⋯si)esi=−ρ(wi−1)esi=−γi∈Φ−, which shows αi∈N(w); and (sn⋯s1)(s1⋯si−1)=sn⋯si, so ρ(w−1)γi=ρ(sn⋯si)esi=−ρ(sn⋯si+1)esi=−αi∈Φ−, which shows γi∈N(w−1).

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

The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange

Statement

Let S be a finite set, m a Coxeter matrix, W the presented group with length ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), V=RS with Coxeter form B, canonical reflection homomorphism ρ, root system Φ=Φ+⊔Φ− and reflection set T={wsw−1:w∈W, s∈S} (The canonical reflection homomorphism, roots, reflections, and the positive cone, Root sign coherence and the action of simple reflections on positive roots); every root has B-norm one.

(1) The root-reflection dictionary. For α∈Φ choose w∈W, s∈S with α=ρ(w)es and put tα:=wsw−1∈T. Then: (i) tα is independent of the chosen representation of α; (ii) ρ(tα)=rα, the reflection with normal α; and tρ(w)α=w tα w−1 for all w∈W, α∈Φ; (iii) t−α=tα, and for α,β∈Φ one has tα=tβ if and only if α=±β; (iv) the induced map {±α:α∈Φ}→T is a bijection; so is the map Φ+→T, α↦tα.

(2) Inversion formula. For every w∈W one has ∣N(w)∣=ℓ(w) (with N as in The geometric inversion set N(w) of an element of a Coxeter group); and for every reduced expression w=s1⋯sn, N(w)={ρ(si+1⋯sn)−1esi:1≤i≤n},N(w−1)={ρ(s1⋯si−1)esi:1≤i≤n}, the displayed elements being pairwise distinct positive roots.

(3) Strong exchange. Let w∈W and t∈T satisfy ℓ(tw)<ℓ(w), and let w=s1⋯sn be a reduced expression. Then there is a unique i∈{1,…,n} with tw=s1⋯si^⋯sn,t=ri:=s1⋯si−1sisi−1⋯s1; moreover, if α∈Φ+ is the positive root with t=tα, then α∈N(w−1) and α=ρ(s1⋯si−1)esi.

Facts & Assumptions

Given: a finite set S, a Coxeter matrix m, the presented group W with length ℓ, the space V=RS with Coxeter form B, the canonical reflection homomorphism ρ with root system Φ=Φ+⊔Φ−, the reflections ra, and the reflection set T={wsw−1:w∈W, s∈S}.

[F1]

For all w∈W and s∈S one has ρ(wsw−1)=rρ(w)es, and every root α satisfies B(α,α)=1 (Descent of the reflection representation, unit root norms, and conjugation of reflections).

[F2]

The canonical reflection homomorphism ρ is injective (The root-length criterion and faithfulness of the canonical reflection representation).

[F3]

For a∈V with B(a,a)≠0 the reflection ra satisfies ra(a)=−a, fixes every v with B(v,a)=0 pointwise, preserves B, and ker⁡B(−,a) has dimension dim⁡V−1; since B(a,a)≠0 one has Ra∩ker⁡B(−,a)={0}, so V=Ra⊕ker⁡B(−,a) and the (−1)-eigenspace of ra is exactly Ra (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).

[F4]

The reflection set carries the right action (ε,r)⋅s=Us(ε,r)=(ε⋅(−1)δ(s,r), srs) of W on {±1}×T, and (ε,r)⋅w=(ε η(r,w), w−1rw) for a well-defined sign η(r,w)∈{±1} depending only on w and r; for a reduced word with prefix reflections ri one has n(r)∈{0,1}, the map i↦ri is injective, and Φ(w):={r1,…,rk}={r∈T:η(r,w)=−1} is independent of the reduced expression and has cardinality ℓ(w) (The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness).

[F5]

The inversion set is N(w)={α∈Φ+:ρ(w)α∈Φ−}; it satisfies N(1)=∅, N(w−1)=−ρ(w)N(w), and the step recursion: for u∈W, s∈S with ℓ(us)>ℓ(u) one has N(us)={es}⊔sN(u) with sN(u)⊆Φ+∖{es} and es∉N(u), while for ℓ(us)<ℓ(u) one has N(us)=s(N(u)∖{es}) (The geometric inversion set N(w) of an element of a Coxeter group).

[F6]

ρ is a group homomorphism with ρ(1)=idV and ρ(uv)=ρ(u)ρ(v); ρ(s)es=−es; and Φ=Φ+⊔Φ− with Φ−=−Φ+ and es∈Φ+ (Monoid homomorphism and group homomorphism, Root sign coherence and the action of simple reflections on positive roots).

[F7]

Root-length criterion: for all x∈W and s∈S one has ℓ(xs)>ℓ(x) if and only if ρ(x)es∈Φ+ (The root-length criterion and faithfulness of the canonical reflection representation).

[F8]

Induction principle on the natural numbers (The principle of mathematical induction).

Proof

technique · direct
1.1F1F4F6given

Set-up. Fix a reduced expression w=s1⋯sn of an element w∈W, write wj:=s1⋯sj and ri:=wi−1siwi−1−1∈T for the prefix reflections, and note ρ(wj)=ρ(s1)⋯ρ(sj) by [F6] and ρ(ri)=ρ(wi−1siwi−1−1)=rρ(wi−1)esi.

1.2F5F6F8given

The inversion formula (2). We prove by induction on m the assertion: for every x with ℓ(x)=m and every reduced expression x=s1⋯sm one has N(x)={ρ(si+1⋯sm)−1esi:1≤i≤m} with pairwise distinct elements, and ∣N(x)∣=m. For m=0 this is N(1)=∅ by [F5]. For the step let x=usm with u:=s1⋯sm−1, so ℓ(u)=m−1 and ℓ(usm)=m>ℓ(u); the first case of the step recursion of [F5] gives N(x)={esm}⊔smN(u), the union being disjoint with smN(u)⊆Φ+∖{esm}. By induction N(u)={ρ(si+1⋯sm−1)−1esi:1≤i≤m−1} with pairwise distinct elements; since ρ(sm)ρ(si+1⋯sm−1)−1=ρ(smsm−1⋯si+1)=ρ(si+1⋯sm)−1 for i≤m−1 by [F6], one has smN(u)={ρ(si+1⋯sm)−1esi:1≤i≤m−1}, and the term i=m with the empty product contributes esm. Hence N(x)={ρ(si+1⋯sm)−1esi:1≤i≤m} with pairwise distinct elements, and ∣N(x)∣=1+∣N(u)∣=m. Applying the same formula to the reversed reduced expression x−1=sm⋯s1 and using ρ(si−1⋯s1)−1=ρ(s1⋯si−1) gives N(x−1)={ρ(s1⋯si−1)esi:1≤i≤m}, again with pairwise distinct elements. The induction principle [F8] gives (2) for every element.

1.3F1F2F6algebra

The dictionary (i) and (ii). Let α∈Φ, written as α=ρ(w)es=ρ(w′)es′. Then ρ(wsw−1)=rρ(w)es=rα=rρ(w′)es′=ρ(w′s′w′−1) by [F1], and injectivity of ρ from [F2] gives wsw−1=w′s′w′−1; so tα is independent of the representation, which is (i). For (ii), ρ(tα)=ρ(wsw−1)=rρ(w)es=rα; and writing α=ρ(x)es one has ρ(w)α=ρ(wx)es, so tρ(w)α=(wx)s(wx)−1=w(xsx−1)w−1=wtαw−1.

1.4F4algebra

The shorteners are exactly the prefix reflections. Keep the reduced expression of 1.1 and let r∈T. If r=ri is a prefix reflection of the word, then riw=wi−1siwi−1−1wi−1sisi+1⋯sn=wi−1si+1⋯sn=s1⋯si^⋯sn, so ℓ(riw)<n=ℓ(w); and by [F4] the set {r1,…,rn} equals Φ(w)={r:η(r,w)=−1} and its members are pairwise distinct. Conversely let r∈T with ℓ(rw)<ℓ(w) and suppose η(r,w)=+1. The formula of [F4] implies the cocycle identity η(x,uv)=η(x,u)η(u−1xu,v) for all x∈T, u,v∈W: indeed (ε,x)⋅(uv)=((ε,x)⋅u)⋅v, and comparing first coordinates of the displayed formula gives the identity. With x=r, u=r, v=w this gives η(r,rw)=η(r,r)η(r,w)=η(r,r); also η(r,1)=1, since the action of 1 is the identity. We claim η(r,r)=−1. Write r=usu−1 with s∈S, u∈W, so that u−1ru=s; applying the action formula of [F4] successively along the word usu−1 to (ε,r) gives (ε,r)⋅u=(εη(r,u),u−1ru)=(εη(r,u),s), then Us(εη(r,u),s)=(−εη(r,u),s) by the definition of Us in [F4], and then (ε,r)⋅(usu−1)=(−εη(r,u)η(s,u−1),r). Comparing with (ε,r)⋅r=(εη(r,r),r) from [F4] yields η(r,r)=−η(r,u)η(s,u−1). Applying the cocycle identity with x=s, u=u−1, v=u gives η(s,1)=η(s,u−1)η(usu−1,u), that is 1=η(s,u−1)η(r,u); hence η(r,r)=−η(r,u)2=−1 under the supposition η(r,w)=+1. Therefore η(r,rw)=−1, so r∈Φ(rw)={x∈T:η(x,rw)=−1}; by [F4] applied to the shorter element rw, the element r is one of the prefix reflections of a reduced expression of rw, and the first paragraph of this step applied to that element gives ℓ(r⋅rw)<ℓ(rw), that is ℓ(w)<ℓ(rw), contradicting ℓ(rw)<ℓ(w). Hence η(r,w)=−1 and r∈Φ(w)={r1,…,rn}. Thus {r∈T:ℓ(rw)<ℓ(w)}={r1,…,rn}.

2.1F1F3F6step 1.1step 1.3algebra

The dictionary (iii) and (iv). Let α,β∈Φ. Since ρ(s)es=−es by [F6], the root −α has the representation −α=−ρ(w)es=ρ(ws)es, so t−α=(ws)s(ws)−1=wsw−1=tα. If tα=tβ, then rα=ρ(tα)=ρ(tβ)=rβ by 1.3 (ii); by [F3] and B(α,α)=1 of [F1] the (−1)-eigenspace of rα is Rα, and that of rβ is Rβ, so Rα=Rβ and β=λα with λ≠0; then 1=B(β,β)=λ2B(α,α)=λ2, so λ=±1. Conversely tα=t±α by the first part. Hence tα=tβ if and only if β=±α, which is (iii). For (iv), the map [α]↦tα on classes {±α} is well defined by (i) and (iii) and injective by (iii); it is surjective because every element of T is of the form wsw−1=tρ(w)es by 1.1. Hence it is a bijection. Since Φ=Φ+⊔Φ− with Φ−=−Φ+ by [F6], every class {α,−α} contains exactly one positive root; composing α↦[α] with the class bijection [α]↦tα gives a bijection Φ+→T, α↦tα.

3.1step 1.1step 1.2step 1.4step 2.1F7algebra∎

Strong exchange (3). Let w=s1⋯sn be a reduced expression and t∈T with ℓ(tw)<ℓ(w). By 1.4 the shorteners of w are exactly the prefix reflections r1,…,rn, which are pairwise distinct; hence t=ri for a unique i∈{1,…,n}, and tw=riw=s1⋯si^⋯sn by the computation in 1.4. For the root clause let α∈Φ+ satisfy t=tα. By 1.1, ri=wi−1siwi−1−1=tρ(wi−1)esi; since ℓ(wi−1si)=i>ℓ(wi−1), the criterion [F7] gives ρ(wi−1)esi∈Φ+. Both α and ρ(wi−1)esi are positive roots with the same t-image t, so (iii) from 2.1 gives α=ρ(wi−1)esi=ρ(s1⋯si−1)esi. Finally, the prefix formula of (2) from 1.2 shows that this root lies in N(w−1). This proves (3), while (1) is 1.3 with 2.1 and (2) is 1.2.

5 · Examples, counterexamples and false statements

None yet.

Sources