Alphabeta Math
LemmaStatement: AI-generatedProof: 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.

The hyperplanes are in bijection with Coxeter reflections

Statement

Let W≤GL(E) be an essential finite real reflection group and (W,S) the chamber-wall Coxeter system of Chamber walls of an essential finite reflection group give full Coxeter rank. Put T={wsw−1:w∈W, s∈S}. Then T is exactly the set of linear reflections in W, and t↦Fix⁡(t) bijects T with A(W). In particular ∣A(W)∣=∣T∣.

Facts & Assumptions

[F1]

W acts transitively on chambers, and S consists precisely of the reflections in the walls of a fixed chamber (Chamber walls of an essential finite reflection group give full Coxeter rank).

[F2]

Distinct orthogonal reflections have distinct hyperplanes, and conjugation by w takes the fixed hyperplane of r to wFix⁡(r) (Invariant metric, product arrangements and essentiality and the fixed-space equation).

[F3]

No finite family of proper linear subspaces covers a finite-dimensional vector space over an infinite field (A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces).

[F4]

A function is injective when equal outputs force equal inputs, surjective when every target has a preimage, and bijective when both conditions hold (Injection, surjection, bijection).

[F5]

If A is finite and f:A→B is a bijection, then B is finite and ∣B∣=∣A∣ (The cardinality | A| of a finite set, Definition, consequence (c)).

[F6]

A Coxeter system (W,S) is given by a generating set S and the presentation W=⟨S∣s2=1, (st)m(s,t)=1 for s≠t, m(s,t)<∞⟩, where m is symmetric, m(s,s)=1 and m(s,t)∈{2,3,…}∪{∞} for s≠t (Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order).

[F7]

Use the Euclidean topology, convexity, connected-component chambers, closure, affine hull and affine dimension of Locally finite arrangements and relative face terminology. The wall-hyperplane convention is that of [F1].

[F8]

Every real linear map L:Rm→Rk has a constant K0≥0 such that ∥Lh∥2≤K0∥h∥2 for every h. Every Euclidean linear map has a unique matrix and satisfies ‖Lh‖₂≤ K‖h‖₂ for some K≥0

[F10]

Connectedness excludes a partition into two disjoint nonempty relatively open subsets. The connected component of a point is the largest connected subset containing that point. Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets Connected components, quasicomponents, and totally disconnected spaces

Proof

Given: The arrangement and uniqueness of orthogonal reflections of Invariant metric, product arrangements and essentiality and the chamber action of Chamber walls of an essential finite reflection group give full Coxeter rank. Goal: Identify all reflecting hyperplanes with the abstract Coxeter reflections T.

Proof technique: direct.

1.1givenF1F2F3F7choosealgebra

Each conjugate wsw−1 is an involution with fixed hyperplane wFix⁡(s), hence is a reflection. Conversely, let r∈W be a reflection with hyperplane H. The family {H∩K:K∈A(W), K≠H} is finite because W is finite. Each member is a proper subspace of H, since distinct hyperplanes have equal dimension and cannot contain one another. Apply [F3] in the finite-dimensional real vector space H to choose x∈H outside every other arrangement hyperplane. The existence of the hyperplane H implies n:=dim⁡E≥1.

2.1F7F8step 1.1chooseconstructalgebra

Use the coordinate isomorphism c:E→Rn and metric of [F7]. For each of the finitely many K∈A(W) choose uK∉K. Codimension one gives a unique decomposition z=k+tuK with k∈K; define βK(z)=t. This is a nonzero real linear functional with kernel K. Applying [F8] to βK∘c−1 gives a constant CK>0 such that ∣βK(z)−βK(z0)∣≤CKdE(z,z0). Thus at a point where βK is nonzero, a ball of radius ∣βK(z)∣/(2CK) preserves its strict sign. The positive and negative sign sets are open, so K and each closed sign half-space are closed. The same inequality, with radius ε/CK, proves continuity of βK. Only finitely many choices were made.

3.1F7F9F10step 1.1step 2.1choosealgebra

A convex subset Z⊆E has convex image c(Z), connected in the Euclidean topology by [F9], since n≥1. The coordinate metric in [F7] transports relative open sets in both directions; a separation of Z would therefore give a separation of c(Z), contrary to [F10]. Thus convex subsets of E are connected, and its metric balls are convex by [F9]. Choose ρ>0 smaller than every ∣βK(x)∣/(2CK) for K≠H, taking ρ=1 if that family is empty. The ball B=BE(x,ρ) then misses every K≠H by step 2.1. Its two strict βH half-balls are nonempty: x±tuH lie in them for sufficiently small t>0. Each half-ball is convex, hence connected. Fix one, B+, and y∈B+. The component D of the arrangement complement containing y contains B+ by [F10]. For z∈B∩H and 0<t≤1, the point (1−t)z+ty belongs to B+ by convexity and the strict sign of βH(y); its distance to z is tdE(y,z). Hence every neighbourhood of z meets B+, giving B∩H⊆D‾.

4.1step 2.1step 3.1F7F10algebra

Orient each βK from step 2.1 by a sign to obtain αK(y)>0. Its sign is positive throughout D: otherwise the two relatively open strict sign sets would separate D, since D misses K, contradicting [F10]. Thus D⊆P:={z∈E:αK(z)>0 for every K∈A(W)}. Conversely, P is convex, hence connected by step 3.1, lies in the arrangement complement and contains y. The component property in [F10] gives P⊆D, so D=P. It is open as a finite intersection of strict sign sets. Put Q={z∈E:αK(z)≥0 for every K∈A(W)}. The closed sign half-spaces from step 2.1 show that Q is closed and contains D‾. For z∈Q and 0<t≤1, every αK((1−t)z+ty) is positive, so (1−t)z+ty∈D. Its distance to z is tdE(y,z), proving z∈D‾. Therefore D‾=Q, a closed convex cone, full-dimensional because it contains the nonempty open set D.

5.1step 3.1step 4.1F1F7algebra

Put F=Q∩H. A face of a convex set Q means a convex subset F such that, whenever u,v∈Q, 0<t<1 and (1−t)u+tv∈F, both u and v belong to F. Here F is convex, and αH≥0 on Q. If (1−t)u+tv∈F, then 0=(1−t)αH(u)+tαH(v) forces both nonnegative terms to vanish; hence u,v∈H and therefore u,v∈F. This proves that F is a face. Moreover, F⊆H and step 3.1 gives B∩H⊆F. This relative open ball has affine hull H (its point differences span H), so dim⁡aff⁡(F)=dim⁡H=dim⁡E−1. Thus F is a codimension-one face of the full-dimensional D‾, and H is a wall hyperplane in the convention of [F1].

6.1step 5.1F1F2F4F5F7F8algebra∎

Choose w with D=wC by [F1]. Applying [F8] in coordinates to w and w−1 makes both continuous. Thus w−1D‾=C‾. Invertible linear maps preserve convex combinations and affine dimension, so the face in step 5.1 pulls back to a codimension-one face of C‾. Hence w−1H is a wall hyperplane of C, and its reflection is some s∈S. By uniqueness in [F2], r=wsw−1. This proves equality of the two reflection sets. Surjectivity onto A(W) holds by its definition and injectivity by [F2], so this map is a bijection by [F4]. Since T⊆W is finite, [F5] gives ∣A(W)∣=∣T∣.

Depends on

Used by · 1

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.