Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

Roots, inversions and chamber images in I2(5), A2 and infinite dihedral type

Example

Let S={s,t} with m:=m(s,t)∈{3,5,∞}, V=RS, and let B be the Coxeter form with c=cos⁡(π/m) for m<∞ and c=1 for m=∞, so that B(es,es)=B(et,et)=1 and B(es,et)=−c (The real Coxeter form, its radical, reflections, and form-preserving maps). Let ρ,Φ,Φ±,N,C∘,W,ℓ be as on this page (The canonical reflection homomorphism, roots, reflections, and the positive cone, Root sign coherence and the action of simple reflections on positive roots, The geometric inversion set N(w) of an element of a Coxeter group, The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange), and let uk denote the alternating word s t s⋯ of k letters. The following data are computed and verified.

(i) A2=I2(3). c=12 and Φ+={es, et, es+et}. For the six elements, N(1)=∅,N(s)={es},N(t)={et},N(st)={et, es+et},N(ts)={es, es+et},N(sts)=Φ+, each of cardinality ℓ(w). In the dual plane V∗ the three walls Hes,Het,Hes+et cut out six sectors, and the six chambers wC∘ occur in the cyclic order C∘, sC∘, stC∘, stsC∘, tsC∘, tC∘, with stsC∘=−C∘; explicitly Hes separates C∘ from u1C∘,…,u3C∘ and Het from u3C∘,…,u5C∘.

(ii) I2(5). 2c=ϕ=1+52, 4c2−1=ϕ, and Φ+={es, et, et+ϕes, es+ϕet, ϕ(es+et)}, five roots, each of B-norm one. With ℓ(uk)=min⁡(k,10−k) for 0≤k<10, for 1≤k≤5 N(u1)={es},N(u2)={et, es+ϕet},N(u3)={es, et+ϕes, ϕ(es+et)}, N(u4)={et, es+ϕet, ϕ(es+et), ϕes+et},N(u5)=Φ+, and for 5≤k<10 one has N(uk)=Φ+∖N(uk−5′), where uj′ is the alternating word of length j beginning with t; for instance N(u7)={et, es+ϕet, ϕ(es+et)}, of cardinality 3=ℓ(u7). The ten chambers ukC∘ are the sectors cut out by the five root lines; the chambers on the negative side of Hes are exactly u1C∘,…,u5C∘, and those on the negative side of Het are exactly u5C∘,…,u9C∘.

(iii) I2(∞). c=1. Put u:=es+et; then B(u,⋅)=0 on Res+Ret, and Φ+={es+ku:k≥0}∪{et+ku:k≥0} is infinite. For every k≥0, N((st)k)={ju+et:0≤j≤2k−1},N((st)ks)={ju+es:0≤j≤2k}, of cardinalities 2k=ℓ((st)k) and 2k+1=ℓ((st)ks). The chambers wC∘ are the cones over the intervals (j,j+1) of the affine line {f:f(es)+f(et)=1}, and the walls Hes,Het meet that line in the points 0 and 1.

Facts & Assumptions

Given: a two-element set S={s,t} with m:=m(s,t)∈{3,5,∞}, the space V=RS with basis vectors es,et, the Coxeter form B with constant c (c=cos⁡(π/m) for m<∞, c=1 for m=∞), the presented Coxeter group W with length function ℓ, the canonical reflection homomorphism ρ:W→GL(V) with root system Φ, the partition Φ=Φ+⊔Φ−, the inversion sets N(w) of The geometric inversion set N(w) of an element of a Coxeter group, and the alternating words uk=s t s⋯ of k letters beginning with s.

[F1]

B(es,es)=B(et,et)=1 and B(es,et)=−c; the reflection ra with normal a, B(a,a)≠0, is ra(v)=v−2B(v,a)B(a,a)a, so that rs(es)=−es, rs(et)=et+2ces and rt(et)=−et, rt(es)=es+2cet (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).

[F2]

ρ is a homomorphism with ρ(s)=rs, ρ(t)=rt, so ρ(uv)=ρ(u)ρ(v) and ρ(1)=idV; the root system is Φ={ρ(w)er:w∈W, r∈{s,t}}, every root has B-norm one, and Φ is invariant under every ρ(w); moreover Φ+=Φ∩V+ and Φ−=Φ∩(−V+)=−Φ+ with Φ=Φ+⊔Φ−, V+={λes+μet:λ,μ≥0} and V+∩(−V+)={0} (The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections, Root sign coherence and the action of simple reflections on positive roots (1), (2)).

[F3]

