SECTION 6: FIBER BUNDLES

Size: px
Start display at page:

Download "SECTION 6: FIBER BUNDLES"

Transcription

1 SECTION 6: FIBER BUNDLES In this section we will introduce the interesting class o ibrations given by iber bundles. Fiber bundles lay an imortant role in many geometric contexts. For examle, the Grassmaniann varieties and certain iber bundles associated to Stieel varieties are central in the classiication o vector bundles over (nice) saces. The act that iber bundles are examles o Serre ibrations ollows rom Theorem 11 which states that being a Serre ibration is a local roerty. Deinition 1. A iber bundle with iber F is a ma : E X with the ollowing roerty: every oint x X has a neighborhood U X or which there is a homeomorhism φ U : U F = 1 (U) such that the ollowing diagram commutes in which π 1 : U F U is the rojection on the irst actor: U F 1 (U) φ U = π 1 U Remark 2. The rojection X F X is an examle o a iber bundle: it is called the trivial bundle over X with iber F. By deinition, a iber bundle is a ma which is locally homeomorhic to a trivial bundle. The homeomorhism φ U in the deinition is a local trivialization o the bundle, or a trivialization over U. Let us begin with an interesting subclass. A iber bundle whose iber F is a discrete sace is (by deinition) a covering rojection (with iber F ). For examle, the exonential ma R S 1 is a covering rojection with iber Z. Suose X is a sace which is ath-connected and locally simly connected (in act, the weaker condition o being semi-locally simly connected would be enough or the ollowing construction). Let X be the sace o homotoy classes (relative endoints) o aths in X which begin at a given base oint x 0. We can equi X with the quotient toology with resect to the ma P (X, x 0 ) X. The evaluation ɛ 1 : P (X, x 0 ) X induces a well-deined ma X X. One can show that X X is a covering rojection. (It is called the universal covering rojection. A later exercise will exlain this terminology.) Let : E X be a iber bundle with iber F. I : X X is any ma, then the rojection (): X X E X is again a iber bundle with iber F (see Exercise...). We will need the ollowing deinitions. Deinition 3. Let : Y X be an arbitrary ma. (1) A section o over an oen set U X is a ma s: U Y such that s = id U. (2) The ma : Y X has enough local sections i every oints o X has an oen neighborhood on which some local section o exists. Thus, by the very deinition, every iber bundle has enough local sections. And i you know a bit o dierential toology, you ll know that any surjective submersion between smooth maniolds has enough local sections. 1

2 2 SECTION 6: FIBER BUNDLES Many interesting examles o iber bundle show u in the context o nice grou actions. For this urose, let us ormalize this notion. Deinition 4. Let G be a toological grou and let E be a sace. A (right) action o G on E is a ma µ: E G E : (e, g) µ(e, g) = e g such that the ollowing identities hold: e 1 = e and e (gh) = (e g) h, e E, g, h G. I E also comes with a ma : E X such that (e g) = (e) or all e and g, then the action o G restricts to an action on each iber o, and one also says that the action is iberwise. Given a sace E with a right action by G, then there is an induced equivalence relation on E deined by e e i e g = e or some g G. The quotient sace E/ is called the orbit sace o the action, and is usually denoted E/G. The equivalence classes are called the orbits o the action. They are the ibers o the quotient ma π : E E/G. Deinition 5. Let G be a toological grou. A rincial G-bundle is a ma : E B together with a iberwise action o G on E, with the roerty that: (1) The ma φ: E G E B E : (g, e) (e, e g) is a homeomorhism. (2) The ma : E B has enough local sections. Proosition 6. Any rincial G-bundle is a iber bundle with iber G. Proo. Write δ = π 2 φ 1 : E B E E G G or the dierence ma, characterized by the identity e δ(e, e ) = e. I b B and b U B is a neighborhood on which a local section s: U E exists, then the ma U G 1 (U): (x, g) s(x) g is a homeomorhism, with inverse given by e ( (e), δ(s(x), e) ). An imortant source o rincial bundles comes rom the construction o homogeneous saces. Let G be a toological grou, and suose that G is comact and Hausdor. Let H be a closed subgrou o G, and let G/H be the sace o let cosets gh. Then the rojection π : G G/H satisies the irst condition in the deinition o rincial bundles, because the ma φ: G H G (G/H) G: (g, h) (g, gh) is easily seen to be a continuous bijection, and hence it is a homeomorhism by the comact- Hausdor assumtion. So, we conclude that i G G/H has enough local sections, then it is a rincial H-bundle. (For those who know Lie grous: i G is a comact Lie grou and H is a closed subgrou, then G/H is a maniold and G G/H is a submersion, hence has enough local sections.)

