Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Point group  





2 Discrete symmetry groups  



2.1  Translational symmetry  





2.2  Non-discrete symmetry groups  







3 1D-symmetry of a function vs. 2D-symmetry of its graph  





4 Group action  





5 Orbits and stabilizers  





6 See also  














One-dimensional symmetry group







Add links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 

(Redirected from Symmetry groups in one dimension)

Aone-dimensional symmetry group is a mathematical group that describes symmetries in one dimension (1D).

A pattern in 1D can be represented as a function f(x) for, say, the color at position x.

The only nontrivial point group in 1D is a simple reflection. It can be represented by the simplest Coxeter group, A1, [ ], or Coxeter-Dynkin diagram .

Affine symmetry groups represent translation. Isometries which leave the function unchanged are translations x + a with a such that f(x + a) = f(x) and reflections ax with a such that f(ax) = f(x). The reflections can be represented by the affine Coxeter group [∞], or Coxeter-Dynkin diagram representing two reflections, and the translational symmetry as [∞]+, or Coxeter-Dynkin diagram as the composite of two reflections.

Point group[edit]

For a pattern without translational symmetry there are the following possibilities (1D point groups):

Group Coxeter Description
C1 [ ]+ Identity, Trivial groupZ1
D1 [ ] Reflection. Abstract groupsZ2 or Dih1.

Discrete symmetry groups[edit]

These affine symmetries can be considered limiting cases of the 2D dihedral and cyclic groups:

Group Coxeter Description
C [∞]+ Cyclic: ∞-fold rotations become translations. Abstract group Z, the infinite cyclic group.
D [∞] Dihedral: ∞-fold reflections. Abstract group Dih, the infinite dihedral group.

Translational symmetry[edit]

Consider all patterns in 1D which have translational symmetry, i.e., functions f(x) such that for some a > 0, f(x + a) = f(x) for all x. For these patterns, the values of a for which this property holds form a group.

We first consider patterns for which the group is discrete, i.e., for which the positive values in the group have a minimum. By rescaling we make this minimum value 1.

Such patterns fall in two categories, the two 1D space groupsorline groups.

In the simpler case the only isometries of R which map the pattern to itself are translations; this applies, e.g., for the pattern

− −−−  − −−−  − −−−  − −−−

Each isometry can be characterized by an integer, namely plus or minus the translation distance. Therefore the symmetry groupisZ.

In the other case, among the isometries of R which map the pattern to itself there are also reflections; this applies, e.g., for the pattern

− −−− −  − −−− −  − −−− −

We choose the origin for x at one of the points of reflection. Now all reflections which map the pattern to itself are of the form ax where the constant "a" is an integer (the increments of a are 1 again, because we can combine a reflection and a translation to get another reflection, and we can combine two reflections to get a translation). Therefore all isometries can be characterized by an integer and a code, say 0 or 1, for translation or reflection.

Thus:

The latter is a reflection with respect to the point a/2 (an integer or an integer plus 1/2).

Group operations (function composition, the one on the right first) are, for integers a and b:

E.g., in the third case: translation by an amount b changes x into x + b, reflection with respect to 0 gives−xb, and a translation a gives abx.

This group is called the generalized dihedral groupofZ, Dih(Z), and also D. It is a semidirect productofZ and C2. It has a normal subgroupofindex 2 isomorphic to Z: the translations. Also it contains an element f of order 2 such that, for all ninZ,  n f = f n −1: the reflection with respect to the reference point, (0,1).

The two groups are called lattice groups. The latticeisZ. As translation cell we can take the interval 0 ≤ x < 1. In the first case the fundamental domain can be taken the same; topologically it is a circle (1-torus); in the second case we can take 0 ≤ x ≤ 0.5.

The actual discrete symmetry group of a translationally symmetric pattern can be:

The set of translationally symmetric patterns can thus be classified by actual symmetry group, while actual symmetry groups, in turn, can be classified as type 1 or type 2.

These space group types are the symmetry groups “up to conjugacy with respect to affine transformations”: the affine transformation changes the translation distance to the standard one (above: 1), and the position of one of the points of reflections, if applicable, to the origin. Thus the actual symmetry group contains elements of the form gag−1= b, which is a conjugate of a.

Non-discrete symmetry groups[edit]

For a homogeneous “pattern” the symmetry group contains all translations, and reflection in all points. The symmetry group is isomorphic to Dih(R).

There are also less trivial patterns/functions with translational symmetry for arbitrarily small translations, e.g. the group of translations by rational distances. Even apart from scaling and shifting, there are infinitely many cases, e.g. by considering rational numbers of which the denominators are powers of a given prime number.

The translations form a group of isometries. However, there is no pattern with this group as symmetry group.

1D-symmetry of a function vs. 2D-symmetry of its graph[edit]

Symmetries of a function (in the sense of this article) imply corresponding symmetries of its graph. However, 2-fold rotational symmetry of the graph does not imply any symmetry (in the sense of this article) of the function: function values (in a pattern representing colors, grey shades, etc.) are nominal data, i.e. grey is not between black and white, the three colors are simply all different.

Even with nominal colors there can be a special kind of symmetry, as in:

−−−−−−− -- − −−−   − −  −

(reflection gives the negative image). This is also not included in the classification.

Group action[edit]

Group actions of the symmetry group that can be considered in this connection are:

This section illustrates group action concepts for these cases.

The action of GonX is called

Orbits and stabilizers[edit]

Consider a group G acting on a set X. The orbit of a point xinX is the set of elements of X to which x can be moved by the elements of G. The orbit of x is denoted by Gx:

Case that the group action is on R:

Case that the group action is on patterns:

The set of all orbits of X under the action of G is written as X/G.

IfY is a subsetofX, we write GY for the set {g · y : y Y and g G}. We call the subset Y invariant under GifGY = Y (which is equivalent to GYY). In that case, G also operates on Y. The subset Y is called fixed under Gifg · y = yfor all ginG and all yinY. In the example of the orbit {−8,−6,2,4,12,14,22,24,..}, {−9,−8,−6,−5,1,2,4,5,11,12,14,15,21,22,24,25,..} is invariant under G, but not fixed.

For every xinX, we define the stabilizer subgroupofx (also called the isotropy grouporlittle group) as the set of all elements in G that fix x:

Ifx is a reflection point, its stabilizer is the group of order two containing the identity and the reflection inx. In other cases the stabilizer is the trivial group.

For a fixed xinX, consider the map from GtoX given by . The image of this map is the orbit of x and the coimage is the set of all left cosetsofGx. The standard quotient theorem of set theory then gives a natural bijection between and . Specifically, the bijection is given by . This result is known as the orbit-stabilizer theorem. If, in the example, we take , the orbit is {−7,3,13,23,..}, and the two groups are isomorphic with Z.

If two elements and belong to the same orbit, then their stabilizer subgroups, and , are isomorphic. More precisely: if , then . In the example this applies e.g. for 3 and 23, both reflection points. Reflection about 23 corresponds to a translation of −20, reflection about 3, and translation of 20.

See also[edit]


Retrieved from "https://en.wikipedia.org/w/index.php?title=One-dimensional_symmetry_group&oldid=1071177935"

Categories: 
Euclidean geometry
Group theory
Symmetry
1 (number)
Hidden categories: 
Articles with short description
Short description matches Wikidata
Articles lacking sources from December 2009
All articles lacking sources
 



This page was last edited on 11 February 2022, at 07:39 (UTC).

Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



Privacy policy

About Wikipedia

Disclaimers

Contact Wikipedia

Code of Conduct

Developers

Statistics

Cookie statement

Mobile view



Wikimedia Foundation
Powered by MediaWiki