Packing, coding, and ground states From information theory to physics. Lecture III. Packing and energy minimization bounds in compact spaces
|
|
- Antony Wilkins
- 6 years ago
- Views:
Transcription
1 Packing, coding, and ground states From information theory to physics Lecture III. Packing and energy minimization bounds in compact spaces Henry Cohn Microsoft Research New England
2 Pair correlations For simplicity, we ll focus on finite point configurations in S n 1. The distance distribution of a finite subset C of S n 1 measures how often each distance occurs between pairs of points. For 1 t 1, define A t = #{(x, y) C 2 x, y = t}. Recall that x y 2 = 2 x, y, so A t counts the number of pairs at distance 2 2t. In physics terms, this is equivalent to the pair correlation function. We can express energy for a pair potential in terms of pair correlations: f ( x y 2 ) = f (2 2t)A t. x y 1 t<1 (The right side has only finitely many nonzero summands.)
3 Constraints on pair correlations Because x y f ( x y 2 ) = 1 t<1 f (2 2t)A t, figuring out how low the energy can be amounts to understanding what the possible pair correlation functions are. There are some obvious constraints for a configuration with N points: A t 0 for all t, A 1 = N, and t A t = N 2. These follow trivially from the definition A t = #{(x, y) C 2 x, y = t}. There are also less obvious constraints, such as A t t = 2 x, y = x 0. t x C This is the inequality we used to analyze simplices.
4 Delsarte linear programming inequalities Delsarte discovered (in a closely related context) an infinite sequence of linear inequalities generalizing this last one. They use special functions, namely Gegenbauer or ultraspherical polynomials. These are a family Pk n of polynomials in one variable, with deg(pk n ) = k, such that A t Pk n (t) 0 t for all k. In particular, P1 n (t) = t, so we recover the previous inequality, and P0 n (t) = 1. Equivalently, for every finite set C S n 1, Pk n ( x, y ) 0. We ll return shortly to what these polynomials are and why they have this property.
5 Linear programming bounds Now we can try to minimize 1 t<1 f (2 2t)A t subject to these inequalities. This is a linear function of A t, and all our inequalities are linear as well. Thus, we get a lower bound for energy from the following infinite-dimensional linear programming problem: Find A t for 1 t 1 to minimize A 1 = N A t 0 t A t = N 2 t A tpk n (t) 0 for k 1 1 t<1 A t f (2 2t) subject to:
6 Linear programming duality We can formulate the dual linear program, in which we try to prove bounds on energy by taking linear combinations of the constraints. That amounts to the following theorem: Theorem (Delsarte,..., Yudin). Suppose h = k h kpk n with h k 0 for k 1, and suppose h(t) f (2 2t) for t [ 1, 1]. Then every N-point configuration C on S n 1 satisfies f ( x y 2 ) N 2 h 0 Nh(1). x y In other words, we need a lower bound h for the potential function f such that h has non-negative ultraspherical coefficients. Then we get a lower bound for f -energy. How do we choose h to optimize this bound? Nobody knows in general, but we can do it in certain special cases.
7 Theorem (Delsarte,..., Yudin). Suppose h = k h kpk n with h k 0 for k 1, and suppose h(t) f (2 2t) for t [ 1, 1]. Then every N-point configuration C on S n 1 satisfies f ( x y 2 ) N 2 h 0 Nh(1). x y Proof: We have f ( x y 2 ) h( x, y ) x y x y = h( x, y ) Nh(1) = N 2 h 0 Nh(1) + k 1 N 2 h 0 Nh(1). h k Pk n ( x, y ) Q.E.D.
8 This all rests on the fundamental inequality Pk n ( x, y ) 0. It might seem like an extraordinarily wasteful proof technique, since we are throwing away tons of terms. But in fact Pk n ( x, y ) averages to zero over the whole sphere, so perhaps those terms aren t likely to be so large anyway.
9 Applying these bounds LP bounds are behind almost every case in which universal optimality, or indeed any sharp bound on energy, is known. When could the bound be sharp? We need f ( x y 2 ) = h( x, y ) for all x, y C with x y, and we need Pk n ( x, y ) = 0 for all k 1 for which h k > 0. In practice, we choose h to be a polynomial of as low a degree as possible subject to agreeing with f to order 2 at each inner product that occurs between distinct points in C. Then you can check that everything works and treat it as an undeserved miracle, or explain it via the following theorem.
10 Theorem (Cohn and Kumar). Every m-distance set that is a spherical (2m 1)-design is universally optimal. m-distance set = set with m distances between distinct points spherical k-design = finite subset D of sphere S n 1 such that for all polynomials p : R n R of total degree at most k, average of p over D = average of p over S n 1. (I.e., averaging at these points gives exact numerical integration for polynomials up to degree k.) This theorem handles every known universal optimum except the regular 600-cell. H. Cohn and A. Kumar, Universally optimal distribution of points on spheres, Journal of the American Mathematical Society 20 (2007),
11 Packing bounds Theorem. Suppose h = k h kp n k with h k 0 for k 0 and h 0 > 0, and suppose h(t) 0 for t [ 1, cos θ]. Then every configuration C on S n 1 with minimal angle at least θ satisfies C h(1)/h 0. Proof: We have C h(1) h( x, y ) = k h k P n k ( x, y ) C 2 h 0. Q.E.D.
12 So what are ultraspherical polynomials? Orthogonal polynomials with respect to (1 t 2 ) (n 3)/2 dt on [ 1, 1]. I.e., if k l. 1 1 P n k (t)pn l (t)(1 t2 ) (n 3)/2 dt = 0 Equivalently, Pk n is orthogonal to all polynomials of degree less than k with respect to this measure. This uniquely determines them up to scaling (which is irrelevant for us, as long as we take Pk n (1) > 0). Just apply Gram-Schmidt orthogonalization to 1, t, t 2,... to compute them recursively.
13 Orthogonal polynomials Many wonderful implications. For example, orthogonality shows that Pk n has k distinct roots in [ 1, 1]. To see why, suppose P n k changed sign at only m points r 1,..., r m in [ 1, 1], with m < k. Then P n k (t)(t r 1)... (t r m ) would never change sign on [ 1, 1], which would contradict 1 1 P n k (t)(t r 1)... (t r m )(1 t 2 ) (n 3)/2 dt = 0 (which holds because (t r 1 )... (t r m ) has degree less than k).
14 Recall that as a representation of O(n), we can decompose L 2 (S n 1 ) as L 2 (S n 1 ) = W k, k 0 where W k consists of degree k spherical harmonics. Let x S n 1, and consider the linear map that takes f W k to f (x). This map must be the inner product with some unique element w k,x of W k, called a reproducing kernel. That is, for all f W k. f (x) = w k,x, f The function w k,x is invariant under all rotations that fix x, since such rotations preserve f (x). Thus, w k,x (y) must be a function of x, y alone. We define P n k by w k,x (y) = Pk n ( x, y ).
15 The reproducing kernel w k,x is a polynomial of degree k (because it is a spherical harmonic), and thus so is P n k. Furthermore, w k,x and w l,x are orthogonal in L 2 (S n 1 ) for k l, since they are spherical harmonics of different degrees. Thus, Pk n ( x, y )Pn l ( x, y ) dµ(y) = 0, S n 1 where µ is surface measure. If we orthogonally project from the surface of the sphere onto the axis from x to x, then µ projects to a constant times the measure (1 t 2 ) (n 3)/2 dt on [ 1, 1]. (This is a good multivariable calculus exercise.) Thus, we have recovered all the properties of ultraspherical polynomials we needed except for the fundamental inequality Pk n ( x, y ) 0.
16 As a side comment, we can now see that W k is an irreducible representation of O(n). If it broke up further, then each summand would have its own reproducing kernel, which would two different polynomials of degree k that would be orthogonal to each other as well as to lower degree polynomials. That is impossible (the space of polynomials of degree at most k has dimension too low to contain that).
17 The fundamental inequality Recall that the reproducing kernel property means w k,x, f = f (x) for all f W k. In particular, taking f = w k,y yields w k,x, w k,y = w k,y (x). Recall also that w k,y (x) = Pk n ( x, y ). Now we have Pk n ( x, y ) = w k,y (x) = w k,x, w k,y 2 = w k,x 0. x C
18 This is a perfect generalization of x C x 2 0, except instead of summing the vectors x, we are summing vectors w k,x in the Hilbert space W k. One interpretation is that x w k,x maps S n 1 into the unit sphere in the higher-dimensional space W k, and we re combining the trivial inequality x C w k,x 2 0 with that nontrivial mapping. When n = 2, the space W k has dimension 2 for k 1, so we are mapping S 1 to itself. This map wraps S 1 around itself k times, while the analogues for n 3 are more subtle.
19 Do ultraspherical polynomials span all the functions P satisfying P( x, y ) 0 for all C? No; see F. Pfender, Improved Delsarte bounds for spherical codes in small dimensions, J. Combin. Theory Ser. A 114 (2007), However, they span all the positive-definite kernels: functions P such that for all x 1,..., x N S n 1, the N N matrix with entries P( x i, x j ) is positive semidefinite. I. J. Schoenberg, Positive definite functions on spheres, Duke Math. J. 9 (1942),
20 Semidefinite programming bounds Generalizations put semidefinite constraints on higher correlation functions. A. Schrijver, New code upper bounds from the Terwilliger algebra and semidefinite programming, IEEE Transactions on Information Theory 51 (2005), C. Bachoc and F. Vallentin, New upper bounds for kissing numbers from semidefinite programming, Journal of the American Mathematical Society 21 (2008), H. Cohn and J. Woo, Three-point bounds for energy minimization, Journal of the American Mathematical Society 25 (2012), D. de Laat and F. Vallentin, A semidefinite programming hierarchy for packing problems in discrete geometry, arxiv:
21 For more information Papers are available from: Specifically, see Order and disorder in energy minimization:
Applications of semidefinite programming in Algebraic Combinatorics
Applications of semidefinite programming in Algebraic Combinatorics Tohoku University The 23rd RAMP Symposium October 24, 2011 We often want to 1 Bound the value of a numerical parameter of certain combinatorial
More informationRecall that any inner product space V has an associated norm defined by
Hilbert Spaces Recall that any inner product space V has an associated norm defined by v = v v. Thus an inner product space can be viewed as a special kind of normed vector space. In particular every inner
More informationSemidefinite Programming and Harmonic Analysis
1 / 74 Semidefinite Programming and Harmonic Analysis Cristóbal Guzmán CS 8803 - Discrete Fourier Analysis and Applications March 7, 2012 2 / 74 Motivation SDP gives best relaxations known for some combinatorial
More informationMATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors.
MATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors. Orthogonal sets Let V be a vector space with an inner product. Definition. Nonzero vectors v 1,v
More informationSPECTRAL THEORY EVAN JENKINS
SPECTRAL THEORY EVAN JENKINS Abstract. These are notes from two lectures given in MATH 27200, Basic Functional Analysis, at the University of Chicago in March 2010. The proof of the spectral theorem for
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationStrictly Positive Definite Functions on a Real Inner Product Space
Strictly Positive Definite Functions on a Real Inner Product Space Allan Pinkus Abstract. If ft) = a kt k converges for all t IR with all coefficients a k 0, then the function f< x, y >) is positive definite
More information1.3 Linear Dependence & span K
( ) Conversely, suppose that every vector v V can be expressed uniquely as v = u +w for u U and w W. Then, the existence of this expression for each v V is simply the statement that V = U +W. Moreover,
More informationSemidefinite programming bounds for spherical codes
Semidefinite programming bounds for spherical codes Christine Bachoc IMB, Université Bordeaux I 351, cours de la Libération 33405 Talence France bachoc@mathu-bordeaux1fr Fran Vallentin Centrum voor Wisunde
More informationOn Euclidean designs and potential energy
On Euclidean designs and potential energy Tsuyoshi Miezaki Department of Mathematics Oita National College of Technology Oita, 870 0152, Japan miezaki@oita-ct.ac.jp Makoto Tagami Department of Mechanical
More information4 Group representations
Physics 9b Lecture 6 Caltech, /4/9 4 Group representations 4. Examples Example : D represented as real matrices. ( ( D(e =, D(c = ( ( D(b =, D(b =, D(c = Example : Circle group as rotation of D real vector
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationClassification of root systems
Classification of root systems September 8, 2017 1 Introduction These notes are an approximate outline of some of the material to be covered on Thursday, April 9; Tuesday, April 14; and Thursday, April
More informationStrictly positive definite functions on a real inner product space
Advances in Computational Mathematics 20: 263 271, 2004. 2004 Kluwer Academic Publishers. Printed in the Netherlands. Strictly positive definite functions on a real inner product space Allan Pinkus Department
More informationDelsarte-Yudin LP method and Universal Lower Bound on energy
Peter Dragnev, IPFW Delsarte-Yudin LP method and Universal Lower Bound on energy Peter Dragnev Indiana University-Purdue University Fort Wayne Joint work with: P. Boyvalenkov (BAS); D. Hardin, E. Saff
More informationDavid Hilbert was old and partly deaf in the nineteen thirties. Yet being a diligent
Chapter 5 ddddd dddddd dddddddd ddddddd dddddddd ddddddd Hilbert Space The Euclidean norm is special among all norms defined in R n for being induced by the Euclidean inner product (the dot product). A
More informationTomato Packing and Lettuce-Based Crypto
Tomato Packing and Lettuce-Based Crypto A. S. Mosunov and L. A. Ruiz-Lopez University of Waterloo Joint PM & C&O Colloquium March 30th, 2017 Spring in Waterloo Love is everywhere... Picture from https://avatanplus.com/files/resources/mid/
More informationMath 396. Quotient spaces
Math 396. Quotient spaces. Definition Let F be a field, V a vector space over F and W V a subspace of V. For v, v V, we say that v v mod W if and only if v v W. One can readily verify that with this definition
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationSphere packing, lattice packing, and related problems
Sphere packing, lattice packing, and related problems Abhinav Kumar Stony Brook April 25, 2018 Sphere packings Definition A sphere packing in R n is a collection of spheres/balls of equal size which do
More informationCambridge University Press The Mathematics of Signal Processing Steven B. Damelin and Willard Miller Excerpt More information
Introduction Consider a linear system y = Φx where Φ can be taken as an m n matrix acting on Euclidean space or more generally, a linear operator on a Hilbert space. We call the vector x a signal or input,
More informationExercise Solutions to Functional Analysis
Exercise Solutions to Functional Analysis Note: References refer to M. Schechter, Principles of Functional Analysis Exersize that. Let φ,..., φ n be an orthonormal set in a Hilbert space H. Show n f n
More informationWe saw in the last chapter that the linear Hamming codes are nontrivial perfect codes.
Chapter 5 Golay Codes Lecture 16, March 10, 2011 We saw in the last chapter that the linear Hamming codes are nontrivial perfect codes. Question. Are there any other nontrivial perfect codes? Answer. Yes,
More informationQUATERNIONS AND ROTATIONS
QUATERNIONS AND ROTATIONS SVANTE JANSON 1. Introduction The purpose of this note is to show some well-known relations between quaternions and the Lie groups SO(3) and SO(4) (rotations in R 3 and R 4 )
More information2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.
Chapter 3 Duality in Banach Space Modern optimization theory largely centers around the interplay of a normed vector space and its corresponding dual. The notion of duality is important for the following
More informationMATH 430 PART 2: GROUPS AND SUBGROUPS
MATH 430 PART 2: GROUPS AND SUBGROUPS Last class, we encountered the structure D 3 where the set was motions which preserve an equilateral triangle and the operation was function composition. We determined
More informationMIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???
MIT 6.972 Algebraic techniques and semidefinite optimization May 9, 2006 Lecture 2 Lecturer: Pablo A. Parrilo Scribe:??? In this lecture we study techniques to exploit the symmetry that can be present
More informationMath 261 Lecture Notes: Sections 6.1, 6.2, 6.3 and 6.4 Orthogonal Sets and Projections
Math 6 Lecture Notes: Sections 6., 6., 6. and 6. Orthogonal Sets and Projections We will not cover general inner product spaces. We will, however, focus on a particular inner product space the inner product
More information22 Approximations - the method of least squares (1)
22 Approximations - the method of least squares () Suppose that for some y, the equation Ax = y has no solutions It may happpen that this is an important problem and we can t just forget about it If we
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationLinear Programming Redux
Linear Programming Redux Jim Bremer May 12, 2008 The purpose of these notes is to review the basics of linear programming and the simplex method in a clear, concise, and comprehensive way. The book contains
More informationKernel Method: Data Analysis with Positive Definite Kernels
Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University
More informationThere are two things that are particularly nice about the first basis
Orthogonality and the Gram-Schmidt Process In Chapter 4, we spent a great deal of time studying the problem of finding a basis for a vector space We know that a basis for a vector space can potentially
More informationMathematical Methods wk 1: Vectors
Mathematical Methods wk : Vectors John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationMathematical Methods wk 1: Vectors
Mathematical Methods wk : Vectors John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationFunctional Analysis HW #5
Functional Analysis HW #5 Sangchul Lee October 29, 2015 Contents 1 Solutions........................................ 1 1 Solutions Exercise 3.4. Show that C([0, 1]) is not a Hilbert space, that is, there
More informationReproducing Kernel Hilbert Spaces
9.520: Statistical Learning Theory and Applications February 10th, 2010 Reproducing Kernel Hilbert Spaces Lecturer: Lorenzo Rosasco Scribe: Greg Durrett 1 Introduction In the previous two lectures, we
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationThe value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.
Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class
More information1 Invariant subspaces
MATH 2040 Linear Algebra II Lecture Notes by Martin Li Lecture 8 Eigenvalues, eigenvectors and invariant subspaces 1 In previous lectures we have studied linear maps T : V W from a vector space V to another
More informationINVARIANT PROBABILITIES ON PROJECTIVE SPACES. 1. Introduction
INVARIANT PROBABILITIES ON PROJECTIVE SPACES YVES DE CORNULIER Abstract. Let K be a local field. We classify the linear groups G GL(V ) that preserve an probability on the Borel subsets of the projective
More informationMath 413/513 Chapter 6 (from Friedberg, Insel, & Spence)
Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) David Glickenstein December 7, 2015 1 Inner product spaces In this chapter, we will only consider the elds R and C. De nition 1 Let V be a vector
More informationHomework set 4 - Solutions
Homework set 4 - Solutions Math 407 Renato Feres 1. Exercise 4.1, page 49 of notes. Let W := T0 m V and denote by GLW the general linear group of W, defined as the group of all linear isomorphisms of W
More informationInvariant Semidefinite Programs
Invariant Semidefinite Programs Christine Bachoc Université Bordeaux I, IMB Modern trends in Optimization and its Application, IPAM Optimization Tutorials, september 14-17, 2010 Outline of Part I Invariant
More informationSecant Varieties of Segre Varieties. M. Catalisano, A.V. Geramita, A. Gimigliano
. Secant Varieties of Segre Varieties M. Catalisano, A.V. Geramita, A. Gimigliano 1 I. Introduction Let X P n be a reduced, irreducible, and nondegenerate projective variety. Definition: Let r n, then:
More information10. Smooth Varieties. 82 Andreas Gathmann
82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It
More informationMath 110, Spring 2015: Midterm Solutions
Math 11, Spring 215: Midterm Solutions These are not intended as model answers ; in many cases far more explanation is provided than would be necessary to receive full credit. The goal here is to make
More informationLinear Equations in Linear Algebra
Linear Equations in Linear Algebra.7 LINEAR INDEPENDENCE LINEAR INDEPENDENCE Definition: An indexed set of vectors {v,, v p } in n is said to be linearly independent if the vector equation x x x 2 2 p
More informationChapter 8 Integral Operators
Chapter 8 Integral Operators In our development of metrics, norms, inner products, and operator theory in Chapters 1 7 we only tangentially considered topics that involved the use of Lebesgue measure,
More information33 Idempotents and Characters
33 Idempotents and Characters On this day I was supposed to talk about characters but I spent most of the hour talking about idempotents so I changed the title. An idempotent is defined to be an element
More informationSmith theory. Andrew Putman. Abstract
Smith theory Andrew Putman Abstract We discuss theorems of P. Smith and Floyd connecting the cohomology of a simplicial complex equipped with an action of a finite p-group to the cohomology of its fixed
More informationInner product spaces. Layers of structure:
Inner product spaces Layers of structure: vector space normed linear space inner product space The abstract definition of an inner product, which we will see very shortly, is simple (and by itself is pretty
More informationLecture 5. 1 Goermans-Williamson Algorithm for the maxcut problem
Math 280 Geometric and Algebraic Ideas in Optimization April 26, 2010 Lecture 5 Lecturer: Jesús A De Loera Scribe: Huy-Dung Han, Fabio Lapiccirella 1 Goermans-Williamson Algorithm for the maxcut problem
More informationLecture 11. Andrei Antonenko. February 26, Last time we studied bases of vector spaces. Today we re going to give some examples of bases.
Lecture 11 Andrei Antonenko February 6, 003 1 Examples of bases Last time we studied bases of vector spaces. Today we re going to give some examples of bases. Example 1.1. Consider the vector space P the
More informationMOMENT METHODS IN ENERGY MINIMIZATION: NEW BOUNDS FOR RIESZ MINIMAL ENERGY PROBLEMS
MOMENT METHODS IN ENERGY MINIMIZATION: NEW BOUNDS FOR RIESZ MINIMAL ENERGY PROBLEMS DAVID DE LAAT Abstract. We use moment methods to construct a converging hierarchy of optimization problems to lower bound
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh June 2009 1 Linear independence These problems both appeared in a course of Benny Sudakov at Princeton, but the links to Olympiad problems are due to Yufei
More informationBOUNDS FOR SOLID ANGLES OF LATTICES OF RANK THREE
BOUNDS FOR SOLID ANGLES OF LATTICES OF RANK THREE LENNY FUKSHANSKY AND SINAI ROBINS Abstract. We find sharp absolute consts C and C with the following property: every well-rounded lattice of rank 3 in
More informationMath 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam
Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system
More informationCS 6820 Fall 2014 Lectures, October 3-20, 2014
Analysis of Algorithms Linear Programming Notes CS 6820 Fall 2014 Lectures, October 3-20, 2014 1 Linear programming The linear programming (LP) problem is the following optimization problem. We are given
More informationElements of Positive Definite Kernel and Reproducing Kernel Hilbert Space
Elements of Positive Definite Kernel and Reproducing Kernel Hilbert Space Statistical Inference with Reproducing Kernel Hilbert Space Kenji Fukumizu Institute of Statistical Mathematics, ROIS Department
More informationSpanning, linear dependence, dimension
Spanning, linear dependence, dimension In the crudest possible measure of these things, the real line R and the plane R have the same size (and so does 3-space, R 3 ) That is, there is a function between
More informationExercises to Applied Functional Analysis
Exercises to Applied Functional Analysis Exercises to Lecture 1 Here are some exercises about metric spaces. Some of the solutions can be found in my own additional lecture notes on Blackboard, as the
More informationInduction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2
Induction 0-8-08 Induction is used to prove a sequence of statements P(), P(), P(3),... There may be finitely many statements, but often there are infinitely many. For example, consider the statement ++3+
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008. This chapter is available free to all individuals, on the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationMATH 225 Summer 2005 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 2005
MATH 225 Summer 25 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 25 Department of Mathematical and Statistical Sciences University of Alberta Question 1. [p 224. #2] The set of all
More informationThe Witt designs, Golay codes and Mathieu groups
The Witt designs, Golay codes and Mathieu groups 1 The Golay codes Let V be a vector space over F q with fixed basis e 1,..., e n. A code C is a subset of V. A linear code is a subspace of V. The vector
More information4 Chapter 4 Lecture Notes. Vector Spaces and Subspaces
Math 2040 Matrix Theory and Linear Algebra II 4 hapter 4 Lecture Notes. Vector Spaces and Subspaces 4.1 Vector Spaces and Subspaces 1. Notation: The symbol means the empty set. The symbol means is an element
More informationTheorema Egregium, Intrinsic Curvature
Theorema Egregium, Intrinsic Curvature Cartan s second structural equation dω 12 = K θ 1 θ 2, (1) is, as we have seen, a powerful tool for computing curvature. But it also has far reaching theoretical
More informationNormality of adjointable module maps
MATHEMATICAL COMMUNICATIONS 187 Math. Commun. 17(2012), 187 193 Normality of adjointable module maps Kamran Sharifi 1, 1 Department of Mathematics, Shahrood University of Technology, P. O. Box 3619995161-316,
More informationMIDTERM I LINEAR ALGEBRA. Friday February 16, Name PRACTICE EXAM SOLUTIONS
MIDTERM I LIEAR ALGEBRA MATH 215 Friday February 16, 2018. ame PRACTICE EXAM SOLUTIOS Please answer the all of the questions, and show your work. You must explain your answers to get credit. You will be
More informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More informationarxiv: v2 [math.oa] 21 Nov 2010
NORMALITY OF ADJOINTABLE MODULE MAPS arxiv:1011.1582v2 [math.oa] 21 Nov 2010 K. SHARIFI Abstract. Normality of bounded and unbounded adjointable operators are discussed. Suppose T is an adjointable operator
More informationINF-SUP CONDITION FOR OPERATOR EQUATIONS
INF-SUP CONDITION FOR OPERATOR EQUATIONS LONG CHEN We study the well-posedness of the operator equation (1) T u = f. where T is a linear and bounded operator between two linear vector spaces. We give equivalent
More informationCHAPTER 6. Representations of compact groups
CHAPTER 6 Representations of compact groups Throughout this chapter, denotes a compact group. 6.1. Examples of compact groups A standard theorem in elementary analysis says that a subset of C m (m a positive
More informationALGEBRAIC GROUPS. Disclaimer: There are millions of errors in these notes!
ALGEBRAIC GROUPS Disclaimer: There are millions of errors in these notes! 1. Some algebraic geometry The subject of algebraic groups depends on the interaction between algebraic geometry and group theory.
More informationLecture 7: Semidefinite programming
CS 766/QIC 820 Theory of Quantum Information (Fall 2011) Lecture 7: Semidefinite programming This lecture is on semidefinite programming, which is a powerful technique from both an analytic and computational
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationMATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003
MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003 1. True or False (28 points, 2 each) T or F If V is a vector space
More informationMath 54. Selected Solutions for Week 5
Math 54. Selected Solutions for Week 5 Section 4. (Page 94) 8. Consider the following two systems of equations: 5x + x 3x 3 = 5x + x 3x 3 = 9x + x + 5x 3 = 4x + x 6x 3 = 9 9x + x + 5x 3 = 5 4x + x 6x 3
More information1 Last time: multiplying vectors matrices
MATH Linear algebra (Fall 7) Lecture Last time: multiplying vectors matrices Given a matrix A = a a a n a a a n and a vector v = a m a m a mn Av = v a a + v a a v v + + Rn we define a n a n a m a m a mn
More informationThe Gram Schmidt Process
u 2 u The Gram Schmidt Process Now we will present a procedure, based on orthogonal projection, that converts any linearly independent set of vectors into an orthogonal set. Let us begin with the simple
More informationThe Gram Schmidt Process
The Gram Schmidt Process Now we will present a procedure, based on orthogonal projection, that converts any linearly independent set of vectors into an orthogonal set. Let us begin with the simple case
More informationMA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra
206/7 MA03 Introduction to Abstract Mathematics Second part, Analysis and Algebra Amol Sasane Revised by Jozef Skokan, Konrad Swanepoel, and Graham Brightwell Copyright c London School of Economics 206
More informationSupport Vector Machines
Support Vector Machines Support vector machines (SVMs) are one of the central concepts in all of machine learning. They are simply a combination of two ideas: linear classification via maximum (or optimal
More informationALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ.
ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ANDREW SALCH 1. Hilbert s Nullstellensatz. The last lecture left off with the claim that, if J k[x 1,..., x n ] is an ideal, then
More informationhere, this space is in fact infinite-dimensional, so t σ ess. Exercise Let T B(H) be a self-adjoint operator on an infinitedimensional
15. Perturbations by compact operators In this chapter, we study the stability (or lack thereof) of various spectral properties under small perturbations. Here s the type of situation we have in mind:
More informationRepresentation theory and quantum mechanics tutorial Spin and the hydrogen atom
Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Justin Campbell August 3, 2017 1 Representations of SU 2 and SO 3 (R) 1.1 The following observation is long overdue. Proposition
More informationLecture 4 February 2
4-1 EECS 281B / STAT 241B: Advanced Topics in Statistical Learning Spring 29 Lecture 4 February 2 Lecturer: Martin Wainwright Scribe: Luqman Hodgkinson Note: These lecture notes are still rough, and have
More informationMath 210C. The representation ring
Math 210C. The representation ring 1. Introduction Let G be a nontrivial connected compact Lie group that is semisimple and simply connected (e.g., SU(n) for n 2, Sp(n) for n 1, or Spin(n) for n 3). Let
More informationMatroid intersection, base packing and base covering for infinite matroids
Matroid intersection, base packing and base covering for infinite matroids Nathan Bowler Johannes Carmesin June 25, 2014 Abstract As part of the recent developments in infinite matroid theory, there have
More informationRepresenter theorem and kernel examples
CS81B/Stat41B Spring 008) Statistical Learning Theory Lecture: 8 Representer theorem and kernel examples Lecturer: Peter Bartlett Scribe: Howard Lei 1 Representer Theorem Recall that the SVM optimization
More informationInner Product Spaces
Inner Product Spaces Introduction Recall in the lecture on vector spaces that geometric vectors (i.e. vectors in two and three-dimensional Cartesian space have the properties of addition, subtraction,
More informationChapter 1: Linear Equations
Chapter : Linear Equations (Last Updated: September, 7) The material for these notes is derived primarily from Linear Algebra and its applications by David Lay (4ed).. Systems of Linear Equations Before
More informationFOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 41
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 41 RAVI VAKIL CONTENTS 1. Normalization 1 2. Extending maps to projective schemes over smooth codimension one points: the clear denominators theorem 5 Welcome back!
More informationMATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION
MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether
More informationChapter 6: Orthogonality
Chapter 6: Orthogonality (Last Updated: November 7, 7) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved around.. Inner products
More informationREAL ANALYSIS II HOMEWORK 3. Conway, Page 49
REAL ANALYSIS II HOMEWORK 3 CİHAN BAHRAN Conway, Page 49 3. Let K and k be as in Proposition 4.7 and suppose that k(x, y) k(y, x). Show that K is self-adjoint and if {µ n } are the eigenvalues of K, each
More informationDelsarte s linear programming bound
15-859 Coding Theory, Fall 14 December 5, 2014 Introduction For all n, q, and d, Delsarte s linear program establishes a series of linear constraints that every code in F n q with distance d must satisfy.
More informationHW 4 SOLUTIONS. , x + x x 1 ) 2
HW 4 SOLUTIONS The Way of Analysis p. 98: 1.) Suppose that A is open. Show that A minus a finite set is still open. This follows by induction as long as A minus one point x is still open. To see that A
More informationLecture 10: Vector Algebra: Orthogonal Basis
Lecture 0: Vector Algebra: Orthogonal Basis Orthogonal Basis of a subspace Computing an orthogonal basis for a subspace using Gram-Schmidt Orthogonalization Process Orthogonal Set Any set of vectors that
More information