|
Fully Characteristic Subgroup
In mathematics, particularly in the area of abstract algebra known as group theory, a characteristic subgroup is a subgroup that is mapped to itself by every automorphism of the parent group. Because every conjugation map is an inner automorphism, every characteristic subgroup is normal; though the converse is not guaranteed. Examples of characteristic subgroups include the commutator subgroup and the center of a group. Definition A subgroup of a group is called a characteristic subgroup if for every automorphism of , one has ; then write . It would be equivalent to require the stronger condition = for every automorphism of , because implies the reverse inclusion . Basic properties Given , every automorphism of induces an automorphism of the quotient group , which yields a homomorphism . If has a unique subgroup of a given index, then is characteristic in . Related concepts Normal subgroup A subgroup of that is invariant under all inner automorphisms ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 t ... [...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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transitive Relation
In mathematics, a relation on a set is transitive if, for all elements , , in , whenever relates to and to , then also relates to . Each partial order as well as each equivalence relation needs to be transitive. Definition A homogeneous relation on the set is a ''transitive relation'' if, :for all , if and , then . Or in terms of first-order logic: :\forall a,b,c \in X: (aRb \wedge bRc) \Rightarrow aRc, where is the infix notation for . Examples As a non-mathematical example, the relation "is an ancestor of" is transitive. For example, if Amy is an ancestor of Becky, and Becky is an ancestor of Carrie, then Amy, too, is an ancestor of Carrie. On the other hand, "is the birth parent of" is not a transitive relation, because if Alice is the birth parent of Brenda, and Brenda is the birth parent of Claire, then this does not imply that Alice is the birth parent of Claire. What is more, it is antitransitive: Alice can ''never'' be the birth parent of Claire. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reduced Free Group
Reduction, reduced, or reduce may refer to: Science and technology Chemistry * Reduction (chemistry), part of a reduction-oxidation (redox) reaction in which atoms have their oxidation state changed. ** Organic redox reaction, a redox reaction that takes place with organic compounds ** Ore reduction: see smelting Computing and algorithms * Reduction (complexity), a transformation of one problem into another problem * Reduction (recursion theory), given sets A and B of natural numbers, is it possible to effectively convert a method for deciding membership in B into a method for deciding membership in A? * Bit Rate Reduction, an audio compression method * Data reduction, simplifying data in order to facilitate analysis * Graph reduction, an efficient version of non-strict evaluation * L-reduction, a transformation of optimization problems which keeps the approximability features * Partial order reduction, a technique for reducing the size of the state-space to be searched b ... [...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] |
Verbal Subgroup
In mathematics, in the area of abstract algebra known as group theory, a verbal subgroup is a subgroup of a group that is generated by all elements that can be formed by substituting group elements for variables in a given set of words. For example, given the word ''xy'', the corresponding verbal subgroup is generated by the set of all products of two elements in the group, substituting any element for ''x'' and any element for ''y'', and hence would be the group itself. On the other hand, the verbal subgroup for the set of words \ is generated by the set of squares and their conjugates. Verbal subgroups are the only fully characteristic subgroups of a free group and therefore represent the generic example of fully characteristic subgroups, . Another example is the verbal subgroup for \, which is the derived subgroup In mathematics, more specifically in abstract algebra, the commutator subgroup or derived subgroup of a group is the subgroup generated by all the commutators o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Invariant (mathematics)
In mathematics, an invariant is a property of a mathematical object (or a class of mathematical objects) which remains unchanged after operations or transformations of a certain type are applied to the objects. The particular class of objects and type of transformations are usually indicated by the context in which the term is used. For example, the area of a triangle is an invariant with respect to isometries of the Euclidean plane. The phrases "invariant under" and "invariant to" a transformation are both used. More generally, an invariant with respect to an equivalence relation is a property that is constant on each equivalence class. Invariants are used in diverse areas of mathematics such as geometry, topology, algebra and discrete mathematics. Some important classes of transformations are defined by an invariant they leave unchanged. For example, conformal maps are defined as transformations of the plane that preserve angles. The discovery of invariants is an important ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Group
Finite is the opposite of infinite. It may refer to: * Finite number (other) * Finite set, a set whose cardinality (number of elements) is some natural number * Finite verb, a verb form that has a subject, usually being inflected or marked for person and/or tense or aspect * "Finite", a song by Sara Groves from the album '' Invisible Empires'' See also * * Nonfinite (other) {{disambiguation fr:Fini it:Finito ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Endomorphism
In mathematics, an endomorphism is a morphism from a mathematical object to itself. An endomorphism that is also an isomorphism is an automorphism. For example, an endomorphism of a vector space is a linear map , and an endomorphism of a group is a group homomorphism . In general, we can talk about endomorphisms in any category. In the category of sets, endomorphisms are functions from a set ''S'' to itself. In any category, the composition of any two endomorphisms of is again an endomorphism of . It follows that the set of all endomorphisms of forms a monoid, the full transformation monoid, and denoted (or to emphasize the category ). Automorphisms An invertible endomorphism of is called an automorphism. The set of all automorphisms is a subset of with a group structure, called the automorphism group of and denoted . In the following diagram, the arrows denote implication: Endomorphism rings Any two endomorphisms of an abelian group, , can be added to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Surjective
In mathematics, a surjective function (also known as surjection, or onto function) is a function that every element can be mapped from element so that . In other words, every element of the function's codomain is the image of one element of its domain. It is not required that be unique; the function may map one or more elements of to the same element of . The term ''surjective'' and the related terms '' injective'' and '' bijective'' were introduced by Nicolas Bourbaki, a group of mainly French 20th-century mathematicians who, under this pseudonym, wrote a series of books presenting an exposition of modern advanced mathematics, beginning in 1935. The French word '' sur'' means ''over'' or ''above'', and relates to the fact that the image of the domain of a surjective function completely covers the function's codomain. Any function induces a surjection by restricting its codomain to the image of its domain. Every surjective function has a right inverse assuming the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Outer Automorphism Group
In mathematics, the outer automorphism group of a group, , is the quotient, , where is the automorphism group of and ) is the subgroup consisting of inner automorphisms. The outer automorphism group is usually denoted . If is trivial and has a trivial center, then is said to be complete. An automorphism of a group which is not inner is called an outer automorphism. The cosets of with respect to outer automorphisms are then the elements of ; this is an instance of the fact that quotients of groups are not, in general, (isomorphic to) subgroups. If the inner automorphism group is trivial (when a group is abelian), the automorphism group and outer automorphism group are naturally identified; that is, the outer automorphism group does act on the group. For example, for the alternating group, , the outer automorphism group is usually the group of order 2, with exceptions noted below. Considering as a subgroup of the symmetric group, , conjugation by any odd permutation is an outer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Index Of A Subgroup
In mathematics, specifically group theory, the index of a subgroup ''H'' in a group ''G'' is the number of left cosets of ''H'' in ''G'', or equivalently, the number of right cosets of ''H'' in ''G''. The index is denoted , G:H, or :H/math> or (G:H). Because ''G'' is the disjoint union of the left cosets and because each left coset has the same size as ''H'', the index is related to the orders of the two groups by the formula :, G, = , G:H, , H, (interpret the quantities as cardinal numbers if some of them are infinite). Thus the index , G:H, measures the "relative sizes" of ''G'' and ''H''. For example, let G = \Z be the group of integers under addition, and let H = 2\Z be the subgroup consisting of the even integers. Then 2\Z has two cosets in \Z, namely the set of even integers and the set of odd integers, so the index , \Z:2\Z, is 2. More generally, , \Z:n\Z, = n for any positive integer ''n''. When ''G'' is finite, the formula may be written as , G:H, = , G, /, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