N(w)={α∈Φ+:ρ(w)α∈Φ−} for w∈W; N(1)=∅; and for u∈W, r∈{s,t} with ℓ(ur)>ℓ(u) one has N(ur)={er}⊔ρ(r)N(u), while for ℓ(ur)<ℓ(u) one has N(ur)=ρ(r)(N(u)∖{er}), where ρ(r)N(u)={ρ(r)β:β∈N(u)} (The geometric inversion set N(w) of an element of a Coxeter group (1), (2)).

[F4]

∣N(w)∣=ℓ(w) for every w∈W, and the map α↦tα is a bijection from Φ+ onto the reflection set T (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1), (2)).

[F5]

In W one has s2=t2=1 and, when m<∞, (st)m=1; if m<∞ the elements u0,…,u2m−1 exhaust W and ℓ(uk)=min⁡(k,2m−k); if m=∞ the elements uk are pairwise distinct with ℓ(uk)=k (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The rank-two half-space alternative and the chamber-length induction (Pn), (Qn) (1)).

[F6]

The dual action is (w⋅f)(v)=f(ρ(w)−1v), and f∈wC∘ if and only if f(ρ(w)es)>0 and f(ρ(w)et)>0; for every w∈W and r∈{s,t} one has wC∘⊆rBr if and only if ℓ(rw)<ℓ(w). If m<∞, the 2m chambers wC∘ (w∈W) are exactly the 2m sectors cut out by the m root hyperplanes Hβ (β∈Φ), with pairwise disjoint interiors; the corresponding closed sectors cover V∗, while the open sectors cover its complement of the root lines. If m=∞, the chambers have pairwise disjoint interiors, the corresponding closed chambers have union {f∈V∗:f(es+et)>0}∪{0}, distinct chambers are separated by a root hyperplane, and the traces Hβ∩{f:f(es)+f(et)=1} are exactly the integers in the coordinate ys=f(es) on that affine line (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling (3), The rank-two half-space alternative and the chamber-length induction (Pn), (Qn) (1), (4)).

[F7]

Addition formulas: sin⁡(x+y)=sin⁡xcos⁡y+cos⁡xsin⁡y and cos⁡(x+y)=cos⁡xcos⁡y−sin⁡xsin⁡y; cos⁡(−x)=cos⁡x and sin⁡2x+cos⁡2x=1; cos⁡(x+π)=−cos⁡x, cos⁡(π/2)=0 and cos⁡π=−1; cosine is strictly decreasing on [0,π]; π>0 and π/2 is the smallest positive zero of cosine; every a≥0 has a unique nonnegative square root a, and 5>1; a product of two real numbers is zero only if one factor is zero (The addition formulas for sine and cosine, Parity and the Pythagorean identity for sine and cosine, Quarter-turn values and shifts by pi/2 and pi, Signs, monotonicity intervals, and ranges of sine and cosine, Pi as twice the smallest positive zero of cosine, Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}).

Verification

technique · direct
1.1F1F7algebra

The case A2: the constant. Put x:=π/3, q:=cos⁡x and r:=sin⁡x. The addition formulas give cos⁡2x=cos⁡2x−sin⁡2x=2q2−1 and sin⁡2x=2qr, hence cos⁡3x=cos⁡(2x+x)=(2q2−1)q−(2qr)r=2q3−q−2q(1−q2)=4q3−3q; since 3x=π and cos⁡π=−1, we get 4q3−3q+1=0, that is (q+1)(2q−1)2=0. Now 0<π/3<π/2<π and cosine is strictly decreasing on [0,π] with cos⁡0=1 and cos⁡(π/2)=0, so 0<q<1; hence q≠−1 and q=1/2. Thus in this case c=1/2, and the reflection formulas of [F1] give ρ(s)et=et+es and ρ(t)es=es+et.

1.2F5F6algebra

The case I2(5): the chambers. By [F6] the ten chambers ukC∘ (0≤k<10) are exactly the ten sectors cut out by the five root lines. By [F5], (st)5=1 together with s2=t2=1 gives suk=u1−k and tuk=u−1−k with indices modulo 10; combined with ℓ(uk)=min⁡(k,10−k) this gives ℓ(suk)=ℓ(uk)−1 exactly for 1≤k≤5, and ℓ(tuk)=ℓ(uk)−1 exactly for 5≤k≤9. By the shortening equivalence of [F6], the chambers on the negative side of Hes are exactly u1C∘,…,u5C∘ and those on the negative side of Het exactly u5C∘,…,u9C∘.

1.3F1F2F5algebra

