DOCSLIB.ORG

Affine Symmetric Group Joel Brewster Lewis¹*

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Affine Symmetric Group Joel Brewster Lewis¹* WikiJournal of Science, 2021, 4(1):3 doi: 10.15347/wjs/2021.003 Encyclopedic Review Article Affine symmetric group Joel Brewster Lewis¹* Abstract The affine symmetric group is a mathematical structure that describes the symmetries of the number line and the regular triangular tesselation of the plane, as well as related higher dimensional objects. It is an infinite extension of the symmetric group, which consists of all permutations (rearrangements) of a finite set. In addition to its geo- metric description, the affine symmetric group may be defined as the collection of permutations of the integers (..., −2, −1, 0, 1, 2, ...) that are periodic in a certain sense, or in purely algebraic terms as a group with certain gen- erators and relations. These different definitions allow for the extension of many important properties of the finite symmetric group to the infinite setting, and are studied as part of the fields of combinatorics and representation theory. Definitions Non-technical summary The affine symmetric group, 푆̃푛, may be equivalently Flat, straight-edged shapes (like triangles) or 3D ones defined as an abstract group by generators and rela- (like pyramids) have only a finite number of symme- tions, or in terms of concrete geometric and combina- tries. In contrast, the affine symmetric group is a way to torial models. mathematically describe all the symmetries possible when an infinitely large flat surface is covered by trian- gular tiles. As with many subjects in mathematics, it can Algebraic definition also be thought of in a number of ways: for example, it In terms of generators and relations, 푆̃푛 is generated also describes the symmetries of the infinitely long by a set number line, or the possible arrangements of all inte- gers (..., −2, −1, 0, 1, 2, ...) with certain repetitive pat- 푠 , 푠 , … , 푠 0 1 푛−1 terns. As a result, studying the affine symmetric group of 푛 elements that satisfy the following relations: extends the study of symmetries of straight-edged when 푛 ≥ 3, shapes or of groups of permutations to the infinite case. 2 It also connects several topics in mathematics that 1. 푠푖 = 1 (the generators are involutions), were originally studied for independent reasons, rang- 2. 푠푖푠푗 = 푠푗푠푖 if 푗 is not one of 푖 − 1, 푖, 푖 + 1, and ing from complex reflection groups to juggling se- quences. 3. 푠푖푠푖+1푠푖 = 푠푖+1푠푖푠푖+1. In the relations above, indices are taken modulo n, so that the third relation includes as a particular case 푠0푠푛−1푠0 = 푠푛−1푠0푠푛−1. (The second and third relation are sometimes called the braid relations.) When 푛 = 2, the affine symmetric group 푆̃2 is the infinite dihedral group generated by two elements 푠0, 푠1 subject only to 2 2 [1] the relations 푠0 = 푠1 = 1. This definition endows 푆̃푛 with the structure of a Coxe- ter group, with the 푠푖 as Coxeter generating set. For 푛 ≥ 3, its Coxeter–Dynkin diagram is the 푛-cycle, while for 푛 = 2 it consists of two nodes joined by an edge labeled ∞.[2] 1 George Washington University Figure 1 | Dynkin diagrams for the affine symmetric groups on *Author correspondence: [email protected] 2 and more than 2 generators ORCID: 0000-0003-0205-8049 Licensed under: CC-BY Received 06-06-2020; accepted 21-04-2021 1 of 11 | WikiJournal of Science WikiJournal of Science, 2021, 4(1):3 doi: 10.15347/wjs/2021.003 Encyclopedic Review Article Geometric definition 푛 In the Euclidean space ℝ with coordinates (푥1, … , 푥푛), the set 푉 of points that satisfy the equation 푥1 + 푥2 + ⋯ + 푥푛 = 0 forms a (hyper)plane (an (푛 − 1)-dimen- sional subspace). For every pair of distinct elements 푖 and 푗 of {1, … , 푛} and every integer 푘, the set of points in 푉 that satisfy 푥푖 − 푥푗 = 푘 forms a plane in 푉, and there is a unique reflection of 푉 that fixes this plane. Then the affine symmetric group can be realized geo- metrically as the collection of all maps from 푉 to itself that arise by composing several of these reflections.[3] Inside 푉, the type 퐴 root lattice Λ is the subset of points with integer coordinates, that is, it is the set of all the integer vectors (푎1, … , 푎푛) such that 푎1 + ⋯ + 푎푛 = 0. Each of the reflections preserves this lattice, and so the lattice is preserved by the whole group. In fact, one may Figure 2 | When 푛 = 3, the space V is a two-dimensional ̃ define 푆푛 to be the group of rigid transformations of 푉 plane and the reflections are across lines. The points of the that preserve the lattice Λ. type A root lattice are circled. These reflecting planes divide the space 푉 into congru- ent simplicies, called alcoves.[4] The situation when 푛 = with tuples [푢(1), … , 푢(푛)] of integers that contain one 3 is shown at right; in this case, the root lattice is a tri- element from each congruence class modulo 푛 and sum angular lattice, and the reflecting lines divide the plane to 1 + 2 + ⋯ + 푛.[5] into equilateral triangular alcoves. (For larger 푛, the al- To translate between the combinatorial and algebraic coves are not regular simplices.) definitions, for 푖 = 1, … , 푛 − 1 one may identify the To translate between the geometric and algebraic defi- Coxeter generator 푠푖 with the affine permutation that nitions, fix an alcove and consider the 푛 hyperplanes has window notation [1, 2, … , 푖 − 1, 푖 + 1, 푖, 푖 + that form its boundary. For example, there is a unique 2, … , 푛], and also identify the generator 푠0 = 푠푛 with alcove (the fundamental alcove) consisting of points the affine permutation [0, 2, 3, … , 푛 − 2, 푛 − 1, 푛 + 1]. (푥1, … , 푥푛) such that 푥1 ≥ 푥2 ≥ ⋯ ≥ 푥푛 ≥ 푥1 − 1, More generally, every reflection (that is, a conjugate of which is bounded by the hyperplanes 푥1 − 푥2 = 0, 푥2 − 푥3 = 0, ..., and 푥1 − 푥푛 = 1. (This is illustrated in the case 푛 = 3 at right.) For 푖 = 1, … , 푛 − 1, one may iden- tify the reflection through 푥푖 − 푥푖+1 = 0 with the Coxeter generator 푠푖, and also identify the reflection through 푥1 − 푥푛 = [4] 1 with the generator 푠0 = 푠푛. Combinatorial definition The affine symmetric group may be real- ized as a group of periodic permutations of the integers. In particular, say that a bi- jection 푢: ℤ → ℤ is an affine permutation if 푢(푥 + 푛) = 푢(푥) + 푛 for all integers 푥 and 푢(1) + 푢(2) + ⋯ + 푢(푛) = 1 + 2 + ⋯ + 푛. (It is a consequence of the first property that the numbers 푢(1), … , 푢(푛) must all be distinct modulo 푛.) Such a function is uniquely determined by its win- dow notation [푢(1), … , 푢(푛)], and so af- Figure 3 | Reflections and alcoves for the affine symmetric group. The funda- fine permutations may also be identified mental alcove is shaded. 2 of 11 | WikiJournal of Science WikiJournal of Science, 2021, 4(1):3 doi: 10.15347/wjs/2021.003 Encyclopedic Review Article one of the Coxeter generators) can be described combinatorially it corresponds to the window notations uniquely as follows: for distinct integers 푖, 푗 in {1, … , 푛} for which {푢(1), … , 푢(푛)} = {1, 2, … , 푛} (that is, in and arbitrary integer 푘, it maps 푖 to 푗 − 푘푛, maps 푗 to 푖 + which the window notation is the one-line notation of a 푘푛, and fixes all inputs not congruent to 푖 or 푗 modulo finite permutation).[8][3] 푛.[6] (In terms of the geometric definition, this corre- If u = [푢(1), 푢(2), … , 푢(푛)] is the window notation of sponds to the reflection across the plane 푥 − 푥 = 푘. 푖 푗 an element of this standard copy of 푆 ⊂ 푆̃ , its action The correspondence between the geometric and com- 푛 푛 on the hyperplane 푉 in ℝ푛 is given by permutation of binatorial representations for other elements is dis- coordinates: (푥 , 푥 , … , 푥 ) ⋅ 푢 = (푥 , 푥 , … , 푥 ). cussed below.) 1 2 푛 푢(1) 푢(2) 푢(푛) (In this article, the geometric action of permutations and affine permutations is on the right; thus, if 푢 and 푣 Representation as matrices are two affine permutations, the action of 푢푣 on a point One may represent affine permutations as infinite peri- is given by first applying 푢, then applying 푣.) odic permutation matrices.[7] If 푢: ℤ → ℤ is an affine per- There are also many nonstandard copies of 푆푛 con- mutation, one places the entry 1 at position (푖, 푢(푖)) in tained in 푆̃푛. A geometric construction is to pick any the infinite grid ℤ × ℤ for each integer 푖, and all other point 푎 in Λ (that is, an integer vector whose coordi- entries are equal to 0. Since 푢 is a bijection, the resulting nates sum to 0); the subgroup (푆̃푛) of 푆̃푛 of isometries matrix contains exactly one 1 in every row and column. 푎 that fix 푎 is isomorphic to 푆 . The analogous combina- The periodicity condition on the map 푢 ensures that the 푛 torial construction is to choose any subset 퐴 of ℤ that entry at position (푎, 푏) is equal to the entry at position contains one element from each conjugacy class mod- (푎 + 푛, 푏 + 푛) for every pair of integers (푎, 푏). For ex- ulo 푛 and whose elements sum to 1 + 2 + ⋯ + 푛; the ample, a portion of matrix for the affine permutation subgroup (푆̃푛) of 푆̃푛 of affine permutations that stabi- [2, 0, 4] ∈ 푆̃3 is shown below, with the conventions that 1s are replaced by •, 0s are omitted, rows numbers in- lize 퐴 is isomorphic to 푆푛.
Load more

Recommended publications
  • 3.4 Finite Reflection Groups In
    Chapter 3 Equations of order 2 This chapter is mostly devoted to Fuchsian equations L(y)=0oforder2.For these equations we shall describe all finite monodromy groups that are possible. In particular we discuss the projective monodromy groups of dimension 2. Most of the theory we give is based on the work of Felix Klein and of G.C. Shephard and J.A. Todd. Unless stated otherwise we let L(y)=0beaFuchsiandifferential equation order 2, with differentiation with respect to the variable z. 3.1 Finite subgroups of PGL(2, C) Any Fuchsian differential equation with a basis of algebraic solutions has a finite monodromy group, (and vice versa, see Theorem 2.1.8). In particular this is the case for second order Fuchsian equations, to which we restrict ourselves for now. The monodromy group for such an equation is contained in GL(2, C). Any subgroup G ⊂ GL(2, C) acts on the Riemann sphere P1. More specifically, a matrix γ ∈ GL(2, C)with ab γ := cd has an action on C defined as at + b γ ∗ t := . (3.1) ct + d for all appropriate t ∈ C. The action is extended to P1 by γ ∗∞ = a/c in the case of ac =0and γ ∗ (−d/c)=∞ when c is non-zero. The action of G on P1 factors through to the projective group PG ⊂ PGL(2, C). In other words we have the well-defined action PG : P1 → P1 γ · ΛI2 : t → γ ∗ t. 39 40 Chapter 3. Equations of order 2 PG name |PG| Cm Cyclic group m Dm Dihedral group 2m A4 Tetrahedral group 12 (Alternating group on 4 elements) S4 Octahedral group 24 (Symmetric group on 4 elements) A5 Icosahedral group 60 (Alternating group on 5 elements) Table 3.1: The finite subgroups of PGL(2, C).
    [Show full text]
  • Affine Partitions and Affine Grassmannians
    AFFINE PARTITIONS AND AFFINE GRASSMANNIANS SARA C. BILLEY AND STEPHEN A. MITCHELL Abstract. We give a bijection between certain colored partitions and the elements in the quotient of an affine Weyl group modulo its Weyl group. By Bott’s formula these colored partitions give rise to some partition identities. In certain types, these identities have previously appeared in the work of Bousquet-Melou-Eriksson, Eriksson-Eriksson and Reiner. In other types the identities appear to be new. For type An, the affine colored partitions form another family of combinatorial objects in bijection with n + 1-core parti- tions and n-bounded partitions. Our main application is to characterize the rationally smooth Schubert varieties in the affine Grassmannians in terms of affine partitions and a generalization of Young’s lattice which refines weak order and is a subposet of Bruhat order. Several of the proofs are computer assisted. 1. Introduction Let W be a finite irreducible Weyl group associated to a simple connected compact Lie Group G, and let Wf be its associated affine Weyl group. In analogy with the Grassmannian manifolds in classical type A, the quotient Wf /W is the indexing set for the Schubert varieties in the affine Grassmannians LG. Let WfS be the minimal length coset representatives for Wf /W . Much of the geometry and topology for the affine Grassmannians can be studied from the combinatorics of WfS and vice versa. For example, Bott [6] showed that the Poincar´eseries for the cohomology ring for the affine Grassmannian is equal to the length generating function for WfS, and this series can be written in terms of the exponents e1, e2, .
    [Show full text]
  • On Stochastic Distributions and Currents
    NISSUNA UMANA INVESTIGAZIONE SI PUO DIMANDARE VERA SCIENZIA S’ESSA NON PASSA PER LE MATEMATICHE DIMOSTRAZIONI LEONARDO DA VINCI vol. 4 no. 3-4 2016 Mathematics and Mechanics of Complex Systems VINCENZO CAPASSO AND FRANCO FLANDOLI ON STOCHASTIC DISTRIBUTIONS AND CURRENTS msp MATHEMATICS AND MECHANICS OF COMPLEX SYSTEMS Vol. 4, No. 3-4, 2016 dx.doi.org/10.2140/memocs.2016.4.373 ∩ MM ON STOCHASTIC DISTRIBUTIONS AND CURRENTS VINCENZO CAPASSO AND FRANCO FLANDOLI Dedicated to Lucio Russo, on the occasion of his 70th birthday In many applications, it is of great importance to handle random closed sets of different (even though integer) Hausdorff dimensions, including local infor- mation about initial conditions and growth parameters. Following a standard approach in geometric measure theory, such sets may be described in terms of suitable measures. For a random closed set of lower dimension with respect to the environment space, the relevant measures induced by its realizations are sin- gular with respect to the Lebesgue measure, and so their usual Radon–Nikodym derivatives are zero almost everywhere. In this paper, how to cope with these difficulties has been suggested by introducing random generalized densities (dis- tributions) á la Dirac–Schwarz, for both the deterministic case and the stochastic case. For the last one, mean generalized densities are analyzed, and they have been related to densities of the expected values of the relevant measures. Ac- tually, distributions are a subclass of the larger class of currents; in the usual Euclidean space of dimension d, currents of any order k 2 f0; 1;:::; dg or k- currents may be introduced.
    [Show full text]
  • GROUP ACTIONS 1. Introduction the Groups Sn, An, and (For N ≥ 3)
    GROUP ACTIONS KEITH CONRAD 1. Introduction The groups Sn, An, and (for n ≥ 3) Dn behave, by their definitions, as permutations on certain sets. The groups Sn and An both permute the set f1; 2; : : : ; ng and Dn can be considered as a group of permutations of a regular n-gon, or even just of its n vertices, since rigid motions of the vertices determine where the rest of the n-gon goes. If we label the vertices of the n-gon in a definite manner by the numbers from 1 to n then we can view Dn as a subgroup of Sn. For instance, the labeling of the square below lets us regard the 90 degree counterclockwise rotation r in D4 as (1234) and the reflection s across the horizontal line bisecting the square as (24). The rest of the elements of D4, as permutations of the vertices, are in the table below the square. 2 3 1 4 1 r r2 r3 s rs r2s r3s (1) (1234) (13)(24) (1432) (24) (12)(34) (13) (14)(23) If we label the vertices in a different way (e.g., swap the labels 1 and 2), we turn the elements of D4 into a different subgroup of S4. More abstractly, if we are given a set X (not necessarily the set of vertices of a square), then the set Sym(X) of all permutations of X is a group under composition, and the subgroup Alt(X) of even permutations of X is a group under composition. If we list the elements of X in a definite order, say as X = fx1; : : : ; xng, then we can think about Sym(X) as Sn and Alt(X) as An, but a listing in a different order leads to different identifications 1 of Sym(X) with Sn and Alt(X) with An.
    [Show full text]
  • SOME ALGEBRAIC DEFINITIONS and CONSTRUCTIONS Definition
    SOME ALGEBRAIC DEFINITIONS AND CONSTRUCTIONS Definition 1. A monoid is a set M with an element e and an associative multipli- cation M M M for which e is a two-sided identity element: em = m = me for all m M×. A−→group is a monoid in which each element m has an inverse element m−1, so∈ that mm−1 = e = m−1m. A homomorphism f : M N of monoids is a function f such that f(mn) = −→ f(m)f(n) and f(eM )= eN . A “homomorphism” of any kind of algebraic structure is a function that preserves all of the structure that goes into the definition. When M is commutative, mn = nm for all m,n M, we often write the product as +, the identity element as 0, and the inverse of∈m as m. As a convention, it is convenient to say that a commutative monoid is “Abelian”− when we choose to think of its product as “addition”, but to use the word “commutative” when we choose to think of its product as “multiplication”; in the latter case, we write the identity element as 1. Definition 2. The Grothendieck construction on an Abelian monoid is an Abelian group G(M) together with a homomorphism of Abelian monoids i : M G(M) such that, for any Abelian group A and homomorphism of Abelian monoids−→ f : M A, there exists a unique homomorphism of Abelian groups f˜ : G(M) A −→ −→ such that f˜ i = f. ◦ We construct G(M) explicitly by taking equivalence classes of ordered pairs (m,n) of elements of M, thought of as “m n”, under the equivalence relation generated by (m,n) (m′,n′) if m + n′ = −n + m′.
    [Show full text]
  • An Exploration of the Relationship Between Mathematics and Music
    An Exploration of the Relationship between Mathematics and Music Shah, Saloni 2010 MIMS EPrint: 2010.103 Manchester Institute for Mathematical Sciences School of Mathematics The University of Manchester Reports available from: http://eprints.maths.manchester.ac.uk/ And by contacting: The MIMS Secretary School of Mathematics The University of Manchester Manchester, M13 9PL, UK ISSN 1749-9097 An Exploration of ! Relation"ip Between Ma#ematics and Music MATH30000, 3rd Year Project Saloni Shah, ID 7177223 University of Manchester May 2010 Project Supervisor: Professor Roger Plymen ! 1 TABLE OF CONTENTS Preface! 3 1.0 Music and Mathematics: An Introduction to their Relationship! 6 2.0 Historical Connections Between Mathematics and Music! 9 2.1 Music Theorists and Mathematicians: Are they one in the same?! 9 2.2 Why are mathematicians so fascinated by music theory?! 15 3.0 The Mathematics of Music! 19 3.1 Pythagoras and the Theory of Music Intervals! 19 3.2 The Move Away From Pythagorean Scales! 29 3.3 Rameau Adds to the Discovery of Pythagoras! 32 3.4 Music and Fibonacci! 36 3.5 Circle of Fifths! 42 4.0 Messiaen: The Mathematics of his Musical Language! 45 4.1 Modes of Limited Transposition! 51 4.2 Non-retrogradable Rhythms! 58 5.0 Religious Symbolism and Mathematics in Music! 64 5.1 Numbers are God"s Tools! 65 5.2 Religious Symbolism and Numbers in Bach"s Music! 67 5.3 Messiaen"s Use of Mathematical Ideas to Convey Religious Ones! 73 6.0 Musical Mathematics: The Artistic Aspect of Mathematics! 76 6.1 Mathematics as Art! 78 6.2 Mathematical Periods! 81 6.3 Mathematics Periods vs.
    [Show full text]
  • 18.703 Modern Algebra, Permutation Groups
    5. Permutation groups Definition 5.1. Let S be a set. A permutation of S is simply a bijection f : S −! S. Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S. (2) Let f be a permutation of S. Then the inverse of f is a permu­ tation of S. Proof. Well-known. D Lemma 5.3. Let S be a set. The set of all permutations, under the operation of composition of permutations, forms a group A(S). Proof. (5.2) implies that the set of permutations is closed under com­ position of functions. We check the three axioms for a group. We already proved that composition of functions is associative. Let i: S −! S be the identity function from S to S. Let f be a permutation of S. Clearly f ◦ i = i ◦ f = f. Thus i acts as an identity. Let f be a permutation of S. Then the inverse g of f is a permutation of S by (5.2) and f ◦ g = g ◦ f = i, by definition. Thus inverses exist and G is a group. D Lemma 5.4. Let S be a finite set with n elements. Then A(S) has n! elements. Proof. Well-known. D Definition 5.5. The group Sn is the set of permutations of the first n natural numbers. We want a convenient way to represent an element of Sn. The first way, is to write an element σ of Sn as a matrix.
    [Show full text]
  • Mathematics of the Rubik's Cube
    Mathematics of the Rubik's cube Associate Professor W. D. Joyner Spring Semester, 1996{7 2 \By and large it is uniformly true that in mathematics that there is a time lapse between a mathematical discovery and the moment it becomes useful; and that this lapse can be anything from 30 to 100 years, in some cases even more; and that the whole system seems to function without any direction, without any reference to usefulness, and without any desire to do things which are useful." John von Neumann COLLECTED WORKS, VI, p. 489 For more mathematical quotes, see the first page of each chapter below, [M], [S] or the www page at http://math.furman.edu/~mwoodard/mquot. html 3 \There are some things which cannot be learned quickly, and time, which is all we have, must be paid heavily for their acquiring. They are the very simplest things, and because it takes a man's life to know them the little new that each man gets from life is very costly and the only heritage he has to leave." Ernest Hemingway (From A. E. Hotchner, PAPA HEMMINGWAY, Random House, NY, 1966) 4 Contents 0 Introduction 13 1 Logic and sets 15 1.1 Logic................................ 15 1.1.1 Expressing an everyday sentence symbolically..... 18 1.2 Sets................................ 19 2 Functions, matrices, relations and counting 23 2.1 Functions............................. 23 2.2 Functions on vectors....................... 28 2.2.1 History........................... 28 2.2.2 3 × 3 matrices....................... 29 2.2.3 Matrix multiplication, inverses.............. 30 2.2.4 Muliplication and inverses...............
    [Show full text]
  • Permutation Group and Determinants (Dated: September 16, 2021)
    Permutation group and determinants (Dated: September 16, 2021) 1 I. SYMMETRIES OF MANY-PARTICLE FUNCTIONS Since electrons are fermions, the electronic wave functions have to be antisymmetric. This chapter will show how to achieve this goal. The notion of antisymmetry is related to permutations of electrons’ coordinates. Therefore we will start with the discussion of the permutation group and then introduce the permutation-group-based definition of determinant, the zeroth-order approximation to the wave function in theory of many fermions. This definition, in contrast to that based on the Laplace expansion, relates clearly to properties of fermionic wave functions. The determinant gives an N-particle wave function built from a set of N one-particle waves functions and is called Slater’s determinant. II. PERMUTATION (SYMMETRIC) GROUP Definition of permutation group: The permutation group, known also under the name of symmetric group, is the group of all operations on a set of N distinct objects that order the objects in all possible ways. The group is denoted as SN (we will show that this is a group below). We will call these operations permutations and denote them by symbols σi. For a set consisting of numbers 1, 2, :::, N, the permutation σi orders these numbers in such a way that k is at jth position. Often a better way of looking at permutations is to say that permutations are all mappings of the set 1, 2, :::, N onto itself: σi(k) = j, where j has to go over all elements. Number of permutations: The number of permutations is N! Indeed, we can first place each object at positions 1, so there are N possible placements.
    [Show full text]
  • MTH 620: 2020-04-28 Lecture
    MTH 620: 2020-04-28 lecture Alexandru Chirvasitu Introduction In this (last) lecture we'll mix it up a little and do some topology along with the homological algebra. I wanted to bring up the cohomology of profinite groups if only briefly, because we discussed these in MTH619 in the context of Galois theory. Consider this as us connecting back to that material. 1 Topological and profinite groups This is about the cohomology of profinite groups; we discussed these briefly in MTH619 during Fall 2019, so this will be a quick recollection. First things first though: Definition 1.1 A topological group is a group G equipped with a topology, such that both the multiplication G × G ! G and the inverse map g 7! g−1 are continuous. Unless specified otherwise, all of our topological groups will be assumed separated (i.e. Haus- dorff) as topological spaces. Ordinary, plain old groups can be regarded as topological groups equipped with the discrete topology (i.e. so that all subsets are open). When I want to be clear we're considering plain groups I might emphasize that by referring to them as `discrete groups'. The main concepts we will work with are covered by the following two definitions (or so). Definition 1.2 A profinite group is a compact (and as always for us, Hausdorff) topological group satisfying any of the following equivalent conditions: Q G embeds as a closed subgroup into a product i2I Gi of finite groups Gi, equipped with the usual product topology; For every open neighborhood U of the identity 1 2 G there is a normal, open subgroup N E G contained in U.
    [Show full text]
  • Arxiv:2011.03427V2 [Math.AT] 12 Feb 2021 Riae Fmp Ffiiest.W Eosrt Hscategor This Demonstrate We Sets
    HYPEROCTAHEDRAL HOMOLOGY FOR INVOLUTIVE ALGEBRAS DANIEL GRAVES Abstract. Hyperoctahedral homology is the homology theory associated to the hyperoctahe- dral crossed simplicial group. It is defined for involutive algebras over a commutative ring using functor homology and the hyperoctahedral bar construction of Fiedorowicz. The main result of the paper proves that hyperoctahedral homology is related to equivariant stable homotopy theory: for a discrete group of odd order, the hyperoctahedral homology of the group algebra is isomorphic to the homology of the fixed points under the involution of an equivariant infinite loop space built from the classifying space of the group. Introduction Hyperoctahedral homology for involutive algebras was introduced by Fiedorowicz [Fie, Sec- tion 2]. It is the homology theory associated to the hyperoctahedral crossed simplicial group [FL91, Section 3]. Fiedorowicz and Loday [FL91, 6.16] had shown that the homology theory constructed from the hyperoctahedral crossed simplicial group via a contravariant bar construc- tion, analogously to cyclic homology, was isomorphic to Hochschild homology and therefore did not detect the action of the hyperoctahedral groups. Fiedorowicz demonstrated that a covariant bar construction did detect this action and sketched results connecting the hyperoctahedral ho- mology of monoid algebras and group algebras to May’s two-sided bar construction and infinite loop spaces, though these were never published. In Section 1 we recall the hyperoctahedral groups. We recall the hyperoctahedral category ∆H associated to the hyperoctahedral crossed simplicial group. This category encodes an involution compatible with an order-preserving multiplication. We introduce the category of involutive non-commutative sets, which encodes the same information by adding data to the preimages of maps of finite sets.
    [Show full text]
  • 10 Heat Equation: Interpretation of the Solution
    Math 124A { October 26, 2011 «Viktor Grigoryan 10 Heat equation: interpretation of the solution Last time we considered the IVP for the heat equation on the whole line u − ku = 0 (−∞ < x < 1; 0 < t < 1); t xx (1) u(x; 0) = φ(x); and derived the solution formula Z 1 u(x; t) = S(x − y; t)φ(y) dy; for t > 0; (2) −∞ where S(x; t) is the heat kernel, 1 2 S(x; t) = p e−x =4kt: (3) 4πkt Substituting this expression into (2), we can rewrite the solution as 1 1 Z 2 u(x; t) = p e−(x−y) =4ktφ(y) dy; for t > 0: (4) 4πkt −∞ Recall that to derive the solution formula we first considered the heat IVP with the following particular initial data 1; x > 0; Q(x; 0) = H(x) = (5) 0; x < 0: Then using dilation invariance of the Heaviside step function H(x), and the uniquenessp of solutions to the heat IVP on the whole line, we deduced that Q depends only on the ratio x= t, which lead to a reduction of the heat equation to an ODE. Solving the ODE and checking the initial condition (5), we arrived at the following explicit solution p x= 4kt 1 1 Z 2 Q(x; t) = + p e−p dp; for t > 0: (6) 2 π 0 The heat kernel S(x; t) was then defined as the spatial derivative of this particular solution Q(x; t), i.e. @Q S(x; t) = (x; t); (7) @x and hence it also solves the heat equation by the differentiation property.
    [Show full text]