3 SECTION 6: FIBER BUNDLES 3 Remark 7. In case you have to rove by hand that π : G G/H has enough local sections, it is useul to observe that it suices to ind a local section on a neighborhood V o π(1) where 1 G is the unit, so π(1) = H G/H. Because i s: V G is such a section, then or another coset gh, the oen set gv is a neighborhood o gh in G/H, and s: gv G deined s(ξ) = gs(g 1 ξ) is a local section on gv. Remark 8. A related construction yields or two closed subgrous K H G a ma G/K G/H which gives us a iber bundle with iber H/K under certain assumtions. (See Exercise...) We will now consider some classical and imortant secial cases o these general constructions or grous, namely the cases o Stieel and Grassmann varieties. We begin by the Stieel varieties. Consider the vector sace R n with its standard basis (e 1,..., e n ). A k-rame in R n (or more exlicitly, an orthonormal k-rame) is a k-tule o vectors in R n, (v 1,..., v k ) with v i, v j = δ ij. Thus, v 1,..., v k orm an orthonormal basis or a k-dimensional subsace s(v 1,..., v k ) R n. We can toologize this sace o k-rames as a subsace o R n... R n (k times). It is a closed and bounded subsace, hence it is comact. This sace is usually denoted and called the Stieel variety. (It has a well-deined dimension: what is it?) Note that V n,k V n,1 = S n 1 is a shere. We claim that V n,k is a homogeneous sace, i.e., a sace o the orm G/H as just discussed. To see this, take or G the grou O(n) o orthogonal transormations o R n. We can think o the elements o O(n) as orthogonal n n matrices, or as n-tules o vectors in R n, (v 1,..., v n ) (the column vectors o the matrix) which orm an orthonormal basis in R n. evident rojection π : O(n) V n,k Thus, there is an which just remembers the irst k vectors. The grou O(n k) can be viewed as a closed subgrou o O(n), using the grou homomorhism ( ) I 0 O(n k) O(n): A 0 A where I = I k is the k k unit matrix. One easily checks (Exercise!) that the rojection induces a homeomorhism O(n)/O(n k) = V n,k. Note that it is again enough to show that we have a continuous bijection since the saces under consideration are comact Hausdor. Thus, to see that π : O(n) V n,k is a rincial bundle, it suices to check that there are enough local sections. This can easily be done exlicitly, using the Gram-Schmidt algorithm or transorming a basis into an orthonormal one. Indeed, as we said above, it is enough to ind a local section on a neighborhood o π(1) = π(e 1,..., e n ) = (e 1,..., e k ). Let U = {(v 1,..., v k ) v 1,..., v k, e k+1,..., e n are linearly indeendent}

4 4 SECTION 6: FIBER BUNDLES and let s(v 1,..., v k ) be the result o alying the Gram-Schmidt to the basis v 1,..., v k, e k+1,..., e n. (This leaves v 1,..., v k unchanged, changes e k+1 into e k+1 v i, e k+1 v i divided by its length, and so on.) Let us observe that this construction o the Stieel varieties also shows that they it into a tower O(n) = V n,n V n,n 1... V n,k V n,k 1... V n,1 = S n 1 in which each ma V n,k V n,k 1 is a rincial bundle with iber: O(n k + 1)/O(n k) = V n k+1,1 = S n k From these Stieel varieties we can now construct the Grassmann varieties. In act, the grou O(k) obviously acts on the Stieel variety V n,k o k-rames in R n. The orbit sace o this action is called the Grassmann variety, and denoted G n,k = V n,k /O(k). The orbit o a k-rame (v 1,..., v k ) only remembers the subsace W sanned by (v 1,..., v k ), because any two orthogonal bases or W can be related by acting by an element o O(k). Thus, G n,k is the sace o k-dimensional subsaces o R n. Since V n,k = O(n)/O(n k), the Grassmann variety is itsel a homogeneous sace G n,k = O(n)/ ( O(k) O(n k) ) where O(k) and O(k) O(n k) are viewed as the subgrous o matrices o the orms ( ) ( ) B 0 B 0 and 0 I 0 A resectively. The quotient ma q : O(n) G n,k is again a rincial bundle (with iber O(k) O(n k)), because q again has enough local sections. Indeed, it suices to construct a local section on a neighborhood o q(i). As a k-dimensional subsace o R n this is R k {0}. Let U = {W R n W R n k = R n } be the subsace o comlements o the subsace R n k R n sanned by e k+1,..., e n, and deine a section s on U as ollows: write w i or the rojection o e i on W, 1 i k, i.e., e i = w i + j>k λ j e j. Then (w 1,..., w k, e +1,..., e n ) still san all o R n, and we can transorm this into an orthonormal basis by Gram-Schmidt, the result o which deines s(w ). It ollows that V n,k G n,k also has enough local sections (why?), so this is a rincial bundle too (or the grou O(k)). Summarizing, we have a diagram o three rincial bundles O(n) V n,k G n,k constructed as O(n) O(n)/O(n k) O(n)/ ( O(k) O(n k) ).

5 SECTION 6: FIBER BUNDLES 5 The relation o these considerations to the revious lecture is given by the ollowing result. Theorem 9. A iber bundle is a Serre ibration. Beore roving this theorem, we draw some immediate consequences by alying the long exact sequence o homotoy grous associated to a Serre ibration to our examles o iber bundles. More alications o this kind can be ound in the exercises. Alication 10. (1) Let : E B be a covering rojection, let e 0 E and let b 0 = (e 0 ). I we denote the iber by F (a discrete sace), then we have ointed mas (F, e 0 ) (E, e 0 ) (B, b 0 ). Then : π i (E, e 0 ) π i (B, b 0 ) is an isomorhism or all i > 0. Moreover, i E is connected then there is short exact sequence 0 π 1 (E) π 1 (B) F 0 where we have omitted base oints rom notation, and where we view F as a ointed set (F, e 0 ). Thus, or the covering R S 1 this gives us π i (S 1 ) = 0 or i > 1, since R is contractible. More generally, or the universal covering rojection X X with iber π 1 (X, x 0 ) we have π i ( X) = π i (X) or i > 1 and π 1 ( X) = 0. These statements all ollow by alying the long exact sequence o a Serre ibration. (2) In the second lecture we stated that π i (S n ) = 0 or i < n (a act that can easily be roved using a bit o dierential toology, but which we haven t given an indeendent roo yet). Using this, we can analyze the long exact sequence associated to the iber bundle O(n) V n,1 = S n 1 with iber O(n 1), to conclude that the ma π i (O(n 1)) π i (O(n)) induced by the inclusion (always with the unit o the grou as the base oint) is an isomorhism or i + 1 < n 1 and a surjection or i < n 1. Writing O(n k) O(n) as a comosition we ind that O(n k) O(n k + 1)... O(n 1) O(n), π i (O(n k)) π i (O(n)) is an isomorhism i i + 1 < n k and is surjective i i < n k. Feeding this back in the long exact sequence or the iber bundle we conclude that O(n) O(n)/O(n k) = V n,k, π i (V n,k ) = 0, i < n k. Now back to the roo o Theorem 9. Instead o roving this theorem, we will rove a slightly more general result (Theorem 11), which can inormally be hrased by saying that being a Serre ibration is a local roerty. Theorem 9 immediately ollows rom this result and the act that trivial ibrations are Serre ibrations.

6 6 SECTION 6: FIBER BUNDLES Theorem 11. Let : E B be a ma with the roerty that every oint b B has a neighborhood U B such that the restriction : 1 (U) U is a Serre ibration. Then : E B is itsel a Serre ibration. The roo o this theorem is relatively straightorward i we assume the ollowing lemma. Recall the ollowing notation rom a revious lecture. Let F = {F a a A} be a amily o aces o the cube I n, and let be the inclusion. J n (F ) = (In {0}) ( a F a I) I n I Lemma 12. A ma : E B is a Serre ibration i and only i it has the RLP with resect to all mas o the orm J n (F ) In I. Note that the i -art is clear because the case F = gives the deinition o a Serre ibration. Earlier on, we have also used the case where F is the amily o all the aces, when J n (F ) In+1 is homeomorhic to I n {0} I n+1. The same is actually true or an arbitrary amily F, but one can also use an inductive argument to reduce the general case to the two cases where F = or F consists o all aces. We will do this ater the roo o Theorem 11. Proo. (o Theorem 11) Let : E B be as in the statement o the theorem, and consider a diagram o solid arrows o the orm I n 1 {0} E h I n B in which we wish to ind a diagonal h as indicated. By assumtion on and comactness o I n, we can ind a natural number k large enough so that or any sequence (i 1,..., i n ) o numbers 0 i 1,..., i n k 1, the small cube [i 1 /k, (i 1 + 1)/k]... [i n /k, (i n + 1)/k] is maed by into an oen set U B over which is a Serre ibration (use the Lebesgue lemma!). Now order all these tules g (i 1,..., i n ) lexicograhically, and list them as C 1,..., C k n. We will deine a lit h by consecutively inding lits h r on C 1... C r I n making the diagram I n 1 {0} E h r C 1... C r B g

7 SECTION 6: FIBER BUNDLES 7 commute. We can ind h 1 because (I n 1 {0}) C 1 is a small coy o I n 1 {0} I n. And given h r, we can extend it to h r+1 by deining h r+1 Cr+1 as a lit in C r+1 ( (I n 1 {0}) (C 1... C r ) ) (g,hr) E h r+1 C r+1 B. Such a lit exists, because C r+1 ( (I n 1 {0}) (C 1... C r ) ) C r+1 is (essentially) a small coy o an inclusion J(F n ) In {0}. (You should draw some ictures or yoursel in the cases n = 2, 3 to see what is going on.) Proo. (o Lemma 12) As we already said it only remains to establish the only i -direction which we already know in the cases o F = or the collection o all aces. We will reduce the intermediate cases to the case o all the aces by induction on n. For n = 0, I 0 has no aces so only the case A = alies and there is nothing to rove. For n = 1, there are our cases, A =, A = {0}, A = {1}, and A = {0, 1}, o which the irst and the last have already been dealt with. For the intermediate case A = {0}, or examle, consider a diagram o the orm I {0} {0} I I 2 E B where : E B is a Serre ibration. Now one can irst ind a lit or {1} {0} E g {1} I B by the case n = 0. Then next ill the ollowing diagram ( ) I {0} {0} I {1} I (,g) E B by the case where F consists o all the aces (the ourth case). I 2

8 8 SECTION 6: FIBER BUNDLES The induction rom n to n + 1 roceeds in exactly the same way: suose F = {F a a A} is a amily o aces o I n+1 or which we wish to ind a lit in a diagram o the orm J n+1 (F ) E I n+1 I B I F does not consist o all the aces, we add a ace G and extend to J n+1 F (G I) = J n+1 F {G} by liting in G {0} a (G F a) I E G I B which is ossible by the earlier case o the induction, because a (G F a ) is a amily o aces o a cube o lower dimension. Ater having done this or all the aces not in F, we arrive at the case where A is the set o all aces which was already settled.

Assignment 9; Due Friday, March 17

Assignment 9; Due Friday, March 17 Assignment 9; Due Friday, March 17 24.4b: A icture of this set is shown below. Note that the set only contains oints on the lines; internal oints are missing. Below are choices for U and V. Notice that

