De Finetti theorems for a Boolean analogue of easy quantum groups
|
|
- Elvin Chapman
- 5 years ago
- Views:
Transcription
1
2 De Finetti theorems for a Boolean analogue of easy quantum groups Tomohiro Hayase Graduate School of Mathematical Sciences, the University of Tokyo March, 2016 Free Probability and the Large N limit, V The University of California, Berkeley 1 / 27
3 Free and Boolean de Finetti theorems Free and Boolean de Finetti theorems: 1 Free de Finetti theorem for A s (C. Köstler and R. Speicher, 2009) 2 Free de Finetti theorems for free quantum groups (T. Banica, S. Curran and R. Speicher, 2012) 3 Boolean de Finetti theorem for B s (W.Liu, 2015) Our result: Find general Boolean de Finetti theorem for a Boolean analogue of free quantum groups. Our strategy: Find a nice class of interval partitions and use BCS s framework. Liu himself proved Boolean de Finetti theorems for quantum semigroups by a different way. 2 / 27
4 De Finetti theorems for free quantum groups (M, ϕ) : v.n.alg and faithful normal state x n M s.a. (n N) Invariant under iff (x n ) n N is S n + free i.i.d. over tail (*) O n + (*) & centered semicircular B n + (*) & semicircular (*) & even H n Symmetries Categories of partitions Distributions S n + NC free i.i.d. over tail (*) O n + NC 2 (*) & centered semicircular B n + NC b (*) & semicircular H n NC h (*) & even Tannaka-Klein duality : A sequence of free quantum groups 1 1 (A x (n)) n N A category of noncrossing partitions NC x Cumulants-Moments formula 3 / 27
5 Review on conditional Boolean independence Definition η N M : a normal embedding of v.n. algebras w/ η(1 N ) /= 1 M, E M N : a normal conditional expecation w/ E η = id N. (x j M s.a. ) j J is Boolean independent w.r.t. E if E[f 1 (x j1 )f 2 (x j2 ) f k (x jk )] = E[f 1 (x j1 )]E[f 2 (x j2 )] E[f k (x jk )], whenever j 1 j 2 j k and f 1,..., f k N X. (i.e. N polynomials without constant terms) 4 / 27
6 Liu s Boolean de Finetti theorem Liu defined a quantum semigroup B s (n) as the universal unital C -algebra generated by projections P, U i,j (i, j = 1,..., n) and relations such that n j=1 Theorem (Liu, 2015) n U ij P = P, U ij P = P, i=1 U i1 ju i2 j = 0, if i 1 i 2, U ij1 U ij2 = 0, if j 1 j 2. (M, ϕ) : a v.n.algebra & a nondegenerate normal state. x j M s.a., j N with M = W (ev x (P o )) where P o = {f C (X j ) j N f (0) = 0} TFAE. 1 The joint distribution of (x j ) j N is invariant under the coaction of B s. 2 There exists a normal conditional expectation E tail M M tail = n=1 ev x(p o n) σw and (x j ) j N is Boolean i.i.d. over tail. 5 / 27
7 Our strategy Aim : Fill the missing piece in Boolean de Finetti theorem. Our strategy : Find a nice class of interval partitions and use BCS s framework. Difficulity: Bad-behavors of non-unital embeddings and non-faithful states 6 / 27
8 Review on category of partitions P(k, l): the set of all partitions of the disjoint union [k] [l], where [k] = {1, 2,..., k} for k N. Such a partition will be pictured as 1... k p = P 1... l where P is a diagram joining the elements in the same block of the partition. Categorical operations: p q = {PQ} Horizontal concatenation pq = { Q } {closed blocks} Vertical concatenation P p = {P } Upside-down turning 7 / 27
9 category of interval partitions NC = (NC(k, l)) k,l : the family of all noncrossing partitions NC x = {NC x (k, l)} k,l, NC x (k, l) NC(k, l) is a category of noncrossing partitions if 1 It is stable by categorical operations 2 NC x (0, 2) 3 NC x (1, 1) I (k) = {π P(k) interval partition}, I = (I (k) I (l)) k,l Definition (Category of interval partitions) I x = {I x (k, l)} k,l, I x (k, l) I (k, l) is a category of interval partitions if 1 It is stable by categorical operations 2 I x (0, 2) 8 / 27
10 Category of interval partitions Remark I x (k, l) = I x (k, 0) I x (0, l) I x (k) = I x (0, k) Example The followings are categories of interval partitions. 1 I 2 = ({π I (k) block size 2}) k 2 I b = ({π I (k) block size 2}) k 3 I h = ({π I (k) block size even}) k 9 / 27
11 Review on NC x To find the class of interval partitions suited to de Finetti, review on NC x. NC, NC 2, NC b, and NC h are block-stable, i.e. for any π NC x and V π,... V NC x ( V ). These four categories of noncrossing partitions are also closed under taking an interval in NC, i.e. ρ, σ NC x (k), π NC(k), ρ π σ π NC x (k). This condtition appears in Möbius inversions: 10 / 27
12 Review on Möbius function Let (Q, ) be a finite poset. The Möbius function µ Q {(π, σ) Q 2 π σ} C is defined by the following relations: for any π, σ Q with π σ, µ Q (π, ρ) = δ(π, σ), ρ Q π ρ σ µ Q (ρ, σ) = δ(π, σ), ρ Q π ρ σ where if π = σ then δ(π, σ) = 1, otherwise, δ(π, σ) = 0. Closed under taking an interval If R Q is closed under taking an interval in Q, µ R (π, σ) = µ Q (π, σ). 11 / 27
13 Blockwise condition We define a suitable class of interval partitions. Definition (Blockwise condition) Let D be a category of interval partition. D is said to be blockwise if 1 D is block-stable, 2 D is closed under taking an interval in I, i.e., ρ, σ D(k), π I (k), ρ π σ π D(k). Key condition If D is blockwise, µ D(k) (π, σ) = µ I (k) (π, σ). 12 / 27
14 Pairing By composition with the pair partition & the unit partition, it holds that k... NC x (0, k)... k 2 NC x (0, k 2). I x : a category of interval partitions Becasue the unit partition / I x (1, 1), in general, k... I x (0, k) /... k 2 I x (0, k 2). 13 / 27
15 Pairing in blockwise category of interval partition Lemma D : a blockwise category of interval partitions If k even & k > 2, or k odd& k > min{k 1 k D(k)} = 2n D 1, we have k... D(0, k)... k 2 D(0, k 2). Consider the case k is odd, k 2n D 1. We have the following inequalities among partitions nD 1... k+1 2 n D... 1 k k By block-stable property, 1 k 2 D. 14 / 27
16 Classification D: blockwise category of interval partitions L D = {k N 1 k D(k)} l D = sup{l N 2l L D }. sup{m N 2m 1 L D }, if L D contains some odd numbers, m D =, otherwise. min{m N 2m 1 L D }, if L D contains some odd numbers, n D =, otherwise. By lemma, we have 1 m D n D l D if n D. 2 l D m D + n D 1. And D is determined by l D, m D and n D. 15 / 27
17 A Boolean analogue of free quantum groups Definition D : a blockwise category of interval partitions. C(G D n ) := -algebra generated by p, u ij (1 i, j n) with p = p = p 2, u ij = u ij and the following relations: for any k with 1 k =... n i=1 n j=1 D(k), k p, j 1 = = j k, u ij1 u ijk p = 0, otherwise, p, i 1 = = i k, u i1 j u ik jp = 0, otherwise. 16 / 27
18 Notations on C(G D n ) Set a *-hom C(G D n ) C(G D n ) C(G D n ) by n (u ij ) = u ik u kj, k=1 (p) = p p. is a coproduct: (id ) = ( id). Set P o = the *-algebra of all nonunital polynomials in noncommutative countably infinite many variables (X j ) j N. We can define a linear map Ψ n P o P o C(G D n ) as the extension of Ψ n (X j1 X jk ) = i [n] k X i1 X ik pu i1 j 1 u ik j k p, j [n] k Ψ n is a coaction, that is, (Ψ n id) Ψ n = (id ) Ψ n. 17 / 27
19 Fixed point algebra Denote by P Ψn the fixed point algebra: P Ψn = {f P o f = f p}. We have P Ψn = Span{X π P o π D(k), k N}, where X π = j [n] k X j1 X jk. By this representation of P Ψn, there is a π ker j functional h on the subspace S D n satisfying (id h) = (h id) = h. Define a linear map E n P o P Ψn by E n = (id h) Ψ n. 18 / 27
20 Invariance (M, ϕ) : a v.n.algebra & a nondegenerate normal state. Definition (x j M s.a. ) j N is said to have G D -invariant joint distribution if (ϕ ev x id) Ψ n = ϕ ev x p. 19 / 27
21 Main Theorem Theorem (M, ϕ) : a v.n.algebra & a nondegenerate normal state. x j M s.a., j N with M = W (ev x (P o )) For any blockwise category of interval partitions D, TFAE. 1 The joint distribution of (x j ) j N is G D -invariant. 2 (x j ) j N is Boolean i.i.d. over tail, & for any k with 1 k D(k), K E tail k [x 1 b 1, x 1 b 2,..., x 1 ] = 0, b 1,, b k M tail {1}. In particular, Symmetries Categories of partitions Distributions Gn I I Boolean i.i.d. over tail (*) G I 2 n I 2 (*) & centered Bernoulli G I b n I b (*) & Bernoulli G I h n I h (*) & even 20 / 27
22 Strategy Assume the joint distribution of (x j ) j N is G D -invariant. Since G D -invariance implies B s -invariance, there exist a normal c.e. E tail M M tail given by E tail = e tail ( )e tail. ISTS for any b 0,..., b k M tail {1}, j [n] k, and k N, E tail [x j1 b 1 x j2 b 2 b k 1 x jk ] = Main strategy of the proof: σ D(k) σ ker j K E tail σ [x 1 b 1, x 1 b 2,..., x 1 ]. 1 Examine E tail can be approximated by E n = (id h)ψ n 2 Use Weingarten estimate If D is blockwise then µ D(k) = µ I (k). By using this, h(pu i1 j 1 u ik j k p) = π,σ D(k) π ker i σ ker j 3 Apply moments-cumulants formula. 1 n π [µ I (k)(π, σ) + O( 1 )] (as n ) n 21 / 27
23 Difficulty 1 : Coaction is non-multiplicative Since the coaction Ψ n is non-multiplicative : there exist b 1,..., b k 1 P Ψn Ψ n (f (X )g(x )) /= Ψ n (f (X ))Λ n (g(x )), with Ψ n [X j1 b 1 X j2 b 2 b k 1 X jk ] /= i [n] k X i1 b 1 X i2 b 2 b k 1 X ik pu i1 j 1... u ik j k p, So it is difficult to approximate E tail [x j1 b 1 b k 1 x jk ] by E n [X j1 b 1 X j2 b 2 b k 1 X jk ]. idea: By block-stable condition, and since E tail satisfies E tail = e tail ( )e tail, the following holds; Assume for any j [n] k and k N, E tail [x j1 x jk ] = σ D(k) σ ker j K E tail σ [x 1,..., x 1 ]. Then for any b 0,..., b k M tail {1}, j [n] k, and k N, E tail [x j1 b 1 x j2 b 2 b k 1 x jk ] = σ D(k) σ ker j K E tail σ [x 1 b 1, x 1 b 2,..., x 1 ]. 22 / 27
24 Difficulty 2 Difficulty 2 : As the state ϕ is non-faithful, we cannot define E n on M and cannot approximate E tail by E n. idea: e n = the orthogonal projection onto ev x (P Ψn )Ω ϕ. If we prove L 2 -lim n ev x (E n [X j1 X j2 X jk ])Ω ϕ = E tail [x j1 x j2 x jk ]Ω ϕ (j [n] k, k N) Then s-lim e n = e tail and hence s lim n ev x (E n [X j1 X j2 X jk ])e n = E tail [x j1 x j2 x jk ](j [n] k, k N) 23 / 27
25 Difficulties and key ideas Difficulty1 : As the state is non-faithful, we cannot define E n on M and cannot approximate E tail by E n. Idea : ISTS lim E tail[x j1 x j2 x jk ] = L 2 lim ev x E n [X j1 X j2 X jk ]. n n Difficulty2 : Coactions are non-multiplicative. Hence it is difficult to estimate E tail [x j1 b 1 x j2 b 2 b k 1 x jk ] (b 0,..., b k M tail {1}). Idea : ISTS E tail [x j1 x jk ] = K E tail σ [x 1,..., x 1 ]. σ D(k) σ ker j 24 / 27
26 Main Theorem Theorem (M, ϕ) : a v.n.algebra & a nondegenerate normal state. x j M s.a., j N with M = W (ev x (P o )) For any blockwise category of interval partitions D, TFAE. 1 The joint distribution of (x j ) j N is G D -invariant. 2 (x j ) j N is Boolean i.i.d. over tail, & for any k with 1 k D(k), K E tail k [x 1 b 1, x 1 b 2,..., x 1 ] = 0, b 1,, b k M tail {1}. In particular, Symmetries Categories of partitions Distributions Gn I I Boolean i.i.d. over tail (*) G I 2 n I 2 (*) & centered Bernoulli G I b n I b (*) & Bernoulli G I h n I h (*) & even 25 / 27
27 C -closure Free case: By Tannaka-Klein duality for compact quantum groups, Free quantum groups A x NC x. A x (n) = C univ(u = (u ij ) u t u = t uu = 1)/relations implied by NC x C X j j N ΨAx n = Span{X π P o π NC x }. Boolean case: C univ (p, u = (u ij) relations implied by D) can be ill-defined. Liu: B o (n) = C univ (p, u = (u ij) p = p = p 2, u t up = t uu = p, u 1) It is not clear P ΨBo n? = Span{X π P o π I 2 }. Hence h and E n can be changed, it is not obvious that our strategy works well for B o (n). 26 / 27
28 Summary Aim : Prove general Boolean de Finetti theorem. Our strategy : Find a nice class of interval partitions and use BCS s framework. Key condition: D is blockwise i.e. block-stable and closed under taking an interval in I. Second condition implies µ D(k) (π, σ) = µ I (k) (π, σ), π, σ D(k). Difficulty1 : As the state ϕ is non-faithful, it is difficult to define E n on M and approximate E tail by E n. Idea : ISTS E tail [x j1 x j2 x jk ] = L 2 lim n ev x E n [X j1 X j2 X jk ]. Difficulty2 : Coactions are non-multiplicative. Hence it is difficult to estimate E tail [x j1 b 1 x j2 b 2 b k 1 x jk ] (b 0,..., b k M tail {1}). Idea : By block-stable condition, ISTS E tail [x j1 x jk ] = σ D(k) σ ker j K E tail σ [x 1,..., x 1 ]. 27 / 27
arxiv: v1 [math.oa] 20 Jul 2015
DE FINETTI THEOREMS FOR A BOOLEAN ANALOGUE OF EASY QUANTUM GROUPS arxiv:1507.05563v1 [math.oa] 20 Jul 2015 TOMOHIRO HAYASE Abstract. Banica, Curran and Speicher have shown de Finetti theorems for classical
More informationQuantum Symmetries in Free Probability Theory. Roland Speicher Queen s University Kingston, Canada
Quantum Symmetries in Free Probability Theory Roland Speicher Queen s University Kingston, Canada Quantum Groups are generalizations of groups G (actually, of C(G)) are supposed to describe non-classical
More informationQuantum Symmetric States
Quantum Symmetric States Ken Dykema Department of Mathematics Texas A&M University College Station, TX, USA. Free Probability and the Large N limit IV, Berkeley, March 2014 [DK] K. Dykema, C. Köstler,
More informationQuantum symmetries in free probability. Stephen Robert Curran
Quantum symmetries in free probability by Stephen Robert Curran A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate
More informationBy Teodor Banica 1, Stephen Curran and Roland Speicher 2 Cergy-Pontoise University, UCLA and Queen s University
The Annals of Probability 2012, Vol. 40, No. 1, 401 435 DOI: 10.1214/10-AOP619 c Institute of Mathematical Statistics, 2012 DE FINETTI THEOREMS FOR EASY QUANTUM GROUPS arxiv:0907.3314v4 [math.oa] 27 Sep
More informationDual Temperley Lieb basis, Quantum Weingarten and a conjecture of Jones
Dual Temperley Lieb basis, Quantum Weingarten and a conjecture of Jones Benoît Collins Kyoto University Sendai, August 2016 Overview Joint work with Mike Brannan (TAMU) (trailer... cf next Monday s arxiv)
More informationQuantum Symmetric States on Free Product C -Algebras
Quantum Symmetric States on Free Product C -Algebras School of Mathematical Sciences University College Cork Joint work with Ken Dykema & John Williams arxiv:1305.7293 WIMCS-LMS Conference Classifying
More informationPlan 1 Motivation & Terminology 2 Noncommutative De Finetti Theorems 3 Braidability 4 Quantum Exchangeability 5 References
www.math.uiuc.edu/ koestler University of Illinois at Urbana-Champaign / St. Lawrence University GPOTS 2008 University of Cincinnati June 18, 2008 [In parts joint work with Rolf Gohm and Roland Speicher]
More informationDual braid monoids and Koszulity
Dual braid monoids and Koszulity Phillippe Nadeau (CNRS, Univ. Lyon 1) SLC 69, Strobl, September 10th 2012 Goal Investigate the combinatorics of a certain graded algebra associated to a Coxeter system,
More informationFrom random matrices to free groups, through non-crossing partitions. Michael Anshelevich
From random matrices to free groups, through non-crossing partitions Michael Anshelevich March 4, 22 RANDOM MATRICES For each N, A (N), B (N) = independent N N symmetric Gaussian random matrices, i.e.
More informationAbstract Algebra II Groups ( )
Abstract Algebra II Groups ( ) Melchior Grützmann / melchiorgfreehostingcom/algebra October 15, 2012 Outline Group homomorphisms Free groups, free products, and presentations Free products ( ) Definition
More informationTHE HYPEROCTAHEDRAL QUANTUM GROUP
THE HYPEROCTAHEDRAL QUANTUM GROUP TEODOR BANICA, JULIEN BICHON, AND BENOÎT COLLINS Abstract. We consider the hypercube in R n, and show that its quantum symmetry group is a q-deformation of O n at q =
More informationarxiv: v1 [math.qa] 11 Dec 2017
arxiv:72.04067v [math.qa] Dec 207 HIGHER TRANSITIVE QUANTUM GROUPS: THEORY AND MODELS TEODOR BANICA Abstract. We investigate the notion of k-transitivity for the quantum permutation groups G S + N, with
More informationMATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA
MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA These are notes for our first unit on the algebraic side of homological algebra. While this is the last topic (Chap XX) in the book, it makes sense to
More informationvon Neumann algebras, II 1 factors, and their subfactors V.S. Sunder (IMSc, Chennai)
von Neumann algebras, II 1 factors, and their subfactors V.S. Sunder (IMSc, Chennai) Lecture 3 at IIT Mumbai, April 24th, 2007 Finite-dimensional C -algebras: Recall: Definition: A linear functional tr
More informationfree pros quantum groups QIT de Finetti -
i e free pros QIT de Finetti - @ quantum groups QG INK FP - : FREE DE FINETTI Commun Math Phys 291 473 490 (2009 Digital Object Identifier (DOI 101007/s00220-009-0802-8 Communications in Mathematical Physics
More informationHadamard matrices and Compact Quantum Groups
Hadamard matrices and Compact Quantum Groups Uwe Franz 18 février 2014 3ème journée FEMTO-LMB based in part on joint work with: Teodor Banica, Franz Lehner, Adam Skalski Uwe Franz (LMB) Hadamard & CQG
More informationis the desired collar neighbourhood. Corollary Suppose M1 n, M 2 and f : N1 n 1 N2 n 1 is a diffeomorphism between some connected components
1. Collar neighbourhood theorem Definition 1.0.1. Let M n be a manifold with boundary. Let p M. A vector v T p M is called inward if for some local chart x: U V where U subsetm is open, V H n is open and
More informationAutomata on linear orderings
Automata on linear orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 September 25, 2006 Abstract We consider words indexed by linear
More informationNotes about Filters. Samuel Mimram. December 6, 2012
Notes about Filters Samuel Mimram December 6, 2012 1 Filters and ultrafilters Definition 1. A filter F on a poset (L, ) is a subset of L which is upwardclosed and downward-directed (= is a filter-base):
More information= ϕ r cos θ. 0 cos ξ sin ξ and sin ξ cos ξ. sin ξ 0 cos ξ
8. The Banach-Tarski paradox May, 2012 The Banach-Tarski paradox is that a unit ball in Euclidean -space can be decomposed into finitely many parts which can then be reassembled to form two unit balls
More informationFree Probability Theory and Non-crossing Partitions. Roland Speicher Queen s University Kingston, Canada
Free Probability Theory and Non-crossing Partitions Roland Speicher Queen s University Kingston, Canada Freeness Definition [Voiculescu 1985]: Let (A, ϕ) be a non-commutative probability space, i.e. A
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationMH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then
MH 7500 THEOREMS Definition. A topological space is an ordered pair (X, T ), where X is a set and T is a collection of subsets of X such that (i) T and X T ; (ii) U V T whenever U, V T ; (iii) U T whenever
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationExercises on chapter 0
Exercises on chapter 0 1. A partially ordered set (poset) is a set X together with a relation such that (a) x x for all x X; (b) x y and y x implies that x = y for all x, y X; (c) x y and y z implies that
More informationFrom discrete differential geometry to the classification of discrete integrable systems
From discrete differential geometry to the classification of discrete integrable systems Vsevolod Adler,, Yuri Suris Technische Universität Berlin Quantum Integrable Discrete Systems, Newton Institute,
More informationTree-adjoined spaces and the Hawaiian earring
Tree-adjoined spaces and the Hawaiian earring W. Hojka (TU Wien) Workshop on Fractals and Tilings 2009 July 6-10, 2009, Strobl (Austria) W. Hojka (TU Wien) () Tree-adjoined spaces and the Hawaiian earring
More informationExercises on chapter 1
Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G
More informationRandom Matrix: From Wigner to Quantum Chaos
Random Matrix: From Wigner to Quantum Chaos Horng-Tzer Yau Harvard University Joint work with P. Bourgade, L. Erdős, B. Schlein and J. Yin 1 Perhaps I am now too courageous when I try to guess the distribution
More informationEvery Linear Order Isomorphic to Its Cube is Isomorphic to Its Square
Every Linear Order Isomorphic to Its Cube is Isomorphic to Its Square Garrett Ervin University of California, Irvine May 21, 2016 We do not know so far any type α such that α = α 3 = α 2. W. Sierpiński,
More informationA complete criterion for convex-gaussian states detection
A complete criterion for convex-gaussian states detection Anna Vershynina Institute for Quantum Information, RWTH Aachen, Germany joint work with B. Terhal NSF/CBMS conference Quantum Spin Systems The
More informationBLOCKS IN THE CATEGORY OF FINITE-DIMENSIONAL REPRESENTATIONS OF gl(m n)
BLOCKS IN THE CATEGORY OF FINITE-DIMENSIONAL REPRESENTATIONS OF gl(m n) VERA SERGANOVA Abstract. We decompose the category of finite-dimensional gl (m n)- modules into the direct sum of blocks, show that
More informationRepresentation Theory
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 Paper 1, Section II 19I 93 (a) Define the derived subgroup, G, of a finite group G. Show that if χ is a linear character
More informationCones of measures. Tatiana Toro. University of Washington. Quantitative and Computational Aspects of Metric Geometry
Cones of measures Tatiana Toro University of Washington Quantitative and Computational Aspects of Metric Geometry Based on joint work with C. Kenig and D. Preiss Tatiana Toro (University of Washington)
More informationPreliminaries on von Neumann algebras and operator spaces. Magdalena Musat University of Copenhagen. Copenhagen, January 25, 2010
Preliminaries on von Neumann algebras and operator spaces Magdalena Musat University of Copenhagen Copenhagen, January 25, 2010 1 Von Neumann algebras were introduced by John von Neumann in 1929-1930 as
More informationA NOTE ON FREE QUANTUM GROUPS
A NOTE ON FREE QUANTUM GROUPS TEODOR BANICA Abstract. We study the free complexification operation for compact quantum groups, G G c. We prove that, with suitable definitions, this induces a one-to-one
More informationarxiv: v2 [math.ag] 24 Jun 2015
TRIANGULATIONS OF MONOTONE FAMILIES I: TWO-DIMENSIONAL FAMILIES arxiv:1402.0460v2 [math.ag] 24 Jun 2015 SAUGATA BASU, ANDREI GABRIELOV, AND NICOLAI VOROBJOV Abstract. Let K R n be a compact definable set
More informationMath 203, Solution Set 4.
Math 203, Solution Set 4. Problem 1. Let V be a finite dimensional vector space and let ω Λ 2 V be such that ω ω = 0. Show that ω = v w for some vectors v, w V. Answer: It is clear that if ω = v w then
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationIsomorphism of free G-subflows (preliminary draft)
Isomorphism of free G-subflows (preliminary draft) John D. Clemens August 3, 21 Abstract We show that for G a countable group which is not locally finite, the isomorphism of free G-subflows is bi-reducible
More informationMath 530 Lecture Notes. Xi Chen
Math 530 Lecture Notes Xi Chen 632 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca 1991 Mathematics Subject Classification. Primary
More informationSOLUTIONS TO THE FINAL EXAM
SOLUTIONS TO THE FINAL EXAM Short questions 1 point each) Give a brief definition for each of the following six concepts: 1) normal for topological spaces) 2) path connected 3) homeomorphism 4) covering
More informationMATH5011 Real Analysis I. Exercise 1 Suggested Solution
MATH5011 Real Analysis I Exercise 1 Suggested Solution Notations in the notes are used. (1) Show that every open set in R can be written as a countable union of mutually disjoint open intervals. Hint:
More informationQUANTUM AUTOMORPHISMS OF TWISTED GROUP ALGEBRAS AND FREE HYPERGEOMETRIC LAWS
QUANTUM AUTOMORPHISMS OF TWISTED GROUP ALGEBRAS AND FREE HYPERGEOMETRIC LAWS TEODOR BANICA, JULIEN BICHON, AND STEPHEN CURRAN Abstract. We prove that we have an isomorphism of type A aut (C σ [G]) A aut
More informationASSIGNMENT - 1, DEC M.Sc. (FINAL) SECOND YEAR DEGREE MATHEMATICS. Maximum : 20 MARKS Answer ALL questions. is also a topology on X.
(DM 21) ASSIGNMENT - 1, DEC-2013. PAPER - I : TOPOLOGY AND FUNCTIONAL ANALYSIS Maimum : 20 MARKS 1. (a) Prove that every separable metric space is second countable. Define a topological space. If T 1 and
More informationCategorical quantum mechanics
Categorical quantum mechanics Chris Heunen 1 / 76 Categorical Quantum Mechanics? Study of compositional nature of (physical) systems Primitive notion: forming compound systems 2 / 76 Categorical Quantum
More information6. Duals of L p spaces
6 Duals of L p spaces This section deals with the problem if identifying the duals of L p spaces, p [1, ) There are essentially two cases of this problem: (i) p = 1; (ii) 1 < p < The major difference between
More informationPATTERNED RANDOM MATRICES
PATTERNED RANDOM MATRICES ARUP BOSE Indian Statistical Institute Kolkata November 15, 2011 Introduction Patterned random matrices. Limiting spectral distribution. Extensions (joint convergence, free limit,
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationType Classification of Unification Problems over Distributive Lattices and De Morgan Algebras
Type Classification of Unification Problems over Distributive Lattices and De Morgan Algebras Simone Bova Vanderbilt University (Nashville TN, USA) joint work with Leonardo Cabrer AMS Western Section Meeting
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More informationCUT-OFF FOR QUANTUM RANDOM WALKS. 1. Convergence of quantum random walks
CUT-OFF FOR QUANTUM RANDOM WALKS AMAURY FRESLON Abstract. We give an introduction to the cut-off phenomenon for random walks on classical and quantum compact groups. We give an example involving random
More informationSYMMETRIC SUBGROUP ACTIONS ON ISOTROPIC GRASSMANNIANS
1 SYMMETRIC SUBGROUP ACTIONS ON ISOTROPIC GRASSMANNIANS HUAJUN HUANG AND HONGYU HE Abstract. Let G be the group preserving a nondegenerate sesquilinear form B on a vector space V, and H a symmetric subgroup
More informationExotic Crossed Products and Coaction Functors
Exotic Crossed Products and Coaction Functors S. Kaliszewski Arizona State University Workshop on Noncommutative Analysis University of Iowa June 4 5, 2016 1 / 29 Abstract When a locally compact group
More informationCongruence lattices and Compact Intersection Property
Congruence lattices and Compact Intersection Property Slovak Academy of Sciences, Košice June 8, 2013 Congruence lattices Problem. For a given class K of algebras describe Con K =all lattices isomorphic
More informationLebesgue Measure. Dung Le 1
Lebesgue Measure Dung Le 1 1 Introduction How do we measure the size of a set in IR? Let s start with the simplest ones: intervals. Obviously, the natural candidate for a measure of an interval is its
More informationALGEBRAIC GROUPS J. WARNER
ALGEBRAIC GROUPS J. WARNER Let k be an algebraically closed field. varieties unless otherwise stated. 1. Definitions and Examples For simplicity we will work strictly with affine Definition 1.1. An algebraic
More informationTopological K-theory
Topological K-theory Robert Hines December 15, 2016 The idea of topological K-theory is that spaces can be distinguished by the vector bundles they support. Below we present the basic ideas and definitions
More informationStein s Method for concentration inequalities
Number of Triangles in Erdős-Rényi random graph, UC Berkeley joint work with Sourav Chatterjee, UC Berkeley Cornell Probability Summer School July 7, 2009 Number of triangles in Erdős-Rényi random graph
More informationMULTIPLIER HOPF ALGEBRAS AND DUALITY
QUANTUM GROUPS AND QUANTUM SPACES BANACH CENTER PUBLICATIONS, VOLUME 40 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1997 MULTIPLIER HOPF ALGEBRAS AND DUALITY A. VAN DAELE Department of
More informationDISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS
DISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS AARON ABRAMS, DAVID GAY, AND VALERIE HOWER Abstract. We show that the discretized configuration space of k points in the n-simplex is homotopy equivalent
More informationMA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems
MA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems Review of Basic Probability The fundamentals, random variables, probability distributions Probability mass/density functions
More informationWeak convergence. Amsterdam, 13 November Leiden University. Limit theorems. Shota Gugushvili. Generalities. Criteria
Weak Leiden University Amsterdam, 13 November 2013 Outline 1 2 3 4 5 6 7 Definition Definition Let µ, µ 1, µ 2,... be probability measures on (R, B). It is said that µ n converges weakly to µ, and we then
More informationAn introduction to some aspects of functional analysis
An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms
More informationAN ALGEBRAIC APPROACH TO GENERALIZED MEASURES OF INFORMATION
AN ALGEBRAIC APPROACH TO GENERALIZED MEASURES OF INFORMATION Daniel Halpern-Leistner 6/20/08 Abstract. I propose an algebraic framework in which to study measures of information. One immediate consequence
More informationMatricial R-circular Systems and Random Matrices
Instytut Matematyki i Informatyki Politechnika Wrocławska UC Berkeley, March 2014 Motivations Motivations: describe asymptotic distributions of random blocks construct new random matrix models unify concepts
More informationHALF-COMMUTATIVE ORTHOGONAL HOPF ALGEBRAS
HALF-COMMUTATIVE ORTHOGONAL HOPF ALGEBRAS JULIEN BICHON AND MICHEL DUBOIS-VIOLETTE Abstract. A half-commutative orthogonal Hopf algebra is a Hopf -algebra generated by the self-adjoint coefficients of
More informationSOME REMARKS ON THE TOPOLOGY OF HYPERBOLIC ACTIONS OF R n ON n-manifolds
SOME REMARKS ON THE TOPOLOGY OF HYPERBOLIC ACTIONS OF R n ON n-manifolds DAMIEN BOULOC Abstract. This paper contains some more results on the topology of a nondegenerate action of R n on a compact connected
More informationA COMMENT ON FREE GROUP FACTORS
A COMMENT ON FREE GROUP FACTORS NARUTAKA OZAWA Abstract. Let M be a finite von Neumann algebra acting on the standard Hilbert space L 2 (M). We look at the space of those bounded operators on L 2 (M) that
More informationTensor algebras and subproduct systems arising from stochastic matrices
Tensor algebras and subproduct systems arising from stochastic matrices Daniel Markiewicz (Ben-Gurion Univ. of the Negev) Joint Work with Adam Dor-On (Univ. of Waterloo) OAOT 2014 at ISI, Bangalore Daniel
More informationWhat is a quantum symmetry?
What is a quantum symmetry? Ulrich Krähmer & Angela Tabiri U Glasgow TU Dresden CLAP 30/11/2016 Uli (U Glasgow) What is a quantum symmetry? CLAP 30/11/2016 1 / 20 Road map Classical maths: symmetries =
More informationTHE SEMIGROUP βs APPLICATIONS TO RAMSEY THEORY
THE SEMIGROUP βs If S is a discrete space, its Stone-Čech compactification βs can be described as the space of ultrafilters on S with the topology for which the sets of the form A = {p βs : A p}, where
More informationLebesgue Integration: A non-rigorous introduction. What is wrong with Riemann integration?
Lebesgue Integration: A non-rigorous introduction What is wrong with Riemann integration? xample. Let f(x) = { 0 for x Q 1 for x / Q. The upper integral is 1, while the lower integral is 0. Yet, the function
More informationSymbol Index Group GermAnal Ring AbMonoid
Symbol Index 409 Symbol Index Symbols of standard and uncontroversial usage are generally not included here. As in the word index, boldface page-numbers indicate pages where definitions are given. If a
More informationWeak convergence and Brownian Motion. (telegram style notes) P.J.C. Spreij
Weak convergence and Brownian Motion (telegram style notes) P.J.C. Spreij this version: December 8, 2006 1 The space C[0, ) In this section we summarize some facts concerning the space C[0, ) of real
More informationMore Model Theory Notes
More Model Theory Notes Miscellaneous information, loosely organized. 1. Kinds of Models A countable homogeneous model M is one such that, for any partial elementary map f : A M with A M finite, and any
More informationON FUZZY RANDOM VARIABLES: EXAMPLES AND GENERALIZATIONS
ON FUZZY RANDOM VARIABLES: EXAMPLES AND GENERALIZATIONS MARTIN PAPČO Abstract. There are random experiments in which the notion of a classical random variable, as a map sending each elementary event to
More informationSUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS
SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P, let Co(P) denote the lattice of all order-convex
More informationB 1 = {B(x, r) x = (x 1, x 2 ) H, 0 < r < x 2 }. (a) Show that B = B 1 B 2 is a basis for a topology on X.
Math 6342/7350: Topology and Geometry Sample Preliminary Exam Questions 1. For each of the following topological spaces X i, determine whether X i and X i X i are homeomorphic. (a) X 1 = [0, 1] (b) X 2
More informationCategories of noncrossing partitions
Categories of noncrossing partitions Kiyoshi Igusa, Brandeis University KIAS, Dec 15, 214 Topology of categories The classifying space of a small category C is a union of simplices k : BC = X X 1 X k k
More informationAnalysis III. Exam 1
Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)
More informationCONVOLUTION OPERATORS IN INFINITE DIMENSION
PORTUGALIAE MATHEMATICA Vol. 51 Fasc. 4 1994 CONVOLUTION OPERATORS IN INFINITE DIMENSION Nguyen Van Khue and Nguyen Dinh Sang 1 Introduction Let E be a complete convex bornological vector space (denoted
More informationCS286.2 Lecture 13: Quantum de Finetti Theorems
CS86. Lecture 13: Quantum de Finetti Theorems Scribe: Thom Bohdanowicz Before stating a quantum de Finetti theorem for density operators, we should define permutation invariance for quantum states. Let
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationON MATRIX VALUED SQUARE INTEGRABLE POSITIVE DEFINITE FUNCTIONS
1 2 3 ON MATRIX VALUED SQUARE INTERABLE POSITIVE DEFINITE FUNCTIONS HONYU HE Abstract. In this paper, we study matrix valued positive definite functions on a unimodular group. We generalize two important
More informationChapter 6: The metric space M(G) and normal families
Chapter 6: The metric space MG) and normal families Course 414, 003 04 March 9, 004 Remark 6.1 For G C open, we recall the notation MG) for the set algebra) of all meromorphic functions on G. We now consider
More informationChapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationEquivariant cohomology of infinite-dimensional Grassmannian and shifted Schur functions
Equivariant cohomology of infinite-dimensional Grassmannian and shifted Schur functions Jia-Ming (Frank) Liou, Albert Schwarz February 28, 2012 1. H = L 2 (S 1 ): the space of square integrable complex-valued
More informationCayley Graphs of Finitely Generated Groups
Cayley Graphs of Finitely Generated Groups Simon Thomas Rutgers University 13th May 2014 Cayley graphs of finitely generated groups Definition Let G be a f.g. group and let S G { 1 } be a finite generating
More informationElliott s program and descriptive set theory I
Elliott s program and descriptive set theory I Ilijas Farah LC 2012, Manchester, July 12 a, a, a, a, the, the, the, the. I shall need this exercise later, someone please solve it Exercise If A = limna
More informationBERNARD RUSSO. University of California, Irvine
A HOLOMORPHIC CHARACTERIZATION OF OPERATOR ALGEBRAS (JOINT WORK WITH MATT NEAL) BERNARD RUSSO University of California, Irvine UNIVERSITY OF HOUSTON GREAT PLAINS OPERATOR THEORY SYMPOSIUM MAY 30-JUNE 2,
More informationMath 6510 Homework 10
2.2 Problems 9 Problem. Compute the homology group of the following 2-complexes X: a) The quotient of S 2 obtained by identifying north and south poles to a point b) S 1 (S 1 S 1 ) c) The space obtained
More informationDrawing: Prof. Karl Heinrich Hofmann
Drawing: Prof. Karl Heinrich Hofmann 1 2 Sylvester s Law of Inertia A demonstration of the theorem that every homogeneous quadratic polynomial is reducible by real orthogonal substitutions to the form
More informationJoseph Muscat Universal Algebras. 1 March 2013
Joseph Muscat 2015 1 Universal Algebras 1 Operations joseph.muscat@um.edu.mt 1 March 2013 A universal algebra is a set X with some operations : X n X and relations 1 X m. For example, there may be specific
More informationP i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=
2.7. Recurrence and transience Consider a Markov chain {X n : n N 0 } on state space E with transition matrix P. Definition 2.7.1. A state i E is called recurrent if P i [X n = i for infinitely many n]
More informationSTAT 7032 Probability Spring Wlodek Bryc
STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,
More informationCLASSICAL AND FREE FOURTH MOMENT THEOREMS: UNIVERSALITY AND THRESHOLDS. I. Nourdin, G. Peccati, G. Poly, R. Simone
CLASSICAL AND FREE FOURTH MOMENT THEOREMS: UNIVERSALITY AND THRESHOLDS I. Nourdin, G. Peccati, G. Poly, R. Simone Abstract. Let X be a centered random variable with unit variance, zero third moment, and
More informationStatistical Inference on Large Contingency Tables: Convergence, Testability, Stability. COMPSTAT 2010 Paris, August 23, 2010
Statistical Inference on Large Contingency Tables: Convergence, Testability, Stability Marianna Bolla Institute of Mathematics Budapest University of Technology and Economics marib@math.bme.hu COMPSTAT
More information