Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 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 Tits cone of infinite dihedral type: interior, boundary, and stabilizers

Example

Let S={s,t} with m(s,t)=∞, so that B(es,et)=−1 (The real Coxeter form, its radical, reflections, and form-preserving maps (2)), and let W be the infinite dihedral group with generators s,t and length ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups); let V=RS, and let C, C∘, the chambers wC, the Tits cone U, its interior U∘ and Neg⁡(f) be as in The Tits cone, its interior, and the negative-root set of a functional. Write a functional as the pair (xs,xt):=(f(es),f(et)) and put Δ(f):=f(es+et)=xs+xt. Then:

(i) Dual action and invariance of Δ. The generators act by s:(xs,xt)↦(−xs, 2xs+xt),t:(xs,xt)↦(xs+2xt, −xt), and Δ(w⋅f)=Δ(f) for every w∈W.

(ii) The chambers. C is the closed positive quadrant; with u:=st one has uk:(xs,xt)↦(xs−2k Δ(f), xt+2k Δ(f)),(uks):(xs,xt)↦(−(xs+2k Δ(f)), xt+2xs+2k Δ(f)), for every k∈Z, and the chambers of the system are the translates ukC and uksC of the quadrant; on each affine line {Δ=const>0} their traces are unit intervals in the normalized coordinate a=xs/Δ.

(iii) The Tits cone, its interior and its boundary. U={f:Δ(f)>0}∪{0},U∘={f:Δ(f)>0},U‾={f:Δ(f)≥0}, and the topological boundary of U is the line {f:Δ(f)=0}, of which U contains exactly the point 0. In particular U is neither open nor closed, and the nonzero boundary points do not lie in U.

(iv) Sample membership tests. f=(1,−1) and f′=(−1,0) satisfy Neg⁡(f)⊇{et+ku:k≥0} and Neg⁡(f′)⊇{es+ku:k≥0} (with u=es+et), so both sets are infinite and f,f′∉U by the criterion of The finite-negativity criterion, the reduction step, and convexity of the Tits cone (1); on the other hand s⋅(−1,3)=(1,1)∈C, so (−1,3)∈U.

(v) Stabilizers. Stab⁡W(0)=W; Stab⁡W(f)=⟨st⟩ for every f with Δ(f)=0 and f≠0; Stab⁡W(f)={1} for f∈C∘ and Stab⁡W(f)={1,s} or {1,t} for the points of the two open walls of C; consequently every point of U∖{0} has stabilizer of order at most 2. The outside point f′=(−1,0) has Stab⁡W(f′)={1,t}.

Facts & Assumptions

Given: S={s,t} with m(s,t)=∞, the presented group W with length ℓ, V=RS with Coxeter form B, the canonical reflection homomorphism ρ, the closed chamber C, its interior C∘, the chambers wC, the Tits cone U with interior U∘ and the negative-root sets Neg⁡(f), as in The Tits cone, its interior, and the negative-root set of a functional; a functional is written as the pair (xs,xt)=(f(es),f(et)) and Δ(f):=f(es+et)=xs+xt.

[F1]

U=⋃w∈WwC, each chamber is wC={w⋅f:f∈C}, w′U=U for all w′, the dual action is (w⋅f)(v)=f(ρ(w)−1v) and is a left action (w1⋅(w2⋅f)=(w1w2)⋅f, id⋅f=f), and U∘ and d are the interior and the coordinate metric d(f,g)=max⁡s∣f(es)−g(es)∣ of the definition; moreover f↦(f(es),f(et)) is a linear bijection V∗→R2, so a functional is uniquely determined by, and may be freely prescribed by, its two coordinates. (The Tits cone, its interior, and the negative-root set of a functional (1)-(3)).

[F2]

f∈U if and only if Neg⁡(f) is finite, and Neg⁡(f)=∅ if and only if f∈C. (The finite-negativity criterion, the reduction step, and convexity of the Tits cone (1)-(2)).

[F3]

If f,g∈C and w⋅f=g, then f=g and w∈WS(f); and Stab⁡W(f)=WS(f) for f∈C. (Chamber collisions, point stabilizers, and the intersection rule (3)-(4)).

[F4]

For m(s,t)=∞ one has c(s,t)=1, hence B(es,et)=−1, while B(es,es)=B(et,et)=1; for B(a,a)=1 the reflection is rav=v−2B(v,a)a. (The real Coxeter form, its radical, reflections, and form-preserving maps (2)-(3)).

[F5]

Each rs is a linear involution; rses=−es and rsv=v when B(v,es)=0. (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)).

[F6]

One has ρ(s)=rs for every generator s, and Φ={ρ(w)es:w∈W, s∈S}. (The canonical reflection homomorphism, roots, reflections, and the positive cone (1)-(2)).

