Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-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.

Chamber open sets used for the topological equivalence

PDF p. 25: Lemma 6.6, proof: definitions of XC and XC,Cprime

Definition

Let (W,S) be a Coxeter system with finite W, and let J⊆S. Use the finite-dimensional relative space E=ΘJ, its finite set HJ of distinct linear hyperplanes, and the relative complexified complement XJC from Relative complexified hyperplane complement. Thus XJC consists of x+iy with x,y∈E and no H∈HJ containing both x and y. The arrangement has ambient domain E; its chambers are the connected components of E∖⋃H∈HJH, and adjacent chambers are distinct chambers sharing a wall, as in Chambers, walls and adjacency.

For H∈HJ and a chamber C, let DH(C) be the open half-space bounded by H that contains C: if a:E→R is a nonzero linear functional with kernel H, it is either {v:a(v)>0} or {v:a(v)<0}, according to which contains C. Define

XC={x+iy∈XJC: for every H∈HJ, x∈H⇒y∈DH(C)}.

Let C,C′ be adjacent, and let H0 be their unique separating hyperplane. Define

XC,C′={x+iy∈XJC:x∈DH0(C), and for every H∈HJ, x∈H⇒y∈DH(C)∩DH(C′)}.

Define XC′,C by interchanging C and C′ in this formula. These are subsets of XJC with its subspace topology.

Facts & Assumptions

[F1]

In the geometric representation, the simple roots form a basis and Φ={wαi:w∈W, i∈Γ0}; S={si:i∈Γ0} indexes the simple generators. The dual space is Θ=Hom⁡R(V,R), as in Coxeter-system, roots, length and weak-order conventions.

[F2]

The relative space is E=ΘJ, and every H∈HJ has the form H=Hα∩E for a root α with E⊈Hα, where Hα={f∈Θ:f(α)=0}, by Tits cone intersections, relative roots and arrangements.

[F3]

In spherical type the relative complement is (E×E)∖⋃H∈HJ(H×H), with the product subspace topology and the notation (x,y)↔x+iy, by Relative complexified hyperplane complement.

[F4]

The space E has its finite-dimensional coordinate Euclidean topology, a linear hyperplane has codimension one, and a finite arrangement is locally finite: every neighbourhood meets at most its finitely many members. Chambers, walls, adjacency and galleries have the meanings in Locally finite arrangements and relative face terminology and Chambers, walls and adjacency.

[F5]

In an open convex domain with a locally finite arrangement and chosen nonzero defining functionals, every chamber is a strict sign cell, by Sign cells and local finite-arrangement reductions.

[F6]

A shortest gallery crosses each separating hyperplane exactly once and no other hyperplane; each adjacency has a unique defining hyperplane, by Finite galleries and separating hyperplanes.

Justification

Given: A finite Coxeter group W, its simple generators S, a subset J⊆S, and the relative arrangement and complement in the Definition.

Goal: Justify the finiteness, defining half-spaces, adjacent-chamber convention and openness used by the Definition.

1.1 Since the simple generators form a subset S⊆W and W is finite, S and its index set Γ0 are finite. By [F1], Φ is the image of the finite set W×Γ0 under (w,i)↦wαi, so Φ is finite. By [F2], HJ is an image of a subset of Φ, with coincident hyperplanes counted once, and is therefore finite. The simple-root space, its dual and the subspace E are finite-dimensional. With ambient domain T=E, which is open and convex in itself, this is a locally finite arrangement by [F4]; every member meets E at zero. If E has dimension zero there are no proper hyperplanes, so the arrangement is empty and these conclusions remain valid. [F1, F2, F4, given]

2.1 Fix H∈HJ. By [F2], choose a root α with H=Hα∩E and E⊈Hα. Define aH:E→R by aH(f)=f(α). Evaluation is linear by [F1], its kernel is exactly H, and the noncontainment supplies f∈E with aH(f)≠0, so it is nonzero. The choices can be made for all H by finite choice, since step 1.1 gives a finite family. For any linear functional a on E, in the coordinates c:E→Rn of [F4] there are coefficients bi with a(c−1(z))=∑i=1nbizi. Thus ∣a(u)−a(v)∣≤(∑i∣bi∣)∥c(u)−c(v)∥2, which proves continuity directly: for a desired positive tolerance η use coordinate distance less than η/(1+∑i∣bi∣). Hence H is closed and the two strict half-spaces are open in E. [F1, F2, F4, step 1.1, construct]

3.1 The hypotheses of [F5] now hold by steps 1.1 and 2.1. Therefore every chamber lies entirely in exactly one of the two strict half-spaces for each H. To check independence of the defining functional, let a,b be nonzero linear functionals with the same kernel H, and choose e∈E with a(e)=1. For any v∈E, v−a(v)e∈H, so b(v)=a(v)b(e). Here b(e)≠0, since otherwise b would vanish identically. Thus replacing a by b either preserves or exchanges its two strict half-spaces; the one containing C is unchanged. This proves that DH(C) is well-defined. The complement and complex notation are those of [F3]. [F3, F5, step 1.1, step 2.1, algebra]

4.1 For adjacent distinct chambers C,C′, their one-edge gallery is shortest, since a gallery of length zero has equal endpoints. By [F6] it crosses exactly their separating hyperplanes, so there is exactly one, denoted H0. For H≠H0 the chambers have the same strict sign, hence DH(C)=DH(C′) by step 3.1. In the formula for XC,C′, the requirement x∈DH0(C) implies x∉H0. Thus whenever its implication has true antecedent x∈H, the two half-spaces in that implication agree. Interchanging C,C′ gives the reverse ordered set. [F6, step 1.1, step 2.1, step 3.1]

5.1 For a fixed H, failure of the implication defining XC is the condition (x,y)∈H×(E∖DH(C)). Both factors are closed by steps 2.1 and 3.1. Their product is closed in E×E: its complement is the union of the open sets (E∖H)×E and E×DH(C). A finite union of these failure sets is closed, so by [F3] and step 1.1 its complement in XJC is open. This is precisely XC. For XC,C′, replace DH(C) in this argument by the open intersection DH(C)∩DH(C′), and additionally intersect with the open product DH0(C)×E. The same reasoning proves openness of XC,C′ and, with the chambers interchanged, of XC′,C. If the arrangement is empty, XC=XJC=E×E, and there are no adjacent distinct chambers, so the same conclusions cover this case. [F3, step 1.1, step 2.1, step 3.1, step 4.1] ∎

The article reference attributes the chamber-set formulas only. The root-orbit formula and restricted root evaluations are supplied by the existing mathematical definitions [F1] and [F2]; the finiteness, existence and independence of the defining functionals, and openness are proved locally above. No claim or proof from the article is used to establish its own prerequisite.

Source notes

The article reference attributes the chamber-set formulas only. The root-orbit formula and restricted root evaluations are supplied by the existing mathematical definitions [F1] and [F2]; the finiteness, existence and independence of the defining functionals, and openness are proved locally above. No claim or proof from the article is used to establish its own prerequisite.

Depends on

Used by · 4

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources