DOCSLIB.ORG

Symmetry Symmetry LAVAL LAVAL ININI ININI ININI ININI B D P Q

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Symmetry Symmetry LAVAL LAVAL ININI ININI ININI ININI B D P Q symmetry symmetry LAVAL LAVAL ININI ININI ININI ININI b d p q Dyslexia… β δ π θ • Symmetry: • From greak (sun) ‘’with" (metron) "measure" • Same etymology as "commensurate" • Until mid-XIX: only mirror symmetry Definitions • Transformation, Group • Évariste Galois 1811, 1832. Symmetry: Property of invariance of an objet under a space transformation Transformation • Bijection which maps a geometric set in itself M f(M)=M’ • Affine transformation defined by P, P’ and O such that: f(M) = P’ + O(PM) & x'# &a# &txx t yx tzx #& x# P’ $ ! $ ! $ !$ ! P P $ y'! = $b! + $txy t yy tzy !$ y! f : positions $ z'! $ c ! $t t t !$ z ! % " % " % xz yz zz "% " O : vectors Affine transformation preserves lines, planes, parallelism • Translation: O identity P’ P P • Homothety: O(PM)=k.PM P P • (also): Homothety in one direction P P • Isometry: preserves distances P P • Simililarity: preserves ratios P P Translation • Infinite periodic lattices Homothety • Self-similar objects • Infinite fractals Similitude Infinite fractal Logarithmic spiral (r=aebθ) θ -> θ+θ’ r -> re-bθ’ -bθ’ e θ’ Isometries f(M) = P’ + O(PM) • Isometry ||O(u)||=||u|| distance-preserving map • Two types of isometry: • Affine isometry: f(M) • Transforms points. • Microscopic properties of crystals (electronic structure) • Translation • Helix of pitch P • Rotations • Reflections (α, Pα /2π) • Linear isometry O(PM) • Transforms vectors (directions) • Macroscopic properties of crystals (response functions) 60° • Rotations E ? • Reflections Linear isometry- 2D ||O(u)|| = ||u|| • In the plane (2D) • Rotations • Reflections (reflections by an axis) θ θ/2 &cosθ − sinθ # &cos θ sinθ # $ ! $ ! % sinθ cosθ " % sinθ − cosθ " • Determinant +1 • Determinant -1 • Eigenvalues eiθ, e-iθ • Eigenvalues -1, 1 Linear isometry - 3D • ||O(u)|| = |λ| ||u|| Eigenvalues |λ | = 1 • In space (3D) : • λ : 3rd degree equation (real coefficients) ±1, eiθ, e-iθ (det. = ± 1) • det. = 1 • det. = -1 • Direct symmetry • Indirect symmetry Rotations Rotoreflections a) Rotation by angle θ θ θ b) Roto-reflection θ Improper rotation c) Inversion (π) θ d) Roto-inversion (π+θ ) c) Reflection (0) Stereographic projection • To represent directions preserves angles on the sphere NN Direction OM M P’ O P P’ M’ P P, projection of OM : Intersection of SM and equator S • Conform transformation (preserves angles locally) but not affine Main symmetry operations • Conventionally • Direct • Rotations (A ) n • n-fold rotation An (2π/n) • Reflections (M) • Represented by a polygon of same symmetry. • Inversion (C)_ • Rotoinversion (An) . A2 vertical A2 horizontal A3 A4 A5 • Indirect ~ • Rotoreflections (An) • Symmetry element • Reflection (M) • Locus of invariant points • Inversion (C) _ • Rotoinversions (An) . M vertical M horizontal M Inversion A4 Difficulties… • Some symmetry are not intuitive • Reflection (mirrors) • Rotoinversion ‘’The ambidextrous universe’’ Why do mirrors reverse left and right but not top and bottom Composition of symmetries • Two reflections with angle α = rotation 2α M M’M=A 2α M’ α • Euler construction A AN3 N2 AN1 π/N2 π/N1 Composition of two rotations = rotation AN2AN1=AN3 • No relation between N1, N2 et N3 Point group: definition • The set of symmetries of an object forms a group G • A and B ⊂ G, AB ⊂ G (closure) • Associativity (AB)C=A(BC) 1 2 • Identity element E (1-fold rotation) • Invertibility A, A-1 ≠ • No commutativity in general (rotation 3D) 2 1 • Example: point groupe of a rectangular table (2mm) Mx * E Mx My A2 E E Mx My A2 My Mx Mx E A2 My My My A2 E Mx A2 A2 A2 My Mx E • Multiplicity: number of elements 2mm Composition of rotations Constraints AN2 AN1 AN3 π/N2 π/N1 234 Spherical triangle, angles verifies: π π π 1 1 1 + + > π + + >1 N1 N2 N3 N1 N2 N3 22N (N>2), 233, 234, 235 Dihedral groups Multiaxial groups Points groups ... groups Monoclinic Triclinic Cubic Orthorhombic Trigonal Hexagonal Tetragonal Curie’s An • Sorted by 1 2 3 4 6 ∞ Symmetry degree An A2 • Curie‘s limit groups 222 32 422 622 ∞ 2 _ An • Chiral, propers _ _ _ _ _ 1 2=m 3 4 6=3/m • Impropers ∞ An /M /m • Centrosymmetric 2/m 4/m 6/m An M 2mm 3m 4mm 6mm ∞ m _ An M _ _ _ _ _ 3m 42m (4m2) 62m (6m2) ∞/mm An /MM’ mmm 4/ mmm 6/ mmm An A n’ 23 432 ∞ ∞ _ An A n’ _ _ _ m3 43m m3m ∞ /m∞ /m 23 432 532 _ _ _ __ m3 43m m3m 53m Tétraèdre Octaèdre Icosaèdre Cube Dodécaèdre Multiaxial groups Points group: Notations • Hermann-Mauguin (International notation - 1935) • Generators (not minimum) • Symmetry directions • Reflection ( - ): defined by the normal to the plane Primary Direction: higher-order symmetry Secondary directions : lower-order 4 2 2 Notation 4 m m m m m réduite m Tertiary directions : lowest-order • Schönflies : Cn, Dn, Dnh Les 7 groupes limites de Pierre Curie Rotating cone axial + polar vectors ∞ Twisted cylindre Axial tensor order 2 ∞ 2 Rotating cylinder axial vector (H) ∞ /m Cone Polar vector (E, F) ∞ m Cylindrer Polar tensor ordre 2 (susceptibility) ∞ /mm Chiral sphere Axial scalar (chiralité) ∞ ∞ Sphere Polar scalar (pression, masse) ∞ /m∞ /m Definitions Symmetric : Invariant under at least two transformations Asymmetric: Invariant under one transformation. Dissymmetric: Lost of symmetry… .
Load more

Recommended publications
  • LINEAR ALGEBRA METHODS in COMBINATORICS László Babai
    LINEAR ALGEBRA METHODS IN COMBINATORICS L´aszl´oBabai and P´eterFrankl Version 2.1∗ March 2020 ||||| ∗ Slight update of Version 2, 1992. ||||||||||||||||||||||| 1 c L´aszl´oBabai and P´eterFrankl. 1988, 1992, 2020. Preface Due perhaps to a recognition of the wide applicability of their elementary concepts and techniques, both combinatorics and linear algebra have gained increased representation in college mathematics curricula in recent decades. The combinatorial nature of the determinant expansion (and the related difficulty in teaching it) may hint at the plausibility of some link between the two areas. A more profound connection, the use of determinants in combinatorial enumeration goes back at least to the work of Kirchhoff in the middle of the 19th century on counting spanning trees in an electrical network. It is much less known, however, that quite apart from the theory of determinants, the elements of the theory of linear spaces has found striking applications to the theory of families of finite sets. With a mere knowledge of the concept of linear independence, unexpected connections can be made between algebra and combinatorics, thus greatly enhancing the impact of each subject on the student's perception of beauty and sense of coherence in mathematics. If these adjectives seem inflated, the reader is kindly invited to open the first chapter of the book, read the first page to the point where the first result is stated (\No more than 32 clubs can be formed in Oddtown"), and try to prove it before reading on. (The effect would, of course, be magnified if the title of this volume did not give away where to look for clues.) What we have said so far may suggest that the best place to present this material is a mathematics enhancement program for motivated high school students.
    [Show full text]
  • Symmetry and Tensors Rotations and Tensors
    Symmetry and tensors Rotations and tensors A rotation of a 3-vector is accomplished by an orthogonal transformation. Represented as a matrix, A, we replace each vector, v, by a rotated vector, v0, given by multiplying by A, 0 v = Av In index notation, 0 X vm = Amnvn n Since a rotation must preserve lengths of vectors, we require 02 X 0 0 X 2 v = vmvm = vmvm = v m m Therefore, X X 0 0 vmvm = vmvm m m ! ! X X X = Amnvn Amkvk m n k ! X X = AmnAmk vnvk k;n m Since xn is arbitrary, this is true if and only if X AmnAmk = δnk m t which we can rewrite using the transpose, Amn = Anm, as X t AnmAmk = δnk m In matrix notation, this is t A A = I where I is the identity matrix. This is equivalent to At = A−1. Multi-index objects such as matrices, Mmn, or the Levi-Civita tensor, "ijk, have definite transformation properties under rotations. We call an object a (rotational) tensor if each index transforms in the same way as a vector. An object with no indices, that is, a function, does not transform at all and is called a scalar. 0 A matrix Mmn is a (second rank) tensor if and only if, when we rotate vectors v to v , its new components are given by 0 X Mmn = AmjAnkMjk jk This is what we expect if we imagine Mmn to be built out of vectors as Mmn = umvn, for example. In the same way, we see that the Levi-Civita tensor transforms as 0 X "ijk = AilAjmAkn"lmn lmn 1 Recall that "ijk, because it is totally antisymmetric, is completely determined by only one of its components, say, "123.
    [Show full text]
  • Properties of the Single and Double D4d Groups and Their Isomorphisms with D8 and C8v Groups A
    Properties of the single and double D4d groups and their isomorphisms with D8 and C8v groups A. Le Paillier-Malécot, L. Couture To cite this version: A. Le Paillier-Malécot, L. Couture. Properties of the single and double D4d groups and their isomorphisms with D8 and C8v groups. Journal de Physique, 1981, 42 (11), pp.1545-1552. 10.1051/jphys:0198100420110154500. jpa-00209347 HAL Id: jpa-00209347 https://hal.archives-ouvertes.fr/jpa-00209347 Submitted on 1 Jan 1981 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. J. Physique 42 (1981) 1545-1552 NOVEMBRE 1981, 1545 Classification Physics Abstracts 75.10D Properties of the single and double D4d groups and their isomorphisms with D8 and C8v groups A. Le Paillier-Malécot Laboratoire de Magnétisme et d’Optique des Solides, 1, place A.-Briand, 92190 Meudon Bellevue, France and Université de Paris-Sud XI, Centre d’Orsay, 91405 Orsay Cedex, France and L. Couture Laboratoire Aimé-Cotton (*), C.N.R.S., Campus d’Orsay, 91405 Orsay Cedex, France and Laboratoire d’Optique et de Spectroscopie Cristalline, Université Pierre-et-Marie-Curie, Paris VI, 75230 Paris Cedex 05, France (Reçu le 15 mai 1981, accepté le 9 juillet 1981) Résumé.
    [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]
  • Chapter 1 – Symmetry of Molecules – P. 1
    Chapter 1 – Symmetry of Molecules – p. 1 - 1. Symmetry of Molecules 1.1 Symmetry Elements · Symmetry operation: Operation that transforms a molecule to an equivalent position and orientation, i.e. after the operation every point of the molecule is coincident with an equivalent point. · Symmetry element: Geometrical entity (line, plane or point) which respect to which one or more symmetry operations can be carried out. In molecules there are only four types of symmetry elements or operations: · Mirror planes: reflection with respect to plane; notation: s · Center of inversion: inversion of all atom positions with respect to inversion center, notation i · Proper axis: Rotation by 2p/n with respect to the axis, notation Cn · Improper axis: Rotation by 2p/n with respect to the axis, followed by reflection with respect to plane, perpendicular to axis, notation Sn Formally, this classification can be further simplified by expressing the inversion i as an improper rotation S2 and the reflection s as an improper rotation S1. Thus, the only symmetry elements in molecules are Cn and Sn. Important: Successive execution of two symmetry operation corresponds to another symmetry operation of the molecule. In order to make this statement a general rule, we require one more symmetry operation, the identity E. (1.1: Symmetry elements in CH4, successive execution of symmetry operations) 1.2. Systematic classification by symmetry groups According to their inherent symmetry elements, molecules can be classified systematically in so called symmetry groups. We use the so-called Schönfliess notation to name the groups, Chapter 1 – Symmetry of Molecules – p. 2 - which is the usual notation for molecules.
    [Show full text]
  • Symmetry in Chemistry
    SYMMETRY IN CHEMISTRY Professor MANOJ K. MISHRA CHEMISTRY DEPARTMENT IIT BOMBAY ACKNOWLEGDEMENT: Professor David A. Micha Professor F. A. Cotton 1 An introduction to symmetry analysis WHY SYMMETRY ? Hψ = Eψ For H – atom: Each member of the CSCO labels, For molecules: Symmetry operation R CSCO H is INVARIANT under R ( by definition too) 2 An introduction to symmetry analysis Hψ = Eψ gives NH3 normal modes = NH3 rotation or translation MUST be A1, A2 or E ! NO ESCAPING SYMMETRY! 3 Molecular Symmetry An introduction to symmetry analysis (Ref.: Inorganic chemistry by Shirver, Atkins & Longford, ELBS) One aspect of the shape of a molecule is its symmetry (we define technical meaning of this term in a moment) and the systematic treatment and symmetry uses group theory. This is a rich and powerful subject, by will confine our use of it at this stage to classifying molecules and draw some general conclusions about their properties. An introduction to symmetry analysis Our initial aim is to define the symmetry of molecules much more precisely than we have done so far, and to provide a notational scheme that confirms their symmetry. In subsequent chapters we extend the material present here to applications in bonding and spectroscopy, and it will become that symmetry analysis is one of the most pervasive techniques in inorganic chemistry. Symmetry operations and elements A fundamental concept of group theory is the symmetry operation. It is an action, such as a rotation through a certain angle, that leave molecules apparently unchanged. An example is the rotation of H2O molecule by 180 ° (but not any smaller angle) around the bisector of HOH angle.
    [Show full text]
  • Rotation Matrix - Wikipedia, the Free Encyclopedia Page 1 of 22
    Rotation matrix - Wikipedia, the free encyclopedia Page 1 of 22 Rotation matrix From Wikipedia, the free encyclopedia In linear algebra, a rotation matrix is a matrix that is used to perform a rotation in Euclidean space. For example the matrix rotates points in the xy -Cartesian plane counterclockwise through an angle θ about the origin of the Cartesian coordinate system. To perform the rotation, the position of each point must be represented by a column vector v, containing the coordinates of the point. A rotated vector is obtained by using the matrix multiplication Rv (see below for details). In two and three dimensions, rotation matrices are among the simplest algebraic descriptions of rotations, and are used extensively for computations in geometry, physics, and computer graphics. Though most applications involve rotations in two or three dimensions, rotation matrices can be defined for n-dimensional space. Rotation matrices are always square, with real entries. Algebraically, a rotation matrix in n-dimensions is a n × n special orthogonal matrix, i.e. an orthogonal matrix whose determinant is 1: . The set of all rotation matrices forms a group, known as the rotation group or the special orthogonal group. It is a subset of the orthogonal group, which includes reflections and consists of all orthogonal matrices with determinant 1 or -1, and of the special linear group, which includes all volume-preserving transformations and consists of matrices with determinant 1. Contents 1 Rotations in two dimensions 1.1 Non-standard orientation
    [Show full text]
  • Notes on Euclidean Geometry Kiran Kedlaya Based
    Notes on Euclidean Geometry Kiran Kedlaya based on notes for the Math Olympiad Program (MOP) Version 1.0, last revised August 3, 1999 c Kiran S. Kedlaya. This is an unfinished manuscript distributed for personal use only. In particular, any publication of all or part of this manuscript without prior consent of the author is strictly prohibited. Please send all comments and corrections to the author at [email protected]. Thank you! Contents 1 Tricks of the trade 1 1.1 Slicing and dicing . 1 1.2 Angle chasing . 2 1.3 Sign conventions . 3 1.4 Working backward . 6 2 Concurrence and Collinearity 8 2.1 Concurrent lines: Ceva’s theorem . 8 2.2 Collinear points: Menelaos’ theorem . 10 2.3 Concurrent perpendiculars . 12 2.4 Additional problems . 13 3 Transformations 14 3.1 Rigid motions . 14 3.2 Homothety . 16 3.3 Spiral similarity . 17 3.4 Affine transformations . 19 4 Circular reasoning 21 4.1 Power of a point . 21 4.2 Radical axis . 22 4.3 The Pascal-Brianchon theorems . 24 4.4 Simson line . 25 4.5 Circle of Apollonius . 26 4.6 Additional problems . 27 5 Triangle trivia 28 5.1 Centroid . 28 5.2 Incenter and excenters . 28 5.3 Circumcenter and orthocenter . 30 i 5.4 Gergonne and Nagel points . 32 5.5 Isogonal conjugates . 32 5.6 Brocard points . 33 5.7 Miscellaneous . 34 6 Quadrilaterals 36 6.1 General quadrilaterals . 36 6.2 Cyclic quadrilaterals . 36 6.3 Circumscribed quadrilaterals . 38 6.4 Complete quadrilaterals . 39 7 Inversive Geometry 40 7.1 Inversion .
    [Show full text]
  • A Short Math Guide
    University of Alabama Department of Physics and Astronomy PH 125 / LeClair Spring 2009 A Short Math Guide Contents 1 Coordinate systems 2 1.1 2D systems . 2 1.2 3D systems . 3 1.3 Rotation of coordinate systems . 3 1.3.1 Two dimensions . 3 1.3.2 Three dimensions . 6 1.3.3 Proper and Improper Rotations: Handedness . 6 2 Vectors 7 2.1 What is a vector? . 7 2.2 Representing vectors . 8 2.3 Adding vectors . 10 2.4 Unit vectors . 12 2.5 Scalar multiplication . 14 2.6 Scalar products . 15 2.7 Scalar Products of Unit Vectors . 16 2.8 Vector products . 17 2.9 Polar and Axial Vectors . 21 2.10 How Vectors Transform under Rotation, Inversion, and Translation . 23 3 Vector Calculus 24 3.1 Derivatives of unit vectors in non-cartesian systems . 24 3.2 Line, surface, and volume elements in different coordinate systems. 24 3.3 Partial Derivatives . 26 3.3.1 Example . 28 3.3.2 Tangents to 3D curves . 30 3.3.3 Equality of second-order partial derivatives . 30 3.3.4 Anti-partial-derivatives . 31 3.3.5 Common Notations . 32 3.4 The Gradient . 33 3.4.1 Vector Functions . 35 1 3.5 Divergence . 36 3.6 Curl . 36 4 Miscellaneous: Solving systems of linear equations 36 1 Coordinate systems Note that we use the convention that the cartesian unit vectors are x^, y^, and ^z, rather than ^{, ^|, and k^, using the substitutions x^ = ^{, y^ = ^|, and ^z = k^. 1.1 2D systems In two dimensions, commonly use two types of coordinate systems: cartesian (x−y) and polar (r−θ).
    [Show full text]
  • A Derivation of the 32 Crystallographic Point Groups Using Elementary
    American Mineralogist, Volwne 61, pages 145-165, 1976 A derivationof the 32 crystallographicpoint groupsusing elementary group theory MoNrn B. Borsnu.Jn., nNn G. V. Gtsss Virginia PolytechnicInstitute and State Uniuersity Blacksburg,Virginia 2406I Abstract A rigorous derivation of the 32 crystallographic point groups is presented.The derivation is designed for scientistswho wish to gain an appreciation of the group theoretical derivation but who do not wish to master the large number of specializedtopics used in other rigorous group theoreticalderivations. Introduction have appealedto a number of interestingalgorithms basedon various geometricand heuristic arguments This paper has two objectives.The first is the very to obtain the 32 crystallographicpoint groups.In this specificgoal of giving a complete and rigorous deri- paper we present a rigorous derivation of the 32 vation of the 32 crystallographicpoint groups with crystallographicpoint groups that usesonly the most emphasisplaced on making this paper as self-con- elementarynotions of group theory while still taking tained as possible.The second is the more general advantageof the power of the theory of groups. objective of presenting several concepts of modern The derivation given here was inspired by the dis- mathematics and their applicability to the study of cussionsgiven in Klein (1884),Weber (1896),Zas- crystallography.Throughout the paper we have at- senhaus(1949), and Weyl (1952).The mathematical tempted to present as much of the mathematical the- approach usedin their discussionsis a blend of group ory as possible,without resortingto long digressions, theory and the theory of the equivalencerelation' so that the reader with only a modest amount of Each of these mathematical concepts is described mathematical knowledge will be able to appreciate herein and is used in the ways suggestedby these the derivation.
    [Show full text]
  • Extension of Algorithmic Geometry to Fractal Structures Anton Mishkinis
    Extension of algorithmic geometry to fractal structures Anton Mishkinis To cite this version: Anton Mishkinis. Extension of algorithmic geometry to fractal structures. General Mathematics [math.GM]. Université de Bourgogne, 2013. English. NNT : 2013DIJOS049. tel-00991384 HAL Id: tel-00991384 https://tel.archives-ouvertes.fr/tel-00991384 Submitted on 15 May 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Thèse de Doctorat école doctorale sciences pour l’ingénieur et microtechniques UNIVERSITÉ DE BOURGOGNE Extension des méthodes de géométrie algorithmique aux structures fractales ■ ANTON MISHKINIS Thèse de Doctorat école doctorale sciences pour l’ingénieur et microtechniques UNIVERSITÉ DE BOURGOGNE THÈSE présentée par ANTON MISHKINIS pour obtenir le Grade de Docteur de l’Université de Bourgogne Spécialité : Informatique Extension des méthodes de géométrie algorithmique aux structures fractales Soutenue publiquement le 27 novembre 2013 devant le Jury composé de : MICHAEL BARNSLEY Rapporteur Professeur de l’Université nationale australienne MARC DANIEL Examinateur Professeur de l’école Polytech Marseille CHRISTIAN GENTIL Directeur de thèse HDR, Maître de conférences de l’Université de Bourgogne STEFANIE HAHMANN Examinateur Professeur de l’Université de Grenoble INP SANDRINE LANQUETIN Coencadrant Maître de conférences de l’Université de Bourgogne RONALD GOLDMAN Rapporteur Professeur de l’Université Rice ANDRÉ LIEUTIER Rapporteur “Technology scientific director” chez Dassault Systèmes Contents 1 Introduction 1 1.1 Context .
    [Show full text]
  • Group Theory
    Introduction to Group Theory with Applications in Molecular and Solid State Physics Karsten Horn Fritz-Haber-Institut der Max-Planck-Gesellschaft 030 8412 3100, e-mail [email protected] Symmetry - old concept, already known to Greek natural philosophy Group theory: mathematical theory, developed in 19th century Application to physics in the 1920’s : Bethe 1929, Wigner 1931, Kohlrausch 1935 Why apply group theory in physics? “It is often hard or even impossible to obtain a solution to the Schrödinger equation - however, a large part of qualitative results can be obtained by group theory. Almost all the rules of spectroscopy follow from the symmetry of a problem” E.Wigner, 1931 Outline 1. Symmetry elements and point groups 4.! Vibrations in molecules 1.1. Symmetry elements and operations 4.1. Number and symmetry of normal modes in ! molecules 1.2. Group concepts 4.2. Vibronic wave functions 1.3. Classification of point groups, including the Platonic Solids 4.3. IR and Raman selection rules 1.4. Finding the point group that a molecule belongs to 5.! Electron bands in solids 2.! Group representations 5.1. Symmetry properties of solids 2.1. An intuitive approach 5.2. Wave functions of energy bands 2.2. The great orthogonality theorem (GOT) 5.3. The group of the wave vector 2.3. Theorems about irreducible representations 5.4. Band degeneracy, compatibility 2.4. Basis functions 2.5. Relation between representation theory and quantum mechanics 2.6. Character tables and how to use them 2.7. Examples: symmetry of physical properties, tensor symmetries 3. ! Molecular Orbitals and Group Theory 3.1.
    [Show full text]