DOCSLIB.ORG

Modular Representation Theory

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Modular Representation Theory Modular representation theory 1 Denitions for the study group Denition 1.1. Let A be a ring and let FA be the category of all left A-modules. The Grothendieck group of FA is the abelian group dened by generators and relations as follows: 1. Generators [E] for E 2 FA. 0 00 0 00 0 00 2. Relations: for E; E ;E 2 FA if 0 ! E ! E ! E ! 0, then [E ] = [E] + [E ]. Denition 1.2. A left A-module P is called projective if any of the following hold: 1. There exists a free A-module F such that F = P ⊕ Q for Q 2 FA 2. P 9! ~ E / E0 / 0 3. The functor HomA(P; −) is exact. Denition 1.3. An A-module homomorphism f : M ! M 0 is called essential if f(M) = M 0 and f(M 00) 6= M 0 for any proper submodule M 00 ⊆ M. Denition 1.4. The projective envelope of a module M is a projective module P and an essential homomorphism f : P ! M. Setup Let G be a nite group, K be a complete eld of characteristic 0 with a discrete valuation v, with residue eld k of characteristic > 0. Let A be the ring of integers of K. We are going to look at K[G]; k[G]and A[G]. Denition 1.5. Let L be a eld, denote by RL(G) the Grothendieck group of nitely generated L[G]-modules. 0 0 We make it into a ring by setting [E] · [E ] = [E ⊗L E ]. Let SL be the set of isomorphism classes of simple L[G]-modules. Proposition 1.6. The element of SL form a basis for RL[G]. Denition 1.7. Let Pk[G] be the Grothendieck ring of the category of left k[G]-modules which are projective. Let PA[G] be the Grothendieck ring of the category of the left A[G]-modules which are projective. Fact. Any k[G]-module has a projective envelope If E; P are k[G]-modules and P is projective, then E ⊗k P is also projective ) we have an action of Rk[G] on Pk[G]. Proposition 1.8. Each projective k[G]-module can be written uniquely as a direct sum of indecomposable projective k[G]-modules Let P and P 0 be projective k[G]-modules, then they are isomorphic if and only if [P ] = [P 0]. 1 Dualities: Let be -modules. Set (i.e, ). This is E; F K[G] hE; F i = dim HomG(E; F ) h ; i : RK [G] × RK [G] ! Z bilinear with respect to short exact sequences. ( 0 E =6∼ E0 Proposition 1.9. If E; E0 2 S then hE; E0i = . K ∼ 0 dE = dim EndG(E) E = E Denition 1.10. Say E is absolutely simple if dE = 1. We dene by . Since is projective, is h ; i : Pk[G] × Rk[G] ! Z (E; F ) 7! hE; F i = dim HomG(E; F ) E h ; i bilinear. 0 0 0 Proposition 1.11. If E; E 2 Sk then HomG(PE;E ) = HomG(E; E ). ( 0 E =6∼ E0 If E; E0 2 S then hP ;E0i = k E ∼ 0 dE E = E Proposition 1.12. Let K be suciently large such that k contains all m-th roots of unity (m = lcm(jgj)g2G). Then dE = 1 for E 2 Sk and hence h ; i is non-degenerate and the base [E] ; [PE] are dual to each other. 2 The cde Triangle We will want to dene three maps for the following triangle to commute c Pk(G) / Rk(G) O d e $ RK (G) Denition 2.1. Cartan Homomorphism. To each k[G]-module P , we associate the class of P , [P ] in Rk(G). We get a homomorphism c : Pk(G) ! Rk(G). We express c in terms of the canonical basis [PS]; [S] for S 2 Sk (basis for Pk(G) and Rk(G) respectively). We obtain a square matrix C, of type Sk × Sk, the Cartan Matrix of G with respect to k. The (S; T ) coecient, CST of C is the number of times that S appears in a composition series of the projective envelope PT of T . X [PT ] = CST [S] in Rk(G) S2Sk Denition 2.2. Decomposition Homomorphism. Let E be a K[G]-module. Choose a lattice E1 in E (nitely generated A-module which generates E as a K-module). We may assume that E1 is G-stable (replace E1 by the sum of its images under G). Denote the reduction E1 = E1=mE1, a k[G]-module. ∼ Theorem 2.3. The image E1 in Rk(G) is independent of the choice of E1. (Warning! You can have that E1 =6 E2 but with the same composition factors) Proof. Let E2 be another G-stable lattice, we want to show E1 = E2 in Rk(G). Replace E2 by a scalar multiple, n we may assume E2 ⊂ E1. There exists n ≥ 0 such that m E1 ⊂ E2 ⊂ E1. If n = 1, we have mE1 ⊂ E2 ⊂ E1. We have 0 ! E2=mE1 ! E1=mE1 ! E1=E2 ! 0 implies [E1=mE1] = [E2=mE1] + [E1=E2]. And 0 ! mE1=mE2 ! E2=mE2 ! E1=mE1 ! 0 implies [E2=mE2] = [mE1=mE2] + [E2=mE1]. But [mE1=mE2] = [E1=E2] hence [E1] = [E2]. This covers our base case. n−1 n−1 For general n, let E3 = m m + E2. We have m E1 ⊂ E3 ⊂ E1, mE3 ⊂ E2 ⊂ E3 ) [E2] = [E3] ) E1 = E2 = E3 2 The map E ! E1 extends to a ring homomorphism d : RK (G) ! Rk(G). The corresponding matrix is denoted D, type Sk × SK . For F 2 Sk;E 2 SK ;DFE is the number of times that F appears in the reduction mod m of E1 X E1 = DFE[F ] in Rk(G): F Denition 2.4. e. ∼ There exists a canonical isomorphism PA(G) ! Pk(G), i.e., • Let E be an A[G]-module, for E to be a projective A[G]-module then (only then) E is a to be free on A and E is a projective k[G]-module • If F is a projective k[G]-module, then there exists a unique (up to isomorphism) projective A[G]-module whose reduction modulo m is isomorphic to F . The functor tensor product with K denes a homomorphism from PA(G) into RK (G). Combining both, we get a map e : Pk(G) ! RK (G) and an associated matrix E of type SK × Sk. 2.1 Basic properties of cde triangle 1. Commutativity: c = d ◦ e, i.e., C = DE 2. d and e are adjoint of one another with respect to bilinear forms on Rk(G);Pk(G). I.e., pick x 2 Pk(G) and then . y 2 RK (G) hx; d(y)ik = he(x); yiK Assume x = X where X is a projective A[G]-module, y = [K ⊗A Y ] where Y is an A[G]-module which is free. Then the A-module HG(X; Y ) is free. Let r be its rank: we have the canonical isomorphism K ⊗ HomG(X; Y ) = HomG(K ⊗ X; K ⊗ Y ) and k ⊗ HomG(X; Y ) = HomG(k ⊗ X; k ⊗ Y ). These both implies that . he(x); yiK = t = hx; d(y)ik 3. Assume that K is suciently large. The canonical bases of Pk(G) and Rk(G) are dual to each other with respect to . (Similarly and ) Hence can be identied with the transpose of . h ; ik RK (G);RK (G) h ; iK e d E = tD, C = DE ) C is symmetric. 3 Examples Notation. • K is a complete eld • A is the valuation ring of K, m its maximal ideal • k the residue eld of K, with characteristic p • K is suciently large, that is µn ⊆ K with n = lcmg2G(o(g)) We have the cde triangle c Pk(G) / Rk(G) O d e $ RK (G) • c : P ! [P ] • d : E ! E1 = E1=mE1 where E1 is a stable lattice in E under G • e: is the inverse of the canonical isomorphism PA(G) ! Pk(G) tensor with K Denition 3.1. A projective envelope P of a L[G] module M is a projective module P with an essential homo- morphism. 3 3.1 Example, p0-groups Proposition 3.2. Assume that the order of G is coprime to p. Then 1. Each k[G]-module (respectively each A-free A[G]-module) is projective 2. The operation of reduction mod m denes a bijection between SK and Sk 3. If we identify SK with Sk, then C; D; E are all identity matrices. Proof. 1. Let E be an A-free A[G]-module, then there is a free A[G]-module L such that E is L=R. Since E is A-free there exists a A-linear projection π of L onto R. If g = #G, we know gcd(g; p) = 1, hence we can replace with 1 P −1 and we get an -projection. By the fact -linear projection and the fact that π g s2G sπs A[G] A[G] L=R =∼ E, we get that E is projective. Moreover C = Id 2. and 3. Let E 2 Sk, the projective envelope E1 of E relative to A[G] is a projective A[G]-module, whose reduction E1 = E1=mE1 is E. If F = K ⊗ E1, then d([F ]) = [E]. Since E is simple, that implies that F is simple, thus F 2 SK . So, we obtain a map E ! F of Sk to SK which is the inverse of d.
Load more