More information

FIBER BUNDLES AND UNIVALENCE

FIBER BUNDLES AND UNIVALENCE FIBER BUNDLES AND UNIVALENCE TALK BY IEKE MOERDIJK; NOTES BY CHRIS KAPULKIN This talk presents a proof that a universal Kan fibration is univalent. The talk was given by Ieke Moerdijk during the conference

More information

A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE

A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE DANIEL A. RAMRAS In these notes we present a construction of the universal cover of a path connected, locally path connected, and semi-locally simply

More information

SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q. 1. Quadratic Extensions

SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q. 1. Quadratic Extensions SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q TREVOR ARNOLD Abstract This aer demonstrates a few characteristics of finite extensions of small degree over the rational numbers Q It comrises attemts

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

Factoring of Prime Ideals in Galois Extensions

Factoring of Prime Ideals in Galois Extensions Chater 8 Factoring of Prime Ideals in Galois Extensions 8.1 Decomosition and Inertia Grous We return to the general AKLB setu: A is a Dedekind domain with fraction field K, L is a finite searable extension

More information

Chapter 6. Orthogonality

Chapter 6. Orthogonality 6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be

More information

LIMITS IN CATEGORY THEORY

LIMITS IN CATEGORY THEORY LIMITS IN CATEGORY THEORY SCOTT MESSICK Abstract. I will start assming no knowledge o category theory and introdce all concepts necessary to embark on a discssion o limits. I will conclde with two big

More information

Group Theory. Contents

Group Theory. Contents Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

More information

SQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWO-DIMENSIONAL GRID

SQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWO-DIMENSIONAL GRID International Journal of Comuter Science & Information Technology (IJCSIT) Vol 6, No 4, August 014 SQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWO-DIMENSIONAL GRID

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

Foundations of mathematics. 2. Set theory (continued)

Foundations of mathematics. 2. Set theory (continued) 2.1. Tuples, amilies Foundations o mathematics 2. Set theory (continued) Sylvain Poirier settheory.net A tuple (or n-tuple, or any integer n) is an interpretation o a list o n variables. It is thus a meta-unction

More information

The cover SU(2) SO(3) and related topics

The cover SU(2) SO(3) and related topics The cover SU(2) SO(3) and related topics Iordan Ganev December 2011 Abstract The subgroup U of unit quaternions is isomorphic to SU(2) and is a double cover of SO(3). This allows a simple computation of

More information

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

More information

Power functions: f(x) = x n, n is a natural number The graphs of some power functions are given below. n- even n- odd

Power functions: f(x) = x n, n is a natural number The graphs of some power functions are given below. n- even n- odd 5.1 Polynomial Functions A polynomial unctions is a unction o the orm = a n n + a n-1 n-1 + + a 1 + a 0 Eample: = 3 3 + 5 - The domain o a polynomial unction is the set o all real numbers. The -intercepts

More information

GROUPS ACTING ON A SET

GROUPS ACTING ON A SET GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

More information

Similarity and Diagonalization. Similar Matrices

Similarity and Diagonalization. Similar Matrices MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

More information

FIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3

FIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3 FIRTION SEQUENES ND PULLK SQURES RY MLKIEWIH bstract. We lay out some foundational facts about fibration sequences and pullback squares of topological spaces. We pay careful attention to connectivity ranges

More information

A Note on Integer Factorization Using Lattices

A Note on Integer Factorization Using Lattices A Note on Integer Factorization Using Lattices Antonio Vera To cite this version: Antonio Vera A Note on Integer Factorization Using Lattices [Research Reort] 2010, 12 HAL Id: inria-00467590

More information

United Arab Emirates University College of Sciences Department of Mathematical Sciences HOMEWORK 1 SOLUTION. Section 10.1 Vectors in the Plane

