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.

✓ 3 results · all verified · 0 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 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Tits Cones, Chambers, and Parabolic Stabilizers

1 · Prerequisites

2 · Summary

Chambers of a Coxeter group live in the dual space. For the contragredient action of ρ(W) on V∗ and the closed chamber C={f:f(es)≥0 for all s}, The Tits cone, its interior, and the negative-root set of a functional fixes the chamber system wC, the Tits cone U=⋃w∈WwC, its ordinary finite-dimensional interior U∘ for the coordinate metric d(f,g)=max⁡s∣f(es)−g(es)∣ when S≠∅ (and d(0,0)=0 in empty rank), and the negative-root set Neg⁡(f); the union definition deliberately asserts neither convexity nor local finiteness.

The three theorems make the union usable. The finite-negativity criterion, the reduction step, and convexity of the Tits cone proves the criterion f∈U  ⟺  Neg⁡(f) finite, the one-letter reduction Neg⁡(s⋅f)=rs(Neg⁡(f)∖{es}) when f(es)<0, with its termination in C, the inversion-set bounds Neg⁡(f)⊆N(w) and ∣Neg⁡(f)∣≤ℓ(w) whenever w⋅f∈C, and convexity of U under nonnegative scalings and convex combinations. Chamber collisions, point stabilizers, and the intersection rule shows that a point of U has exactly one representative in the fundamental chamber, identifies Stab⁡W(f) for f∈C with the parabolic WS(f), conjugates this formula along U, and computes the general intersection wC∩C by the same left-descent argument. The interior of the Tits cone, finite parabolic stabilizers, and local finiteness proves f∈U∘  ⟺  WS(f) finite for f∈C, that U∘ is the union of the W-translates of the spherical faces Cf, that every point of U∘ has a neighborhood meeting only finitely many chambers and walls (hence so does every compact subset), and that points with infinite parabolic stabilizer are approached from outside U by the explicit perturbations f−t δI; no local finiteness is claimed on the boundary. All four items are choice-free. The finite-dimensional Riesz representation used in the local-finiteness argument is Finite-dimensional Riesz representation: every functional is uniquely v↦⟨v,w⟩; the inner-product conventions are fixed by Real and complex inner-product spaces and their induced length on hilbert-space-geometry-and-riesz-representation. The compact-subset conclusion uses A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it to pass from intrinsic compactness to an ambient ball cover, formed from all suitable balls so that no choice of radii is needed. The companion tits-cones-chambers-and-parabolic-stabilizers-examples tests these constructions in the infinite dihedral, A2 and product types.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-10-08Open item page →

The Tits cone, its interior, and the negative-root set of a functional

Definition