The case I2(∞): the invariant functional direction. Here c=1, so B(u,u)=B(es,es)+2B(es,et)+B(et,et)=1−2+1=0, B(u,es)=B(es,es)+B(et,es)=1−1=0 and B(u,et)=B(es,et)+B(et,et)=−1+1=0, where u:=es+et; by bilinearity B(u,⋅)=0 on Res+Ret. Moreover ρ(s)u=ρ(s)es+ρ(s)et=−es+(et+2es)=u and ρ(t)u=(es+2et)−et=u, so ρ(w)u=u for every w∈W, because W is generated by s,t and ρ is a homomorphism.

2.1F2F6step 1.1

The case A2: the positive roots. By 1.1, the three vectors es=ρ(1)es, et=ρ(1)et and es+et=ρ(t)es are roots; they lie in V+∖{0}, hence in Φ+, and they are pairwise distinct as functions on {s,t}, with values (1,0), (0,1), (1,1). By [F6] the six chambers are cut out by the three root hyperplanes Hβ, β∈Φ; the map α↦Hα from Φ+ onto these lines is injective, because two roots on one line are proportional and both have B-norm one by [F2], forcing the proportionality factor to be ±1, and it is surjective because every Hβ equals H−β with exactly one of ±β in Φ+. Hence ∣Φ+∣=3 and Φ+={es, et, es+et}.

2.2F5F6step 1.1algebra

The case A2: the chambers. Write ys:=f(es) and yt:=f(et) for f∈V∗, so that f is described by the pair (ys,yt). By [F6], f∈wC∘ if and only if f(ρ(w)es)>0 and f(ρ(w)et)>0. Using the products ρ(s)es=−es, ρ(s)et=es+et, ρ(t)et=−et, ρ(t)es=es+et from [F1] and 1.1, together with ρ(st)es=et, ρ(st)et=−es−et, ρ(ts)es=−es−et, ρ(ts)et=es, ρ(sts)es=−et, ρ(sts)et=−es (computed from ρ(uv)=ρ(u)ρ(v)), this gives C∘={ys>0, yt>0}, sC∘={ys<0, ys+yt>0}, stC∘={yt>0, ys+yt<0}, stsC∘={ys<0, yt<0}=−C∘, tsC∘={ys>0, ys+yt<0} and tC∘={yt<0, ys+yt>0}. On each of these six sets the signs of (ys, yt, ys+yt) are the six distinct patterns (+,+,+), (−,+,+), (−,+,−), (−,−,−), (+,−,−), (+,−,+); these are exactly the six combinations not excluded by one of the three equations ys=0, yt=0, ys+yt=0, so the six chambers are the six sectors, in the stated cyclic order. By [F5], s2=t2=1 and (st)3=1 give s(st)j=(ts)js and t(st)j=(ts)jt for all j≥0 and (ts)j=(st)−j, whence suk=u1−k and tuk=u−1−k with indices read modulo 6; combined with ℓ(uk)=min⁡(k,6−k) this gives ℓ(suk)=ℓ(uk)−1 exactly for k∈{1,2,3} and ℓ(tuk)=ℓ(uk)−1 exactly for k∈{3,4,5}. By the shortening equivalence of [F6], Hes separates C∘ from u1C∘,u2C∘,u3C∘ and Het from u3C∘,u4C∘,u5C∘.

2.3F7step 1.1algebra

The case I2(5): the constant. Put c:=cos⁡(π/5) (the constant of the form at m=5) and q:=cos⁡(2π/5). By 1.1, cos⁡(π/3)=1/2; since 0<π/5<π/3<π and cosine is strictly decreasing on [0,π], we have c>1/2>0. The double-angle formula gives q=2c2−1, and since 4π/5=π−π/5 with cos⁡(π−x)=cos⁡((−x)+π)=−cos⁡(−x)=−cos⁡x, we get cos⁡(4π/5)=−c; on the other hand cos⁡(4π/5)=2q2−1=2(2c2−1)2−1. Hence 2(2c2−1)2−1+c=0, that is 8c4−8c2+c+1=0, and because 8c4−8c2+c+1=(2c−1)(c+1)(4c2−2c−1) we obtain 4c2−2c−1=0, as c>1/2 and c≠−1. Finally 4X2−2X−1=4(X−1+54)(X−1−54) by expansion, so c is one of the two numbers 1±54; since 5>1 gives 1−54<0<c, we conclude c=1+54=ϕ/2 with ϕ:=1+52, and then 2c=ϕ and 4c2−1=2c+1−1=2c=ϕ.

2.4F1F2step 1.3algebra

