Grushko's Theorem
   HOME
*





Grushko's Theorem
In the mathematical subject of group theory, the Grushko theorem or the Grushko–Neumann theorem is a theorem stating that the rank (that is, the smallest cardinality of a generating set) of a free product of two groups is equal to the sum of the ranks of the two free factors. The theorem was first obtained in a 1940 article of Grushko and then, independently, in a 1943 article of Neumann. Statement of the theorem Let ''A'' and ''B'' be finitely generated groups and let ''A''∗''B'' be the free product of ''A'' and ''B''. Then :rank(''A''∗''B'') = rank(''A'') + rank(''B''). It is obvious that rank(''A''∗''B'') ≤ rank(''A'') + rank(''B'') since if X is a finite generating set of ''A'' and ''Y'' is a finite generating set of ''B'' then ''X''∪''Y'' is a generating set for ''A''∗''B'' and that , ''X'' ∪ ''Y'', ≤ , ''X'', + , ''Y'', . The opposite inequality, rank(''A''∗''B'') ≥ rank(''A'') + rank(''B''), requires proof. Grushko, but not Neumann, proved a mor ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Bass–Serre Theory
Bass–Serre theory is a part of the Mathematics, mathematical subject of group theory that deals with analyzing the algebraic structure of Group (math), groups Group action (mathematics), acting by automorphisms on simplicial Tree (graph theory), trees. The theory relates group actions on trees with decomposing groups as iterated applications of the operations of free product with amalgamation and HNN extension, via the notion of the fundamental group of a graph of groups. Bass–Serre theory can be regarded as one-dimensional version of the orbifold, orbifold theory. History Bass–Serre theory was developed by Jean-Pierre Serre in the 1970s and formalized in ''Trees'', Serre's 1977 monograph (developed in collaboration with Hyman Bass) on the subject.J.-P. Serre''Trees''.(Translated from the French by John Stillwell). Springer-Verlag, 1980. Serre's original motivation was to understand the structure of certain algebraic groups whose Bruhat–Tits buildings are trees. However, the ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Prime Decomposition (3-manifold)
In mathematics, the prime decomposition theorem for 3-manifolds states that every compact, orientable 3-manifold is the connected sum of a unique (up to homeomorphism) finite collection of prime 3-manifolds. A manifold is ''prime'' if it cannot be presented as a connected sum of more than one manifold, none of which is the sphere of the same dimension. This condition is necessary since for any manifold M of dimension n it is true that M = M \# S^n. (where M \# S^n means the connected sum of M and S^n). If P is a prime 3-manifold then either it is S^2 \times S^1 or the non-orientable S^2 bundle over S^1, or it is irreducible, which means that any embedded 2-sphere bounds a ball. So the theorem can be restated to say that there is a unique connected sum decomposition into irreducible 3-manifolds and fiber bundles of S^2 over S^1. The prime decomposition holds also for non-orientable 3-manifolds, but the uniqueness statement must be modified slightly: every compact, non-orientable 3 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Geometry & Topology
''Geometry & Topology'' is a peer-refereed, international mathematics research journal devoted to geometry and topology, and their applications. It is currently based at the University of Warwick, United Kingdom, and published by Mathematical Sciences Publishers, a nonprofit academic publishing organisation. It was founded in 1997Allyn Jackson The slow revolution of the free electronic journal Notices of the American Mathematical Society, vol. 47 (2000), no. 9, pp. 1053-1059 by a group of topologists who were dissatisfied with recent substantial rises in subscription prices of journals published by major publishing corporations. The aim was to set up a high-quality journal, capable of competing with existing journals, but with substantially lower subscription fees. The journal was open-access for its first ten years of existence and was available free to individual users, although institutions were required to pay modest subscription fees for both online access and for printed ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Relatively Hyperbolic Group
In mathematics, the concept of a relatively hyperbolic group is an important generalization of the geometric group theory concept of a hyperbolic group. The motivating examples of relatively hyperbolic groups are the fundamental groups of complete noncompact hyperbolic manifolds of finite volume. Intuitive definition A group ''G'' is relatively hyperbolic with respect to a subgroup ''H'' if, after contracting the Cayley graph of ''G'' along ''H''-cosets, the resulting graph equipped with the usual graph metric becomes a δ-hyperbolic space and, moreover, it satisfies a technical condition which implies that quasi-geodesics with common endpoints travel through approximately the same collection of cosets and enter and exit these cosets in approximately the same place. Formal definition Given a finitely generated group ''G'' with Cayley graph ''Γ''(''G'') equipped with the path metric and a subgroup ''H'' of ''G'', one can construct the coned off Cayley graph \hat(G,H) a ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Word-hyperbolic Group
In group theory, more precisely in geometric group theory, a hyperbolic group, also known as a ''word hyperbolic group'' or ''Gromov hyperbolic group'', is a finitely generated group equipped with a word metric satisfying certain properties abstracted from classical hyperbolic geometry. The notion of a hyperbolic group was introduced and developed by . The inspiration came from various existing mathematical theories: hyperbolic geometry but also low-dimensional topology (in particular the results of Max Dehn concerning the fundamental group of a hyperbolic Riemann surface, and more complex phenomena in three-dimensional topology), and combinatorial group theory. In a very influential (over 1000 citations ) chapter from 1987, Gromov proposed a wide-ranging research program. Ideas and foundational material in the theory of hyperbolic groups also stem from the work of George Mostow, William Thurston, James W. Cannon, Eliyahu Rips, and many others. Definition Let G be a finitely g ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Permutation Group
In mathematics, a permutation group is a group ''G'' whose elements are permutations of a given set ''M'' and whose group operation is the composition of permutations in ''G'' (which are thought of as bijective functions from the set ''M'' to itself). The group of ''all'' permutations of a set ''M'' is the symmetric group of ''M'', often written as Sym(''M''). The term ''permutation group'' thus means a subgroup of the symmetric group. If then Sym(''M'') is usually denoted by S''n'', and may be called the ''symmetric group on n letters''. By Cayley's theorem, every group is isomorphic to some permutation group. The way in which the elements of a permutation group permute the elements of the set is called its group action. Group actions have applications in the study of symmetries, combinatorics and many other branches of mathematics, physics and chemistry. Basic properties and terminology Being a subgroup of a symmetric group, all that is necessary for a set of permutatio ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Group Isomorphism
In abstract algebra, a group isomorphism is a function between two groups that sets up a one-to-one correspondence between the elements of the groups in a way that respects the given group operations. If there exists an isomorphism between two groups, then the groups are called isomorphic. From the standpoint of group theory, isomorphic groups have the same properties and need not be distinguished. Definition and notation Given two groups (G, *) and (H, \odot), a ''group isomorphism'' from (G, *) to (H, \odot) is a bijective group homomorphism from G to H. Spelled out, this means that a group isomorphism is a bijective function f : G \to H such that for all u and v in G it holds that f(u * v) = f(u) \odot f(v). The two groups (G, *) and (H, \odot) are isomorphic if there exists an isomorphism from one to the other. This is written (G, *) \cong (H, \odot). Often shorter and simpler notations can be used. When the relevant group operations are understood, they are omitted and one ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Conjugacy Class
In mathematics, especially group theory, two elements a and b of a group are conjugate if there is an element g in the group such that b = gag^. This is an equivalence relation whose equivalence classes are called conjugacy classes. In other words, each conjugacy class is closed under b = gag^. for all elements g in the group. Members of the same conjugacy class cannot be distinguished by using only the group structure, and therefore share many properties. The study of conjugacy classes of non-abelian groups is fundamental for the study of their structure. For an abelian group, each conjugacy class is a set containing one element (singleton set). Functions that are constant for members of the same conjugacy class are called class functions. Definition Let G be a group. Two elements a, b \in G are conjugate if there exists an element g \in G such that gag^ = b, in which case b is called of a and a is called a conjugate of b. In the case of the general linear group \operatorna ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Free Group
In mathematics, the free group ''F''''S'' over a given set ''S'' consists of all words that can be built from members of ''S'', considering two words to be different unless their equality follows from the group axioms (e.g. ''st'' = ''suu''−1''t'', but ''s'' ≠ ''t''−1 for ''s'',''t'',''u'' ∈ ''S''). The members of ''S'' are called generators of ''F''''S'', and the number of generators is the rank of the free group. An arbitrary group ''G'' is called free if it is isomorphic to ''F''''S'' for some subset ''S'' of ''G'', that is, if there is a subset ''S'' of ''G'' such that every element of ''G'' can be written in exactly one way as a product of finitely many elements of ''S'' and their inverses (disregarding trivial variations such as ''st'' = ''suu''−1''t''). A related but different notion is a free abelian group; both notions are particular instances of a free object from universal algebra. As such, free groups are defined by their universal property. History Free ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Journal Of Algebra
''Journal of Algebra'' (ISSN 0021-8693) is an international mathematical research journal in algebra. An imprint of Academic Press, it is published by Elsevier. ''Journal of Algebra'' was founded by Graham Higman, who was its editor from 1964 to 1984. From 1985 until 2000, Walter Feit served as its editor-in-chief. In 2004, ''Journal of Algebra'' announced (vol. 276, no. 1 and 2) the creation of a new section on computational algebra, with a separate editorial board. The first issue completely devoted to computational algebra was vol. 292, no. 1 (October 2005). The Editor-in-Chief of the ''Journal of Algebra'' is Michel Broué, Université Paris Diderot, and Gerhard Hiß, Rheinisch-Westfälische Technische Hochschule Aachen ( RWTH) is Editor of the computational algebra section. See also *Susan Montgomery M. Susan Montgomery (born 2 April 1943 in Lansing, MI) is a distinguished American mathematician whose current research interests concern noncommutative algebras: in parti ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Groupoid
In mathematics, especially in category theory and homotopy theory, a groupoid (less often Brandt groupoid or virtual group) generalises the notion of group in several equivalent ways. A groupoid can be seen as a: *''Group'' with a partial function replacing the binary operation; *''Category'' in which every morphism is invertible. A category of this sort can be viewed as augmented with a unary operation on the morphisms, called ''inverse'' by analogy with group theory. A groupoid where there is only one object is a usual group. In the presence of dependent typing, a category in general can be viewed as a typed monoid, and similarly, a groupoid can be viewed as simply a typed group. The morphisms take one from one object to another, and form a dependent family of types, thus morphisms might be typed g:A \rightarrow B, h:B \rightarrow C, say. Composition is then a total function: \circ : (B \rightarrow C) \rightarrow (A \rightarrow B) \rightarrow A \rightarrow C , so that h \circ ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]