|
Gabriel's Theorem
In mathematics, Gabriel's theorem, proved by Pierre Gabriel, classifies the quivers of finite type in terms of Dynkin diagrams. Statement A quiver is of finite type if it has only finitely many isomorphism classes of indecomposable representations. classified all quivers of finite type, and also their indecomposable representations. More precisely, Gabriel's theorem states that: # A ( connected) quiver is of finite type if and only if its underlying graph (when the directions of the arrows are ignored) is one of the ADE Dynkin diagrams: A_n, D_n, E_6, E_7, E_8. # The indecomposable representations are in a one-to-one correspondence with the positive roots of the root system of the Dynkin diagram. found a generalization of Gabriel's theorem in which all Dynkin diagrams of finite-dimensional semisimple Lie algebra In mathematics, a Lie algebra (pronounced ) is a vector space \mathfrak g together with an Binary operation, operation called the Lie bracket, an Altern ... [...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 poin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pierre Gabriel
Pierre Gabriel (1 August 1933 – 24 November 2015), also known as Peter Gabriel, was a French mathematician at the University of Strasbourg (1962–1970), University of Bonn (1970–1974) and University of Zürich (1974–1998) who worked on category theory, algebraic groups, and representation theory of algebras. He was elected a correspondent member of the French Academy of Sciences The French Academy of Sciences (French: ''Académie des sciences'') is a learned society, founded in 1666 by Louis XIV of France, Louis XIV at the suggestion of Jean-Baptiste Colbert, to encourage and protect the spirit of French Scientific me ... in November 1986. His most famous result is Gabriel's theorem that provides a classification of all quivers of finite type. References External links * * Personal Web Page 1933 births 2015 deaths 20th-century French mathematicians 21st-century French mathematicians Algebraists University of Paris alumni University of Zurich facul ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quiver (mathematics)
In graph theory, a quiver is a directed graph where loops and multiple arrows between two vertices are allowed, i.e. a multidigraph. They are commonly used in representation theory: a representation of a quiver assigns a vector space to each vertex of the quiver and a linear map to each arrow . In category theory, a quiver can be understood to be the underlying structure of a category, but without composition or a designation of identity morphisms. That is, there is a forgetful functor from to . Its left adjoint is a free functor which, from a quiver, makes the corresponding free category. Definition A quiver Γ consists of: * The set ''V'' of vertices of Γ * The set ''E'' of edges of Γ * Two functions: ''s'': ''E'' → ''V'' giving the ''start'' or ''source'' of the edge, and another function, ''t'': ''E'' → ''V'' giving the ''target'' of the edge. This definition is identical to that of a multidigraph. A morphism of quivers is defined as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dynkin Diagram
In the mathematical field of Lie theory, a Dynkin diagram, named for Eugene Dynkin, is a type of graph with some edges doubled or tripled (drawn as a double or triple line). Dynkin diagrams arise in the classification of semisimple Lie algebras over algebraically closed fields, in the classification of Weyl groups and other finite reflection groups, and in other contexts. Various properties of the Dynkin diagram (such as whether it contains multiple edges, or its symmetries) correspond to important features of the associated Lie algebra. The term "Dynkin diagram" can be ambiguous. In some cases, Dynkin diagrams are assumed to be directed, in which case they correspond to root systems and semi-simple Lie algebras, while in other cases they are assumed to be undirected, in which case they correspond to Weyl groups. In this article, "Dynkin diagram" means ''directed'' Dynkin diagram, and ''undirected'' Dynkin diagrams will be explicitly so named. Classification of semisi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isomorphism Class
In mathematics, an isomorphism class is a collection of mathematical objects isomorphic to each other. Isomorphism classes are often defined as the exact identity of the elements of the set is considered irrelevant, and the properties of the structure of the mathematical object are studied. Examples of this are ordinals and graphs. However, there are circumstances in which the isomorphism class of an object conceals vital internal information about it; consider these examples: * The associative algebras consisting of coquaternions and 2 × 2 real matrices are isomorphic as rings. Yet they appear in different contexts for application (plane mapping and kinematics) so the isomorphism is insufficient to merge the concepts. *In homotopy theory, the fundamental group of a space X at a point p, though technically denoted \pi_1(X,p) to emphasize the dependence on the base point, is often written lazily as simply \pi_1(X) if X is path connected. The reason for this ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Connectivity (graph Theory)
In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. Connected vertices and graphs In an undirected graph , two '' vertices'' and are called connected if contains a path from to . Otherwise, they are called disconnected. If the two vertices are additionally connected by a path of length , i.e. by a single edge, the vertices are called adjacent. A graph is said to be connected if every pair of vertices in the graph is connected. This means that there is a path between every pair of vertices. An undirected graph that is not connected is called disconnected. An undirected graph ''G'' is therefore disconnected if there exist two ver ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph (discrete Mathematics)
In discrete mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called '' vertices'' (also called ''nodes'' or ''points'') and each of the related pairs of vertices is called an ''edge'' (also called ''link'' or ''line''). Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics. The edges may be directed or undirected. For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this graph is undirected because any person ''A'' can shake hands with a person ''B'' only if ''B'' also shakes hands with ''A''. In contrast, if an edge from a person ''A'' to a person ''B'' means that ''A'' owes money to ''B'', th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ADE Classification
In mathematics, the ADE classification (originally ''A-D-E'' classifications) is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams. The question of giving a common origin to these classifications, rather than a posteriori verification of a parallelism, was posed in . The complete list of simply laced Dynkin diagrams comprises :A_n, \, D_n, \, E_6, \, E_7, \, E_8. Here "simply laced" means that there are no multiple edges, which corresponds to all simple roots in the root system forming angles of \pi/2 = 90^\circ (no edge between the vertices) or 2\pi/3 = 120^\circ (single edge between the vertices). These are two of the four families of Dynkin diagrams (omitting B_n and C_n), and three of the five exceptional Dynkin diagrams (omitting F_4 and G_2). This list is non-redundant if one takes n \geq 4 for D_n. If one extends the families to include redundant terms, one obtains the exceptional isomorphisms :D_3 \cong A_3, E_4 \cong A_4 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Root System
In mathematics, a root system is a configuration of vectors in a Euclidean space satisfying certain geometrical properties. The concept is fundamental in the theory of Lie groups and Lie algebras, especially the classification and representation theory of semisimple Lie algebras. Since Lie groups (and some analogues such as algebraic groups) and Lie algebras have become important in many parts of mathematics during the twentieth century, the apparently special nature of root systems belies the number of areas in which they are applied. Further, the classification scheme for root systems, by Dynkin diagrams, occurs in parts of mathematics with no overt connection to Lie theory (such as singularity theory). Finally, root systems are important for their own sake, as in spectral graph theory. Definitions and examples As a first example, consider the six vectors in 2-dimensional Euclidean space, R2, as shown in the image at the right; call them roots. These vectors span the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semisimple Lie Algebra
In mathematics, a Lie algebra is semisimple if it is a direct sum of simple Lie algebras. (A simple Lie algebra is a non-abelian Lie algebra without any non-zero proper ideals). Throughout the article, unless otherwise stated, a Lie algebra is a finite-dimensional Lie algebra over a field of characteristic 0. For such a Lie algebra \mathfrak g, if nonzero, the following conditions are equivalent: *\mathfrak g is semisimple; *the Killing form, κ(x,y) = tr(ad(''x'')ad(''y'')), is non-degenerate; *\mathfrak g has no non-zero abelian ideals; *\mathfrak g has no non-zero solvable ideals; * the radical (maximal solvable ideal) of \mathfrak g is zero. Significance The significance of semisimplicity comes firstly from the Levi decomposition, which states that every finite dimensional Lie algebra is the semidirect product of a solvable ideal (its radical) and a semisimple algebra. In particular, there is no nonzero Lie algebra that is both solvable and semisimple. Semisimple Li ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lie Algebra
In mathematics, a Lie algebra (pronounced ) is a vector space \mathfrak g together with an operation called the Lie bracket, an alternating bilinear map \mathfrak g \times \mathfrak g \rightarrow \mathfrak g, that satisfies the Jacobi identity. The Lie bracket of two vectors x and y is denoted ,y/math>. The vector space \mathfrak g together with this operation is a non-associative algebra, meaning that the Lie bracket is not necessarily associative. Lie algebras are closely related to Lie groups, which are groups that are also smooth manifolds: any Lie group gives rise to a Lie algebra, which is its tangent space at the identity. Conversely, to any finite-dimensional Lie algebra over real or complex numbers, there is a corresponding connected Lie group unique up to finite coverings ( Lie's third theorem). This correspondence allows one to study the structure and classification of Lie groups in terms of Lie algebras. In physics, Lie groups appear as symmetry grou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
