Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Coxeter group
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Abstraction of reflection groups== {{Further|Reflection group}} Coxeter groups are an abstraction of reflection groups. Coxeter groups are ''abstract'' groups, in the sense of being given via a presentation. On the other hand, reflection groups are ''concrete'', in the sense that each of its elements is the composite of finitely many geometric reflections about linear hyperplanes in some euclidean space. Technically, a reflection group is a subgroup of a [[linear group]] (or various generalizations) generated by orthogonal matrices of determinant -1. Each generator of a Coxeter group has order 2, which abstracts the geometric fact that performing a reflection twice is the identity. Each relation of the form <math>(r_ir_j)^k</math>, corresponding to the geometric fact that, given two [[hyperplane]]s meeting at an angle of <math>\pi/k</math>, the composite of the two reflections about these hyperplanes is a rotation by <math>2\pi/k</math>, which has order ''k''. In this way, every reflection group may be presented as a Coxeter group.<ref name="Coxeter1934"/> The converse is partially true: every finite Coxeter group admits a faithful [[linear representation|representation]] as a finite reflection group of some Euclidean space.<ref name="Coxeter1935"/> However, not every infinite Coxeter group admits a representation as a reflection group. Finite Coxeter groups have been classified.<ref name="Coxeter1935"/>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)