Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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 interior of the Tits cone, finite parabolic stabilizers, and local finiteness

Statement

Let S, m, W, ℓ, V, B, ρ, Φ, C, C∘, the faces CI, the chambers wC, the walls, 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 and Chamber collisions, point stabilizers, and the intersection rule; for I⊆S put WI=⟨s:s∈I⟩ (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups) and C‾I={f∈C:f(es)=0 for all s∈I}.

(1) Interior criterion. Let f∈C and I:=S(f)={s∈S:f(es)=0}. Then f∈U∘  ⟺  WI is finite.

(2) The interior is the union of the spherical faces. U∘ is W-invariant, and with Cf:=⋃{CI:I⊆S, WI finite}={f∈C:WS(f) finite}, U∘=⋃w∈Ww⋅Cf.

(3) Local finiteness. Let f∈U∘, write f=w⋅f0 with f0∈C and put I:=S(f0). Then there is ε>0 such that (i) {g:d(f,g)<ε}⊆⋃u∈WIw uC; (ii) every chamber meeting {g:d(f,g)<ε} is one of the chambers w uC, u∈WI; (iii) every wall meeting {g:d(f,g)<ε} is one of the walls w uHes, u∈WI, s∈S. Consequently every point of U∘ has a neighborhood meeting only finitely many chambers and only finitely many walls, and every compact subset of U∘ is met by only finitely many chambers and only finitely many walls.

(4) Boundary. Let f∈C with WS(f) infinite, and put I:=S(f). Then f∉U∘; more precisely, with fs∈V∗ the dual basis functionals of (es) and δI:=∑s∈Ifs: (i) f−t δI∉U for every t>0, and d(f−t δI,f)=t→0; hence every neighborhood of f contains points outside U; (ii) every neighborhood of f meets infinitely many distinct chambers, namely all uC with u∈WI. No local finiteness is claimed at such a point f, or at the boundary of U in general.

(5) The vertex. 0∈U∘ if and only if W is finite.

Facts & Assumptions

Given: A finite set S, a Coxeter matrix m, the presented group W with length ℓ, V=RS with Coxeter form B, the canonical reflection homomorphism ρ with root system Φ, the signed root system Φ=Φ+⊔Φ−, the closed chamber C, its interior C∘, the faces CI, the chambers wC, the Tits cone U with its interior U∘, the coordinate metric d, and the negative-root sets Neg⁡(f), all as in The Tits cone, its interior, and the negative-root set of a functional and The dual action, chambers, faces, and root hyperplanes; for I⊆S let WI=⟨s:s∈I⟩ and C‾I={f∈C:f(es)=0 for all s∈I}.

[F1]

The Tits cone is U=⋃w∈WwC, U∘ is its interior for the coordinate metric d (the maximum formula for S≠∅, and d(0,0)=0 for S=∅), a neighborhood of f contains a ball {g:d(f,g)<ε}, and w′U=U for every w′∈W. (The Tits cone, its interior, and the negative-root set of a functional (2)-(3)).

[F2]

Criterion of finite negativity: 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]

Collision and stabilizers: if f,g∈C, w∈W and w⋅f=g, then f=g and w∈WS(f); consequently Stab⁡W(f)=WS(f) for f∈C, and wHes=Hρ(w)es for all w,s. (Chamber collisions, point stabilizers, and the intersection rule (1), (3)-(4)).

[F4]

Every root has a sign: Φ=Φ+⊔Φ−, every root lies in V+∖{0} or in −V+∖{0} and not in both, every f∈C∘ is positive on Φ+ and negative on Φ−, and each rs permutes Φ+∖{es} with rses=−es. (Root sign coherence and the action of simple reflections on positive roots (2)-(3)).

[F5]

For u∈W the inversion set is N(u)=Φ+∩ρ(u)−1Φ−. (The geometric inversion set N(w) of an element of a Coxeter group (1)).

[F6]

For every reduced expression u=s1⋯sn one has N(u)={ρ(si+1⋯sn)−1esi:1≤i≤n} and ∣N(u)∣=ℓ(u). (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (2)).

[F7]

The reflection with normal es is rsv=v−2B(v,es)es with B(es,es)=1. (The real Coxeter form, its radical, reflections, and form-preserving maps (2)-(3)).

[F8]

Each rs is a linear involution and fixes pointwise every v with B(v,es)=0. (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)).

[F9]

