|
Fixed-point Subring
In algebra, the fixed-point subring R^f of an automorphism ''f'' of a ring ''R'' is the subring of the fixed points of ''f'', that is, :R^f = \. More generally, if ''G'' is a group acting on ''R'', then the subring of ''R'' :R^G = \ is called the fixed subring or, more traditionally, the ring of invariants under . If ''S'' is a set of automorphisms of ''R'', the elements of ''R'' that are fixed by the elements of ''S'' form the ring of invariants under the group generated by ''S''. In particular, the fixed-point subring of an automorphism ''f'' is the ring of invariants of the cyclic group generated by ''f''. In Galois theory, when ''R'' is a field and ''G'' is a group of field automorphisms, the fixed ring is a subfield called the fixed field of the automorphism group; see Fundamental theorem of Galois theory. Along with a module of covariants, the ring of invariants is a central object of study in invariant theory. Geometrically, the rings of invariants are the coordina ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebra
Algebra () is one of the broad areas of mathematics. Roughly speaking, algebra is the study of mathematical symbols and the rules for manipulating these symbols in formulas; it is a unifying thread of almost all of mathematics. Elementary algebra deals with the manipulation of variables (commonly represented by Roman letters) as if they were numbers and is therefore essential in all applications of mathematics. Abstract algebra is the name given, mostly in education, to the study of algebraic structures such as groups, rings, and fields (the term is no more in common use outside educational context). Linear algebra, which deals with linear equations and linear mappings, is used for modern presentations of geometry, and has many practical applications (in weather forecasting, for example). There are many areas of mathematics that belong to algebra, some having "algebra" in their name, such as commutative algebra, and some not, such as Galois theory. The word ''algebra'' is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symmetric Group
In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group \mathrm_n defined over a finite set of n symbols consists of the permutations that can be performed on the n symbols. Since there are n! (n factorial) such permutation operations, the order (number of elements) of the symmetric group \mathrm_n is n!. Although symmetric groups can be defined on infinite sets, this article focuses on the finite symmetric groups: their applications, their elements, their conjugacy classes, a finite presentation, their subgroups, their automorphism groups, and their representation theory. For the remainder of this article, "symmetric group" will mean a symmetric group on a finite set. The symmetric group is important to diverse areas of mathematics such as Galois theory, invariant theory, the representatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring Of Polynomial Functions
In mathematics, the ring of polynomial functions on a vector space ''V'' over a field ''k'' gives a coordinate-free analog of a polynomial ring. It is denoted by ''k'' 'V'' If ''V'' is finite dimensional and is viewed as an algebraic variety, then ''k'' 'V''is precisely the coordinate ring of ''V''. The explicit definition of the ring can be given as follows. If k _1, \dots, t_n/math> is a polynomial ring, then we can view t_i as coordinate functions on k^n; i.e., t_i(x) = x_i when x = (x_1, \dots, x_n). This suggests the following: given a vector space ''V'', let ''k'' 'V''be the commutative ''k''-algebra generated by the dual space V^*, which is a subring of the ring of all functions V \to k. If we fix a basis for ''V'' and write t_i for its dual basis, then ''k'' 'V''consists of polynomials in t_i. If ''k'' is infinite, then ''k'' 'V''is the symmetric algebra of the dual space V^*. In applications, one also defines ''k'' 'V''when ''V'' is defined over some subfield of ''k'' ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Free Module
In mathematics, a free module is a module that has a basis – that is, a generating set consisting of linearly independent elements. Every vector space is a free module, but, if the ring of the coefficients is not a division ring (not a field in the commutative case), then there exist non-free modules. Given any set and ring , there is a free -module with basis , which is called the ''free module on'' or ''module of formal'' -''linear combinations'' of the elements of . A free abelian group is precisely a free module over the ring of integers. Definition For a ring R and an R-module M, the set E\subseteq M is a basis for M if: * E is a generating set for M; that is to say, every element of M is a finite sum of elements of E multiplied by coefficients in R; and * E is linearly independent, that is, for every subset \ of distinct elements of E, r_1 e_1 + r_2 e_2 + \cdots + r_n e_n = 0_M implies that r_1 = r_2 = \cdots = r_n = 0_R (where 0_M is the zero element of M and 0_R is t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Free Module
In mathematics, a free module is a module that has a basis – that is, a generating set consisting of linearly independent elements. Every vector space is a free module, but, if the ring of the coefficients is not a division ring (not a field in the commutative case), then there exist non-free modules. Given any set and ring , there is a free -module with basis , which is called the ''free module on'' or ''module of formal'' -''linear combinations'' of the elements of . A free abelian group is precisely a free module over the ring of integers. Definition For a ring R and an R-module M, the set E\subseteq M is a basis for M if: * E is a generating set for M; that is to say, every element of M is a finite sum of elements of E multiplied by coefficients in R; and * E is linearly independent, that is, for every subset \ of distinct elements of E, r_1 e_1 + r_2 e_2 + \cdots + r_n e_n = 0_M implies that r_1 = r_2 = \cdots = r_n = 0_R (where 0_M is the zero element of M and 0_R is t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
G-module
In mathematics, given a group ''G'', a ''G''-module is an abelian group ''M'' on which ''G'' acts compatibly with the abelian group structure on ''M''. This widely applicable notion generalizes that of a representation of ''G''. Group (co)homology provides an important set of tools for studying general ''G''-modules. The term ''G''-module is also used for the more general notion of an ''R''-module on which ''G'' acts linearly (i.e. as a group of ''R''-module automorphisms). Definition and basics Let G be a group. A left G-module consists of an abelian group M together with a left group action \rho:G\times M\to M such that :''g''·(''a''1 + ''a''2) = ''g''·''a''1 + ''g''·''a''2 and :(''g''2 ''x'' ''g''1)·''a'' = ''g''2·(''g''1·''a'') where ''g''·''a'' denotes ρ(''g'',''a'') and ''x'' denotes the binary operation inside the group ''G''. A right ''G''-module is defined similarly. Given a left ''G''-module ''M'', it can be turned into a right ''G''-module by defining '' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unipotent Group
In mathematics, a unipotent element ''r'' of a ring ''R'' is one such that ''r'' − 1 is a nilpotent element; in other words, (''r'' − 1)''n'' is zero for some ''n''. In particular, a square matrix ''M'' is a unipotent matrix if and only if its characteristic polynomial ''P''(''t'') is a power of ''t'' − 1. Thus all the eigenvalues of a unipotent matrix are 1. The term quasi-unipotent means that some power is unipotent, for example for a diagonalizable matrix with eigenvalues that are all roots of unity. In the theory of algebraic groups, a group element is unipotent if it acts unipotently in a certain natural group representation. A unipotent affine algebraic group is then a group with all elements unipotent. Definition Definition with matrices Consider the group \mathbb_n of upper-triangular matrices with 1's along the diagonal, so they are the group of matrices :\mathbb_n = \left\. Then, a unipotent group can be defined ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Artin–Tate Lemma
In algebra, the Artin–Tate lemma, named after Emil Artin and John Tate, states: :Let ''A'' be a commutative Noetherian ring and B \sub C commutative algebras over ''A''. If ''C'' is of finite type over ''A'' and if ''C'' is finite over ''B'', then ''B'' is of finite type over ''A''. (Here, "of finite type" means " finitely generated algebra" and "finite" means " finitely generated module".) The lemma was introduced by E. Artin and J. Tate in 1951 to give a proof Proof most often refers to: * Proof (truth), argument or sufficient evidence for the truth of a proposition * Alcohol proof, a measure of an alcoholic drink's strength Proof may also refer to: Mathematics and formal logic * Formal proof, a con ... of Hilbert's Nullstellensatz. The lemma is similar to the Eakin–Nagata theorem, which says: if ''C'' is finite over ''B'' and ''C'' is a Noetherian ring, then ''B'' is a Noetherian ring. Proof The following proof can be found in Atiyah–MacDonald. M. Atiyah, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integral Element
In commutative algebra, an element ''b'' of a commutative ring ''B'' is said to be integral over ''A'', a subring of ''B'', if there are ''n'' ≥ 1 and ''a''''j'' in ''A'' such that :b^n + a_ b^ + \cdots + a_1 b + a_0 = 0. That is to say, ''b'' is a root of a monic polynomial over ''A''. The set of elements of ''B'' that are integral over ''A'' is called the integral closure of ''A'' in ''B''. It is a subring of ''B'' containing ''A''. If every element of ''B'' is integral over ''A'', then we say that ''B'' is integral over ''A'', or equivalently ''B'' is an integral extension of ''A''. If ''A'', ''B'' are fields, then the notions of "integral over" and of an "integral extension" are precisely " algebraic over" and "algebraic extensions" in field theory (since the root of any polynomial is the root of a monic polynomial). The case of greatest interest in number theory is that of complex numbers integral over Z (e.g., \sqrt or 1+i); in this context, the integral elements are usu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finitely Generated Algebra
In mathematics, a finitely generated algebra (also called an algebra of finite type) is a commutative associative algebra ''A'' over a field ''K'' where there exists a finite set of elements ''a''1,...,''a''''n'' of ''A'' such that every element of ''A'' can be expressed as a polynomial in ''a''1,...,''a''''n'', with coefficients in ''K''. Equivalently, there exist elements a_1,\dots,a_n\in A s.t. the evaluation homomorphism at =(a_1,\dots,a_n) :\phi_\colon K _1,\dots,X_ntwoheadrightarrow A is surjective; thus, by applying the first isomorphism theorem, A \simeq K _1,\dots,X_n(\phi_). Conversely, A:= K _1,\dots,X_nI for any ideal I\subset K _1,\dots,X_n/math> is a K-algebra of finite type, indeed any element of A is a polynomial in the cosets a_i:=X_i+I, i=1,\dots,n with coefficients in K. Therefore, we obtain the following characterisation of finitely generated K-algebras :A is a finitely generated K-algebra if and only if it is isomorphic to a quotient ring of the type K _1,\do ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Group
Finite is the opposite of infinite. It may refer to: * Finite number (other) * Finite set, a set whose cardinality (number of elements) is some natural number * Finite verb, a verb form that has a subject, usually being inflected or marked for person and/or tense or aspect * "Finite", a song by Sara Groves from the album '' Invisible Empires'' See also * * Nonfinite (other) Nonfinite is the opposite of finite * a nonfinite verb is a verb that is not capable of serving as the main verb in an independent clause * a non-finite clause In linguistics, a non-finite clause is a dependent or embedded clause that represen ... {{disambiguation fr:Fini it:Finito ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hilbert's Fourteenth Problem
In mathematics, Hilbert's fourteenth problem, that is, number 14 of Hilbert's problems proposed in 1900, asks whether certain algebras are finitely generated. The setting is as follows: Assume that ''k'' is a field and let ''K'' be a subfield of the field of rational functions in ''n'' variables, :''k''(''x''1, ..., ''x''''n'' ) over ''k''. Consider now the ''k''-algebra ''R'' defined as the intersection : R:= K \cap k _1, \dots, x_n\ . Hilbert conjectured that all such algebras are finitely generated over ''k''. Some results were obtained confirming Hilbert's conjecture in special cases and for certain classes of rings (in particular the conjecture was proved unconditionally for ''n'' = 1 and ''n'' = 2 by Zariski in 1954). Then in 1959 Masayoshi Nagata found a counterexample to Hilbert's conjecture. The counterexample of Nagata is a suitably constructed ring of invariants for the action of a linear algebraic group. History The problem originally arose in algebraic invari ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