[F7]

The closed chamber is C={f:f(es)≥0, f(et)≥0}, its interior is C∘={f:f(es)>0, f(et)>0}, and the root hyperplanes are Hα={f:f(α)=0}. (The dual action, chambers, faces, and root hyperplanes (2)).

[F8]

For m(s,t)=m<∞ the 2m chambers wCP (w∈Ws,t) of the rank-two plane are the 2m closed sectors cut out by the m root hyperplanes Hβ∩P∗, with pairwise disjoint interiors, union all of P∗, and Ws,t acting on them simply transitively; for m(s,t)=∞ the chambers wCP (w∈Ws,t) have pairwise disjoint interiors, their union is {φ∈P∗:φ(es+et)>0}∪{0}, and the root hyperplanes cut the affine line {φ∈P∗:φ(es+et)=1} exactly in the integers in the coordinate ys. In the infinite case the dual generators act by ρ(s)∗(ys,yt)=(−ys, 2ys+yt) and ρ(t)∗(ys,yt)=(ys+2yt, −yt). (The dual action, the faces, and the rank-two chamber tiling (3)(i)-(ii)).

[F9]

Φ=Φ+⊔Φ−, every root lies in V+∖{0} or −V+∖{0} but not both, one has es∈Φ+ for every s∈S, and for every s one has rs(Φ+∖{es})=Φ+∖{es}. (Root sign coherence and the action of simple reflections on positive roots (2)-(3)).

[F10]

W is the group presented by the generators s,t with the relations s2=t2=1 (and no relation for m(s,t)=∞); every element of W is the image of a word in S. (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F11]

For a subset A of a metric space: x∈A‾ if and only if every ball about x meets A, the interior of A consists of the points some ball about which lies in A, and the boundary of A is A‾∖int⁡A. (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).

[F12]

R is an ordered field: the sum of positive elements is positive, and 2λ>0 for λ>0. (The reals form a totally ordered field).

[F13]