United Arab Emirates University College of Sciences Department of Mathematical Sciences HOMEWORK 1 SOLUTION. Section 10.1 Vectors in the Plane United Arab Emirates University College of Sciences Deartment of Mathematical Sciences HOMEWORK 1 SOLUTION Section 10.1 Vectors in the Plane Calculus II for Engineering MATH 110 SECTION 0 CRN 510 :00 :00

More information

Inner product. Definition of inner product

Inner product. Definition of inner product Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product

More information

6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks

6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks 6.042/8.062J Mathematics for Comuter Science December 2, 2006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Random Walks Gambler s Ruin Today we re going to talk about one-dimensional random walks. In

More information

Using quantum computing to realize the Fourier Transform in computer vision applications

Using quantum computing to realize the Fourier Transform in computer vision applications Using quantum computing to realize the Fourier Transorm in computer vision applications Renato O. Violin and José H. Saito Computing Department Federal University o São Carlos {renato_violin, saito }@dc.uscar.br

More information

Lecture 1: Schur s Unitary Triangularization Theorem

Lecture 1: Schur s Unitary Triangularization Theorem Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections

More information

Recall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n.

Recall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n. ORTHOGONAL MATRICES Informally, an orthogonal n n matrix is the n-dimensional analogue of the rotation matrices R θ in R 2. When does a linear transformation of R 3 (or R n ) deserve to be called a rotation?

More information

Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces

Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces Communications in Mathematical Physics Manuscript-Nr. (will be inserted by hand later) Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces Stefan Bechtluft-Sachs, Marco Hien Naturwissenschaftliche

More information

The Geometry of Perspective Projection

The Geometry of Perspective Projection The Geometry o Perspective Projection Pinhole camera and perspective projection - This is the simplest imaging device which, however, captures accurately the geometry o perspective projection. -Rays o

More information

NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

More information

v w is orthogonal to both v and w. the three vectors v, w and v w form a right-handed set of vectors.

v w is orthogonal to both v and w. the three vectors v, w and v w form a right-handed set of vectors. 3. Cross product Definition 3.1. Let v and w be two vectors in R 3. The cross product of v and w, denoted v w, is the vector defined as follows: the length of v w is the area of the parallelogram with

More information

Factorization Theorems

Factorization Theorems Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization

More information

A Modified Measure of Covert Network Performance

A Modified Measure of Covert Network Performance A Modified Measure of Covert Network Performance LYNNE L DOTY Marist College Deartment of Mathematics Poughkeesie, NY UNITED STATES lynnedoty@maristedu Abstract: In a covert network the need for secrecy

More information

Solving Systems of Linear Equations

Solving Systems of Linear Equations LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

Math 231b Lecture 35. G. Quick

Math 231b Lecture 35. G. Quick Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the J-homomorphism could be defined by

More information

Orthogonal Projections

Orthogonal Projections Orthogonal Projections and Reflections (with exercises) by D. Klain Version.. Corrections and comments are welcome! Orthogonal Projections Let X,..., X k be a family of linearly independent (column) vectors

More information

Computational Finance The Martingale Measure and Pricing of Derivatives

Computational Finance The Martingale Measure and Pricing of Derivatives 1 The Martingale Measure 1 Comutational Finance The Martingale Measure and Pricing of Derivatives 1 The Martingale Measure The Martingale measure or the Risk Neutral robabilities are a fundamental concet

More information

The Online Freeze-tag Problem

The Online Freeze-tag Problem The Online Freeze-tag Problem Mikael Hammar, Bengt J. Nilsson, and Mia Persson Atus Technologies AB, IDEON, SE-3 70 Lund, Sweden mikael.hammar@atus.com School of Technology and Society, Malmö University,

More information

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH 31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

More information

Chapter 7: Products and quotients

Chapter 7: Products and quotients Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products

More information

PRIME NUMBERS AND THE RIEMANN HYPOTHESIS

PRIME NUMBERS AND THE RIEMANN HYPOTHESIS PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and exlain how it is connected with the rime numbers.

More information

3. INNER PRODUCT SPACES

3. INNER PRODUCT SPACES . INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

More information

Introduction to NP-Completeness Written and copyright c by Jie Wang 1

