|
Prüfer Group
In mathematics, specifically in group theory, the Prüfer ''p''-group or the ''p''-quasicyclic group or ''p''∞-group, Z(''p''∞), for a prime number ''p'' is the unique ''p''-group in which every element has ''p'' different ''p''-th roots. The Prüfer ''p''-groups are countable abelian groups that are important in the classification of infinite abelian groups: they (along with the group of rational numbers) form the smallest building blocks of all divisible groups. The groups are named after Heinz Prüfer, a German mathematician of the early 20th century. Constructions of Z(''p''∞) The Prüfer ''p''-group may be identified with the subgroup of the circle group, U(1), consisting of all ''p''''n''-th roots of unity as ''n'' ranges over all non-negative integers: :\mathbf(p^\infty)=\ = \.\; The group operation here is the multiplication of complex numbers. There is a presentation :\mathbf(p^\infty) = \langle\, g_1, g_2, g_3, \ldots \mid g_1^p = 1, g_2^p = g_1, g_3^p = ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prüfer
Pruefer or Prüfer is a surname of German derivation, and may refer to: * Heinz Prüfer, German Jewish mathematician (1896-1934) * Kevin Prufer, American poet (1969) * Gustav Franz Pruefer, American Music instrument inventor (1861-1951) See also * Prüffer German-language surnames Surnames of Jewish origin {{Reflist ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topological Group
In mathematics, topological groups are the combination of groups and topological spaces, i.e. they are groups and topological spaces at the same time, such that the continuity condition for the group operations connects these two structures together and consequently they are not independent from each other. Topological groups were studied extensively in the period of 1925 to 1940. Haar and Weil (respectively in 1933 and 1940) showed that the integrals and Fourier series are special cases of a construct that can be defined on a very wide class of topological groups. Topological groups, along with continuous group actions, are used to study continuous symmetries, which have many applications, for example, in physics. In functional analysis, every topological vector space is an additive topological group with the additional property that scalar multiplication is continuous; consequently, many results from the theory of topological groups can be applied to functional anal ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Divisible Group
In mathematics, specifically in the field of group theory, a divisible group is an abelian group in which every element can, in some sense, be divided by positive integers, or more accurately, every element is an ''n''th multiple for each positive integer ''n''. Divisible groups are important in understanding the structure of abelian groups, especially because they are the injective abelian groups. Definition An abelian group (G, +) is divisible if, for every positive integer n and every g \in G, there exists y \in G such that ny=g. An equivalent condition is: for any positive integer n, nG=G, since the existence of y for every n and g implies that n G\supseteq G, and the other direction n G\subseteq G is true for every group. A third equivalent condition is that an abelian group G is divisible if and only if G is an injective object in the category of abelian groups; for this reason, a divisible group is sometimes called an injective group. An abelian group is p-divisible ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Locally Cyclic Group
In mathematics, a locally cyclic group is a group (''G'', *) in which every finitely generated subgroup is cyclic. Some facts * Every cyclic group is locally cyclic, and every locally cyclic group is abelian. * Every finitely-generated locally cyclic group is cyclic. * Every subgroup and quotient group of a locally cyclic group is locally cyclic. * Every homomorphic image of a locally cyclic group is locally cyclic. * A group is locally cyclic if and only if every pair of elements in the group generates a cyclic group. * A group is locally cyclic if and only if its lattice of subgroups is distributive . * The torsion-free rank of a locally cyclic group is 0 or 1. * The endomorphism ring of a locally cyclic group is commutative. Examples of locally cyclic groups that are not cyclic Examples of abelian groups that are not locally cyclic * The additive group of real numbers (R, +); the subgroup generated by 1 and (comprising all numbers of the form ''a'' + ''b'') is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Direct Sum
The direct sum is an operation between structures in abstract algebra, a branch of mathematics. It is defined differently but analogously for different kinds of structures. As an example, the direct sum of two abelian groups A and B is another abelian group A\oplus B consisting of the ordered pairs (a,b) where a \in A and b \in B. To add ordered pairs, the sum is defined (a, b) + (c, d) to be (a + c, b + d); in other words, addition is defined coordinate-wise. For example, the direct sum \Reals \oplus \Reals , where \Reals is real coordinate space, is the Cartesian plane, \R ^2 . A similar process can be used to form the direct sum of two vector spaces or two modules. Direct sums can also be formed with any finite number of summands; for example, A \oplus B \oplus C, provided A, B, and C are the same kinds of algebraic structures (e.g., all abelian groups, or all vector spaces). That relies on the fact that the direct sum is associative up to isomorphism. That is, (A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Indecomposable Module
In abstract algebra, a module is indecomposable if it is non-zero and cannot be written as a direct sum of two non-zero submodules. Indecomposable is a weaker notion than simple module (which is also sometimes called irreducible module): simple means "no proper submodule" , while indecomposable "not expressible as ". A direct sum of indecomposables is called completely decomposable; this is weaker than being semisimple, which is a direct sum of simple modules. A direct sum decomposition of a module into indecomposable modules is called an indecomposable decomposition. Motivation In many situations, all modules of interest are completely decomposable; the indecomposable modules can then be thought of as the "basic building blocks", the only objects that need to be studied. This is the case for modules over a field or PID, and underlies Jordan normal form of operators. Examples Field Modules over fields are vector spaces. A vector space is indecomposable if and on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frattini Subgroup
In mathematics, particularly in group theory, the Frattini subgroup \Phi(G) of a group is the intersection of all maximal subgroups of . For the case that has no maximal subgroups, for example the trivial group or a Prüfer group, it is defined by \Phi(G)=G. It is analogous to the Jacobson radical in the theory of rings, and intuitively can be thought of as the subgroup of "small elements" (see the "non-generator" characterization below). It is named after Giovanni Frattini, who defined the concept in a paper published in 1885. Some facts * \Phi(G) is equal to the set of all non-generators or non-generating elements of . A non-generating element of is an element that can always be removed from a generating set; that is, an element ''a'' of such that whenever is a generating set of containing ''a'', X \setminus \ is also a generating set of . * \Phi(G) is always a characteristic subgroup of ; in particular, it is always a normal subgroup of . * If is finite, then \P ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Maximal Subgroup
In mathematics, the term maximal subgroup is used to mean slightly different things in different areas of algebra. In group theory, a maximal subgroup ''H'' of a group ''G'' is a proper subgroup, such that no proper subgroup ''K'' contains ''H'' strictly. In other words, ''H'' is a maximal element of the partially ordered set of subgroups of ''G'' that are not equal to ''G''. Maximal subgroups are of interest because of their direct connection with primitive permutation representations of ''G''. They are also much studied for the purposes of finite group theory: see for example Frattini subgroup, the intersection of the maximal subgroups. In semigroup theory, a maximal subgroup of a semigroup ''S'' is a subgroup (that is, a subsemigroup which forms a group under the semigroup operation) of ''S'' which is not properly contained in another subgroup of ''S''. Notice that, here, there is no requirement that a maximal subgroup be proper, so if ''S'' is in fact a group then its uni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Totally Ordered
In mathematics, a total order or linear order is a partial order in which any two elements are comparable. That is, a total order is a binary relation \leq on some set X, which satisfies the following for all a, b and c in X: # a \leq a ( reflexive). # If a \leq b and b \leq c then a \leq c ( transitive). # If a \leq b and b \leq a then a = b ( antisymmetric). # a \leq b or b \leq a ( strongly connected, formerly called totality). Requirements 1. to 3. just make up the definition of a partial order. Reflexivity (1.) already follows from strong connectedness (4.), but is required explicitly by many authors nevertheless, to indicate the kinship to partial orders. Total orders are sometimes also called simple, connex, or full orders. A set equipped with a total order is a totally ordered set; the terms simply ordered set, linearly ordered set, toset and loset are also used. The term ''chain'' is sometimes defined as a synonym of ''totally ordered set'', but generally refers to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Order (group Theory)
In mathematics, the order of a finite group is the number of its elements. If a group is not finite, one says that its order is ''infinite''. The ''order'' of an element of a group (also called period length or period) is the order of the subgroup generated by the element. If the group operation is denoted as a multiplication, the order of an element of a group, is thus the smallest positive integer such that , where denotes the identity element of the group, and denotes the product of copies of . If no such exists, the order of is infinite. The order of a group is denoted by or , and the order of an element is denoted by or , instead of \operatorname(\langle a\rangle), where the brackets denote the generated group. Lagrange's theorem states that for any subgroup of a finite group , the order of the subgroup divides the order of the group; that is, is a divisor of . In particular, the order of any element is a divisor of . Example The symmetric group S3 ha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
P-adic Number
In number theory, given a prime number , the -adic numbers form an extension of the rational numbers which is distinct from the real numbers, though with some similar properties; -adic numbers can be written in a form similar to (possibly infinite) decimals, but with digits based on a prime number rather than ten, and extending to the left rather than to the right. For example, comparing the expansion of the rational number \tfrac15 in base vs. the -adic expansion, \begin \tfrac15 &= 0.01210121\ldots \ (\text 3) &&= 0\cdot 3^0 + 0\cdot 3^ + 1\cdot 3^ + 2\cdot 3^ + \cdots \\ mu\tfrac15 &= \dots 121012102 \ \ (\text) &&= \cdots + 2\cdot 3^3 + 1 \cdot 3^2 + 0\cdot3^1 + 2 \cdot 3^0. \end Formally, given a prime number , a -adic number can be defined as a series s=\sum_^\infty a_i p^i = a_k p^k + a_ p^ + a_ p^ + \cdots where is an integer (possibly negative), and each a_i is an integer such that 0\le a_i < p. A -adic integer is a -adic number such that < ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |