Alphabeta Math
PropositionStatement: Literature-sourcedProof: 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.

Local finiteness of the interior relative arrangement

PDF p. 2: Proposition 3.6; PDF p. 9: Proposition 3.6

Statement

Let Γ0 be finite, W its Coxeter group, J⊆Γ0, and use the relative space E=ΘJ, Tits cone intersection T=Cone(J), and set of distinct relative hyperplanes HJ from Tits cone intersections, relative roots and arrangements. The interior T∘ is taken in E. Every u∈T∘ has an open ball in T meeting only finitely many hyperplanes of HJ. In particular (T∘,HJ) is locally finite, with the hyperplane set restricted to the members meeting T∘.

Facts & Assumptions

[F1]

For every u∈T∘, Finite pair separation yields a finite relative ball supplies r>0 such that the relative Euclidean ball BE(u,r) is contained in T and meets only finitely many distinct members of HJ.

[F2]

The full Tits cone is convex by clause (4) of The finite-negativity criterion, the reduction step, and convexity of the Tits cone. The relative cone is its intersection with the linear subspace E, and T∘ is its interior in the relative Euclidean topology (Tits cone intersections, relative roots and arrangements).

[F3]

An arrangement is locally finite when each point of its underlying set has an open neighbourhood meeting only finitely many of its distinct hyperplanes. Restriction to a convex subset retains precisely the hyperplanes meeting that subset (Linear hyperplane arrangements and local finiteness).

Proof

Given: The finite-rank Coxeter system, subset J, relative space, cone intersection and relative hyperplanes in the Statement.

Goal: Prove the finite-ball assertion and local finiteness of the restricted interior arrangement.

Proof technique: direct.

1.1givenF1

Let u∈T∘. By [F1], there is r>0 such that BE(u,r)⊆T and this ball meets only finitely many members of HJ. Since it is open in E and contained in T, it is an open ball in the subspace T. This proves the first assertion.

1.2F2algebra

The intersection of the convex full Tits cone with the linear subspace E is convex, so T is convex. If x,y∈T∘, choose positive radii a,b with BE(x,a),BE(y,b)⊆T. For 0<t<1, every vector of norm less than (1−t)a+tb can be written as (1−t)h+tk with ∥h∥<a and ∥k∥<b, by taking h=k to be that vector divided by (1−t)a+tb and multiplied by the respective radius. Convexity therefore gives a ball about (1−t)x+ty contained in T; the endpoints are already interior. Thus T∘ is convex.

2.1F3step 1.1step 1.2∎

For each u∈T∘, the ball in step 1.1 is open in E and contained in T, hence is contained in T∘. It is consequently an open neighbourhood of u in T∘ and meets only finitely many hyperplanes in the restricted set {H∈HJ:H∩T∘≠∅}. By [F3], the restricted arrangement is locally finite.

Source notes

The article is cited for attribution of the retained proposition. The finite-ball lemma proves the needed relative statement using finite separation of Tits-cone points; this proof does not use the proposition itself or assume local finiteness of the relative arrangement.

Depends on

Used by · 6

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