Introduction to NP-Completeness Written and copyright c by Jie Wang 1 91.502 Foundations of Comuter Science 1 Introduction to Written and coyright c by Jie Wang 1 We use time-bounded (deterministic and nondeterministic) Turing machines to study comutational comlexity of

More information

Theoretical Computer Science

Theoretical Computer Science Theoretical Computer Science 410 (2009) 4489 4503 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs A push relabel approximation algorithm

More information

Chapter 7. Permutation Groups

Chapter 7. Permutation Groups Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral

More information

Stochastic Derivation of an Integral Equation for Probability Generating Functions

Stochastic Derivation of an Integral Equation for Probability Generating Functions Journal of Informatics and Mathematical Sciences Volume 5 (2013), Number 3,. 157 163 RGN Publications htt://www.rgnublications.com Stochastic Derivation of an Integral Equation for Probability Generating

More information

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V. EROVENKO AND B. SURY ABSTRACT. We compute commutativity degrees of wreath products A B of finite abelian groups A and B. When B

More information

MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem

MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and

More information

Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

More information

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

More information

Metric Spaces. Chapter 1

Metric Spaces. Chapter 1 Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

More information

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of

More information

Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

More information

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute

More information

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i. Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

More information

Point Location. Preprocess a planar, polygonal subdivision for point location queries. p = (18, 11)

Point Location. Preprocess a planar, polygonal subdivision for point location queries. p = (18, 11) Point Location Prerocess a lanar, olygonal subdivision for oint location ueries. = (18, 11) Inut is a subdivision S of comlexity n, say, number of edges. uild a data structure on S so that for a uery oint

More information

We shall turn our attention to solving linear systems of equations. Ax = b

We shall turn our attention to solving linear systems of equations. Ax = b 59 Linear Algebra We shall turn our attention to solving linear systems of equations Ax = b where A R m n, x R n, and b R m. We already saw examples of methods that required the solution of a linear system

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

More information

Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems. Matrix Factorization Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

More information

As we have seen, there is a close connection between Legendre symbols of the form

As we have seen, there is a close connection between Legendre symbols of the form Gauss Sums As we have seen, there is a close connection between Legendre symbols of the form 3 and cube roots of unity. Secifically, if is a rimitive cube root of unity, then 2 ± i 3 and hence 2 2 3 In

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

CONNECTIONS ON PRINCIPAL G-BUNDLES

CONNECTIONS ON PRINCIPAL G-BUNDLES CONNECTIONS ON PRINCIPAL G-BUNDLES RAHUL SHAH Abstract. We will describe connections on principal G-bundles via two perspectives: that of distributions and that of connection 1-forms. We will show that

More information

Automatic Search for Correlated Alarms

Automatic Search for Correlated Alarms Automatic Search for Correlated Alarms Klaus-Dieter Tuchs, Peter Tondl, Markus Radimirsch, Klaus Jobmann Institut für Allgemeine Nachrichtentechnik, Universität Hannover Aelstraße 9a, 0167 Hanover, Germany

More information

ENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS

ENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS ENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS Liviu Grigore Comuter Science Deartment University of Illinois at Chicago Chicago, IL, 60607 lgrigore@cs.uic.edu Ugo Buy Comuter Science

More information

Matrix Representations of Linear Transformations and Changes of Coordinates

Matrix Representations of Linear Transformations and Changes of Coordinates Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under

More information

The Topology of Fiber Bundles Lecture Notes. Ralph L. Cohen Dept. of Mathematics Stanford University

The Topology of Fiber Bundles Lecture Notes. Ralph L. Cohen Dept. of Mathematics Stanford University The Topology of Fiber Bundles Lecture Notes Ralph L. Cohen Dept. of Mathematics Stanford University Contents Introduction v Chapter 1. Locally Trival Fibrations 1 1. Definitions and examples 1 1.1. Vector

More information

ISOMETRIES OF R n KEITH CONRAD

ISOMETRIES OF R n KEITH CONRAD ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x

More information

Lectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields. Tom Weston

Lectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields. Tom Weston Lectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields Tom Weston Contents Introduction 4 Chater 1. Comlex lattices and infinite sums of Legendre symbols 5 1. Comlex lattices 5

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES 1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

More information

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

More information

How To Understand The Theory Of Differential Geometry

How To Understand The Theory Of Differential Geometry Chapter 23 Fiber bundles Consider a manifold M with the tangent bundle T M = P M T P M. Let us look at this more closely. T M can be thought of as the original manifold M with a tangent space stuck at

More information

Notes on Factoring. MA 206 Kurt Bryan

Notes on Factoring. MA 206 Kurt Bryan The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

More information

Polynomials with non-negative coefficients

Polynomials with non-negative coefficients Polynomials with non-negative coeicients R. W. Barnard W. Dayawansa K. Pearce D.Weinberg Department o Mathematics, Texas Tech University, Lubbock, TX 79409 1 Introduction Can a conjugate pair o zeros be

More information

Fiber bundles and non-abelian cohomology

Fiber bundles and non-abelian cohomology Fiber bundles and non-abelian cohomology Nicolas Addington April 22, 2007 Abstract The transition maps of a fiber bundle are often said to satisfy the cocycle condition. If we take this terminology seriously

More information

MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

More information

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

More information

Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

More information

The Characteristic Polynomial

The Characteristic Polynomial Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

More information

The Determinant: a Means to Calculate Volume

The Determinant: a Means to Calculate Volume The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its well-known properties Volumes of parallelepipeds are

More information

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products Predicate Encrytion Suorting Disjunctions, Polynomial Equations, and Inner Products Jonathan Katz Amit Sahai Brent Waters Abstract Predicate encrytion is a new aradigm for ublic-key encrytion that generalizes

More information

Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

More information

GENERATING SETS KEITH CONRAD

GENERATING SETS KEITH CONRAD GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

More information

Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013

Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013 Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,

More information

THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

More information

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal

More information

1 Sets and Set Notation.

1 Sets and Set Notation. LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

More information

Lecture L3 - Vectors, Matrices and Coordinate Transformations

Lecture L3 - Vectors, Matrices and Coordinate Transformations S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between

More information

The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression

The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression The SVD is the most generally applicable of the orthogonal-diagonal-orthogonal type matrix decompositions Every

More information

α = u v. In other words, Orthogonal Projection

α = u v. In other words, Orthogonal Projection Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v

More information

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

More information

9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ?

9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ? 9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ? Clearly a necessary condition is that H is normal in G.

More information

FIXED INCOME ATTRIBUTION

FIXED INCOME ATTRIBUTION Sotware Requirement Speciication FIXED INCOME ATTRIBUTION Authors Risto Lehtinen Version Date Comment 0.1 2007/02/20 First Drat Table o Contents 1 Introduction... 3 1.1 Purpose o Document... 3 1.2 Glossary,

More information

Linear Codes. Chapter 3. 3.1 Basics

Linear Codes. Chapter 3. 3.1 Basics Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length

More information

26. Determinants I. 1. Prehistory

26. Determinants I. 1. Prehistory 26. Determinants I 26.1 Prehistory 26.2 Definitions 26.3 Uniqueness and other properties 26.4 Existence Both as a careful review of a more pedestrian viewpoint, and as a transition to a coordinate-independent

More information

Elements of Abstract Group Theory

Elements of Abstract Group Theory Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for

More information

Subspaces of R n LECTURE 7. 1. Subspaces

Subspaces of R n LECTURE 7. 1. Subspaces LECTURE 7 Subspaces of R n Subspaces Definition 7 A subset W of R n is said to be closed under vector addition if for all u, v W, u + v is also in W If rv is in W for all vectors v W and all scalars r

More information

Exponential Functions

Exponential Functions Eponential Functions Deinition: An Eponential Function is an unction that has the orm ( a, where a > 0. The number a is called the base. Eample:Let For eample (0, (, ( It is clear what the unction means

More information

1 Gambler s Ruin Problem

1 Gambler s Ruin Problem Coyright c 2009 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins

More information

Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

More information