|
|
| Line 1: |
Line 1: |
| {{hatnote|"Relator" redirects here. For other uses, see [[Relator (disambiguation)]]}}
| | Trees may very outside the buildings, public areas and recreational areas, and are thought quite unsafe for people due towards the height and width, have to be maintained to get afflicted with balanced decoration. To achieve this, overall size from the tree is reduced. It not only gives it a balanced shape in addition helps it to rejuvenate without die-back.<br><br>As while using the adding with the door, don't hesitate to also check local codes concerning adding decks. Some local council requires certain criteria become met before being allowed in order to keep. Will your patio or deck restrict any sewage or water main service pipe? The actual all very important things to take into consideration.<br><br>Fleece baby blankets answer all the requirements as stipulated above. Offer the proper amount of warmth and coziness to the infant and are soft to touch. Fleece is very light which explains available available for everyone colors. The babies remain comfortable the actual planet fleece for quite a while of available free time. These blankets are relatively inexpensive as a result are ideal for being given as gifts for newborn toddlers. You can also add diverse gesture getting the babies name customized or the particular date of birth embroidered on the blanket.<br><br><br><br>Dead head roses- June is crucial flowering time for flowers. Old fashion varieties will only bloom once but modern ones should on all summer and you can help them put their energies into more flowers instead of producing hips by removing faded wedding flowers. Traditional advice was to lower your expenses the whole flower head and stem to just above a leaf joint, however a new study shows that new flowers will appear more quickly if you just snap heli-copter flight head.<br><br>Use a row of hedges to help dampen loud noises. If reside on a busy street or near an interstate, talked about how much how annoying the constant sound of traffic can be. Use landscaping to help alleviate this irritant. Plant some bushes between the house and the offending way to help mute the sounds of the passing vehicle.<br><br>Your lawn can be utilized care of once full week with a landscaper. A person are hire these types of do many different different designs in your front front yard. Cross mowing, checkering, lines or conceivably plain mowing the lawn are various designs that you could pick producing your grass look in top pattern. A landscaper will rake all the chopped grass for you so your roots don't die.<br><br>A proper inspection from the trees will be and your own decision to fell a tree is taken. Every person preferred to retain the tree recommended .. In congested areas, it has to be done very carefully to avoid any harm to the buildings, structures or anything the actual reason situated around. It is done by felling the tree in sections, using ropes, pulleys and winches.<br><br>Nudism has impacted daily life in lots of ways and all of which are positive. I hope that beeing the years go by, increasingly more more people will try of which! And if you ever are in florida and needs to go to the nude beach then obviously you should visit Haulover.<br><br>If you have any questions about where by and how to use [http://www.hopesgrovenurseries.co.uk/ hedging plants], you can call us at our own website. |
| In [[mathematics]], one method of defining a [[group (mathematics)|group]] is by a '''presentation'''. One specifies a set ''S'' of '''[[generating set of a group|generators]]''' so that every element of the group can be written as a product of powers of some of these generators, and a set ''R'' of '''relations''' among those generators. We then say ''G'' has presentation
| |
| | |
| :<math>\langle S \mid R\rangle.\,\!</math>
| |
| | |
| Informally, ''G'' has the above presentation if it is the "freest group" generated by ''S'' subject only to the relations ''R''. Formally, the group ''G'' is said to have the above presentation if it is [[group isomorphism|isomorphic]] to the [[quotient group|quotient]] of a [[free group]] on ''S'' by the [[Conjugate closure|normal subgroup generated by]] the relations ''R''.
| |
| | |
| As a simple example, the [[cyclic group]] of order ''n'' has the presentation
| |
| | |
| :<math>\langle a \mid a^n = 1\rangle.\,\!</math>
| |
| | |
| where 1 is the group identity. This may be written equivalently as
| |
| | |
| :<math>\langle a \mid a^n\rangle,\,\!</math>
| |
| | |
| since terms that don't include an equals sign are taken to be equal to the group identity. Such terms are called '''relators''', distinguishing them from the relations that include an equals sign.
| |
| | |
| Every group has a presentation, and in fact many different presentations; a presentation is often the most compact way of describing the structure of the group.
| |
| | |
| A closely related but different concept is that of an [[absolute presentation of a group|absolute presentation]] of a group.
| |
| | |
| == Background ==
| |
| A [[free group]] on a set ''S'' is a group where each element can be ''uniquely'' described as a finite length product of the form:
| |
| | |
| :<math>s_1^{a_1} s_2^{a_2} \ldots s_n^{a_n}</math>
| |
| | |
| where the ''s<sub>i</sub>'' are elements of S, adjacent ''s<sub>i</sub>'' are distinct, and ''a<sub>i</sub>'' are non-zero integers (but ''n'' may be zero). In less formal terms, the group consists of words in the generators ''and their inverses'', subject only to canceling a generator with its inverse.
| |
| | |
| If ''G'' is any group, and ''S'' is a generating subset of ''G'', then every element of ''G'' is also of the above form; but in general, these products will not uniquely describe an element of ''G''.
| |
| | |
| For example, the [[dihedral group]] ''D'' of order sixteen can be generated by a rotation, ''r'', of order 8; and a flip, ''f'', of order 2; and certainly any element of ''D'' is a product of ''r'' 's and ''f'' 's.
| |
| | |
| However, we have, for example, ''r f r'' = ''f'', ''r''<sup> 7</sup> = ''r''<sup>−1</sup>, etc.; so such products are not unique in ''D''. Each such product equivalence can be expressed as an equality to the identity; such as
| |
| | |
| :''r f r f'' = 1
| |
| :''r''<sup> 8</sup> = 1
| |
| :''f''<sup> 2</sup> = 1.
| |
| | |
| Informally, we can consider these products on the left hand side as being elements of the free group ''F'' = <''r'', ''f''>, and can consider the subgroup ''R'' of ''F'' which is generated by these strings; each of which would also be equivalent to 1 when considered as products in ''D''.
| |
| | |
| If we then let ''N'' be the subgroup of ''F'' generated by all conjugates ''x''<sup>−1</sup>''Rx'' of ''R'', then it is straightforward to show that every element of ''N'' is a finite product ''x''<sub>1</sub><sup>−1</sup>''r''<sub>1</sub>''x''<sub>1</sub> ... ''x<sub>m</sub>''<sup>−1</sup>''r<sub>m</sub>'' ''x<sub>m</sub>'' of members of such conjugates. It follows that
| |
| ''N'' is a normal subgroup of ''F''; and that each element of ''N'', when considered as a product in ''D'', will also evaluate to 1. Thus ''D'' is isomorphic to the [[quotient group]] ''F'' /''N''. We then say that ''D'' has presentation
| |
| | |
| :<math>\langle r, f \mid r^8 = f^2 = (rf)^2 = 1\rangle.\,\!</math>
| |
| | |
| == Definition ==
| |
| Let ''S'' be a set and let ''F<sub>S</sub>'' be the [[free group]] on ''S''. Let ''R'' be a set of [[Word (group theory)|words]] on ''S'', so ''R'' naturally gives a subset of ''F<sub>S</sub>''. To form a group with presentation <''S''|''R''>, the idea is to take ''F<sub>S</sub>'' quotient by the smallest normal subgroup such that each element of ''R'' gets identified with the identity. Note that ''R'' might not be a [[subgroup]], let alone a [[normal subgroup]] of ''F<sub>S</sub>'', so we cannot take a quotient by ''R''. The solution is to take the [[Normal closure (group theory)|normal closure]] ''N'' of ''R'' in ''F<sub>S</sub>''. The group <''S''|''R''> is then defined as the [[quotient group]]
| |
| :<math>\langle S \mid R \rangle = F_S / N.</math>
| |
| The elements of ''S'' are called the '''generators''' of <''S''|''R''> and the elements of ''R'' are called the '''relators'''. A group ''G'' is said to have the presentation <''S''|''R''> if ''G'' is isomorphic to <''S''|''R''>.
| |
| | |
| It is a common practice to write relators in the form ''x'' = ''y'' where ''x'' and ''y'' are words on ''S''. What this means is that ''y''<sup>−1</sup>''x'' ∈ ''R''. This has the intuitive meaning that the images of ''x'' and ''y'' are supposed to be equal in the quotient group. Thus e.g. ''r<sup>n</sup>'' in the list of relators is equivalent with ''r<sup>n</sup>'' = 1. Another common shorthand is to write [''x'', ''y''] for a [[commutator]] ''xyx''<sup>−1</sup>''y''<sup>−1</sup>.
| |
| | |
| A presentation is said to be '''finitely generated''' if ''S'' is finite and '''finitely related''' if ''R'' is finite. If both are finite it is said to be a '''finite presentation'''. A group is '''finitely generated''' (respectively '''finitely related''', '''finitely presented''') if it has a presentation that is finitely generated (respectively finitely related, a finite presentation). | |
| | |
| If ''S'' is indexed by a set ''I'' consisting of all the natural numbers '''N''' or a finite subset of them, then it is easy to set up a simple one to one coding (or [[Gödel numbering]]) ''f'' : ''F<sub>S</sub>'' → '''N''' from the free group on ''S'' to the natural numbers, such that we can find algorithms that, given ''f''(''w''), calculate ''w'', and vice versa. We can then call a subset ''U'' of ''F<sub>S</sub>'' [[recursive set|recursive]] (respectively [[recursively enumerable]]) if ''f''(''U'') is recursive (respectively recursively enumerable). If ''S'' is indexed as above and ''R'' recursively enumerable, then the presentation is a '''recursive presentation''' and the corresponding group is '''recursively presented'''. This usage may seem odd, but it is possible to prove that if a group has a presentation with ''R'' recursively enumerable then it has another one with ''R'' recursive.
| |
| | |
| For a finite group ''G'', the multiplication table provides a presentation. We take ''S'' to be the elements ''g<sub>i</sub>'' of ''G'' and ''R'' to be all words of the form <math>g_ig_jg_k^{-1}</math>, where <math>g_ig_j=g_k\ </math> is an entry in the multiplication table. A presentation can then be thought of as a generalization of a multiplication table.
| |
| | |
| Every finitely presented group is recursively presented, but there are recursively presented groups that cannot be finitely presented. However a theorem of [[Graham Higman]] states that a finitely generated group has a recursive presentation if and only if it can be embedded in a finitely presented group. From this we can deduce that there are (up to isomorphism) only [[countably]] many finitely generated recursively presented groups. [[Bernhard Neumann]] has shown that there are [[uncountably]] many non-isomorphic two generator groups. Therefore there are finitely generated groups that cannot be recursively presented.
| |
| | |
| == Examples ==
| |
| === History ===
| |
| One of the earliest presentations of a group by generators and relations was given by the Irish mathematician [[William Rowan Hamilton]] in 1856, in his [[icosian calculus]] – a presentation of the [[icosahedral group]].<ref>{{Cite journal |title=Memorandum respecting a new System of Roots of Unity |author=Sir William Rowan Hamilton |author-link=William Rowan Hamilton |url=http://www.maths.tcd.ie/pub/HistMath/People/Hamilton/Icosian/NewSys.pdf |journal=[[Philosophical Magazine]] |volume=12 |year=1856 |pages=446 }}</ref>
| |
| | |
| The first systematic study was given by [[Walther von Dyck]], student of [[Felix Klein]], in the early 1880s, laying the foundations for [[combinatorial group theory]].<ref name="stillwell374">{{Cite document | publisher = Springer | isbn = 978-0-387-95336-6 | last = Stillwell | first = John | title = Mathematics and its history | date = 2002 | page = [http://books.google.com/books?id=WNjRrqTm62QC&pg=PA374 374] | postscript = <!--None--> }}</ref>
| |
| | |
| === Common examples ===
| |
| The following table lists some examples of presentations for commonly studied groups. Note that in each case there are many other presentations that are possible. The presentation listed is not necessarily the most efficient one possible.
| |
| {| border=1 class="wikitable"
| |
| !Group || Presentation || Comments
| |
| |-
| |
| | the [[free group]] on ''S'' || <math>\langle S \mid \varnothing \rangle\,\!</math>
| |
| | A free group is "free" in the sense that it is subject to no relations.
| |
| |-
| |
| | ''C''<sub>''n''</sub>, the [[cyclic group]] of order ''n''
| |
| | <math>\langle a \mid a^n \rangle\,\!</math>
| |
| |
| |
| |-
| |
| | ''D''<sub>2''n''</sub>, the [[dihedral group]] of order 2''n''
| |
| | <math>\langle r,f \mid r^n , f^2 , (rf)^2 \rangle\,\!</math>
| |
| | Here ''r'' represents a rotation and ''f'' a reflection
| |
| |-
| |
| | ''D''<sub>∞</sub>, the [[infinite dihedral group]]
| |
| | <math>\langle r,f \mid f^2, (rf)^2 \rangle\,\!</math>
| |
| |
| |
| |-
| |
| | Dic<sub>''n''</sub>, the [[dicyclic group]]
| |
| | <math>\langle r,f \mid r^{2n}, r^n=f^2, frf^{-1}=r^{-1} \rangle\,\!</math>
| |
| | The [[quaternion group]] is a special case when ''n'' = 2
| |
| |-
| |
| | '''Z''' × '''Z'''
| |
| | <math>\langle x,y \mid xy = yx \rangle\,\!</math>
| |
| |
| |
| |-
| |
| | '''Z'''/''m'''''Z''' × '''Z'''/''n'''''Z'''
| |
| | <math>\langle x,y \mid x^m, y^n, xy=yx \rangle\,\!</math>
| |
| |
| |
| |-
| |
| | the [[free abelian group]] on ''S''
| |
| | <math>\langle S \mid R \rangle\,\!</math> where ''R'' is the set of all [[commutator]]s of elements of ''S''
| |
| |
| |
| |-
| |
| | the [[symmetric group]], ''S''<sub>''n''</sub>
| |
| | generators: <math>\sigma_1, \ldots, \sigma_{n-1}</math><br>relations:
| |
| *<math>\sigma_i^2 = 1</math>,
| |
| *<math>\sigma_i\sigma_j = \sigma_j\sigma_i \mbox{ if } j \neq i\pm 1</math>,
| |
| *<math>\sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i\sigma_{i+1}\ </math>
| |
| | |
| The last set of relations can be transformed into
| |
| *<math>{(\sigma_i\sigma_{i+1}})^3=1\ </math>
| |
| using <math>\sigma_i^2=1 </math>.
| |
| | Here σ<sub>''i''</sub> is the permutation that swaps the ''i''th element with the ''i''+1 one. The product σ<sub>''i''</sub>σ<sub>''i''+1</sub> is a 3-cycle on the set {''i'', ''i''+1, ''i''+2}.
| |
| |-
| |
| | the [[braid group]], ''B''<sub>''n''</sub>
| |
| | generators: <math>\sigma_1, \ldots, \sigma_{n-1}</math><br>
| |
| relations:
| |
| *<math>\sigma_i\sigma_j = \sigma_j\sigma_i \mbox{ if } j \neq i\pm 1</math>,
| |
| *<math>\sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i\sigma_{i+1}\ </math>
| |
| | Note the similarity with the symmetric group; the only difference is the removal of the relation <math>\sigma_i^2 = 1</math>.
| |
| |-
| |
| | the [[tetrahedral group]], ''T'' ≅ ''A''<sub>4</sub>
| |
| | <math>\langle s,t \mid s^2, t^3, (st)^3 \rangle\,\!</math>
| |
| |
| |
| |-
| |
| | the [[octahedral group]], ''O'' ≅ ''S''<sub>4</sub>
| |
| | <math>\langle s,t \mid s^2, t^3, (st)^4 \rangle\,\!</math>
| |
| |
| |
| |-
| |
| | the [[Icosahedral symmetry|icosahedral group]], ''I'' ≅ ''A''<sub>5</sub>
| |
| | <math>\langle s,t \mid s^2, t^3, (st)^5 \rangle\,\!</math>
| |
| |
| |
| |-
| |
| | the [[quaternion group]], ''Q''<sub>8</sub>
| |
| | <math>\langle i,j \mid jij = i, iji = j \rangle\,</math>
| |
| | For an alternative presentation see Dic<sub>''n''</sub> above.
| |
| |-
| |
| |SL(2, '''Z''')
| |
| |<math>\langle a,b \mid aba=bab, (aba)^4 \rangle\,\!</math>
| |
| |topologically you can visualize ''a'' and ''b'' as [[Dehn twist]]s on the [[torus]]
| |
| |-
| |
| |GL(2, '''Z''')
| |
| |<math>\langle a,b,j \mid aba=bab, (aba)^4,j^2,(ja)^2,(jb)^2 \rangle\,\!</math>
| |
| |nontrivial '''Z'''/2'''Z''' – [[group extension]] of SL(2, '''Z''')
| |
| |-
| |
| | the [[modular group]] PSL(2, '''Z''')
| |
| |<math>\langle a,b \mid a^2, b^3 \rangle\,\!</math>
| |
| |PSL(2, '''Z''') is the [[free product]] of the cyclic groups '''Z'''/2'''Z''' and '''Z'''/3'''Z'''
| |
| |-
| |
| |[[Heisenberg group]]
| |
| |<math>\langle x,y,z \mid z=xyx^{-1}y^{-1}, xz=zx, yz=zy \rangle\,\!</math>
| |
| |
| |
| |-
| |
| |[[Baumslag–Solitar group]], ''B''(''m'', ''n'')
| |
| |<math>\langle a, b \mid a^n = b a^m b^{-1} \rangle\,\!</math>
| |
| |
| |
| |-
| |
| | [[Tits group]]
| |
| | <math>\langle a, b \mid a^2, b^3, (ab)^{13}, [a, b]^5, [a, bab]^4, (ababababab^{-1})^6 \rangle</math>
| |
| | [''a'', ''b''] is the [[commutator]]
| |
| |}
| |
| | |
| An example of a [[finitely generated group]] that is not finitely presented is the [[wreath product]] <math>\mathbf{Z} \wr \mathbf{Z}</math> of the group of [[integers]] with itself.
| |
| | |
| == Some theorems ==
| |
| <blockquote>'''Theorem.''' Every group has a presentation.</blockquote>
| |
| | |
| To see this, given a group ''G'', consider the free group ''F<sub>G</sub>'' on ''G''. By the [[universal property]] of free groups, there exists a unique [[group homomorphism]] φ : ''F<sub>G</sub>'' → ''G'' whose restriction to ''G'' is the identity map. Let ''K'' be the [[kernel (algebra)|kernel]] of this homomorphism. Then ''K'' is normal in ''F<sub>G</sub>'', therefore is equal to its normal closure, so <''G''|''K''> = ''F<sub>G</sub>''/''K''. Since the identity map is surjective, φ is also surjective, so by the [[Isomorphism theorems|First Isomorphism Theorem]], <''G''|''K''> ≅ im(φ) = ''G''. Note that this presentation may be highly inefficient if both ''G'' and ''K'' are much larger than necessary.
| |
| | |
| <blockquote>'''Corollary.''' Every finite group has a finite presentation.</blockquote>
| |
| | |
| One may take the elements of the group for generators and the [[Cayley table]] for relations.
| |
| | |
| ===Novikov–Boone theorem===
| |
| The negative solution to the [[word problem for groups]] states that there is a finite presentation <''S''|''R''> for which there is no algorithm which, given two words ''u'', ''v'', decides whether ''u'' and ''v'' describe the same element in the group. This was shown by [[Pyotr Novikov]] in 1955<ref>{{Citation|last=Novikov|first=P. S.|authorlink=Pyotr Novikov|year=1955|title=On the algorithmic unsolvability of the word problem in group theory|language=Russian| zbl=0068.01301 | journal=[[Proceedings of the Steklov Institute of Mathematics]]|volume=44|pages=1–143}}</ref> and a different proof was obtained by [[William Boone (mathematician)|William Boone]] in 1958.<ref>{{Citation|last=Boone|first=William W.| authorlink=William Boone (mathematician) | year=1958|title=The word problem|journal=Proceedings of the National Academy of Sciences|volume=44|issue=10|pages=1061–1065|url=http://www.pnas.org/cgi/reprint/44/10/1061.pdf|format=PDF|doi=10.1073/pnas.44.10.1061|zbl=0086.24701 }}</ref>
| |
| | |
| == Constructions ==
| |
| Suppose ''G'' has presentation <''S''|''R''> and ''H'' has presentation <''T''|''Q''> with ''S'' and ''T'' being disjoint. Then
| |
| * the '''[[free product]]''' ''G'' ∗ ''H'' has presentation <''S,T''|''R,Q''> and
| |
| * the '''[[direct product of groups|direct product]]''' ''G'' × ''H'' has presentation <''S,T''|''R,Q, [S,T]''>, where [''S,T''] means that every element from ''S'' commutes with every element from ''T'' (cf. [[commutator]]).
| |
| | |
| ==Deficiency==
| |
| The '''deficiency''' of a finite presentation <''S''|''R''> is just |''S''|−|''R''| and the ''deficiency'' of a finitely presented group ''G'', denoted def ''G'', is the maximum of the deficiency over all presentations of ''G''. The deficiency of a finite group is non-positive. The [[Schur multiplicator]] of a group ''G'' can be generated by −def ''G'' generators, and ''G'' is '''efficient''' if this number is required.<ref>{{cite book | first1=D.L. | last1=Johnson | first2=E.L. | last2=Robertson | chapter=Finite groups of deficiency zero | pages=275–289 | editor1-first=C.T.C. | editor1-last=Wall | editor-link=C. T. C. Wall | title=Homological Group Theory | series=London Mathematical Society Lecture Note Series | volume=36 | year=1979 | publisher=[[Cambridge University Press]] | isbn=0-521-22729-1 | zbl=0423.20029 }}</ref>
| |
| | |
| == Geometric group theory ==
| |
| {{main|Geometric group theory}}
| |
| {{see|Cayley graph}}
| |
| {{see|Word metric}}
| |
| | |
| A presentation of a group determines a geometry, in the sense of [[geometric group theory]]: one has the [[Cayley graph]], which has a [[Metric (mathematics)|metric]], called the [[word metric]]. These are also two resulting orders, the ''weak order'' and the ''[[Bruhat order]],'' and corresponding [[Hasse diagram]]s. An important example is in the [[Coxeter group]]s.
| |
| | |
| Further, some properties of this graph (the [[Coarse structure|coarse geometry]]) are intrinsic, meaning independent of choice of generators.
| |
| | |
| == See also ==
| |
| * [[Nielsen transformation]]
| |
| * [[Tietze transformation]]
| |
| | |
| == Notes ==
| |
| {{Reflist}}
| |
| | |
| == References ==
| |
| *{{cite book | author=Johnson, D. L. | title=Presentations of Groups | location=Cambridge | publisher=Cambridge University Press | year=1990 | isbn=0-521-37824-9}} Schreier's method, Nielsen's method, free presentations, subgroups and HNN extensions, [[Golod–Shafarevich theorem]], etc.
| |
| *{{cite book | author=Coxeter, H. S. M. and Moser, W. O. J. | title=Generators and Relations for Discrete Groups | location=New York | publisher=Springer-Verlag | year=1980 | isbn=0-387-09212-9}} This useful reference has tables of presentations of all small finite groups, the reflection groups, and so forth.
| |
| | |
| [[Category:Combinatorial group theory]]
| |
| [[Category:Combinatorics on words]]
| |