学习 Galois 理论须知的群论概念
内容节选自 from J. Rotman’s Galois Theory - Appendix 1. 仅供学习时备忘使用.
Abelian Group. A group in which multiplication is commutative.
Alternating Group An. The subgroup of Sn consisting of all the even permutations. it has order 12n!.
Associativity. For all x,y,z, one has (xy)z=x(yz). it follows that one does not need parentheses for any product of three or more factors.
Automorphism. An isomorphism of a group with itself.
Commutativity. For all x,y, one has xy=yx.
Conjugate Elements. Two elements x and y in a group G are called conjugate if there exists g∈G with y=gxg−1.
Conjugate Subgroup. Two subgroup H and K of a group G are called conjugate if there exists g∈G with
K = gHg^{-1}=\left{ghg^{-1}:h\in H\right}.
Coset of H in G. A subset of G of the form gH=\left{gh:h\in H\right}, where H is a subgroup of G and g∈G. All the cosets of H partition G; moreover, gH=g′H if and only if g−1g′∈H.
Cyclic Group. A group G which contains an element g (called a \textit{generator}) such that every element of G is some power of G.
Dihedral Group D2n. A Group of order 2n containing an element a of order n and an element b of order 2 such that bab=a−1.
Even Permutation. A permutation that is a product of an even number of transpositions. Every r-cycle, for r odd, is an even permutation.
Factor Group. Given a normal series G=G0⊃G1⊃⋯⊃Gn=1, its factor group are the groups Gi/Gi+1 for i⩾0.
Four Group V. The subgroup of S4 consisting of
1,(12)(34),(13)(24),(14)(23),
it is a normal subgroup.
Generator of a Cyclic Group G. An element g∈G whose powers give all the elements of G. A cyclic group may have seveal different generators.
Group. A set equipped with an associative multiplication such that there is a unique e∈G (called the identity of G) with ex=x=xe for all x∈G, and , for each x∈G, there is a unique y∈G (called the inverse of x) with yx=x=xy. One usually denotes e by 1 and y by x−1. (Some of these axioms are redundant.)
Homomorphism. A function f:G→H, where G and H are groups, such that f(xy)=f(x)f(y) for all x,y∈G. One always has f(1)=1 and f(x−1)=f(x)−1.
Image. Given a homomorphism f:G→H, its image Im(f) is the subgroup of H consisting of all f(x) for x∈G.
Index [G:H]. The number of (left) cosets of a subgroup H in G. It is equal to |G|/|H| when G is finite.
Isomorphism. A homomorphism that is bijection.
Kernel. Given a homomorphism f:G→H, its kernel Ker(f) is the (necessarily) normal subgroup of G consisting of all x∈G with f(x)=1. One denotes this by H⊲G.
Natural Map. if H is a normal subgroup of G, then the natural map is the homomorphism π:G→G/H defined by π(x)=xH.
Normal Series of G. A sequence of subgroups
G=G0⊃g1⊃⋯⊃Gn=1
with each Gi+1 a normal subgroup of Gi. (A subgroup Gi may not be a normal subgroup of G.)
Normal Subgroup. A subgroup H of a group G such that for all g∈G,
gHg−1=ghg−1:h∈H=H.
Order of an Element x∈G. The least positive integer m, if any, such that xm=1, otherwise infinity.
Order |G| of a group G. The number of elements in G.
p-group. A group in which every element has order some power of the prime p. if G is finite, the |G| is a power of p.
Permutation. A bijection of a set to itself; all the permutation of a set X form a group under composition, denoted by SX.
Quotient Group G/H. If H is a normal subgroup of G, then G/H is the family of all cosets gH of H with multiplication defined by
gHg′H=gg′H;
the order of G/H is [G:H]; the identity element is 1H=H; the inverse of gH is g′H.
Simple Group G. A group G≠1 whose only normal subgroups are 1 and G.
Solvable Group. A group having a normal series with abelian factor groups.
Subgroup H of G. A subset of G containing 1 which is closed under multiplication and inverse.
Subgroup Generated by a Subset X. The smallest subgroup of G containing X, denoted by ⟨X⟩, consists of all the products xa1xb2⋯xzn, where xi∈X and the exponents a,b,⋯,z±1.
Sylow p-subgroup of a Finite Group G. A subgroup of G of order pn, where pn is the highest power of p dividing |G|. Such subgroups always exist, and any two such are conjugate, hence isomorphic.
Symmetric Group Sn. The group of all permutations of 1,2,⋯,n under composition; it has order n!.
学习 Galois 理论须知的群论概念
未找到相关的 Issues 进行评论
请联系 @zengfk 初始化创建