European Embedded Control Institute. Graduate School on Control Spring The Behavioral Approach to Modeling and Control.
|
|
- Posy McCoy
- 5 years ago
- Views:
Transcription
1 p. 1/50 European Embedded Control Institute Graduate School on Control Spring 2010 The Behavioral Approach to Modeling and Control Lecture VI CONTROLLABILITY
2 p. 2/50 Theme Behavioral controllability, the property of being able to choose the future of a trajectory regardless of the past, is an important and regularizing system property. In this lecture we obtain (i) various tests for controllability of LTIDSs, (ii) special system representations related to controllability, (iii) and generalizations, e.g. to stabilizability.
3 p. 3/50 Outline Controllability of LTIDSs Image representations Autonomous LTIDSs Stability and stabilizability The controllable part of a behavior The three main theorems for LTIDSs and their discrete-time and PDE counterparts Observability
4 Controllability p. 4/50
5 p. 5/50 Reminder R w w 1,w 2 B w 1 0 w 2 time R w transition R w w B w 1 w 0 w t time σ t w 2 w controllability : concatenability of trajectories after a delay
6 p. 6/50 Controllability of LTIDSs Theorem The following are equivalent for B L w. 1. B is controllable. 2. Let R ( d dt) w = 0 be a kernel representation B. Then R(λ) has the same rank for all λ C. Hence, R ( d dt) w = 0 is a minimal kernel representation of a controllable LTIDS if and only if R is left prime. B L is controllable if and only if it has a kernel representation R ( d dt) w = 0 with R left prime over R[ξ].
7 p. 7/50 Proof in telegram-style First prove that if U R[ξ] w w is unimodular, then B is controllable if and only if U ( d dt ) B is controllable. Consequently, we may assume that B has a minimal kernel representation with R in Smith form, ] R = [diag(d 1,d 2,...,d r ) 0 r (w r) Observe, using the theory of autonomous systems, that B is controllable if and only if all the invariant polynomials d 1,d 2,...,d r of R are equal to one. Equivalently, if and only if 2. holds.
8 Examples Consider the single-input/single output system ( ) ( ) [ ] d d u p y = q u, w =, dt dt y with p,q R[ξ]. This system is controllable if and only if p and q are coprime. The interpretation of common factors in p and q has been a long-standing question in the field. Behavioral controllability demystifies common factors. We now understand that common factors correspond exactly to lack of controllability, nothing more, nothing less. In the exercises several algorithms for coprimeness of polynomials are discussed. p. 8/50
9 Examples Applying the controllability theorem and the relation between behavioral and state controllability discussed in Lecture I, shows that the system u d x = Ax+Bu, y = Cx+Du, w = y dt x is controllable if and only if ([ ]) rank A I n n λ B =n for all λ C. This state version of controllability is the PBH (Popov-Belevitch-Hautus) test. The controllability theorem is a far-reaching generalization of this classical result. V.M. Vitold Malo Popov Belevitch Hautus (1928 ) ( ) (1940 ) p. 9/50
10 p. 10/50 Examples The port behavior of the RLC circuit (see Lecture IV) I V + R C L C R L is controllable unless CR C = L R L and R L = R C. This shows that lack of controllability can occur in non-degenerate physical systems.
11 p. 11/50 More tests for controllability Theorem The following are equivalent for B L w. 1. B is controllable. 3. N B, the R[ξ]-module of annihilators of B, is closed. 4. B has a direct summand, i.e., there exists B L w such that B B = C (R,R w ). The closure of the R[ξ]-submodule M of R[ξ] w is defined as M closure := { m R[ξ] w π R[ξ],π 0, and m M such that m = π m}. M is said to be closed if M = M closure.
12 p. 12/50 Proof in telegram-style First prove that if U R[ξ] w w is unimodular, then B is controllable if and only if U ( d dt ) B is controllable. Consequently, we may assume that B has a minimal kernel representation with R in Smith form, ] R = [diag(d 1,d 2,...,d r ) 0 r (w r) Observe that N B = [ ] R[ξ]d 1 R[ξ]d r 0 0. Hence N B is closed if and only if all the invariant polynomials d 1,d 2,...,d r of R are equal to one. Equivalently, if and only if 2. holds.
13 p. 12/50 Proof in telegram-style Consequently, we may assume that B has a minimal kernel representation with R in Smith form, ] R = [diag(d 1,d 2,...,d r ) 0 r (w r) Take for B the system with kernel representation R ( ) ] d dt w = 0, with R = [0 w r r I (w r) (w r).
14 p. 12/50 Proof in telegram-style Consequently, we may assume that B has a minimal kernel representation with R in Smith form, ] R = [diag(d 1,d 2,...,d r ) 0 r (w r) Note that [[B B = C (R,R w )]] [[N B N B = R[ξ] 1 w ]]. Let R ( ) d dt w = 0 be a minimal kernel representation of B. [ ] Then N B N B = R[ξ] w R implies that the rows of R form a [ ] basis for R[ξ] 1 w R. Equivalently, that R is unimodular. Hence that the invariant polynomials of R are all equal to one.
15 p. 13/50 Geometric interpretation of controllability Attach to each point λ C of the Riemann sphere (think of the Riemann sphere as C), kernel(r(λ)). This associates with each λ C a linear subspace of C w. In general, this yields a picture shown below. Since the dimension of the subspace attached may change, we obtain a sheaf. λ kernel(r(λ)) Riemann sphere Bernhard Riemann
16 p. 13/50 Geometric interpretation of controllability Attach to each point λ C of the Riemann sphere (think of the Riemann sphere as C), kernel(r(λ)). This associates with each λ C a linear subspace of C w. The dimension of the subspace is constant, that is, we obtain a vector bundle over the Riemann sphere, if and only if the system is controllable. λ Riemann sphere kernel(r(λ)) Bernhard Riemann
17 Representations of behaviors p. 14/50
18 p. 15/50 Kernels, images, and projections A model B is a subset of U. There are many ways to specify a subset. For example, as the set of solutions of equations, as the image of a map, as a projection.
19 p. 15/50 Kernels, images, and projections A model B is a subset of U. There are many ways to specify a subset. For example, as the set of solutions of equations: f : U, B = {w U f(w) = 0}, as the image of a map: f : U, B = {w U l such that w = f(l) }, as a projection: B extended U L, B = {w U l L such that (w,l) B extended }.
20 Kernels, images, and projections A model B is a subset of U. There are many ways to specify a subset. For example, as solutions of equations: kernel representation f : U, B = {w U f(w) = 0}, as the image of a map: image representation f : U, B = {w U l such that w = f(l) }, as a projection: latent variable representation B = {w U l L such that (w,l) B extended }, w s manifest variables: the variables the model aims at, l s latent variables: auxiliary variables. p. 15/50
21 p. 16/50 Image as the image of a map: image representation f : U, B = {w U l such that w = f(l) }. f B U
22 p. 17/50 Controllability and image representations
23 p. 18/50 Images We have seen kernels and projections of linear constant-coefficient differential operators. It is time for images! w = M ( d dt) l. M ( ) d dt C (R,R w ) C (R,R ) image ( M ( )) d dt
24 p. 18/50 Images We have seen kernels and projections of linear constant-coefficient differential operators. It is time for images! w = M ( d dt) l. M ( ) d dt C (R,R w ) C (R,R ) image ( M ( )) d dt Elimination theorem (see Lecture IV) an image is a kernel. What is special about images?
25 p. 19/50 The image representation theorem Theorem The following are equivalent for B L w. 1. B is controllable. 5. B has a image representation w = M ( d dt) l. Images have a nice system theoretic interpretation!
26 p. 20/50 Proof in telegram-style By controllability, the invariant polynomials of R, with R ( d dt) w = 0 a minimal kernel representation of B, are equal ] to one. Therefore, R = V [I r r 0 r (w r) U, with U,V ] unimodular. It follows that w = U 1( d dt ) [ 0 r (w r) is an image representation of B I (w r) (w r) The extended behavior {(w,l) w = M ( ) d dt l} is controllable, [ ] since I w w M(λ) has rankwfor all λ C. This implies that the projection is controllable. l
27 Algorithm for controllability p. 21/50
28 p. 22/50 Algorithm Start with R R[ξ] w parametrizing the LTIDS R ( d dt ) w = 0. Problem: Verify if this system is controllable.
29 p. 22/50 Algorithm Start with R R[ξ] w Problem: Verify if this system is controllable. The set { f R[ξ] w R f = 0} is called the right syzygy of R. It is obviously an R[ξ]-module. Compute a basis for the right syzygy of R. Let F be a matrix whose rows form a basis for this syzygy.
30 p. 22/50 Algorithm Start with R R[ξ] w Problem: Verify if this system is controllable. Compute a basis for the right syzygy of R. Let F be a matrix whose rows form a basis for this syzygy. Compute a basis for the left syzygy of F. Let R be a matrix whose rows form a basis for this syzygy. Computing such a basis is a standard problem in computer algebra
31 p. 22/50 Algorithm Start with R R[ξ] w Problem: Verify if this system is controllable. Compute a basis for the right syzygy of R. Let F be a matrix whose rows form a basis for this syzygy. Compute a basis for the left syzygy of F. Let R be a matrix whose rows form a basis for this syzygy. The system is controllable R = R. Verifying this equality is a standard problem in computer algebra.
32 Autonomous LTIDSs p. 23/50
33 p. 24/50 Reminder W time PAST W time FUTURE autonomous : the past implies the future.
34 p. 25/50 Characterization of autonomous LTIDSs Theorem The following are equivalent for B L w. B is autonomous. B is a finite-dimensional subspace of C (R,R w ). B has a minimal kernel representation R ( d dt) w = 0 with R square and determinant(r) 0. m(b) = 0, equivalently, p(b) =w(b).
35 p. 25/50 Characterization of autonomous LTIDSs Theorem The following are equivalent for B L w. B is autonomous. B is a finite-dimensional subspace of C (R,R w ). B has a minimal kernel representation R ( d dt) w = 0 with R square and determinant(r) 0. m(b) = 0, equivalently, p(b) =w(b). The proof follows readily from the Smith form and Propositions 1 and 3 of the section on differential operators (see Lecture II).
36 p. 25/50 Characterization of autonomous LTIDSs Theorem The following are equivalent for B L w. B is autonomous. B is a finite-dimensional subspace of C (R,R w ). B has a minimal kernel representation R ( d dt) w = 0 with R square and determinant(r) 0. m(b) = 0, equivalently, p(b) =w(b). With R minimal, there holds, for w = 1, dimension(b) = degree(r), for w > 1, dimension(b) = degree(determinant(r)).
37 p. 26/50 Autonomous LTIDSs Each trajectory w of an autonomous B L w is a sum of products of a polynomial and an exponential in the complex case, w(t) = π 1 (t)e λ 1t + π 2 (t)e λ 2t + +π r (t)e λ rt, with π k C[ξ] w and λ k C. In the real case, it is a sum of products of a polynomial, an exponential, and a trigonometric function, w(t) = π 1(t)e λ 1t cos(ω 1 t)+π 1(t)e λ 1t sin(ω 1 t) + π 2(t)e λ 2t cos(ω 2 t)+π 2(t)e λ 2t sin(ω 2 t) + +π r(t)e λ rt cos(ω r t)+π r(t)e λ rt sin(ω r t), with π k,π k R[ξ] w,λ k R, and ω k R.
38 Stability p. 27/50
39 p. 28/50 Reminder W time stability : all trajectories go to 0.
40 p. 28/50 Reminder W time stability : all trajectories go to 0. For B L w, there holds [[B stable]] [[B autonomous]].
41 Stability of LTIDSs Theorem The following are equivalent for B L w. B is stable. Every exponential trajectory t e λt a, a C w, in B (complexified) has Real(λ) < 0. B has a minimal kernel representation R ( ) d dt w = 0 with R Hurwitz. A polynomial C[ξ] is said to be Hurwitz if all its roots are in {λ C Real(λ) < 0}. P C[ξ] n n is said to be Hurwitz if it is square and determinant(p) is Hurwitz. p. 29/50
42 p. 29/50 Stability of LTIDSs Theorem The following are equivalent for B L w. B is stable. Every exponential trajectory t e λt a, a C w, in B (complexified) has Real(λ) < 0. B has a minimal kernel representation R ( ) d dt w = 0 with R Hurwitz. The proof follows readily from the Smith form and Propositions 1 and 3 of the section on differential operators (see Lecture II).
43 Stabilizability p. 30/50
44 p. 31/50 Reminder w W 0 w time stabilizability : all trajectories can be steered to 0.
45 p. 32/50 Stabilizability of LTIDSs Theorem The following are equivalent for B L w. 1. B is stabilizable. 2. If R ( ) d dt w = 0 is a kernel representation of B, then [[λ C,rank(R(λ)) < rank(r)]] [[Real(λ) 0]].
46 p. 33/50 Proof in telegram-style First assume that R is in Smith form. Prove that if 2. is satisfied, then the firstrcomponents of w are polynomial exponentials, with exponentials having negative real part, while the remaining components of w are free. Conclude stabilizability Conversely, if 2. is not satisfied, then there is a solution whose first component is an exponential with real part 0. This exponential cannot be steered to zero, and the system is not stabilizable.
47 p. 33/50 Proof in telegram-style Next, consider general R s. The solutions are now of the form w = U ( d dt) w with U R[ξ] w w unimodular, and w a solution corresponding to the Smith form of R. The arguments extend, since polynomial exponentials are converted by U ( ) d dt to polynomial exponentials with the same exponential coefficients.
48 More on controllability p. 34/50
49 p. 35/50 The controllable part of a LTIDS The controllable part of B L w, denoted by B controllable, is defined as the largest controllable LTIDS contained in B. That is, 1. B controllable L w, 2. B controllable B, 3. [[B L w,b B, and B controllable ]] [[B B controllable ]].
50 p. 35/50 The controllable part of a LTIDS The controllable part of B L w, denoted by B controllable, is defined as the largest controllable LTIDS contained in B. Let R ( d dt ) w = 0 be a minimal kernel representation of B. The polynomial matrix R can be factored as R = FR, with F R[ξ] p(b) p(b) and with R R[ξ] p(b) w(b) left prime: R (λ) has the same rank for all λ C. Then R ( d dt) w = 0 is a kernel representation of B controllable.
51 p. 35/50 The controllable part of a LTIDS The controllable part of B L w, denoted by B controllable, is defined as the largest controllable LTIDS contained in B. C There holds B controllable = B (R,R w(b) ) compact, where B compact denotes the set of compact support trajectories C in B, and B (R,R w(b) ) compact the closure of Bcompact in the C (R,R w(b) )-topology.
52 p. 35/50 The controllable part of a LTIDS The controllable part of B L w, denoted by B controllable, is defined as the largest controllable LTIDS contained in B. Every B L w admits a decomposition B = B 1 B 2, with B 1 L w controllable and B 2 L w autonomous. In every such a decomposition, B 1 = B controllable.
53 p. 36/50 Controllability and rational symbols B is controllable if and only if it admits a representation ( ) d w = M l dt with M R(ξ) w. In particular, therefore, the system ( ) d y = G u, dt with G R(ξ) p m, is always controllable.
54 p. 37/50 Controllability and transfer functions Consider the input/output systems ( ) ( ) ( d d d P 1 y 1 = Q 1 u 1, P 2 dt dt dt ) ( d y 2 = Q 2 dt ) u 2, with determinant(p 1 ) 0, and determinant(p 2 ) 0. These two systems have the same transfer function, P 1 1 Q 1 = P 1 2 Q 2, if and only if they have the same controllable part. Therefore, the transfer function determines the controllable part of a system, but only the controllable part.
55 The three theorems p. 38/50
56 p. 39/50 LTIDSs The following are the three main theorems for LTIDSs. Theorem 1: There exists a 1 1 relation between L w and the R[ξ]-submodules of R[ξ] w. Theorem 2: Elimination. L is closed under projection: [[B L w 1+w 2 ]] [[Π 1 B L w 1]]. Π w1 defines the projection onto the firstw 1 components. Theorem 3: A LTIDS is controllable if and only if its behavior is the image of a linear constant-coefficient differential operator.
57 p. 40/50 Discrete-time LTIDSs These theorems remain valid for discrete-systems. The relevant ring for the case T = Z is R[ξ,ξ 1 ]. For T = Z +, it is R[ξ].
58 p. 41/50 PDEs These theorems also remain valid for systems described by linear constant-coefficient PDEs with the relevant ring R[ξ 1,ξ 2,...,ξ n ], the appropriate notion of controllability.
59 p. 42/50 n-d controllabilty [[(R n,r w,b) is controllable ]] : [[ w 1,w 2 B, and open subsets O 1,O 2 R n with non-intersecting closures, w B such that w O1 = w 1 O1 and w O2 = w 1 O2 ]].
60 p. 42/50 n-d controllabilty [[(R n,r w,b) is controllable ]] : [[ w 1,w 2 B, and open subsets O 1,O 2 R n with non-intersecting closures, w B such that w O1 = w 1 O1 and w O2 = w 1 O2 ]]. This definition is illustrated in the picture below. R w R w w O 1 O 2 R R w w w w R O 1 O 2 R
61 Observability and detectability p. 43/50
62 p. 44/50 Reminder observed w 1 System w 2 to-be-deduced observability : w 2 may be deduced from w 1.!!! Knowing the laws of the system!!!
63 p. 45/50 The observability theorem Theorem The following are equivalent for B L w 1+w 2, B C (R,R w 1 R w 2). 1. w 2 is observable from w 1 in B. 2. B has a kernel representation R 1 ( d dt) w1 = R 2 ( d dt) w2, with rank(r 2 (λ)) =w 2 for all λ C. 3. B has a minimal kernel representation w 2 = F ( d dt ) w1, R ( d dt ) w1 = 0.
64 p. 46/50 Proof in telegram-style [[Observability]] [[R 2 ( d dt) is injective]] [[2.]]
65 p. 46/50 Proof in telegram-style [[Observability]] [[R 2 ( d dt) is injective]] [[2.]] ( ) is obvious. To prove [ ( ), ] observe that 2. implies that R 2 I w2 w is of the form R 2 = V 2 U, with V,U unimodular. 0 w2 Therefore B admits the kernel representation ( ) ( ) ( ) d d d R 1 w 1 = U w 2, R 1 w 1 = 0, dt dt dt leading to 3.
66 p. 47/50 The detectability theorem Theorem The following are equivalent for B L w 1+w 2, B C (R,R w 1 R w 2). 1. w 2 is detectable from w 1 in B. 2. B has a kernel representation R 1 ( d dt) w1 = R 2 ( ddt ) w2, with rank(r 2 (λ)) =w 2 for λ {λ C Real(λ ) 0}. 3. B has a minimal kernel representation ( ) ( ) ( d d d H w 2 = F w 1, R dt dt dt with H Hurwitz. ) w 1 = 0,
67 Recapitulation p. 48/50
68 p. 49/50 Summary There exists tests for verifying the controllability of a LTIDS. A LTIDS is controllable if and only if it allows an image representation.
69 p. 49/50 Summary There exists tests for verifying the controllability of a LTIDS. A LTIDS is controllable if and only if it allows an image representation. There exists tests for verifying the stabilizability of a LTIDS.
70 p. 49/50 Summary There exists tests for verifying the controllability of a LTIDS. A LTIDS is controllable if and only if it allows an image representation. There exists tests for verifying the stabilizability of a LTIDS. Every LTIDS admits a decomposition as controllable autonomous.
71 p. 49/50 Summary There exists tests for verifying the controllability of a LTIDS. A LTIDS is controllable if and only if it allows an image representation. There exists tests for verifying the stabilizability of a LTIDS. Every LTIDS admits a decomposition as controllable autonomous. The transfer function determines the controllable part only.
72 p. 49/50 Summary There exists tests for verifying the controllability of a LTIDS. A LTIDS is controllable if and only if it allows an image representation. There exists tests for verifying the stabilizability of a LTIDS. Every LTIDS admits a decomposition as controllable autonomous. The transfer function determines the controllable part only. There exists tests for verifying the observability and the detectability of a LTIDS.
73 End of Lecture VI p. 50/50
LINEAR TIME-INVARIANT DIFFERENTIAL SYSTEMS
p. 1/83 Elgersburg Lectures March 2010 Lecture II LINEAR TIME-INVARIANT DIFFERENTIAL SYSTEMS p. 2/83 Theme Linear time-invariant differential systems are important for several reasons. They occur often
More informationThe Behavioral Approach to Systems Theory
The Behavioral Approach to Systems Theory... and DAEs Patrick Kürschner July 21, 2010 1/31 Patrick Kürschner The Behavioral Approach to Systems Theory Outline 1 Introduction 2 Mathematical Models 3 Linear
More informationThe Behavioral Approach to Systems Theory
The Behavioral Approach to Systems Theory Paolo Rapisarda, Un. of Southampton, U.K. & Jan C. Willems, K.U. Leuven, Belgium MTNS 2006 Kyoto, Japan, July 24 28, 2006 Lecture 2: Representations and annihilators
More informationSYSTEM INTERCONNECTION
p. 1/60 Elgersburg Lectures March 2010 Lecture IV SYSTEM INTERCONNECTION p. 2/60 Outline Motivation Modeling by tearing, zooming, and linking An example Control as interconnection Pole assignment and stabilization
More informationDISTANCE BETWEEN BEHAVIORS AND RATIONAL REPRESENTATIONS
DISTANCE BETWEEN BEHAVIORS AND RATIONAL REPRESENTATIONS H.L. TRENTELMAN AND S.V. GOTTIMUKKALA Abstract. In this paper we study notions of distance between behaviors of linear differential systems. We introduce
More informationPOLYNOMIAL EMBEDDING ALGORITHMS FOR CONTROLLERS IN A BEHAVIORAL FRAMEWORK
1 POLYNOMIAL EMBEDDING ALGORITHMS FOR CONTROLLERS IN A BEHAVIORAL FRAMEWORK H.L. Trentelman, Member, IEEE, R. Zavala Yoe, and C. Praagman Abstract In this paper we will establish polynomial algorithms
More informationStability, Pole Placement, Observers and Stabilization
Stability, Pole Placement, Observers and Stabilization 1 1, The Netherlands DISC Course Mathematical Models of Systems Outline 1 Stability of autonomous systems 2 The pole placement problem 3 Stabilization
More informationSuppose that we have a real phenomenon. The phenomenon produces events (synonym: outcomes ).
p. 5/44 Modeling Suppose that we have a real phenomenon. The phenomenon produces events (synonym: outcomes ). Phenomenon Event, outcome We view a (deterministic) model for the phenomenon as a prescription
More information1. Algebraic vector bundles. Affine Varieties
0. Brief overview Cycles and bundles are intrinsic invariants of algebraic varieties Close connections going back to Grothendieck Work with quasi-projective varieties over a field k Affine Varieties 1.
More informationGeometry 9: Serre-Swan theorem
Geometry 9: Serre-Swan theorem Rules: You may choose to solve only hard exercises (marked with!, * and **) or ordinary ones (marked with! or unmarked), or both, if you want to have extra problems. To have
More informationFOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 43
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 43 RAVI VAKIL CONTENTS 1. Facts we ll soon know about curves 1 1. FACTS WE LL SOON KNOW ABOUT CURVES We almost know enough to say a lot of interesting things about
More informationLinear Hamiltonian systems
Linear Hamiltonian systems P. Rapisarda H.L. Trentelman Abstract We study linear Hamiltonian systems using bilinear and quadratic differential forms. Such a representation-free approach allows to use the
More informationContents. 1 State-Space Linear Systems 5. 2 Linearization Causality, Time Invariance, and Linearity 31
Contents Preamble xiii Linear Systems I Basic Concepts 1 I System Representation 3 1 State-Space Linear Systems 5 1.1 State-Space Linear Systems 5 1.2 Block Diagrams 7 1.3 Exercises 11 2 Linearization
More informationBinomial Exercises A = 1 1 and 1
Lecture I. Toric ideals. Exhibit a point configuration A whose affine semigroup NA does not consist of the intersection of the lattice ZA spanned by the columns of A with the real cone generated by A.
More informationSystems of linear equations. We start with some linear algebra. Let K be a field. We consider a system of linear homogeneous equations over K,
Systems of linear equations We start with some linear algebra. Let K be a field. We consider a system of linear homogeneous equations over K, f 11 t 1 +... + f 1n t n = 0, f 21 t 1 +... + f 2n t n = 0,.
More information0. Introduction 1 0. INTRODUCTION
0. Introduction 1 0. INTRODUCTION In a very rough sketch we explain what algebraic geometry is about and what it can be used for. We stress the many correlations with other fields of research, such as
More informationa (b + c) = a b + a c
Chapter 1 Vector spaces In the Linear Algebra I module, we encountered two kinds of vector space, namely real and complex. The real numbers and the complex numbers are both examples of an algebraic structure
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationControllability, Observability, Full State Feedback, Observer Based Control
Multivariable Control Lecture 4 Controllability, Observability, Full State Feedback, Observer Based Control John T. Wen September 13, 24 Ref: 3.2-3.4 of Text Controllability ẋ = Ax + Bu; x() = x. At time
More informationLECTURE 8: THE SECTIONAL AND RICCI CURVATURES
LECTURE 8: THE SECTIONAL AND RICCI CURVATURES 1. The Sectional Curvature We start with some simple linear algebra. As usual we denote by ( V ) the set of 4-tensors that is anti-symmetric with respect to
More informationLecture 5: Hodge theorem
Lecture 5: Hodge theorem Jonathan Evans 4th October 2010 Jonathan Evans () Lecture 5: Hodge theorem 4th October 2010 1 / 15 Jonathan Evans () Lecture 5: Hodge theorem 4th October 2010 2 / 15 The aim of
More informationwhere m is the maximal ideal of O X,p. Note that m/m 2 is a vector space. Suppose that we are given a morphism
8. Smoothness and the Zariski tangent space We want to give an algebraic notion of the tangent space. In differential geometry, tangent vectors are equivalence classes of maps of intervals in R into the
More informationMultivariable Control. Lecture 03. Description of Linear Time Invariant Systems. John T. Wen. September 7, 2006
Multivariable Control Lecture 3 Description of Linear Time Invariant Systems John T. Wen September 7, 26 Outline Mathematical description of LTI Systems Ref: 3.1-3.4 of text September 7, 26Copyrighted
More informationLECTURE 1: SOME GENERALITIES; 1 DIMENSIONAL EXAMPLES
LECTURE 1: SOME GENERALITIES; 1 DIMENSIONAL EAMPLES VIVEK SHENDE Historically, sheaves come from topology and analysis; subsequently they have played a fundamental role in algebraic geometry and certain
More informationRIEMANN SURFACES. max(0, deg x f)x.
RIEMANN SURFACES 10. Weeks 11 12: Riemann-Roch theorem and applications 10.1. Divisors. The notion of a divisor looks very simple. Let X be a compact Riemann surface. A divisor is an expression a x x x
More informationVector Bundles on Algebraic Varieties
Vector Bundles on Algebraic Varieties Aaron Pribadi December 14, 2010 Informally, a vector bundle associates a vector space with each point of another space. Vector bundles may be constructed over general
More information30 Surfaces and nondegenerate symmetric bilinear forms
80 CHAPTER 3. COHOMOLOGY AND DUALITY This calculation is useful! Corollary 29.4. Let p, q > 0. Any map S p+q S p S q induces the zero map in H p+q ( ). Proof. Let f : S p+q S p S q be such a map. It induces
More informationLECTURE: KOBORDISMENTHEORIE, WINTER TERM 2011/12; SUMMARY AND LITERATURE
LECTURE: KOBORDISMENTHEORIE, WINTER TERM 2011/12; SUMMARY AND LITERATURE JOHANNES EBERT 1.1. October 11th. 1. Recapitulation from differential topology Definition 1.1. Let M m, N n, be two smooth manifolds
More informationMATH 8253 ALGEBRAIC GEOMETRY WEEK 12
MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f
More informationAlgebraic Number Theory
TIFR VSRP Programme Project Report Algebraic Number Theory Milind Hegde Under the guidance of Prof. Sandeep Varma July 4, 2015 A C K N O W L E D G M E N T S I would like to express my thanks to TIFR for
More informationControl Systems. System response. L. Lanari
Control Systems m i l e r p r a in r e v y n is o System response L. Lanari Outline What we are going to see: how to compute in the s-domain the forced response (zero-state response) using the transfer
More informationKey words. n-d systems, free directions, restriction to 1-D subspace, intersection ideal.
ALGEBRAIC CHARACTERIZATION OF FREE DIRECTIONS OF SCALAR n-d AUTONOMOUS SYSTEMS DEBASATTAM PAL AND HARISH K PILLAI Abstract In this paper, restriction of scalar n-d systems to 1-D subspaces has been considered
More informationFOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 37
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 37 RAVI VAKIL CONTENTS 1. Application of cohomology: Hilbert polynomials and functions, Riemann- Roch, degrees, and arithmetic genus 1 1. APPLICATION OF COHOMOLOGY:
More informationControl Systems. Laplace domain analysis
Control Systems Laplace domain analysis L. Lanari outline introduce the Laplace unilateral transform define its properties show its advantages in turning ODEs to algebraic equations define an Input/Output
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime
More informationAlgebraic v.s. Analytic Point of View
Algebraic v.s. Analytic Point of View Ziwen Zhu September 19, 2015 In this talk, we will compare 3 different yet similar objects of interest in algebraic and complex geometry, namely algebraic variety,
More informationAlgebraic Varieties. Notes by Mateusz Micha lek for the lecture on April 17, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra
Algebraic Varieties Notes by Mateusz Micha lek for the lecture on April 17, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra Algebraic varieties represent solutions of a system of polynomial
More informationAlgebraic Geometry. Andreas Gathmann. Notes for a class. taught at the University of Kaiserslautern 2002/2003
Algebraic Geometry Andreas Gathmann Notes for a class taught at the University of Kaiserslautern 2002/2003 CONTENTS 0. Introduction 1 0.1. What is algebraic geometry? 1 0.2. Exercises 6 1. Affine varieties
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More informationAlgebraic Geometry. Andreas Gathmann. Class Notes TU Kaiserslautern 2014
Algebraic Geometry Andreas Gathmann Class Notes TU Kaiserslautern 2014 Contents 0. Introduction......................... 3 1. Affine Varieties........................ 9 2. The Zariski Topology......................
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More information3.1. Derivations. Let A be a commutative k-algebra. Let M be a left A-module. A derivation of A in M is a linear map D : A M such that
ALGEBRAIC GROUPS 33 3. Lie algebras Now we introduce the Lie algebra of an algebraic group. First, we need to do some more algebraic geometry to understand the tangent space to an algebraic variety at
More informationStabilization, Pole Placement, and Regular Implementability
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 47, NO. 5, MAY 2002 735 Stabilization, Pole Placement, and Regular Implementability Madhu N. Belur and H. L. Trentelman, Senior Member, IEEE Abstract In this
More information4. Images of Varieties Given a morphism f : X Y of quasi-projective varieties, a basic question might be to ask what is the image of a closed subset
4. Images of Varieties Given a morphism f : X Y of quasi-projective varieties, a basic question might be to ask what is the image of a closed subset Z X. Replacing X by Z we might as well assume that Z
More informationDivision Algebras and Parallelizable Spheres, Part II
Division Algebras and Parallelizable Spheres, Part II Seminartalk by Jerome Wettstein April 5, 2018 1 A quick Recap of Part I We are working on proving the following Theorem: Theorem 1.1. The following
More informationExtended Index. 89f depth (of a prime ideal) 121f Artin-Rees Lemma. 107f descending chain condition 74f Artinian module
Extended Index cokernel 19f for Atiyah and MacDonald's Introduction to Commutative Algebra colon operator 8f Key: comaximal ideals 7f - listings ending in f give the page where the term is defined commutative
More informationALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS.
ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS. KEVIN MCGERTY. 1. RINGS The central characters of this course are algebraic objects known as rings. A ring is any mathematical structure where you can add
More informationFOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 37
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 37 RAVI VAKIL CONTENTS 1. Motivation and game plan 1 2. The affine case: three definitions 2 Welcome back to the third quarter! The theme for this quarter, insofar
More informationChapter 19 Clifford and the Number of Holes
Chapter 19 Clifford and the Number of Holes We saw that Riemann denoted the genus by p, a notation which is still frequently used today, in particular for the generalizations of this notion in higher dimensions.
More informationLECTURES ON SHIMURA CURVES: ARITHMETIC FUCHSIAN GROUPS
LECTURES ON SHIMURA CURVES: ARITHMETIC FUCHSIAN GROUPS PETE L. CLARK 1. What is an arithmetic Fuchsian group? The class of Fuchsian groups that we are (by far) most interested in are the arithmetic groups.
More informationLecture 28: Fields, Modules, and vector spaces
Lecture 28: Fields, Modules, and vector spaces 1. Modules Just as groups act on sets, rings act on abelian groups. When a ring acts on an abelian group, that abelian group is called a module over that
More information(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More informationHomework in Topology, Spring 2009.
Homework in Topology, Spring 2009. Björn Gustafsson April 29, 2009 1 Generalities To pass the course you should hand in correct and well-written solutions of approximately 10-15 of the problems. For higher
More informationResolution of Singularities in Algebraic Varieties
Resolution of Singularities in Algebraic Varieties Emma Whitten Summer 28 Introduction Recall that algebraic geometry is the study of objects which are or locally resemble solution sets of polynomial equations.
More information10. Smooth Varieties. 82 Andreas Gathmann
82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It
More informationSpecial cubic fourfolds
Special cubic fourfolds 1 Hodge diamonds Let X be a cubic fourfold, h H 2 (X, Z) be the (Poincaré dual to the) hyperplane class. We have h 4 = deg(x) = 3. By the Lefschetz hyperplane theorem, one knows
More informationALGEBRA EXERCISES, PhD EXAMINATION LEVEL
ALGEBRA EXERCISES, PhD EXAMINATION LEVEL 1. Suppose that G is a finite group. (a) Prove that if G is nilpotent, and H is any proper subgroup, then H is a proper subgroup of its normalizer. (b) Use (a)
More information(x 1, y 1 ) = (x 2, y 2 ) if and only if x 1 = x 2 and y 1 = y 2.
1. Complex numbers A complex number z is defined as an ordered pair z = (x, y), where x and y are a pair of real numbers. In usual notation, we write z = x + iy, where i is a symbol. The operations of
More informationDERIVED CATEGORIES: LECTURE 4. References
DERIVED CATEGORIES: LECTURE 4 EVGENY SHINDER References [Muk] Shigeru Mukai, Fourier functor and its application to the moduli of bundles on an abelian variety, Algebraic geometry, Sendai, 1985, 515 550,
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationAlgebraic Geometry Spring 2009
MIT OpenCourseWare http://ocw.mit.edu 18.726 Algebraic Geometry Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.726: Algebraic Geometry
More informationGEOMETRIC CLASS FIELD THEORY I
GEOMETRIC CLASS FIELD THEORY I TONY FENG 1. Classical class field theory 1.1. The Artin map. Let s start off by reviewing the classical origins of class field theory. The motivating problem is basically
More informationCW-complexes. Stephen A. Mitchell. November 1997
CW-complexes Stephen A. Mitchell November 1997 A CW-complex is first of all a Hausdorff space X equipped with a collection of characteristic maps φ n α : D n X. Here n ranges over the nonnegative integers,
More informationALGEBRAIC K-THEORY HANDOUT 5: K 0 OF SCHEMES, THE LOCALIZATION SEQUENCE FOR G 0.
ALGEBRAIC K-THEORY HANDOUT 5: K 0 OF SCHEMES, THE LOCALIZATION SEQUENCE FOR G 0. ANDREW SALCH During the last lecture, we found that it is natural (even just for doing undergraduatelevel complex analysis!)
More informationExercises for algebraic curves
Exercises for algebraic curves Christophe Ritzenthaler February 18, 2019 1 Exercise Lecture 1 1.1 Exercise Show that V = {(x, y) C 2 s.t. y = sin x} is not an algebraic set. Solutions. Let us assume that
More informationAN INTRODUCTION TO AFFINE SCHEMES
AN INTRODUCTION TO AFFINE SCHEMES BROOKE ULLERY Abstract. This paper gives a basic introduction to modern algebraic geometry. The goal of this paper is to present the basic concepts of algebraic geometry,
More informationSolving Systems of Equations Row Reduction
Solving Systems of Equations Row Reduction November 19, 2008 Though it has not been a primary topic of interest for us, the task of solving a system of linear equations has come up several times. For example,
More information3. Lecture 3. Y Z[1/p]Hom (Sch/k) (Y, X).
3. Lecture 3 3.1. Freely generate qfh-sheaves. We recall that if F is a homotopy invariant presheaf with transfers in the sense of the last lecture, then we have a well defined pairing F(X) H 0 (X/S) F(S)
More informationPrüfer domain. Thierry Coquand. August 2008
Thierry Coquand August 2008 Valuation domain A valuation domain is an integral domain R such that for any u, v in R either v divides u or u divides v Another formulation is that for any s 0 in the field
More informationQ N id β. 2. Let I and J be ideals in a commutative ring A. Give a simple description of
Additional Problems 1. Let A be a commutative ring and let 0 M α N β P 0 be a short exact sequence of A-modules. Let Q be an A-module. i) Show that the naturally induced sequence is exact, but that 0 Hom(P,
More informationMath 210B. Artin Rees and completions
Math 210B. Artin Rees and completions 1. Definitions and an example Let A be a ring, I an ideal, and M an A-module. In class we defined the I-adic completion of M to be M = lim M/I n M. We will soon show
More information(www.math.uni-bonn.de/people/harder/manuscripts/buch/), files chap2 to chap
The basic objects in the cohomology theory of arithmetic groups Günter Harder This is an exposition of the basic notions and concepts which are needed to build up the cohomology theory of arithmetic groups
More informationContents. 2 Sequences and Series Approximation by Rational Numbers Sequences Basics on Sequences...
Contents 1 Real Numbers: The Basics... 1 1.1 Notation... 1 1.2 Natural Numbers... 4 1.3 Integers... 5 1.4 Fractions and Rational Numbers... 10 1.4.1 Introduction... 10 1.4.2 Powers and Radicals of Rational
More informationMath 145. Codimension
Math 145. Codimension 1. Main result and some interesting examples In class we have seen that the dimension theory of an affine variety (irreducible!) is linked to the structure of the function field in
More informationALGEBRAIC GROUPS. Disclaimer: There are millions of errors in these notes!
ALGEBRAIC GROUPS Disclaimer: There are millions of errors in these notes! 1. Some algebraic geometry The subject of algebraic groups depends on the interaction between algebraic geometry and group theory.
More informationHungry, Hungry Homology
September 27, 2017 Motiving Problem: Algebra Problem (Preliminary Version) Given two groups A, C, does there exist a group E so that A E and E /A = C? If such an group exists, we call E an extension of
More informationHandlebody Decomposition of a Manifold
Handlebody Decomposition of a Manifold Mahuya Datta Statistics and Mathematics Unit Indian Statistical Institute, Kolkata mahuya@isical.ac.in January 12, 2012 contents Introduction What is a handlebody
More information(VI.D) Generalized Eigenspaces
(VI.D) Generalized Eigenspaces Let T : C n C n be a f ixed linear transformation. For this section and the next, all vector spaces are assumed to be over C ; in particular, we will often write V for C
More informationJoão P. Hespanha. January 16, 2009
LINEAR SYSTEMS THEORY João P. Hespanha January 16, 2009 Disclaimer: This is a draft and probably contains a few typos. Comments and information about typos are welcome. Please contact the author at hespanha@ece.ucsb.edu.
More informationUnimodular Elements and Projective Modules Abhishek Banerjee Indian Statistical Institute 203, B T Road Calcutta India
Unimodular Elements and Projective Modules Abhishek Banerjee Indian Statistical Institute 203, B T Road Calcutta 700108 India Abstract We are mainly concerned with the completablity of unimodular rows
More informationRings and groups. Ya. Sysak
Rings and groups. Ya. Sysak 1 Noetherian rings Let R be a ring. A (right) R -module M is called noetherian if it satisfies the maximum condition for its submodules. In other words, if M 1... M i M i+1...
More informationApproximate time-controllability versus time-controllability
Approximate time-controllability versus time-controllability Amol J. Sasane Department of Mathematics University of Twente P.O. Box 217, 7500 AE Enschede The Netherlands A.J.Sasane@math.utwente.nl Kanat
More informationBasic facts and definitions
Synopsis Thursday, September 27 Basic facts and definitions We have one one hand ideals I in the polynomial ring k[x 1,... x n ] and subsets V of k n. There is a natural correspondence. I V (I) = {(k 1,
More informationMotivic integration on Artin n-stacks
Motivic integration on Artin n-stacks Chetan Balwe Nov 13,2009 1 / 48 Prestacks (This treatment of stacks is due to B. Toën and G. Vezzosi.) Let S be a fixed base scheme. Let (Aff /S) be the category of
More information4.1. Paths. For definitions see section 2.1 (In particular: path; head, tail, length of a path; concatenation;
4 The path algebra of a quiver 41 Paths For definitions see section 21 (In particular: path; head, tail, length of a path; concatenation; oriented cycle) Lemma Let Q be a quiver If there is a path of length
More informationGeneralized eigenspaces
Generalized eigenspaces November 30, 2012 Contents 1 Introduction 1 2 Polynomials 2 3 Calculating the characteristic polynomial 5 4 Projections 7 5 Generalized eigenvalues 10 6 Eigenpolynomials 15 1 Introduction
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationAnalytic Fredholm Theory
Analytic Fredholm Theory Ethan Y. Jaffe The purpose of this note is to prove a version of analytic Fredholm theory, and examine a special case. Theorem 1.1 (Analytic Fredholm Theory). Let Ω be a connected
More informationBare-bones outline of eigenvalue theory and the Jordan canonical form
Bare-bones outline of eigenvalue theory and the Jordan canonical form April 3, 2007 N.B.: You should also consult the text/class notes for worked examples. Let F be a field, let V be a finite-dimensional
More informationA GLIMPSE OF ALGEBRAIC K-THEORY: Eric M. Friedlander
A GLIMPSE OF ALGEBRAIC K-THEORY: Eric M. Friedlander During the first three days of September, 1997, I had the privilege of giving a series of five lectures at the beginning of the School on Algebraic
More informationMATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA
MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA These are notes for our first unit on the algebraic side of homological algebra. While this is the last topic (Chap XX) in the book, it makes sense to
More informationINTRODUCTION TO THE HODGE CONJECTURE
INTRODUCTION TO THE HODGE CONJECTURE JIM BROWN Abstract. These are notes from a talk introducing the Hodge conjecture to undergraduates attending the 2009 Clemson REU. The description given here of the
More informationThe Calabi Conjecture
The Calabi Conjecture notes by Aleksander Doan These are notes to the talk given on 9th March 2012 at the Graduate Topology and Geometry Seminar at the University of Warsaw. They are based almost entirely
More informationA = u + V. u + (0) = u
Recall: Last time we defined an affine subset of R n to be a subset of the form A = u + V = {u + v u R n,v V } where V is a subspace of R n We said that we would use the notation A = {u,v } to indicate
More informationLECTURE 5: COMPLEX AND KÄHLER MANIFOLDS
LECTURE 5: COMPLEX AND KÄHLER MANIFOLDS Contents 1. Almost complex manifolds 1. Complex manifolds 5 3. Kähler manifolds 9 4. Dolbeault cohomology 11 1. Almost complex manifolds Almost complex structures.
More informationVector Bundles vs. Jesko Hüttenhain. Spring Abstract
Vector Bundles vs. Locally Free Sheaves Jesko Hüttenhain Spring 2013 Abstract Algebraic geometers usually switch effortlessly between the notion of a vector bundle and a locally free sheaf. I will define
More informationObservability. Dynamic Systems. Lecture 2 Observability. Observability, continuous time: Observability, discrete time: = h (2) (x, u, u)
Observability Dynamic Systems Lecture 2 Observability Continuous time model: Discrete time model: ẋ(t) = f (x(t), u(t)), y(t) = h(x(t), u(t)) x(t + 1) = f (x(t), u(t)), y(t) = h(x(t)) Reglerteknik, ISY,
More informationPart II. Riemann Surfaces. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 96 Paper 2, Section II 23F State the uniformisation theorem. List without proof the Riemann surfaces which are uniformised
More informationCOBORDISM AND FORMAL POWER SERIES
COBORDISM AND FORMAL POWER SERIES NEIL STRICKLAND Thom s cobordism theorem The graded ring of cobordism classes of manifolds is Z/2[x 2, x 4, x 5, x 6, x 8, x 9, x 10, x 11, x 12, x 13, x 14, x 16, x 17,...
More information