One has ρ(s)=rs for every s, the positive cone is V+={∑sλses:λs≥0}, and Φ={ρ(w)es:w∈W, s∈S}. (The canonical reflection homomorphism, roots, reflections, and the positive cone (1)-(3)).

[F10]

The dual action is (w⋅f)(v)=f(ρ(w)−1v); the closed chamber is C={f:f(es)≥0 for all s}, the open chamber is C∘={f:f(es)>0 for all s}, and the root hyperplane is Hα={f:f(α)=0}. (The dual action, chambers, faces, and root hyperplanes (1)-(2)).

[F11]

WI=⟨s:s∈I⟩ is the subgroup generated by I, and W∅={1}. (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups).

[F12]

Every element of W is the image of a word in S; a reduced expression of w has length exactly ℓ(w), and reversing it expresses w−1, so ℓ(w−1)=ℓ(w). (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F13]

Deletion: every word in S representing a given element can be shortened step by step, deleting two letters at each step, until a reduced expression of that element remains. (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action (3)).

[F14]

A real inner product is bilinear, symmetric and positive definite: ⟨φ,φ⟩>0 for φ≠0. (Real and complex inner-product spaces and their induced length, Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms).

[F16]

The coordinate functionals fs of the basis (es)s∈S satisfy fs(et)=δst, and every h∈V∗ is linear in these coordinates: h(v)=∑s∈Sv(s)h(es) for v=∑s∈Sv(s)es. Writing ∥v∥1:=∑s∈S∣v(s)∣ and ∥h∥∞:=d(0,h) (equal to max⁡s∈S∣h(es)∣ when S≠∅) one has ∣h(v)∣≤∥h∥∞∥v∥1; in particular δI:=∑s∈Ifs takes the value δI(α)=∑s∈Ics at α=∑s∈Icses. (The dual family (b∗)b∈B associated to a Hamel basis B, defined by b∗(c)=δbc, Linear functionals and the algebraic dual V∗=L(V,F), Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[F17]

A finite set N has a cardinality ∣N∣∈N (The cardinality ∣A∣ of a finite set); every nonempty finite subset of R has a maximum and a minimum (Every nonempty finite set of reals has a maximum and a minimum); and WI=⟨s:s∈I⟩ is a subgroup of W, hence contains the identity and is nonempty (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups).

[F19]

Riesz representation: for every linear functional φ↦φ(et) on the finite-dimensional inner product space VI∗ there is a unique zt∈VI∗ with ⟨φ,zt⟩=φ(et) for all φ. (Finite-dimensional Riesz representation: every functional is uniquely v↦⟨v,w⟩).

[F20]

The dual action is a left action by linear maps: id⋅f=f, w1⋅(w2⋅f)=(w1w2)⋅f, and f↦w⋅f is linear for every w∈W. (The dual action, the faces, and the rank-two chamber tiling (1)).

[F21]

The face C∘ is nonempty: the sum ∑s∈Sfs of the coordinate functionals has value 1 at every es, so it lies in C∘. (The dual action, the faces, and the rank-two chamber tiling (2), The dual family (b∗)b∈B associated to a Hamel basis B, defined by b∗(c)=δbc).

Proof

technique · an averaged invariant inner product on the finite parabolic, then an explicit negative-root perturbation
1.1F1F7F8F9F11F12F15algebra

The empty-rank case and the parabolic span. If S=∅, then W={1}, V∗=C=U=U∘={0}, there is one chamber and no walls, and all five clauses hold with radius 1; hence assume S≠∅. Let I⊆S, put VI:=span⁡{es:s∈I} and let f∈C with S(f)=I. The finite words in I form a subgroup containing I, and any subgroup containing I contains every such word; therefore their values are exactly WI. For a generator t∈I the reflection formula gives rtv=v−2B(v,et)et and rtes−es=−2B(es,et)et∈VI for every s∈S; since rt is an involution, this shows by induction on a product of generators — no finiteness of WI is used — that ρ(u) preserves VI and that ρ(u)−1es−es∈VI for every u∈WI and every s∈S. In particular ρ(u)−1es∈VI for s∈I, and f vanishes on VI because S(f)=I.

1.2F14F17algebra

An invariant inner product on VI∗. Assume WI finite and I≠∅. On the finite-dimensional dual VI∗ consider the action (u⋅φ)(v)=φ(ρ(u)−1v) and the positive definite form ⟨φ,ψ⟩0:=∑s∈Iφ(es)ψ(es) (positive definite because a functional on VI vanishing on the basis (es)s∈I is zero). Since WI is a finite group, the average ⟨φ,ψ⟩:=1∣WI∣∑u∈WI⟨u⋅φ,u⋅ψ⟩0 is well defined, bilinear and symmetric; it is positive definite because for φ≠0 every summand is ≥0 and the summand with u=1 equals ∑s∈Iφ(es)2>0. Hence ⟨⋅,⋅⟩ is an inner product on VI∗, and it is WI-invariant: substituting u′=ut in the sum shows ⟨t⋅φ,t⋅ψ⟩=⟨φ,ψ⟩ for every t∈WI.

1.3F4F8F9F10F14F19algebra

Reflections of this inner product. For t∈I the functional φ↦φ(et) on VI∗ is nonzero (evaluate at any φ with φ(et)≠0), so by Riesz representation there is zt∈VI∗ with ⟨φ,zt⟩=φ(et) for all φ; then zt≠0, and zt is orthogonal to the hyperplane Ht:={φ:φ(et)=0}. The action of t is an involution fixing Ht pointwise, because t⋅φ=φ holds exactly when φ vanishes on (ρ(t)−id)VI=Ret. As t is an isometry of ⟨⋅,⋅⟩, for all ψ one has ⟨t⋅ψ,zt⟩=⟨t2⋅ψ,t⋅zt⟩=⟨ψ,t⋅zt⟩, while also ⟨t⋅ψ,zt⟩=(t⋅ψ)(et)=ψ(rtet)=ψ(−et)=−⟨ψ,zt⟩. Hence ⟨ψ,t⋅zt⟩=−⟨ψ,zt⟩ for all ψ, and positive definiteness gives t⋅zt=−zt≠zt. Every ψ decomposes as ψ=(ψ−⟨ψ,zt⟩∥zt∥2zt)+⟨ψ,zt⟩∥zt∥2zt with the first summand orthogonal to zt, and t agrees with R(ψ):=ψ−2⟨ψ,zt⟩∥zt∥2zt on zt⊥ and on zt; hence t⋅ψ=ψ−2ψ(et)∥zt∥2zt(ψ∈VI∗).

2.1F17step 1.2step 1.3algebra

The finite-parabolic lemma. If I=∅, then VI∗={0} and u=1 gives the conclusion; assume I≠∅. Let φ∈VI∗ and let γ∈VI∗ be the functional γ(v):=∑s∈Ics for v=∑s∈Icses; then γ(et)=1 for every t∈I and γ=0 when I=∅. Choose u∈WI maximizing the real number ⟨u⋅φ,γ⟩ over the nonempty finite set {⟨v⋅φ,γ⟩:v∈WI}. If (u⋅φ)(et)<0 for some t∈I, then step 1.3 applied to ψ:=u⋅φ gives ⟨t⋅(u⋅φ),γ⟩=⟨u⋅φ,γ⟩−2(u⋅φ)(et)∥zt∥2⟨zt,γ⟩=⟨u⋅φ,γ⟩−2(u⋅φ)(et)∥zt∥2>⟨u⋅φ,γ⟩, using ⟨zt,γ⟩=γ(et)=1; this contradicts maximality, so (u⋅φ)(es)≥0 for every s∈I. Thus every element of VI∗ has a WI-translate in the closed chamber of VI∗.

2.2F1F2F5F6F12F13F16step 1.1algebra

The infinite-parabolic case (4)(i): points outside U arbitrarily close to f. Let f∈C with I=S(f) and WI infinite. If lengths were bounded on WI by some N, every element of WI would have a reduced expression of length at most N, hence would be the image of one of the finitely many words in S of length at most N, and WI would be finite; so ℓ is unbounded on WI. Every element of WI has a reduced expression with letters in I: writing it as a product of elements of I and repeatedly deleting two letters until no further deletion shortens the word produces a reduced expression whose letters are among the original ones, hence lie in I. For such a reduced expression u=s1⋯sn with si∈I, the suffix formula exhibits every element of N(u) as ρ(v)−1es with v∈WI, s∈I; since ρ(v) preserves VI, these roots lie in Φ+∩VI. As ∣N(u)∣=ℓ(u) is unbounded on WI, the set Φ+∩VI is infinite. Now let δI:=∑s∈Ifs for the dual basis functionals fs, and put gt:=f−t δI for t>0. Every α∈Φ+∩VI is a nonnegative combination α=∑s∈Icses, so f(α)=∑scsf(es)=0 and δI(α)=∑scs>0, whence gt(α)=−t δI(α)<0; therefore Neg⁡(gt) is infinite and gt∉U by the criterion of finite negativity. Since gt−f=−t δI has coordinate −t on I and 0 outside I, one has d(gt,f)=t, and t can be taken arbitrarily small; hence every neighborhood of f contains points outside U, and f∉U∘. This proves the reverse direction of (1) and clause (4)(i).

3.1F1F2F10F16F17step 1.1step 2.1algebra

The finite case of (1): a neighborhood of f lies in U. Keep the notation of step 1.1. Applying the lemma of step 2.1 to φ:=g∣VI for an arbitrary g∈V∗ gives u∈WI with (u⋅(g∣VI))(es)≥0 for all s∈I; since ρ(u)−1es∈VI for s∈I, this is (u⋅g)(es)≥0 for s∈I. For s∉I write ρ(u)−1es=es+vu with vu∈VI; then (u⋅g)(es)=f(es)+(g−f)(es)+(g−f)(vu), because f vanishes on VI. If I≠S, put δ:=min⁡s∉If(es)>0 and M:=max⁡{ ∥ρ(u)−1es−es∥1:u∈WI, s∉I }<∞ (a maximum over the finite set WI×(S∖I) in the coordinates of [F16]), and let ε:=δ/(1+M); if I=S put ε:=1 and skip the estimate outside I. Every g with d(f,g)<ε then satisfies (u⋅g)(es)≥f(es)−∥g−f∥∞−∥g−f∥∞M>δ−ε(1+M)=0 for s∉I, by [F16], and ≥0 for s∈I; that is u⋅g∈C and g∈u−1C⊆U. Hence the ball {g:d(f,g)<ε} lies in U, so f∈U∘; this is the finite case of (1).

3.2F3F10F11F21step 2.2algebra

The boundary meets infinitely many chambers, (4)(ii). Keep f and I from step 2.2. For every u∈WI the chamber uC contains f, because u∈WS(f) fixes f; distinct u give distinct chambers: if uC=u′C, then with L:=u′−1u one has L(C)=C, and for any point x∈C∘, which is nonempty by [F21] and lies in C, the points x and L(x) are in C and L⋅x=L(x), so the collision theorem gives L∈WS(x)=W∅={1} and u=u′. Since WI is infinite, the infinitely many distinct chambers uC all contain f, so every neighborhood of f meets infinitely many distinct chambers. Together with step 2.2 this is (4).

4.1F3F4F10F16step 3.1algebra

Chambers and walls near f, the case w=1. Keep ε from step 3.1 and let vC be a chamber meeting the ball {g:d(f,g)<ε} at a point g; by step 3.1 there is u∈WI with g∈uC, so u−1⋅g∈C and v−1⋅g∈C. Apply the collision theorem to the pair (u−1⋅g, v−1⋅g) and the element v−1u: since (v−1u)⋅(u−1⋅g)=v−1⋅g, we get v−1u∈WS(u−1⋅g). For s∉I one has (u−1⋅g)(es)=g(ρ(u)es)=f(es)+(g−f)(es)+(g−f)(ρ(u)es−es)>0, because ∥ρ(u)es−es∥1≤M (the map u↦u−1 permutes WI) and d(f,g)<ε, by [F16]; hence S(u−1⋅g)⊆I and v−1u∈WI, so v∈uWI⊆WI and vC is one of the chambers u′C with u′∈WI. If instead a wall vHer meets the ball, put α:=ρ(v)er∈Φ, so that vHer=Hα; for every u∈WI the intersection Hα∩uC∘ is empty, because a point u⋅x with x∈C∘ has (u⋅x)(α)=x(ρ(u)−1α)≠0 as ρ(u)−1α is a root and x is strictly signed on roots. Any point y∈Hα in the ball lies in some uC with u∈WI by the covering of step 3.1, and y∉uC∘, so y is a boundary point of the closed polyhedral cone uC={f:f(ρ(u)es)≥0 for all s} and therefore lies in some wall uHes. Thus the nonempty open subset Hα∩{g:d(f,g)<ε} of the hyperplane Hα is covered by the finitely many subspaces Hα∩uHes (u∈WI, s∈S), each of which is either Hα or a proper subspace; a finite union of proper subspaces of a real vector space cannot contain a nonempty open set (given a point of the open set outside the first m−1 subspaces, the affine line through it in a direction outside the last subspace meets each remaining subspace in at most one parameter, so some nearby parameter lies in the open set but in no subspace), so Hα=uHes for some u∈WI and s∈S, and the wall is one of the walls uHes of the chambers uC, u∈WI.

5.1F1F10F16F20step 2.2step 3.1step 4.1algebra

Local finiteness at every point of U∘: (3)(i)-(iii). Let f∈U∘ and write f=w⋅f0 with f0∈C, and put I:=S(f0); this is possible because U=⋃wwC. The map L(x):=w⋅x is linear by [F20] and is a bijection with inverse L−1(x)=w−1⋅x; both are given in the coordinates (es) by real matrices (mst) and (mst′), so d(Lx,Ly)≤C d(x,y) and d(L−1x,L−1y)≤C′ d(x,y) with C:=max⁡s∑t∣mst∣ and C′:=max⁡s∑t∣mst′∣ (if S=∅ then V∗={0} and there is nothing to prove), by [F16]; in particular C>0 when S≠∅. Since f∈U∘ there is ε′>0 with B(f,ε′)⊆U; then L(B(f0,ε′/C))⊆B(f,ε′)⊆U, so B(f0,ε′/C)⊆L−1(U)=U because L(U)=U by [F1]; hence f0∈U∘, and since f0∈C, the contrapositive of step 2.2 gives that WI is finite. By steps 3.1 and 4.1 applied to f0 there is ε0>0 such that the ball about f0 of radius ε0 is covered by the chambers uC (u∈WI), every chamber meeting it is one of them, and every wall meeting it is one of the walls uHes (u∈WI, s∈S). Hence L(B(f0,ε0))⊇B(f,ε) for ε:=ε0/C′: for y∈B(f,ε) the point x:=L−1(y) satisfies d(x,f0)=d(L−1y,L−1f)≤C′d(y,f)<ε0. So the ball about f is contained in ⋃u∈WIwuC, since L(uC)=wuC for every u by [F20]. If a chamber A=vC meets B(f,ε) at y, then L−1(A)=w−1vC meets B(f0,ε0) at x, so w−1vC=uC for some u∈WI by the w=1 case of step 4.1, that is A=wuC; and if a wall A=vHes meets B(f,ε), then L−1(A)=(w−1v)Hes meets B(f0,ε0), so w−1vHes=uHer for some u∈WI, r∈S by step 4.1, that is A=(wu)Her. Thus every chamber meeting the ball about f is one of the chambers wuC and every wall meeting it is one of the walls wuHes with u∈WI, s∈S. This is (3) for general f.

6.1F1F18step 5.1algebra

Compact subsets. Let K⊆U∘ be compact and let B be the family of all balls B(x,r) with x∈K, r>0, that meet only finitely many chambers and walls. Step 5.1 shows that B covers K, without selecting a radius at each point. These balls are open: for y∈B(x,r), the triangle inequality gives B(y,r−d(x,y))⊆B(x,r). By [F18], finitely many members of B cover K (none if K=∅). Every chamber or wall meeting K meets one of these balls, so only finitely many chambers and walls meet K.

7.1F1F10F11F16F20step 2.2step 3.1step 5.1algebra∎

Clause (2) and the vertex (5). First, U∘ is W-invariant: for each w, the map Lw(x)=w⋅x is a linear bijection by [F20], and as in step 5.1 its two coordinate matrices give d(Lwx,Lwy)≤Cwd(x,y) and d(Lw−1x,Lw−1y)≤Cw′d(x,y) by [F16], so Lw is a homeomorphism; since Lw(U)=U by [F1], the image Lw(U∘) is open and contained in U, hence Lw(U∘)⊆U∘, and applying the same to Lw−1 gives Lw(U∘)=U∘. Now if f∈U∘ then f=w⋅g with g∈C, and g∈U∘ by this invariance, so the criterion (1), whose two directions are steps 2.2 and 3.1, makes the group WS(g) finite and g∈Cf, whence f∈w⋅Cf; conversely every point of w⋅Cf lies in U∘ by the finite case of (1) applied to its w-translate in C and the W-invariance of U∘. Since Cf=⋃{CI:I⊆S, WI finite} and f∈CI means S(f)=I, this is the identification Cf={f∈C:WS(f) finite} and hence U∘=⋃w∈Ww⋅Cf. Applying (1) to f=0, whose zero set is S(0)=S, gives 0∈U∘ if and only if WS=W is finite; this is (5).

Depends on

Used by

Dependency tree · two levels

121 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