Let S be a finite set, m a Coxeter matrix on S, 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 reflections ra (The real Coxeter form, its radical, reflections, and form-preserving maps), ρ:W→GL(V) the canonical reflection homomorphism with root system Φ and positive cone V+ (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let V∗ be the algebraic dual with its dual action, closed chamber C, faces CI and root hyperplanes Hα in the notation of The dual action, chambers, faces, and root hyperplanes. Let Φ=Φ+⊔Φ− be the signed root system and C∘=⋂s∈S{f∈V∗:f(es)>0} the open chamber (Root sign coherence and the action of simple reflections on positive roots).

(1) The chamber system. For w∈W put wC:={w⋅f:f∈C}. The sets wC are the chambers of (W,S) and C is the fundamental chamber; for w∈W and s∈S the hyperplane wHes is a wall of the chamber wC.

(2) The Tits cone. The Tits cone is U:=⋃w∈WwC⊆V∗. This definition asserts no convexity or closedness of U, face-intersection properties, or local finiteness. Convexity is proved in The finite-negativity criterion, the reduction step, and convexity of the Tits cone ↗, chamber intersections in Chamber collisions, point stabilizers, and the intersection rule, and local finiteness of chambers and walls only at points of U∘ in The interior of the Tits cone, finite parabolic stabilizers, and local finiteness (3). Immediate from the definition, the group law and the left-action property of the dual action (The dual action, the faces, and the rank-two chamber tiling (1)): C⊆U, 0∈U (because 0∈C), and w′U=U for every w′∈W.

(3) The finite-dimensional topology and the interior. Since S is finite, f↦(f(es))s∈S is a linear bijection V∗→RS (The dual family (b∗)b∈B associated to a Hamel basis B, defined by b∗(c)=δbc, The dual family of a finite basis is a basis of the dual space, with the same dimension, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis). If S≠∅, pulling back the metric d∞ of Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it along this bijection gives the metric d(f,g):=max⁡s∈S∣f(es)−g(es)∣ on V∗ (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement); if S=∅ then V∗={0} is a singleton and d is its unique metric, d(0,0)=0.

A second basis enters only when S≠∅. If (et′) is a second basis with et′=∑s∈Satses, then max⁡t∣f(et′)∣≤Cmax⁡s∣f(es)∣ and max⁡s∣f(es)∣≤C′max⁡t∣f(et′)∣ with C=max⁡t∑s∣ats∣ and C′ the analogous constant of the inverse matrix, whose entries are finite because S is finite; so a second coordinate system gives an equivalent norm, hence the same open sets and the same interior (For n≥1 all norms on Rn are equivalent). The interior of the Tits cone is U∘:=int⁡U, the interior of U for this ordinary finite-dimensional topology (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space). Thus a neighborhood of f is a set containing some ball {g:d(f,g)<ε}, ε>0, and compact means compact for this topology (Open cover, subcover, compact metric space, and compact subset of a metric space).

(4) The negative-root set of a functional. For f∈V∗ put Neg⁡(f):={α∈Φ+:f(α)<0}⊆Φ+. This attaches a set of positive roots to a functional; it is not the inversion set N(w) attached to a group element (The geometric inversion set N(w) of an element of a Coxeter group). No finiteness of Neg⁡(f) is asserted by this definition: the equivalence "f∈U if and only if Neg⁡(f) is finite" is the theorem The finite-negativity criterion, the reduction step, and convexity of the Tits cone ↗.

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

The finite-negativity criterion, the reduction step, and convexity of the Tits cone

Statement

Let S, m, W, ℓ, V, B, ρ, Φ=Φ+⊔Φ−, V+, C, C∘, the chambers wC, the Tits cone U and the negative-root sets Neg⁡(f) be as in The Tits cone, its interior, and the negative-root set of a functional.

(1) Finite-negativity criterion. For every f∈V∗, f∈U  ⟺  Neg⁡(f) is finite.

(2) The chamber as the empty negative-root set. For every f∈V∗, Neg⁡(f)=∅ if and only if f∈C.

(3) Reduction step. Let f∈V∗ with Neg⁡(f) finite and f∉C, and let s∈S with f(es)<0 (such an s exists). Then es∈Neg⁡(f) and Neg⁡(s⋅f)=rs(Neg⁡(f)∖{es}),∣Neg⁡(s⋅f)∣=∣Neg⁡(f)∣−1. Iterating, after exactly ∣Neg⁡(f)∣ steps one reaches an element w∈W with w⋅f∈C.

(4) Convexity. U is closed under nonnegative scalar multiples and under convex combinations: f∈U, λ≥0 ⟹ λf∈U;f,g∈U, t∈[0,1] ⟹ (1−t)f+tg∈U.

(5) Inversion-set bounds. If f∈U and w∈W satisfies w⋅f∈C, then Neg⁡(f)⊆N(w)and∣Neg⁡(f)∣≤ℓ(w).

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 ρ, the signed root system Φ=Φ+⊔Φ−, the positive cone V+, the closed chamber C, its interior C∘, the chambers wC, the Tits cone U and the negative-root sets Neg⁡(f), all as in The Tits cone, its interior, and the negative-root set of a functional.

[F1]

The Tits cone is U=⋃w∈WwC, the closed chamber is C={f∈V∗:f(es)≥0 for all s}, the open chamber is C∘={f:f(es)>0 for all s}, the negative-root set is Neg⁡(f)={α∈Φ+:f(α)<0}, the dual action is (w⋅f)(v)=f(ρ(w)−1v), and w′U=U for every w′∈W. (The Tits cone, its interior, and the negative-root set of a functional (1)-(4)).

[F2]

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

[F3]

For every s∈S one has rs(Φ+∖{es})=Φ+∖{es} and rses=−es. (Root sign coherence and the action of simple reflections on positive roots (3)).

[F4]

The inversion set of w∈W is N(w)=Φ+∩ρ(w)−1Φ−={α∈Φ+:ρ(w)α∈Φ−}. (The geometric inversion set N(w) of an element of a Coxeter group (1)).

[F5]

For every w∈W one has ∣N(w)∣=ℓ(w). (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (2)).

[F7]

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

[F8]

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

[F10]

Functionals are linear, f(∑scses)=∑scsf(es), and the dual space carries pointwise addition and scalar multiplication. (Linear functionals and the algebraic dual V∗=L(V,F)).

[F11]

Induction principle: a property of natural numbers that holds for 0 and is inherited from n to n+1 holds for every natural number. (The principle of mathematical induction).

[F12]

The cardinality ∣N∣ of a finite set N is a natural number, and ∣N∣=0 if and only if N=∅. (The cardinality ∣A∣ of a finite set).

Proof

technique · direct, with induction on the number of negative roots
1.1F1F2F4F5F8F10algebra

Let f∈U and let w∈W satisfy g:=w⋅f∈C; such a w exists because U=⋃u∈WuC. For α∈Neg⁡(f), the dual action gives g(ρ(w)α)=f(α)<0. Since g is nonnegative on V+ and ρ(w)α is a signed root, this forces ρ(w)α∈Φ−, hence α∈N(w). Thus Neg⁡(f)⊆N(w) and ∣Neg⁡(f)∣≤∣N(w)∣=ℓ(w), proving the forward implication of (1) and all of (5).

1.2F1F2F8F10algebra

For every f∈V∗ one has Neg⁡(f)=∅ if and only if f∈C. If f∈C and α∈Φ+, write α=∑scses with cs≥0; then f(α)=∑scsf(es)≥0, so no positive root is negative at f and Neg⁡(f)=∅. Conversely, if Neg⁡(f)=∅ then f(es)≥0 for every s, because es∈Φ+ and f(es)<0 would put es into Neg⁡(f); hence f∈C. This is clause (2).

2.1step 1.2F2F8F10algebra

Let N:=Neg⁡(f) be finite and nonempty, with n:=∣N∣, and let f∉C, so that N≠∅ by step 1.2. Since N⊆V+∖{0}, an element α=∑scses of N has all coefficients ≥0 and some coefficient >0, and the strict inequality f(α)=∑scsf(es)<0 forces f(es)<0 for some s∈S; for that s one has es∈Φ+ and es∈N. This is the existence clause of (3).

3.1step 2.1F1F2F3F7F8algebra

Keep N, f and s from step 2.1, so that es∈N and f(es)<0, and let β∈Φ+. Because ρ(s)=rs is an involution, the dual action gives (s⋅f)(β)=f(rsβ). For β=es this is f(rses)=f(−es)=−f(es)>0, so es∉Neg⁡(s⋅f). For β≠es the reflection rs permutes Φ+∖{es}, so rsβ∈Φ+∖{es}, and β∈Neg⁡(s⋅f) if and only if f(rsβ)<0, that is if and only if rsβ∈N∖{es}; since β↦rsβ is a bijection of Φ+∖{es} onto itself, this gives Neg⁡(s⋅f)=rs(N∖{es}) and ∣Neg⁡(s⋅f)∣=∣N∖{es}∣=n−1. This is the reduction identity of (3).

4.1step 1.2step 2.1step 3.1F1F11F12algebra

Claim: every f∈V∗ with Neg⁡(f) finite lies in U. Induct on the natural number n=∣Neg⁡(f)∣. For n=0 step 1.2 gives f∈C⊆U. For n≥1 one has f∉C by step 1.2, so step 2.1 supplies s∈S with es∈N, and step 3.1 gives ∣Neg⁡(s⋅f)∣=n−1, so by the induction hypothesis s⋅f∈U, say s⋅f=u⋅g with g∈C; then f=s⋅(s⋅f)=(su)⋅g∈U because w′U=U for every w′∈W. Iterating the reduction step decreases the size of the negative-root set by exactly one each time and stops precisely when that set is empty, which by step 1.2 is exactly when the current element lies in C; hence after exactly n=∣Neg⁡(f)∣ steps one reaches w∈W with w⋅f∈C. This proves the converse direction of (1) and the iteration clause of (3).

5.1step 1.1step 4.1F1F10algebra

For λ>0 one has Neg⁡(λf)=Neg⁡(f), since (λf)(α)=λf(α) and λ>0; also Neg⁡(0)=∅, because 0(α)=0 is not <0. For t∈[0,1], if α∈Neg⁡((1−t)f+tg) then (1−t)f(α)+tg(α)<0, which forces f(α)<0 or g(α)<0, since both coefficients are ≥0; hence Neg⁡((1−t)f+tg)⊆Neg⁡(f)∪Neg⁡(g). By the criterion of steps 1.1 and 4.1, every f∈U satisfies λf∈U for all λ≥0 (the case λ=0 is 0∈C⊆U), and (1−t)f+tg∈U for all f,g∈U and t∈[0,1], endpoints t=0 and t=1 included. This is (4).

6.1step 1.1step 1.2step 2.1step 3.1step 4.1step 5.1algebra∎

No Choice is used: the induction is finite, and each reduction instantiates a single simple reflection with negative coordinate. Steps 1.1–5.1 establish all five clauses.

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

Chamber collisions, point stabilizers, and the intersection rule

Statement

Let S, m, W, ℓ, V, B, ρ, Φ, C, C∘, the chambers wC and the Tits cone U be as in The Tits cone, its interior, and the negative-root set of a functional; for I⊆S put WI:=⟨s:s∈I⟩ (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups) and for f∈V∗ put S(f):={s∈S:f(es)=0}.

(1) Walls are root hyperplanes. For all w∈W and s∈S, wHes=Hρ(w)es; hence the walls of the chamber system are exactly the root hyperplanes Hα, α∈Φ.

(2) Side rule. For all w∈W and s∈S, wC∘⊆{f∈V∗:f(es)>0}  ⟺  ℓ(sw)>ℓ(w),wC∘⊆{f∈V∗:f(es)<0}  ⟺  ℓ(sw)<ℓ(w), and exactly one of the two alternatives holds. If ℓ(sw)<ℓ(w) then C⊆{f:f(es)≥0} and wC⊆{f:f(es)≤0}: the chambers C and wC lie on opposite sides of the wall Hes.

(3) Collision. If f,g∈C, w∈W and w⋅f=g, then f=g and w∈WS(f).

(4) Point stabilizers. For every f∈C, Stab⁡W(f)=WS(f). For f∈U and w∈W with w−1⋅f∈C one has Stab⁡W(f)=w WS(w−1⋅f) w−1.

(5) The intersection rule. For every w∈W, with C‾T:={f∈C:f(es)=0 for all s∈T}, wC∩C={f∈C:w∈WS(f)}=⋃T⊆Sw∈WTC‾T.

(6) Strict fundamental domain. Every W-orbit contained in U meets C in exactly one point. In particular the open chambers wC∘ (w∈W) are pairwise disjoint, and the chambers meeting in a face are described by (5).

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 closed chamber C, its interior C∘, the chambers wC, the Tits cone U and the root hyperplanes Hα, 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 for f∈V∗ let S(f)={s∈S:f(es)=0}.

[F1]

The chamber system and the Tits cone are wC={w⋅f:f∈C} and U=⋃w∈WwC, and w′U=U for every w′∈W. (The Tits cone, its interior, and the negative-root set of a functional (1)-(2)).

[F2]

The dual action is (w⋅f)(v)=f(ρ(w)−1v), and it is a left action: id⋅f=f and w1⋅(w2⋅f)=(w1w2)⋅f; 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), The dual action, the faces, and the rank-two chamber tiling (1)).

