Matrix Multiplication
|
|
- Theodora Reeves
- 5 years ago
- Views:
Transcription
1 Matrix Multiplication Given two vectors a = [a 1,..., a k ] and b = [b 1,..., b k ], their inner product (or dot product) is a b = k i=1 a ib i [1, 2, 3] [ 2, 4, 6] = (1 2) + (2 4) + (3 6) = 24. We can multiply an n m matrix A = [a ij ] by an m k matrix B = [b ij ], to get an n k matrix C = [c ij ]: c ij = m r=1 a ir b rj this is the inner product of the ith row of A with the jth column of B 1
2 = = (2 3) + (3 4) + (1 1) = (2, 3, 1) (3, 4, 1) 18 = (2 7) + (3 2) + (1 2) = (2, 3, 1) (7, 2, 2) 39 = (5 3) + (7 4) + (4 1) = (5, 7, 4) (3, 4, 1) 41 = (5 7) + (7 2) + (4 2) = (5, 7, 4) (7, 2, 2) 2
3 Why is multiplication defined in this strange way? Because it s useful! Suppose Thus, z 1 z 2 z 1 = 2y 1 + 3y 2 + y 3 y 1 = 3x 1 + 7x 2 z 2 = 5y 1 + 7y 2 + 4y 3 y 2 = 4x 1 + 2x 2 y 3 = x 1 2x 2 = y 1 y 2 y 3 and y 1 y 2 y 3 = Suppose we want to express the z s in terms of the x s: z 1 = 2y 1 + 3y 2 + y 3 = 2(3x 1 + 7x 2 ) + 3(4x 1 + 2x 2 ) + ( x 1 2x 2 ) = ( ( 1))x 1 + ( ( 2))x 2 = 17x x 2 Similarly, z 2 = 39x x 2. z 1 z 2 = x 1 x 2. x 1 x 2. 3
4 Algorithms An algorithm is a recipe for solving a problem. In the book, a particular language is used for describing algorithms. You need to learn the language well enough to read the examples You need to learn to express your solution to a problem algorithmically and unambiguously YOU DO NOT NEED TO LEARN IN DETAIL ALL THE IDIOSYNCRACIES OF THE PARTICULAR LANGUAGE USED IN THE BOOK. You will not be tested on it, nor will most of the questions in homework use it I suggest you skim Chapter 1; I won t cover it 4
5 Methods of Proof One way of proving things is by induction. That s coming next. What if you can t use induction? Typically you re trying to prove a statement like Given X, prove (or show that) Y. This means you have to prove X Y In the proof, you re allowed to assume X, and then show that Y is true, using X. A special case: if there is no X, you just have to prove Y or true Y. Alternatively, you can do a proof by contradiction: Assume that Y is false, and show that X is false. This amounts to proving Y X 5
6 Example Theorem n is odd iff (in and only if) n 2 is odd, for n Z. Proof: We have to show 1. n odd n 2 odd 2. n 2 odd n odd For (1), if n is odd, it is of the form 2k + 1. Hence, Thus, n 2 is odd. n 2 = 4k 2 + 4k + 1 = 2(2k 2 + 2k) + 1 For (2), we proceed by contradiction. Suppose n 2 is odd and n is even. Then n = 2k for some k, and n 2 = 4k 2. Thus, n 2 is even. This is a contradiction. Thus, n must be odd. 6
7 A Proof By Contradiction Theorem: 2 is irrational. Proof: By contradiction. Suppose 2 is rational. Then 2 = a/b for some a, b N +. We can assume that a/b is in lowest terms. Therefore, a and b can t both be even. Squaring both sides, we get 2 = a 2 /b 2 Thus, a 2 = 2b 2, so a 2 is even. This means that a must be even. Suppose a = 2c. Then a 2 = 4c 2. Thus, 4c 2 = 2b 2, so b 2 = 2c 2. This means that b 2 is even, and hence so is b. Contradiction! Thus, 2 must be irrational. 7
8 Induction This is perhaps the most important technique we ll learn for proving things. Idea: To prove that a statement is true for all natural numbers, show that it is true for 1 (base case or basis step) and show that if it is true for n, it is also true for n + 1 (inductive step). The base case does not have to be 1; it could be 0, 2, 3,... If the base case is k, then you are proving the statement for all n k. It is sometimes quite difficult to formulate the statement to prove. IN THIS COURSE, I WILL BE VERY FUSSY ABOUT THE FORMULATION OF THE STATEMENT TO PROVE. YOU MUST STATE IT VERY CLEARLY. I WILL ALSO BE PICKY ABOUT THE FORM OF THE INDUC- TIVE PROOF. 8
9 Writing Up a Proof by Induction 1. State the hypothesis very clearly: Let P (n) be the (English) statement... [some statement involving n] 2. The basis step P (k) holds because... [where k is the base case, usually 0 or 1] 3. Inductive step Assume P (n). We prove P (n + 1) holds as follows... Thus, P (n) P (n + 1). 4. Conclusion Thus, we have shown by induction that P (n) holds for all n k (where k was what you used for your basis step). [It s not necessary to always write the conclusion explicitly.] 9
10 A Simple Example Theorem: For all positive integers n, n k=1 k = n(n + 1). 2 Proof: By induction. Let P (n) be the statement n k=1 k = n(n + 1). 2 Basis: P (1) asserts that 1 k=1 k = 1(1+1) 2. Since the LHS and RHS are both 1, this is true. Inductive step: Assume P (n). We prove P (n + 1). Note that P (n + 1) is the statement n+1 k=1 k = (n + 1)(n + 2). 2 n+1 k=1 k = n k=1 k + (n + 1) = n(n+1) 2 + (n + 1)[Induction hypothesis] = n(n+1)+2(n+1) 2 = (n+1)(n+2) 2 Thus, P (n) implies P (n + 1), so the result is true by induction. 10
11 Notes: You can write P (n) = instead of writing Induction hypothesis at the end of the line, or you can write P (n) at the end of the line. Whatever you write, make sure it s clear when you re applying the induction hypothesis Notice how we rewrite n+1 k=1 k so as to be able to appeal to the induction hypothesis. This is standard operating procedure. 11
12 Another example Theorem: (1+x) n 1+nx for all nonnegative integers n and all x 1. (Take 0 0 = 1.) Proof: By induction on n. Let P (n) be the statement (1 + x) n 1 + nx. Basis: P (0) says (1 + x) 0 1. This is clearly true. Inductive Step: Assume P (n). We prove P (n + 1). (1 + x) n+1 = (1 + x) n (1 + x) (1 + nx)(1 + x)[induction hypothesis] = 1 + nx + x + nx 2 = 1 + (n + 1)x + nx (n + 1)x Why does this argument fail if x < 1? 12
13 Towers of Hanoi Problem: Move all the rings from pole 1 and pole 2, moving one ring at a time, and never having a larger ring on top of a smaller one. How do we solve this? Think recursively! Suppose you could solve it for n 1 rings? How could you do it for n? 13
14 Solution Move top n 1 rings from pole 1 to pole 3 (we can do this by assumption) Pretend largest ring isn t there at all Move largest ring from pole 1 to pole 2 Move top n 1 rings from pole 3 to pole 2 (we can do this by assumption) Again, pretend largest ring isn t there This solution translates to a recursive algorithm: Suppose robot(r s) is a command to a robot to move the top ring on pole r to pole s Note that if r, s {1, 2, 3}, then 6 r s is the other number in the set procedure H(n, r, s) [Move n disks from r to s] if n = 1 then robot(r s) else H(n 1, r, 6 r s) robot(r s) H(n 1, 6 r s, s) endif return endpro 14
15 Towers of Hanoi: Analysis Theorem: It takes 2 n 1 moves to perform H(n, r, s), for all positive n, and all r, s {1, 2, 3}. Proof: Let P (n) be the statement It takes 2 n 1 moves to perform H(n, r, s) and all r, s {1, 2, 3}. Note that for all positive n is not part of P (n)! P (n) is a statement about a particular n. If it were part of P (n), what would P (1) be? Basis: P (1) is immediate: robot(r s) is the only move in H(1, r, s), and = 1. Inductive step: Assume P (n). To perform H(n+1, r, s), we first do H(n, r, 6 r s), then robot(r s), then H(n, 6 r s, s). Altogether, this takes 2 n n 1 = 2 n+1 1 steps. 15
16 A Matching Lower Bound Theorem: Any algorithm to move n rings from pole r to pole s requires at least 2 n 1 steps. Proof: By induction, taking the statement of the theorem to be P (n). Basis: Easy: Clearly it requires (at least) 1 step to move 1 ring from pole r to pole s. Inductive step: Assume P (n). Suppose you have a sequence of steps to move n + 1 rings from r to s. There s a first time and a last time you move ring n + 1: Let k be the first time Let k be the last time. Possibly k = k (if you only move ring n + 1 once) Suppose at step k, you move ring n + 1 from pole r to pole s. You can t assume that s = s, although this is optimal. 16
17 Key point: The top n rings have to be on the third pole, 6 r s Otherwise, you couldn t move ring n + 1 from r to s. By P (n), it took at least 2 n 1 moves to get the top n rings to pole 6 r s. At step k, the last time you moved ring n + 1, suppose you moved it from pole r to s (it has to end up at s). the other n rings must be on pole 6 r s. By P (n), it takes at least 2 n 1 moves to get them to ring s (where they have to end up). So, altogether, there are at least 2(2 n 1) + 1 = 2 n+1 1 moves in your sequence: at least 2 n 1 moves before step k at least 2 n 1 moves after step k step k itself. If course, if k k (that is, if you move ring n + 1 more than once) there are even more moves in your sequence. 17
18 Strong Induction Sometimes when you re proving P (n + 1), you want to be able to use P (j) for j n, not just P (n). You can do this with strong induction. 1. Let P (n) be the statement... [some statement involving n] 2. The basis step P (k) holds because... [where k is the base case, usually 0 or 1] 3. Inductive step Assume P (k),..., P (n) holds. We show P (n + 1) holds as follows... Although strong induction looks stronger than induction, it s not. Anything you can do with strong induction, you can also do with regular induction, by appropriately modifying the induction hypothesis. If P (n) is the statement you re trying to prove by strong induction, let P (n) be the statement P (1),..., P (n) hold. Proving P (n) by regular induction is the same as proving P (n) by strong induction. 18
19 An example using strong induction Theorem: Any item costing n > 7 kopecks can be bought using only 3-kopeck and 5-kopeck coins. Proof: Using strong induction. Let P (n) be the statement that n kopecks can be paid using 3-kopeck and 5- kopeck coins, for n 8. Basis: P (8) is clearly true since 8 = Inductive step: Assume P (8),..., P (n) is true. We want to show P (n + 1). If n + 1 is 9 or 10, then it s easy to see that there s no problem (P (9) is true since 9 = , and P (10) is true since 10 = 5 + 5). Otherwise, note that (n + 1) 3 = n 2 8. Thus, P (n 2) is true, using the induction hypothesis. This means we can use 3- and 5-kopeck coins to pay for something costing n 2 kopecks. One more 3-kopeck coin pays for something costing n + 1 kopecks. 19
20 Bubble Sort Suppose we wanted to sort n items. Here s one way to do it: Input n [number of items to be sorted] w 1,..., w n [items] Algorithm BubbleSort for i = 1 to n 1 for j = 1 to n i if w j > w j+1 then switch(w j, w j+1 ) endif endfor endfor Why is this right: Intuitively, because largest elements bubble up to the top How many comparisons? Best case, worst case, average case all the same: (n 1) + (n 2) = n(n 1)/2 20
21 Proving Bubble Sort Correct We want to show that the algorithm is correct by induction. What s the statement of the induction? Could take P (n) to be the statement: works correctly for n inputs. the algorithm That turns out to be a tough induction statement to work with. Suppose P (1) is true. How do you prove P (2)? A better choice: P (k) is the statement that, if there are n inputs and k n 1, then after k iterations of the outer loop, w n k+1,..., w n are the k largest items, sorted in the right order. Note that P (k) is vacuously true if k n. Basis: How do we prove P (1)? By a nested induction! This time, take Q(l) to be the statement that, if l n 1, then after l iterations of the inner loop, w l+1 > w j, for j = 1,..., l. Basis: Q(1) holds because after the first iteration of the inner loop, w 2 > w 1 (thanks to the switch statement). 21
22 Inductive step: Suppose that Q(l) is true. If l+1 n 1, then Q(l + 1) is vacuously true. If l + 1 < n, by Q(l), we know that w l+1 > w j, for j = 1,..., l after l iterations. The (l + 1)st iteration of the inner loop compares w l+1 and w l+2. After the (l + 1)st iteration, the bigger one is w l+2. Thus, w l+2 > w l+1. By the induction hypothesis, w l+2 > w j, for j + 1,..., l. That completes the nested induction. Thus, Q(l) holds for all l. Q(n 1) says that w n > w j for j = 1,..., n 1. That s just what P (1) says. So we re done with the base case of the main induction. [Note: For a really careful proof, we need better notation (for value of w l before and after the switch).] Inductive step (for main induction): Assume P (k). Thus, w k+1,..., w n are the k largest items. To prove P (k + 1), we use nested induction again: Now Q(l) says if i = k + 1, then if l n (k + 1), after l iterations of the inner loop, w l+1 > w j, for j = 1,..., l. Almost the same as before, except that instead of saying if l n 1, we say if l n (k + 1). If i = k + 1, we go through the inner loop only n (k + 1) times. 22
23 Q(n k 1) says that, after the (k +1)st iteration of the inner loop, w n k > w j for j = 1,..., k. P (k) says that the top k elements are w n k+1,..., w n, in that order. Thus, the top k + 1 elements must be w n k,... w n, in that order. This proves P (k + 1). Note that P (n 1) says that after n 1 iterations of the outer loop (which is all there are), the top n 1 elements are w 2,..., w n. So w 1 has to be the smallest element, and w 1, w 2,..., w n is a sorted list. 23
Another Proof By Contradiction: 2 is Irrational
Another Proof By Contradiction: 2 is Irrational Theorem: 2 is irrational. Proof: By contradiction. Suppose 2 is rational. Then 2 = a/b for some a, b N +. We can assume that a/b is in lowest terms. Therefore,
Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 013 Vazirani Note 1 Induction Induction is a basic, powerful and widely used proof technique. It is one of the most common techniques for analyzing
MI 4 Mathematical Induction Name. Mathematical Induction
Mathematical Induction It turns out that the most efficient solution to the Towers of Hanoi problem with n disks takes n 1 moves. If this isn t the formula you determined, make sure to check your data
Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
Mathematical Induction
Mathematical Induction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Mathematical Induction Fall 2014 1 / 21 Outline 1 Mathematical Induction 2 Strong Mathematical
Discrete Math, Spring Solutions to Problems V
Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose
CS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques
CS 30, Winter 2011 Morphology of Proof: An introduction to rigorous proof techniques 1 Methodology of Proof An example Deep down, all theorems are of the form If A then B, though they may be expressed
One-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
Induction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2
Induction 0-8-08 Induction is used to prove a sequence of statements P(), P(), P(3),... There may be finitely many statements, but often there are infinitely many. For example, consider the statement ++3+
Preparing for the CS 173 (A) Fall 2018 Midterm 1
Preparing for the CS 173 (A) Fall 2018 Midterm 1 1 Basic information Midterm 1 is scheduled from 7:15-8:30 PM. We recommend you arrive early so that you can start exactly at 7:15. Exams will be collected
Lecture 12 : Recurrences DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/1/2011 Lecture 12 : Recurrences Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last few classes we talked about program correctness. We
Discrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction
CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 3 This lecture covers further variants of induction, including strong induction and the closely related wellordering axiom. We then apply these
Reading and Writing. Mathematical Proofs. Slides by Arthur van Goetham
Reading and Writing Mathematical Proofs Slides by Arthur van Goetham What is a proof? Why explanations are not proofs What is a proof? A method for establishing truth What establishes truth depends on
HOW TO WRITE PROOFS. Dr. Min Ru, University of Houston
HOW TO WRITE PROOFS Dr. Min Ru, University of Houston One of the most difficult things you will attempt in this course is to write proofs. A proof is to give a legal (logical) argument or justification
Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
Day 6. Tuesday May 29, We continue our look at basic proofs. We will do a few examples of different methods of proving.
Day 6 Tuesday May 9, 01 1 Basic Proofs We continue our look at basic proofs. We will do a few examples of different methods of proving. 1.1 Proof Techniques Recall that so far in class we have made two
Basics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On
Basics of Proofs The Putnam is a proof based exam and will expect you to write proofs in your solutions Similarly, Math 96 will also require you to write proofs in your homework solutions If you ve seen
Recursion: Introduction and Correctness
Recursion: Introduction and Correctness CSE21 Winter 2017, Day 7 (B00), Day 4-5 (A00) January 25, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Today s Plan From last time: intersecting sorted lists and
M17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
Section 4.2: Mathematical Induction 1
Section 4.: Mathematical Induction 1 Over the next couple of sections, we shall consider a method of proof called mathematical induction. Induction is fairly complicated, but a very useful proof technique,
Lecture 10: Powers of Matrices, Difference Equations
Lecture 10: Powers of Matrices, Difference Equations Difference Equations A difference equation, also sometimes called a recurrence equation is an equation that defines a sequence recursively, i.e. each
MATH 135 Fall 2006 Proofs, Part IV
MATH 135 Fall 006 s, Part IV We ve spent a couple of days looking at one particular technique of proof: induction. Let s look at a few more. Direct Here we start with what we re given and proceed in a
Some Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
Proof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
Mathematical Induction
Mathematical Induction Let s motivate our discussion by considering an example first. What happens when we add the first n positive odd integers? The table below shows what results for the first few values
Data Structure Lecture#4: Mathematical Preliminaries U Kang Seoul National University
Data Structure Lecture#4: Mathematical Preliminaries U Kang Seoul National University U Kang 1 In This Lecture Set concepts and notation Logarithms Summations Recurrence Relations Recursion Induction Proofs
Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all
Properties of Arithmetic
Excerpt from "Prealgebra" 205 AoPS Inc. 4 6 7 4 5 8 22 23 5 7 0 Arithmetic is being able to count up to twenty without taking o your shoes. Mickey Mouse CHAPTER Properties of Arithmetic. Why Start with
CS 124 Math Review Section January 29, 2018
CS 124 Math Review Section CS 124 is more math intensive than most of the introductory courses in the department. You re going to need to be able to do two things: 1. Perform some clever calculations to
MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics
MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics Class Meetings: MW 9:30-10:45 am in EMS E424A, September 3 to December 10 [Thanksgiving break November 26 30; final
4.1 Induction: An informal introduction
Chapter 4 Induction and Recursion 4.1 Induction: An informal introduction This section is intended as a somewhat informal introduction to The Principle of Mathematical Induction (PMI): a theorem that establishes
Numerical Methods Lecture 2 Simultaneous Equations
Numerical Methods Lecture 2 Simultaneous Equations Topics: matrix operations solving systems of equations pages 58-62 are a repeat of matrix notes. New material begins on page 63. Matrix operations: Mathcad
1. (16 points) Circle T if the corresponding statement is True or F if it is False.
Name Solution Key Show All Work!!! Page 1 1. (16 points) Circle T if the corresponding statement is True or F if it is False. T F The sequence {1, 1, 1, 1, 1, 1...} is an example of an Alternating sequence.
Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
Lecture 3: Big-O and Big-Θ
Lecture 3: Big-O and Big-Θ COSC4: Algorithms and Data Structures Brendan McCane Department of Computer Science, University of Otago Landmark functions We saw that the amount of work done by Insertion Sort,
, p 1 < p 2 < < p l primes.
Solutions Math 347 Homework 1 9/6/17 Exercise 1. When we take a composite number n and factor it into primes, that means we write it as a product of prime numbers, usually in increasing order, using exponents
Mathematical Background
Chapter 1 Mathematical Background When we analyze various algorithms in terms of the time and the space it takes them to run, we often need to work with math. That is why we ask you to take MA 2250 Math
Summer HSSP Lecture Notes Week 1. Lane Gunderman, Victor Lopez, James Rowan
Summer HSSP Lecture Notes Week 1 Lane Gunderman, Victor Lopez, James Rowan July 6, 014 First Class: proofs and friends 1 Contents 1 Glossary of symbols 4 Types of numbers 5.1 Breaking it down...........................
Evolving a New Feature for a Working Program
Evolving a New Feature for a Working Program Mike Stimpson arxiv:1104.0283v1 [cs.ne] 2 Apr 2011 January 18, 2013 Abstract A genetic programming system is created. A first fitness function f 1 is used to
Divisibility = 16, = 9, = 2, = 5. (Negative!)
Divisibility 1-17-2018 You probably know that division can be defined in terms of multiplication. If m and n are integers, m divides n if n = mk for some integer k. In this section, I ll look at properties
Searching Algorithms. CSE21 Winter 2017, Day 3 (B00), Day 2 (A00) January 13, 2017
Searching Algorithms CSE21 Winter 2017, Day 3 (B00), Day 2 (A00) January 13, 2017 Selection Sort (MinSort) Pseudocode Rosen page 203, exercises 41-42 procedure selection sort(a 1, a 2,..., a n : real numbers
a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
Properties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
Numerical Methods Lecture 2 Simultaneous Equations
CGN 42 - Computer Methods Numerical Methods Lecture 2 Simultaneous Equations Topics: matrix operations solving systems of equations Matrix operations: Adding / subtracting Transpose Multiplication Adding
What is proof? Lesson 1
What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might
Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way
EECS 16A Designing Information Devices and Systems I Fall 018 Lecture Notes Note 1 1.1 Introduction to Linear Algebra the EECS Way In this note, we will teach the basics of linear algebra and relate it
WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
An analogy from Calculus: limits
COMP 250 Fall 2018 35 - big O Nov. 30, 2018 We have seen several algorithms in the course, and we have loosely characterized their runtimes in terms of the size n of the input. We say that the algorithm
A Brief Introduction to Proofs
A Brief Introduction to Proofs William J. Turner October, 010 1 Introduction Proofs are perhaps the very heart of mathematics. Unlike the other sciences, mathematics adds a final step to the familiar scientific
PROBLEM SET 3: PROOF TECHNIQUES
PROBLEM SET 3: PROOF TECHNIQUES CS 198-087: INTRODUCTION TO MATHEMATICAL THINKING UC BERKELEY EECS FALL 2018 This homework is due on Monday, September 24th, at 6:30PM, on Gradescope. As usual, this homework
In N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
Groups. s t or s t or even st rather than f(s,t).
Groups Definition. A binary operation on a set S is a function which takes a pair of elements s,t S and produces another element f(s,t) S. That is, a binary operation is a function f : S S S. Binary operations
1 True/False. Math 10B with Professor Stankova Worksheet, Discussion #9; Thursday, 2/15/2018 GSI name: Roy Zhao
Math 10B with Professor Stankova Worksheet, Discussion #9; Thursday, 2/15/2018 GSI name: Roy Zhao 1 True/False 1. True False When we solve a problem one way, it is not useful to try to solve it in a second
At the start of the term, we saw the following formula for computing the sum of the first n integers:
Chapter 11 Induction This chapter covers mathematical induction. 11.1 Introduction to induction At the start of the term, we saw the following formula for computing the sum of the first n integers: Claim
REVIEW PROBLEMS FOR SECOND 3200 MIDTERM
REVIEW PROBLEMS FOR SECOND 3200 MIDTERM PETE L. CLARK 1)a) State Euclid s Lemma (the one involving prime numbers and divisibility). b) Use Euclid s Lemma to show that 3 1/5 and 5 1/3 are both irrational.
Proofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
Answers in blue. If you have questions or spot an error, let me know. 1. Find all matrices that commute with A =. 4 3
Answers in blue. If you have questions or spot an error, let me know. 3 4. Find all matrices that commute with A =. 4 3 a b If we set B = and set AB = BA, we see that 3a + 4b = 3a 4c, 4a + 3b = 3b 4d,
Mathematical Induction Assignments
1 Mathematical Induction Assignments Prove the Following using Principle of Mathematical induction 1) Prove that for any positive integer number n, n 3 + 2 n is divisible by 3 2) Prove that 1 3 + 2 3 +
Inference and Proofs (1.6 & 1.7)
EECS 203 Spring 2016 Lecture 4 Page 1 of 9 Introductory problem: Inference and Proofs (1.6 & 1.7) As is commonly the case in mathematics, it is often best to start with some definitions. An argument for
Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction
Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction
Truth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
MATH10040: Numbers and Functions Homework 1: Solutions
MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3
Lecture 4: Constructing the Integers, Rationals and Reals
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 4: Constructing the Integers, Rationals and Reals Week 5 UCSB 204 The Integers Normally, using the natural numbers, you can easily define
Lecture 5: Loop Invariants and Insertion-sort
Lecture 5: Loop Invariants and Insertion-sort COMS10007 - Algorithms Dr. Christian Konrad 11.01.2019 Dr. Christian Konrad Lecture 5: Loop Invariants and Insertion-sort 1 / 12 Proofs by Induction Structure
CS 4104 Data and Algorithm Analysis. Recurrence Relations. Modeling Recursive Function Cost. Solving Recurrences. Clifford A. Shaffer.
Department of Computer Science Virginia Tech Blacksburg, Virginia Copyright c 2010,2017 by Clifford A. Shaffer Data and Algorithm Analysis Title page Data and Algorithm Analysis Clifford A. Shaffer Spring
1 Sequences and Summation
1 Sequences and Summation A sequence is a function whose domain is either all the integers between two given integers or all the integers greater than or equal to a given integer. For example, a m, a m+1,...,
CS 4104 Data and Algorithm Analysis. CS4014: What You Need to Already Know. CS4104: What We Will Do. Introduction to Problem Solving (1)
Department of Computer Science Virginia Tech Blacksburg, Virginia Copyright c 010,017 by Clifford A. Shaffer Data and Algorithm Analysis Title page Data and Algorithm Analysis Clifford A. Shaffer Spring
Math 291-1: Lecture Notes Northwestern University, Fall 2015
Math 29-: Lecture Notes Northwestern University, Fall 25 Written by Santiago Cañez These are lecture notes for Math 29-, the first quarter of MENU: Intensive Linear Algebra and Multivariable Calculus,
Solution Set 2. Problem 1. [a] + [b] = [a + b] = [b + a] = [b] + [a] ([a] + [b]) + [c] = [a + b] + [c] = [a + b + c] = [a] + [b + c] = [a] + ([b + c])
Solution Set Problem 1 (1) Z/nZ is the set of equivalence classes of Z mod n. Equivalence is determined by the following rule: [a] = [b] if and only if b a = k n for some k Z. The operations + and are
3 Finite continued fractions
MTH628 Number Theory Notes 3 Spring 209 3 Finite continued fractions 3. Introduction Let us return to the calculation of gcd(225, 57) from the preceding chapter. 225 = 57 + 68 57 = 68 2 + 2 68 = 2 3 +
Introducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
PHIL 422 Advanced Logic Inductive Proof
PHIL 422 Advanced Logic Inductive Proof 1. Preamble: One of the most powerful tools in your meta-logical toolkit will be proof by induction. Just about every significant meta-logical result relies upon
1 Direct Proofs Technique Outlines Example Implication Proofs Technique Outlines Examples...
CSE 311: Foundations of Computing I Proof Techniques What Is This? Each of the following is as close as we can get to giving you a template (and a completely worked out example) for every proof technique
Chapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
Infinite Continued Fractions
Infinite Continued Fractions 8-5-200 The value of an infinite continued fraction [a 0 ; a, a 2, ] is lim c k, where c k is the k-th convergent k If [a 0 ; a, a 2, ] is an infinite continued fraction with
Math 1 Variable Manipulation Part 4 Student
Math 1 Variable Manipulation Part 4 Student 1 SOLVING AN EQUATION THAT INCLUDES ABSOLUTE VALUE SIGNS To solve an equation that includes absolute value signs, think about the two different cases-one where
MATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
CS 361 Meeting 26 11/10/17
CS 361 Meeting 26 11/10/17 1. Homework 8 due Announcements A Recognizable, but Undecidable Language 1. Last class, I presented a brief, somewhat inscrutable proof that the language A BT M = { M w M is
LECTURE 1. Logic and Proofs
LECTURE 1 Logic and Proofs The primary purpose of this course is to introduce you, most of whom are mathematics majors, to the most fundamental skills of a mathematician; the ability to read, write, and
MEETING 9 - INDUCTION AND RECURSION
MEETING 9 - INDUCTION AND RECURSION We do some initial Peer Instruction... Predicates Before we get into mathematical induction we will repeat the concept of a predicate. A predicate is a mathematical
Lecture 17: Trees and Merge Sort 10:00 AM, Oct 15, 2018
CS17 Integrated Introduction to Computer Science Klein Contents Lecture 17: Trees and Merge Sort 10:00 AM, Oct 15, 2018 1 Tree definitions 1 2 Analysis of mergesort using a binary tree 1 3 Analysis of
MAT115A-21 COMPLETE LECTURE NOTES
MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes
3.1 Induction: An informal introduction
Chapter 3 Induction and Recursion 3.1 Induction: An informal introduction This section is intended as a somewhat informal introduction to The Principle of Mathematical Induction (PMI): a theorem that establishes
Appendix A. Jargon. A.1 Strange technical terms
Appendix A Jargon Mathematicians write in a dialect of English that differs from everyday English and from formal scientific English. To read and write mathematics fluently, you need to be aware of the
PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms
PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION The Peano axioms The following are the axioms for the natural numbers N. You might think of N as the set of integers {0, 1, 2,...}, but it turns
CS173 Strong Induction and Functions. Tandy Warnow
CS173 Strong Induction and Functions Tandy Warnow CS 173 Introduction to Strong Induction (also Functions) Tandy Warnow Preview of the class today What are functions? Weak induction Strong induction A
In N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
CHAPTER 4 SOME METHODS OF PROOF
CHAPTER 4 SOME METHODS OF PROOF In all sciences, general theories usually arise from a number of observations. In the experimental sciences, the validity of the theories can only be tested by carefully
CS1800: Strong Induction. Professor Kevin Gold
CS1800: Strong Induction Professor Kevin Gold Mini-Primer/Refresher on Unrelated Topic: Limits This is meant to be a problem about reasoning about quantifiers, with a little practice of other skills, too
DR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
Problem Set 5 Solutions
Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true
CS 173: Induction. Madhusudan Parthasarathy University of Illinois at Urbana-Champaign. February 7, 2016
CS 173: Induction Madhusudan Parthasarathy University of Illinois at Urbana-Champaign 1 Induction February 7, 016 This chapter covers mathematical induction, and is an alternative resource to the one in
Proof worksheet solutions
Proof worksheet solutions These are brief, sketched solutions. Comments in blue can be ignored, but they provide further explanation and outline common misconceptions Question 1 (a) x 2 + 4x +12 = (x +
4.3 Minimizing & Mixed Constraints
Mathematics : Mattingly, Fall 6 8 4. Minimizing & Mixed Constraints So far, you have seen how to solve one type of problem: Standard Maximum. The objective function is to be maximized.. Constraints use..
Foundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapter 0 By Dr. Dalia M. Gil, Ph.D. Statement Statement is an ordinary English statement of fact. It has a subject, a verb, and a predicate. It can be assigned a true
Introduction to Logic and Axiomatic Set Theory
Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some
Turing Machines, diagonalization, the halting problem, reducibility
Notes on Computer Theory Last updated: September, 015 Turing Machines, diagonalization, the halting problem, reducibility 1 Turing Machines A Turing machine is a state machine, similar to the ones we have
Discrete Mathematics for CS Spring 2008 David Wagner Note 4
CS 70 Discrete Mathematics for CS Spring 008 David Wagner Note 4 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all natural numbers,
Data Structure Lecture#4: Mathematical Preliminaries U Kang Seoul National University
Data Structure Lecture#4: Mathematical Preliminaries U Kang Seoul National University U Kang 1 In This Lecture Set Concepts and Notation Relation Logarithm and Summations Recurrence Relations Recursion