Lecture 13. Math 22 Summer 2017 July 17, 2017

Size: px
Start display at page:

Download "Lecture 13. Math 22 Summer 2017 July 17, 2017"

Transcription

1 Lecture 13 Math 22 Summer 2017 July 17, 2017

2 Reminders/Announcements Midterm 1 Wednesday, July 19, Kemeny 008, 6pm-8pm Please respond to if you have a conflict with this time! Kate is moving her study group to Wednesday 3pm - 4:30pm in the usual place (Berry 370). She is not having study group this Sunday. Last scheduled x-hour meets tomorrow. Thursday office hours are on Tuesday this week due to: HW4 will be posted later today and due Friday as usual. Any other questions (content or otherwise) please feel free to me.

3 Just for today 4.1 Two examples we didn t get to last time 4.2 Null and column spaces corresponding to linear maps

4 4.1 Proving a set is a subspace

5 4.1 Proving a set is a subspace To show a subset of a vector space is a subspace we can always use the definition.

6 4.1 Proving a set is a subspace To show a subset of a vector space is a subspace we can always use the definition. However, the previous theorem gives us another way...

7 4.1 Proving a set is a subspace To show a subset of a vector space is a subspace we can always use the definition. However, the previous theorem gives us another way... Let s + 2t H = t : s, t R 3s 7t R3.

8 4.1 Proving a set is a subspace To show a subset of a vector space is a subspace we can always use the definition. However, the previous theorem gives us another way... Let s + 2t H = t : s, t R 3s 7t R3. How can we use the previous theorem to show H is a subspace?

9 4.1 Proving a set is a subspace To show a subset of a vector space is a subspace we can always use the definition. However, the previous theorem gives us another way... Let s + 2t H = t : s, t R 3s 7t R3. How can we use the previous theorem to show H is a subspace? Well, 1 2 H = Span 0,

10 4.1 Proving a set is not a subspace

11 4.1 Proving a set is not a subspace To show that a subset is not a subspace, we just need to show that at least one of the axioms fails to be satisfied.

12 4.1 Proving a set is not a subspace To show that a subset is not a subspace, we just need to show that at least one of the axioms fails to be satisfied. Let H = {[ ] } 3s : s R s

13 4.1 Proving a set is not a subspace To show that a subset is not a subspace, we just need to show that at least one of the axioms fails to be satisfied. Let H = {[ ] } 3s : s R s How do we show H is not a subspace?

14 4.2 Definition of null space

15 4.2 Definition of null space Definition

16 4.2 Definition of null space Definition Let A be an m n matrix.

17 4.2 Definition of null space Definition Let A be an m n matrix. The null space of A is the set of solutions to the matrix equation Ax = 0.

18 4.2 Definition of null space Definition Let A be an m n matrix. The null space of A is the set of solutions to the matrix equation Ax = 0. We denote the null space of a matrix A by Nul A.

19 4.2 Theorem 2

20 4.2 Theorem 2 Theorem

21 4.2 Theorem 2 Theorem Let A be an m n matrix.

22 4.2 Theorem 2 Theorem Let A be an m n matrix. Then the null space of A is a subspace.

23 4.2 Theorem 2 Theorem Let A be an m n matrix. Then the null space of A is a subspace. Of what vector space?

24 4.2 Theorem 2 Theorem Let A be an m n matrix. Then the null space of A is a subspace. Of what vector space? R n.

25 4.2 Theorem 2 Theorem Let A be an m n matrix. Then the null space of A is a subspace. Of what vector space? R n. Proof.

26 4.2 Theorem 2 Theorem Let A be an m n matrix. Then the null space of A is a subspace. Of what vector space? R n. Proof. Show 0 Nul A.

27 4.2 Theorem 2 Theorem Let A be an m n matrix. Then the null space of A is a subspace. Of what vector space? R n. Proof. Show 0 Nul A. Show Nul A closed under addition.

28 4.2 Theorem 2 Theorem Let A be an m n matrix. Then the null space of A is a subspace. Of what vector space? R n. Proof. Show 0 Nul A. Show Nul A closed under addition. Show Nul A closed under scalar multiplication.

29 4.2 An explicit description for Nul A Let A =

30 4.2 An explicit description for Nul A Let A = Find vectors u, v, w such that Nul A = Span{u, v, w}.

31 4.2 An explicit description for Nul A Let A = Find vectors u, v, w such that Nul A = Span{u, v, w}. Solution:

32 4.2 An explicit description for Nul A Let A = Find vectors u, v, w such that Nul A = Span{u, v, w}. Solution: First note that the RREF of A is

33 4.2 An explicit description for Nul A Let A = Find vectors u, v, w such that Nul A = Span{u, v, w}. Solution: First note that the RREF of A is Now write out the parametric vector form of the solutions to Ax = 0.

34 4.2 An explicit description for Nul A Let A = Find vectors u, v, w such that Nul A = Span{u, v, w}. Solution: First note that the RREF of A is Now write out the parametric vector form of the solutions to Ax = 0. Can you see how this yields a spanning set?

35 4.2 An explicit description for Nul A Let A = Find vectors u, v, w such that Nul A = Span{u, v, w}. Solution: First note that the RREF of A is Now write out the parametric vector form of the solutions to Ax = 0. Can you see how this yields a spanning set? Is this set linearly independent?

