Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The 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.

Depends on

Used by

Dependency tree · two levels

101 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources