|
Frobenius Reciprocity
In mathematics, and in particular representation theory, Frobenius reciprocity is a theorem expressing a duality between the process of restricting and inducting. It can be used to leverage knowledge about representations of a subgroup to find and classify representations of "large" groups that contain them. It is named for Ferdinand Georg Frobenius, the inventor of the representation theory of finite groups. Statement Character theory The theorem was originally stated in terms of character theory. Let be a finite group with a subgroup , let \operatorname_H^G denote the restriction of a character, or more generally, class function of to , and let \operatorname_H^G denote the induced class function of a given class function on . For any finite group , there is an inner product \langle -,-\rangle_A on the vector space of class functions A\to\mathbb (described in detail in the article Schur orthogonality relations). Now, for any class functions \psi:H\to\mathbb and ... [...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 points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Properties Character
Property is the ownership of land, resources, improvements or other tangible objects, or intellectual property. Property may also refer to: Mathematics * Property (mathematics) Philosophy and science * Property (philosophy), in philosophy and logic, an abstraction characterizing an object *Material properties, properties by which the benefits of one material versus another can be assessed *Chemical property, a material's properties that becomes evident during a chemical reaction *Physical property, any property that is measurable whose value describes a state of a physical system *Semantic property *Thermodynamic properties, in thermodynamics and materials science, intensive and extensive physical properties of substances *Mental property, a property of the mind studied by many sciences and parasciences Computer science * Property (programming), a type of class member in object-oriented programming * .properties, a Java Properties File to store program settings as name-value p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Morphism
In mathematics, particularly in category theory, a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms are functions; in linear algebra, linear transformations; in group theory, group homomorphisms; in topology, continuous functions, and so on. In category theory, ''morphism'' is a broadly similar idea: the mathematical objects involved need not be sets, and the relationships between them may be something other than maps, although the morphisms between the objects of a given category have to behave similarly to maps in that they have to admit an associative operation similar to function composition. A morphism in category theory is an abstraction of a homomorphism. The study of morphisms and of the structures (called "objects") over which they are defined is central to category theory. Much of the terminology of morphisms, as well as the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Identity Function
Graph of the identity function on the real numbers In mathematics, an identity function, also called an identity relation, identity map or identity transformation, is a function that always returns the value that was used as its argument, unchanged. That is, when is the identity function, the equality is true for all values of to which can be applied. Definition Formally, if is a set, the identity function on is defined to be a function with as its domain and codomain, satisfying In other words, the function value in the codomain is always the same as the input element in the domain . The identity function on is clearly an injective function as well as a surjective function, so it is bijective. The identity function on is often denoted by . In set theory, where a function is defined as a particular kind of binary relation, the identity function is given by the identity relation, or ''diagonal'' of . Algebraic properties If is any function, then we have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Forgetful Functor
In mathematics, in the area of category theory, a forgetful functor (also known as a stripping functor) 'forgets' or drops some or all of the input's structure or properties 'before' mapping to the output. For an algebraic structure of a given signature, this may be expressed by curtailing the signature: the new signature is an edited form of the old one. If the signature is left as an empty list, the functor is simply to take the underlying set of a structure. Because many structures in mathematics consist of a set with an additional added structure, a forgetful functor that maps to the underlying set is the most common case. Overview As an example, there are several forgetful functors from the category of commutative rings. A ( unital) ring, described in the language of universal algebra, is an ordered tuple (R,+,\times,a,0,1) satisfying certain axioms, where + and \times are binary functions on the set R, a is a unary operation corresponding to additive inverse, and 0 and 1 are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category (mathematics)
In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of "objects" that are linked by "arrows". A category has two basic properties: the ability to compose the arrows associatively and the existence of an identity arrow for each object. A simple example is the category of sets, whose objects are sets and whose arrows are functions. '' Category theory'' is a branch of mathematics that seeks to generalize all of mathematics in terms of categories, independent of what their objects and arrows represent. Virtually every branch of modern mathematics can be described in terms of categories, and doing so often reveals deep insights and similarities between seemingly different areas of mathematics. As such, category theory provides an alternative foundation for mathematics to set theory and other proposed axiomatic foundations. In general, the objects and arrows may be abstract entities of any kind, and the n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Field (mathematics)
In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational and real numbers do. 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 fields of rational functions, algebraic function fields, algebraic number fields, and ''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 elements. The relation of two fields is expressed by the notion of a field extension. Galois theory, initiated by Évariste Galois in the 1830s, is devoted to understanding the symmetries of field extensions. Among other results, thi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Martin Liebeck
Martin Liebeck (born 23 September 1954) is a professor of Pure Mathematics at Imperial College London whose research interests include group theory and algebraic combinatorics.Martin Liebeck at Martin Liebeck at Career and research Martin Liebeck studied mathematics at the |
Change Of Rings
In algebra, given a ring homomorphism f: R \to S, there are three ways to change the coefficient ring of a module; namely, for a left ''R''-module ''M'' and a left ''S''-module ''N'', *f_! M = S\otimes_R M, the induced module. *f_* M = \operatorname_R(S, M), the coinduced module. *f^* N = N_R, the restriction of scalars. They are related as adjoint functors: :f_! : \text_R \leftrightarrows \text_S : f^* and :f^* : \text_S \leftrightarrows \text_R : f_*. This is related to Shapiro's lemma. Operations Restriction of scalars Throughout this section, let R and S be two rings (they may or may not be commutative, or contain an identity), and let f:R \to S be a homomorphism. Restriction of scalars changes ''S''-modules into ''R''-modules. In algebraic geometry, the term "restriction of scalars" is often used as a synonym for Weil restriction. Definition Suppose that M is a module over S. Then it can be regarded as a module over R where the action of R is given via : \begin M\t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Induced Module
In algebra, given a ring homomorphism f: R \to S, there are three ways to change the coefficient ring of a module; namely, for a left ''R''-module ''M'' and a left ''S''-module ''N'', *f_! M = S\otimes_R M, the induced module. *f_* M = \operatorname_R(S, M), the coinduced module. *f^* N = N_R, the restriction of scalars. They are related as adjoint functors: :f_! : \text_R \leftrightarrows \text_S : f^* and :f^* : \text_S \leftrightarrows \text_R : f_*. This is related to Shapiro's lemma. Operations Restriction of scalars Throughout this section, let R and S be two rings (they may or may not be commutative, or contain an identity), and let f:R \to S be a homomorphism. Restriction of scalars changes ''S''-modules into ''R''-modules. In algebraic geometry, the term "restriction of scalars" is often used as a synonym for Weil restriction. Definition Suppose that M is a module over S. Then it can be regarded as a module over R where the action of R is given via : \begin M\ti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isomorphism Of Categories
In category theory, two categories ''C'' and ''D'' are isomorphic if there exist functors ''F'' : ''C'' → ''D'' and ''G'' : ''D'' → ''C'' which are mutually inverse to each other, i.e. ''FG'' = 1''D'' (the identity functor on ''D'') and ''GF'' = 1''C''. This means that both the objects and the morphisms of ''C'' and ''D'' stand in a one-to-one correspondence to each other. Two isomorphic categories share all properties that are defined solely in terms of category theory; for all practical purposes, they are identical and differ only in the notation of their objects and morphisms. Isomorphism of categories is a very strong condition and rarely satisfied in practice. Much more important is the notion of equivalence of categories; roughly speaking, for an equivalence of categories we don't require that FG be ''equal'' to 1_D, but only ''naturally isomorphic'' to 1_D, and likewise that GF be naturally isomorphic to 1_C. Properties As is true for any notion of isomorphism, we have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isomorphism Of Categories
In category theory, two categories ''C'' and ''D'' are isomorphic if there exist functors ''F'' : ''C'' → ''D'' and ''G'' : ''D'' → ''C'' which are mutually inverse to each other, i.e. ''FG'' = 1''D'' (the identity functor on ''D'') and ''GF'' = 1''C''. This means that both the objects and the morphisms of ''C'' and ''D'' stand in a one-to-one correspondence to each other. Two isomorphic categories share all properties that are defined solely in terms of category theory; for all practical purposes, they are identical and differ only in the notation of their objects and morphisms. Isomorphism of categories is a very strong condition and rarely satisfied in practice. Much more important is the notion of equivalence of categories; roughly speaking, for an equivalence of categories we don't require that FG be ''equal'' to 1_D, but only ''naturally isomorphic'' to 1_D, and likewise that GF be naturally isomorphic to 1_C. Properties As is true for any notion of isomorphism, we have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
