Chapter 4. EIGENVALUES to Prove the Cauchy–Schwarz Inequality, Note That It Suffices to Consider the Case W = 1
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Solution to Homework 5
Solution to Homework 5 Sec. 5.4 1 0 2. (e) No. Note that A = is in W , but 0 2 0 1 1 0 0 2 T (A) = = 1 0 0 2 1 0 is not in W . Hence, W is not a T -invariant subspace of V . 3. Note that T : V ! V is a linear operator on V . To check that W is a T -invariant subspace of V , we need to know if T (w) 2 W for any w 2 W . (a) Since we have T (0) = 0 2 f0g and T (v) 2 V; so both of f0g and V to be T -invariant subspaces of V . (b) Note that 0 2 N(T ). For any u 2 N(T ), we have T (u) = 0 2 N(T ): Hence, N(T ) is a T -invariant subspace of V . For any v 2 R(T ), as R(T ) ⊂ V , we have v 2 V . So, by definition, T (v) 2 R(T ): Hence, R(T ) is also a T -invariant subspace of V . (c) Note that for any v 2 Eλ, λv is a scalar multiple of v, so λv 2 Eλ as Eλ is a subspace. So we have T (v) = λv 2 Eλ: Hence, Eλ is a T -invariant subspace of V . 4. For any w in W , we know that T (w) is in W as W is a T -invariant subspace of V . Then, by induction, we know that T k(w) is also in W for any k. k Suppose g(T ) = akT + ··· + a1T + a0, we have k g(T )(w) = akT (w) + ··· + a1T (w) + a0(w) 2 W because it is just a linear combination of elements in W . -
Refinements of the Weyl Tensor Classification in Five Dimensions
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Ghent University Academic Bibliography Home Search Collections Journals About Contact us My IOPscience Refinements of the Weyl tensor classification in five dimensions This article has been downloaded from IOPscience. Please scroll down to see the full text article. 2012 Class. Quantum Grav. 29 155016 (http://iopscience.iop.org/0264-9381/29/15/155016) View the table of contents for this issue, or go to the journal homepage for more Download details: IP Address: 157.193.53.227 The article was downloaded on 16/07/2012 at 16:13 Please note that terms and conditions apply. IOP PUBLISHING CLASSICAL AND QUANTUM GRAVITY Class. Quantum Grav. 29 (2012) 155016 (50pp) doi:10.1088/0264-9381/29/15/155016 Refinements of the Weyl tensor classification in five dimensions Alan Coley1, Sigbjørn Hervik2, Marcello Ortaggio3 and Lode Wylleman2,4,5 1 Department of Mathematics and Statistics, Dalhousie University, Halifax, Nova Scotia B3H 3J5, Canada 2 Faculty of Science and Technology, University of Stavanger, N-4036 Stavanger, Norway 3 Institute of Mathematics, Academy of Sciences of the Czech Republic, Zitnˇ a´ 25, 115 67 Prague 1, Czech Republic 4 Department of Mathematical Analysis EA16, Ghent University, 9000 Gent, Belgium 5 Department of Mathematics, Utrecht University, 3584 CD Utrecht, The Netherlands E-mail: [email protected], [email protected], [email protected] and [email protected] Received 31 March 2012, in final form 21 June 2012 Published 16 July 2012 Online at stacks.iop.org/CQG/29/155016 Abstract We refine the null alignment classification of the Weyl tensor of a five- dimensional spacetime. -
Kinematics of Visually-Guided Eye Movements
Kinematics of Visually-Guided Eye Movements Bernhard J. M. Hess*, Jakob S. Thomassen Department of Neurology, University Hospital Zurich, Zurich, Switzerland Abstract One of the hallmarks of an eye movement that follows Listing’s law is the half-angle rule that says that the angular velocity of the eye tilts by half the angle of eccentricity of the line of sight relative to primary eye position. Since all visually-guided eye movements in the regime of far viewing follow Listing’s law (with the head still and upright), the question about its origin is of considerable importance. Here, we provide theoretical and experimental evidence that Listing’s law results from a unique motor strategy that allows minimizing ocular torsion while smoothly tracking objects of interest along any path in visual space. The strategy consists in compounding conventional ocular rotations in meridian planes, that is in horizontal, vertical and oblique directions (which are all torsion-free) with small linear displacements of the eye in the frontal plane. Such compound rotation-displacements of the eye can explain the kinematic paradox that the fixation point may rotate in one plane while the eye rotates in other planes. Its unique signature is the half-angle law in the position domain, which means that the rotation plane of the eye tilts by half-the angle of gaze eccentricity. We show that this law does not readily generalize to the velocity domain of visually-guided eye movements because the angular eye velocity is the sum of two terms, one associated with rotations in meridian planes and one associated with displacements of the eye in the frontal plane. -
Spectral Coupling for Hermitian Matrices
Spectral coupling for Hermitian matrices Franc¸oise Chatelin and M. Monserrat Rincon-Camacho Technical Report TR/PA/16/240 Publications of the Parallel Algorithms Team http://www.cerfacs.fr/algor/publications/ SPECTRAL COUPLING FOR HERMITIAN MATRICES FRANC¸OISE CHATELIN (1);(2) AND M. MONSERRAT RINCON-CAMACHO (1) Cerfacs Tech. Rep. TR/PA/16/240 Abstract. The report presents the information processing that can be performed by a general hermitian matrix when two of its distinct eigenvalues are coupled, such as λ < λ0, instead of λ+λ0 considering only one eigenvalue as traditional spectral theory does. Setting a = 2 = 0 and λ0 λ 6 e = 2− > 0, the information is delivered in geometric form, both metric and trigonometric, associated with various right-angled triangles exhibiting optimality properties quantified as ratios or product of a and e. The potential optimisation has a triple nature which offers two j j e possibilities: in the case λλ0 > 0 they are characterised by a and a e and in the case λλ0 < 0 a j j j j by j j and a e. This nature is revealed by a key generalisation to indefinite matrices over R or e j j C of Gustafson's operator trigonometry. Keywords: Spectral coupling, indefinite symmetric or hermitian matrix, spectral plane, invariant plane, catchvector, antieigenvector, midvector, local optimisation, Euler equation, balance equation, torus in 3D, angle between complex lines. 1. Spectral coupling 1.1. Introduction. In the work we present below, we focus our attention on the coupling of any two distinct real eigenvalues λ < λ0 of a general hermitian or symmetric matrix A, a coupling called spectral coupling. -
18.700 JORDAN NORMAL FORM NOTES These Are Some Supplementary Notes on How to Find the Jordan Normal Form of a Small Matrix. Firs
18.700 JORDAN NORMAL FORM NOTES These are some supplementary notes on how to find the Jordan normal form of a small matrix. First we recall some of the facts from lecture, next we give the general algorithm for finding the Jordan normal form of a linear operator, and then we will see how this works for small matrices. 1. Facts Throughout we will work over the field C of complex numbers, but if you like you may replace this with any other algebraically closed field. Suppose that V is a C-vector space of dimension n and suppose that T : V → V is a C-linear operator. Then the characteristic polynomial of T factors into a product of linear terms, and the irreducible factorization has the form m1 m2 mr cT (X) = (X − λ1) (X − λ2) ... (X − λr) , (1) for some distinct numbers λ1, . , λr ∈ C and with each mi an integer m1 ≥ 1 such that m1 + ··· + mr = n. Recall that for each eigenvalue λi, the eigenspace Eλi is the kernel of T − λiIV . We generalized this by defining for each integer k = 1, 2,... the vector subspace k k E(X−λi) = ker(T − λiIV ) . (2) It is clear that we have inclusions 2 e Eλi = EX−λi ⊂ E(X−λi) ⊂ · · · ⊂ E(X−λi) ⊂ .... (3) k k+1 Since dim(V ) = n, it cannot happen that each dim(E(X−λi) ) < dim(E(X−λi) ), for each e e +1 k = 1, . , n. Therefore there is some least integer ei ≤ n such that E(X−λi) i = E(X−λi) i . -
(VI.E) Jordan Normal Form
(VI.E) Jordan Normal Form Set V = Cn and let T : V ! V be any linear transformation, with distinct eigenvalues s1,..., sm. In the last lecture we showed that V decomposes into stable eigenspaces for T : s s V = W1 ⊕ · · · ⊕ Wm = ker (T − s1I) ⊕ · · · ⊕ ker (T − smI). Let B = fB1,..., Bmg be a basis for V subordinate to this direct sum and set B = [T j ] , so that k Wk Bk [T]B = diagfB1,..., Bmg. Each Bk has only sk as eigenvalue. In the event that A = [T]eˆ is s diagonalizable, or equivalently ker (T − skI) = ker(T − skI) for all k , B is an eigenbasis and [T]B is a diagonal matrix diagf s1,..., s1 ;...; sm,..., sm g. | {z } | {z } d1=dim W1 dm=dim Wm Otherwise we must perform further surgery on the Bk ’s separately, in order to transform the blocks Bk (and so the entire matrix for T ) into the “simplest possible” form. The attentive reader will have noticed above that I have written T − skI in place of skI − T . This is a strategic move: when deal- ing with characteristic polynomials it is far more convenient to write det(lI − A) to produce a monic polynomial. On the other hand, as you’ll see now, it is better to work on the individual Wk with the nilpotent transformation T j − s I =: N . Wk k k Decomposition of the Stable Eigenspaces (Take 1). Let’s briefly omit subscripts and consider T : W ! W with one eigenvalue s , dim W = d , B a basis for W and [T]B = B. -
Section 18.1-2. in the Next 2-3 Lectures We Will Have a Lightning Introduction to Representations of finite Groups
Section 18.1-2. In the next 2-3 lectures we will have a lightning introduction to representations of finite groups. For any vector space V over a field F , denote by L(V ) the algebra of all linear operators on V , and by GL(V ) the group of invertible linear operators. Note that if dim(V ) = n, then L(V ) = Matn(F ) is isomorphic to the algebra of n×n matrices over F , and GL(V ) = GLn(F ) to its multiplicative group. Definition 1. A linear representation of a set X in a vector space V is a map φ: X ! L(V ), where L(V ) is the set of linear operators on V , the space V is called the space of the rep- resentation. We will often denote the representation of X by (V; φ) or simply by V if the homomorphism φ is clear from the context. If X has any additional structures, we require that the map φ is a homomorphism. For example, a linear representation of a group G is a homomorphism φ: G ! GL(V ). Definition 2. A morphism of representations φ: X ! L(V ) and : X ! L(U) is a linear map T : V ! U, such that (x) ◦ T = T ◦ φ(x) for all x 2 X. In other words, T makes the following diagram commutative φ(x) V / V T T (x) U / U An invertible morphism of two representation is called an isomorphism, and two representa- tions are called isomorphic (or equivalent) if there exists an isomorphism between them. Example. (1) A representation of a one-element set in a vector space V is simply a linear operator on V . -
UNITARY REPRESENTATIONS of REAL REDUCTIVE GROUPS By
UNITARY REPRESENTATIONS OF REAL REDUCTIVE GROUPS by Jeffrey D. Adams, Marc van Leeuwen, Peter E. Trapa & David A. Vogan, Jr. Abstract. | We present an algorithm for computing the irreducible unitary repre- sentations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant Hermitian form as a deformation of a unitary representation from the Plancherel formula. The behav- ior of these deformations was in part determined in the Kazhdan-Lusztig analysis of irreducible characters; more complete information comes from the Beilinson-Bernstein proof of the Jantzen conjectures. Our algorithm traces the signature of the form through this deformation, counting changes at reducibility points. An important tool is Weyl's \unitary trick:" replacing the classical invariant Hermitian form (where Lie(G) acts by skew-adjoint operators) by a new one (where a compact form of Lie(G) acts by skew-adjoint operators). R´esum´e (Repr´esentations unitaires des groupes de Lie r´eductifs) Nous pr´esentons un algorithme pour le calcul des repr´esentations unitaires irr´eductiblesd'un groupe de Lie r´eductifr´eel G. La classification de Langlands, dans sa formulation par Knapp et Zuckerman, pr´esente toute repr´esentation hermitienne comme ´etant la d´eformation d'une repr´esentation unitaire intervenant dans la formule de Plancherel. Le comportement de ces d´eformationsest en partie d´etermin´e par l'analyse de Kazhdan-Lusztig des caract`eresirr´eductibles;une information plus compl`eteprovient de la preuve par Beilinson-Bernstein des conjectures de Jantzen. Notre algorithme trace `atravers cette d´eformationles changements de la signature de la forme qui peuvent intervenir aux points de r´eductibilit´e. -
Your PRINTED Name Is: Please Circle Your Recitation
18.06 Professor Edelman Quiz 3 December 3, 2012 Grading 1 Your PRINTED name is: 2 3 4 Please circle your recitation: 1 T 9 2-132 Andrey Grinshpun 2-349 3-7578 agrinshp 2 T 10 2-132 Rosalie Belanger-Rioux 2-331 3-5029 robr 3 T 10 2-146 Andrey Grinshpun 2-349 3-7578 agrinshp 4 T 11 2-132 Rosalie Belanger-Rioux 2-331 3-5029 robr 5 T 12 2-132 Georoy Horel 2-490 3-4094 ghorel 6 T 1 2-132 Tiankai Liu 2-491 3-4091 tiankai 7 T 2 2-132 Tiankai Liu 2-491 3-4091 tiankai 1 (16 pts.) a) (4 pts.) Suppose C is n × n and positive denite. If A is n × m and M = AT CA is not positive denite, nd the smallest eigenvalue of M: (Explain briey.) Solution. The smallest eigenvalue of M is 0. The problem only asks for brief explanations, but to help students understand the material better, I will give lengthy ones. First of all, note that M T = AT CT A = AT CA = M, so M is symmetric. That implies that all the eigenvalues of M are real. (Otherwise, the question wouldn't even make sense; what would the smallest of a set of complex numbers mean?) Since we are assuming that M is not positive denite, at least one of its eigenvalues must be nonpositive. So, to solve the problem, we just have to explain why M cannot have any negative eigenvalues. The explanation is that M is positive semidenite. -
Local Stability
Chapter 4 Local stability It does not say in the Bible that all laws of nature are ex- pressible linearly. — Enrico Fermi (R. Mainieri and P. Cvitanovic)´ o far we have concentrated on describing the trajectory of a single initial point. Our next task is to define and determine the size of a neighborhood S of x(t). We shall do this by assuming that the flow is locally smooth and by describing the local geometry of the neighborhood by studying the flow linearized around x(t). Nearby points aligned along the stable (contracting) directions remain t in the neighborhood of the trajectory x(t) = f (x0); the ones to keep an eye on are the points which leave the neighborhood along the unstable directions. As we shall demonstrate in chapter 21, the expanding directions matter in hyperbolic systems. The repercussions are far-reaching. As long as the number of unstable directions is finite, the same theory applies to finite-dimensional ODEs, state space volume preserving Hamiltonian flows, and dissipative, volume contracting infinite-dim- ensional PDEs. In order to streamline the exposition, in this chapter all examples are collected in sect. 4.8. We strongly recommend that you work through these examples: you can get to them and back to the text by clicking on the [example] links, such as example 4.8 p. 96 4.1 Flows transport neighborhoods As a swarm of representative points moves along, it carries along and distorts neighborhoods. The deformation of an infinitesimal neighborhood is best un- derstood by considering a trajectory originating near x0 = x(0), with an initial 82 CHAPTER 4. -
A Unified Canonical Form with Applications to Conformal Geometry
Skew-symmetric endomorphisms in M1,3: A unified canonical form with applications to conformal geometry Marc Mars and Carlos Pe´on-Nieto Instituto de F´ısica Fundamental y Matem´aticas, Universidad de Salamanca Plaza de la Merced s/n 37008, Salamanca, Spain Abstract We derive a canonical form for skew-symmetric endomorphisms F in Lorentzian vector spaces of dimension three and four which covers all non-trivial cases at once. We analyze its invariance group, as well as the connection of this canonical form with duality rotations of two-forms. After reviewing the relation between these endomorphisms and the algebra of 2 2 2 conformal Killing vectors of S , CKill S , we are able to also give a canonical form for an arbitrary element ξ ∈ CKill S along with its invariance group. The construction allows us to obtain explicitly the change of basis that transforms any given F into its canonical form. For any non-trivial ξ we construct, via its canonical form, adapted coordinates that allow us to study its properties in depth. Two applications are worked out: we determine explicitly for which metrics, among a natural class of spaces of constant curvature, a given ξ is a Killing vector and solve all local TT (traceless and transverse) tensors that satisfy the Killing Initial Data equation for ξ. In addition to their own interest, the present results will be a basic ingredient for a subsequent generalization to arbitrary dimensions. 1 Introduction Finding a canonical form for the elements of a certain set is often an interesting problem to solve, since it is a powerful tool for both computations and mathematical analysis. -
Adiabatic Invariants of the Linear Hamiltonian Systems with Periodic Coefficients
JOURNAL OF DIFFERENTIAL EQUATIONS 42, 47-71 (1981) Adiabatic Invariants of the Linear Hamiltonian Systems with Periodic Coefficients MARK LEVI Department of Mathematics, Duke University, Durham, North Carolina 27706 Received November 19, 1980 0. HISTORICAL REMARKS In 1911 Lorentz and Einstein had offered an explanation of the fact that the ratio of energy to the frequency of radiation of an atom remains constant. During the long time intervals separating two quantum jumps an atom is exposed to varying surrounding electromagnetic fields which should supposedly change the ratio. Their explanation was based on the fact that the surrounding field varies extremely slowly with respect to the frequency of oscillations of the atom. The idea can be illstrated by a slightly simpler model-a pendulum (instead of Bohr’s model of an atom) with a slowly changing length (slowly with respect to the frequency of oscillations of the pendulum). As it turns out, the ratio of energy of the pendulum to its frequency changes very little if its length varies slowly enough from one constant value to another; the pendulum “remembers” the ratio, and the slower the change the better the memory. I had learned this interesting historical remark from Wasow [15]. Those parameters of a system which remain nearly constant during a slow change of a system were named by the physicists the adiabatic invariants, the word “adiabatic” indicating that one parameter changes slowly with respect to another-e.g., the length of the pendulum with respect to the phaze of oscillations. Precise definition of the concept will be given in Section 1.