36 4.2 Null spaces as kernels of linear maps

37 4.2 Null spaces as kernels of linear maps As you might expect, Nul A can also be phrased in the language of linear maps.

38 4.2 Null spaces as kernels of linear maps As you might expect, Nul A can also be phrased in the language of linear maps. Definition

39 4.2 Null spaces as kernels of linear maps As you might expect, Nul A can also be phrased in the language of linear maps. Definition Let T : V W be a linear map of vector spaces.

40 4.2 Null spaces as kernels of linear maps As you might expect, Nul A can also be phrased in the language of linear maps. Definition Let T : V W be a linear map of vector spaces. (What is this?)

41 4.2 Null spaces as kernels of linear maps As you might expect, Nul A can also be phrased in the language of linear maps. Definition Let T : V W be a linear map of vector spaces. (What is this?) The kernel of T is the set of all vectors x V such that T (x) = 0.

42 4.2 Null spaces as kernels of linear maps As you might expect, Nul A can also be phrased in the language of linear maps. Definition Let T : V W be a linear map of vector spaces. (What is this?) The kernel of T is the set of all vectors x V such that T (x) = 0. We denote this set by ker T.

43 4.2 Null spaces as kernels of linear maps As you might expect, Nul A can also be phrased in the language of linear maps. Definition Let T : V W be a linear map of vector spaces. (What is this?) The kernel of T is the set of all vectors x V such that T (x) = 0. We denote this set by ker T. How does ker T relate to Nul A?

44 4.2 Definition of column space

45 4.2 Definition of column space Definition

46 4.2 Definition of column space Definition Let A be an m n matrix.

47 4.2 Definition of column space Definition Let A be an m n matrix. The column space of A is the span of the columns of A.

48 4.2 Definition of column space Definition Let A be an m n matrix. The column space of A is the span of the columns of A. We denote this space as Col A.

49 4.2 Definition of column space Definition Let A be an m n matrix. The column space of A is the span of the columns of A. We denote this space as Col A. Why is Col A a subspace?

50 4.2 Definition of column space Definition Let A be an m n matrix. The column space of A is the span of the columns of A. We denote this space as Col A. Why is Col A a subspace? What vector space is Col A a subspace of?

51 4.2 Definition of column space Definition Let A be an m n matrix. The column space of A is the span of the columns of A. We denote this space as Col A. Why is Col A a subspace? What vector space is Col A a subspace of? When is Col A = R m?

52 4.2 Column spaces as images of linear maps

53 4.2 Column spaces as images of linear maps As you might expect, Col A can also be phrased in the language of linear maps.

54 4.2 Column spaces as images of linear maps As you might expect, Col A can also be phrased in the language of linear maps. Definition

55 4.2 Column spaces as images of linear maps As you might expect, Col A can also be phrased in the language of linear maps. Definition Let T : V W be a linear map of vector spaces.

56 4.2 Column spaces as images of linear maps As you might expect, Col A can also be phrased in the language of linear maps. Definition Let T : V W be a linear map of vector spaces. The image or range of T is the set of all vectors b W such that there exists x V and T (x) = b.

57 4.2 Column spaces as images of linear maps As you might expect, Col A can also be phrased in the language of linear maps. Definition Let T : V W be a linear map of vector spaces. The image or range of T is the set of all vectors b W such that there exists x V and T (x) = b. We denote this set by imgt.

58 4.2 Column spaces as images of linear maps As you might expect, Col A can also be phrased in the language of linear maps. Definition Let T : V W be a linear map of vector spaces. The image or range of T is the set of all vectors b W such that there exists x V and T (x) = b. We denote this set by imgt. How does imgt relate to Col A?

59 4.2 Classwork Let A =

60 4.2 Classwork Let A = Nul A R k for what k? Col A R k for what k?

61 4.2 Classwork Let A = Nul A R k for what k? Col A R k for what k? 2. Find a nonzero vector in Nul A. Find a nonzero vector in Col A.

62 4.2 Classwork Let A = Nul A R k for what k? Col A R k for what k? 2. Find a nonzero vector in Nul A. Find a nonzero vector in Col A. 3. Let u = 0, v = Is u Nul A? Is u Col A? Is v Nul A? Is v Col A?

Math 2331 Linear Algebra

Math 2331 Linear Algebra 4.2 Null Spaces, Column Spaces, & Linear Transformations Math 233 Linear Algebra 4.2 Null Spaces, Column Spaces, & Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu

More information

1) Give a set-theoretic description of the given points as a subset W of R 3. a) The points on the plane x + y 2z = 0.

1) Give a set-theoretic description of the given points as a subset W of R 3. a) The points on the plane x + y 2z = 0. ) Give a set-theoretic description of the given points as a subset W of R. a) The points on the plane x + y z =. x Solution: W = {x: x = [ x ], x + x x = }. x b) The points in the yz-plane. Solution: W

More information

MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.

MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the

More information

Column and row space of a matrix

Column and row space of a matrix Column and row space of a matrix Recall that we can consider matrices as concatenation of rows or columns. c c 2 c 3 A = r r 2 r 3 a a 2 a 3 a 2 a 22 a 23 a 3 a 32 a 33 The space spanned by columns of

More information

Lesson 19: The Graph of a Linear Equation in Two Variables is a Line

