Cartan Matrix
   HOME
*





Cartan Matrix
In mathematics, the term Cartan matrix has three meanings. All of these are named after the French mathematician Élie Cartan. Amusingly, the Cartan matrices in the context of Lie algebras were first investigated by Wilhelm Killing, whereas the Killing form is due to Cartan. Lie algebras A (symmetrizable) generalized Cartan matrix is a square matrix A = (a_) with integral entries such that # For diagonal entries, a_ = 2 . # For non-diagonal entries, a_ \leq 0 . # a_ = 0 if and only if a_ = 0 # A can be written as DS, where D is a diagonal matrix, and S is a symmetric matrix. For example, the Cartan matrix for ''G''2 can be decomposed as such: : \begin 2 & -3 \\ -1 & 2 \end = \begin 3&0\\ 0&1 \end\begin \frac & -1 \\ -1 & 2 \end. The third condition is not independent but is really a consequence of the first and fourth conditions. We can always choose a ''D'' with positive diagonal entries. In that case, if ''S'' in the above ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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]  


Principal Minor
In linear algebra, a minor of a matrix A is the determinant of some smaller square matrix, cut down from A by removing one or more of its rows and columns. Minors obtained by removing just one row and one column from square matrices (first minors) are required for calculating matrix cofactors, which in turn are useful for computing both the determinant and inverse of square matrices. Definition and illustration First minors If A is a square matrix, then the ''minor'' of the entry in the ''i''th row and ''j''th column (also called the (''i'', ''j'') ''minor'', or a ''first minor'') is the determinant of the submatrix formed by deleting the ''i''th row and ''j''th column. This number is often denoted ''M''''i,j''. The (''i'', ''j'') ''cofactor'' is obtained by multiplying the minor by (-1)^. To illustrate these definitions, consider the following 3 by 3 matrix, :\begin 1 & 4 & 7 \\ 3 & 0 & 5 \\ -1 & 9 & 11 \\ \end To compute the minor ''M''2,3 and the cofactor ''C''2,3, we fin ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Intersection Number
In mathematics, and especially in algebraic geometry, the intersection number generalizes the intuitive notion of counting the number of times two curves intersect to higher dimensions, multiple (more than 2) curves, and accounting properly for tangency. One needs a definition of intersection number in order to state results like Bézout's theorem. The intersection number is obvious in certain cases, such as the intersection of ''x''- and ''y''-axes which should be one. The complexity enters when calculating intersections at points of tangency and intersections along positive dimensional sets. For example, if a plane is tangent to a surface along a line, the intersection number along the line should be at least two. These questions are discussed systematically in intersection theory. Definition for Riemann surfaces Let ''X'' be a Riemann surface. Then the intersection number of two closed curves on ''X'' has a simple definition in terms of an integral. For every closed curve '' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Gauge Group
In physics, a gauge theory is a type of field theory in which the Lagrangian (and hence the dynamics of the system itself) does not change (is invariant) under local transformations according to certain smooth families of operations (Lie groups). The term ''gauge'' refers to any specific mathematical formalism to regulate redundant degrees of freedom in the Lagrangian of a physical system. The transformations between possible gauges, called ''gauge transformations'', form a Lie group—referred to as the ''symmetry group'' or the ''gauge group'' of the theory. Associated with any Lie group is the Lie algebra of group generators. For each group generator there necessarily arises a corresponding field (usually a vector field) called the ''gauge field''. Gauge fields are included in the Lagrangian to ensure its invariance under the local group transformations (called ''gauge invariance''). When such a theory is quantized, the quanta of the gauge fields are called ''gauge boson ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Cycle Graph
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if the graph is simple) connected in a closed chain. The cycle graph with vertices is called . The number of vertices in equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it. Terminology There are many synonyms for "cycle graph". These include simple cycle graph and cyclic graph, although the latter term is less often used, because it can also refer to graphs which are merely not acyclic. Among graph theorists, cycle, polygon, or ''n''-gon are also often used. The term ''n''-cycle is sometimes used in other settings. A cycle with an even number of vertices is called an even cycle; a cycle with an odd number of vertices is called an odd cycle. Properties A cycle graph is: * 2-edge colorable, if and only if it has an even number of vertices * 2-regular * 2- ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

M-theory
M-theory is a theory in physics that unifies all consistent versions of superstring theory. Edward Witten first conjectured the existence of such a theory at a string theory conference at the University of Southern California in 1995. Witten's announcement initiated a flurry of research activity known as the second superstring revolution. Prior to Witten's announcement, string theorists had identified five versions of superstring theory. Although these theories initially appeared to be very different, work by many physicists showed that the theories were related in intricate and nontrivial ways. Physicists found that apparently distinct theories could be unified by mathematical transformations called S-duality and T-duality. Witten's conjecture was based in part on the existence of these dualities and in part on the relationship of the string theories to a field theory called eleven-dimensional supergravity. Although a complete formulation of M-theory is not known, such a form ...
[...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, then ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Composition Series
In abstract algebra, a composition series provides a way to break up an algebraic structure, such as a group or a module, into simple pieces. The need for considering composition series in the context of modules arises from the fact that many naturally occurring modules are not semisimple, hence cannot be decomposed into a direct sum of simple modules. A composition series of a module ''M'' is a finite increasing filtration of ''M'' by submodules such that the successive quotients are simple and serves as a replacement of the direct sum decomposition of ''M'' into its simple constituents. A composition series may not exist, and when it does, it need not be unique. Nevertheless, a group of results known under the general name Jordan–Hölder theorem asserts that whenever composition series exist, the '' isomorphism classes'' of simple pieces (although, perhaps, not their ''location'' in the composition series in question) and their multiplicities are uniquely determined. Composition ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Principal Indecomposable Module
In mathematics, especially in the area of abstract algebra known as module theory, a principal indecomposable module has many important relations to the study of a ring's modules, especially its simple modules, projective modules, and indecomposable modules. Definition A (left) principal indecomposable module of a ring ''R'' is a (left) submodule of ''R'' that is a direct summand of ''R'' and is an indecomposable module. Alternatively, it is an indecomposable, projective, cyclic module. Principal indecomposable modules are also called PIMs for short. Relations The projective indecomposable modules over some rings have very close connections with those rings' simple, projective, and indecomposable modules. If the ring ''R'' is Artinian or even semiperfect, then ''R'' is a direct sum of principal indecomposable modules, and there is one isomorphism class of PIM per isomorphism class of simple module. To each PIM ''P'' is associated its head, ''P''/''JP'', which is a simpl ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Semisimple Algebra
In ring theory, a branch of mathematics, a semisimple algebra is an associative artinian algebra over a field which has trivial Jacobson radical (only the zero element of the algebra is in the Jacobson radical). If the algebra is finite-dimensional this is equivalent to saying that it can be expressed as a Cartesian product of simple subalgebras. Definition The Jacobson radical of an algebra over a field is the ideal consisting of all elements that annihilate every simple left-module. The radical contains all nilpotent ideals, and if the algebra is finite-dimensional, the radical itself is a nilpotent ideal. A finite-dimensional algebra is then said to be ''semisimple'' if its radical contains only the zero element. An algebra ''A'' is called ''simple'' if it has no proper ideals and ''A''2 = ≠ . As the terminology suggests, simple algebras are semisimple. The only possible ideals of a simple algebra ''A'' are ''A'' and . Thus if ''A'' is simple, then ''A'' is not nil ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Associative Algebra
In mathematics, an associative algebra ''A'' is an algebraic structure with compatible operations of addition, multiplication (assumed to be associative), and a scalar multiplication by elements in some field ''K''. The addition and multiplication operations together give ''A'' the structure of a ring; the addition and scalar multiplication operations together give ''A'' the structure of a vector space over ''K''. In this article we will also use the term ''K''-algebra to mean an associative algebra over the field ''K''. A standard first example of a ''K''-algebra is a ring of square matrices over a field ''K'', with the usual matrix multiplication. A commutative algebra is an associative algebra that has a commutative multiplication, or, equivalently, an associative algebra that is also a commutative ring. In this article associative algebras are assumed to have a multiplicative identity, denoted 1; they are sometimes called unital associative algebras for clarification. ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Modular Representation Theory
Modular representation theory is a branch of mathematics, and is the part of representation theory that studies linear representations of finite groups over a field ''K'' of positive characteristic ''p'', necessarily a prime number. As well as having applications to group theory, modular representations arise naturally in other branches of mathematics, such as algebraic geometry, coding theory, combinatorics and number theory. Within finite group theory, character-theoretic results proved by Richard Brauer using modular representation theory played an important role in early progress towards the classification of finite simple groups, especially for simple groups whose characterization was not amenable to purely group-theoretic methods because their Sylow 2-subgroups were too small in an appropriate sense. Also, a general result on embedding of elements of order 2 in finite groups called the Z* theorem, proved by George Glauberman using the theory developed by Brauer, was ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]