Recommended publications
  • REPRESENTATIONS of FINITE GROUPS 1. Definition And
    REPRESENTATIONS OF FINITE GROUPS 1. Definition and Introduction 1.1. Definitions. Let V be a vector space over the field C of complex numbers and let GL(V ) be the group of isomorphisms of V onto itself. An element a of GL(V ) is a linear mapping of V into V which has a linear inverse a−1. When V has dimension n and has n a finite basis (ei)i=1, each map a : V ! V is defined by a square matrix (aij) of order n. The coefficients aij are complex numbers. They are obtained by expressing the image a(ej) in terms of the basis (ei): X a(ej) = aijei: i Remark 1.1. Saying that a is an isomorphism is equivalent to saying that the determinant det(a) = det(aij) of a is not zero. The group GL(V ) is thus identified with the group of invertible square matrices of order n. Suppose G is a finite group with identity element 1. A representation of a finite group G on a finite-dimensional complex vector space V is a homomorphism ρ : G ! GL(V ) of G to the group of automorphisms of V . We say such a map gives V the structure of a G-module. The dimension V is called the degree of ρ. Remark 1.2. When there is little ambiguity of the map ρ, we sometimes call V itself a representation of G. In this vein we often write gv_ or gv for ρ(g)v. Remark 1.3. Since ρ is a homomorphism, we have equality ρ(st) = ρ(s)ρ(t) for s; t 2 G: In particular, we have ρ(1) = 1; ; ρ(s−1) = ρ(s)−1: A map ' between two representations V and W of G is a vector space map ' : V ! W such that ' V −−−−! W ? ? g? ?g (1.1) y y V −−−−! W ' commutes for all g 2 G.
    [Show full text]
  • NOTES on FINITE GROUP REPRESENTATIONS in Fall 2020, I
    NOTES ON FINITE GROUP REPRESENTATIONS CHARLES REZK In Fall 2020, I taught an undergraduate course on abstract algebra. I chose to spend two weeks on the theory of complex representations of finite groups. I covered the basic concepts, leading to the classification of representations by characters. I also briefly addressed a few more advanced topics, notably induced representations and Frobenius divisibility. I'm making the lectures and these associated notes for this material publicly available. The material here is standard, and is mainly based on Steinberg, Representation theory of finite groups, Ch 2-4, whose notation I will mostly follow. I also used Serre, Linear representations of finite groups, Ch 1-3.1 1. Group representations Given a vector space V over a field F , we write GL(V ) for the group of bijective linear maps T : V ! V . n n When V = F we can write GLn(F ) = GL(F ), and identify the group with the group of invertible n × n matrices. A representation of a group G is a homomorphism of groups φ: G ! GL(V ) for some representation choice of vector space V . I'll usually write φg 2 GL(V ) for the value of φ on g 2 G. n When V = F , so we have a homomorphism φ: G ! GLn(F ), we call it a matrix representation. matrix representation The choice of field F matters. For now, we will look exclusively at the case of F = C, i.e., representations in complex vector spaces. Remark. Since R ⊆ C is a subfield, GLn(R) is a subgroup of GLn(C).
    [Show full text]
  • Molecular Symmetry
    Molecular Symmetry Symmetry helps us understand molecular structure, some chemical properties, and characteristics of physical properties (spectroscopy) – used with group theory to predict vibrational spectra for the identification of molecular shape, and as a tool for understanding electronic structure and bonding. Symmetrical : implies the species possesses a number of indistinguishable configurations. 1 Group Theory : mathematical treatment of symmetry. symmetry operation – an operation performed on an object which leaves it in a configuration that is indistinguishable from, and superimposable on, the original configuration. symmetry elements – the points, lines, or planes to which a symmetry operation is carried out. Element Operation Symbol Identity Identity E Symmetry plane Reflection in the plane σ Inversion center Inversion of a point x,y,z to -x,-y,-z i Proper axis Rotation by (360/n)° Cn 1. Rotation by (360/n)° Improper axis S 2. Reflection in plane perpendicular to rotation axis n Proper axes of rotation (C n) Rotation with respect to a line (axis of rotation). •Cn is a rotation of (360/n)°. •C2 = 180° rotation, C 3 = 120° rotation, C 4 = 90° rotation, C 5 = 72° rotation, C 6 = 60° rotation… •Each rotation brings you to an indistinguishable state from the original. However, rotation by 90° about the same axis does not give back the identical molecule. XeF 4 is square planar. Therefore H 2O does NOT possess It has four different C 2 axes. a C 4 symmetry axis. A C 4 axis out of the page is called the principle axis because it has the largest n . By convention, the principle axis is in the z-direction 2 3 Reflection through a planes of symmetry (mirror plane) If reflection of all parts of a molecule through a plane produced an indistinguishable configuration, the symmetry element is called a mirror plane or plane of symmetry .
    [Show full text]
  • Groups for Which It Is Easy to Detect Graphical Regular Representations
    CC Creative Commons ADAM Logo Also available at http://adam-journal.eu The Art of Discrete and Applied Mathematics nn (year) 1–x Groups for which it is easy to detect graphical regular representations Dave Witte Morris , Joy Morris Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta. T1K 3M4, Canada Gabriel Verret Department of Mathematics, The University of Auckland, Private Bag 92019, Auckland 1142, New Zealand Received day month year, accepted xx xx xx, published online xx xx xx Abstract We say that a finite group G is DRR-detecting if, for every subset S of G, either the Cayley digraph Cay(G; S) is a digraphical regular representation (that is, its automorphism group acts regularly on its vertex set) or there is a nontrivial group automorphism ' of G such that '(S) = S. We show that every nilpotent DRR-detecting group is a p-group, but that the wreath product Zp o Zp is not DRR-detecting, for every odd prime p. We also show that if G1 and G2 are nontrivial groups that admit a digraphical regular representation and either gcd jG1j; jG2j = 1, or G2 is not DRR-detecting, then the direct product G1 × G2 is not DRR-detecting. Some of these results also have analogues for graphical regular representations. Keywords: Cayley graph, GRR, DRR, automorphism group, normalizer Math. Subj. Class.: 05C25,20B05 1 Introduction All groups and graphs in this paper are finite. Recall [1] that a digraph Γ is said to be a digraphical regular representation (DRR) of a group G if the automorphism group of Γ is isomorphic to G and acts regularly on the vertex set of Γ.
    [Show full text]
  • The Conjugate Dimension of Algebraic Numbers
    THE CONJUGATE DIMENSION OF ALGEBRAIC NUMBERS NEIL BERRY, ARTURAS¯ DUBICKAS, NOAM D. ELKIES, BJORN POONEN, AND CHRIS SMYTH Abstract. We find sharp upper and lower bounds for the degree of an algebraic number in terms of the Q-dimension of the space spanned by its conjugates. For all but seven nonnegative integers n the largest degree of an algebraic number whose conjugates span a vector space of dimension n is equal to 2nn!. The proof, which covers also the seven exceptional cases, uses a result of Feit on the maximal order of finite subgroups of GLn(Q); this result depends on the classification of finite simple groups. In particular, we construct an algebraic number of degree 1152 whose conjugates span a vector space of dimension only 4. We extend our results in two directions. We consider the problem when Q is replaced by an arbitrary field, and prove some general results. In particular, we again obtain sharp bounds when the ground field is a finite field, or a cyclotomic extension Q(!`) of Q. Also, we look at a multiplicative version of the problem by considering the analogous rank problem for the multiplicative group generated by the conjugates of an algebraic number. 1. Introduction Let Q be an algebraic closure of the field Q of rational numbers, and let α 2 Q. Let α1; : : : ; αd 2 Q be the conjugates of α over Q, with α1 = α. Then d equals the degree d(α) := [Q(α): Q], the dimension of the Q-vector space spanned by the powers of α. In contrast, we define the conjugate dimension n = n(α) of α as the dimension of the Q-vector space spanned by fα1; : : : ; αdg.
    [Show full text]
  • 3. Topological K-Theory Shortly After Grothendieck Introduced K0(X)
    3. Topological K-theory Shortly after Grothendieck introduced K0(X) for an algebraic variety X, M. Atiyah and F. Hirzebrch introduced the analogous theory for topological spaces ∗ [2] based on topological vector bundles. We consider this theory Ktop(−) for two reasons: first, the theory developed by Atiyah and Hirzebruch has been a model for 40 years of effort in algebraic K-theory, effort that has recently produced significant advances; second, topological K-theory of the underlying analytic space of a com- plex variety X, Xan, provides a much more computable theory to which algebraic K-theory maps. A (complex) topological vector bundle of rank r, p : E → T , on a space T is a continuous map with fibers each given the structure of a complex vector space of dimension r such that there is an open covering {Ui ⊂ T } with the property that r ∼ there exist homeomorphisms φi : C ×Ui → E|Ui over Ui which are C-linear on each fiber. One readily verifies that such a topological vector bundle p : E → T , on T of rank r determines and is determined by patching data: a collection of continuous, fiber-wise linear homemorphisms for each i, j −1 r r φj ◦ φi = θi,j : C × (Ui ∩ Uj) ' (E|Ui )Uj = (E|Uj )Ui ' C × (Ui ∩ Uj). This in turn is equivalent to a 1-cocycle 1 {θi,j ∈ Mapscont(Ui,j, GL(r, C))} ∈ Z (T, GL(r, C)). Indeed, two such 1-cocycles determine isomorphic topological vector bundles if and only if they differ by a co-boundary. Thus, the topological vector bundles on T of rank r are “classified” by H1(T, GL(r, C)).
    [Show full text]
  • GROUP REPRESENTATIONS and CHARACTER THEORY Contents 1
    GROUP REPRESENTATIONS AND CHARACTER THEORY DAVID KANG Abstract. In this paper, we provide an introduction to the representation theory of finite groups. We begin by defining representations, G-linear maps, and other essential concepts before moving quickly towards initial results on irreducibility and Schur's Lemma. We then consider characters, class func- tions, and show that the character of a representation uniquely determines it up to isomorphism. Orthogonality relations are introduced shortly afterwards. Finally, we construct the character tables for a few familiar groups. Contents 1. Introduction 1 2. Preliminaries 1 3. Group Representations 2 4. Maschke's Theorem and Complete Reducibility 4 5. Schur's Lemma and Decomposition 5 6. Character Theory 7 7. Character Tables for S4 and Z3 12 Acknowledgments 13 References 14 1. Introduction The primary motivation for the study of group representations is to simplify the study of groups. Representation theory offers a powerful approach to the study of groups because it reduces many group theoretic problems to basic linear algebra calculations. To this end, we assume that the reader is already quite familiar with linear algebra and has had some exposure to group theory. With this said, we begin with a preliminary section on group theory. 2. Preliminaries Definition 2.1. A group is a set G with a binary operation satisfying (1) 8 g; h; i 2 G; (gh)i = g(hi)(associativity) (2) 9 1 2 G such that 1g = g1 = g; 8g 2 G (identity) (3) 8 g 2 G; 9 g−1 such that gg−1 = g−1g = 1 (inverses) Definition 2.2.
    [Show full text]
  • Notes on Representations of Finite Groups
    NOTES ON REPRESENTATIONS OF FINITE GROUPS AARON LANDESMAN CONTENTS 1. Introduction 3 1.1. Acknowledgements 3 1.2. A first definition 3 1.3. Examples 4 1.4. Characters 7 1.5. Character Tables and strange coincidences 8 2. Basic Properties of Representations 11 2.1. Irreducible representations 12 2.2. Direct sums 14 3. Desiderata and problems 16 3.1. Desiderata 16 3.2. Applications 17 3.3. Dihedral Groups 17 3.4. The Quaternion group 18 3.5. Representations of A4 18 3.6. Representations of S4 19 3.7. Representations of A5 19 3.8. Groups of order p3 20 3.9. Further Challenge exercises 22 4. Complete Reducibility of Complex Representations 24 5. Schur’s Lemma 30 6. Isotypic Decomposition 32 6.1. Proving uniqueness of isotypic decomposition 32 7. Homs and duals and tensors, Oh My! 35 7.1. Homs of representations 35 7.2. Duals of representations 35 7.3. Tensors of representations 36 7.4. Relations among dual, tensor, and hom 38 8. Orthogonality of Characters 41 8.1. Reducing Theorem 8.1 to Proposition 8.6 41 8.2. Projection operators 43 1 2 AARON LANDESMAN 8.3. Proving Proposition 8.6 44 9. Orthogonality of character tables 46 10. The Sum of Squares Formula 48 10.1. The inner product on characters 48 10.2. The Regular Representation 50 11. The number of irreducible representations 52 11.1. Proving characters are independent 53 11.2. Proving characters form a basis for class functions 54 12. Dimensions of Irreps divide the order of the Group 57 Appendix A.
    [Show full text]
  • Representations, Character Tables, and One Application of Symmetry Chapter 4
    Representations, Character Tables, and One Application of Symmetry Chapter 4 Friday, October 2, 2015 Matrices and Matrix Multiplication A matrix is an array of numbers, Aij column columns matrix row matrix -1 4 3 1 1234 rows -8 -1 7 2 2141 3 To multiply two matrices, add the products, element by element, of each row of the first matrix with each column in the second matrix: 12 12 (1×1)+(2×3) (1×2)+(2×4) 710 × 34 34 = (3×1)+(4×3) (3×2)+(4×4) = 15 22 100 1 1 0-10× 2 = -2 002 3 6 Transformation Matrices Each symmetry operation can be represented by a 3×3 matrix that shows how the operation transforms a set of x, y, and z coordinates y Let’s consider C2h {E, C2, i, σh}: x transformation matrix C2 x’ = -x -1 0 0 x’ -1 0 0 x -x y’ = -y 0-10 y’ ==0-10 y -y z’ = z 001 z’ 001 z z new transformation old new in terms coordinates ==matrix coordinates of old transformation i matrix x’ = -x -1 0 0 x’ -1 0 0 x -x y’ = -y 0-10 y’ ==0-10 y -y z’ = -z 00-1 z’ 00-1z -z Representations of Groups The set of four transformation matrices forms a matrix representation of the C2h point group. 100 -1 0 0 -1 0 0 100 E: 010 C2: 0-10 i: 0-10 σh: 010 001 001 00-1 00-1 These matrices combine in the same way as the operations, e.g., -1 0 0 -1 0 0 100 C2 × C2 = 0-10 0-10= 010= E 001001 001 The sum of the numbers along each matrix diagonal (the character) gives a shorthand version of the matrix representation, called Γ: C2h EC2 i σh Γ 3-1-31 Γ (gamma) is a reducible representation b/c it can be further simplified.
    [Show full text]
  • Lecture Notes
    i Applications of Group Theory to the Physics of Solids M. S. Dresselhaus 8.510J 6.734J SPRING 2002 ii Contents 1 Basic Mathematical Background 1 1.1 De¯nition of a Group . 1 1.2 Simple Example of a Group . 2 1.3 Basic De¯nitions . 4 1.4 Rearrangement Theorem . 6 1.5 Cosets . 6 1.6 Conjugation and Class . 8 1.6.1 Self-Conjugate Subgroups . 9 1.7 Factor Groups . 10 1.8 Selected Problems . 11 2 Representation Theory 15 2.1 Important De¯nitions . 15 2.2 Matrices . 17 2.3 Irreducible Representations . 18 2.4 The Unitarity of Representations . 20 2.5 Schur's Lemma (Part I) . 23 2.6 Schur's Lemma (Part 2) . 24 2.7 Wonderful Orthogonality Theorem . 27 2.8 Representations and Vector Spaces . 30 2.9 Suggested Problems . 31 3 Character of a Representation 33 3.1 De¯nition of Character . 33 3.2 Characters and Class . 34 3.3 Wonderful Orthogonality Theorem for Character . 36 3.4 Reducible Representations . 38 iii iv CONTENTS 3.5 The Number of Irreducible Representations . 40 3.6 Second Orthogonality Relation for Characters . 41 3.7 Regular Representation . 43 3.8 Setting up Character Tables . 47 3.9 Symmetry Notation . 51 3.10 Selected Problems . 73 4 Basis Functions 75 4.1 Symmetry Operations and Basis Functions . 75 4.2 Basis Functions for Irreducible Representations . 77 ^(¡n) 4.3 Projection Operators Pkl . 82 ^(¡n) 4.4 Derivation of Pk` . 83 4.5 Projection Operations on an Arbitrary Function . 84 4.6 Linear Combinations for 3 Equivalent Atoms .
    [Show full text]
  • Grothendieck Ring of Varieties
    Neeraja Sahasrabudhe Grothendieck Ring of Varieties Thesis advisor: J. Sebag Université Bordeaux 1 1 Contents 1. Introduction 3 2. Grothendieck Ring of Varieties 5 2.1. Classical denition 5 2.2. Classical properties 6 2.3. Bittner's denition 9 3. Stable Birational Geometry 14 4. Application 18 4.1. Grothendieck Ring is not a Domain 18 4.2. Grothendieck Ring of motives 19 5. APPENDIX : Tools for Birational geometry 20 Blowing Up 21 Resolution of Singularities 23 6. Glossary 26 References 30 1. Introduction First appeared in a letter of Grothendieck in Serre-Grothendieck cor- respondence (letter of 16/8/64), the Grothendieck ring of varieties is an interesting object lying at the heart of the theory of motivic inte- gration. A class of variety in this ring contains a lot of geometric information about the variety. For example, the topological euler characteristic, Hodge polynomials, Stably-birational properties, number of points if the variety is dened on a nite eld etc. Besides, the question of equality of these classes has given some important new results in bira- tional geometry (for example, Batyrev-Kontsevich's theorem). The Grothendieck Ring K0(V ark) is the quotient of the free abelian group generated by isomorphism classes of k-varieties, by the relation [XnY ] = [X]−[Y ], where Y is a closed subscheme of X; the ber prod- 0 0 uct over k induces a ring structure dened by [X]·[X ] = [(X ×k X )red]. Many geometric objects verify this kind of relations. It gives many re- alization maps, called additive invariants, containing some geometric information about the varieties.
    [Show full text]
  • The Q-Conjugacy Character Table of Dihedral Groups
    ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS { N. 39{2018 (89{96) 89 THE Q-CONJUGACY CHARACTER TABLE OF DIHEDRAL GROUPS H. Shabani A. R. Ashrafi E. Haghi Department of Pure Mathematics Faculty of Mathematical Sciences University of Kashan P.O. Box 87317-53153 Kashan I.R. Iran M. Ghorbani∗ Department of Pure Mathematics Faculty of Sciences Shahid Rajaee Teacher Training University P.O. Box 16785-136 Tehran I.R. Iran [email protected] Abstract. In a seminal paper published in 1998, Shinsaku Fujita introduced the concept of Q-conjugacy character table of a finite group. He applied this notion to solve some problems in combinatorial chemistry. In this paper, the Q-conjugacy character table of dihedral groups is computed in general. As a consequence, Q- ∼ ∼ conjugacy character table of molecules with point group symmetries D = C = Dih , ∼ ∼ ∼ ∼ ∼ ∼ ∼ ∼3 3v∼ 6 D = D = C = Dih , D = C = Dih , D = D = D = C = Dih , 4 ∼ 2d ∼ 4v ∼ 8 5 ∼5v 10 ∼3d ∼3h 6 ∼6v 12 D2 = C2v = Z2 × Z2 = Dih2, D4d = Dih16, D5d = D5h = Dih20, D6d = Dih24 are computed, where Z2 denotes a cyclic group of order 2 and Dihn is the dihedral group of even order n. Keywords: Q-conjugacy character table, dihedral group, conjugacy class. 1. Introduction A representation of a group G is a homomorphism from G into the group of invertible operators of a vector space V . In this case, we can interpret each element of G as an invertible linear transformation V −! V . If n = dimV and fix a basis for V then we can construct an isomorphism between the set of all \invertible linear transformation V −! V " and the set of all \invertible n × n matrices".
    [Show full text]