Lesson 19: The Graph of a Linear Equation in Two Variables is a Line Lesson 19: The Graph of a Linear Equation in Two Variables is a Line Classwork Exercises Theorem: The graph of a linear equation y = mx + b is a non-vertical line with slope m and passing through (0, b),

More information

Maths for Signals and Systems Linear Algebra in Engineering. Some problems by Gilbert Strang

Maths for Signals and Systems Linear Algebra in Engineering. Some problems by Gilbert Strang Maths for Signals and Systems Linear Algebra in Engineering Some problems by Gilbert Strang Problems. Consider u, v, w to be non-zero vectors in R 7. These vectors span a vector space. What are the possible

More information

Math 308 Autumn 2016 MIDTERM /18/2016

Math 308 Autumn 2016 MIDTERM /18/2016 Name: Math 38 Autumn 26 MIDTERM - 2 /8/26 Instructions: The exam is 9 pages long, including this title page. The number of points each problem is worth is listed after the problem number. The exam totals

More information

ft-uiowa-math2550 Assignment HW8fall14 due 10/23/2014 at 11:59pm CDT 3. (1 pt) local/library/ui/fall14/hw8 3.pg Given the matrix

ft-uiowa-math2550 Assignment HW8fall14 due 10/23/2014 at 11:59pm CDT 3. (1 pt) local/library/ui/fall14/hw8 3.pg Given the matrix me me Assignment HW8fall4 due /23/24 at :59pm CDT ft-uiowa-math255 466666666666667 2 Calculate the determinant of 6 3-4 -3 D - E F 2 I 4 J 5 C 2 ( pt) local/library/ui/fall4/hw8 2pg Evaluate the following

More information

Math 355: Linear Algebra: Midterm 1 Colin Carroll June 25, 2011

Math 355: Linear Algebra: Midterm 1 Colin Carroll June 25, 2011 Rice University, Summer 20 Math 355: Linear Algebra: Midterm Colin Carroll June 25, 20 I have adhered to the Rice honor code in completing this test. Signature: Name: Date: Time: Please read the following

More information

Announcements Wednesday, August 23

Announcements Wednesday, August 23 Announcements Wednesday, August 23 Everything you ll need to know is on the master website: http://people.math.gatech.edu/~cjankowski3/teaching/f2017/m1553/index.html or on the website for this section:

More information

Announcements Wednesday, August 23

Announcements Wednesday, August 23 Announcements Wednesday, August 23 Everything you ll need to know is on the master website: http://people.math.gatech.edu/~cjankowski3/teaching/f2017/m1553/index.html or on the website for this section:

More information

Orthogonal complements

Orthogonal complements Roberto s Notes on Linear Algebra Chapter 9: Orthogonality Section 3 Orthogonal complements What you need to know already: What orthogonal and orthonormal bases are. What you can learn here: How we can

More information

Lesson 19: The Graph of a Linear Equation in Two Variables Is a Line

Lesson 19: The Graph of a Linear Equation in Two Variables Is a Line The Graph of a Linear Equation in Two Variables Is a Line Classwork Exercises THEOREM: The graph of a linear equation yy = mmmm + bb is a non-vertical line with slope mm and passing through (0, bb), where

More information

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material

More information

General course information

General course information General Instructor: B. Hyle Park (MSE 243 / Bourns B207, hylepark@engr.ucr.edu) Teaching assistant: Junchao Wang (MSE 217, jwang071@ucr.edu) Reader: Michael Xiong (MSE 217, zhehao.xiong@email.ucr.edu)

More information

Introduction to Mathematical Programming IE406. Lecture 4. Dr. Ted Ralphs

Introduction to Mathematical Programming IE406. Lecture 4. Dr. Ted Ralphs Introduction to Mathematical Programming IE406 Lecture 4 Dr. Ted Ralphs IE406 Lecture 4 1 Reading for This Lecture Bertsimas 2.2-2.4 IE406 Lecture 4 2 The Two Crude Petroleum Example Revisited Recall the

More information

Announcements Wednesday, August 22

Announcements Wednesday, August 22 Announcements Wednesday, August 22 Everything you ll need to know is on the master website: http://people.math.gatech.edu/~cjankowski3/18f/m1553/webpage/ or on the website for this section: http://people.math.gatech.edu/~jrabinoff/1819f-1553/

More information

MATH 890 HOMEWORK 2 DAVID MEREDITH

MATH 890 HOMEWORK 2 DAVID MEREDITH MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet

More information

Pre-Calculus Calendar Chapter 1: Linear Relations and Functions Chapter 2: Systems of Linear Equations and Inequalities

Pre-Calculus Calendar Chapter 1: Linear Relations and Functions Chapter 2: Systems of Linear Equations and Inequalities Pre-Calculus Calendar Chapter : Linear Relations and Functions Chapter : Systems of Linear Equations and Inequalities /9 Monday Tuesday Wednesday Thursday Friday /0 / / /. p. 0: 9-5,, 5, 7-,, 5, 7-50.

More information

GEOMETRY R Unit 2: Angles and Parallel Lines

GEOMETRY R Unit 2: Angles and Parallel Lines GEOMETRY R Unit 2: Angles and Parallel Lines Day Classwork Homework Friday 9/15 Unit 1 Test Monday 9/18 Tuesday 9/19 Angle Relationships HW 2.1 Angle Relationships with Transversals HW 2.2 Wednesday 9/20