[F3]

Every root has a sign: Φ=Φ+⊔Φ−, every root lies in V+∖{0} or in −V+∖{0} and not in both, and every f∈C∘ satisfies f(α)>0 for α∈Φ+ and f(α)<0 for α∈Φ−. (Root sign coherence and the action of simple reflections on positive roots (2)).

[F4]

Root-length criterion: for all w∈W and s∈S, ℓ(ws)>ℓ(w) if and only if ρ(w)es∈Φ+, and ℓ(ws)<ℓ(w) if and only if ρ(w)es∈Φ−. (The root-length criterion and faithfulness of the canonical reflection representation (1)).

[F5]

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

[F6]

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

[F7]

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

[F8]

Every w∈W has a reduced expression w=s1⋯sk with k=ℓ(w); reversing a reduced word for w gives a word of the same length for w−1, so ℓ(w−1)≤ℓ(w), and applying the same argument to w−1 gives ℓ(w−1)=ℓ(w). (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F9]

Parity and exchange: ℓ(sw)=ℓ(w)±1 for all w and s; and if ℓ(sw)=ℓ(w)−1 then w has a reduced expression beginning with s, so w=sw′ with ℓ(w′)=ℓ(w)−1. (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action (1)-(2)).

[F10]

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

[F11]

Two linear functionals agreeing on the basis (es)s∈S of V are equal, and (es) is a basis. (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[F12]

The dual space carries pointwise addition and scalar multiplication, and its elements are linear. (Linear functionals and the algebraic dual V∗=L(V,F)).

Proof

technique · direct, by the side rule and induction on word length
1.1F1F2F7algebra

Walls are root hyperplanes. For w∈W, s∈S and f∈V∗ one has f∈wHes if and only if (w−1⋅f)(es)=0, and by the dual action this is f(ρ(w)es)=0, that is f∈Hρ(w)es; hence wHes=Hρ(w)es. As Φ={ρ(w)es:w∈W, s∈S}, the walls wHes of the chambers are exactly the root hyperplanes Hα with α∈Φ. This is (1).

1.2F2F3F4F8F9algebra

The side rule. Let w∈W, s∈S, x∈C∘ and put β:=ρ(w)−1es, so that (w⋅x)(es)=x(β). By the signed root system, either β∈Φ+ and then x(β)>0, or β∈Φ− and then x(β)<0, so the sign of (w⋅x)(es) is the same for every x∈C∘. By the root-length criterion applied to w−1, β=ρ(w−1)es∈Φ+ if and only if ℓ(w−1s)>ℓ(w−1), and ℓ(w−1s)=ℓ(sw), ℓ(w−1)=ℓ(w) because lengths are inversion-invariant; hence wC∘⊆{f:f(es)>0} if and only if ℓ(sw)>ℓ(w), and wC∘⊆{f:f(es)<0} if and only if ℓ(sw)<ℓ(w). Parity ℓ(sw)=ℓ(w)±1 makes the two alternatives exclusive and exhaustive. If ℓ(sw)<ℓ(w) and x∈C, then β∈Φ−, so β=−b with b∈Φ+∖{0} and (w⋅x)(es)=x(−b)=−x(b)≤0 because x≥0 on V+ and Φ+⊆V+∖{0}; thus wC⊆{f:f(es)≤0}, while C⊆{f:f(es)≥0} by definition. This is (2).

1.3F1F10algebra

Collision, claim and base case. Claim: if f,g∈C, w∈W and w⋅f=g, then f=g and w∈WS(f). Proceed by induction on k:=ℓ(w). For k=0 one has w=1, so f=g and 1∈WS(f).

2.1F2F5F6F7F10F11F12step 1.2step 1.3algebra

Collision, induction step. Let k≥1 and suppose the claim known for all elements of length k−1. A reduced expression of w begins with some s∈S and has length k, so w=sw′ with ℓ(w′)=k−1 and ℓ(sw)=k−1<ℓ(w). By step 1.2 the chambers C and wC lie on opposite sides of the wall Hes: C⊆{f:f(es)≥0} and wC⊆{f:f(es)≤0}. Since g=w⋅f lies in both, g(es)=0. Then s⋅g=g: for t≠s the reflection formula gives rset=et−2B(et,es)es, so (s⋅g)(et)=g(rset)=g(et)−2B(et,es)g(es)=g(et) using g(es)=0; and (s⋅g)(es)=g(rses)=g(−es)=0=g(es). Two linear functionals agreeing on the basis (es)s∈S are equal, so s⋅g=g and hence g=s⋅g=s⋅(w⋅f)=(sw)⋅f=w′⋅f. The induction hypothesis applied to w′ and the pair (f,g) gives f=g and w′∈WS(f). Since g(es)=0 and f=g, also s∈S(f); therefore w=sw′∈WS(f) because WS(f) is the subgroup generated by S(f). This completes (3).

3.1F1F10step 2.1algebra

Point stabilizers. Let f∈C. If s∈S(f), the computation of step 2.1 with g=f gives s⋅f=f, so every element of the subgroup WS(f) generated by these s fixes f; hence WS(f)⊆Stab⁡W(f). Conversely, if w⋅f=f with f∈C, then (3) applied to the pair (f,f) gives w∈WS(f); hence Stab⁡W(f)=WS(f). For the second formula, Stab⁡W(w⋅g)=wStab⁡W(g)w−1 holds in any group action: an element x fixes g if and only if wxw−1 fixes w⋅g. Given f∈U and w with w−1⋅f∈C, applying the first formula to g:=w−1⋅f gives Stab⁡W(f)=w WS(w−1⋅f) w−1. This is (4).

4.1step 2.1step 3.1F10algebra

The intersection rule. Let f∈C and w∈W. If f∈wC∩C, then w−1⋅f∈C and (3) applied to the element w−1 and the pair (f, w−1⋅f) gives f=w−1⋅f and w−1∈WS(f), that is w∈WS(f); conversely, if f∈C and w∈WS(f), then w⋅f=f by step 3.1, so f∈wC∩C. This proves wC∩C={f∈C:w∈WS(f)}. For the second description, note that f∈C‾T means f∈C and f(es)=0 for all s∈T, so T⊆S(f); hence if f∈C‾T and w∈WT then w∈WS(f), and conversely for f∈C with w∈WS(f) one has f∈C‾S(f) with w∈WS(f). Therefore wC∩C={f∈C:w∈WS(f)}=⋃T⊆S, w∈WTC‾T. This is (5).

5.1F1F10step 2.1step 4.1algebra∎

The strict fundamental domain. Every f∈U lies in some chamber wC, so w−1⋅f∈C: every W-orbit contained in U meets C. If x,y∈C lie in one orbit, say y=w⋅x, then (3) gives x=y. For the disjointness of open chambers, if z∈wC∘∩vC∘ put f:=w−1⋅z and g:=v−1⋅z, so that f,g∈C∘ and g=(v−1w)⋅f; (3) applied to the element v−1w gives f=g and v−1w∈WS(f)=W∅={1}, so v−1w=1 and w=v. The chambers meeting in a face are described by step 4.1. This is (6).

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

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

5 · Examples, counterexamples and false statements

None yet.

Sources