|
Isotypic Component
In mathematics, specifically in representation theory, a semisimple representation (also called a completely reducible representation) is a linear representation of a group or an algebra that is a direct sum of simple representations (also called irreducible representations). It is an example of the general mathematical notion of semisimplicity. Many representations that appear in applications of representation theory are semisimple or can be approximated by semisimple representations. A semisimple module over an algebra over a field is an example of a semisimple representation. Conversely, a semisimple representation of a group ''G'' over a field ''k'' is a semisimple module over the group algebra ''k'' 'G'' Equivalent characterizations Let ''V'' be a representation of a group ''G''; or more generally, let ''V'' be a vector space with a set of linear endomorphisms acting on it. In general, a vector space acted on by a set of linear endomorphisms is said to be simple (or irre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), Mathematical analysis, analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). Mathematics involves the description and manipulation of mathematical object, abstract objects that consist of either abstraction (mathematics), abstractions from nature orin modern mathematicspurely abstract entities that are stipulated to have certain properties, called axioms. Mathematics uses pure reason to proof (mathematics), prove properties of objects, a ''proof'' consisting of a succession of applications of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complementary Representation
This is a glossary of representation theory in mathematics. The term "module" is often used synonymously for a representation; for the module-theoretic terminology, see also glossary of module theory. See also Glossary of Lie groups and Lie algebras, list of representation theory topics and :Representation theory. Notations: We write \mathbb_m = GL_1. Thus, for example, a one-representation (i.e., a character) of a group ''G'' is of the form \chi: G \to \mathbb_m. A B C D E F G H I J K L M O P Q R S T U V W Y Z Notes Referen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Module
In mathematics, more specifically in ring theory, a cyclic module or monogenous module is a module over a ring that is generated by one element. The concept is a generalization of the notion of a cyclic group, that is, an Abelian group (i.e. Z-module) that is generated by one element. Definition A left ''R''-module ''M'' is called cyclic if ''M'' can be generated by a single element i.e. for some ''x'' in ''M''. Similarly, a right ''R''-module ''N'' is cyclic if for some . Examples * 2Z as a Z-module is a cyclic module. * In fact, every cyclic group is a cyclic Z-module. * Every simple ''R''-module ''M'' is a cyclic module since the submodule generated by any non-zero element ''x'' of ''M'' is necessarily the whole module ''M''. In general, a module is simple if and only if it is nonzero and is generated by each of its nonzero elements. * If the ring ''R'' is considered as a left module over itself, then its cyclic submodules are exactly its left principal ideals as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isomorphic
In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word is derived . The interest in isomorphisms lies in the fact that two isomorphic objects have the same properties (excluding further information such as additional structure or names of objects). Thus isomorphic structures cannot be distinguished from the point of view of structure only, and may often be identified. In mathematical jargon, one says that two objects are the same up to an isomorphism. A common example where isomorphic structures cannot be identified is when the structures are substructures of a larger one. For example, all subspaces of dimension one of a vector space are isomorphic and cannot be identified. An automorphism is an isomorphism from a structure to itself. An isomorphism between two structures is a c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irreducible Module
In mathematics, specifically in ring theory, the simple modules over a ring ''R'' are the (left or right) modules over ''R'' that are non-zero and have no non-zero proper submodules. Equivalently, a module ''M'' is simple if and only if every cyclic submodule generated by a element of ''M'' equals ''M''. Simple modules form building blocks for the modules of finite length, and they are analogous to the simple groups in group theory. In this article, all modules will be assumed to be right unital modules over a ring ''R''. Examples Z-modules are the same as abelian groups, so a simple Z-module is an abelian group which has no non-zero proper subgroups. These are the cyclic groups of prime order. If ''I'' is a right ideal of ''R'', then ''I'' is simple as a right module if and only if ''I'' is a minimal non-zero right ideal: If ''M'' is a non-zero proper submodule of ''I'', then it is also a right ideal, so ''I'' is not minimal. Conversely, if ''I'' is not minimal, t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matrix (mathematics)
In mathematics, a matrix (: matrices) is a rectangle, rectangular array or table of numbers, symbol (formal), symbols, or expression (mathematics), expressions, with elements or entries arranged in rows and columns, which is used to represent a mathematical object or property of such an object. For example, \begin1 & 9 & -13 \\20 & 5 & -6 \end is a matrix with two rows and three columns. This is often referred to as a "two-by-three matrix", a " matrix", or a matrix of dimension . Matrices are commonly used in linear algebra, where they represent linear maps. In geometry, matrices are widely used for specifying and representing geometric transformations (for example rotation (mathematics), rotations) and coordinate changes. In numerical analysis, many computational problems are solved by reducing them to a matrix computation, and this often involves computing with matrices of huge dimensions. Matrices are used in most areas of mathematics and scientific fields, either directly ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zorn's Lemma
Zorn's lemma, also known as the Kuratowski–Zorn lemma, is a proposition of set theory. It states that a partially ordered set containing upper bounds for every chain (that is, every totally ordered subset) necessarily contains at least one maximal element. The lemma was proved (assuming the axiom of choice) by Kazimierz Kuratowski in 1922 and independently by Max Zorn in 1935. It occurs in the proofs of several theorems of crucial importance, for instance the Hahn–Banach theorem in functional analysis, the theorem that every vector space has a basis, Tychonoff's theorem in topology stating that every product of compact spaces is compact, and the theorems in abstract algebra that in a ring with identity every proper ideal is contained in a maximal ideal and that every field has an algebraic closure. Zorn's lemma is equivalent to the well-ordering theorem and also to the axiom of choice, in the sense that within ZF ( Zermelo–Fraenkel set theory without th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partial Order
In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word ''partial'' is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable. Formally, a partial order is a homogeneous binary relation that is reflexive, antisymmetric, and transitive. A partially ordered set (poset for short) is an ordered pair P=(X,\leq) consisting of a set X (called the ''ground set'' of P) and a partial order \leq on X. When the meaning is clear from context and there is no ambiguity about the partial order, the set X itself is sometimes called a poset. Partial order relations The term ''partial order'' usually refers to the reflexive partial order relations, referred to in this article as ''non-strict'' partial orders. However som ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Without Loss Of Generality
''Without loss of generality'' (often abbreviated to WOLOG, WLOG or w.l.o.g.; less commonly stated as ''without any loss of generality'' or ''with no loss of generality'') is a frequently used expression in mathematics. The term is used to indicate the assumption that what follows is chosen arbitrarily, narrowing the premise to a particular case, but does not affect the validity of the proof in general. The other cases are sufficiently similar to the one presented that proving them follows by essentially the same logic. As a result, once a proof is given for the particular case, it is trivial to adapt it to prove the conclusion in all other cases. In many scenarios, the use of "without loss of generality" is made possible by the presence of symmetry. For example, if some property ''P''(''x'',''y'') of real numbers is known to be symmetric in ''x'' and ''y'', namely that ''P''(''x'',''y'') is equivalent to ''P''(''y'',''x''), then in proving that ''P''(''x'',''y'') holds for every ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Section (category Theory)
In category theory, a branch of mathematics, a section is a right inverse of some morphism. Dually, a retraction is a left inverse of some morphism. In other words, if f: X\to Y and g: Y\to X are morphisms whose composition f \circ g: Y\to Y is the identity morphism on Y, then g is a section of f, and f is a retraction of g. Every section is a monomorphism (every morphism with a left inverse is left-cancellative), and every retraction is an epimorphism (every morphism with a right inverse is right-cancellative). In algebra, sections are also called split monomorphisms and retractions are also called split epimorphisms. In an abelian category, if f: X\to Y is a split epimorphism with split monomorphism g: Y\to X, then X is isomorphic to the direct sum of Y and the kernel of f. The synonym coretraction for section is sometimes seen in the literature, although rarely in recent work. Properties * A section that is also an epimorphism is an isomorphism. Dually a retracti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Splitting Lemma
In mathematics, and more specifically in homological algebra, the splitting lemma states that in any abelian category, the following statements are equivalent for a short exact sequence : 0 \longrightarrow A \mathrel B \mathrel C \longrightarrow 0. If any of these statements holds, the sequence is called a split exact sequence, and the sequence is said to ''split''. In the above short exact sequence, where the sequence splits, it allows one to refine the first isomorphism theorem, which states that: : (i.e., isomorphic to the coimage of or cokernel of ) to: : where the first isomorphism theorem is then just the projection onto . It is a categorical generalization of the rank–nullity theorem (in the form in linear algebra Linear algebra is the branch of mathematics concerning linear equations such as :a_1x_1+\cdots +a_nx_n=b, linear maps such as :(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n, and their representations in vector spaces and through matrix (mathemat . ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Representation Theory
Representation theory is a branch of mathematics that studies abstract algebra, abstract algebraic structures by ''representing'' their element (set theory), elements as linear transformations of vector spaces, and studies Module (mathematics), modules over these abstract algebraic structures. In essence, a representation makes an abstract algebraic object more concrete by describing its elements by matrix (mathematics), matrices and their algebraic operations (for example, matrix addition, matrix multiplication). The algebraic objects amenable to such a description include group (mathematics), groups, associative algebras and Lie algebras. The most prominent of these (and historically the first) is the group representation, representation theory of groups, in which elements of a group are represented by invertible matrices such that the group operation is matrix multiplication. Representation theory is a useful method because it reduces problems in abstract algebra to problems ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