More information

Math 2B Linear Algebra Test 2 S13 Name Write all responses on separate paper. Show your work for credit.

Math 2B Linear Algebra Test 2 S13 Name Write all responses on separate paper. Show your work for credit. Math 2B Linear Algebra Test 2 S3 Name Write all responses on separate paper. Show your work for credit.. Construct a matrix whose a. null space consists of all combinations of (,3,3,) and (,2,,). b. Left

More information

CSE 333 Lecture server sockets

CSE 333 Lecture server sockets CSE 333 Lecture 15 -- server sockets Steve Gribble Department of Computer Science & Engineering University of Washington Administrivia HW3 out later this week We will have 2 exercises this week - today

More information

CS 4800: Algorithms & Data. Lecture 1 January 10, 2017

CS 4800: Algorithms & Data. Lecture 1 January 10, 2017 CS 4800: Algorithms & Data Lecture 1 January 10, 2017 Huy L. Nguyen Email: hu.nguyen@northeastern.edu Office hours: Tuesday 1:20 3:20, WVH 358 Research: Algorithms for massive data sets ( big data ) Theoretical

More information

Lecture 15: The subspace topology, Closed sets

Lecture 15: The subspace topology, Closed sets Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology

More information

Week 2. Monday: 1.1. Tuesday: 1.2. Wednesday: 1.3. Thursday: Catch up Friday: 1.4 Monday: OFF Tuesday: 1.5. Problem Solving, Patterns, Induction

Week 2. Monday: 1.1. Tuesday: 1.2. Wednesday: 1.3. Thursday: Catch up Friday: 1.4 Monday: OFF Tuesday: 1.5. Problem Solving, Patterns, Induction Monday: 1.1 Week 2 Problem Solving, Patterns, Induction Tuesday: 1.2 Geometry Basics Wednesday: 1.3 Segments and Measuring Thursday: Catch up Friday: 1.4 Monday: OFF Tuesday: 1.5 1 Mindfulness Training

More information

Math (Spring 2009): Lecture 5 Planes. Parametric equations of curves and lines

Math (Spring 2009): Lecture 5 Planes. Parametric equations of curves and lines Math 18.02 (Spring 2009): Lecture 5 Planes. Parametric equations of curves and lines February 12 Reading Material: From Simmons: 17.1 and 17.2. Last time: Square Systems. Word problem. How many solutions?

More information

Notes slides from before lecture. CSE 21, Winter 2017, Section A00. Lecture 9 Notes. Class URL:

Notes slides from before lecture. CSE 21, Winter 2017, Section A00. Lecture 9 Notes. Class URL: Notes slides from before lecture CSE 21, Winter 2017, Section A00 Lecture 9 Notes Class URL: http://vlsicad.ucsd.edu/courses/cse21-w17/ Notes slides from before lecture Notes February 8 (1) HW4 is due

More information

CHAPTER 5 SYSTEMS OF EQUATIONS. x y