The case I2(∞): the positive roots. Put Ψ:={es+ku:k≥0}∪{et+ku:k≥0}. First, Ψ⊆Φ+: clearly es,et∈Ψ∩Φ+, and for k≥1 the identities es+ku=ρ(s)(et+(k−1)u) and et+ku=ρ(t)(es+(k−1)u) hold by 1.3, so induction on k shows that every element of Ψ is a root; every element of Ψ has nonnegative coefficients in es,et, so Ψ⊆Φ∩V+∖{0}=Φ+. Conversely, Ψ∪(−Ψ) is stable under ρ(s) and ρ(t): by 1.3 one has ρ(s)(es+ku)=−es+ku, which is et+(k−1)u for k≥1 and −es for k=0; ρ(s)(et+ku)=(et+2es)+ku=es+(k+1)u; ρ(t)(et+ku)=−et+ku, which is es+(k−1)u for k≥1 and −et for k=0; and ρ(t)(es+ku)=(es+2et)+ku=et+(k+1)u. Since W is generated by s,t and ρ is a homomorphism, Ψ∪(−Ψ) is stable under every ρ(w); it contains es,et, so it contains the orbit Φ. Hence Φ⊆Ψ∪(−Ψ), and an element of Φ+ lies in Ψ: it lies in Ψ∪(−Ψ), and no element of −Ψ has all coefficients nonnegative, while the elements of V+ do. Therefore Φ+=Ψ; finally the two families es+ku and et+ku are disjoint and each is injective in k, because u≠0 while evaluating es+ku=es+k′u at s gives k=k′, and es+ku=et+k′u would give 1+k=k′ at s and k=1+k′ at t, hence k=k+2, a contradiction; so Φ+ is infinite.

2.5F3F4F5step 1.3algebra

The case I2(∞): the inversion sets. By [F5] the uk are pairwise distinct with ℓ(uk)=k, and u2k=(st)k, u2k+1=(st)ks. We prove by induction on k≥0 the two formulas N((st)k)={ju+et:0≤j≤2k−1} and N((st)ks)={ju+es:0≤j≤2k}. For k=0 the first is N(1)=∅ and the second is N(s)={es}. Assume the second formula for some k≥0. Since ℓ((st)k+1)=2k+2>2k+1=ℓ((st)ks), the recursion of [F3] gives N((st)k+1)={et}⊔ρ(t)N((st)ks); by 1.3, ρ(t)es=es+2et=u+et, so ρ(t){ju+es:0≤j≤2k}={ju+u+et:0≤j≤2k}={(j+1)u+et:0≤j≤2k} and therefore N((st)k+1)={ju+et:0≤j≤2k+1}, which is the first formula with k+1. Since ℓ((st)k+1s)=2k+3>2k+2=ℓ((st)k+1), again, but with ρ(s)et=et+2es=u+es from 1.3, N((st)k+1s)={es}⊔ρ(s){ju+et:0≤j≤2k+1}={ju+es:0≤j≤2k+2}, the second formula with k+1. So both formulas hold for all k≥0. Their elements are pairwise distinct because u≠0, so the two sets have cardinalities 2k and 2k+1, equal to ℓ((st)k)=2k and ℓ((st)ks)=2k+1 by [F5], in agreement with [F4].

3.1F3F5step 1.1step 2.1algebra

The case A2: the inversion sets. By [F3] and 1.1, and since ℓ(u0)=0<ℓ(u1)=1<ℓ(u2)=2<ℓ(u3)=3 by [F5], one has N(s)={es}⊔ρ(s)N(1)={es}, N(t)={et}, N(st)={et}⊔ρ(t)N(s)={et, es+et}, N(ts)={es}⊔ρ(s)N(t)={es, es+et} and N(sts)={es}⊔ρ(s)N(st)={es, es+et, ρ(s)(es+et)}={es, es+et, et}=Φ+, where we used ρ(s)et=es+et and ρ(s)(es+et)=ρ(s)es+ρ(s)et=−es+(es+et)=et; also N(1)=∅. The cardinalities 0,1,1,2,2,3 equal ℓ(1),ℓ(s),ℓ(t),ℓ(st),ℓ(ts),ℓ(sts) by [F5], as asserted.

3.2F1F2F6step 2.3algebra

The case I2(5): the positive roots. By 2.3 and [F1], ρ(s)et=et+ϕes and ρ(t)es=es+ϕet, and using ρ(uv)=ρ(u)ρ(v) and ϕ2=ϕ+1 one computes ρ(st)es=ρ(s)(es+ϕet)=−es+ϕ(et+ϕes)=(ϕ2−1)es+ϕet=ϕ(es+et). Hence the five vectors es=ρ(1)es, et=ρ(1)et, et+ϕes=ρ(s)et, es+ϕet=ρ(t)es and ϕ(es+et)=ρ(st)es are roots; each lies in V+∖{0}, so all five lie in Φ+, and they are pairwise distinct as functions on {s,t}, with values (1,0), (0,1), (ϕ,1), (1,ϕ), (ϕ,ϕ). By [F6] the ten chambers are cut out by the five root hyperplanes Hβ, β∈Φ, and as in 2.1 the map α↦Hα is a bijection from Φ+ onto these lines, so ∣Φ+∣=5 and the five listed vectors exhaust Φ+; each of them has B-norm one because it is a root, by [F2].

