Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Symmetry group
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
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!
==Symmetry groups in general== {{see also|Automorphism|Automorphism group}} In wider contexts, a '''symmetry group''' may be any kind of '''transformation group''', or [[automorphism]] group. Each type of [[mathematical structure]] has [[Bijection|invertible mappings]] which preserve the structure. Conversely, specifying the symmetry group can define the structure, or at least clarify the meaning of geometric congruence or invariance; this is one way of looking at the [[Erlangen programme]]. For example, objects in a hyperbolic [[non-Euclidean geometry]] have [[Fuchsian group|Fuchsian symmetry groups]], which are the discrete subgroups of the isometry group of the hyperbolic plane, preserving hyperbolic rather than Euclidean distance. (Some are depicted in drawings of [[M. C. Escher|Escher]].) Similarly, automorphism groups of [[finite geometry|finite geometries]] preserve families of point-sets (discrete subspaces) rather than Euclidean subspaces, distances, or inner products. Just as for Euclidean figures, objects in any geometric space have symmetry groups which are subgroups of the symmetries of the ambient space. Another example of a symmetry group is that of a [[Graph (discrete mathematics)|combinatorial graph]]: a graph symmetry is a permutation of the vertices which takes edges to edges. Any [[Presentation of a group|finitely presented group]] is the symmetry group of its [[Cayley graph]]; the [[free group]] is the symmetry group of an infinite [[Tree (graph theory)|tree graph]].
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Symmetry group
(section)
Add topic