CHAPTER 5 SYSTEMS OF EQUATIONS. x y page 1 of Section 5.1 CHAPTER 5 SYSTEMS OF EQUATIONS SECTION 5.1 GAUSSIAN ELIMINATION matrix form of a system of equations The system 2x + 3y + 4z 1 5x + y + 7z 2 can be written as Ax where b 2 3 4 A [

More information

Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel. 1. Axioms for a finite AFFINE plane of order n.

Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel. 1. Axioms for a finite AFFINE plane of order n. Math 532, 736I: Modern Geometry Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel Part 1: 1. Axioms for a finite AFFINE plane of order n. AA1: There exist at least 4 points, no

More information

Physics 2660: Fundamentals of Scientific Computing. Lecture 5 Instructor: Prof. Chris Neu

Physics 2660: Fundamentals of Scientific Computing. Lecture 5 Instructor: Prof. Chris Neu Physics 2660: Fundamentals of Scientific Computing Lecture 5 Instructor: Prof. Chris Neu (chris.neu@virginia.edu) Reminder I am back! HW04 due Thursday 22 Feb electronically by noon HW grades are coming.

More information

Programming Karel the Robot

Programming Karel the Robot Programming Karel the Robot Announcements Five Handouts Today: Honor Code Downloading Eclipse Running Karel Programs in Eclipse Programming Assignment #1 Submitting Programming Assignments Please only

More information

IE 5531: Engineering Optimization I

IE 5531: Engineering Optimization I IE 5531: Engineering Optimization I Lecture 3: Linear Programming, Continued Prof. John Gunnar Carlsson September 15, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 15, 2010

More information

AMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.

AMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12. AMS 550.47/67: Graph Theory Homework Problems - Week V Problems to be handed in on Wednesday, March : 6, 8, 9,,.. Assignment Problem. Suppose we have a set {J, J,..., J r } of r jobs to be filled by a

More information

Lecture 12. Data Types and Strings

Lecture 12. Data Types and Strings Lecture 12 Data Types and Strings Class v. Object A Class represents the generic description of a type. An Object represents a specific instance of the type. Video Game=>Class, WoW=>Instance Members of

More information

Some announcements. Game reflections deadline extended to Monday (4/4)

Some announcements. Game reflections deadline extended to Monday (4/4) Symmetry Some announcements Game reflections deadline extended to Monday (4/4) Some announcements Game reflections deadline extended to Monday (4/4) Next math talk on Wednesday (4/6) at 4pm. Speaker is

More information

On Unbounded Tolerable Solution Sets

On Unbounded Tolerable Solution Sets Reliable Computing (2005) 11: 425 432 DOI: 10.1007/s11155-005-0049-9 c Springer 2005 On Unbounded Tolerable Solution Sets IRENE A. SHARAYA Institute of Computational Technologies, 6, Acad. Lavrentiev av.,

More information

The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs

The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs Frankie Smith Nebraska Wesleyan University fsmith@nebrwesleyan.edu May 11, 2015 Abstract We will look at how to represent

More information

Lecture 3: Convex sets

Lecture 3: Convex sets Lecture 3: Convex sets Rajat Mittal IIT Kanpur We denote the set of real numbers as R. Most of the time we will be working with space R n and its elements will be called vectors. Remember that a subspace

More information

CS 173, Running Time Analysis, Counting, and Dynamic Programming. Tandy Warnow

CS 173, Running Time Analysis, Counting, and Dynamic Programming. Tandy Warnow CS 173, Running Time Analysis, Counting, and Dynamic Programming Tandy Warnow CS 173 September 25, 2018 Tandy Warnow Today Topics: Results from survey Midterm Very basic counting Analyzing running times

More information

Math 5593 Linear Programming Lecture Notes

Math 5593 Linear Programming Lecture Notes Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................

More information

Linear Equations in Linear Algebra

Linear Equations in Linear Algebra 1 Linear Equations in Linear Algebra 1.2 Row Reduction and Echelon Forms ECHELON FORM A rectangular matrix is in echelon form (or row echelon form) if it has the following three properties: 1. All nonzero

More information

CS7540 Spectral Algorithms, Spring 2017 Lecture #2. Matrix Tree Theorem. Presenter: Richard Peng Jan 12, 2017

CS7540 Spectral Algorithms, Spring 2017 Lecture #2. Matrix Tree Theorem. Presenter: Richard Peng Jan 12, 2017 CS7540 Spectral Algorithms, Spring 2017 Lecture #2 Matrix Tree Theorem Presenter: Richard Peng Jan 12, 2017 DISCLAIMER: These notes are not necessarily an accurate representation of what I said during

More information

Using Variables to Write Pattern Rules

Using Variables to Write Pattern Rules Using Variables to Write Pattern Rules Goal Use numbers and variables to represent mathematical relationships. 1. a) What stays the same and what changes in the pattern below? b) Describe the pattern rule

More information

EECS 203 Lecture 20. More Graphs

EECS 203 Lecture 20. More Graphs EECS 203 Lecture 20 More Graphs Admin stuffs Last homework due today Office hour changes starting Friday (also in Piazza) Friday 6/17: 2-5 Mark in his office. Sunday 6/19: 2-5 Jasmine in the UGLI. Monday

More information

} Evaluate the following expressions: 1. int x = 5 / 2 + 2; 2. int x = / 2; 3. int x = 5 / ; 4. double x = 5 / 2.

} Evaluate the following expressions: 1. int x = 5 / 2 + 2; 2. int x = / 2; 3. int x = 5 / ; 4. double x = 5 / 2. Class #10: Understanding Primitives and Assignments Software Design I (CS 120): M. Allen, 19 Sep. 18 Java Arithmetic } Evaluate the following expressions: 1. int x = 5 / 2 + 2; 2. int x = 2 + 5 / 2; 3.

More information

Error-Detecting and Error-Correcting Codes

Error-Detecting and Error-Correcting Codes Error-Detecting and Error-Correcting Codes In this set of exercises, a method for detecting and correcting errors made in the transmission of encoded messages is constructed. It will turn out that abstract

More information

Math 414 Lecture 2 Everyone have a laptop?

Math 414 Lecture 2 Everyone have a laptop? Math 44 Lecture 2 Everyone have a laptop? THEOREM. Let v,...,v k be k vectors in an n-dimensional space and A = [v ;...; v k ] v,..., v k independent v,..., v k span the space v,..., v k a basis v,...,

More information

SFU CMPT Lecture: Week 8

SFU CMPT Lecture: Week 8 SFU CMPT-307 2008-2 1 Lecture: Week 8 SFU CMPT-307 2008-2 Lecture: Week 8 Ján Maňuch E-mail: jmanuch@sfu.ca Lecture on June 24, 2008, 5.30pm-8.20pm SFU CMPT-307 2008-2 2 Lecture: Week 8 Universal hashing

More information

Unit 5 Test 2 MCC5.G.1 StudyGuide/Homework Sheet

Unit 5 Test 2 MCC5.G.1 StudyGuide/Homework Sheet Unit 5 Test 2 MCC5.G.1 StudyGuide/Homework Sheet Tuesday, February 19, 2013 (Crosswalk Coach Page 221) GETTING THE IDEA! An ordered pair is a pair of numbers used to locate a point on a coordinate plane.

More information

Lesson 9: An Application of Linear Equations

Lesson 9: An Application of Linear Equations Classwork Exercises 1. Write the equation for the 15 th step. 2. How many people would see the photo after 15 steps? Use a calculator if needed. S.30 3. Marvin paid an entrance fee of $5 plus an additional

