|
Frobenius Group
In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non-trivial element fixes more than one point and some non-trivial element fixes a point. They are named after F. G. Frobenius. Structure Suppose ''G'' is a Frobenius group consisting of permutations of a set ''X''. A subgroup ''H'' of ''G'' fixing a point of ''X'' is called a Frobenius complement. The identity element together with all elements not in any conjugate of ''H'' form a normal subgroup called the Frobenius kernel ''K''. (This is a theorem due to ; there is still no proof of this theorem that does not use character theory, although see .) The Frobenius group ''G'' is the semidirect product of ''K'' and ''H'': :G=K\rtimes H. Both the Frobenius kernel and the Frobenius complement have very restricted structures. proved that the Frobenius kernel ''K'' is a nilpotent group. If ''H'' has even order then ''K'' is abelian. The Frobenius complement ''H'' has the property t ... [...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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fitting Subgroup
In mathematics, especially in the area of algebra known as group theory, the Fitting subgroup ''F'' of a finite group ''G'', named after Hans Fitting, is the unique largest normal nilpotent subgroup of ''G''. Intuitively, it represents the smallest subgroup which "controls" the structure of ''G'' when ''G'' is solvable. When ''G'' is not solvable, a similar role is played by the generalized Fitting subgroup ''F*'', which is generated by the Fitting subgroup and the components of ''G''. For an arbitrary (not necessarily finite) group ''G'', the Fitting subgroup is defined to be the subgroup generated by the nilpotent normal subgroups of ''G''. For infinite groups, the Fitting subgroup is not always nilpotent. The remainder of this article deals exclusively with finite groups. The Fitting subgroup The nilpotency of the Fitting subgroup of a finite group is guaranteed by Fitting's theorem which says that the product of a finite collection of normal nilpotent subgroups of ''G'' i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Induced Representation
In group theory, the induced representation is a representation of a group, , which is constructed using a known representation of a subgroup . Given a representation of '','' the induced representation is, in a sense, the "most general" representation of that extends the given one. Since it is often easier to find representations of the smaller group than of '','' the operation of forming induced representations is an important tool to construct new representations''.'' Induced representations were initially defined by Frobenius, for linear representations of finite groups. The idea is by no means limited to the case of finite groups, but the theory in that case is particularly well-behaved. Constructions Algebraic Let be a finite group and any subgroup of . Furthermore let be a representation of . Let be the index of in and let be a full set of representatives in of the left cosets in . The induced representation can be thought of as acting on the following spac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Restricted Representation
In group theory, restriction forms a representation of a subgroup using a known representation of the whole group. Restriction is a fundamental construction in representation theory of groups. Often the restricted representation is simpler to understand. Rules for decomposing the restriction of an irreducible representation into irreducible representations of the subgroup are called branching rules, and have important applications in physics. For example, in case of explicit symmetry breaking, the symmetry group of the problem is reduced from the whole group to one of its subgroups. In quantum mechanics, this reduction in symmetry appears as a splitting of degenerate energy levels into multiplets, as in the Stark or Zeeman effect. The induced representation is a related operation that forms a representation of the whole group from a representation of a subgroup. The relation between restriction and induction is described by Frobenius reciprocity and the Mackey theorem. Restrict ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irreducible Representation
In mathematics, specifically in the representation theory of groups and algebras, an irreducible representation (\rho, V) or irrep of an algebraic structure A is a nonzero representation that has no proper nontrivial subrepresentation (\rho, _W,W), with W \subset V closed under the action of \. Every finite-dimensional unitary representation on a Hilbert space V is the direct sum of irreducible representations. Irreducible representations are always indecomposable (i.e. cannot be decomposed further into a direct sum of representations), but converse may not hold, e.g. the two-dimensional representation of the real numbers acting by upper triangular unipotent matrices is indecomposable but reducible. History Group representation theory was generalized by Richard Brauer from the 1940s to give modular representation theory, in which the matrix operators act on a vector space over a field K of arbitrary characteristic, rather than a vector space over the field of real numbers or o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zassenhaus Group
In mathematics, a Zassenhaus group, named after Hans Zassenhaus, is a certain sort of doubly transitive permutation group very closely related to rank-1 groups of Lie type. Definition A Zassenhaus group is a permutation group ''G'' on a finite set ''X'' with the following three properties: * ''G'' is doubly transitive. *Non-trivial elements of ''G'' fix at most two points. *''G'' has no regular normal subgroup. ("Regular" means that non-trivial elements do not fix any points of ''X''; compare free action.) The degree of a Zassenhaus group is the number of elements of ''X''. Some authors omit the third condition that ''G'' has no regular normal subgroup. This condition is put in to eliminate some "degenerate" cases. The extra examples one gets by omitting it are either Frobenius groups or certain groups of degree 2''p'' and order 2''p''(2''p'' − 1)''p'' for a prime ''p'', that are generated by all semilinear mappings and Galois automorphisms of a field of orde ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Solvable Group
In mathematics, more specifically in the field of group theory, a solvable group or soluble group is a group that can be constructed from abelian groups using extensions. Equivalently, a solvable group is a group whose derived series terminates in the trivial subgroup. Motivation Historically, the word "solvable" arose from Galois theory and the proof of the general unsolvability of quintic equation. Specifically, a polynomial equation is solvable in radicals if and only if the corresponding Galois group is solvable (note this theorem holds only in characteristic 0). This means associated to a polynomial f \in F /math> there is a tower of field extensionsF = F_0 \subseteq F_1 \subseteq F_2 \subseteq \cdots \subseteq F_m=Ksuch that # F_i = F_ alpha_i/math> where \alpha_i^ \in F_, so \alpha_i is a solution to the equation x^ - a where a \in F_ # F_m contains a splitting field for f(x) Example For example, the smallest Galois field extension of \mathbb containing the elemen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dihedral Group
In mathematics, a dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections. Dihedral groups are among the simplest examples of finite groups, and they play an important role in group theory, geometry, and chemistry. The notation for the dihedral group differs in geometry and abstract algebra. In geometry, or refers to the symmetries of the -gon, a group of order . In abstract algebra, refers to this same dihedral group. This article uses the geometric convention, . Definition Elements A regular polygon with n sides has 2n different symmetries: n rotational symmetries and n reflection symmetries. Usually, we take n \ge 3 here. The associated rotations and reflections make up the dihedral group \mathrm_n. If n is odd, each axis of symmetry connects the midpoint of one side to the opposite vertex. If n is even, there are n/2 axes of symmetry connecting the midpoints of opposite sides and n/2 axes of symmetry connecting oppo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Flag (geometry)
In (polyhedral) geometry, a flag is a sequence of Face (geometry), faces of a Abstract polytope, polytope, each contained in the next, with exactly one face from each dimension. More formally, a flag of an -polytope is a set such that and there is precisely one in for each , Since, however, the minimal face and the maximal face must be in every flag, they are often omitted from the list of faces, as a shorthand. These latter two are called improper faces. For example, a flag of a polyhedron comprises one Vertex (geometry), vertex, one Edge (geometry), edge incident to that vertex, and one polygonal face incident to both, plus the two improper faces. A polytope may be regarded as regular if, and only if, its symmetry group is transitive group action, transitive on its flags. This definition excludes Chirality (mathematics), chiral polytopes. Incidence geometry In the more abstract setting of incidence geometry, which is a set having a symmetric and reflexive Relatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frobenius Automorphism
In commutative algebra and field theory, the Frobenius endomorphism (after Ferdinand Georg Frobenius) is a special endomorphism of commutative rings with prime characteristic , an important class which includes finite fields. The endomorphism maps every element to its -th power. In certain contexts it is an automorphism, but this is not true in general. Definition Let be a commutative ring with prime characteristic (an integral domain of positive characteristic always has prime characteristic, for example). The Frobenius endomorphism ''F'' is defined by :F(r) = r^p for all ''r'' in ''R''. It respects the multiplication of ''R'': :F(rs) = (rs)^p = r^ps^p = F(r)F(s), and is 1 as well. Moreover, it also respects the addition of . The expression can be expanded using the binomial theorem. Because is prime, it divides but not any for ; it therefore will divide the numerator, but not the denominator, of the explicit formula of the binomial coefficients :\frac, if . Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Collineation
In projective geometry, a collineation is a one-to-one and onto map (a bijection) from one projective space to another, or from a projective space to itself, such that the images of collinear points are themselves collinear. A collineation is thus an ''isomorphism'' between projective spaces, or an automorphism from a projective space to itself. Some authors restrict the definition of collineation to the case where it is an automorphism. The set of all collineations of a space to itself form a group, called the collineation group. Definition Simply, a collineation is a one-to-one map from one projective space to another, or from a projective space to itself, such that the images of collinear points are themselves collinear. One may formalize this using various ways of presenting a projective space. Also, the case of the projective line is special, and hence generally treated differently. Linear algebra For a projective space defined in terms of linear algebra (as the projectiviza ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Affine Transformation
In Euclidean geometry, an affine transformation or affinity (from the Latin, ''affinis'', "connected with") is a geometric transformation that preserves lines and parallelism, but not necessarily Euclidean distances and angles. More generally, an affine transformation is an automorphism of an affine space (Euclidean spaces are specific affine spaces), that is, a function which maps an affine space onto itself while preserving both the dimension of any affine subspaces (meaning that it sends points to points, lines to lines, planes to planes, and so on) and the ratios of the lengths of parallel line segments. Consequently, sets of parallel affine subspaces remain parallel after an affine transformation. An affine transformation does not necessarily preserve angles between lines or distances between points, though it does preserve ratios of distances between points lying on a straight line. If is the point set of an affine space, then every affine transformation on can be repre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