Every real a has an integer n with n≤a<n+1. (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

Verification

technique · explicit computation with the unipotent rank-two product
1.1F4F5F6F7algebra

The dual action and Δ. For every f=(xs,xt) the reflection formula gives rses=−es, rset=et+2es, rtet=−et and rtes=es+2et, so evaluating the dual action gives s⋅f=(−xs, 2xs+xt) and t⋅f=(xs+2xt, −xt). Both generators fix the vector es+et: indeed rs(es+et)=−es+et+2es=es+et and symmetrically for t; hence ρ(w) and ρ(w)−1 fix es+et for every w and Δ(w⋅f)=(w⋅f)(es+et)=f(ρ(w)−1(es+et))=Δ(f). This is the action and the invariance assertion of (i).

1.2F10algebra

The elements of W. In W one has s2=t2=1, and with u=st also u−1=ts, so t=u−1s; every product of generators can be rewritten as uk or uks by the rules (uk)s=uks, (uk)t=uk−1s, (uks)s=uk and (uks)t=uk+1, and induction on the number of factors gives W={uk:k∈Z}∪{uks:k∈Z}.

1.3F2F4F5F6F9algebra

Sample membership tests, (iv). For k≥0 put αk:=et+k(es+et)=kes+(k+1)et and βk:=es+k(es+et)=(k+1)es+ket. Then α0=et and β0=es lie in Φ+, and B(αk,es)=−1, B(βk,et)=−1, so the reflection formula gives rsαk=αk+2es=βk+1 and rtβk=βk+2et=αk+1. Since rs permutes Φ+∖{es} and αk≠es for all k≥0, while rt permutes Φ+∖{et} and βk≠et for all k≥1, mutual induction on k gives αk,βk∈Φ+ for all k≥0. For f=(1,−1) one has f(αk)=k−(k+1)=−1<0 for every k, so Neg⁡(f) is infinite and f∉U; for f′=(−1,0) one has f′(βk)=−(k+1)<0 for every k, so f′∉U. Finally s⋅(−1,3)=(−(−1), 2(−1)+3)=(1,1)∈C, so (−1,3)=s⋅(1,1)∈sC⊆U.

2.1step 1.1algebra

The products uk and uks. With u=st one has u⋅f=s⋅(t⋅f)=(−(xs+2xt), 2(xs+2xt)−xt)=(xs−2Δ, xt+2Δ)=f−2Δ (1,−1); since Δ is W-invariant, iterating gives uk⋅f=(xs−2kΔ, xt+2kΔ),uks⋅f=(−(xs+2kΔ), xt+2xs+2kΔ) for every k∈Z.

2.2F7step 1.2algebra

The chambers. By step 1.2 the chambers of the system are the translates ukC and uksC of the closed quadrant C={xs≥0, xt≥0}.

3.1F8step 2.1step 2.2algebra

The traces on an affine line. Write a:=xs/Δ on the region Δ>0, so that xt/Δ=1−a. The computed matrices of step 2.1 identify the chambers ukC and uksC with the intervals: f∈ukC if and only if u−k⋅f∈C, that is xs+2kΔ≥0 and xt−2kΔ≥0, which reads −2k≤a≤1−2k; and f∈uksC if and only if −(xs+2kΔ)≥0 and xt+2xs+2kΔ≥0, which reads −(2k+1)≤a≤−2k. Thus on each affine line {Δ=const>0} the traces of the chambers are the unit intervals with root traces the integers, in agreement with the rank-two picture, and the chambers are exactly the ukC and uksC. This is (ii).

3.2F3step 1.2step 2.1algebra

Stabilizers, (v). Since Stab⁡W(f)=WS(f) for f∈C, one has Stab⁡W(0)=WS=W because S(0)={s,t}. Let Δ(f)=0 and f≠0: step 2.1 gives uk⋅f=f for every k and (uks)⋅f=−f≠f for every k, while W={uk}∪{uks} by step 1.2; since u has infinite order, because uk⋅(1,0)=(1−2k, 2k)≠(1,0) for k≠0, the stabilizer Stab⁡W(f)=⟨u⟩ is infinite cyclic. For f∈C∘ the zero set is empty, so Stab⁡W(f)={1}; for the open wall {xs=0,xt>0} it is {s}, so the stabilizer is {1,s}, and symmetrically {1,t} for {xt=0,xs>0}. For a general g=w⋅f∈U with f∈C and f≠0, the stabilizer formula gives Stab⁡W(g)=wWS(f)w−1, of order at most 2: S(f)⊆{s,t}, and S(f)={s,t} would give f=0, so ∣S(f)∣≤1. Hence every point of U∖{0} has stabilizer of order at most 2. Finally, for f′=(−1,0) the generator t fixes f′, and among the remaining elements uk⋅(−1,0)=(−1+2k,−2k) equals (−1,0) only for k=0, while uks⋅(−1,0)=(1+2k,−2−2k) equals (−1,0) only for k=−1, which is the element u−1s=t already listed; hence Stab⁡W(f′)={1,t}.

4.1F1F12F13step 2.1step 3.1algebra

The Tits cone, (iii). Since Δ is W-invariant and C⊆{Δ≥0}, one has U⊆{Δ≥0}. If Δ(f)>0, then a:=xs/Δ satisfies xt/Δ=1−a, and the intervals [−2k,1−2k] and [−(2k+1),−2k], k∈Z, cover R: these are the unit intervals [n,n+1], n∈Z, in the two parity classes, and [F13] places every real a in one of them; by step 3.1 the functional f lies in some chamber, so f∈U. If Δ(f)=0 and f≠0, then uk⋅f=f for all k while (uks)⋅f=−f≠f and W={uk}∪{uks}; such an f lies in U if and only if f∈C or −f∈C, and both conditions force f=0 because C∩{Δ=0}={0}. Hence U={Δ>0}∪{0}.

5.1F1F11F12step 4.1algebra∎

The interior, the closure and the boundary, (iii). The half-plane {Δ>0} lies in U and is open: if Δ(f)>0 and d(f,g)<Δ(f)/2, then ∣Δ(g)−Δ(f)∣=∣(g−f)(es)+(g−f)(et)∣≤2d(f,g)<Δ(f), so Δ(g)>0; hence {Δ>0}⊆U∘. The origin is not an interior point: for λ>0 the point (−λ,0) has Δ=−λ<0 and so lies outside U, while d((−λ,0),0)=λ can be made arbitrarily small; hence 0∉U∘, and U∘={Δ>0} by step 4.1. Moreover U‾={Δ≥0}: any f with Δ(f)<0 has the ball of radius ∣Δ(f)∣/2 disjoint from U, because Δ(g)<0 for every g in it, while every f with Δ(f)≥0 is a limit of the points gλ with coordinates (xs+λ, xt+λ), λ>0, which exist as functionals by [F1] and satisfy Δ(gλ)=Δ(f)+2λ>0, so gλ∈U by step 4.1, with d(gλ,f)=λ decreasing to 0 (and f∈U itself when Δ(f)>0). Therefore the boundary U‾∖U∘ is the line {Δ=0}, of which U contains exactly the point 0; and U is neither open nor closed, because 0∈U is not interior while the nonzero boundary points lie in U‾∖U.

Depends on

Used by

Dependency tree · two levels

107 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