More information

LP Geometry: outline. A general LP. minimize x c T x s.t. a T i. x b i, i 2 M 1 a T i x = b i, i 2 M 3 x j 0, j 2 N 1. where

LP Geometry: outline. A general LP. minimize x c T x s.t. a T i. x b i, i 2 M 1 a T i x = b i, i 2 M 3 x j 0, j 2 N 1. where LP Geometry: outline I Polyhedra I Extreme points, vertices, basic feasible solutions I Degeneracy I Existence of extreme points I Optimality of extreme points IOE 610: LP II, Fall 2013 Geometry of Linear

More information

Math 395: Topology. Bret Benesh (College of Saint Benedict/Saint John s University)

Math 395: Topology. Bret Benesh (College of Saint Benedict/Saint John s University) Math 395: Topology Bret Benesh (College of Saint Benedict/Saint John s University) October 30, 2012 ii Contents Acknowledgments v 1 Topological Spaces 1 2 Closed sets and Hausdorff spaces 7 iii iv CONTENTS

More information

Introduction to Computers and Programming

Introduction to Computers and Programming Introduction to Computers and Programming Prof. I. K. Lundqvist Lecture 8 Reading: FK pp. 115-151 Sept 17 2003 Type A set of values A set of primitive operations Grouped into classes based on the similarity

More information

Simplified Operating Instructions T105-C / T108-C / T106-C / T17B-C DISPLAYS DAY OR DAY BLOCK PROG 00:0000 PROG PROG ALWAYS OFF

Simplified Operating Instructions T105-C / T108-C / T106-C / T17B-C DISPLAYS DAY OR DAY BLOCK PROG 00:0000 PROG PROG ALWAYS OFF Button Operations Simplified Operating Instructions T105-C / T108-C / T106-C / T17B-C R - Reset (with pen or other pointed instrument). Y - Enters function setup. +/- Buttons to scroll through icons. Y

More information

Integrated Math 1 Module 3 Honors Sequences and Series Ready, Set, Go! Homework

Integrated Math 1 Module 3 Honors Sequences and Series Ready, Set, Go! Homework 1 Integrated Math 1 Module 3 Honors Sequences and Series Ready, Set, Go! Homework Adapted from The Mathematics Vision Project: Scott Hendrickson, Joleigh Honey, Barbara Kuehl, Travis Lemon, Janet Sutorius

More information

The Polyhedral Model (Dependences and Transformations)

The Polyhedral Model (Dependences and Transformations) The Polyhedral Model (Dependences and Transformations) Announcements HW3 is due Wednesday February 15 th, tomorrow Project proposal is due NEXT Friday, extension so that example with tool is possible Today

More information

Geometry Agenda. Week 1.6 Objective Grade. Lines and Angles. Practice. Angles Formed by Parallel Lines Practice Proving Lines Parallel.

Geometry Agenda. Week 1.6 Objective Grade. Lines and Angles. Practice. Angles Formed by Parallel Lines Practice Proving Lines Parallel. Name Period Geometry Agenda Week 1.6 Objective Grade Monday September 26, Tuesday September 27, Wednesday September 28, Thursday September 29, Friday September 30, Lines and Angles Practice Angles Formed

More information

Math 20A lecture 10 The Gradient Vector

Math 20A lecture 10 The Gradient Vector Math 20A lecture 10 p. 1/12 Math 20A lecture 10 The Gradient Vector T.J. Barnet-Lamb tbl@brandeis.edu Brandeis University Math 20A lecture 10 p. 2/12 Announcements Homework five posted, due this Friday

More information

Summer School: Mathematical Methods in Robotics

Summer School: Mathematical Methods in Robotics Summer School: Mathematical Methods in Robotics Part IV: Projective Geometry Harald Löwe TU Braunschweig, Institute Computational Mathematics 2009/07/16 Löwe (TU Braunschweig) Math. robotics 2009/07/16

More information

: Dimension. Lecturer: Barwick. Wednesday 03 February 2016

: Dimension. Lecturer: Barwick. Wednesday 03 February 2016 18.06.01: Dimension Lecturer: Barwick Wednesday 03 February 2016 What is dimension? Line segments are 1-dimensional; here s one now: Planar regions are 2-dimensional; here s one: Finally, cubes are 3-dimensional:

More information

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Question 1. Incidence matrix with gaps Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 2016 www-m10.ma.tum.de/projektivegeometriess16

More information

CSE115 / CSE503 Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall Office hours:

CSE115 / CSE503 Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall Office hours: CSE115 / CSE503 Introduction to Computer Science I Dr. Carl Alphonce 343 Davis Hall alphonce@buffalo.edu Office hours: Tuesday 10:00 AM 12:00 PM * Wednesday 4:00 PM 5:00 PM Friday 11:00 AM 12:00 PM OR

More information

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 208 https://www-m0.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for

More information

CS483 Design and Analysis of Algorithms

CS483 Design and Analysis of Algorithms CS483 Design and Analysis of Algorithms Lecture 9 Decompositions of Graphs Instructor: Fei Li lifei@cs.gmu.edu with subject: CS483 Office hours: STII, Room 443, Friday 4:00pm - 6:00pm or by appointments

More information

Math 10C, Lecture 7. Daniel Smith

Math 10C, Lecture 7. Daniel Smith Math 10C, Lecture 7 Daniel Smith 2016-08-17 First things first Write-ups have been graded! Check TritonEd. See me if your function was not excellent. Homework will be like last week. The next part of the

More information

Claims Management - Delay analysis Online Workshop. Week No. 1: concept of claims

Claims Management - Delay analysis Online Workshop. Week No. 1: concept of claims Online Workshop Week No. 1: concept of claims Presented by : Hany Ismail, MSc, PMP Workshop Concept Online Workshop Course Duration. Course PDU s. Course weekly Schedule. Wednesday New Lecture by Instructor

More information

OPEN RECORDS DATA RETRIEVAL

OPEN RECORDS DATA RETRIEVAL Gibb, Abb From: Sent: To: Subject: < > Tuesday, November 07, 2017 3:56 PM Gibb, Abby Re: RTK Request - Building Permit Records Thank you very much for helping with my request in July (please see correspondence

More information

Inverse and Implicit functions

Inverse and Implicit functions CHAPTER 3 Inverse and Implicit functions. Inverse Functions and Coordinate Changes Let U R d be a domain. Theorem. (Inverse function theorem). If ϕ : U R d is differentiable at a and Dϕ a is invertible,

More information

Functions 3.6. Fall Math (Math 1010) M / 13

Functions 3.6. Fall Math (Math 1010) M / 13 Functions 3.6 Fall 2013 - Math 1010 (Math 1010) M 1010 3.6 1 / 13 Roadmap 3.6 - Functions: Relations, Functions 3.6 - Evaluating Functions, Finding Domains and Ranges (Math 1010) M 1010 3.6 2 / 13 3.6

More information

Problem Set 2 Solutions

Problem Set 2 Solutions Design and Analysis of Algorithms February, 01 Massachusetts Institute of Technology 6.046J/18.410J Profs. Dana Moshkovitz and Bruce Tidor Handout 8 Problem Set Solutions This problem set is due at 9:00pm

More information

Graphs. Data Structures and Algorithms CSE 373 SU 18 BEN JONES 1

Graphs. Data Structures and Algorithms CSE 373 SU 18 BEN JONES 1 Graphs Data Structures and Algorithms CSE 373 SU 18 BEN JONES 1 Warmup Discuss with your neighbors: Come up with as many kinds of relational data as you can (data that can be represented with a graph).

More information

Maximum flow problem CE 377K. March 3, 2015

Maximum flow problem CE 377K. March 3, 2015 Maximum flow problem CE 377K March 3, 2015 Informal evaluation results 2 slow, 16 OK, 2 fast Most unclear topics: max-flow/min-cut, WHAT WILL BE ON THE MIDTERM? Most helpful things: review at start of

More information

Introduction to Denotational Semantics. Brutus Is An Honorable Man. Class Likes/Dislikes Survey. Dueling Semantics

Introduction to Denotational Semantics. Brutus Is An Honorable Man. Class Likes/Dislikes Survey. Dueling Semantics Brutus Is An Honorable Man HW2 will not be due today. Homework X+1 will never be due until after I have returned Homework X to you. Normally this is never an issue, but I was sick yesterday and was hosting

More information

Example. Section: PS 709 Examples of Calculations of Reduced Hours of Work Last Revised: February 2017 Last Reviewed: February 2017 Next Review:

Example. Section: PS 709 Examples of Calculations of Reduced Hours of Work Last Revised: February 2017 Last Reviewed: February 2017 Next Review: Following are three examples of calculations for MCP employees (undefined hours of work) and three examples for MCP office employees. Examples use the data from the table below. For your calculations use

More information

Introduction to Sets and Logic (MATH 1190)

Introduction to Sets and Logic (MATH 1190) Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set

More information

Managing Administrator Preferences

Managing Administrator Preferences Managing Administrator Preferences Purpose This lesson shows you how to use Grid Control to manage administrator preferences. Topics This module will discuss the following topics: Overview Prerequisites

More information

Schedule/BACnet Schedule

Schedule/BACnet Schedule Object Dictionary 1 Schedule/BACnet Schedule Introduction Note: The Johnson Controls Schedule object is considered a BACnet Schedule object because it supports BACnet functionality. In addition, this object

More information

Math 183 Statistical Methods

Math 183 Statistical Methods Math 183 Statistical Methods Eddie Aamari S.E.W. Assistant Professor eaamari@ucsd.edu math.ucsd.edu/~eaamari/ AP&M 5880A 1 / 24 Math 183 Statistical Methods Eddie Aamari S.E.W. Assistant Professor eaamari@ucsd.edu

More information

CprE 281: Digital Logic

CprE 281: Digital Logic CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Binary Numbers CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative

More information

A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS

A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS HEMANT D. TAGARE. Introduction. Shape is a prominent visual feature in many images. Unfortunately, the mathematical theory

More information

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance

More information

Harvard School of Engineering and Applied Sciences CS 152: Programming Languages

Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Lecture 19 Tuesday, April 3, 2018 1 Introduction to axiomatic semantics The idea in axiomatic semantics is to give specifications

More information

Before We Begin. Introduction to Computer Use II. Overview (1): Winter 2005 (Section M) CSE 1530 Winter Bill Kapralos.

Before We Begin. Introduction to Computer Use II. Overview (1): Winter 2005 (Section M) CSE 1530 Winter Bill Kapralos. Winter 2005 (Section M) Topic B: Variables, Data Types and Expressions Wednesday, January 25 2006 CSE 1530, Winter 2006, Overview (1): Before We Begin Some administrative details Some questions to consider

More information

Popmoney FAQs. What is Popmoney?

Popmoney FAQs. What is Popmoney? Popmoney FAQs What is Popmoney? Popmoney is an innovative personal payment service that eliminates the hassles of checks and cash. Now, sending money is as easy as emailing and texting. And, you don't

More information

Lecture 1: Overview

Lecture 1: Overview 15-150 Lecture 1: Overview Lecture by Stefan Muller May 21, 2018 Welcome to 15-150! Today s lecture was an overview that showed the highlights of everything you re learning this semester, which also meant

More information

Unit 1 Review Scavenger Hunt.notebook September 25, 2013 Name: Hour:

Unit 1 Review Scavenger Hunt.notebook September 25, 2013 Name: Hour: Name: Hour: Unit 1 Scavenger Hunt Review Equations and Scatter Plot a) b) a) b) A) LT 1: I can write, solve, & check equations that represent real world situations. Write the following as an equation.