4.1F3F4F5step 3.2algebra

The case I2(5): the inversion sets N(uk), 1≤k≤5. By [F5], ℓ(uk)=k for 1≤k≤5, so each step below is a shortening-free step of the recursion of [F3] and the union is disjoint. Starting from N(1)=∅ and using the reflection values ρ(t)es=es+ϕet, ρ(s)et=et+ϕes, ρ(s)(es+ϕet)=ϕ(es+et), ρ(t)(et+ϕes)=ϕ(es+et), ρ(t)ϕ(es+et)=ϕes+et and ρ(s)ϕ(es+et)=es+ϕet (all from [F1], ρ(uv)=ρ(u)ρ(v) and ϕ2=ϕ+1) one computes N(u1)={es}, N(u2)={et}⊔ρ(t)N(u1)={et, es+ϕet}, N(u3)={es}⊔ρ(s)N(u2)={es, et+ϕes, ϕ(es+et)}, N(u4)={et}⊔ρ(t)N(u3)={et, es+ϕet, ϕ(es+et), et+ϕes} and N(u5)={es}⊔ρ(s)N(u4)={es, et+ϕes, ϕ(es+et), es+ϕet, et}=Φ+, the last equality by 3.2. This gives the displayed sets N(u1),…,N(u5), of cardinalities k=∣N(uk)∣=ℓ(uk) as required by [F4].

5.1F3F5step 4.1algebra

The case I2(5): the inversion sets N(uk), 5≤k<10. Since N(u5)=Φ+ by 4.1, the reflection ρ(u5) maps Φ+ bijectively onto Φ− (as N(u5)=Φ+ means ρ(u5)Φ+⊆Φ−, and ρ(u5) induces a bijection of Φ); hence for α∈Φ+: α∈N(u5w) if and only if ρ(w)α∈Φ+, because ρ(u5) maps Φ+ onto Φ− and Φ− onto Φ+. Comparing with the definition of N(w) this gives N(u5w)=Φ+∖N(w) for every w∈W. For 5≤k<10 one has uk=u5 uk−5′, where uj′ is the alternating word of length j beginning with t; hence N(uk)=Φ+∖N(uk−5′). In particular N(u6)=Φ+∖{et} and, using the recursion of [F3] once more for u2′=ts (read with the roles of s and t exchanged, ℓ(u2′)=2>ℓ(t)=1), N(u2′)={es}⊔ρ(s)N(u1′)={es, et+ϕes}, so that N(u7)=Φ+∖N(u2′)={et, es+ϕet, ϕ(es+et)}, of cardinality 3=ℓ(u7).

6.1F1F5F6step 1.3algebra∎

The case I2(∞): the chambers. Let δ(f):=f(es)+f(et) for f∈V∗, so that δ(f)=f(u); since ρ(w)u=u for all w by 1.3, the value δ(f) is preserved by the dual action: δ(w⋅f)=(w⋅f)(u)=f(ρ(w)−1u)=f(u)=δ(f). On L:={f:δ(f)=1} with coordinate ys=f(es), C∘ has trace (0,1). By [F1] and the dual action in [F6], s acts by ys↦−ys and t by ys↦2−ys; hence st acts by translation ys↦ys−2. It follows that (st)kC∘∩L=(−2k,1−2k) and (st)ksC∘∩L=(−2k−1,−2k) for every integer k. These are all intervals (j,j+1), and all group elements are alternating words by [F5] (cancelling adjacent equal letters); therefore these are exactly the open chamber traces, and no integer point belongs to one. Every chamber is a nonempty cone contained in {δ>0}, since this holds for C∘ and δ is invariant. Each chamber K equals the cone {λx:λ>0, x∈K∩L} over its trace, because for f∈K its normalisation f/δ(f) lies in K∩L and f=δ(f) (f/δ(f)) with δ(f)>0; hence the chambers are exactly the cones over the intervals (j,j+1). Finally Hes∩L is the point with ys=0, and Het∩L is the point with ys=1, because yt=1−ys on L. Together with 1.1-1.3, 2.1-2.5, 3.1-3.2, 4.1 and 5.1 this verifies all the claims of (i), (ii) and (iii).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

87 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