Coherent Set Of Characters
In mathematical representation theory, coherence is a property of sets of characters that allows one to extend an isometry from the degree-zero subspace of a space of characters to the whole space. The general notion of coherence was developed by , as a generalization of the proof by Frobenius of the existence of a Frobenius kernel of a Frobenius group and of the work of Brauer and Suzuki on exceptional characters. developed coherence further in the proof of the Feit–Thompson theorem that all groups of odd order are solvable. Definition Suppose that ''H'' is a subgroup of a finite group ''G'', and ''S'' a set of irreducible characters of ''H''. Write ''I''(''S'') for the set of integral linear combinations of ''S'', and ''I''0(''S'') for the subset of degree 0 elements of ''I''(''S''). Suppose that τ is an isometry from ''I''0(''S'') to the degree 0 virtual characters of ''G''. Then τ is called coherent if it can be extended to an isometry from ''I''(''S'') to characters of ' ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Representation Theory
Representation theory is a branch of mathematics that studies abstract algebraic structures by ''representing'' their elements as linear transformations of vector spaces, and studies modules over these abstract algebraic structures. In essence, a representation makes an abstract algebraic object more concrete by describing its elements by matrices and their algebraic operations (for example, matrix addition, matrix multiplication). The theory of matrices and linear operators is well-understood, so representations of more abstract objects in terms of familiar linear algebra objects helps glean properties and sometimes simplify calculations on more abstract theories. The algebraic objects amenable to such a description include groups, associative algebras and Lie algebras. The most prominent of these (and historically the first) is the representation theory of groups, in which elements of a group are represented by invertible matrices in such a way that the group operation i ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Character Theory
In mathematics, more specifically in group theory, the character of a group representation is a function on the group that associates to each group element the trace of the corresponding matrix. The character carries the essential information about the representation in a more condensed form. Georg Frobenius initially developed representation theory of finite groups entirely based on the characters, and without any explicit matrix realization of representations themselves. This is possible because a complex representation of a finite group is determined (up to isomorphism) by its character. The situation with representations over a field of positive characteristic, so-called "modular representations", is more delicate, but Richard Brauer developed a powerful theory of characters in this case as well. Many deep theorems on the structure of finite groups use characters of modular representations. Applications Characters of irreducible representations encode many important propert ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Isometry
In mathematics, an isometry (or congruence, or congruent transformation) is a distance-preserving transformation between metric spaces, usually assumed to be bijective. The word isometry is derived from the Ancient Greek: ἴσος ''isos'' meaning "equal", and μέτρον ''metron'' meaning "measure". Introduction Given a metric space (loosely, a set and a scheme for assigning distances between elements of the set), an isometry is a transformation which maps elements to the same or another metric space such that the distance between the image elements in the new metric space is equal to the distance between the elements in the original metric space. In a two-dimensional or three-dimensional Euclidean space, two geometric figures are congruent if they are related by an isometry; the isometry that relates them is either a rigid motion (translation or rotation), or a composition of a rigid motion and a reflection. Isometries are often used in constructions where one space i ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
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]   |
|
Exceptional Character
In mathematical finite group theory, an exceptional character of a group is a character related in a certain way to a character of a subgroup. They were introduced by , based on ideas due to Brauer in . Definition Suppose that ''H'' is a subgroup of a finite group ''G'', and ''C''1, ..., ''C''''r'' are some conjugacy classes of ''H'', and φ1, ..., φ''s'' are some irreducible characters of ''H''. Suppose also that they satisfy the following conditions: #''s'' ≥ 2 #φ''i'' = φ''j'' outside the classes ''C''1, ..., ''C''''r'' #φ''i'' vanishes on any element of ''H'' that is conjugate in ''G'' but not in ''H'' to an element of one of the classes ''C''1, ..., ''C''''r'' #If elements of two classes are conjugate in ''G'' then they are conjugate in ''H'' #The centralizer in ''G'' of any element of one of the classes ''C''1,...,''C''''r'' is contained in ''H'' Then ''G'' has ''s'' irreducible characters ''s''1,...,''s''''s'', ca ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Feit–Thompson Theorem
In mathematics, the Feit–Thompson theorem, or odd order theorem, states that every finite group of odd order is solvable. It was proved by . History conjectured that every nonabelian finite simple group has even order. suggested using the centralizers of involutions of simple groups as the basis for the classification of finite simple groups, as the Brauer–Fowler theorem shows that there are only a finite number of finite simple groups with given centralizer of an involution. A group of odd order has no involutions, so to carry out Brauer's program it is first necessary to show that non-cyclic finite simple groups never have odd order. This is equivalent to showing that odd order groups are solvable, which is what Feit and Thompson proved. The attack on Burnside's conjecture was started by , who studied CA groups; these are groups such that the Centralizer of every non-trivial element is Abelian. In a pioneering paper he showed that all CA groups of odd order are ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Group (mathematics)
In mathematics, a group is a Set (mathematics), set and an Binary operation, operation that combines any two Element (mathematics), elements of the set to produce a third element of the set, in such a way that the operation is Associative property, associative, an identity element exists and every element has an Inverse element, inverse. These three axioms hold for Number#Main classification, number systems and many other mathematical structures. For example, the integers together with the addition operation form a group. The concept of a group and the axioms that define it were elaborated for handling, in a unified way, essential structural properties of very different mathematical entities such as numbers, geometric shapes and polynomial roots. Because the concept of groups is ubiquitous in numerous areas both within and outside mathematics, some authors consider it as a central organizing principle of contemporary mathematics. In geometry groups arise naturally in the study of ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Irreducible Character
In mathematics, more specifically in group theory, the character of a group representation is a function on the group that associates to each group element the trace of the corresponding matrix. The character carries the essential information about the representation in a more condensed form. Georg Frobenius initially developed representation theory of finite groups entirely based on the characters, and without any explicit matrix realization of representations themselves. This is possible because a complex representation of a finite group is determined (up to isomorphism) by its character. The situation with representations over a field of positive characteristic, so-called "modular representations", is more delicate, but Richard Brauer developed a powerful theory of characters in this case as well. Many deep theorems on the structure of finite groups use characters of modular representations. Applications Characters of irreducible representations encode many important prope ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Normalizer
In mathematics, especially group theory, the centralizer (also called commutant) of a subset ''S'' in a group ''G'' is the set of elements \mathrm_G(S) of ''G'' such that each member g \in \mathrm_G(S) commutes with each element of ''S'', or equivalently, such that conjugation by g leaves each element of ''S'' fixed. The normalizer of ''S'' in ''G'' is the set of elements \mathrm_G(S) of ''G'' that satisfy the weaker condition of leaving the set S \subseteq G fixed under conjugation. The centralizer and normalizer of ''S'' are subgroups of ''G''. Many techniques in group theory are based on studying the centralizers and normalizers of suitable subsets ''S''. Suitably formulated, the definitions also apply to semigroups. In ring theory, the centralizer of a subset of a ring is defined with respect to the semigroup (multiplication) operation of the ring. The centralizer of a subset of a ring ''R'' is a subring of ''R''. This article also deals with centralizers and normaliz ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Elementary Abelian
In mathematics, specifically in group theory, an elementary abelian group (or elementary abelian ''p''-group) is an abelian group in which every nontrivial element has order ''p''. The number ''p'' must be prime, and the elementary abelian groups are a particular kind of ''p''-group. The case where ''p'' = 2, i.e., an elementary abelian 2-group, is sometimes called a Boolean group. Every elementary abelian ''p''-group is a vector space over the prime field with ''p'' elements, and conversely every such vector space is an elementary abelian group. By the classification of finitely generated abelian groups, or by the fact that every vector space has a basis, every finite elementary abelian group must be of the form (Z/''p''Z)''n'' for ''n'' a non-negative integer (sometimes called the group's ''rank''). Here, Z/''p''Z denotes the cyclic group of order ''p'' (or equivalently the integers mod ''p''), and the superscript notation means the ''n''-fold direct product of groups. In ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Dade Isometry
In mathematical finite group theory, the Dade isometry is an isometry from class function on a subgroup ''H'' with support on a subset ''K'' of ''H'' to class functions on a group ''G'' . It was introduced by as a generalization and simplification of an isometry used by in their proof of the odd order theorem, and was used by in his revision of the character theory of the odd order theorem. Definitions Suppose that ''H'' is a subgroup of a finite group ''G'', ''K'' is an invariant subset of ''H'' such that if two elements in ''K'' are conjugate in ''G'', then they are conjugate in ''H'', and π a set of primes containing all prime divisors of the orders of elements of ''K''. The Dade lifting is a linear map ''f'' → ''f''σ from class functions ''f'' of ''H'' with support on ''K'' to class functions ''f''σ of ''G'', which is defined as follows: ''f''σ(''x'') is ''f''(''k'') if there is an element ''k'' ∈ ''K'' conjugate to the π-part of ''x'', and 0 ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
American Mathematical Society
The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings, advocacy and other programs. The society is one of the four parts of the Joint Policy Board for Mathematics and a member of the Conference Board of the Mathematical Sciences. History The AMS was founded in 1888 as the New York Mathematical Society, the brainchild of Thomas Fiske, who was impressed by the London Mathematical Society on a visit to England. John Howard Van Amringe was the first president and Fiske became secretary. The society soon decided to publish a journal, but ran into some resistance, due to concerns about competing with the American Journal of Mathematics. The result was the ''Bulletin of the American Mathematical Society'', with Fiske as editor-in-chief. The de facto journal, as intended, was influential in in ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |