Lie Algebras and Representation Theory Homework 7

Similar documents
4: SINGLE-PERIOD MARKET MODELS

Notes on the symmetric group

Two-lit trees for lit-only sigma-game

Abstract Algebra Solution of Assignment-1

Algebra homework 8 Homomorphisms, isomorphisms

κ-bounded Exponential-Logarithmic Power Series Fields

maps 1 to 5. Similarly, we compute (1 2)(4 7 8)(2 1)( ) = (1 5 8)(2 4 7).

THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET

A relation on 132-avoiding permutation patterns

Laurence Boxer and Ismet KARACA

A Learning Theory of Ranking Aggregation

MATH 5510 Mathematical Models of Financial Derivatives. Topic 1 Risk neutral pricing principles under single-period securities models

3.2 No-arbitrage theory and risk neutral probability measure

Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF

COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS

Introduction to Greedy Algorithms: Huffman Codes

A Translation of Intersection and Union Types

Algebra and Number Theory Exercise Set

Gödel algebras free over finite distributive lattices

Quadrant marked mesh patterns in 123-avoiding permutations

THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES

Chapter 7 One-Dimensional Search Methods

A Property Equivalent to n-permutability for Infinite Groups

An effective perfect-set theorem

Permutation Factorizations and Prime Parking Functions

last problem outlines how the Black Scholes PDE (and its derivation) may be modified to account for the payment of stock dividends.

Non replication of options

Game Theory for Wireless Engineers Chapter 3, 4

CATEGORICAL SKEW LATTICES

3 The Model Existence Theorem

The finite lattice representation problem and intervals in subgroup lattices of finite groups

Congruence lattices of finite intransitive group acts

Another Variant of 3sat. 3sat. 3sat Is NP-Complete. The Proof (concluded)

More Advanced Single Machine Models. University at Buffalo IE661 Scheduling Theory 1

Financial Economics. Runs Test

Economics 101. Lecture 3 - Consumer Demand

ORDERED SEMIGROUPS HAVING THE P -PROPERTY. Niovi Kehayopulu, Michael Tsingelis

Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem

arxiv: v1 [math.lo] 24 Feb 2014

A1: American Options in the Binomial Model

TWO-PERIODIC TERNARY RECURRENCES AND THEIR BINET-FORMULA 1. INTRODUCTION

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program August 2017

SYLLABUS AND SAMPLE QUESTIONS FOR MSQE (Program Code: MQEK and MQED) Syllabus for PEA (Mathematics), 2013

A No-Arbitrage Theorem for Uncertain Stock Model

Laurence Boxer and Ismet KARACA

RUDIN-KEISLER POSETS OF COMPLETE BOOLEAN ALGEBRAS

Levin Reduction and Parsimonious Reductions

ABSTRACT GENERALIZING THE FUTURAMA THEOREM. The 2010 episode of Futurama titled The Prisoner of Benda centers

. COVERS OF D-TYPE ARTIN GROUPS. 1. Introduction

The (λ, κ)-fn and the order theory of bases in boolean algebras

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2017

Silver type theorems for collapses.

Chapter 4. Cardinal Arithmetic.

A Decentralized Learning Equilibrium

arxiv:math/ v1 [math.lo] 15 Jan 1991

CTL Model Checking. Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking!

Palindromic Permutations and Generalized Smarandache Palindromic Permutations

Research Article On Open-Open Games of Uncountable Length

Lecture 7: Bayesian approach to MAB - Gittins index

MAT25 LECTURE 10 NOTES. = a b. > 0, there exists N N such that if n N, then a n a < ɛ

INFLATION OF FINITE LATTICES ALONG ALL-OR-NOTHING SETS TRISTAN HOLMES J. B. NATION

Continuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals

Supplemental Materials for What is the Optimal Trading Frequency in Financial Markets? Not for Publication. October 21, 2016

Finite Memory and Imperfect Monitoring

More On λ κ closed sets in generalized topological spaces

Notes on Natural Logic

Practice Problems 1: Moral Hazard

Brownian Motion and Ito s Lemma

A Combinatorial Proof for the Circular Chromatic Number of Kneser Graphs

Limit Theorems for the Empirical Distribution Function of Scaled Increments of Itô Semimartingales at high frequencies

On the Number of Permutations Avoiding a Given Pattern

CS792 Notes Henkin Models, Soundness and Completeness

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2015

On the h-vector of a Lattice Path Matroid

Another Variant of 3sat

CHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n

MAT 4250: Lecture 1 Eric Chung

MAFS Computational Methods for Pricing Structured Products

Covering properties of derived models

Black-Scholes Model. Chapter Black-Scholes Model

Portfolio Choice. := δi j, the basis is orthonormal. Expressed in terms of the natural basis, x = j. x j x j,

Transcendental lattices of complex algebraic surfaces

κ-bounded Exponential-Logarithmic Power Series Fields

Wada s Representations of the. Pure Braid Group of High Degree

On Toponogov s Theorem

Option Pricing. 1 Introduction. Mrinal K. Ghosh

1. Introduction. As part of his study of functions defined on product spaces, M. Hušek introduced a family of diagonal conditions in a topological

Comparing Partial Rankings

AN INFINITE CARDINAL-VALUED KRULL DIMENSION FOR RINGS

Pakes (1986): Patents as Options: Some Estimates of the Value of Holding European Patent Stocks

Discrete Applied Mathematics

On generalized resolvents of symmetric operators of defect one with finitely many negative squares

INTRODUCTION TO ARBITRAGE PRICING OF FINANCIAL DERIVATIVES

The Correlation Smile Recovery

IEOR E4602: Quantitative Risk Management

1 Games in Strategic Form

1 Directed sets and nets

s: and

MODIFIED EXTENDER BASED FORCING

Measuring Interest Rates

Transcription:

Lie Algebras and Representation Theory Homework 7 Debbie Matthews 2015-05-19

Problem 10.5 If σ W can be written as a product of t simple reflections, prove that t has the same parity as l(σ). Let = {α 1, α 2,..., α l } be a base for some root system Φ. We write s i = σ αi W. Recall that each simple reflection s i permutes the positive roots except for α i. (Lemma B) This means we can consider each simple reflection as a signed permutation of the simple roots, where s i sends α i to it s negative and permutes all other simple roots without changing their sign. Now suppose σ = s a1 s a2 s at = s b1 s b2 s bp. Then s bp 1 s b2 s b1 s a1 s a2 s at = s bp. On the right side, we have only one negative object in the associated signed permutation. So that must also be the case on the left side. Then t + p 1 is odd by the above realization. Therefore, t + p is even. Hence any expression of σ as a product of simple reflections will have the same parity. In particular, that parity agrees with the length. 1

Problem 10.6 Define a function sn : W {±1} by sn(σ) = ( 1) l(σ). Prove that sn is a homomorphism. Given the previous problem, this is straightforward. For two elements σ, γ W, we know sn(σ)sn(γ) = ( 1) l(σ)+l(γ). At the same time, since σ can be written as a product of l(σ) simple reflections and γ can be written as a product of l(gamma) simple reflections, then we know σγ can be written as a product of l(σ) + l(γ) simple reflections. By the previous problem, l(σγ) will have the same parity as l(σ) + l(γ). Therefore, ( 1) (l(σ)+l(γ) = ( 1) l(σγ) = sn(σγ). Hence, sn(σ)sn(γ) = sn(σγ) and sn is a group homomorphism. 2

Problem 10.7 Prove that the intersection of positive open half-spaces associated with any basis γ 1,..., γ l of E is nonvoid. Let γ 1,..., γ t be a basis for E. Let δ i be the projection of γ i onto the orthogonal complement of the span of all basis vectors except γ i. Denote the span of all basis vectors except γ i by E i = span{γ 1,..., γ i,..., γ t }. Hence δ i E i. Consider γ = r i δ i for r i > 0. For each k, we have (γ k, γ) = (γ k, r i δ i ). But for i k we know (γ k, δ i ) = 0 since γ k E i and δ i E i. Thus (γ k, γ) = r k γ k > 0 and so the intersection fo the open half-spaces associated to the basis {γ 1,..., γ t } is nonempty. 3

Problem 10.8 Let be a base of Φ, α β simple roots, Φ αβ the rank 2 root system in E αβ = Rα + Rβ. The Weyl group W αβ of Φ αβ is generated by the restrictions τ α, τ β to E αβ of σ α, σ β, and W αβ may be viewed as a subgroup of W. Prove that the length of an element of W αβ (relative to τ α, τ β ) coincides with the length of the corresponding element in W. Since we can view W αβ as a subgroup of W is cleat the length of some σ in W αβ is greater than or equal to its length in W since any product of simple reflections that can be written in W αβ can also be written in W. So we need to prove that the additional element in W do not allow a further reduction of σ beyond what can be achieved in W αβ. Denote α = α 1 and β = α 2. Let α 3, α 4,..., α l be the remaining simple roots in. Let s i denote the simple reflection associated with α i. Let t 1 = τ α and t 2 = τ β. Suppose σ W αβ such that σ = s a1 s ap = s b1 s bq where p is minimal in W αβ and q is minimal in W. That is, 1 a i 2 and 1 b i l. From a corollary, we know that since s a1 s ap and s b1 s bq are reduced expressions that σ(α ap ), σ(α bq ) Φ. However, σ can be generated by s 1 and s 2. Furthermore, each s i permutes the positive simple roots except α i. Finally, since the restrictions t 1 and t 2 permute roots in E αβ Φ, we know that an arbitrary product composed of s 1 and s 2 must permute the positve roots outside of E αβ. Therefore, b q is 1 or 2. But then, we can consider s a1 s ap s bq W αβ. Since s b1 s bq 1 must be a reduced expression in W, we conclude similarly that b q 1 is 1 or 2. We can continue and ultimately conclude, each b i is 1 or 2 and therefore, the lengths must agree. 4

Problem 10.9 Prove that there is a unique element σ in W sending Φ + to Φ (relative to ). Prove that any reduced expression for σ must involve all σ α (α ). Discuss l(σ). First we deal with uniqueness. Suppose σ, γ W map Φ + Φ. Then σγ maps Φ + Φ + and in particular it sends the base to itself. By Theroem 10.3 part (e), this implies σγ = id and so γ = σ 1. But the same holds for σσ and γγ. Hence, σ = γ. Let σ = s a1 s ap be a reduced expression. Then since σ(α i ) is negative for each i, we have from Lemma C that σs i = s a1 ŝ ak s ap. Hence σ = s a1 ŝ ak s ap s i is another reduced expression for σ. We know the Weyl group is a coxeter group and σ will be the longest element. 5