Where do alternating multilinear maps come from?
|
|
- Jessica Davidson
- 5 years ago
- Views:
Transcription
1 Where do alternatng multlnear maps come from? Aaron Fenyes May 24, 2012 Abstract Alternatng multlnear maps, as the pontwse consttuents of dfferental forms, play a fundamental role n dfferental geometry, whle other knds of multlnear maps for example, symmetrc ones hardly show up at all. [1] In these notes, I ll try to llumnate the geometrc nature of alternatng maps by lnkng them to our ntutve concepts of volume and area. 1 What s volume? A parallelepped s one of the smplest knds of shapes. You can specfy a k- dmensonal parallelepped by gvng k vectors, lke ths: Fgure 1: 0-, 1-, 2-, and 3-dmensonal paralleleppeds. I ll call these k vectors the legs of the parallelepped. Any engneer can tell you that n an n-dmensonal vector space, every n- dmensonal parallelepped s assocated wth a non-negatve real number, called ts volume. I don t know exactly what ths volume s, but I do know t has the followng propertes: 1. If you stretch a parallelepped by multplyng one of ts legs by a scalar λ, ts volume gets multpled by λ. 1
2 2. If you shear a parallelepped by addng a multple of one of ts legs to another leg, ts volume stays the same. More formally, n an n-dmensonal vector space V over an absolute value feld 1 K, the functon ε: V n [0, ) that sends the legs of an n-parallelepped to ts volume has the followng propertes: 1. For any λ K, ε(... λv...) = λ ε(... v...). 2. For any λ K and, ε(... v... w...) = ε(... v + λw... w...). As we ll see n the next secton, these propertes are surprsngly strong for ther sze. They re strong enough, n fact, to determne the volume functon ε unquely, up to multplcaton by a constant. Moreover, they mply that ε s very nce algebracally: n Secton 4, we ll fnd that ε s the absolute value of a multlnear functon, whch s also unque up to scalng. 2 What are volume functons lke? Let s say a volume functon s any functon that fts the descrpton of the functon ε above. If you start playng wth the defnton, you ll soon dscover some general features of volume functons. Proposton 1. If ε s a volume functon, ε(... v... v...) = 0 for all. In other words, ε s alternatng. Proof. Ths follows from the shear property and a blndngly obvous consequence of the stretch property, whch I ll let you fnd for yourself. Proposton 2. If ε s a volume functon, ε(... v... w...) = ε(... w... v...) for all. In other words, ε s symmetrc. 1 That s, a feld equpped wth a map : K [0, ) such that 1. α = 0 f and only f α = αβ = α β. 3. α + β α + β. 2
3 Proof. Just keep poundng away wth the shear property. At the end, you ll need the fact that n an absolute value feld, α = α. More complcated manpulatons uncover features of deeper lnear algebrac sgnfcance. Proposton 3. Say ε s a volume functon. If v 1,..., v n are lnearly dependent, ε(v 1,..., v n ) = 0. Proof. Say α 1 v α n v n = 0, wth at least one of the α nonzero. Snce ε s symmetrc, we can assume wthout loss of generalty that α 1 s nonzero. Then, ε(v 1,..., v n ) = 1 α 1 ε(α 1v 1, v 2,..., v n ) = 1 α 1 ε(α 1v 1 + α 2 v α n v n, v 2,..., v n ) = 1 α 1 ε(0, v 2,..., v n ) = 0. The next feature a partal converse of Proposton 3 depends crucally on the fact that volumes are only defned for paralleleppeds of the same dmenson as V. Lemma 1. Say ε s a volume functon. If there are lnearly ndependent vectors v 1,..., v n for whch ε(v 1,..., v n ) = 0, then ε = 0. Proof. Suppose the proposton holds when n = m, for some m 1, and consder the case n = m + 1. Suppose there are lnearly ndependent vectors v 1,..., v m+1 V for whch ε(v 1,..., v m+1 ) = 0. Pck any vectors w 1,..., w m+1 V. Our goal s to show that ε(w 1,..., w m+1 ) = 0. If w 1,..., w m+1 are lnearly dependent, ths follows mmedately from Proposton 3, so we only need to consder the case where w 1,..., w m+1 are lnearly ndependent. Snce n = m + 1 s the dmenson of V, the vectors v 1,..., v m+1 form a bass for V. Lnear ndependence guarantees that w m+1 0, so at least one component of w m+1 n ths bass s nonzero. Snce ε s symmetrc, we can reorder the vectors v 1,..., v m+1 however we lke and stll have ε(v 1,..., v m+1 ) = 0, so we mght as well choose an order for whch the v m+1 component of w m+1 s nonzero. Let U be the subspace of V spanned by v 1,..., v m. Snce the v m+1 component of w m+1 s nonzero, we can fnd α 1,..., α m such that w = w +α w m+1 les n U for all {1... m}. Snce w 1,..., w m+1 are lnearly ndependent, so are w 1,..., w m. As a result, w 1,..., w m span U. We can therefore fnd β 1,..., β m such that w m+1 + β 1 w β m w m = λv m+1. By the shear property, ε(w 1,..., w m, w m+1 ) = ε( w 1,..., w m, w m+1 ) = ε( w 1,..., w m, λv m+1 ) = λ ε( w 1,..., w m, v m+1 ). 3
4 Defne a functon η : U m K by η(x 1,..., x m ) = ε(x 1,..., x m, v m+1 ). Because m 1, t s smple to verfy that η s a volume functon on U. Observe that v 1,..., v m are lnearly ndependent vectors for whch η(v 1,..., v m ) = 0. Snce we re assumng the proposton holds n dmenson m, t follows that η = 0, whch means ε(w 1,..., w m, w m+1 ) = λ η( w 1,..., w m ) = 0, whch s what we wanted to show. We have now proven that f the proposton holds when n = m, for some m 1, t also holds when n = m + 1. When n = 1, the proposton follows easly from the stretch property, so the proposton holds for all n 1. Snce an empty set of vectors s lnearly ndependent, the proposton also holds for n = 0. Its proof n ths case s left as a somewhat mnd-bendng exercse for the reader. (There s actually no need to consder the n = 0 case separately, but dong so allows a much clearer treatment of the other cases.) Wth Lemma 1 n hand, the man result of ths secton follows by a clever flck of the wrst. Theorem 1. If ε and η are volume functons, one s a constant multple of the other. Proof. The theorem s obvously true f ε = 0, so we only have to consder the case ε 0. Choose a bass v 1,..., v n for V. Because ε 0, Lemma 1 guarantees that ε(v 1,..., v n ) 0, so C = η(v 1,..., v n ) ε(v 1,..., v n ) s well-defned. Let δ : V n [0, ) be the functon δ(w 1,..., w n ) = η(w 1,..., w n ) Cε(w 1,..., w n ) R, where R s the standard absolute value on R. It s not hard to show that δ s a volume functon. By constructon, δ(v 1,..., v n ) = 0, so δ = 0 by Lemma 1. 3 Where does volume come from? The noton of volume s an essental part of our everyday experence what one mght call the real world. A volume functon, however, can be defned on a vector space over any absolute value feld K. The absolute value serves as an ntermedary between the K world and the real world, convertng the K scale factor λ nto the real scale factor λ n the statement of the stretch property. Metaphorcally, a volume functon looks somethng lke ths: 4
5 Fgure 2: A volume functon as a flower. Lke a flower, a volume functon has part of ts structure hdden underground, n the K world. In the next secton, we ll explore volume s K-valued roots. 4 Pre-volume functons A volume functon assocates every n-parallelepped n an n-dmensonal vector space wth a non-negatve real number. Let s try assocatng every n- parallelepped wth a scalar nstead. We ll call our assocaton a pre-volume functon f t has the followng propertes: 1. If you stretch a parallelepped by multplyng one of ts legs by a scalar λ, ts pre-volume gets multpled by λ. 2. If you shear a parallelepped by addng a multple of one of ts legs to another leg, ts pre-volume stays the same. More formally, a pre-volume on an n-dmensonal vector space V over a feld K s a functon E : V n K wth the followng propertes: 1. For any λ K, 2. For any λ K and, It s mmedately apparent that... E(... λv...) = λe(... v...). E(... v... w...) = E(... v + λw... w...). Proposton 4. If K s an absolute value feld, the absolute value of a prevolume functon s a volume functon. 5
6 We ll soon learn that the converse s also true: every volume functon s the absolute value of a pre-volume functon. Pre-volume functons act a lot lke volume functons. The followng propostons, for example, are almost dentcal to our frst three propostons about volume functons, and they re proven n essentally the same way. Proposton 5. If E s a pre-volume functon, E(... v... v...) = 0 for all. In other words, E s alternatng. Proposton 6. If E s a pre-volume functon, E(... v... w...) = E(... w... v...) for all. In other words, E s skew-symmetrc. Proposton 7. Say E s a pre-volume functon. If v 1,..., v n are lnearly dependent, E(v 1,..., v n ) = 0. For volume functons, our next step was to prove a partal converse of the thrd proposton, usng the fact that volumes are only defned for paralleleppeds of the same dmenson as V. For pre-volume functons, we can get a much stronger result. Lemma 2. Every pre-volume functon s multlnear. Proof. Say E : V n K s a pre-volume. Our goal s to show that E has the followng propertes: 1. E(... λv...) = λe(... v...) 2. E(... v + w...) = E(... v...) + E(... w...) The frst property s ust the stretch property, so t holds by defnton. Snce E s skew-symmetrc, we only have to prove the second property for = 1. Let A = E(u, v 2,..., v n ) B = E(ũ, v 2,..., v n ) C = E(u + ũ, v 2,..., v n ). We want to show that A + B = C. If v 2,..., v n are lnearly dependent, ths follows mmedately from Proposton 7, so we only need to consder the case where v 2,..., v n are lnearly ndependent. If u les n the subspace spanned by v 2,..., v n, the shear property can be used to show that A = 0 and C = B, and the desred result follows. Hence, we only need to consder the case where u, v 2,..., v n are lnearly ndependent. 6
7 Snce n s the dmenson of V, the vectors u, v 2,..., v n span V. That means we can wrte ũ as λu + x, where x les n the subspace spanned by v 2,..., v n. Notce that u + ũ = (λ + 1)u + x. By the shear property, B = E(λu, v 2,..., v n ) C = E((λ + 1)u, v 2,..., v n ), so the stretch property gves B = λa and C = (λ + 1)A. The desred result follows. We now have an extremely useful characterzaton of pre-volume functons. Theorem 2. A functon V n K s a pre-volume f and only f t s multlnear and alternatng. Proof. The only f drecton s gven by Proposton 5 and Lemma 2, and the f drecton s a straghtforward exercse n defnton-chasng. Ths characterzaton makes t easy to prove that pre-volume functons always exst, and are unque up to scalng. In fact... Corollary 1. The pre-volume functons on V form a one-dmensonal vector space. Proof. The alternatng multlnear functons V n K form a vector space under the usual addton and scalar multplcaton of functons. If v 1,..., v n s a bass for V, an alternatng multlnear functon E : V n K s completely determned by the value E(v 1,..., v n ), and any choce of E(v 1,..., v n ) gves an alternatng multlnear functon. Hence, the space of alternatng multlnear functons V n K s one-dmensonal. Together, the exstence of pre-volume functons and the unqueness of volume functons mply the converse of Proposton 4. Theorem 3. Every volume functon s the absolute value of a pre-volume functon. Proof. Say K s an absolute value feld, and ε s a volume functon on V. Corollary 1 guarantees the exstence of a nonzero pre-volume functon H on V, and Proposton 4 tells us that the absolute value η of H s a volume functon. By Theorem 1, one of the volume functons ε and η s a multple of the other. Snce η s nonzero, t follows that ε s a multple of η. Usng ths result, we can turn Theorem 2 nto a nce characterzaton of volume functons. Corollary 2. If K s an absolute value feld, a functon V n [0, ) s a volume functon f and only f t s the absolute value of an alternatng multlnear functon. 7
8 5 What s area? Imagne you wake up one mornng to fnd a two-dmensonal parallelepped floatng n the ar outsde your wndow. Naturally, you d lke to know more about t. Your frst thought s to measure ts volume usng a volume functon, but of course that doesn t make sense: n a three-dmensonal space, volumes are only defned for three-dmensonal paralleleppeds. If you could somehow wrestle the parallelepped to the ground, you could pn t flat aganst a two-dmensonal board and measure ts volume there. Unfortunately, the parallelepped s far out of reach. A few mnutes of furous ponderng brng you no closer to satsfyng your curosty, so you decde to forget about the apparton altogether. As you re leavng for work, however, you happen to glance up and notce that the mornng sun s castng a shadow of the parallelepped aganst the wall of your buldng. Now there s an dea! The shadow s a two-dmensonal parallelepped n a twodmensonal space, so you can measure ts volume wth a volume functon. As the sun moves across the sky, t ll llumnate the parallelepped from other drectons and cast ts shadow aganst other surfaces. You can use these multple perspectves to buld up a more complete pcture of your mysterous vstor. The story I ve ust told may not hold up under phlosophcal scrutny, but t suggests a reasonably natural way of generalzng the noton of volume to lower-dmensonal paralleleppeds. Ths generalzaton, whch I ll call area, wll be the subect of the next secton. 6 Area functons Let s say a k-area functon on a vector space V s a functon α: V k [0, ) of the form α(v 1,..., v k ) = ε(lv 1,..., Lv k ), where L: V W s a lnear map, W s a k-dmensonal vector space, and ε: W k [0, ) s a volume functon. (For ths to make sense, the base feld K has to be an absolute value feld.) Smlarly, we ll defne a k-pre-area functon on V as a functon A: V k K of the form A(v 1,..., v k ) = E(Lv 1,..., Lv k ), where L and W are as before, and E : W k K s a pre-volume functon. If n s the dmenson of V, an n-area s the same thng as a volume, and an n- pre-area s the same thng as a pre-volume. Hence, area really s a generalzaton of volume. In Secton 4 (Theorem 2), we used the noton of pre-volume to characterze the alternatng multlnear functons V n K. Now, more generally, we can use the noton of pre-area to characterze the alternatng multlnear functons V k K for any k. 8
9 Theorem 4. A map V k K s multlnear and alternatng f and only f t can be wrtten as a lnear combnaton of k-pre-areas. Proof. The f drecton s easy. We ll start the only f drecton by pckng a bass v 1,..., v n for V. For each functon I : {1... k} {1... n}, defne θ I : V k K as the unque multlnear functon wth the property that { 1 J = I θ I (v J(1),..., v J(k) ) = 0 J I for all J : {1... k} {1... n}. For each strctly ncreasng functon I : {1... k} {1... n}, defne χ I (w 1,..., w k ) = σ sgn(σ)θ I (w σ(1),..., w σ(k) ), where σ runs over all the permutatons of {1... k}. Any multlnear functon can be wrtten as a lnear combnaton of the θ I. Snce every alternatng multlnear functon s skew-symmetrc, any alternatng multlnear functon can be wrtten as a lnear combnaton of the χ I. It s apparent from the defnton that each χ I s alternatng and skewsymmetrc when ts arguments are restrcted to the set of bass vectors. A short calculaton then proves that χ I s alternatng for all arguments. It follows that each χ I s a k-pre-area, because χ I s a pre-volume when ts arguments are restrcted to the subspace spanned by v I(1),..., v I(k). Ths result lnks alternatng multlnear maps to the geometrc concept of area, usng the noton of pre-area as an ntermedary. In other words, t does exactly what I set out to do n the abstract of these notes. Unfortunately, the connecton I ve establshed s a lot more subtle than I d hoped t would be. The subtlety s that, although Proposton 4 and Theorem 3 let us pass from pre-areas to areas and back n a straghtforward way, they don t tell us what to make of a lnear combnaton of pre-areas. In the case of n-pre-areas, the pont s moot, because a lnear combnaton of n-pre-areas s tself an n-prearea (Corollary 1). Ths fact gves us a drect connecton between n-lnear maps and n-areas, enshrned n Corollary 2. For general k-pre-areas, however, the subtlety remans; untl t can be resolved, the story told n these notes wll be ncomplete. References [1] Matt Noonan. Antsymmetry n geometry, I. In The Everythng Semnar. antsymmetry-n-geometry-/,
2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationAffine and Riemannian Connections
Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More information1 Generating functions, continued
Generatng functons, contnued. Generatng functons and parttons We can make use of generatng functons to answer some questons a bt more restrctve than we ve done so far: Queston : Fnd a generatng functon
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationand problem sheet 2
-8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More information7. Products and matrix elements
7. Products and matrx elements 1 7. Products and matrx elements Based on the propertes of group representatons, a number of useful results can be derved. Consder a vector space V wth an nner product ψ
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationFrom Biot-Savart Law to Divergence of B (1)
From Bot-Savart Law to Dvergence of B (1) Let s prove that Bot-Savart gves us B (r ) = 0 for an arbtrary current densty. Frst take the dvergence of both sdes of Bot-Savart. The dervatve s wth respect to
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More information1 Vectors over the complex numbers
Vectors for quantum mechancs 1 D. E. Soper 2 Unversty of Oregon 5 October 2011 I offer here some background for Chapter 1 of J. J. Sakura, Modern Quantum Mechancs. 1 Vectors over the complex numbers What
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationMAT 578 Functional Analysis
MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More information12. The Hamilton-Jacobi Equation Michael Fowler
1. The Hamlton-Jacob Equaton Mchael Fowler Back to Confguraton Space We ve establshed that the acton, regarded as a functon of ts coordnate endponts and tme, satsfes ( ) ( ) S q, t / t+ H qpt,, = 0, and
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationNon-negative Matrices and Distributed Control
Non-negatve Matrces an Dstrbute Control Yln Mo July 2, 2015 We moel a network compose of m agents as a graph G = {V, E}. V = {1, 2,..., m} s the set of vertces representng the agents. E V V s the set of
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationAn Introduction to Morita Theory
An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationLecture 4. Instructor: Haipeng Luo
Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
More information2 More examples with details
Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationError Bars in both X and Y
Error Bars n both X and Y Wrong ways to ft a lne : 1. y(x) a x +b (σ x 0). x(y) c y + d (σ y 0) 3. splt dfference between 1 and. Example: Prmordal He abundance: Extrapolate ft lne to [ O / H ] 0. [ He
More informationNOTES ON SIMPLIFICATION OF MATRICES
NOTES ON SIMPLIFICATION OF MATRICES JONATHAN LUK These notes dscuss how to smplfy an (n n) matrx In partcular, we expand on some of the materal from the textbook (wth some repetton) Part of the exposton
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationErrata to Invariant Theory with Applications January 28, 2017
Invarant Theory wth Applcatons Jan Drasma and Don Gjswjt http: //www.wn.tue.nl/~jdrasma/teachng/nvtheory0910/lecturenotes12.pdf verson of 7 December 2009 Errata and addenda by Darj Grnberg The followng
More information1 (1 + ( )) = 1 8 ( ) = (c) Carrying out the Taylor expansion, in this case, the series truncates at second order:
68A Solutons to Exercses March 05 (a) Usng a Taylor expanson, and notng that n 0 for all n >, ( + ) ( + ( ) + ) We can t nvert / because there s no Taylor expanson around 0 Lets try to calculate the nverse
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationCHAPTER 4. Vector Spaces
man 2007/2/16 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrel. Abstracton s what makes mathematcs work. Ian Stewart The man am of ths tet s to stud lnear
More informationSpectral Graph Theory and its Applications September 16, Lecture 5
Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph
More informationGeneral theory of fuzzy connectedness segmentations: reconciliation of two tracks of FC theory
General theory of fuzzy connectedness segmentatons: reconclaton of two tracks of FC theory Krzysztof Chrs Ceselsk Department of Mathematcs, West Vrgna Unversty and MIPG, Department of Radology, Unversty
More informationChapter Twelve. Integration. We now turn our attention to the idea of an integral in dimensions higher than one. Consider a real-valued function f : D
Chapter Twelve Integraton 12.1 Introducton We now turn our attenton to the dea of an ntegral n dmensons hgher than one. Consder a real-valued functon f : R, where the doman s a nce closed subset of Eucldean
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationp 1 c 2 + p 2 c 2 + p 3 c p m c 2
Where to put a faclty? Gven locatons p 1,..., p m n R n of m houses, want to choose a locaton c n R n for the fre staton. Want c to be as close as possble to all the house. We know how to measure dstance
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationSrednicki Chapter 34
Srednck Chapter 3 QFT Problems & Solutons A. George January 0, 203 Srednck 3.. Verfy that equaton 3.6 follows from equaton 3.. We take Λ = + δω: U + δω ψu + δω = + δωψ[ + δω] x Next we use equaton 3.3,
More informationR n α. . The funny symbol indicates DISJOINT union. Define an equivalence relation on this disjoint union by declaring v α R n α, and v β R n β
Readng. Ch. 3 of Lee. Warner. M s an abstract manfold. We have defned the tangent space to M va curves. We are gong to gve two other defntons. All three are used n the subject and one freely swtches back
More information( 1) i [ d i ]. The claim is that this defines a chain complex. The signs have been inserted into the definition to make this work out.
Mon, Apr. 2 We wsh to specfy a homomorphsm @ n : C n ()! C n (). Snce C n () s a free abelan group, the homomorphsm @ n s completely specfed by ts value on each generator, namely each n-smplex. There are
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationMathematical Preparations
1 Introducton Mathematcal Preparatons The theory of relatvty was developed to explan experments whch studed the propagaton of electromagnetc radaton n movng coordnate systems. Wthn expermental error the
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationRestricted Lie Algebras. Jared Warner
Restrcted Le Algebras Jared Warner 1. Defntons and Examples Defnton 1.1. Let k be a feld of characterstc p. A restrcted Le algebra (g, ( ) [p] ) s a Le algebra g over k and a map ( ) [p] : g g called
More information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationwhere a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets
5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationINTERSECTION THEORY CLASS 13
INTERSECTION THEORY CLASS 13 RAVI VAKIL CONTENTS 1. Where we are: Segre classes of vector bundles, and Segre classes of cones 1 2. The normal cone, and the Segre class of a subvarety 3 3. Segre classes
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More information