More information

Week 3 Web site:

Week 3 Web site: Week 3 Web site: https://pages.cs.wisc.edu/~deppeler/cs400/ (announcements and resources) Canvas: https://canvas.wisc.edu/ (modules, assignments, grades) Top Hat join code: X-Team Exercise #1: (in-class

More information

Solutions to Midterm 2 - Monday, July 11th, 2009

Solutions to Midterm 2 - Monday, July 11th, 2009 Solutions to Midterm - Monday, July 11th, 009 CPSC30, Summer009. Instructor: Dr. Lior Malka. (liorma@cs.ubc.ca) 1. Dynamic programming. Let A be a set of n integers A 1,..., A n such that 1 A i n for each

More information

Answers to practice questions for Midterm 1

Answers to practice questions for Midterm 1 Answers to practice questions for Midterm Paul Hacking /5/9 (a The RREF (reduced row echelon form of the augmented matrix is So the system of linear equations has exactly one solution given by x =, y =,

More information

Principles of Software Construction: Objects, Design, and Concurrency. The Perils of Concurrency Can't live with it. Cant live without it.

Principles of Software Construction: Objects, Design, and Concurrency. The Perils of Concurrency Can't live with it. Cant live without it. Principles of Software Construction: Objects, Design, and Concurrency The Perils of Concurrency Can't live with it. Cant live without it. Spring 2014 Charlie Garrod Christian Kästner School of Computer

More information

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 25: Review and Open Problems

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 25: Review and Open Problems CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 25: Review and Open Problems Course Overview Programming Concepts Object-Oriented Programming Interfaces

More information

Physics 2660: Fundamentals of Scientific Computing. Lecture 7 Instructor: Prof. Chris Neu

Physics 2660: Fundamentals of Scientific Computing. Lecture 7 Instructor: Prof. Chris Neu Physics 2660: Fundamentals of Scientific Computing Lecture 7 Instructor: Prof. Chris Neu (chris.neu@virginia.edu) Reminder HW06 due Thursday 15 March electronically by noon HW grades are starting to appear!

More information

Lesson 11.1 Dilations

Lesson 11.1 Dilations Lesson 11.1 Dilations Key concepts: Scale Factor Center of Dilation Similarity A A dilation changes the size of a figure. B C Pre Image: 1 A A' B C Pre Image: B' C' Image: What does a dilation NOT change?

More information

Lesson 2: Solving for Unknown Angles Using Equations

Lesson 2: Solving for Unknown Angles Using Equations Classwork Opening Exercise Two lines meet at a point. In a complete sentence, describe the relevant angle relationships in the diagram. Find the values of r, s, and t. r 25 s t Example 1 Two lines meet

More information

User Authentication. Daniel Halperin Tadayoshi Kohno

User Authentication. Daniel Halperin Tadayoshi Kohno CSE 484 / CSE M 584 (Autumn 2011) User Authentication Daniel Halperin Tadayoshi Kohno Thanks to Dan Boneh, Dieter Gollmann, John Manferdelli, John Mitchell, Vitaly Shmatikov, Bennet Yee, and many others

More information

Regarding Python level necessary for the course

Regarding Python level necessary for the course Logistics First two recitations (next two weeks) Python basics (installation, basic syntax, basic programming), optional Making models for 3D printing w/ Blender Will announce details through Sakai Regarding

More information

Chapter 4 Concepts from Geometry

Chapter 4 Concepts from Geometry Chapter 4 Concepts from Geometry An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Line Segments The line segment between two points and in R n is the set of points on the straight line joining

More information

mykpc Notifications Proactive Notifications

mykpc Notifications Proactive Notifications With the goal in mind of delivering your project on-time, Kingery Printing has integrated a unique system of notifications into mykpc, our on-line client console. Through mykpc notifications, we can collaborate

More information

Buford High School CURRICULUM CALENDAR

Buford High School CURRICULUM CALENDAR Week 1 Thursday, 8/4 Syllabus Strategies for success and classroom expectations Friday, 8/5 Algebra diagnostic Determine skills of students Rules, Syllabus, Books and Introductions Recommend including

More information