Summed area table: Difference between revisions
en>Dicklyon m Reverted 1 edit by 112.79.41.10 (talk) identified as vandalism to last revision by Dicklyon. (TW) |
en>Monkbot |
||
Line 1: | Line 1: | ||
:''For the dimension of the Cartan subgroup, see [[Rank of a Lie group]]'' | |||
In the [[Mathematics|mathematical]] subject of [[group theory]], the '''rank of a group''' ''G'', denoted rank(''G''), can refer to the smallest [[cardinality]] of a [[Generating set of a group|generating]] set for ''G'', that is | |||
:<math> \operatorname{rank}(G)=\min\{ |X|: X\subseteq G, \langle X\rangle =G\}.</math> | |||
If ''G'' is a [[finitely generated group]], then the rank of ''G'' is a nonnegative integer. The notion of rank of a group is a group-theoretic analog of the notion of [[dimension of a vector space]]. Indeed, for [[p-group|''p''-groups]], the rank of the group ''P'' is the dimension of the vector space ''P''/Φ(''P''), where Φ(''P'') is the [[Frattini subgroup]]. | |||
The rank of a group is also often defined in such a way as to ensure subgroups have rank less than or equal to the whole group, which is automatically the case for dimensions of vector spaces, but not for groups such as [[affine group]]s. To distinguish these different definitions, one sometimes calls this rank the '''subgroup rank'''. Explicitly, the subgroup rank of a group ''G'' is the maximum of the ranks of its subgroups: | |||
:<math> \operatorname{sr}(G)=\max_{H \leq G} \min\{ |X|: X \subseteq H, \langle X \rangle = H \}.</math> | |||
Sometimes the subgroup rank is restricted to abelian subgroups. | |||
==Known facts and examples== | |||
*For a nontrivial group ''G'', we have rank(''G'')=1 if and only if ''G'' is a [[cyclic group]]. | |||
*For a [[free abelian group]] <math>\mathbb Z^n</math> we have <math> {\rm rank}(\mathbb Z^n)=n.</math> | |||
*If ''X'' is a set and ''G'' = ''F''(''X'') is the [[free group]] with free basis ''X'' then rank(''G'') = |''X''|. | |||
*If a group ''H'' is a [[group homomorphism|homomorphic image]] (or a [[quotient group]]) of a group ''G'' then rank(''H'') ≤ rank(''G''). | |||
*If ''G'' is a finite non-abelian [[simple group]] (e.g. ''G = A<sub>n</sub>'', the [[alternating group]], for ''n'' > 4) then rank(''G'') = 2. This fact is a consequence of the [[Classification of finite simple groups]]. | |||
*If ''G'' is a finitely generated group and Φ(''G'') ≤ ''G'' is the [[Frattini subgroup]] of ''G'' (which is always normal in ''G'' so that the quotient group ''G''/Φ(''G'') is defined) then rank(''G'') = rank(''G''/Φ(''G'')).<ref name="Robinson">D. J. S. Robinson. ''A course in the theory of groups'', 2nd edn, Graduate Texts in Mathematics 80 (Springer-Verlag, 1996). ISBN 0-387-94461-3</ref> | |||
*If ''G'' is the [[fundamental group]] of a closed (that is [[compact space|compact]] and without boundary) connected [[3-manifold]] ''M'' then rank(''G'')≤''g''(''M''), where ''g''(''M'') is the [[Heegaard genus]] of ''M''.<ref>Friedhelm Waldhausen. ''Some problems on 3-manifolds.'' Algebraic and geometric topology (Proc. Sympos. Pure Math., Stanford Univ., Stanford, Calif., 1976), Part 2, pp. 313–322, Proc. Sympos. Pure Math., XXXII, Amer. Math. Soc., Providence, R.I., 1978; ISBN 0-8218-1433-8</ref> | |||
*If ''H'',''K'' ≤ ''F''(''X'') are [[finitely generated group|finitely generated]] subgroups of a [[free group]] ''F''(''X'') such that the intersection <math>L=H\cap K</math> is nontrivial, then ''L'' is finitely generated and | |||
:rank(''L'') − 1 ≤ 2(rank(''K'') − 1)(rank(''H'') − 1). | |||
:This result is due to [[Hanna Neumann]].<ref>Hanna Neumann. ''On the intersection of finitely generated free groups.'' | |||
[[Publicationes Mathematicae Debrecen]], vol. 4 (1956), 186–189.</ref><ref>Hanna Neumann. ''On the intersection of finitely generated free groups. Addendum.'' | |||
Publicationes Mathematicae Debrecen, vol. 5 (1957), p. 128</ref> The [[Hanna Neumann conjecture]] states that in fact one always has rank(''L'') − 1 ≤ (rank(''K'') − 1)(rank(''H'') − 1). The [[Hanna Neumann conjecture]] has recently been solved by Igor Mineyev<ref name="proof">Igor Minevev, | |||
[http://annals.math.princeton.edu/2012/175-1/p11/ "Submultiplicativity and the Hanna Neumann Conjecture."] Ann. of Math., 175 (2012), no. 1, 393-414.</ref> and announced independently by Joel Friedman.<ref name="JF">{{cite web|url=http://www.math.ubc.ca/~jf/pubs/web_stuff/mehanna.html |title=Sheaves on Graphs and a Proof of the Hanna Neumann Conjecture |publisher=Math.ubc.ca |date= |accessdate=2012-06-12}}</ref> | |||
*According to the classic [[Grushko theorem]], rank behaves additively with respect to taking [[free product]]s, that is, for any groups ''A'' and ''B'' we have | |||
:rank(''A''<math>\ast</math>''B'') = rank(''A'') + rank(''B''). | |||
*If <math>G=\langle x_1,\dots, x_n| r=1\rangle</math> is a [[one-relator group]] such that ''r'' is not a [[primitive element]] in the free group ''F''(''x''<sub>1</sub>,..., ''x''<sub>''n''</sub>), that is, ''r'' does not belong to a free basis of ''F''(''x''<sub>1</sub>,..., ''x''<sub>''n''</sub>), then rank(''G'') = ''n''.<ref>[[Wilhelm Magnus]], ''Uber freie Faktorgruppen und freie Untergruppen Gegebener Gruppen'', Monatshefte für Mathematik, vol. 47(1939), pp. 307–313. </ref><ref>[[Roger Lyndon|Roger C. Lyndon]] and Paul E. Schupp. Combinatorial Group Theory. Springer-Verlag, New York, 2001. "Classics in Mathematics" series, reprint of the 1977 edition. ISBN 978-3-540-41158-1; Proposition 5.11, p. 107</ref> | |||
==The rank problem== | |||
There is an algorithmic problem studied in [[group theory]], known as the '''rank problem'''. The problem asks, for a particular class of [[finitely presented group]]s if there exists an algorithm that, given a finite presentation of a group from the class, computes the rank of that group. The rank problem is one of the harder algorithmic problems studied in group theory and relatively little is known about it. Known results include: | |||
*The rank problem is algorithmically undecidable for the class of all [[finitely presented group]]s. Indeed, by a classical result of Adian-Rabin, there is no algorithm to decide if a finitely presented group is trivial, so even the question of whether rank(''G'')=0 is undecidable for finitely presented groups.<ref>W. W. Boone. | |||
''Decision problems about algebraic and logical systems as a whole and recursively enumerable degrees of unsolvability.'' 1968 Contributions to Math. Logic (Colloquium, Hannover, 1966) pp. 13 33 North-Holland, Amsterdam </ref><ref>Charles F. Miller, III. ''Decision problems for groups — survey and reflections.'' Algorithms and classification in combinatorial group theory (Berkeley, CA, 1989), pp. 1–59, Math. Sci. Res. Inst. Publ., 23, Springer, New York, 1992; ISBN 0-387-97685-X</ref> | |||
*The rank problem is decidable for finite groups and for finitely generated [[abelian group]]s. | |||
*The rank problem is decidable for finitely generated [[nilpotent group]]s. The reason is that for such a group ''G'', the [[Frattini subgroup]] of ''G'' contains the [[commutator subgroup]] of ''G'' and hence the rank of ''G'' is equal to the rank of the [[abelianization]] of ''G''. <ref>John Lennox, and Derek J. S. Robinson. ''The theory of infinite soluble groups.'' Oxford Mathematical Monographs. The Clarendon Press, [[Oxford University Press]], Oxford, 2004. ISBN 0-19-850728-3 </ref> | |||
*The rank problem is undecidable for [[word hyperbolic group]]s.<ref>G. Baumslag, C. F. Miller and H. Short. ''Unsolvable problems about small cancellation and word hyperbolic groups.'' Bulletin of the London Mathematical Society, vol. 26 (1994), pp. 97–101 </ref> | |||
*The rank problem is decidable for torsion-free [[Kleinian group]]s.<ref> Ilya Kapovich, and Richard Weidmann. [http://msp.warwick.ac.uk/gt/2005/09/p012.xhtml ''Kleinian groups and the rank problem'']. [[Geometry & Topology|Geometry and Topology]], vol. 9 (2005), pp. 375–402 </ref> | |||
*The rank problem is open for finitely generated virtually abelian groups (that is containing an abelian subgroup of finite [[index of a subgroup|index]]), for virtually free groups, and for [[3-manifold]] groups. | |||
==Generalizations and related notions== | |||
The rank of a [[finitely generated group]] ''G'' can be equivalently defined as the smallest cardinality of a set ''X'' such that there exists an onto [[group homomorphism|homomorphism]] ''F''(''X'') → ''G'', where ''F''(''X'') is the [[free group]] with free basis ''X''. There is a dual notion of '''co-rank''' of a [[finitely generated group]] ''G'' defined as the ''largest'' [[cardinality]] of ''X'' such that there exists an onto [[group homomorphism|homomorphism]] ''G'' → ''F''(''X''). Unlike rank, co-rank is always algorithmically computable for [[finitely presented group]]s,<ref>John R. Stallings. | |||
''Problems about free quotients of groups.'' Geometric group theory (Columbus, OH, 1992), pp. 165–182, Ohio State Univ. Math. Res. Inst. Publ., 3, de Gruyter, Berlin, 1995. ISBN 3-11-014743-2</ref> using the algorithm of Makanin and [[Alexander Razborov|Razborov]] for solving systems of equations in free groups.<ref>A. A. Razborov. | |||
''Systems of equations in a free group.'' (in Russian) Izvestia Akademii Nauk SSSR, Seriya Matematischeskaya, vol. 48 (1984), no. 4, pp. 779–832. </ref><ref>G. S.Makanin | |||
''Equations in a free group.'' (Russian), Izvestia Akademii Nauk SSSR, Seriya Matematischeskaya, vol. 46 (1982), no. 6, pp. 1199–1273 </ref> | |||
The notion of co-rank is related to the notion of a ''cut number'' for [[3-manifolds]].<ref>Shelly L. Harvey. [http://www.msp.warwick.ac.uk/gt/2002/06/p015.xhtml ''On the cut number of a 3-manifold.''] [[Geometry & Topology]], vol. 6 (2002), pp. 409–424 </ref> | |||
If ''p'' is a [[prime number]], then the ''p''-'''rank''' of ''G'' is the largest rank of an [[elementary abelian group|elementary abelian]] ''p''-subgroup.<ref>{{Citation|last=Aschbacher|first=M.|title=Finite Group Theory|publisher=Cambridge University Press|year=2002|isbn=978-0-521-78675-1|page=5}}</ref> The '''sectional''' ''p''-'''rank''' is the largest rank of an elementary abelian ''p''-section (quotient of a subgroup). | |||
==Notes== | |||
{{reflist}} | |||
==See also== | |||
*[[Rank of an abelian group]] | |||
*[[Prüfer rank]] | |||
*[[Grushko theorem]] | |||
*[[Free group]] | |||
*[[Nielsen equivalence]] | |||
[[Category:Group theory]] |
Revision as of 14:23, 30 January 2014
- For the dimension of the Cartan subgroup, see Rank of a Lie group
In the mathematical subject of group theory, the rank of a group G, denoted rank(G), can refer to the smallest cardinality of a generating set for G, that is
If G is a finitely generated group, then the rank of G is a nonnegative integer. The notion of rank of a group is a group-theoretic analog of the notion of dimension of a vector space. Indeed, for p-groups, the rank of the group P is the dimension of the vector space P/Φ(P), where Φ(P) is the Frattini subgroup.
The rank of a group is also often defined in such a way as to ensure subgroups have rank less than or equal to the whole group, which is automatically the case for dimensions of vector spaces, but not for groups such as affine groups. To distinguish these different definitions, one sometimes calls this rank the subgroup rank. Explicitly, the subgroup rank of a group G is the maximum of the ranks of its subgroups:
Sometimes the subgroup rank is restricted to abelian subgroups.
Known facts and examples
- For a nontrivial group G, we have rank(G)=1 if and only if G is a cyclic group.
- For a free abelian group we have
- If X is a set and G = F(X) is the free group with free basis X then rank(G) = |X|.
- If a group H is a homomorphic image (or a quotient group) of a group G then rank(H) ≤ rank(G).
- If G is a finite non-abelian simple group (e.g. G = An, the alternating group, for n > 4) then rank(G) = 2. This fact is a consequence of the Classification of finite simple groups.
- If G is a finitely generated group and Φ(G) ≤ G is the Frattini subgroup of G (which is always normal in G so that the quotient group G/Φ(G) is defined) then rank(G) = rank(G/Φ(G)).[1]
- If G is the fundamental group of a closed (that is compact and without boundary) connected 3-manifold M then rank(G)≤g(M), where g(M) is the Heegaard genus of M.[2]
- If H,K ≤ F(X) are finitely generated subgroups of a free group F(X) such that the intersection is nontrivial, then L is finitely generated and
- rank(L) − 1 ≤ 2(rank(K) − 1)(rank(H) − 1).
- This result is due to Hanna Neumann.[3][4] The Hanna Neumann conjecture states that in fact one always has rank(L) − 1 ≤ (rank(K) − 1)(rank(H) − 1). The Hanna Neumann conjecture has recently been solved by Igor Mineyev[5] and announced independently by Joel Friedman.[6]
- According to the classic Grushko theorem, rank behaves additively with respect to taking free products, that is, for any groups A and B we have
- If is a one-relator group such that r is not a primitive element in the free group F(x1,..., xn), that is, r does not belong to a free basis of F(x1,..., xn), then rank(G) = n.[7][8]
The rank problem
There is an algorithmic problem studied in group theory, known as the rank problem. The problem asks, for a particular class of finitely presented groups if there exists an algorithm that, given a finite presentation of a group from the class, computes the rank of that group. The rank problem is one of the harder algorithmic problems studied in group theory and relatively little is known about it. Known results include:
- The rank problem is algorithmically undecidable for the class of all finitely presented groups. Indeed, by a classical result of Adian-Rabin, there is no algorithm to decide if a finitely presented group is trivial, so even the question of whether rank(G)=0 is undecidable for finitely presented groups.[9][10]
- The rank problem is decidable for finite groups and for finitely generated abelian groups.
- The rank problem is decidable for finitely generated nilpotent groups. The reason is that for such a group G, the Frattini subgroup of G contains the commutator subgroup of G and hence the rank of G is equal to the rank of the abelianization of G. [11]
- The rank problem is undecidable for word hyperbolic groups.[12]
- The rank problem is decidable for torsion-free Kleinian groups.[13]
- The rank problem is open for finitely generated virtually abelian groups (that is containing an abelian subgroup of finite index), for virtually free groups, and for 3-manifold groups.
The rank of a finitely generated group G can be equivalently defined as the smallest cardinality of a set X such that there exists an onto homomorphism F(X) → G, where F(X) is the free group with free basis X. There is a dual notion of co-rank of a finitely generated group G defined as the largest cardinality of X such that there exists an onto homomorphism G → F(X). Unlike rank, co-rank is always algorithmically computable for finitely presented groups,[14] using the algorithm of Makanin and Razborov for solving systems of equations in free groups.[15][16] The notion of co-rank is related to the notion of a cut number for 3-manifolds.[17]
If p is a prime number, then the p-rank of G is the largest rank of an elementary abelian p-subgroup.[18] The sectional p-rank is the largest rank of an elementary abelian p-section (quotient of a subgroup).
Notes
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.
See also
- ↑ D. J. S. Robinson. A course in the theory of groups, 2nd edn, Graduate Texts in Mathematics 80 (Springer-Verlag, 1996). ISBN 0-387-94461-3
- ↑ Friedhelm Waldhausen. Some problems on 3-manifolds. Algebraic and geometric topology (Proc. Sympos. Pure Math., Stanford Univ., Stanford, Calif., 1976), Part 2, pp. 313–322, Proc. Sympos. Pure Math., XXXII, Amer. Math. Soc., Providence, R.I., 1978; ISBN 0-8218-1433-8
- ↑ Hanna Neumann. On the intersection of finitely generated free groups. Publicationes Mathematicae Debrecen, vol. 4 (1956), 186–189.
- ↑ Hanna Neumann. On the intersection of finitely generated free groups. Addendum. Publicationes Mathematicae Debrecen, vol. 5 (1957), p. 128
- ↑ Igor Minevev, "Submultiplicativity and the Hanna Neumann Conjecture." Ann. of Math., 175 (2012), no. 1, 393-414.
- ↑ Template:Cite web
- ↑ Wilhelm Magnus, Uber freie Faktorgruppen und freie Untergruppen Gegebener Gruppen, Monatshefte für Mathematik, vol. 47(1939), pp. 307–313.
- ↑ Roger C. Lyndon and Paul E. Schupp. Combinatorial Group Theory. Springer-Verlag, New York, 2001. "Classics in Mathematics" series, reprint of the 1977 edition. ISBN 978-3-540-41158-1; Proposition 5.11, p. 107
- ↑ W. W. Boone. Decision problems about algebraic and logical systems as a whole and recursively enumerable degrees of unsolvability. 1968 Contributions to Math. Logic (Colloquium, Hannover, 1966) pp. 13 33 North-Holland, Amsterdam
- ↑ Charles F. Miller, III. Decision problems for groups — survey and reflections. Algorithms and classification in combinatorial group theory (Berkeley, CA, 1989), pp. 1–59, Math. Sci. Res. Inst. Publ., 23, Springer, New York, 1992; ISBN 0-387-97685-X
- ↑ John Lennox, and Derek J. S. Robinson. The theory of infinite soluble groups. Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, Oxford, 2004. ISBN 0-19-850728-3
- ↑ G. Baumslag, C. F. Miller and H. Short. Unsolvable problems about small cancellation and word hyperbolic groups. Bulletin of the London Mathematical Society, vol. 26 (1994), pp. 97–101
- ↑ Ilya Kapovich, and Richard Weidmann. Kleinian groups and the rank problem. Geometry and Topology, vol. 9 (2005), pp. 375–402
- ↑ John R. Stallings. Problems about free quotients of groups. Geometric group theory (Columbus, OH, 1992), pp. 165–182, Ohio State Univ. Math. Res. Inst. Publ., 3, de Gruyter, Berlin, 1995. ISBN 3-11-014743-2
- ↑ A. A. Razborov. Systems of equations in a free group. (in Russian) Izvestia Akademii Nauk SSSR, Seriya Matematischeskaya, vol. 48 (1984), no. 4, pp. 779–832.
- ↑ G. S.Makanin Equations in a free group. (Russian), Izvestia Akademii Nauk SSSR, Seriya Matematischeskaya, vol. 46 (1982), no. 6, pp. 1199–1273
- ↑ Shelly L. Harvey. On the cut number of a 3-manifold. Geometry & Topology, vol. 6 (2002), pp. 409–424
- ↑ Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.
Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.
In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.
Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region
Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.
15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.
To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010