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 be an essential finite real reflection group and the chamber-wall Coxeter system of Chamber walls of an essential finite reflection group give full Coxeter rank. Put . Then is exactly the set of linear reflections in , and bijects with . In particular .
Facts & Assumptions
acts transitively on chambers, and consists precisely of the reflections in the walls of a fixed chamber (Chamber walls of an essential finite reflection group give full Coxeter rank).
Distinct orthogonal reflections have distinct hyperplanes, and conjugation by takes the fixed hyperplane of to (Invariant metric, product arrangements and essentiality and the fixed-space equation).
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).
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).
If is finite and is a bijection, then is finite and (The cardinality | A| of a finite set, Definition, consequence (c)).
A Coxeter system is given by a generating set and the presentation , where is symmetric, and for (Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order).
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].
Every real linear map has a constant such that for every . Every Euclidean linear map has a unique matrix and satisfies ‖Lh‖₂≤ K‖h‖₂ for some K≥0
For , every convex subset of with the product topology is connected, every Euclidean ball is convex, and the product topology equals the Euclidean topology. Every convex subset of ℝⁿ, in particular every ball and ℝⁿ itself, is path-connected and hence connected, claims 1–2; For n ≥ 1 the product topology on n copies of the usual topology of ℝ is the metric topology of d_∞ on ℝⁿ, and hence also of d₁ and d₂, so ℝⁿ as a product and ℝⁿ as a metric space are one space, claim 3.
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 .
Proof technique: direct.
Each conjugate is an involution with fixed hyperplane , hence is a reflection. Conversely, let be a reflection with hyperplane . The family is finite because is finite. Each member is a proper subspace of , since distinct hyperplanes have equal dimension and cannot contain one another. Apply [F3] in the finite-dimensional real vector space to choose outside every other arrangement hyperplane. The existence of the hyperplane implies .
Use the coordinate isomorphism and metric of [F7]. For each of the finitely many choose . Codimension one gives a unique decomposition with ; define . This is a nonzero real linear functional with kernel . Applying [F8] to gives a constant such that . Thus at a point where is nonzero, a ball of radius preserves its strict sign. The positive and negative sign sets are open, so and each closed sign half-space are closed. The same inequality, with radius , proves continuity of . Only finitely many choices were made.
A convex subset has convex image , connected in the Euclidean topology by [F9], since . The coordinate metric in [F7] transports relative open sets in both directions; a separation of would therefore give a separation of , contrary to [F10]. Thus convex subsets of are connected, and its metric balls are convex by [F9]. Choose smaller than every for , taking if that family is empty. The ball then misses every by step 2.1. Its two strict half-balls are nonempty: lie in them for sufficiently small . Each half-ball is convex, hence connected. Fix one, , and . The component of the arrangement complement containing contains by [F10]. For and , the point belongs to by convexity and the strict sign of ; its distance to is . Hence every neighbourhood of meets , giving .
Orient each from step 2.1 by a sign to obtain . Its sign is positive throughout : otherwise the two relatively open strict sign sets would separate , since misses , contradicting [F10]. Thus . Conversely, is convex, hence connected by step 3.1, lies in the arrangement complement and contains . The component property in [F10] gives , so . It is open as a finite intersection of strict sign sets. Put . The closed sign half-spaces from step 2.1 show that is closed and contains . For and , every is positive, so . Its distance to is , proving . Therefore , a closed convex cone, full-dimensional because it contains the nonempty open set .
Put . A face of a convex set means a convex subset such that, whenever , and , both and belong to . Here is convex, and on . If , then forces both nonnegative terms to vanish; hence and therefore . This proves that is a face. Moreover, and step 3.1 gives . This relative open ball has affine hull (its point differences span ), so . Thus is a codimension-one face of the full-dimensional , and is a wall hyperplane in the convention of [F1].
Choose with by [F1]. Applying [F8] in coordinates to and makes both continuous. Thus . Invertible linear maps preserve convex combinations and affine dimension, so the face in step 5.1 pulls back to a codimension-one face of . Hence is a wall hyperplane of , and its reflection is some . By uniqueness in [F2], . This proves equality of the two reflection sets. Surjectivity onto holds by its definition and injectivity by [F2], so this map is a bijection by [F4]. Since is finite, [F5] gives .
Depends on
- Invariant metric, product arrangements and essentiality
- Chamber walls of an essential finite reflection group give full Coxeter rank
- A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces
- Injection, surjection, bijection
- The cardinality | A| of a finite set
- Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order
- Locally finite arrangements and relative face terminology
- Every Euclidean linear map has a unique matrix and satisfies ‖Lh‖₂≤ K‖h‖₂ for some K≥0
- Every convex subset of ℝⁿ, in particular every ball and ℝⁿ itself, is path-connected and hence connected
- For n ≥ 1 the product topology on n copies of the usual topology of ℝ is the metric topology of d_∞ on ℝⁿ, and hence also of d₁ and d₂, so ℝⁿ as a product and ℝⁿ as a metric space are one space
- Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets
- Connected components, quasicomponents, and totally disconnected spaces
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.