|
Schur's Lemma
In mathematics, Schur's lemma is an elementary but extremely useful statement in representation theory of groups and algebras. In the group case it says that if ''M'' and ''N'' are two finite-dimensional irreducible representations of a group ''G'' and ''φ'' is a linear map from ''M'' to ''N'' that commutes with the action of the group, then either ''φ'' is invertible, or ''φ'' = 0. An important special case occurs when ''M'' = ''N'', i.e. ''φ'' is a self-map; in particular, any element of the center of a group must act as a scalar operator (a scalar multiple of the identity) on ''M''. The lemma is named after Issai Schur who used it to prove the Schur orthogonality relations and develop the basics of the representation theory of finite groups. Schur's lemma admits generalisations to Lie groups and Lie algebras, the most common of which are due to Jacques Dixmier and Daniel Quillen. Representation theory of groups Representation theory is the study of ... [...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] |
Jacques Dixmier
Jacques Dixmier (born 24 May 1924) is a French mathematician. He worked on operator algebras, especially C*-algebras, and wrote several of the standard reference books on them, and introduced the Dixmier trace and the Dixmier mapping. Biography Dixmier received his Ph.D. in 1949 from the University of Paris, and his students include Alain Connes. In 1949 upon the initiative of Jean-Pierre Serre and Pierre Samuel, Dixmier became a member of Bourbaki, in which he made essential contributions to the Bourbaki volume on Lie algebras. After retiring as professor emeritus from the University of Paris VI, he spent five years at the Institut des Hautes Études Scientifiques. Often, there is made the erroneous claim that Dixmier originated the name ''von Neumann algebra'' for the operator algebras introduced by John von Neumann, but Dixmier said in an interview that the name originated from a proposal by Jean Dieudonné. Dixmier was an invited speaker at the International Congr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Domain Of A Function
In mathematics, the domain of a function is the Set (mathematics), set of inputs accepted by the Function (mathematics), function. It is sometimes denoted by \operatorname(f) or \operatornamef, where is the function. In layman's terms, the domain of a function can generally be thought of as "what x can be". More precisely, given a function f\colon X\to Y, the domain of is . In modern mathematical language, the domain is part of the definition of a function rather than a property of it. In the special case that and are both sets of real numbers, the function can be graphed in the Cartesian coordinate system. In this case, the domain is represented on the -axis of the graph, as the projection of the graph of the function onto the -axis. For a function f\colon X\to Y, the set is called the ''codomain'': the set to which all outputs must belong. The set of specific outputs the function assigns to elements of is called its ''Range of a function, range'' or ''Image (mathematic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Map
In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping V \to W between two vector spaces that preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism. If a linear map is a bijection then it is called a . In the case where V = W, a linear map is called a linear endomorphism. Sometimes the term refers to this case, but the term "linear operator" can have different meanings for different conventions: for example, it can be used to emphasize that V and W are real vector spaces (not necessarily with V = W), or it can be used to emphasize that V is a function space, which is a common convention in functional analysis. Sometimes the term ''linear function'' has the same meaning as ''linear m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Subspace
In mathematics, the term ''linear'' is used in two distinct senses for two different properties: * linearity of a ''function (mathematics), function'' (or ''mapping (mathematics), mapping''); * linearity of a ''polynomial''. An example of a linear function is the function defined by f(x)=(ax,bx) that maps the real line to a line in the Euclidean plane R2 that passes through the origin. An example of a linear polynomial in the variables X, Y and Z is aX+bY+cZ+d. Linearity of a mapping is closely related to ''Proportionality (mathematics), proportionality''. Examples in physics include the linear relationship of voltage and Electric current, current in an electrical conductor (Ohm's law), and the relationship of mass and weight. By contrast, more complicated relationships, such as between velocity and kinetic energy, are ''Nonlinear system, nonlinear''. Generalized for functions in more than one dimension (mathematics), dimension, linearity means the property of a function of b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Permutation
In mathematics, a permutation of a set can mean one of two different things: * an arrangement of its members in a sequence or linear order, or * the act or process of changing the linear order of an ordered set. An example of the first meaning is the six permutations (orderings) of the set : written as tuples, they are (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). Anagrams of a word whose letters are all different are also permutations: the letters are already ordered in the original word, and the anagram reorders them. The study of permutations of finite sets is an important topic in combinatorics and group theory. Permutations are used in almost every branch of mathematics and in many other fields of science. In computer science, they are used for analyzing sorting algorithms; in quantum physics, for describing states of particles; and in biology, for describing RNA sequences. The number of permutations of distinct objects is factorial, us ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bijection
In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set. A function is bijective if it is invertible; that is, a function f:X\to Y is bijective if and only if there is a function g:Y\to X, the ''inverse'' of , such that each of the two ways for composing the two functions produces an identity function: g(f(x)) = x for each x in X and f(g(y)) = y for each y in Y. For example, the ''multiplication by two'' defines a bijection from the integers to the even numbers, which has the ''division by two'' as its inverse function. A function is bijective if and only if it is both injective (or ''one-to-one'')—meaning that each element in the codomain is mappe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Action
In mathematics, a group action of a group G on a set S is a group homomorphism from G to some group (under function composition) of functions from S to itself. It is said that G acts on S. Many sets of transformations form a group under function composition; for example, the rotations around a point in the plane. It is often useful to consider the group as an abstract group, and to say that one has a group action of the abstract group that consists of performing the transformations of the group of transformations. The reason for distinguishing the group from the transformations is that, generally, a group of transformations of a structure acts also on various related structures; for example, the above rotation group also acts on triangles by transforming triangles into triangles. If a group acts on a structure, it will usually also act on objects built from that structure. For example, the group of Euclidean isometries acts on Euclidean space and also on the figures dra ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Number
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the form a + bi, where and are real numbers. Because no real number satisfies the above equation, was called an imaginary number by René Descartes. For the complex number is called the , and is called the . The set of complex numbers is denoted by either of the symbols \mathbb C or . Despite the historical nomenclature, "imaginary" complex numbers have a mathematical existence as firm as that of the real numbers, and they are fundamental tools in the scientific description of the natural world. Complex numbers allow solutions to all polynomial equations, even those that have no solutions in real numbers. More precisely, the fundamental theorem of algebra asserts that every non-constant polynomial equation with real or complex coefficie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Field (mathematics)
In mathematics, a field is a set (mathematics), set on which addition, subtraction, multiplication, and division (mathematics), division are defined and behave as the corresponding operations on rational number, rational and real numbers. A field is thus a fundamental algebraic structure which is widely used in algebra, number theory, and many other areas of mathematics. The best known fields are the field of rational numbers, the field of real numbers and the field of complex numbers. Many other fields, such as field of rational functions, fields of rational functions, algebraic function fields, algebraic number fields, and p-adic number, ''p''-adic fields are commonly used and studied in mathematics, particularly in number theory and algebraic geometry. Most cryptographic protocols rely on finite fields, i.e., fields with finitely many element (set), elements. The theory of fields proves that angle trisection and squaring the circle cannot be done with a compass and straighte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Automorphism Group
In mathematics, the automorphism group of an object ''X'' is the group consisting of automorphisms of ''X'' under composition of morphisms. For example, if ''X'' is a finite-dimensional vector space, then the automorphism group of ''X'' is the group of invertible linear transformations from ''X'' to itself (the general linear group of ''X''). If instead ''X'' is a group, then its automorphism group \operatorname(X) is the group consisting of all group automorphisms of ''X''. Especially in geometric contexts, an automorphism group is also called a symmetry group. A subgroup of an automorphism group is sometimes called a transformation group. Automorphism groups are studied in a general way in the field of category theory. Examples If ''X'' is a set with no additional structure, then any bijection from ''X'' to itself is an automorphism, and hence the automorphism group of ''X'' in this case is precisely the symmetric group of ''X''. If the set ''X'' has additional structu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vector Space
In mathematics and physics, a vector space (also called a linear space) is a set (mathematics), set whose elements, often called vector (mathematics and physics), ''vectors'', can be added together and multiplied ("scaled") by numbers called scalar (mathematics), ''scalars''. The operations of vector addition and scalar multiplication must satisfy certain requirements, called ''vector axioms''. Real vector spaces and complex vector spaces are kinds of vector spaces based on different kinds of scalars: real numbers and complex numbers. Scalars can also be, more generally, elements of any field (mathematics), field. Vector spaces generalize Euclidean vectors, which allow modeling of Physical quantity, physical quantities (such as forces and velocity) that have not only a Magnitude (mathematics), magnitude, but also a Orientation (geometry), direction. The concept of vector spaces is fundamental for linear algebra, together with the concept of matrix (mathematics), matrices, which ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
